Christian Bachmaier

dblp:99/3906 · DBLP profile ↗
← Back
24ranked-venue papers
14as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 22 · 13 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2021 Correction to: Outer 1-Planar Graphs
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Algorithmica2
2017 NIC-planar graphs
Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Discret. Appl. Math.1
2016 Outer 1-Planar Graphs
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
Algorithmica2
2015 Upward planar graphs and their duals
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
Theor. Comput. Sci.2
2013 Recognizing Outer 1-Planar Graphs in Linear Time
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
GD2
2013 On Maximum Rank Aggregation Problems
Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
IWOCA1
2013 Rolling Upward Planarity Testing of Strongly Connected Graphs
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer
WG2
2012 Optical Graph Recognition
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber
GD2
2012 The Duals of Upward Planar Graphs on Cylinders
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
WG2
2011 Classification of Planar Upward Embedding
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner
GD2
2011 The Open Graph Archive: A Community-Driven Effort
Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein 0001, Miro Spönemann, Matthias Stegmaier, Michael Wybrow
GD1
2010 Plane Drawings of Queue and Deque Graphs
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner
GD2
2010 Crossing minimization in extended level drawings of graphs
Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong 0001
Discret. Appl. Math.1
2009 Coordinate Assignment for Cyclic Level Graphs
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp
COCOON1
2008 Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Christian Bachmaier, Wolfgang Brunner
ESA1
2008 Tree Drawings on the Hexagonal Grid
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried
GD1
2008 Cyclic Leveling of Directed Graphs
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász
GD1
2007 Cyclic Level Planarity Testing and Embedding
Christian Bachmaier, Wolfgang Brunner, Christof König
GD1
2007 A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
abstract
In radial drawings of hierarchical graphs, the vertices are placed on concentric circles rather than on horizontal lines and the edges are drawn as outward monotone segments of spirals rather than straight lines as it is done in the standard Sugiyama framework. This drawing style is well suited for the visualization of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results, this reduces the number of crossings by approximately 30 percent on average. Few crossings are one of the major criteria for human readability. This paper is a detailed description of a complete framework for visualizing hierarchical information in a new radial fashion. Particularly, we briefly cover extensions of the level assignment step to benefit from the increasing perimeters of the circles, present three heuristics for crossing reduction in radial level drawings, and also show how to visualize the results.
Christian Bachmaier
IEEE Trans. Vis. Comput. Graph.1
2005 Radial Coordinate Assignment for Level Graphs
Christian Bachmaier, Michael Forster
COCOON1
2005 Drawing Phylogenetic Trees
Christian Bachmaier, Ulrik Brandes, Barbara Pampel
ISAAC1
2004 Gravisto: Graph Visualization Toolkit
Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner
GD1
2004 Clustered Level Planarity
Michael Forster, Christian Bachmaier
SOFSEM2
2003 Radial Level Planarity Testing and Embedding in Linear Time
Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
GD1