Mutual coherence is a measure of similarity between two opinions. Althou...
Planar drawings of graphs tend to be favored over non-planar drawings.
T...
Planar graph drawings tend to be aesthetically pleasing. In this poster ...
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
A face in a curve arrangement is called popular if it is bounded by the ...
In an upward planar 2-slope drawing of a digraph, edges are drawn as
str...
We study upward planar straight-line embeddings (UPSE) of directed trees...
A mixed s-stack q-queue layout of a graph consists of a linear order of ...
We introduce and study level-planar straight-line drawings with a fixed
...
The visual complexity of a plane graph drawing is defined to be the numb...
We study k-page upward book embeddings (kUBEs) of st-graphs, that is,
bo...
A queue layout of a graph consists of a linear order of its vertices and...
Let G=(V, E) be a planar graph and let C be a partition of V.
We refer t...
This paper addresses the following basic question: given two layouts of ...
We consider the problem of extending the drawing of a subgraph of a give...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
The crossing angle of a straight-line drawing Γ of a graph G=(V, E)
is t...
A fixed-mobile bigraph G is a bipartite graph such that the vertices of ...
A k-page book drawing of a graph G=(V,E) consists of a linear ordering o...
Let G be a graph topological embedded in the plane and let A be
an arra...