Add to ORKGIn this paper, we look at the problem of upward planar drawings of planar graphs whose vertices have preassigned y-coordinates. We give a linear time algorithm for testing whether such an embedding is feasible for triconnected labelled graphs
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We obtain new parameterized algorithms for the classical problem of determining whether a directed a...
In this paper, we look at the problem of upward planar drawings of planar graphs whose vertices have...
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all ed...
A directed acyclic graph (DAG) is upward planar if it can be drawn without any crossings while all e...
In this paper we study the computational complexity of the UPWARD PLANARITY EXTENSION problem, which...
An upward plane drawing of a directed acyclic graph is a plane drawing of the graph in which each di...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge e is represented as a poly...
A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane...
In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time alg...
We study two embedding problems for upward planar digraphs. Both problems arise in the context of dr...
. An upward plane drawing of a directed acyclic graph is a plane drawing of the digraph in which eac...
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with resp...
We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward directi...
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We obtain new parameterized algorithms for the classical problem of determining whether a directed a...
In this paper, we look at the problem of upward planar drawings of planar graphs whose vertices have...
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all ed...
A directed acyclic graph (DAG) is upward planar if it can be drawn without any crossings while all e...
In this paper we study the computational complexity of the UPWARD PLANARITY EXTENSION problem, which...
An upward plane drawing of a directed acyclic graph is a plane drawing of the graph in which each di...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge e is represented as a poly...
A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane...
In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time alg...
We study two embedding problems for upward planar digraphs. Both problems arise in the context of dr...
. An upward plane drawing of a directed acyclic graph is a plane drawing of the digraph in which eac...
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with resp...
We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward directi...
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditio...
We obtain new parameterized algorithms for the classical problem of determining whether a directed a...