We devise a data structure that can answer shortest path queries for two...
As set systems, hypergraphs are omnipresent and have various representat...
A matroid M is an ordered pair (E,I), where E is a finite set called
the...
In the art gallery problem, we are given a closed polygon P, with ration...
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enfo...
We consider the algorithmic problem of finding the optimal weights and b...
We investigate the computational complexity of computing the Hausdorff
d...
Let P be a simple polygon, then the art gallery problem is looking for a...
We show that the decision problem of determining whether a given (abstra...
A continuous constraint satisfaction problem (CCSP) is a constraint
sati...
We solve an open problem posed by Michael Biro at CCCG 2013 that was ins...
Given a neural network, training data, and a threshold, it was known tha...
Many problems in Discrete and Computational Geometry deal with simple
po...
Given two shapes A and B in the plane with Hausdorff distance 1, is
ther...
Given a closed simple polygon P, we say two points p,q see each other if...
We show that many natural two-dimensional packing problems are
algorithm...
We study the complexity of Maximum Clique in intersection graphs of conv...
Recently, various natural algorithmic problems have been shown to be ∃R-...
We propose a new paradigm for robust geometric computations that complem...
In a nutshell, we show that polynomials and nested polytopes are topolog...
Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...
A family S of convex sets in the plane defines a hypergraph H = (S,E) as...
The input to the token swapping problem is a graph with vertices v_1, v_...
In the Art Gallery Problem we are given a polygon P⊂ [0,L]^2 on n
vertic...
We prove that the following problem is complete for the existential theo...
In the study of geometric problems, the complexity class ∃R
turned out t...