Peter Kiss
Peter Kiss
Embedded Files
About me
About me
I am a postdoctoral researcher at the University of Vienna, Theory and Applications of Algorithms Research Group advised by Gramoz Goranci. I am the principle investigator of the project Dynamic and sublinear algorithms for local problems, supported by the Austrian Science Fund (FWF) (10.55776/ESP6088024).
I have completed my undergraduate and masters degrees at Worcester College, University of Oxford. I have completed my PhD in computer science at the University of Warwick within the Theory and Fundations group (FOCS) where I was fortunate to be supervised by Sayan Bhattacharya.
peter dot kiss at univie dot ac dot at
peter dot kiss at univie dot ac dot at
Research Interests
Research Interests
My research is primarily focused on dynamic graph algorithms and the approximate maximum matching problem in particular. More recently I have been working on sub-linear algorithms and their applications in the dynamic model. I am very interested in graph theoretical applications of convex optimisation techniques in all models.
Conference Papers
Conference Papers
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML25, spotlight poster, oral presentation)
With Gramoz Goranci, Neel Patel, Martin P. Seybold, Eva Szilagyi and Da Wei Zheng
Deterministic Dynamic Maximal Matching in Sublinear Update Time (STOC25, arXiv)
With Aaron Bernstein, Sayan Bhattacharya and Thatchaphol Saranurak
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs (SODA25, arXiv)
With Sepehr Assadi, Sanjeev Khanna
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs (STOC2024, arXiv)
With Sayan Bhattacharya, Aaron Sidford, David Wajc
Dynamic (1+\epsilon)-Approximate Matching Size in Truly Sublinear Update Time (FOCS2023, arXiv)
With Sayan Bhattacharya, Thatchaphol Saranurak
Presentation at MPI, PPT
Incremental (1+\epsilon)-approximate dynamic matching in poly(1/\epsilon) update time (ESA2023, arXiv)
With Joakim Blikstad
Best Student Paper Award
Sublinear Algorithms for (3/2+\epsilon)-Approximate Matching (STOC2023, arXiv)
With Sayan Bhattacharya, Thatchaphol Saranurak
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time (SODA2023, arXiv)
With Sayan Bhattacharya, Thatchaphol Saranurak, David Wajc
Best Paper Award
Dynamic Algorithms for Linear Programs under Relaxing or Restricting Updates (SODA2023, arXiv)
With Sayan Bhattacharya, Thatchaphol Saranurak
Presentation at ETH oline seminar
Deterministic Dynamic Matching In Worst-Case Update Time (ITCS2022, arXiv)
Best Student Paper Award
Presentation at ITCS2022
Deterministic Rounding of Dynamic Fractional Matchings (ICALP2021, arXiv)
With Sayan Bhattacharya
Best Paper Award (Track A)
Presentation by Sayan Bhattacharya at the DIMAP seminar, Warwick
Journal Papers
Journal Papers
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time (JACM 2024)
With Sayan Bhattacharya, Thatchaphol Saranurak, David Wajc
Deterministic Dynamic Matching In Worst-Case Update Time (Algorithmica 2023)
Phd Thesis
Phd Thesis
Publications outside of TCS
Publications outside of TCS
Deep Learning - based atherosclerotic coronary plaque segmentation on coronary CT angiography (European Radiology 2022)
With Natasa Jávorszky, Bálint Homonnay, Gary Gerstenblith, David Bluemke, Mihály Török, David Celentano, Hong Lai, Shenghan Lai, Márton Kolossváry
Teaching Work
Teaching Work
Senior Graduate Teaching Assistant for CS136 Warwick, Discrete Mathematics and Its Applications (2020 - 2024)
Senior Graduate Teaching Assistant for CS147 Warwick, Discrete Mathematics and Its Applications 2 (2023-2024)
Senior Graduate Teaching Assistant for CS356, Warwick, Approximation and Randomized Algorithms (2020-2023)
Senior Graduate Teaching Assistant for CS260, Warwick, Algorithms (2020-2024)
Senior Graduate Teaching Assistant for CS430/910 Warwick, Foundations of Data Analytics (2023-2024)
Course Editor for Certificate in Artificial Intelligence, Oxford University Department for Continuing Education (2019-2021)
Research Visits/Internships
Research Visits/Internships
- Internship at Google Research, 2023 April-2024 April
- Internship at Max-Planck-Institut für Informatik, 2022 October - 2023 February
Conference/Seminar/Workshop Presentations
Conference/Seminar/Workshop Presentations
STOC2024: Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
FOCS2023, YRM, Google Research theory seminar, Weizman-Warwick workshop, ITTC, MPI theory seminar, HALG2023, DIMACS2023, LMS CS Colloquium, ISTA: Dynamic (1+\epsilon)-Approximate Matching Size in Truly Sublinear Update Time
STOC2023: Sublinear Algorithms for (3/2+\epsilon)-Approximate Matching
SODA2023: Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time, Dynamic Algorithms for Linear Programs under Relaxing or Restricting Updates
ETH theory online seminar, Dogsthul dynamic seminar, SODA2023: Dynamic Algorithms for Linear Programs under Relaxing or Restricting UpdatesYR
ITCS2022, HALG2022: Deterministic Dynamic Matching In Worst-Case Update Time
ICALP2021, WPTCS2022: Deterministic Rounding of Dynamic Fractional Matchings
Page updated
Google Sites
Report abuse