Sándor Kisfaludi-Bak

Sándor Kisfaludi-Bak

Assistant Professor
Assistant Professor
T313 Dept. Computer Science

I am an assistant professor in the Theoretical Computer Science group (TCS) at Aalto University. I create and analyse algorithms that deal with geometric content, such as points, curves, or shapes, as well as porblems involving spatial networks. My field, computational geometry, is the theoretical basis for several areas, including computer graphics and vision, robot motion planning, computer aided design and manufacturing. I aim to discover many ways of using geometric structure to our advantage when designing algorithms.

Full researcher profile
https://research.aalto.fi/...

Contact information

Publications

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Węgrzycki 2022 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Online search for a hyperplane in high-dimensional Euclidean space

Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior 2022 Information Processing Letters

Clique-Based Separators for Geometric Intersection Graphs

Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous 2021 32nd International Symposium on Algorithms and Computation, ISAAC 2021

Euclidean TSP in narrow strips

Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak 2020 36th International Symposium on Computational Geometry, SoCG 2020

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz 2020 arXiv.org

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 2020 SIAM JOURNAL ON COMPUTING

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

Mark de Berg, Sándor Kisfaludi-Bak 2020 Treewidth, Kernels, and Algorithms

A quasi-polynomial algorithm for well-spaced hyperbolic TSP

Sándor Kisfaludi-Bak 2020 36th International Symposium on Computational Geometry, SoCG 2020

Hyperbolic intersection graphs and (quasi)-polynomial time

Sándor Kisfaludi-Bak 2020 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen 2020 ACM Transactions on Algorithms