Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

1-Planarity of Graphs with a Rotation System

- Christopher Auer, F. Brandenburg, Andreas Gleißner, Josef Reislhuber
- Mathematics, Computer Science
- J. Graph Algorithms Appl.
- 2015

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for… Expand

NIC-planar graphs

- C. Bachmaier, F. Brandenburg, Kathrin Hanauer, D. Neuwirth, Josef Reislhuber
- Computer Science, Mathematics
- Discret. Appl. Math.
- 16 January 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… Expand

Optical Graph Recognition

- Josef Reislhuber
- Computer Science
- Graph Drawing
- 19 September 2012

Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays… Expand

On the Density of Maximal 1-Planar Graphs

- F. Brandenburg, D. Eppstein, Andreas Gleißner, M. Goodrich, Kathrin Hanauer, Josef Reislhuber
- Computer Science, Mathematics
- Graph Drawing
- 19 September 2012

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity.
Maximal 1-planar graphs… Expand

Outer 1-Planar Graphs

- Christopher Auer, C. Bachmaier, +4 authors Josef Reislhuber
- Mathematics, Computer Science
- Algorithmica
- 1 April 2016

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… Expand

Recognizing Outer 1-Planar Graphs in Linear Time

- Christopher Auer, C. Bachmaier, +4 authors Josef Reislhuber
- Computer Science, Mathematics
- Graph Drawing
- 23 September 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… Expand

Optical Graph Recognition

- Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber
- Computer Science, Mathematics
- J. Graph Algorithms Appl.
- 2013

Optical Graph Recognition on a Mobile Device

- Christopher Auer, C. Bachmaier, F. J. Brandenburg, Andreas Gleißner, Josef Reislhuber
- Computer Science
- 2013

In [1] we proposed Optical Graph Recognition (OGR) as the reversal of graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps… Expand