| Publication | Date of Publication | Type |
|---|
Partitioning problems via random processes
Journal of the London Mathematical Society. Second Series | 2025-01-08 | Paper |
Climbing up a random subgraph of the hypercube
Electronic Communications in Probability | 2024-12-20 | Paper |
On the chromatic number of powers of subdivisions of graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
| Climbing up a random subgraph of the hypercube | 2023-11-28 | Paper |
A scaling limit for the length of the longest cycle in a sparse random digraph
Random Structures & Algorithms | 2023-10-12 | Paper |
A scaling limit for the length of the longest cycle in a sparse random digraph
Random Structures & Algorithms | 2023-10-12 | Paper |
Finding maximum matchings in random regular graphs in linear expected time
Random Structures & Algorithms | 2023-10-11 | Paper |
| Robust Hamiltonicity in families of Dirac graphs | 2023-09-21 | Paper |
| Extremal, enumerative and probabilistic results on ordered hypergraph matchings | 2023-08-23 | Paper |
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
The Electronic Journal of Combinatorics | 2023-08-18 | Paper |
| Partitioning problems via random processes | 2023-07-12 | Paper |
A note on long cycles in sparse random graphs
The Electronic Journal of Combinatorics | 2023-05-16 | Paper |
| The completion numbers of Hamiltonicity and pancyclicity in random graphs | 2023-04-07 | Paper |
| On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650133 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Constructing Hamilton cycles and perfect matchings efficiently | 2022-09-20 | Paper |
| An improved lower bound on the length of the longest cycle in random graphs | 2022-08-14 | Paper |
| Fast algorithms for solving the Hamilton Cycle problem with high probability | 2021-11-29 | Paper |
| A fast algorithm on average for solving the Hamilton Cycle problem | 2021-11-29 | Paper |
Hamiltonicity of random graphs in the stochastic block model
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
| On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time | 2021-07-07 | Paper |
| Packing Hamilton Cycles in Cores of Random Graphs | 2021-07-07 | Paper |
A scaling limit for the length of the longest cycle in a sparse random graph
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Hamilton cycles in random graphs with minimum degree at least 3: an improved analysis
Random Structures & Algorithms | 2021-01-05 | Paper |
On the connectivity of proper colorings of random graphs and hypergraphs
Random Structures & Algorithms | 2020-10-26 | Paper |
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
Journal of Graph Theory | 2020-07-17 | Paper |
A Ramsey property of random regular and \(k \)-out graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Thresholds in random motif graphs
(available as arXiv preprint) | 2019-07-28 | Paper |
Pattern colored Hamilton cycles in random graphs
SIAM Journal on Discrete Mathematics | 2019-03-20 | Paper |
| Finding perfect matchings in random regular graphs in linear time | 2018-11-27 | Paper |
Connectivity of the k-Out Hypercube
SIAM Journal on Discrete Mathematics | 2018-09-05 | Paper |
Packing directed Hamilton cycles online
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Constraining the clustering transition for colorings of sparse random graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Constraining the clustering transition for colorings of sparse random graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
| On the connectivity threshold for colorings of random graphs and hypergraphs | 2018-03-14 | Paper |
Randomly coloring simple hypergraphs with fewer colors
Information Processing Letters | 2017-06-30 | Paper |
On the chromatic number of powers of subdivisions of graphs
(available as arXiv preprint) | N/A | Paper |
