Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kisfaludi-Bak, Sándor
6  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Computing List Homomorphisms in Geometric Intersection Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Kisfaludi-Bak, Sándor ; Okrasa, Karolina ; Rzążewski, Paweł - p. 313-327 , 2022
Link: https://doi.org/10.1007/..
 
?
2

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

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Kisfaludi-Bak, Sandor ; Nederlof, Jesper ; Wegrzycki, Karol - p. 351-362 , 2022
Link: https://doi.org/10.1109/..
 
?
3

Lower Bounds for Dominating Set in Ball Graphs and for Weig..:

, In: Treewidth, Kernels, and Algorithms; Lecture Notes in Computer Science,
de Berg, Mark ; Kisfaludi-Bak, Sándor - p. 31-48 , 2020
Link: https://doi.org/10.1007/..
 
?
4

Hyperbolic intersection graphs and (quasi)-polynomial time:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Kisfaludi-Bak, Sándor - p. 1621-1638 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Nearly ETH-tight algorithms for planar steiner tree with te..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kisfaludi-Bak, Sándor ; Nederlof, Jesper ; van Leeuwen, Erik Jan - p. 1015-1034 , 2019
Link: https://dl.acm.org/doi/1..
 
?
6

A framework for ETH-tight algorithms and lower bounds in ge..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor.. - p. 574-586 , 2018
Link: https://dl.acm.org/doi/1..
 
1-6