A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity
drawing ...
Upward planarity testing and Rectilinear planarity testing are central
p...
We study the following problem: Given a set S of n points in the plane,
...
Bipartite graphs model the relationships between two disjoint sets of
en...
Orthogonal graph drawings are used in applications such as UML diagrams,...
We continue the study of linear layouts of graphs in relation to known d...
A graph G is well-covered if every minimal vertex cover of G is minimum,...
An obstacle representation of a graph G consists of a set of polygonal
o...
We consider the problem of morphing between rectangular duals of a plane...
We consider the problem of drawing an outerplanar graph with n vertices
...
A rectangular dual of a graph G is a contact representation of G by
axis...
A mixed s-stack q-queue layout of a graph consists of a linear order of ...
We study the following combinatorial problem. Given a set of n y-monoton...
We study the 1-planar, quasi-planar, and fan-planar crossing number in
c...
Stick graphs are intersection graphs of horizontal and vertical line seg...
The visual complexity of a plane graph drawing is defined to be the numb...
We study the following combinatorial problem. Given a set of n y-monoton...
Θ_6-Graphs are important geometric graphs that have many applications
es...
It is well-known that every 2-connected planar graph has a Tutte path, i...
Given a set of colored points in the plane, we ask if there exists a
cro...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
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...
We consider the problem of packing a family of disks "on a shelf", that ...