Sándor Kisfaludi-Bak

Available identifiers

zbMath Open kisfaludi-bak.sandorMaRDI QIDQ1693323

List of research outcomes

Publication	Date of Publication	Type
On the approximability of the traveling salesman problem with line neighborhoods	2024-05-27	Paper
Euclidean TSP in narrow strips	2024-05-21	Paper
Dynamic time warping under translation: approximation guided by space-filling curves	2024-05-14	Paper
Towards sub-quadratic diameter computation in geometric intersection graphs	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147519	2024-01-15	Paper
Dynamic time warping under translation: approximation guided by space-filling curves	2023-12-20	Paper
A quasi-polynomial algorithm for well-spaced hyperbolic TSP	2023-11-02	Paper
Euclidean TSP in narrow strips	2023-11-02	Paper
An ETH-Tight Exact Algorithm for Euclidean TSP	2023-06-09	Paper
Clique-based separators for geometric intersection graphs	2023-06-05	Paper
Computing list homomorphisms in geometric intersection graphs	2023-05-05	Paper
On one-round discrete voronoi games	2023-02-03	Paper
How Does Object Fatness Impact the Complexity of Packing in d Dimensions	2023-02-03	Paper
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs	2022-10-19	Paper
Online search for a hyperplane in high-dimensional Euclidean space	2022-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q5077643	2022-05-18	Paper
On Geometric Set Cover for Orthants	2022-05-11	Paper
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces	2021-05-03	Paper
Hyperbolic intersection graphs and (quasi)-polynomial time	2021-02-02	Paper
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs	2021-01-13	Paper
The dominating set problem in geometric intersection graphs	2020-05-27	Paper
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces	2019-10-15	Paper
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs	2019-08-22	Paper
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms	2019-05-21	Paper
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds	2019-05-21	Paper
The complexity of dominating set in geometric intersection graphs	2019-04-23	Paper
On the number of touching pairs in a set of planar curves	2018-02-12	Paper
The homogeneous broadcast problem in narrow and wide strips	2017-09-22	Paper
On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs	2017-07-21	Paper
5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points	2014-10-27	Paper
Notes on dual-critical graphs	2014-10-07	Paper

Research outcomes over time

This page was built for person: Sándor Kisfaludi-Bak