
CliqueBased Separators for Geometric Intersection Graphs
Let F be a set of n objects in the plane and let G(F) be its intersectio...
read it

Online Search for a Hyperplane in HighDimensional Euclidean Space
We consider the online search problem in which a server starting at the ...
read it

A GapETHTight Approximation Scheme for Euclidean TSP
We revisit the classic task of finding the shortest tour of n points in ...
read it

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
We study the variant of the Euclidean Traveling Salesman problem where i...
read it

Euclidean TSP in Narrow Strip
We investigate how the complexity of Euclidean TSP for point sets P insi...
read it

A quasipolynomial algorithm for wellspaced hyperbolic TSP
We study the traveling salesman problem in the hyperbolic plane of Gauss...
read it

How does object fatness impact the complexity of packing in d dimensions?
Packing is a classical problem where one is given a set of subsets of Eu...
read it

On OneRound Discrete Voronoi Games
Let V be a multiset of n points in R^d, which we call voters, and let k≥...
read it

Hyperbolic intersection graphs and (quasi)polynomial time
We study unit ball graphs (and, more generally, socalled noisy uniform ...
read it

Nearly ETHTight Algorithms for Planar Steiner Tree with Terminals on Few Faces
The Planar Steiner Tree problem is one of the most fundamental NPcomple...
read it

An ETHTight Exact Algorithm for Euclidean TSP
We study exact algorithms for Euclidean TSP in R^d. In the early 1990s ...
read it

A Framework for ETHTight Algorithms and Lower Bounds in Geometric Intersection Graphs
We give an algorithmic and lowerbound framework that facilitates the co...
read it

Framework for ETHtight Algorithms and Lower Bounds in Geometric Intersection Graphs
We give an algorithmic and lowerbound framework that facilitates the co...
read it

The Dominating Set Problem in Geometric Intersection Graphs
We study the parameterized complexity of dominating sets in geometric in...
read it
Sándor KisfaludiBak
is this you? claim profile