Notes on dual-critical graphs. - Zoltán Király; Sándor Kisfaludi-Bak (CoRR, 2014)

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. - Sándor Kisfaludi-Bak; Tom C. van der Zanden (CIAC, 2017)

The Dominating Set Problem in Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Gerhard J. Woeginger (IPEC, 2017)

The Homogeneous Broadcast Problem in Narrow and Wide Strips. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (WADS, 2017)

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden (STOC, 2018)

On the number of touching pairs in a set of planar curves. - Péter Györgyi; Bálint Hujter; Sándor Kisfaludi-Bak (Comput. Geom., 2018)

On Geometric Set Cover for Orthants. - Karl Bringmann; Sándor Kisfaludi-Bak; Michal Pilipczuk; Erik Jan van Leeuwen (ESA, 2019)

On One-Round Discrete Voronoi Games. - Mark de Berg; Sándor Kisfaludi-Bak; Mehran Mehr (ISAAC, 2019)

How Does Object Fatness Impact the Complexity of Packing in d Dimensions? - Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden (ISAAC, 2019)

The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (Algorithmica, 2019)

The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (Algorithmica, 2019)

The complexity of Dominating Set in geometric intersection graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Gerhard J. Woeginger (Theor. Comput. Sci., 2019)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. - Mark de Berg; Sándor Kisfaludi-Bak (Treewidth, Kernels, and Algorithms, 2020)

Euclidean TSP in Narrow Strips. - Henk Alkema; Mark de Berg; Sándor Kisfaludi-Bak (SoCG, 2020)

Hyperbolic intersection graphs and (quasi)-polynomial time. - Sándor Kisfaludi-Bak (SODA, 2020)

Euclidean TSP in Narrow Strip. - Henk Alkema; Mark de Berg; Sándor Kisfaludi-Bak (CoRR, 2020)

A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden (SIAM J. Comput., 2020)

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. - Sándor Kisfaludi-Bak; Jesper Nederlof; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2020)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. - Sándor Kisfaludi-Bak; Jesper Nederlof; Karol Wegrzycki (FOCS, 2021)

A quasi-polynomial algorithm for well-spaced hyperbolic TSP. - Sándor Kisfaludi-Bak (J. Comput. Geom., 2021)

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; André Nusser; Zahra Parsaeian (SoCG, 2022)

Computing Smallest Convex Intersecting Polygons. - Antonios Antoniadis 001; Mark de Berg; Sándor Kisfaludi-Bak; Antonis Skarlatos (ESA, 2022)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. - Antonios Antoniadis 001; Sándor Kisfaludi-Bak; Bundit Laekhanukit; Daniel Vaz 001 (SWAT, 2022)

Computing List Homomorphisms in Geometric Intersection Graphs. - Sándor Kisfaludi-Bak; Karolina Okrasa; Pawel Rzazewski (WG, 2022)

Online search for a hyperplane in high-dimensional Euclidean space. - Antonios Antoniadis 001; Ruben Hoeksma; Sándor Kisfaludi-Bak; Kevin Schewior (Inf. Process. Lett., 2022)

Dynamic time warping under translation: Approximation guided by space-filling curves. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; Dániel Marx; André Nusser (J. Comput. Geom., 2022)

A Quadtree for Hyperbolic Space. - Sándor Kisfaludi-Bak; Geert van Wordragen (CoRR, 2023)

Clique-Based Separators for Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Morteza Monemizadeh; Leonidas Theocharous (Algorithmica, 2023)

An ETH-Tight Exact Algorithm for Euclidean TSP. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Sudeshna Kolay (SIAM J. Comput., 2023)

Separator Theorem and Algorithms for Planar Hyperbolic Graphs. - Sándor Kisfaludi-Bak; Jana Masaríková; Erik Jan van Leeuwen; Bartosz Walczak; Karol Wegrzycki (SoCG, 2024)

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space. - Sándor Kisfaludi-Bak; Geert van Wordragen (SoCG, 2024)

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. - Esther Galby; Sándor Kisfaludi-Bak; Dániel Marx; Roohani Sharma (ICALP, 2024)

Euclidean TSP in Narrow Strips. - Henk Alkema; Mark de Berg; Remco van der Hofstad; Sándor Kisfaludi-Bak (Discret. Comput. Geom., 2024)

Structure and Independence in Hyperbolic Uniform Disk Graphs. - Thomas Bläsius; Jean-Pierre von der Heydt; Sándor Kisfaludi-Bak; Marcus Wilhelm; Geert van Wordragen (SoCG, 2025)