Follow
Sándor Kisfaludi-Bak
Sándor Kisfaludi-Bak
Verified email at aalto.fi - Homepage
Title
Cited by
Cited by
Year
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
M de Berg, HL Bodlaender, S Kisfaludi-Bak, D Marx, TC Zanden
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
232018
An ETH-tight exact algorithm for Euclidean TSP
M de Berg, HL Bodlaender, S Kisfaludi-Bak, S Kolay
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
222018
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
M De Berg, HL Bodlaender, S Kisfaludi-Bak, D Marx, TC Van Der Zanden
SIAM Journal on Computing 49 (6), 1291-1331, 2020
132020
The complexity of dominating set in geometric intersection graphs
M de Berg, S Kisfaludi-Bak, G Woeginger
Theoretical Computer Science 769, 18-31, 2019
132019
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces
S Kisfaludi-Bak, J Nederlof, EJ Leeuwen
ACM Transactions on Algorithms (TALG) 16 (3), 1-30, 2020
112020
Hyperbolic intersection graphs and (quasi)-polynomial time
S Kisfaludi-Bak
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
82020
On one-round discrete Voronoi games
M De Berg, S Kisfaludi-Bak, M Mehr
arXiv preprint arXiv:1902.09234, 2019
62019
On the exact complexity of Hamiltonian cycle and q-colouring in disk graphs
S Kisfaludi-Bak, TC Zanden
International Conference on Algorithms and Complexity, 369-380, 2017
62017
ETH-tight algorithms for geometric network problems
S Kisfaludi-Bak
English. PhD thesis. Technische Universiteit Eindhoven, Department of …, 2019
42019
On geometric set cover for orthants
K Bringmann, S Kisfaludi-Bak, M Pilipczuk, EJ van Leeuwen
27th Annual European Symposium on Algorithms (ESA 2019), 2019
42019
A Gap-ETH-tight approximation scheme for Euclidean TSP
S Kisfaludi-Bak, J Nederlof, K Węgrzycki
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
32022
Online search for a hyperplane in high-dimensional Euclidean space
A Antoniadis, R Hoeksma, S Kisfaludi-Bak, K Schewior
Information processing letters 177, 106262, 2022
22022
Lower bounds for dominating set in ball graphs and for weighted dominating set in unit-ball graphs
M Berg, S Kisfaludi-Bak
Treewidth, Kernels, and Algorithms, 31-48, 2020
22020
How does object fatness impact the complexity of packing in d dimensions?
S Kisfaludi-Bak, D Marx, TC Van Der Zanden
arXiv preprint arXiv:1909.12044, 2019
22019
On the number of touching pairs in a set of planar curves
P Györgyi, B Hujter, S Kisfaludi-Bak
Computational Geometry 67, 29-37, 2018
22018
Connected dominating set in unit-disk graphs is W[1]-hard
M de Berg, H Bodlaender, S Kisfaludi-Bak
EuroCG 2016, 2016
22016
A succinct tree coding for greedy navigation
Z Király, S Kisfaludi-Bak
Egervry Research Group, 2015
22015
Clique-based separators for geometric intersection graphs
M de Berg, S Kisfaludi-Bak, M Monemizadeh, L Theocharous
arXiv preprint arXiv:2109.09874, 2021
12021
Euclidean TSP in Narrow Strip
H Alkema, M de Berg, S Kisfaludi-Bak
arXiv preprint arXiv:2003.09948, 2020
12020
A quasi-polynomial algorithm for well-spaced hyperbolic TSP
S Kisfaludi-Bak
arXiv preprint arXiv:2002.05414, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20