Václav Rozhoň
I am a PhD student in the group of Mohsen Ghaffari at ETH, Zurich.
Before coming to ETH, I was advised by Jan Hladký and Diana Piguet.
If you wish to contact me, please use my email [name][surname]@gmail.com
Teaching
Advanced algorithms (teaching assistant, Fall 2019)
Research
My Google Scholar page
-
Václav Rozhoň, Mohsen Ghaffari:
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
[arXiv],
[slides] for Workshop Distributed Graph Algorithms (November 2019),
[slides] for ETH Mittagsseminar (October 2019),
[slides] for Graph theory seminar
(September 2019)
-
Martin Doležal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhoň:
Cut distance identifying graphon parameters over weak* limits
[arXiv],
[slides] for Workshop Graph Limits, March 2018
-
Martin Doležal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhoň:
Relating the cut distance and the weak* topology for graphons
[arXiv]
-
Václav Rozhoň:
A local approach to the Erdős-Sós conjecture
SIAM J. Discrete Math., 33(2), 643–664;
[paper],
[arXiv],
[pdf],
[slides] for
ETH Mittagsseminar (February 2019)
-
Tereza Klimošová, Diana Piguet, Václav Rozhoň:
A version of the Loebl-Komlós-Sós conjecture for skewed trees
[arXiv]
Extended abstract appeared in proceedings of Eurocomb 2017, Electronic Notes in Discrete Mathematics; 61: 743-749 (2017), Proceedings of Eurocomb 2017. [paper], [pdf]
Other reports
-
Study text about probability for high school students (in Czech) [1,2,3]
-
Bachelor thesis. [pdf]
Won first place at SVOČ competition, [slides].
-
Matěj Konečný, Jakub Pekárek, Václav Rozhoň, Štěpán Šimsa: Group isomorphism problem,
[pdf], unpublished