Tung Anh, Vu
I am currently on a temporary break since November 2025. I am still reachable at the contacts below.
Please feel free to contact me regarding anything that I might help with: research, refereeing, teaching, organizing conferences, giving some talks, etc.
I'm a Ph.D. student at the Computer Science Institute, Faculty of Mathematics and Physics, Charles University. I'm very fortunate to be advised by Martin Koutecký. My research interests include integer programming, computational complexity, and computational social choice.
Contacts
- Email address: tung at iuuk.mff.cuni.cz.
- Snail mail address: Room S322, Charles University, Faculty of Mathematics and Physics, Computer Science Institute, Malostranské nám. 25, 118 00, Praha 1, Czech Republic
- ORCID: 0000-0002-8902-5196.
Publications
-
Generalized k-Center: Distinguishing Doubling and Highway Dimension
- arXiv
- Algorithmica (soon)
- WG 2022 (slides)
- HALG 2023
- Extended slides
-
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
-
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
Talks
-
On the Arrangement of Hyperplanes Determined by n Points
Awards
- Prize of Jirka Matoušek 2023 for the work "Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters"
Teaching
Winter semester 2025/2026
- Probablistic techniques: tutorial (co-taught with Tomas Hons).
- Introduction to Parameterized Algorithms: tutorial (co-taught with Martin Korecek).
More teaching can be found in the archive.
Links
- Slides for my master's thesis defense.
- My fine grained complexity lecture notes (NTIN085, winter semester 2020/2021). Watch out, it's a huge archive (almost 100 MB) of pictures.
- Hollywood rummy.