As set systems, hypergraphs are omnipresent and have various representat...
We study polyiamonds (polygons arising from the triangular grid) that fo...
We construct families of circles in the plane such that their tangency g...
We investigate the computational complexity of computing the Hausdorff
d...
We investigate various online packing problems in which convex polygons
...
We show that the decision problem of determining whether a given (abstra...
A tripartite-circle drawing of a tripartite graph is a drawing in the pl...
We consider a spectrum of geometric optimization problems motivated by
c...
We study whether a given graph can be realized as an adjacency graph of ...
We provide a tight result for a fundamental problem arising from packing...
Given a neural network, training data, and a threshold, it was known tha...
We study a scheduling problem arising in pandemic times where jobs shoul...
We study upward planar straight-line embeddings (UPSE) of directed trees...
We study competitive location problems in a continuous setting, in which...
We provide a comprehensive study of a natural geometric optimization pro...
A drawing of a graph in the plane is a thrackle if every pair of edges
i...
We study straight-line drawings of planar graphs with prescribed face ar...
We study the problem of convexifying drawings of planar graphs. Given an...
In the study of geometric problems, the complexity class ∃R
turned out t...