Tung Anh, Vu
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 computational social choice, integer programming, and computational complexity.
Contacts
- Email address: tung at iuuk.mff.cuni.cz.
- ORCID: 0000-0002-8902-5196.
Publications
-
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
- IPCO 2025 (to appear)
-
Solving Multiagent Path Finding on Highly Centralized Networks
- arXiv
- AAAI 2025 (to appear)
-
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
-
Generalized k-Center: Distinguishing Doubling and Highway Dimension
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
Summer semester 2024/2025
Winter semester 2024/2025
- Probablistic techniques: tutorial.
- Introduction to Parameterized Algorithms: tutorial.
- Introductory mathematics course: systems of equations, analytic geometry.
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.