Richard Hladík

According to our database, Richard Hladík authored at least 7 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation.

Bernhard Haeupler, Richard Hladík, Shengzhe Wang, Zhijun Zhang

CoRR, September, 2025

Bidirectional Dijkstra's Algorithm is Instance-Optimal.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Fast and Simple Sorting Using Partial Information.

Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Near-Universally-Optimal Differentially Private Minimum Spanning Trees.

Richard Hladík, Jakub Tetek

Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

Smooth Sensitivity Revisited: Towards Optimality.

Richard Hladík, Jakub Tetek

Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

2024

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2020

On the Complexity of a Periodic Scheduling Problem with Precedence Relations.

Richard Hladík, Anna Minaeva, Zdenek Hanzálek

Proceedings of the Combinatorial Optimization and Applications, 2020