Sándor Kisfaludi-Bak

74 papers A* 14A 2B 7C 1Journal 48Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs. CoRR Sándor Kisfaludi-Bak, Dániel Marx
2026	J	`jnl`	Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2026	J	`jnl`	Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity. CoRR Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenkovic, Csaba D. Tóth, Karol Wegrzycki, Sampson Wong
2026	J	`jnl`	Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree. CoRR Sándor Kisfaludi-Bak, Saeed Odak, Satyam Singh, Geert van Wordragen
2026	J	`jnl`	Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak
2026	J	`jnl`	Recognizing Subgraphs of Regular Tilings. CoRR Eliel Ingervo, Sándor Kisfaludi-Bak
2025	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. J. ACM Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2025	J	`jnl`	Computing smallest convex intersecting polygons. J. Comput. Geom. Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2025	J	`jnl`	Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces. CoRR Sándor Kisfaludi-Bak, Geert van Wordragen
2025	B	`conf`	Realizing Metric Spaces with Convex Obstacles. ISAAC Sándor Kisfaludi-Bak, Leonidas Theocharous
2025	J	`jnl`	Realizing Metric Spaces with Convex Obstacles. CoRR Sándor Kisfaludi-Bak, Leonidas Theocharous
2025	J	`jnl`	Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings. CoRR Sándor Kisfaludi-Bak, Tze-Yang Poon, Geert van Wordragen
2025	A*	`conf`	Structure and Independence in Hyperbolic Uniform Disk Graphs. SoCG Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
2025	A*	`conf`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. FOCS Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2025	J	`jnl`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2024	A*	`conf`	A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space. SoCG Sándor Kisfaludi-Bak, Geert van Wordragen
2024	J	`jnl`	A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space. J. Comput. Geom. Sándor Kisfaludi-Bak, Geert van Wordragen
2024	J	`jnl`	Euclidean TSP in Narrow Strips. Discret. Comput. Geom. Henk Alkema, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak
2024	A*	`conf`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2024	J	`jnl`	Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
2024	A*	`conf`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2023	J	`jnl`	A Quadtree for Hyperbolic Space. CoRR Sándor Kisfaludi-Bak, Geert van Wordragen
2023	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2023	J	`jnl`	Clique-Based Separators for Geometric Intersection Graphs. Algorithmica Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2023	J	`jnl`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2022	B	`conf`	Computing List Homomorphisms in Geometric Intersection Graphs. WG Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
2022	A	`conf`	Computing Smallest Convex Intersecting Polygons. ESA Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2022	J	`jnl`	Computing Smallest Convex Intersecting Polygons. CoRR Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2022	J	`jnl`	Computing list homomorphisms in geometric intersection graphs. CoRR Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
2022	A*	`conf`	Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	J	`jnl`	Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	J	`jnl`	Dynamic time warping under translation: Approximation guided by space-filling curves. J. Comput. Geom. Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
2022	—	`conf`	On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
2022	J	`jnl`	Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
2022	J	`jnl`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2022	A*	`conf`	Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. SoCG Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
2022	J	`jnl`	Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. CoRR Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
2021	A*	`conf`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2021	J	`jnl`	A quasi-polynomial algorithm for well-spaced hyperbolic TSP. J. Comput. Geom. Sándor Kisfaludi-Bak
2021	B	`conf`	Clique-Based Separators for Geometric Intersection Graphs. ISAAC Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021	J	`jnl`	Clique-Based Separators for Geometric Intersection Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021	J	`jnl`	Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
2020	J	`jnl`	A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2020	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2020	A*	`conf`	A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP. SoCG Sándor Kisfaludi-Bak
2020	J	`jnl`	A quasi-polynomial algorithm for well-spaced hyperbolic TSP. CoRR Sándor Kisfaludi-Bak
2020	J	`jnl`	Euclidean TSP in Narrow Strip. CoRR Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
2020	A*	`conf`	Euclidean TSP in Narrow Strips. SoCG Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
2020	A*	`conf`	Hyperbolic intersection graphs and (quasi)-polynomial time. SODA Sándor Kisfaludi-Bak
2020	—	`conf`	Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Treewidth, Kernels, and Algorithms Mark de Berg, Sándor Kisfaludi-Bak
2020	J	`jnl`	Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2020	J	`jnl`	On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
2019	B	`conf`	How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019	J	`jnl`	How does object fatness impact the complexity of packing in d dimensions? CoRR Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019	A*	`conf`	Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2019	A	`conf`	On Geometric Set Cover for Orthants. ESA Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen
2019	B	`conf`	On One-Round Discrete Voronoi Games. ISAAC Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
2019	J	`jnl`	On One-Round Discrete Voronoi Games. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2018	A*	`conf`	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	A*	`conf`	An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	J	`jnl`	Hyperbolic intersection graphs and (quasi)-polynomial time. CoRR Sándor Kisfaludi-Bak
2018	J	`jnl`	Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2018	J	`jnl`	On the number of touching pairs in a set of planar curves. Comput. Geom. Péter Györgyi, Bálint Hujter, Sándor Kisfaludi-Bak
2017	C	`conf`	On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. CIAC Sándor Kisfaludi-Bak, Tom C. van der Zanden
2017	B	`conf`	The Dominating Set Problem in Geometric Intersection Graphs. IPEC Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	J	`jnl`	The Dominating Set Problem in Geometric Intersection Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	B	`conf`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2017	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2014	J	`jnl`	Notes on dual-critical graphs. CoRR Zoltán Király, Sándor Kisfaludi-Bak