Der Einfluß von Kontext auf spezielle CF-Grammatiken. - Franz-Josef Brandenburg (Automatentheorie und Formale Sprachen, 1973)

The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. - Franz-Josef Brandenburg (ICALP, 1977)

On one-way auxiliary pushdown automata. - Franz-Josef Brandenburg (Theoretical Computer Science, 1977)

Representing Complexity Classes by Equality Sets (Preliminary Report). - Ronald V. Book; Franz-Josef Brandenburg (ICALP, 1979)

Multiple Equality Sets and Post Machines. - Franz-Josef Brandenburg (J. Comput. Syst. Sci., 1980)

Equality Sets and Complexity Classes. - Ronald V. Book; Franz-Josef Brandenburg (SIAM J. Comput., 1980)

Analogies of PAL and COPY. - Franz-Josef Brandenburg (FCT, 1981)

On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). - Franz-Josef Brandenburg (MFCS, 1981)

On the Height of Syntactical Graphs. - Franz-Josef Brandenburg (Theoretical Computer Science, 1981)

Three Write Heads Are as Good as k. - Franz-Josef Brandenburg (Math. Syst. Theory, 1981)

Unary Multiple Equality Sets: The Languages of Rational Matrices - Franz-Josef Brandenburg (Inf. Control., 1981)

Extended Chomsky-Schützenberger Theorems. - Franz-Josef Brandenburg (ICALP, 1982)

A Note on Generalized Parikh Equality Sets. - Franz-Josef Brandenburg (J. Inf. Process. Cybern., 1982)

The computational complexity of certain graph grammars. - Franz-Josef Brandenburg (Theoretical Computer Science, 1983)

On the Complexity of the Membership Problem of Graph Grammars. - Franz-Josef Brandenburg (WG, 1983)

Uniformly Growing k-TH Power-Free Homomorphisms. - Franz-Josef Brandenburg (Theor. Comput. Sci., 1983)

A Truely Morphic Characterization of Recursively Enumerable Sets. - Franz-Josef Brandenburg (MFCS, 1984)

On Partially Ordered Graph Grammars. - Franz-Josef Brandenburg (Graph-Grammars and Their Application to Computer Science, 1986)

Intersections of Some Families of Languages. - Franz-Josef Brandenburg (ICALP, 1986)

Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. - Franz-Josef Brandenburg; Andreas Brandstädt; Klaus W. Wagner (Math. Syst. Theory, 1987)

A Note on: 'Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'. - Franz-Josef Brandenburg (Theor. Comput. Sci., 1987)

Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets. - Franz-Josef Brandenburg (Theor. Comput. Sci., 1987)

Nice drawings of graphs are computationally hard. - Franz-Josef Brandenburg (Informatics and Psychology Workshop, 1988)

On Polynomial Time Graph Grammars. - Franz-Josef Brandenburg (STACS, 1988)

On the Intersection of Stacks and Queues. - Franz-Josef Brandenburg (Theor. Comput. Sci., 1988)

On the Complexity of Optimal Drawings of Graphs. - Franz-Josef Brandenburg (WG, 1989)

Layout Graph Grammars: The Placement Approach. - Franz-Josef Brandenburg (Graph-Grammars and Their Application to Computer Science, 1990)

Cycle Chain Code Picture Languages. - Franz-Josef Brandenburg; Michal Chytil (Graph-Grammars and Their Application to Computer Science, 1990)

The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. - Franz-Josef Brandenburg (RTA, 1991)

Gemeinsame Stellungnahme der Fakultätentage Elektrotechnik und Informatik zur Abstimmung ihrer Fachgebierte im Bereich Informationstechnik. - Franz-Josef Brandenburg; Werner Freise; Winfried Görke; Reiner W. Hartenstein; P. Kühn; H. J. Schmitt (Inform. Spektrum, 1991)

Efficient Reductions of Picture Words. - Franz-Josef Brandenburg; Jürgen Dassow (RAIRO Theor. Informatics Appl., 1993)

Designing Graph Drawings by Layout Graph Grammars. - Franz-Josef Brandenburg (GD, 1994)

Graph Automata for Linear Graph Languages. - Franz-Josef Brandenburg; Konstantin Skodinis (TAGT, 1994)

An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. - Franz-Josef Brandenburg; Michael Himsolt; Christoph Rohrer (GD, 1995)

Homomorphic Representations of Certain Classes of Languages. - Franz-Josef Brandenburg (Advances in Algorithms, Languages, and Complexity, 1997)

Graph Clustering 1: Circles of Cliques. - Franz-Josef Brandenburg (GD, 1997)

Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel; Thomas Lengauer (GI Jahrestagung, 1997)

Algorithmen zum automatischen Zeichnen von Graphen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel (Inform. Spektrum, 1997)

The Ancestor Width of Grammars and Languages. - Franz-Josef Brandenburg (Theor. Comput. Sci., 1998)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg; Michael Jünger; Joe Marks; Petra Mutzel; Falk Schreiber (GD, 1999)

Graph Clustering Using Distance-k Cliques. - Jubin Edachery; Arunabha Sen; Franz-Josef Brandenburg (GD, 1999)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg; Ulrik Brandes; Michael Himsolt; Marcus Raitner (GD, 2000)

BioPath Visualization of Biochemical Pathways. - Franz-Josef Brandenburg; Michael Forster; Andreas Pick; Marcus Raitner; Falk Schreiber (German Conference on Bioinformatics, 2001)

Graph-Drawing Contest Report. - Therese Biedl; Franz-Josef Brandenburg (GD, 2001)

BioPath. - Franz-Josef Brandenburg; Michael Forster; Andreas Pick; Marcus Raitner; Falk Schreiber (GD, 2001)

Computing and Drawing Isomorphic Subgraphs. - Sabine Bachl; Franz-Josef Brandenburg (GD, 2002)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg (GD, 2002)

Cycles in Generalized Networks. - Franz-Josef Brandenburg (WG, 2002)

The system architecture of the BioPath system. - Michael Forster; Andreas Pick; Marcus Raitner; Falk Schreiber; Franz-Josef Brandenburg (Silico Biol., 2002)

Graph Drawing Contest Report. - Franz-Josef Brandenburg; Ulrik Brandes; Peter Eades; Joe Marks (GD, 2003)

Selected Open Problems in Graph Drawing. - Franz-Josef Brandenburg; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel (GD, 2003)

Erratum: Cycles in Generalized Networks. - Franz-Josef Brandenburg (WG, 2003)

BioPath - Exploration and Visualization of Biochemical Pathways. - Franz J. Brandenburg; Michael Forster; Andreas Pick; Marcus Raitner; Falk Schreiber (Graph Drawing Software, 2004)

Gravisto: Graph Visualization Toolkit. - Christian Bachmaier; Franz-Josef Brandenburg; Michael Forster; Paul Holleis; Marcus Raitner (GD, 2004)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg; Christian A. Duncan; Emden R. Gansner; Stephen G. Kobourov (GD, 2004)

QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. - Paul Holleis; Franz-Josef Brandenburg (GD, 2004)

Computing and Drawing Isomorphic Subgraphs. - Sabine Bachl; Franz-Josef Brandenburg; Daniel Gmach (J. Graph Algorithms Appl., 2004)

Drawing planar bipartite graphs with small area. - Therese Biedl; Franz-Josef Brandenburg (CCCG, 2005)

Crossings and Permutations. - Therese Biedl; Franz-Josef Brandenburg; Xiaotie Deng (GD, 2005)

Radial Level Planarity Testing and Embedding in Linear Time. - Christian Bachmaier; Franz-Josef Brandenburg; Michael Forster (J. Graph Algorithms Appl., 2005)

Finite graph automata for linear and boundary graph languages. - Franz-Josef Brandenburg; Konstantin Skodinis (Theor. Comput. Sci., 2005)

Partitions of Graphs into Trees. - Therese Biedl; Franz-Josef Brandenburg (GD, 2006)

Graph Searching and Search Time. - Franz-Josef Brandenburg; Stephanie Herrmann (SOFSEM, 2006)

08191 Working Group Report - X-graphs of Y-graphs and their Representations. - Vladimir Batagelj; Franz J. Brandenburg; Walter Didimo; Giuseppe Liotta; Maurizio Patrignani (Graph Drawing with Applications to Bioinformatics and Social Sciences, 2008)

Tree Drawings on the Hexagonal Grid. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Andreas Hofmeier; Marco Matzeder; Thomas Unfried (GD, 2008)

Cyclic Leveling of Directed Graphs. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Gergö Lovász (GD, 2008)

Drawing Planar Graphs on (8/9)*n2 Area. - Franz-Josef Brandenburg (Electron. Notes Discret. Math., 2008)

Coordinate Assignment for Cyclic Level Graphs. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Raymund Fülöp (COCOON, 2009)

On the complexity of crossings in permutations. - Therese Biedl; Franz-Josef Brandenburg; Xiaotie Deng (Discret. Math., 2009)

Plane Drawings of Queue and Deque Graphs. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Andreas Gleißner (GD, 2010)

A Global k-Level Crossing Reduction Algorithm. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Ferdinand Hübner (WALCOM, 2010)

Classification of Planar Upward Embedding. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner (GD, 2011)

The Open Graph Archive: A Community-Driven Effort. - Christian Bachmaier; Franz-Josef Brandenburg; Philip Effinger; Carsten Gutwenger; Jyrki Katajainen; Karsten Klein 001; Miro Spönemann; Matthias Stegmaier; Michael Wybrow (GD, 2011)

Global k-Level Crossing Reduction. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Ferdinand Hübner (J. Graph Algorithms Appl., 2011)

Shortest path and maximum flow problems in networks with additive losses and gains. - Franz-Josef Brandenburg; Mao-cheng Cai (Theor. Comput. Sci., 2011)

Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. - Vladimir Batagelj; Franz-Josef Brandenburg; Walter Didimo; Giuseppe Liotta; Pietro Palladino; Maurizio Patrignani (IEEE Trans. Vis. Comput. Graph., 2011)

On the Curve Complexity of Upward Planar Drawings. - Franz-Josef Brandenburg (CATS, 2012)

On Sparse Maximal 2-Planar Graphs. - Christopher Auer; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2012)

On the Density of Maximal 1-Planar Graphs. - Franz-Josef Brandenburg; David Eppstein; Andreas Gleißner; Michael T. Goodrich; Kathrin Hanauer; Josef Reislhuber (GD, 2012)

The Duals of Upward Planar Graphs on Cylinders. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (WG, 2012)

Drawing Recurrent Hierarchies. - Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Raymund Fülöp (J. Graph Algorithms Appl., 2012)

Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. - Md. Jawaherul Alam; Franz J. Brandenburg; Stephen G. Kobourov (GD, 2013)

Recognizing Outer 1-Planar Graphs in Linear Time. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (GD, 2013)

Characterizing Planarity by the Splittable Deque. - Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2013)

On Maximum Rank Aggregation Problems. - Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (IWOCA, 2013)

Rolling Upward Planarity Testing of Strongly Connected Graphs. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Kathrin Hanauer (WG, 2013)

Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. - Kathrin Hanauer; Franz-Josef Brandenburg; Christopher Auer (WG, 2013)

Comparing and Aggregating Partial Orders with Kendall tau Distances. - Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (Discret. Math. Algorithms Appl., 2013)

The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. - Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (J. Comb. Optim., 2013)

Optical Graph Recognition. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Josef Reislhuber (J. Graph Algorithms Appl., 2013)

Upward planar drawings on the standing and the rolling cylinders. - Franz-Josef Brandenburg (Comput. Geom., 2014)

1-Visibility Representations of 1-Planar Graphs. - Franz J. Brandenburg (J. Graph Algorithms Appl., 2014)

On Bar (1, j)-Visibility Graphs - (Extended Abstract). - Franz J. Brandenburg; Niklas Heinsohn; Michael Kaufmann 001; Daniel Neuwirth (WALCOM, 2015)

On the Book Thickness of 1-Planar Graphs. - Md. Jawaherul Alam; Franz J. Brandenburg; Stephen G. Kobourov (CoRR, 2015)

On 4-Map Graphs and 1-Planar Graphs and their Recognition Problem. - Franz J. Brandenburg (CoRR, 2015)

On the hardness of maximum rank aggregation problems. - Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Andreas Hofmeier (J. Discrete Algorithms, 2015)

1-Planarity of Graphs with a Rotation System. - Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Josef Reislhuber (J. Graph Algorithms Appl., 2015)

Upward planar graphs and their duals. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (Theor. Comput. Sci., 2015)

Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2016)

A Reduction System for Optimal 1-Planar Graphs. - Franz J. Brandenburg (CoRR, 2016)

Path-Additions of Graphs. - Franz J. Brandenburg; Alexander Esch; Daniel Neuwirth (CoRR, 2016)

Recognizing and drawing IC-planar graphs. - Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2016)

Ranking chain sum orders. - Franz J. Brandenburg; Andreas Gleißner (Theor. Comput. Sci., 2016)

On the Relationship Between k-Planar and k-Quasi-Planar Graphs. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter (WG, 2017)

A Note on IC-Planar Graphs. - Christian Bachmaier; Franz J. Brandenburg; Kathrin Hanauer (CoRR, 2017)

NIC-planar graphs. - Christian Bachmaier; Franz J. Brandenburg; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Discret. Appl. Math., 2017)

On Aligned Bar 1-Visibility Graphs. - Franz J. Brandenburg; Alexander Esch; Daniel Neuwirth (J. Graph Algorithms Appl., 2017)

Recognizing Optimal 1-Planar Graphs in Linear Time. - Franz J. Brandenburg (Algorithmica, 2018)

T-shape visibility representations of 1-planar graphs. - Franz J. Brandenburg (Comput. Geom., 2018)

On fan-crossing and fan-crossing free graphs. - Franz J. Brandenburg (Inf. Process. Lett., 2018)

Data Structures and their Planar Graph Layouts. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Wolfgang Brunner; Andreas Gleißner (J. Graph Algorithms Appl., 2018)

A First Order Logic Definition of Beyond-Planar Graphs. - Franz J. Brandenburg (J. Graph Algorithms Appl., 2018)

Recognizing IC-Planar and NIC-Planar Graphs. - Franz J. Brandenburg (J. Graph Algorithms Appl., 2018)

Characterizing and Recognizing 4-Map Graphs. - Franz J. Brandenburg (Algorithmica, 2019)

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (CoRR, 2019)

Characterizing 5-map graphs by 2-fan-crossing graphs. - Franz J. Brandenburg (Discret. Appl. Math., 2019)

Fan-Crossing Free Graphs. - Franz J. Brandenburg (CoRR, 2020)

Book Embeddings of k-Map Graphs. - Franz J. Brandenburg (CoRR, 2020)

Simple k-planar graphs are simple (k + 1)-quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (J. Comb. Theory B, 2020)

On fan-crossing graphs. - Franz J. Brandenburg (Theor. Comput. Sci., 2020)

Correction to: Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2021)

Fan-crossing free graphs and their relationship to other beyond-planar graphs. - Franz J. Brandenburg (Theor. Comput. Sci., 2021)

On Optimal Beyond-Planar Graphs. - Franz J. Brandenburg (Comput. Geom. Topol., 2023)

Embedding 1-Planar Graphs in Ten Pages. - Franz J. Brandenburg (CoRR, 2023)

Unique Triangulated 1-Planar Graphs. - Franz J. Brandenburg (CoRR, 2023)

Straight-line drawings of 1-planar graphs. - Franz J. Brandenburg (Comput. Geom., 2024)