On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye. On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. In Venkatesan Guruswami, editor, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA. Volume 287 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

@inproceedings{HenzingerSSY24,
  title = {On the Complexity of Algorithms with Predictions for Dynamic Graph Problems},
  author = {Monika Henzinger and Barna Saha and Martin P. Seybold and Christopher Ye},
  year = {2024},
  doi = {10.4230/LIPIcs.ITCS.2024.62},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.62},
  researchr = {https://researchr.org/publication/HenzingerSSY24},
  cites = {0},
  citedby = {0},
  booktitle = {15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA},
  editor = {Venkatesan Guruswami},
  volume = {287},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-309-6},
}