An obstacle representation of a graph G consists of a set of polygonal
o...
The segment number of a planar graph G is the smallest number of line
se...
A drawing of a graph is fan-planar if the edges intersecting a common ed...
We study whether a given graph can be realized as an adjacency graph of ...
A drawing of a graph in the plane is a thrackle if every pair of edges
i...
Given a set of colored points in the plane, we ask if there exists a
cro...
We study the problem of convexifying drawings of planar graphs. Given an...
A bipartite graph G=(U,V,E) is convex if the vertices in V can be
linear...
We introduce and study the problem Ordered Level Planarity which asks fo...