 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
 |
|
|
|
|
|
 |
|
|
|
|
|
|
Prof. Dr. Franz J. Brandenburg - Publications |
|
|
Partitions of Graphs into Trees
|
|
|
|
|
|
|
Graph Searching and Search Times
|
|
|
|
|
|
|
Drawing Planar Bipartite Graphs with Small Area
|
|
|
|
|
|
|
Radial Level Planarity Testing and Embedding in Linear Time
|
|
|
|
|
|
|
Crossings and Permutations
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
Graph Drawing Contest Report
|
|
|
|
|
|
|
Computing and Drawing Isomorphic Subgraphs
|
|
|
|
|
|
|
Track Planarity Testing and Embedding
|
|
|
|
|
|
|
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)
|
|
|
|
|
|
|
Graph Drawing Contest Report
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
Shortest Path and Maximum Flow
Problems in
Networks with Additive Losses and Gains |
|
|
|
|
|
|
Cheapest Path Problems in Networks with
Additive Losses and Gains
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
Graph Drawing Contest Report
|
|
|
|
|
|
|
The System Architecture of the BioPath System
|
|
|
|
|
|
|
Graph Drawing Contest Report
|
|
|
|
|
|
|
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
|
|
|
|
|
|
 |
|
|
 |
 |
|
 |
|