Calum MacRury

Nathaniel Grammel

Oper. Res., 2025

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Extending Wormald's differential equation method to one-sided bounds.

[BibT_eX]

[DOI]

Patrick Bennett

Comb. Probab. Comput., 2025

Forward-backward Contention Resolution Schemes for Fair Rationing.

[BibT_eX]

[DOI]

Cliff Stein

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Proportionally Fair Matching via Randomized Rounding.

[BibT_eX]

[DOI]

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention.

[BibT_eX]

[DOI]

Public Transp., June, 2024

Sharp thresholds in adaptive random graph processes.

[BibT_eX]

[DOI]

Erlang Surya

Random Struct. Algorithms, May, 2024

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions.

[BibT_eX]

[DOI]

Jingwei Zhang

CoRR, 2024

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

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities.

[BibT_eX]

[DOI]

Pranav Nuti

Proceedings of the 25th ACM Conference on Economics and Computation, 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

Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes

[BibT_eX]

[DOI]

PhD thesis, 2023

Online Bipartite Matching in the Probe-Commit Model.

[BibT_eX]

[DOI]

CoRR, 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

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]