#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1973

2018

- This year (4)
- Last 5 years (24)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Franz-Josef Brandenburg
- Theor. Comput. Sci.
- 1983

- Franz-Josef Brandenburg, Michael Himsolt, Christoph Rohrer
- Graph Drawing
- 1995

We report on our experiments with ve graph drawing algorithms for general undirected graphs. These are the algorithms FR in-and Mehldau 6]. Implementations of these algorithms have been integrated… (More)

- Muhammad Jawaherul Alam, Franz-Josef Brandenburg, Stephen G. Kobourov
- Graph Drawing
- 2013

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straightline drawings. We show that every 3-connected… (More)

- Franz-Josef Brandenburg
- Algorithmica
- 2016

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of $$4n-8$$4n-8 edges. We show that optimal… (More)

- Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner
- Graph Drawing
- 2011

We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward direction is defined by a vector field. This generalizes earlier approaches using surfaces with a fixed… (More)

- Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner
- Graph Drawing
- 2004

Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph viewer component. As a… (More)

- Franz-Josef Brandenburg
- Graph Drawing
- 1997

- Franz-Josef Brandenburg
- J. Graph Algorithms Appl.
- 2014

A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertexsegments, and each edge is represented by a vertical edge-segment… (More)

- Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber
- 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… (More)

- 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… (More)