| 2008 |
|---|
| 67 | EE | Christian Bachmaier,
Franz-Josef Brandenburg,
Wolfgang Brunner,
Gergö Lovász:
Cyclic Leveling of Directed Graphs.
Graph Drawing 2008: 348-359 |
| 66 | EE | Christian Bachmaier,
Franz-Josef Brandenburg,
Wolfgang Brunner,
Andreas Hofmeier,
Marco Matzeder,
Thomas Unfried:
Tree Drawings on the Hexagonal Grid.
Graph Drawing 2008: 372-383 |
| 65 | EE | Franz-Josef Brandenburg:
Drawing Planar Graphs on (8/9)*n2 Area.
Electronic Notes in Discrete Mathematics 31: 37-40 (2008) |
| 2006 |
|---|
| 64 | EE | Therese C. Biedl,
Franz-Josef Brandenburg:
Partitions of Graphs into Trees.
Graph Drawing 2006: 430-439 |
| 63 | EE | Franz-Josef Brandenburg,
Stephanie Herrmann:
Graph Searching and Search Time.
SOFSEM 2006: 197-206 |
| 2005 |
|---|
| 62 | EE | Therese C. Biedl,
Franz-Josef Brandenburg:
Drawing planar bipartite graphs with small area.
CCCG 2005: 105-108 |
| 61 | EE | Therese C. Biedl,
Franz-Josef Brandenburg,
Xiaotie Deng:
Crossings and Permutations.
Graph Drawing 2005: 1-12 |
| 60 | EE | Christian Bachmaier,
Franz-Josef Brandenburg,
Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time.
J. Graph Algorithms Appl. 9(1): 53-97 (2005) |
| 59 | EE | Franz-Josef Brandenburg,
Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages.
Theor. Comput. Sci. 332(1-3): 199-232 (2005) |
| 2004 |
|---|
| 58 | EE | Paul Holleis,
Franz-Josef Brandenburg:
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System.
Graph Drawing 2004: 465-470 |
| 57 | EE | Christian Bachmaier,
Franz-Josef Brandenburg,
Michael Forster,
Paul Holleis,
Marcus Raitner:
Gravisto: Graph Visualization Toolkit.
Graph Drawing 2004: 502-503 |
| 56 | EE | Franz-Josef Brandenburg,
Christian A. Duncan,
Emden R. Gansner,
Stephen G. Kobourov:
Graph-Drawing Contest Report.
Graph Drawing 2004: 512-516 |
| 55 | EE | Sabine Bachl,
Franz-Josef Brandenburg,
Daniel Gmach:
Computing and Drawing Isomorphic Subgraphs.
J. Graph Algorithms Appl. 8(2): 215-238 (2004) |
| 2003 |
|---|
| 54 | EE | Christian Bachmaier,
Franz-Josef Brandenburg,
Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time.
Graph Drawing 2003: 393-405 |
| 53 | EE | Franz-Josef Brandenburg,
Ulrik Brandes,
Peter Eades,
Joe Marks:
Graph Drawing Contest Report.
Graph Drawing 2003: 504-508 |
| 52 | EE | Franz-Josef Brandenburg,
David Eppstein,
Michael T. Goodrich,
Stephen G. Kobourov,
Giuseppe Liotta,
Petra Mutzel:
Selected Open Problems in Graph Drawing.
Graph Drawing 2003: 515-539 |
| 51 | EE | Franz-Josef Brandenburg:
Erratum: Cycles in Generalized Networks.
WG 2003: 383 |
| 2002 |
|---|
| 50 | EE | Franz-Josef Brandenburg:
Graph-Drawing Contest Report.
Graph Drawing 2002: 376-379 |
| 49 | EE | Sabine Bachl,
Franz-Josef Brandenburg:
Computing and Drawing Isomorphic Subgraphs.
Graph Drawing 2002: 74-85 |
| 48 | EE | Franz-Josef Brandenburg:
Cycles in Generalized Networks.
WG 2002: 47-56 |
| 47 | EE | Michael Forster,
Andreas Pick,
Marcus Raitner,
Falk Schreiber,
Franz-Josef Brandenburg:
The system architecture of the BioPath system.
In Silico Biology 2: 37 (2002) |
| 2001 |
|---|
| 46 | | Franz-Josef Brandenburg,
Michael Forster,
Andreas Pick,
Marcus Raitner,
Falk Schreiber:
BioPath Visualization of Biochemical Pathways.
German Conference on Bioinformatics 2001: 11-15 |
| 45 | EE | Franz-Josef Brandenburg,
Michael Forster,
Andreas Pick,
Marcus Raitner,
Falk Schreiber:
BioPath.
Graph Drawing 2001: 455-456 |
| 44 | EE | Therese C. Biedl,
Franz-Josef Brandenburg:
Graph-Drawing Contest Report.
Graph Drawing 2001: 513-522 |
| 2000 |
|---|
| 43 | EE | Franz-Josef Brandenburg,
Ulrik Brandes,
Michael Himsolt,
Marcus Raitner:
Graph-Drawing Contest Report.
Graph Drawing 2000: 410-418 |
| 1999 |
|---|
| 42 | EE | Franz-Josef Brandenburg,
Michael Jünger,
Joe Marks,
Petra Mutzel,
Falk Schreiber:
Graph-Drawing Contest Report.
Graph Drawing 1999: 400-409 |
| 41 | EE | Jubin Edachery,
Arunabha Sen,
Franz-Josef Brandenburg:
Graph Clustering Using Distance-k Cliques.
Graph Drawing 1999: 98-106 |
| 1998 |
|---|
| 40 | EE | Franz-Josef Brandenburg:
The Ancestor Width of Grammars and Languages.
Theor. Comput. Sci. 207(1): 25-41 (1998) |
| 1997 |
|---|
| 39 | | Franz-Josef Brandenburg:
Homomorphic Representations of Certain Classes of Languages.
Advances in Algorithms, Languages, and Complexity 1997: 93-110 |
| 38 | | Franz-Josef Brandenburg,
Michael Jünger,
Petra Mutzel,
Thomas Lengauer:
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen.
GI Jahrestagung 1997: 58-67 |
| 37 | | Franz-Josef Brandenburg:
Graph Clustering 1: Circles of Cliques.
Graph Drawing 1997: 158-168 |
| 36 | | Franz-Josef Brandenburg,
Michael Jünger,
Petra Mutzel:
Algorithmen zum automatischen Zeichnen von Graphen.
Informatik Spektrum 20(4): 199-207 (1997) |
| 1996 |
|---|
| 35 | | Franz-Josef Brandenburg:
Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995, Proceedings
Springer 1996 |
| 1995 |
|---|
| 34 | | Franz-Josef Brandenburg,
Michael Himsolt,
Christoph Rohrer:
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms.
Graph Drawing 1995: 76-87 |
| 1994 |
|---|
| 33 | | Franz-Josef Brandenburg:
Designing Graph Drawings by Layout Graph Grammars.
Graph Drawing 1994: 416-427 |
| 32 | | Franz-Josef Brandenburg,
Konstantin Skodinis:
Graph Automata for Linear Graph Languages.
TAGT 1994: 336-350 |
| 1993 |
|---|
| 31 | | Franz-Josef Brandenburg,
Jürgen Dassow:
Efficient Reductions of Picture Words.
ITA 27(1): 49-56 (1993) |
| 1991 |
|---|
| 30 | | Franz-Josef Brandenburg:
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree.
RTA 1991: 312-322 |
| 29 | | Franz-Josef Brandenburg,
Werner Freise,
Winfried Görke,
Reiner W. Hartenstein,
P. Kühn,
H. J. Schmitt:
Gemeinsame Stellungnahme der Fakultätentage Elektrotechnik und Informatik zur Abstimmung ihrer Fachgebierte im Bereich Informationstechnik.
Informatik Spektrum 14(3): 163-167 (1991) |
| 1990 |
|---|
| 28 | | Franz-Josef Brandenburg:
Layout Graph Grammars: The Placement Approach.
Graph-Grammars and Their Application to Computer Science 1990: 144-156 |
| 27 | | Franz-Josef Brandenburg,
Michal Chytil:
Cycle Chain Code Picture Languages.
Graph-Grammars and Their Application to Computer Science 1990: 157-173 |
| 1989 |
|---|
| 26 | | Franz-Josef Brandenburg:
On the Complexity of Optimal Drawings of Graphs.
WG 1989: 166-180 |
| 1988 |
|---|
| 25 | | Franz-Josef Brandenburg:
Nice drawings of graphs are computationally hard.
Informatics and Psychology Workshop 1988: 1-15 |
| 24 | | Franz-Josef Brandenburg:
On Polynomial Time Graph Grammars.
STACS 1988: 227-236 |
| 23 | | Franz-Josef Brandenburg:
On the Intersection of Stacks and Queues.
Theor. Comput. Sci. 58: 69-80 (1988) |
| 1987 |
|---|
| 22 | | Franz-Josef Brandenburg,
Guy Vidal-Naquet,
Martin Wirsing:
STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings
Springer 1987 |
| 21 | | Franz-Josef Brandenburg,
Andreas Brandstädt,
Klaus W. Wagner:
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines.
Mathematical Systems Theory 19(4): 277-299 (1987) |
| 20 | | Franz-Josef Brandenburg:
A Note on: `Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'.
Theor. Comput. Sci. 52: 341-342 (1987) |
| 19 | | Franz-Josef Brandenburg:
Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets.
Theor. Comput. Sci. 55(2-3): 183-263 (1987) |
| 1986 |
|---|
| 18 | | Franz-Josef Brandenburg:
On Partially Ordered Graph Grammars.
Graph-Grammars and Their Application to Computer Science 1986: 99-111 |
| 17 | | Franz-Josef Brandenburg:
Intersections of Some Families of Languages.
ICALP 1986: 60-68 |
| 1984 |
|---|
| 16 | | Franz-Josef Brandenburg:
A Truely Morphic Characterization of Recursively Enumerable Sets.
MFCS 1984: 205-213 |
| 1983 |
|---|
| 15 | | Franz-Josef Brandenburg:
The computational complexity of certain graph grammars.
Theoretical Computer Science 1983: 91-99 |
| 14 | | Franz-Josef Brandenburg:
Uniformly Growing k-TH Power-Free Homomorphisms.
Theor. Comput. Sci. 23: 69-82 (1983) |
| 1982 |
|---|
| 13 | | Franz-Josef Brandenburg:
Extended Chomsky-Schützenberger Theorems.
ICALP 1982: 83-93 |
| 12 | | Franz-Josef Brandenburg:
A Note on Generalized Parikh Equality Sets.
Elektronische Informationsverarbeitung und Kybernetik 18(10/11): 565-568 (1982) |
| 1981 |
|---|
| 11 | | Franz-Josef Brandenburg:
Analogies of PAL and COPY.
FCT 1981: 61-70 |
| 10 | | Franz-Josef Brandenburg:
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report).
MFCS 1981: 224-233 |
| 9 | | Franz-Josef Brandenburg:
On the Height of Syntactical Graphs.
Theoretical Computer Science 1981: 13-21 |
| 8 | | Franz-Josef Brandenburg:
Unary Multiple Equality Sets: The Languages of Rational Matrices
Information and Control 50(3): 199-227 (1981) |
| 7 | | Franz-Josef Brandenburg:
Three Write Heads Are as Good as k.
Mathematical Systems Theory 14: 1-12 (1981) |
| 1980 |
|---|
| 6 | | Franz-Josef Brandenburg:
Multiple Equality Sets and Post Machines.
J. Comput. Syst. Sci. 21(3): 292-316 (1980) |
| 5 | | Ronald V. Book,
Franz-Josef Brandenburg:
Equality Sets and Complexity Classes.
SIAM J. Comput. 9(4): 729-743 (1980) |
| 1979 |
|---|
| 4 | | Ronald V. Book,
Franz-Josef Brandenburg:
Representing Complexity Classes by Equality Sets (Preliminary Report).
ICALP 1979: 49-57 |
| 1977 |
|---|
| 3 | | Franz-Josef Brandenburg:
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages.
ICALP 1977: 120-134 |
| 2 | | Franz-Josef Brandenburg:
On one-way auxiliary pushdown automata.
Theoretical Computer Science 1977: 132-144 |
| 1973 |
|---|
| 1 | | Franz-Josef Brandenburg:
Der Einfluß von Kontext auf spezielle CF-Grammatiken.
Automatentheorie und Formale Sprachen 1973: 139-148 |
