Sándor Kisfaludi-Bak
Zitiert von
Zitiert von
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
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
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
Hyperbolic intersection graphs and (quasi)-polynomial time
S Kisfaludi-Bak
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
The complexity of dominating set in geometric intersection graphs
M de Berg, S Kisfaludi-Bak, G Woeginger
Theoretical Computer Science 769, 18-31, 2019
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
On one-round discrete Voronoi games
M De Berg, S Kisfaludi-Bak, M Mehr
arXiv preprint arXiv:1902.09234, 2019
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
Towards sub-quadratic diameter computation in geometric intersection graphs
K Bringmann, S Kisfaludi-Bak, M Künnemann, A Nusser, Z Parsaeian
arXiv preprint arXiv:2203.03663, 2022
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
Clique-based separators for geometric intersection graphs
M de Berg, S Kisfaludi-Bak, M Monemizadeh, L Theocharous
Algorithmica 85 (6), 1652-1678, 2023
On geometric set cover for orthants
K Bringmann, S Kisfaludi-Bak, M Pilipczuk, EJ van Leeuwen
27th Annual European Symposium on Algorithms, ESA 2019, 26, 2019
ETH-tight algorithms for geometric network problems
S Kisfaludi-Bak
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
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
A quasi-polynomial algorithm for well-spaced hyperbolic TSP
S Kisfaludi-Bak
arXiv preprint arXiv:2002.05414, 2020
A succinct tree coding for greedy navigation
Z Király, S Kisfaludi-Bak
Egervry Research Group, 2015
Euclidean TSP in narrow strips
H Alkema, M de Berg, R van der Hofstad, S Kisfaludi-Bak
Discrete & Computational Geometry, 1-51, 2024
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification
E Galby, S Kisfaludi-Bak, D Marx, R Sharma
arXiv preprint arXiv:2208.06015, 2022
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: Essays Dedicated to Hans L. Bodlaender …, 2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20