Franz-Josef Brandenburg

Publication Activity (10 Years)

Years Active: 1973-2014
Publications (10 Years): 0

Top Topics

Top Venues

J. Comb. Optim.

Publications

Franz-Josef Brandenburg
Upward planar drawings on the standing and the rolling cylinders. Comput. Geom. 47 (1) (2014)
Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
Comparing and Aggregating Partial Orders with Kendall tau Distances. Discret. Math. Algorithms Appl. 5 (2) (2013)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer
Rolling Upward Planarity Testing of Strongly Connected Graphs. WG (2013)
Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. J. Comb. Optim. 26 (2) (2013)
Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
On Maximum Rank Aggregation Problems. IWOCA (2013)
Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. WG (2013)
Franz-Josef Brandenburg
1-Visibility Representations of 1-Planar Graphs. CoRR (2013)
Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
On the Density of Maximal 1-Planar Graphs. Graph Drawing (2012)
Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
On Sparse Maximal 2-Planar Graphs. Graph Drawing (2012)
Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
Comparing and Aggregating Partial Orders with Kendall Tau Distances. WALCOM (2012)
Franz-Josef Brandenburg
On the Curve Complexity of Upward Planar Drawings. CATS (2012)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber
Optical Graph Recognition. Graph Drawing (2012)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer
The Duals of Upward Planar Graphs on Cylinders. WG (2012)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp
Drawing Recurrent Hierarchies. J. Graph Algorithms Appl. 16 (2) (2012)
Vladimir Batagelj, Franz-Josef Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani
Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17 (11) (2011)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner
Classification of Planar Upward Embedding. Graph Drawing (2011)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner
Global k-Level Crossing Reduction. J. Graph Algorithms Appl. 15 (5) (2011)
Franz-Josef Brandenburg, Mao-cheng Cai
Shortest path and maximum flow problems in networks with additive losses and gains. Theor. Comput. Sci. 412 (4-5) (2011)
Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier
The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders. FAW-AAIM (2011)
Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow
The Open Graph Archive: A Community-Driven Effort. Graph Drawing (2011)
Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow
The Open Graph Archive: A Community-Driven Effort CoRR (2011)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner
-Level Crossing Reduction Algorithm. WALCOM (2010)
Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner
Plane Drawings of Queue and Deque Graphs. Graph Drawing (2010)
Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng
On the complexity of crossings in permutations. Discret. Math. 309 (7) (2009)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp
Coordinate Assignment for Cyclic Level Graphs. COCOON (2009)
Franz-Josef Brandenburg, Mao-cheng Cai
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW (2009)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász
Cyclic Leveling of Directed Graphs. Graph Drawing (2008)
Franz-Josef Brandenburg
Area. Electron. Notes Discret. Math. 31 (2008)
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried
Tree Drawings on the Hexagonal Grid. Graph Drawing (2008)
Therese C. Biedl, Franz-Josef Brandenburg
Partitions of Graphs into Trees. Graph Drawing (2006)
Franz-Josef Brandenburg, Stephanie Herrmann
Graph Searching and Search Time. SOFSEM (2006)
Franz-Josef Brandenburg, Konstantin Skodinis
Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332 (1-3) (2005)
Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
Radial Level Planarity Testing and Embedding in Linear Time. J. Graph Algorithms Appl. 9 (1) (2005)
Therese C. Biedl, Franz-Josef Brandenburg
Drawing planar bipartite graphs with small area. CCCG (2005)
Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng
Crossings and Permutations. Graph Drawing (2005)
Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov
Graph-Drawing Contest Report. Graph Drawing (2004)
Sabine Bachl, Franz-Josef Brandenburg, Daniel Gmach
Computing and Drawing Isomorphic Subgraphs. J. Graph Algorithms Appl. 8 (2) (2004)
Paul Holleis, Franz-Josef Brandenburg
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. Graph Drawing (2004)
Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner
Gravisto: Graph Visualization Toolkit. Graph Drawing (2004)
Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
Selected Open Problems in Graph Drawing. Graph Drawing (2003)
Franz-Josef Brandenburg
Erratum: Cycles in Generalized Networks. WG (2003)
Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
Radial Level Planarity Testing and Embedding in Linear Time. Graph Drawing (2003)
Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
Graph Drawing Contest Report. Graph Drawing (2003)
Franz-Josef Brandenburg
Graph-Drawing Contest Report. Graph Drawing (2002)
Sabine Bachl, Franz-Josef Brandenburg
Computing and Drawing Isomorphic Subgraphs. Graph Drawing (2002)
Franz-Josef Brandenburg
Cycles in Generalized Networks. WG (2002)
Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, Franz-Josef Brandenburg
The system architecture of the BioPath system. Silico Biol. 2 (3) (2002)
Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
BioPath Visualization of Biochemical Pathways. German Conference on Bioinformatics (2001)
Therese C. Biedl, Franz-Josef Brandenburg
Graph-Drawing Contest Report. Graph Drawing (2001)
Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
BioPath. Graph Drawing (2001)
Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner
Graph-Drawing Contest Report. Graph Drawing (2000)
Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg
Graph Clustering Using Distance-k Cliques. Graph Drawing (1999)
Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
Graph-Drawing Contest Report. Graph Drawing (1999)
Franz-Josef Brandenburg
The Ancestor Width of Grammars and Languages. Theor. Comput. Sci. 207 (1) (1998)
Franz-Josef Brandenburg
Graph Clustering 1: Circles of Cliques. Graph Drawing (1997)
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)
Franz-Josef Brandenburg
Homomorphic Representations of Certain Classes of Languages. Advances in Algorithms, Languages, and Complexity (1997)
Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel
Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum 20 (4) (1997)
Franz-Josef Brandenburg, Michael Himsolt, Christoph Rohrer
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. Graph Drawing (1995)
Franz-Josef Brandenburg, Konstantin Skodinis
Graph Automata for Linear Graph Languages. TAGT (1994)
Franz-Josef Brandenburg
Designing Graph Drawings by Layout Graph Grammars. Graph Drawing (1994)
Franz-Josef Brandenburg, Jürgen Dassow
Efficient Reductions of Picture Words. RAIRO Theor. Informatics Appl. 27 (1) (1993)
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. Inform. Spektrum 14 (3) (1991)
Franz-Josef Brandenburg
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. RTA (1991)
Franz-Josef Brandenburg
Layout Graph Grammars: The Placement Approach. Graph-Grammars and Their Application to Computer Science (1990)
Franz-Josef Brandenburg, Michal Chytil
Cycle Chain Code Picture Languages. Graph-Grammars and Their Application to Computer Science (1990)
Franz-Josef Brandenburg
On the Complexity of Optimal Drawings of Graphs. WG (1989)
Franz-Josef Brandenburg
On the Intersection of Stacks and Queues. Theor. Comput. Sci. 58 (1988)
Franz-Josef Brandenburg
Nice drawings of graphs are computationally hard. Informatics and Psychology Workshop (1988)
Franz-Josef Brandenburg
On Polynomial Time Graph Grammars. STACS (1988)
Franz-Josef Brandenburg
Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets. Theor. Comput. Sci. 55 (2-3) (1987)
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 (1987)
Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Math. Syst. Theory 19 (4) (1987)
Franz-Josef Brandenburg
On Partially Ordered Graph Grammars. Graph-Grammars and Their Application to Computer Science (1986)
Franz-Josef Brandenburg
Intersections of Some Families of Languages. ICALP (1986)
Franz-Josef Brandenburg
A Truely Morphic Characterization of Recursively Enumerable Sets. MFCS (1984)
Franz-Josef Brandenburg
The computational complexity of certain graph grammars. Theoretical Computer Science (1983)
Franz-Josef Brandenburg
On the Complexity of the Membership Problem of Graph Grammars. WG (1983)
Franz-Josef Brandenburg
Uniformly Growing k-TH Power-Free Homomorphisms. Theor. Comput. Sci. 23 (1983)
Franz-Josef Brandenburg
Extended Chomsky-Schützenberger Theorems. ICALP (1982)
Franz-Josef Brandenburg
A Note on Generalized Parikh Equality Sets. J. Inf. Process. Cybern. 18 (10/11) (1982)
Franz-Josef Brandenburg
Analogies of PAL and COPY. FCT (1981)
Franz-Josef Brandenburg
Three Write Heads Are as Good as k. Math. Syst. Theory 14 (1981)
Franz-Josef Brandenburg
On the Height of Syntactical Graphs. Theoretical Computer Science (1981)
Franz-Josef Brandenburg
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). MFCS (1981)
Franz-Josef Brandenburg
Unary Multiple Equality Sets: The Languages of Rational Matrices Inf. Control. 50 (3) (1981)
Ronald V. Book, Franz-Josef Brandenburg
Equality Sets and Complexity Classes. SIAM J. Comput. 9 (4) (1980)
Franz-Josef Brandenburg
Multiple Equality Sets and Post Machines. J. Comput. Syst. Sci. 21 (3) (1980)
Ronald V. Book, Franz-Josef Brandenburg
Representing Complexity Classes by Equality Sets (Preliminary Report). ICALP (1979)
Franz-Josef Brandenburg
On one-way auxiliary pushdown automata. Theoretical Computer Science (1977)
Franz-Josef Brandenburg
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. ICALP (1977)
Franz-Josef Brandenburg
Der Einfluß von Kontext auf spezielle CF-Grammatiken. Automatentheorie und Formale Sprachen (1973)