Christian Bachmaier

Universität Passau
Fakultät für Informatik und Mathematik
Prof. Dr. Christian Bachmaier
Innstr. 33 (Room 203)
D-94032 Passau, Germany

Phone: +49 (851) 509-3035
Fax: +49 (851) 509-3002
E-mail: last name at fim.uni-passau.de

OpenPGP key: 01CED704F9CC1EAF.asc

course catalog of the faculty

Automatic Assessment Management System for Interactive Learning: Artemis

Automated quality control for programming internships: Praktomat

Room and time scheduler for University courses: Roomplanner

Graph Visualization Toolkit: Gravisto

Graph Template Library: GTL

algorithm engineering

algorithmic graph theory

computional complexity

data structures

efficient graph algorithms

graph drawing

C. Auer, C. Bachmaier, F. J. Brandenburg, W. Brunner, A. Gleißner, Data Structures and their Planar Graph Layouts.
Journal of Graph Algorithms and Applications, JGAA, volume 22, number 2, pages 207-237, 2018 (pdf)

C. Bachmaier, F. J. Brandenburg, K. Hanauer, D. Neuwirth, J. Reislhuber, NIC-Planar Graphs.
Discrete Applied Mathematics, DAM, volume 232, pages 23-40, 2017, © Elsevier (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, D. Neuwirth, J. Reiselhuber, Outer 1-Planar Graphs.
Algorithmica, volume 74, number 4, pages 1293-1320, 2016, © Springer (pdf)

Erratum: Theorem 8, i.e., every outer 1-planar graph can be drawn as a (planar and straight-line) visibility representation in O(n log n) area, does not hold. The other results remain unaffected. Algorithmica, volume 83, number 11, pages 3534-3535, 2021, © Springer (pdf)

The final publications are available at Springer via https://doi.org/10.1007/s00453-015-0002-1 and https://doi.org/10.1007/s00453-021-00874-z.

C. Bachmaier, F. J. Brandenburg, A. Gleißner, A. Hofmeier, On the Hardness of Maximum Rank Aggregation Problems.
Journal of Discrete Algorithms, JDA, volume 31, pages 2-13, 2015, © Elsevier (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, Upward Planar Graphs and their Duals.
Theoretical Computer Science, TCS, volume 571, pages 36-49, 2015, © Elsevier (pdf)

C. Bachmaier, M. Matzeder,C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, J. Reislhuber, Optical Graph Recognition.
Journal of Graph Algorithms and Applications, JGAA, volume 17, number 4, pages 541-565, 2013 (pdf)

C. Bachmaier, M. Matzeder, Drawing Unordered Trees on k-Grids.
Journal of Graph Algorithms and Applications, JGAA, volume 17, number 2, pages 103-128, 2013 (pdf)

C. Bachmaier, W. Brunner, A. Gleißner, Grid Sifting: Leveling and Crossing Reduction.
ACM Journal of Experimental Algorithms, JEA, volume 17, number 1, pages 1.7:1-1.7:23, 2012, © ACM (pdf)

This is the author′s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM JEA http://doi.acm.org/10.1145/2133803.2345682.

C. Bachmaier, F. J. Brandenburg, W. Brunner, R. Fülöp, Drawing Recurrent Hierarchies.
Journal of Graph Algorithms and Applications, JGAA, volume 16, number 2, pages 151-198, 2012 (pdf)

C. Bachmaier, F. J. Brandenburg, W. Brunner, F. Hübner, Global k-Level Crossing Reduction.
Journal of Graph Algorithms and Applications, JGAA, volume 15, number 5, pages 631-659, 2011 (pdf)

C. Bachmaier, H. Buchner, M. Forster, S.-H. Hong, Crossing Minimization in Extended Level Drawings of Graphs.
Discrete Applied Mathematics, DAM, volume 158, number 3, pages 159-179, 2010, © Elsevier (pdf)

C. Bachmaier, A Radial Adaption of the Sugiyama Framework for Visualizing Hierarchical Information.
IEEE Transactions on Visualization & Computer Graphics, TVCG, volume 13, number 3, pages 583-594, 2007, © IEEE Computer Society (pdf)

C. Bachmaier, F. J. Brandenburg, M. Forster, Radial Level Planarity Testing and Embedding in Linear Time.
Journal of Graph Algorithms and Applications, JGAA, volume 9, number 1, pages 53-97, 2005 (pdf)

C. Bachmaier, I. Rutter, P. Stumpf, 1-Gap Planarity of Complete Bipartite Graphs (Poster).
In T. Biedl, A. Kerren, editors, Proc. Graph Drawing and Network Visualization, GD 2018, volume 11282 of LNCS, pages 646-648, 2018, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, D. Neuwirth, J. Reislhuber, Recognizing Outer 1-Planar Graphs in Linear Time.
In S. Wismath, A. Wolff, editors, Proc. Graph Drawing, GD 2013, volume 8242 of LNCS, pages 107-118, 2013, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, D. Neuwirth, The Density of Classes of 1-Planar Graphs (Poster).
In S. Wismath, A. Wolff, editors, Proc. Graph Drawing, GD 2013, volume 8242 of LNCS, pages 524-525, 2013, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, J. Reislhuber, Optical Graph Recognition on a Mobile Device (Poster).
In S. Wismath, A. Wolff, editors, Proc. Graph Drawing, GD 2013, volume 8242 of LNCS, pages 516-517, 2013, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, A. Gleißner, A. Hofmeier, On Maximum Rank Aggregation Problems.
In T. Lecroq, L. Mouchard, editors, Proc. International Workshop on Combinatorial Algorithms, IWOCA 2013, volume 8288 of LNCS, pages 14-27, 2013, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, K. Hanauer, Rolling Upward Planarity Testing of Strongly Connected Graphs .
In A. Brandstädt, K. Jansen, R. Reischuk, editors, Proc. Workshop on Graph-Theoretic Concepts, WG 2013, volume 8165 of LNCS, pages 38-49, 2013, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, J. Reislhuber, Calibration in Optical Graph Recognition.
In D. Diáz-Pernil, I. Fondón, R. González-Díaz, M. J. Jiménez, editors, Proc. Discrete Geometry for Computer Imagery, DGCI 2013,
volume 3, number 5 of Imagen-A, pages 11-14, University of Seville, 2013 (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, J. Reislhuber, Optical Graph Recognition.
In W. Didimo, M. Patrignani, editors, Proc. Graph Drawing, GD 2012, volume 7704 of LNCS, pages 529-540, 2013, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, The Duals of Upward Planar Graphs on Cylinders (Extended Abstract).
In M. C. Golumbic, M. Stern, A. Levy, G. Morgenstern, editors, Proc. Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012, volume 7551 of LNCS, pages 103-113, 2012, © Springer (pdf)

C. Bachmaier, M. Matzeder, Drawing Unordered Trees on k-Grids.
In Md. S. Rahman, S.-i. Nakano, editors, Proc. Workshop on Algorithms and Computation, WALCOM 2012, volume 7157 of LNCS, pages 198-2010, 2012, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, Classification of Planar Upward Embedding.
In M. van Kreveld, B. Speckmann, editors, Proc. Graph Drawing, GD 2011, volume 7034 of LNCS, pages 415-426, 2012, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, P Effinger, C. Gutwenger, J. Katajainen, K. Klein, M. Spönemann, M. Stegmaier, M. Wybrow, The Open Graph Archive: A Community-Driven Effort.
In M. van Kreveld, B. Speckmann, editors, Proc. Graph Drawing, GD 2011, volume 7034 of LNCS, pages 435-440, 2012, © Springer (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, W. Brunner, A. Gleißner, Plane Drawings of Queue and Deque Graphs.
In U. Brandes, S. Cornelsen editors, Proc. Graph Drawing, GD 2010, volume 6502 of LNCS, pages 68-79, 2011, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, W. Brunner, F. Hübner, A Global k-Level Crossing Reduction Algorithm.
In Md. S. Rahman, S. Fujita, editors, Proc. Workshop on Algorithms and Computation, WALCOM 2010, volume 5942 of LNCS, pages 70-81, 2010, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, W. Brunner, R. Fülöp, Coordinate Assignment for Cyclic Level Graphs.
In H. Q. Ngo, editor, Proc. Computing and Combinatorics, COCOON 2009, volume 5609 of LNCS, pages 66-75, 2009, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, W. Brunner, G. Lovász, Cyclic Leveling of Directed Graphs.
In I. G. Tollis, M. Patrignani, editors, Proc. Graph Drawing, GD 2008, volume 5417 of LNCS, pages 348-359, 2009, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, W. Brunner, A. Hofmeier, M. Matzeder, T. Unfried, Tree Drawings on the Hexagonal Grid.
In I. G. Tollis, M. Patrignani, editors, Proc. Graph Drawing, GD 2008, volume 5417 of LNCS, pages 372-383, 2009, © Springer (pdf)

C. Bachmaier, W. Brunner, Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.
In D. Halperin, K. Mehlhorn, editors, Proc. European Symposium on Algorithms, ESA 2008, volume 5193 of LNCS, pages 136-147, 2008 © Springer (pdf)

C. Bachmaier, W. Brunner, C. König, Cyclic Level Planarity Testing and Embedding (Extended Abstract).
In S.-H. Hong, T. Nishizeki, W. Quan, editors, Proc. Graph Drawing, GD 2007, volume 4875 of LNCS, pages 50-61, 2008, © Springer (pdf)

C. Bachmaier, U. Brandes, B. Schlieper, Drawing Phylogenetic Trees.
In X. Deng, D. Du, editors, Proc. Intl. Symposium on Algorithms and Computation, ISAAC 2005, volume 3827 of LNCS, pages 1110-1121, 2005, © Springer (pdf)

C. Bachmaier, F. Fischer, M. Forster, Radial Coordinate Assignment for Level Graphs.
In L. Wang, editor, Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS, pages 401-410, 2005, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, M. Forster, P. Holleis, M. Raitner, Gravisto: Graph Visualization Toolkit (Poster).
In J. Pach, editor, Proc. Graph Drawing, GD 2004, volume 3383 of LNCS, pages 502-503, 2004, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, M. Forster, Track Planarity Testing and Embedding.
In P. Van Embde Boas, J. Pokorny, M. Bielikova, J. Stuller, editors, SOFSEM 2004: Theory and Practice of Computer Science, volume 2, pages 3-17, 2004, MatFyzPres (pdf)

M. Forster, C. Bachmaier, Clustered Level Planarity.
In P. Van Embde Boas, J. Pokorny, M. Bielikova, J. Stuller, editors, SOFSEM 2004: Theory and Practice of Computer Science, volume 2932 of LNCS, pages 218-228, 2004, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, M. Forster, Radial Level Planarity Testing and Embedding in Linear Time (Extended Abstract).
In G. Liotta, editor, Proc. Graph Drawing, GD 2003, volume 2912 of LNCS, pages 393-405, 2004, © Springer (pdf)

C. Bachmaier, F. J. Brandenburg, K. Hanauer, A Note on IC-Planar Graphs.
Technical Report arXiv:1707.08652v1 [cs.DM], Computing Research Repository (CoRR), July 2017 (pdf)

C. Bachmaier, F. J. Brandenburg, K. Hanauer, D. Neuwirth, J. Reislhuber, NIC-Planar Graphs.
Technical Report arXiv:1701.04375v2 [cs.DM], Computing Research Repository (CoRR), July 2017 (pdf)

C. Bachmaier, U. Brandes, F. Schreiber, Biological Networks.
In R. Tamassia, editor, Handbook of Graph Drawing and Visualization, chapter 20, CRC Press, 2014

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, K. Hanauer, The Duals of Upward Planar Graphs on Cylinders.
Technical Report MIP-1204, University of Passau, 2012 (pdf)

C. Bachmaier, A. Gleißner, A. Hofmeier, DAGmar: Library for DAGs.
Technical Report MIP-1202, University of Passau, 2012 (pdf)

C. Auer, C. Bachmaier, F. J. Brandenburg, A. Gleißner, Classification of Planar Upward Embedding.
Technical Report MIP-1106, University of Passau, 2011 (pdf)

C. Bachmaier, F. J. Brandenburg, P. Effinger, C. Gutwenger, J. Katajainen, K. Klein, M. Spönemann, M. Stegmaier, M. Wybrow, The Open Graph Archive: A Community-Driven Effort.
Technical Report arXiv:1109.1465v1 [cs.DS], Computing Research Repository (CoRR), September 2011 (pdf)

C. Bachmaier, F. J. Brandenburg, P. Effinger, C. Gutwenger, J. Katajainen, K. Klein, M. Spönemann, M. Wybrow, Graph Archive.
In C. Demetrescu, M. Kaufmann, S. Kobourov, P. Mutzel, editors, Dagstuhl Reports volume 1, issue 5 (Dagstuhl Seminar 11191 on Graph Drawing with Algorithm Engineering Methods), pages 52-53, 2011 (pdf)

C. Bachmaier, W. Brunner, A. Gleißner, Grid Sifting: Leveling and Crossing Reduction.
Technical Report MIP-1103, University of Passau, 2011 (pdf)

C. Bachmaier, A Generalized Framework for Drawing Directed Graphs.
Habilitation Thesis, University of Passau, 2009 (pdf)

C. Bachmaier, M. Forster, Crossing Reduction for Hierarchical Graphs with Intra-Level Edges.
Technical Report MIP-0608, University of Passau, 2006 (pdf)

C. Bachmaier, M. Forster, A Radial Adaptation of the Sugiyama Framework for Hierarchical Graph Drawing.
Technical Report MIP-0603, University of Passau, 2006 (pdf)

C. Bachmaier, Radiale Level-Planarität und -Einbettung in Linearzeit.
In D. Wagner et al., editors, Ausgezeichnete Informatikdissertationen 2004, volume D-5 of GI-Edition Lecture Notes in Informatics (LNI) - Dissertations, pages 19-28, Gesellschaft für Informatik, 2005 (pdf)

C. Bachmaier, M. Raitner, Improved Symmetric Lists.
Technical Report MIP-0409, University of Passau, 2004 (pdf)

C. Bachmaier, Circle Planarity of Level Graphs.
Dissertation, University of Passau, 2004, OPUS Bayern (pdf)

C. Bachmaier, F. J. Brandenburg, M. Forster, Radial Level Planarity Testing and Embedding in Linear Time.
Technical Report MIP-0303, University of Passau, 2003 (pdf)

C. Bachmaier, Vergleich und Implementierung von Partitionierungsverfahren auf Graphen.
Diplomarbeit, Universität Passau, 2000 (pdf)

Last updated on Tue, September 23, 2025 by Christian Bachmaier

Christian Bachmaier

Address:

Teaching (partially in German):

Projects:

Interests:

Publications in Journals:

Publications in Conference Proceedings:

Other Publications:

Links: