default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Kisfaludi-Bak
Person information
- affiliation: Aalto University, Espoo, Finland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Henk Alkema
, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. Discret. Comput. Geom. 71(4): 1456-1506 (2024)- [c23]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG 2024: 67:1-67:17 - [c22]Sándor Kisfaludi-Bak, Geert van Wordragen:
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space. SoCG 2024: 68:1-68:15 - [c21]Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP 2024: 67:1-67:19 - [i23]Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen:
Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR abs/2407.09362 (2024) - 2023
- [j11]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85(6): 1652-1678 (2023) - [j10]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52(3): 740-760 (2023) - [i22]Sándor Kisfaludi-Bak, Geert van Wordragen:
A Quadtree for Hyperbolic Space. CoRR abs/2305.01356 (2023) - [i21]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR abs/2310.11283 (2023) - 2022
- [j9]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177: 106262 (2022) - [j8]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic time warping under translation: Approximation guided by space-filling curves. J. Comput. Geom. 14(2): 83-107 (2022) - [c20]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG 2022: 20:1-20:17 - [c19]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian:
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. SoCG 2022: 21:1-21:16 - [c18]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. ESA 2022: 9:1-9:13 - [c17]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022: 10:1-10:21 - [c16]Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
Computing List Homomorphisms in Geometric Intersection Graphs. WG 2022: 313-327 - [i20]Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
Computing list homomorphisms in geometric intersection graphs. CoRR abs/2202.08896 (2022) - [i19]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian:
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. CoRR abs/2203.03663 (2022) - [i18]Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser:
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR abs/2203.07898 (2022) - [i17]Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR abs/2208.06015 (2022) - [i16]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. CoRR abs/2208.07567 (2022) - 2021
- [j7]Sándor Kisfaludi-Bak:
A quasi-polynomial algorithm for well-spaced hyperbolic TSP. J. Comput. Geom. 12(2): 25-54 (2021) - [c15]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS 2021: 351-362 - [c14]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. ISAAC 2021: 22:1-22:15 - [i15]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR abs/2109.04340 (2021) - [i14]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. CoRR abs/2109.09874 (2021) - 2020
- [j6]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49(6): 1291-1331 (2020) - [j5]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16(3): 28:1-28:30 (2020) - [c13]Mark de Berg, Sándor Kisfaludi-Bak:
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Treewidth, Kernels, and Algorithms 2020: 31-48 - [c12]Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. SoCG 2020: 4:1-4:16 - [c11]Sándor Kisfaludi-Bak:
A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP. SoCG 2020: 55:1-55:15 - [c10]Sándor Kisfaludi-Bak:
Hyperbolic intersection graphs and (quasi)-polynomial time. SODA 2020: 1621-1638 - [i13]Sándor Kisfaludi-Bak:
A quasi-polynomial algorithm for well-spaced hyperbolic TSP. CoRR abs/2002.05414 (2020) - [i12]Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strip. CoRR abs/2003.09948 (2020) - [i11]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR abs/2008.12075 (2020) - [i10]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR abs/2011.03778 (2020)
2010 – 2019
- 2019
- [j4]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica 81(7): 2934-2962 (2019) - [j3]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica 81(7): 2963-2990 (2019) - [j2]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. 769: 18-31 (2019) - [c9]Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen:
On Geometric Set Cover for Orthants. ESA 2019: 26:1-26:18 - [c8]Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC 2019: 36:1-36:18 - [c7]Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr:
On One-Round Discrete Voronoi Games. ISAAC 2019: 37:1-37:17 - [c6]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA 2019: 1015-1034 - [i9]Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr:
On One-Round Discrete Voronoi Games. CoRR abs/1902.09234 (2019) - [i8]Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
How does object fatness impact the complexity of packing in d dimensions? CoRR abs/1909.12044 (2019) - 2018
- [j1]Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak:
On the number of touching pairs in a set of planar curves. Comput. Geom. 67: 29-37 (2018) - [c5]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS 2018: 450-461 - [c4]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC 2018: 574-586 - [i7]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR abs/1803.10633 (2018) - [i6]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR abs/1807.06933 (2018) - [i5]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR abs/1811.06871 (2018) - [i4]Sándor Kisfaludi-Bak:
Hyperbolic intersection graphs and (quasi)-polynomial time. CoRR abs/1812.03960 (2018) - 2017
- [c3]Sándor Kisfaludi-Bak, Tom C. van der Zanden:
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. CIAC 2017: 369-380 - [c2]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. IPEC 2017: 14:1-14:12 - [c1]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS 2017: 289-300 - [i3]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR abs/1705.01465 (2017) - [i2]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. CoRR abs/1709.05182 (2017) - 2014
- [i1]Zoltán Király, Sándor Kisfaludi-Bak:
Notes on dual-critical graphs. CoRR abs/1410.1653 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
