| 2026 | ESA | Shifting Is Optimal Under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes. | Manuel Cceres, Sndor Kisfaludi-Bak, Saeed Odak |
| 2026 | ICALP | Touring a Sequence of Orthogonal Polygons. | Katrin Casel, Sndor Kisfaludi-Bak, Linda Kleist, Jeroen S. K. Lamme, Eunjin Oh, Yanheng Wang |
| 2026 | ICALP | Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane. | Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sndor Kisfaludi-Bak, Hung Le, Da Wei Zheng |
| 2026 | STOC | Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Dniel Marx |
| 2025 | FOCS | Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. | Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sndor Kisfaludi-Bak, Hung Le, Da Wei Zheng |
| 2025 | ISAAC | Realizing Metric Spaces with Convex Obstacles. | Sndor Kisfaludi-Bak, Leonidas Theocharous |
| 2024 | ICALP | Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. | Esther Galby, Sndor Kisfaludi-Bak, Dniel Marx, Roohani Sharma |
| 2022 | ESA | Computing Smallest Convex Intersecting Polygons. | Antonios Antoniadis, Mark de Berg, Sndor Kisfaludi-Bak, Antonis Skarlatos |
| 2022 | WG | Computing List Homomorphisms in Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski |
| 2021 | FOCS | A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. | Sndor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki |
| 2021 | ISAAC | Clique-Based Separators for Geometric Intersection Graphs. | Mark de Berg, Sndor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
| 2020 | SODA | Hyperbolic intersection graphs and (quasi)-polynomial time. | Sndor Kisfaludi-Bak |
| 2019 | ESA | On Geometric Set Cover for Orthants. | Karl Bringmann, Sndor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2019 | ISAAC | On One-Round Discrete Voronoi Games. | Mark de Berg, Sndor Kisfaludi-Bak, Mehran Mehr |
| 2019 | ISAAC | How Does Object Fatness Impact the Complexity of Packing in d Dimensions? | Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2019 | SODA | Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. | Sndor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen |
| 2018 | FOCS | An ETH-Tight Exact Algorithm for Euclidean TSP. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Sudeshna Kolay |
| 2018 | STOC | A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2017 | CIAC | On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. | Sndor Kisfaludi-Bak, Tom C. van der Zanden |
| 2017 | WADS | The Homogeneous Broadcast Problem in Narrow and Wide Strips. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak |