Sándor Kisfaludi-Bak

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 57

Top Topics

Traveling Salesman

Top Venues

Publications

Henk Alkema, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak
Euclidean TSP in Narrow Strips. Discret. Comput. Geom. 71 (4) (2024)
Sándor Kisfaludi-Bak, Geert van Wordragen
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space. SoCG (2024)
Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG (2024)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP (2024)
Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR (2024)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52 (3) (2023)
Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR (2023)
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85 (6) (2023)
Sándor Kisfaludi-Bak, Geert van Wordragen
A Quadtree for Hyperbolic Space. CoRR (2023)
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177 (2022)
Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
Computing Smallest Convex Intersecting Polygons. CoRR (2022)
Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
Computing Smallest Convex Intersecting Polygons. ESA (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG (2022)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing list homomorphisms in geometric intersection graphs. CoRR (2022)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. SoCG (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing List Homomorphisms in Geometric Intersection Graphs. WG (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. CoRR (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR (2022)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR (2022)
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
Clique-Based Separators for Geometric Intersection Graphs. ISAAC (2021)
Sándor Kisfaludi-Bak
A quasi-polynomial algorithm for well-spaced hyperbolic TSP. J. Comput. Geom. 12 (2) (2021)
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR (2021)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2021)
Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
Clique-Based Separators for Geometric Intersection Graphs. CoRR (2021)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49 (6) (2020)
Sándor Kisfaludi-Bak
A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP. SoCG (2020)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR (2020)
Sándor Kisfaludi-Bak
A quasi-polynomial algorithm for well-spaced hyperbolic TSP. CoRR (2020)
Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
Euclidean TSP in Narrow Strip. CoRR (2020)
Mark de Berg, Sándor Kisfaludi-Bak
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Treewidth, Kernels, and Algorithms (2020)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16 (3) (2020)
Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
Euclidean TSP in Narrow Strips. SoCG (2020)
Sándor Kisfaludi-Bak
Hyperbolic intersection graphs and (quasi)-polynomial time. SODA (2020)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR (2020)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How does object fatness impact the complexity of packing in d dimensions? CoRR (2019)
Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
On One-Round Discrete Voronoi Games. ISAAC (2019)
Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen
On Geometric Set Cover for Orthants. ESA (2019)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica 81 (7) (2019)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA (2019)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. 769 (2019)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica 81 (7) (2019)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC (2019)
Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
On One-Round Discrete Voronoi Games. CoRR (2019)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR (2018)
Sándor Kisfaludi-Bak
Hyperbolic intersection graphs and (quasi)-polynomial time. CoRR (2018)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR (2018)
Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak
On the number of touching pairs in a set of planar curves. Comput. Geom. 67 (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR (2017)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The Dominating Set Problem in Geometric Intersection Graphs. IPEC (2017)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The Dominating Set Problem in Geometric Intersection Graphs. CoRR (2017)
Sándor Kisfaludi-Bak, Tom C. van der Zanden
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. CIAC (2017)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS (2017)
Zoltán Király, Sándor Kisfaludi-Bak
Notes on dual-critical graphs. CoRR (2014)