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

Pu Gao, Calum MacRury, Pawel Pralat. A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{GaoMP22-0,
  title = {A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process},
  author = {Pu Gao and Calum MacRury and Pawel Pralat},
  year = {2022},
  doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.29},
  url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.29},
  researchr = {https://researchr.org/publication/GaoMP22-0},
  cites = {0},
  citedby = {0},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)},
  editor = {Amit Chakrabarti and Chaitanya Swamy},
  volume = {245},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-249-5},
}