Sándor Kisfaludi-Bak
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
152018
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
92018
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
42020
The complexity of dominating set in geometric intersection graphs
M de Berg, S Kisfaludi-Bak, G Woeginger
Theoretical Computer Science 769, 18-31, 2019
42019
On the exact complexity of Hamiltonian cycle and q-colouring in disk graphs
S Kisfaludi-Bak, TC Van Der Zanden
International Conference on Algorithms and Complexity, 369-380, 2017
42017
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
22019
Connected dominating set in unit-disk graphs is W[1]-hard
M de Berg, H Bodlaender, S Kisfaludi-Bak
EuroCG 2016, 2016
22016
Hyperbolic intersection graphs and (quasi)-polynomial time
S Kisfaludi-Bak
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
12020
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
12019
The homogeneous broadcast problem in narrow and wide strips I: algorithms
M De Berg, HL Bodlaender, S Kisfaludi-Bak
Algorithmica 81 (7), 2934-2962, 2019
12019
The homogeneous broadcast problem in narrow and wide strips II: lower bounds
M de Berg, HL Bodlaender, S Kisfaludi-Bak
Algorithmica 81 (7), 2963-2990, 2019
12019
ETH-tight algorithms for geometric network problems
S Kisfaludi-Bak
Technische Universiteit Eindhoven, 2019
12019
On one-round discrete Voronoi games
M de Berg, S Kisfaludi-Bak, M Mehr
arXiv preprint arXiv:1902.09234, 2019
12019
The dominating set problem in geometric intersection graphs
M De Berg, S Kisfaludi-Bak, G Woeginger
arXiv preprint arXiv:1709.05182, 2017
12017
A succinct tree coding for greedy navigation
Z Király, S Kisfaludi-Bak
Egervry Research Group, 2015
12015
Dual-Critical Graphs–Notes on parity constrained acyclic orientations
Z Király, S Kisfaludi-Bak
EGRES technical report 2012-07, http://bolyai. cs. elte. hu/egres/tr/egres …, 2012
12012
Euclidean TSP in Narrow Strip
H Alkema, M de Berg, S Kisfaludi-Bak
arXiv preprint arXiv:2003.09948, 2020
2020
A quasi-polynomial algorithm for well-spaced hyperbolic TSP
S Kisfaludi-Bak
arXiv preprint arXiv:2002.05414, 2020
2020
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
M de Berg, S Kisfaludi-Bak
Treewidth, Kernels, and Algorithms, 31-48, 2020
2020
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
2018
The system can't perform the operation now. Try again later.
Articles 1–20