Sándor Kisfaludi-Bak

From MaRDI portal
Person:1693323

Available identifiers

zbMath Open kisfaludi-bak.sandorMaRDI QIDQ1693323

List of research outcomes





PublicationDate of PublicationType
On the approximability of the traveling salesman problem with line neighborhoods2024-05-27Paper
Euclidean TSP in narrow strips2024-05-21Paper
Dynamic time warping under translation: approximation guided by space-filling curves2024-05-14Paper
Towards sub-quadratic diameter computation in geometric intersection graphs2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61475192024-01-15Paper
Dynamic time warping under translation: approximation guided by space-filling curves2023-12-20Paper
A quasi-polynomial algorithm for well-spaced hyperbolic TSP2023-11-02Paper
Euclidean TSP in narrow strips2023-11-02Paper
An ETH-Tight Exact Algorithm for Euclidean TSP2023-06-09Paper
Clique-based separators for geometric intersection graphs2023-06-05Paper
Computing list homomorphisms in geometric intersection graphs2023-05-05Paper
On one-round discrete voronoi games2023-02-03Paper
How Does Object Fatness Impact the Complexity of Packing in d Dimensions2023-02-03Paper
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs2022-10-19Paper
Online search for a hyperplane in high-dimensional Euclidean space2022-06-03Paper
https://portal.mardi4nfdi.de/entity/Q50776432022-05-18Paper
On Geometric Set Cover for Orthants2022-05-11Paper
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces2021-05-03Paper
Hyperbolic intersection graphs and (quasi)-polynomial time2021-02-02Paper
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs2021-01-13Paper
The dominating set problem in geometric intersection graphs2020-05-27Paper
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces2019-10-15Paper
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs2019-08-22Paper
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms2019-05-21Paper
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds2019-05-21Paper
The complexity of dominating set in geometric intersection graphs2019-04-23Paper
On the number of touching pairs in a set of planar curves2018-02-12Paper
The homogeneous broadcast problem in narrow and wide strips2017-09-22Paper
On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs2017-07-21Paper
5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points2014-10-27Paper
Notes on dual-critical graphs2014-10-07Paper

Research outcomes over time

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