Publications

Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong. Crossing Minimization in Extended Level Drawings of Graphs. Discrete Applied Mathematics, 158(3):159–179 Elsevier, 2010.

Christian Bachmaier, Michael Forster. Crossing Reduction for Hierarchical Graphs with Intra-Level Edges. Technical Report MIP-0608, University of Passau, 2006.

Christian Bachmaier, Michael Forster. A Radial Adaption of the Sugiyama Framework for Hierarchical Graph Drawing. Technical Report MIP-0603, University of Passau, 2006.

Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S Nikolov, Ronnie Taib, others. GEOMI: GEOmetry for maximum insight. Patrick Healy, Nikola S. Nikolov (eds.), Proc. Graph Drawing, GD 2005, Lecture Notes in Computer Science 3843:468–479, Springer, 2006.

Christian Bachmaier, Florian Fischer, Michael Forster. Radial Coordinate Assignment for Level Graphs. Lusheng Wang (ed.), Proc. International Computing and Combinatorics Conference, COCOON 2005, Lecture Notes in Computer Science, 3595:401–410, Springer, 2005.

Christian Bachmaier, Franz J. Brandenburg, Michael Forster. Radial Level Planarity Testing and Embedding in Linear Time. Journal of Graph Algorithms and Applications, 9(1):53–97, 2005.

Christian Bachmaier, Franz J. Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner. Gravisto: Graph Visualization Toolkit. János Pach (ed.), Proc. Graph Drawing, GD 2004, Lecture Notes in Computer Science 3383:502–503, Springer, 2005.

Michael Forster. A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. János Pach (ed.), Proc. Graph Drawing, GD 2004, Lecture Notes in Computer Science 3383:206–216, Springer, 2005.

Michael Forster. Crossings in Clustered Level Graphs. PhD thesis, University of Passau, 2004.

Christian Bachmaier, Franz J. Brandenburg, Michael Forster. Track Planarity Testing and Embedding. Peter van Emde Boas, Jaroslav Pokorný, Mariá Bieliková, Július Štuller, Proc. International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, 2:3–17, MatFyzPress, 2004.

Christian Bachmaier, Franz J. Brandenburg, Michael Forster. Radial Level Planarity Testing and Embedding in Linear Time. Giuseppe Liotta (ed.), Proc. Graph Drawing, GD 2003, Lecture Notes in Computer Science 2919:393–405 Springer, 2004.

Michael Forster, Christian Bachmaier. Clustered Level Planarity. Peter van Emde Boas, Jaroslav Pokorný, Mariá Bieliková, Július Štuller (eds.), Proc. Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, Lecture Notes in Computer Science 2932:218–228, Springer, 2003.

Franz J. Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber. BioPath – Exploration and Visualization of Biochemical Pathways. Michael Jünger, Petra Mutzel (eds.), Graph Drawing Software, Mathematics and Visualization, 215–236, Springer, 2003.

Christian Bachmaier, Franz J. Brandenburg, Michael Forster. Radial Level Planarity Testing and Embedding in Linear Time. Technical Report MIP-0303, University of Passau, 2003.

Michael Forster. Applying Crossing Reduction Strategies to Layered Compound Graphs. Stephen G. Kobourov, Michael T. Goodrich (eds.), Proc. Graph Drawing, GD 2002, Lecture Notes in Computer Science 2528:276–284, Springer, 2002.

Franz J. Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber. BioPath. Petra Mutzel, Michael Jünger, Sebastian Leipert (eds.), Proc. Graph Drawing, GD 2001, Lecture Notes in Computer Science 2265:455–456 Springer, 2002.

Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, Franz J. Brandenburg. The System Architecture of the BioPath System. In Silico Biology 2(3):415–426, IOS press, 2002.

Franz J. Brandenburg, Michael Forster, Andreas Pick, Falk Schreiber. BioPath – Visualization of Biochemical Pathways. Edgar Wingender (ed.), Computer Science and Biology: Proc. German Conference on Bioinformatics, GCB 2001, 11–15, German Research Center for Biotechnology, 2001.

Michael Forster. Zeichnen ungerichteter Graphen mit gegebenen Knotengrößen durch ein Springembedder-Verfahren. Diploma Thesis, Universität Passau, 1999.