FMI
Fakultät für Mathmatik & Informatik Universitaet Passau FMI
Lehrstuhl für Theoretische Informatik
Prof. Dr. Franz J. Brandenburg - Publications

Partitions of Graphs into Trees

 

T. Biedl, F. J. Brandenburg, Proc. Graph Drawing, GD 2006, LNCS 4372, pages 430-439, 2007, © Springer Verlag

Graph Searching and Search Times

 

F. J. Brandenburg, S. Herrmann, Proc. SOFSEM 2006: Theory and Practice of Computer Science, LNCS 3831, pages 197-206, 2006, © Springer Verlag

Drawing Planar Bipartite Graphs with Small Area

 

T. Biedl, F. J. Brandenburg, Proc. 17th Canadian Conference on Computional Geometry, CCCG 2005, Vol. 17, pages 105-108, University of Windsor, Ontario, 2005

Radial Level Planarity Testing and Embedding in Linear Time

 

C. Bachmaier, F. J. Brandenburg, M. Forster, Journal of Graph Algorithms and Applications, JGAA, volume 9, number 1, pages 53-97, 2005

Crossings and Permutations

 

T. Biedl, F. J. Brandenburg, X. Deng, Proc. Graph Drawing, GD 2005, LNCS 3843, pages 1-12, 2006, © Springer Verlag

Finite Graph Automata for Linear and Boundary Graph Languages

 

F. J. Brandenburg, K. Skodinis, Theoretical Computer Science, TCS, Vol. 332, Issues 1-3, pages 199-232, Elsevier, 2005

Gravisto: Graph Visualization Toolkit

 

C. Bachmaier, F. J. Brandenburg, M. Forster, P. Holleis, M. Raitner, Proc. Graph Drawing, GD 2004, LNCS 3383, pages 502-503, 2005, © Springer Verlag

QUOGGLES: Query on Graphs - A Graphical Largely Extensible System

 

P. Holleis, F. J. Brandenburg, Proc. Graph Drawing, GD 2004, LNCS 3383, pages 465-470, 2005, © Springer Verlag

Graph Drawing Contest Report

 

F. J. Brandenburg, C. A. Duncan, E. Gansner, S. G. Kobourov, Proc. Graph Drawing, GD 2004, LNCS 3383, pages 512-516, 2005, © Springer Verlag

Computing and Drawing Isomorphic Subgraphs

 

S. Bachl, F. J. Brandenburg, D. Gmach, Journal of Graph Algorithms and Applications, JGAA, volume 8, number 2, pages 215-238, 2004
(Isomorphic Subgraph Test Suite)

Track Planarity Testing and Embedding

 

C. Bachmaier, F. J. Brandenburg, M. Forster, Proc. SOFSEM 2004: Theory and Practice of Computer Science, Vol. 2, pages 3-17, 2004, matfyzpress

Selected Open Problems in Graph Drawing

 

F. J. Brandenburg, D. Eppstein, M. T. Goodrich, S. G. Kobourov, G. Liotta, P. Mutzel, Proc. Graph Drawing, GD 2003, LNCS 2912, pages 515-539, 2004, © Springer Verlag

Radial Level Planarity Testing and Embedding in Linear Time (Extended Abstract)

 

C. Bachmaier, F. J. Brandenburg, M. Forster, Proc. Graph Drawing, GD 2003, LNCS 2912, pages 393-405, 2004, © Springer Verlag

Graph Drawing Contest Report

 

F. J. Brandenburg, U. Brandes, P. Eades, J. Marks, Proc. Graph Drawing, GD 2003, LNCS 2912, pages 504-508, 2004, © Springer Verlag

BioPath - Exploration and Visualization of Biochemical Pathways

 

F. J. Brandenburg, M. Forster, M. Raitner, F. Schreiber, In M. Jünger, P. Mutzel, (eds), Graph Drawing Software, Springer Mathematics and Visualization Series, pages 215-236, 2003, © Springer Verlag

Radial Level Planarity Testing and Embedding in Linear Time

 

C. Bachmaier, F. J. Brandenburg, M. Forster, Technical Report MIP-0303, University of Passau, 2003

Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains

  F. J. Brandenburg, Mao-Cheng Cai, Preprint, 2003

Cheapest Path Problems in Networks with Additive Losses and Gains

 

F. J. Brandenburg, Draft, Uni Passau, 2003

Cycles in Generalized Networks

 

F. J. Brandenburg, Proc. Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, LNCS 2573, pages 47-56, 2002, © Springer Verlag
Erratum WG 2003, LNCS 2573, page 383, 2003, © Springer Verlag

Computing and Drawing Isomorphic Subgraphs

 

S. Bachl, F. J. Brandenburg, Proc. Graph Drawing, GD 2002, LNCS 2528, pages 74-85, 2002, © Springer Verlag

Graph Drawing Contest Report

 

F. J. Brandenburg, Proc. Graph Drawing, GD 2002, LNCS 2528, pages 376-379, 2002, © Springer Verlag

The System Architecture of the BioPath System

 

M. Forster, A. Pick, M. Raitner, F. Schreiber, F. J. Brandenburg, In Silico Biology, Vol. 2, No. 3, pages 415-426, 2002

Graph Drawing Contest Report

 

T. Biedl, F. J. Brandenburg, Proc. Graph Drawing, GD 2002, LNCS 2265, pages 513-522, 2002, © Springer Verlag

The Acestor Width of Grammars and Languages

 

F. J. Brandenburg, Theoretical Computer Science, TCS, Vol. 207, Issue 1, pages 25-41, Elsevier, 1998

Graph Clustering I: Cycles of Cliques

 

F. J. Brandenburg, Proc. Graph Drawing, GD 1997, LNCS 1353, pages 158-168, 1997, © Springer Verlag

FMI Universitaet Passau Homepage