| Publication | Date of Publication | Type |
|---|
Extending Wormald's differential equation method to one-sided bounds
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
Online bipartite matching in the probe-commit model
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs
Operations Research | 2025-06-05 | Paper |
Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds
European Journal of Combinatorics | 2025-03-31 | Paper |
| A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process | 2024-08-22 | Paper |
| Prophet matching in the probe-commit model | 2024-08-22 | Paper |
| On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs | 2024-05-14 | Paper |
Sharp thresholds in adaptive random graph processes
Random Structures & Algorithms | 2024-03-25 | Paper |
| Secretary Matching Meets Probing with Commitment. | 2023-11-20 | Paper |
| Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds | 2023-11-09 | Paper |
| Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals | 2023-10-16 | Paper |
The Phase Transition of Discrepancy in Random Hypergraphs
SIAM Journal on Discrete Mathematics | 2023-09-06 | Paper |
Algorithms for \(p\)-Faulty Search on a half-line
Algorithmica | 2023-08-17 | Paper |
| Online Bipartite Matching in the Probe-Commit Model | 2023-03-15 | Paper |
| Extending Wormald's Differential Equation Method to One-sided Bounds | 2023-02-23 | Paper |
Probabilistically faulty searching on a half-line (extended abstract)
(available as arXiv preprint) | 2022-10-13 | Paper |
Perfect matchings in the semirandom graph process
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
| A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process | 2022-05-04 | Paper |
Localization game for random graphs
Discrete Applied Mathematics | 2022-01-13 | Paper |
Hamilton cycles in the semi-random graph process
European Journal of Combinatorics | 2021-10-28 | Paper |
| Prophet Matching Meets Probing with Commitment | 2021-02-08 | Paper |
Probabilistic zero forcing on random graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Zero-forcing in random regular graphs
Journal of Combinatorics | 2021-02-08 | Paper |
| Greedy Approaches to Online Stochastic Matching | 2020-08-20 | Paper |
The robot crawler graph process
Discrete Applied Mathematics | 2018-09-06 | Paper |
The Robot Crawler Number of a Graph
Lecture Notes in Computer Science | 2016-01-08 | Paper |
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
(available as arXiv preprint) | N/A | Paper |
