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

Euclidean TSP in Narrow Strips:

Alkema, Henk ; de Berg, Mark ; van der Hofstad, Remco.
Discrete & Computational Geometry.  71 (2024)  4 - p. 1456-1506 , 2024
Link: https://doi.org/10.1007/..
 
?
2

An ETH-Tight Exact Algorithm for Euclidean TSP:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor.
SIAM Journal on Computing.  52 (2023)  3 - p. 740-760 , 2023
Link: https://doi.org/10.1137/..
 
?
3

Online search for a hyperplane in high-dimensional Euclidea..:

Antoniadis, Antonios ; Hoeksma, Ruben ; Kisfaludi-Bak, Sándor.
Information Processing Letters.  177 (2022)  - p. 106262 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Clique-Based Separators for Geometric Intersection Graphs:

de Berg, Mark ; Kisfaludi-Bak, Sándor ; Monemizadeh, Morteza.
Algorithmica.  85 (2022)  6 - p. 1652-1678 , 2022
Link: https://doi.org/10.1007/..
 
?
5

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/..
 
?
6

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/..
 
?
7

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/..
 
?
8

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..
 
?
9

Nearly ETH-tight Algorithms for Planar Steiner Tree with Te..:

Kisfaludi-Bak, Sándor ; Nederlof, Jesper ; Leeuwen, Erik Jan van
ACM Transactions on Algorithms.  16 (2020)  3 - p. 1-30 , 2020
Link: https://doi.org/10.1145/..
 
?
10

Nearly ETH-tight Algorithms for Planar Steiner Tree with Te..:

Kisfaludi-Bak, Sándor ; Nederlof, Jesper ; Leeuwen, Erik Jan van
ACM Transactions on Algorithms (TALG).  16 (2020)  3 - p. 1-30 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

A Framework for Exponential-Time-Hypothesis--Tight Algorith..:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor..
SIAM Journal on Computing.  49 (2020)  6 - p. 1291-1331 , 2020
Link: https://doi.org/10.1137/..
 
?
12

The complexity of Dominating Set in geometric intersection ..:

de Berg, Mark ; Kisfaludi-Bak, Sándor ; Woeginger, Gerhard
Theoretical Computer Science.  769 (2019)  - p. 18-31 , 2019
Link: https://doi.org/10.1016/..
 
?
13

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..
 
?
14

The Homogeneous Broadcast Problem in Narrow and Wide Strips..:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor
Algorithmica.  81 (2019)  7 - p. 2963-2990 , 2019
Link: https://doi.org/10.1007/..
 
?
15

The Homogeneous Broadcast Problem in Narrow and Wide Strips..:

Berg, Mark de ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor
Algorithmica.  81 (2019)  7 - p. 2934-2962 , 2019
Link: https://doi.org/10.1007/..
 
1-15