Sándor Kisfaludi-Bak

According to our database, Sándor Kisfaludi-Bak authored at least 31 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

An ETH-Tight Exact Algorithm for Euclidean TSP.

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay

SIAM J. Comput., June, 2023

Clique-Based Separators for Geometric Intersection Graphs.

Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous

Algorithmica, June, 2023

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.

Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki

CoRR, 2023

A Quadtree for Hyperbolic Space.

Sándor Kisfaludi-Bak, Geert van Wordragen

CoRR, 2023

2022

Online search for a hyperplane in high-dimensional Euclidean space.

Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior

Inf. Process. Lett., 2022

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification.

Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma

CoRR, 2022

Computing List Homomorphisms in Geometric Intersection Graphs.

Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods.

Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Computing Smallest Convex Intersecting Polygons.

Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs.

Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian

Proceedings of the 38th International Symposium on Computational Geometry, 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

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

A quasi-polynomial algorithm for well-spaced hyperbolic TSP.

Sándor Kisfaludi-Bak

J. Comput. Geom., 2021

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.

Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

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 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

Euclidean TSP in Narrow Strip.

Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak

CoRR, 2020

Hyperbolic intersection graphs and (quasi)-polynomial time.

Sándor Kisfaludi-Bak

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Euclidean TSP in Narrow Strips.

Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs.

Mark de Berg, Sándor Kisfaludi-Bak

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

The complexity of Dominating Set in geometric intersection graphs.

Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger

Theor. Comput. Sci., 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 Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms.

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak

Algorithmica, 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

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On One-Round Discrete Voronoi Games.

Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On Geometric Set Cover for Orthants.

Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

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

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

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

The Homogeneous Broadcast Problem in Narrow and Wide Strips.

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

The Dominating Set Problem in Geometric Intersection Graphs.

Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs.

Sándor Kisfaludi-Bak, Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2014

Notes on dual-critical graphs.

Zoltán Király, Sándor Kisfaludi-Bak

CoRR, 2014