A polyhedral surface 𝒞 in ℝ^3 with convex polygons as
faces is a side-co...
A graph is 2-degenerate if every subgraph contains a vertex of degree at...
An arrangement of circles in which circles intersect only in angles of
π...
We study whether a given graph can be realized as an adjacency graph of ...
We study noncrossing geometric graphs and their disjoint compatible geom...
Given a set of colored points in the plane, we ask if there exists a
cro...
We show that the 1-planar slope number of 3-connected cubic 1-planar gra...
Knot and link diagrams are projections of one or more 3-dimensional simp...
The visual complexity of a graph drawing is defined as the number of
geo...