A skew version of the Loebl-Komlós-Sós conjecture. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Electron. Notes Discret. Math., 2017)

A Local Approach to the Erdös-Sós Conjecture. - Václav Rozhon (SIAM J. Discret. Math., 2019)

k-means++: few more steps yield constant approximation. - Davin Choo; Christoph Grunau; Julian Portmann; Václav Rozhon (ICML, 2020)

Simple and sharp analysis of k-means||. - Václav Rozhon (ICML, 2020)

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Christoph Grunau; Václav Rozhon (PODC, 2020)

Polylogarithmic-time deterministic network decomposition and distributed derandomization. - Václav Rozhon; Mohsen Ghaffari 001 (STOC, 2020)

A version of the Loebl-Komlós-Sós conjecture for skew trees. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Eur. J. Comb., 2020)

The Randomized Local Computation Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Christoph Grunau; Václav Rozhon (PODC, 2021)

Improved Deterministic Network Decomposition. - Mohsen Ghaffari 001; Christoph Grunau; Václav Rozhon (SODA, 2021)

Of Toasts and Tails. - Jan Grebík; Václav Rozhon (CoRR, 2021)

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics. - Jan Grebík; Václav Rozhon (CoRR, 2021)

On Homomorphism Graphs. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2021)

Relating the cut distance and the weak* topology for graphons. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory B, 2021)

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. - Václav Rozhon; Michael Elkin; Christoph Grunau; Bernhard Haeupler (FOCS, 2022)

Adapting k-means Algorithms for Outliers. - Christoph Grunau; Václav Rozhon (ICML, 2022)

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (ITCS, 2022)

The Landscape of Distributed Complexities on Trees and Beyond. - Christoph Grunau; Václav Rozhon; Sebastian Brandt 002 (PODC, 2022)

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. - Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SPAA, 2022)

Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (STOC, 2022)

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (CoRR, 2022)

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2022)

Cut distance identifying graphon parameters over weak* limits. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory A, 2022)

Noisy k-Means++ Revisited. - Christoph Grunau; Ahmet Alper Özüdogru; Václav Rozhon (ESA, 2023)

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. - Mohsen Ghaffari 001; Christoph Grunau; Václav Rozhon (FOCS, 2023)

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. - Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SODA, 2023)

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. - Salwa Faour; Mohsen Ghaffari 001; Christoph Grunau; Fabian Kuhn; Václav Rozhon (SODA, 2023)

A Nearly Tight Analysis of Greedy k-means++. - Christoph Grunau; Ahmet Alper Özüdogru; Václav Rozhon; Jakub Tetek (SODA, 2023)

A Simple Deterministic Distributed Low-Diameter Clustering. - Václav Rozhon; Bernhard Haeupler; Christoph Grunau (SOSA, 2023)

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. - Václav Rozhon; Bernhard Haeupler; Anders Martinsson; Christoph Grunau; Goran Zuzic (STOC, 2023)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Václav Rozhon; Rajesh Jayaram (CoRR, 2023)

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. - Bernhard Haeupler; Richard Hladík; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (FOCS, 2024)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. - Shyam Narayanan; Václav Rozhon; Jakub Tetek; Mikkel Thorup (FOCS, 2024)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Rajesh Jayaram; Václav Rozhon (SODA, 2024)

Invitation to Local Algorithms. - Václav Rozhon (CoRR, 2024)

Local Complexity: New Results and Bridges to Other Fields. - Václav Rozhon (2024)

Fast and Simple Sorting Using Partial Information. - Bernhard Haeupler; Richard Hladík; John Iacono; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (SODA, 2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal. - Bernhard Haeupler; Richard Hladík; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (SOSA, 2025)

Online Locality Meets Distributed Quantum Computing. - Amirreza Akbari; Xavier Coiteux-Roy; Francesco D'Amore 001; François Le Gall; Henrik Lievonen; Darya Melnyk; Augusto Modanese; Shreyas Pai; Marc-Olivier Renou; Václav Rozhon; Jukka Suomela (STOC, 2025)