bibliography.bib

@inproceedings{hladik2020complexity,
  title={On the Complexity of a Periodic Scheduling Problem with Precedence Relations},
  author={Hladík, Richard and Minaeva, Anna and Hanzálek, Zdeněk},
  booktitle={International Conference on Combinatorial Optimization and Applications},
  pages={107–124},
  year={2020},
  organization={Springer}
}

@article{sssp,
  title={Universal Optimality of {D}ijkstra via Beyond-Worst-Case Heaps},
  author={Bernhard Haeupler and Richard Hladík and Václav Rozhoň and Robert Tarjan and Jakub Tětek},
  journal={ArXiv},
  year={2023},
  volume={abs/2311.11793},
  url={https://api.semanticscholar.org/CorpusID:265295228},
  note={{\bf Best paper award at FOCS'24} (to appear)}
}

@article{hladik-bp,
  title={Combinatorial Algorithms for Flow Problems. {B}achelor's thesis},
  author={Hladík, Richard},
  year={2021},
  institution={Univerzita Karlova, Matematicko-fyzik{\'a}ln{\'\i} fakulta},
}

@article{supi,
      title={Fast and Simple Sorting Using Partial Information}, 
      author={Bernhard Haeupler and Richard Hladík and John Iacono and Vaclav Rozhon and Robert Tarjan and Jakub Tětek},
      year={2024},
	  journal={ArXiv},
      volume={abs/2404.04552},
}

@article{dp-mst,
      title={Near-Universally-Optimal Differentially Private Minimum Spanning Trees}, 
      author={Richard Hladík and Jakub Tětek},
      year={2024},
	  journal={ArXiv},
      volume={abs/2404.15035},
}
@article{smooth-sensitivity,
      title={Smooth Sensitivity Revisited: Towards Optimality}, 
      author={Richard Hladík and Jakub Tětek},
      year={2024},
	  journal={ArXiv},
      volume={abs/2407.05067},
}
@article{supi-thesis,
  title={Fast and Simple Sorting Using Partial Information. {D}iploma thesis},
  author={Hladík, Richard},
  year={2024},
  school={ETH Zurich}
}