#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
- Graph Drawing
- 2012

- Christopher Auer, Christian Bachmaier, +4 authors Josef Reislhuber
- Algorithmica
- 2015

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time, and specialize 1-planar graphs, whose recognition is $${NP}$$ N P -hard. We explore o1p graphs. Our first main result is a… (More)

- Christopher Auer, Christian Bachmaier, +4 authors Josef Reislhuber
- Graph Drawing
- 2013

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time and specialize 1-planar graphs, whose recognition is NP-hard. Our main result is a linear-time algorithm that first tests whether… (More)

- Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
- Discrete Applied Mathematics
- 2017

A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-planarity, which only requires at most one crossing per edge.… (More)

- Franz J. Brandenburg, Kathrin Hanauer
- 2011

The feedback arc set problem plays a prominent role in the four-phase framework to draw directed graphs, also known as the Sugiyama algorithm. It is equivalent to the linear arrangement problem where the vertices of a graph are ordered from left to right and the backward arcs form the feedback arc set. In this paper we extend classical sorting algorithms to… (More)

We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling… (More)

- Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
- Graph Drawing
- 2012

A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing edges to share at most one vertex, and 1-planarity, where each edge may be crossed at most once. We show that there are… (More)

A graph is upward planar if it can be drawn without edge crossings such that all edges point upward. Upward planar graphs have been studied on the plane, the standing and rolling cylinders. For all these surfaces, the respective decision problem NP-hard in general. Efficient algorithms exist if the graph contains a single source and a single sink, but only… (More)

- Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
- Theor. Comput. Sci.
- 2015

We consider upward planar drawings of directed graphs in the plane (UP), and on standing (SUP) and rolling cylinders (RUP). In the plane and on the standing cylinder the edge curves are monotonically increasing in y-direction. On the rolling cylinder they wind unidirectionally around the cylinder. There is a strict hierarchy of classes of upward planar… (More)