Calum MacRury

Jingwei Zhang

CoRR, 2024

2023

The Phase Transition of Discrepancy in Random Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Algorithms for p-Faulty Search on a Half-Line.

[BibT_eX]

[DOI]

Konstantinos Georgiou

Algorithmica, August, 2023

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds.

[BibT_eX]

[DOI]

CoRR, 2023

Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals.

[BibT_eX]

[DOI]

Will Ma

CoRR, 2023

Online Bipartite Matching in the Probe-Commit Model.

[BibT_eX]

[DOI]

CoRR, 2023

Extending Wormald's Differential Equation Method to One-sided Bounds.

[BibT_eX]

[DOI]

Patrick Bennett

CoRR, 2023

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.

[BibT_eX]

[DOI]

Will Ma

Nathaniel Grammel

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Perfect Matchings in the Semirandom Graph Process.

[BibT_eX]

[DOI]

Pu Gao

SIAM J. Discret. Math., 2022

Hamilton cycles in the semi-random graph process.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Localization game for random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Sharp Thresholds in Adaptive Random Graph Processes.

[BibT_eX]

[DOI]

Erlang Surya

CoRR, 2022

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.

[BibT_eX]

[DOI]

Pu Gao

Proceedings of the Approximation, 2022

Prophet Matching in the Probe-Commit Model.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

Probabilistic zero forcing on random graphs.

[BibT_eX]

[DOI]

Sean English

Eur. J. Comb., 2021

Perfect Matchings in the Semi-random Graph Process.

[BibT_eX]

[DOI]

Pu Gao

CoRR, 2021

Prophet Inequality Matching Meets Probing with Commitment.

[BibT_eX]

[DOI]

CoRR, 2021

Secretary Matching Meets Probing with Commitment.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

2020

Greedy Approaches to Online Stochastic Matching.

[BibT_eX]

[DOI]

CoRR, 2020

Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models.

[BibT_eX]

[DOI]

CoRR, 2020

Probabilistically Faulty Searching on a Half-Line.

[BibT_eX]

[DOI]

Konstantinos Georgiou

CoRR, 2020

Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).

[BibT_eX]

[DOI]

Konstantinos Georgiou

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2018

The robot crawler graph process.

[BibT_eX]

[DOI]

Rita M. del Río-Chanona

Discret. Appl. Math., 2018

Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2015

The Robot Crawler Number of a Graph.

[BibT_eX]

[DOI]