default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranz-Josef Brandenburg
Franz J. Brandenburg
Person information
- affiliation: University of Passau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Franz J. Brandenburg
:
Straight-line drawings of 1-planar graphs. Comput. Geom. 116: 102036 (2024)- 2023
- [j50]Franz J. Brandenburg:
On Optimal Beyond-Planar Graphs. Comput. Geom. Topol. 2(1): 3:1-3:15 (2023) - [i21]Franz J. Brandenburg:
Embedding 1-Planar Graphs in Ten Pages. CoRR abs/2312.15786 (2023) - [i20]Franz J. Brandenburg:
Unique Triangulated 1-Planar Graphs. CoRR abs/2312.15793 (2023) - 2022
- [i19]Franz J. Brandenburg:
On Optimal Beyond-Planar Graphs. CoRR abs/2201.00783 (2022) - 2021
- [j49]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Correction to: Outer 1-Planar Graphs. Algorithmica 83(11): 3534-3535 (2021) - [j48]Franz J. Brandenburg:
Fan-crossing free graphs and their relationship to other beyond-planar graphs. Theor. Comput. Sci. 867: 85-100 (2021) - [i18]Franz J. Brandenburg:
Straight-line Drawings of 1-Planar Graphs. CoRR abs/2109.01692 (2021) - 2020
- [j47]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j46]Franz J. Brandenburg:
On fan-crossing graphs. Theor. Comput. Sci. 841: 39-49 (2020) - [i17]Franz J. Brandenburg:
Fan-Crossing Free Graphs. CoRR abs/2003.08468 (2020) - [i16]Franz J. Brandenburg:
Book Embeddings of k-Map Graphs. CoRR abs/2012.06874 (2020)
2010 – 2019
- 2019
- [j45]Franz J. Brandenburg:
Characterizing and Recognizing 4-Map Graphs. Algorithmica 81(5): 1818-1843 (2019) - [j44]Franz J. Brandenburg:
Characterizing 5-map graphs by 2-fan-crossing graphs. Discret. Appl. Math. 268: 10-20 (2019) - [i15]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR abs/1909.00223 (2019) - 2018
- [j43]Franz J. Brandenburg:
Recognizing Optimal 1-Planar Graphs in Linear Time. Algorithmica 80(1): 1-28 (2018) - [j42]Franz J. Brandenburg:
T-shape visibility representations of 1-planar graphs. Comput. Geom. 69: 16-30 (2018) - [j41]Franz J. Brandenburg:
On fan-crossing and fan-crossing free graphs. Inf. Process. Lett. 138: 67-71 (2018) - [j40]Franz J. Brandenburg:
A First Order Logic Definition of Beyond-Planar Graphs. J. Graph Algorithms Appl. 22(1): 51-66 (2018) - [j39]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Data Structures and their Planar Graph Layouts. J. Graph Algorithms Appl. 22(2): 207-237 (2018) - [j38]Franz J. Brandenburg:
Recognizing IC-Planar and NIC-Planar Graphs. J. Graph Algorithms Appl. 22(2): 239-271 (2018) - 2017
- [j37]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. Discret. Appl. Math. 232: 23-40 (2017) - [j36]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. J. Graph Algorithms Appl. 21(3): 281-312 (2017) - [c70]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter:
On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG 2017: 59-74 - [i14]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-Planar Graphs. CoRR abs/1701.04375 (2017) - [i13]Franz J. Brandenburg:
T-Shape Visibility Representations of 1-Planar Graphs. CoRR abs/1702.05265 (2017) - [i12]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer:
A Note on IC-Planar Graphs. CoRR abs/1707.08652 (2017) - [i11]Franz J. Brandenburg:
On Fan-Crossing Graphs. CoRR abs/1712.06840 (2017) - 2016
- [j35]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Outer 1-Planar Graphs. Algorithmica 74(4): 1293-1320 (2016) - [j34]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636: 1-16 (2016) - [j33]Franz J. Brandenburg, Andreas Gleißner:
Ranking chain sum orders. Theor. Comput. Sci. 636: 66-76 (2016) - [c69]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. WALCOM 2016: 95-106 - [i10]Franz J. Brandenburg:
A Reduction System for Optimal 1-Planar Graphs. CoRR abs/1602.06407 (2016) - [i9]Franz J. Brandenburg:
Recognizing Optimal 1-Planar Graphs in Linear Time. CoRR abs/1602.08022 (2016) - [i8]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
Path-Additions of Graphs. CoRR abs/1605.02891 (2016) - [i7]Franz J. Brandenburg:
Recognizing IC-Planar and NIC-Planar Graphs. CoRR abs/1610.08884 (2016) - 2015
- [j32]Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On the hardness of maximum rank aggregation problems. J. Discrete Algorithms 31: 2-13 (2015) - [j31]Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
1-Planarity of Graphs with a Rotation System. J. Graph Algorithms Appl. 19(1): 67-86 (2015) - [j30]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer:
Upward planar graphs and their duals. Theor. Comput. Sci. 571: 36-49 (2015) - [c68]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. GD 2015: 295-308 - [c67]Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth:
On Bar (1, j)-Visibility Graphs - (Extended Abstract). WALCOM 2015: 246-257 - [i6]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-planar Graphs. CoRR abs/1509.00388 (2015) - [i5]Franz J. Brandenburg:
On 4-Map Graphs and 1-Planar Graphs and their Recognition Problem. CoRR abs/1509.03447 (2015) - [i4]Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov:
On the Book Thickness of 1-Planar Graphs. CoRR abs/1510.05891 (2015) - 2014
- [j29]Franz-Josef Brandenburg:
Upward planar drawings on the standing and the rolling cylinders. Comput. Geom. 47(1): 25-41 (2014) - [j28]Franz J. Brandenburg:
1-Visibility Representations of 1-Planar Graphs. J. Graph Algorithms Appl. 18(3): 421-438 (2014) - 2013
- [j27]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall tau Distances. Discret. Math. Algorithms Appl. 5(2) (2013) - [j26]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): 310-332 (2013) - [j25]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. J. Graph Algorithms Appl. 17(4): 541-565 (2013) - [c66]Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer:
Characterizing Planarity by the Splittable Deque. GD 2013: 25-36 - [c65]Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov:
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. GD 2013: 83-94 - [c64]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Recognizing Outer 1-Planar Graphs in Linear Time. GD 2013: 107-118 - [c63]Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On Maximum Rank Aggregation Problems. IWOCA 2013: 14-27 - [c62]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer:
Rolling Upward Planarity Testing of Strongly Connected Graphs. WG 2013: 38-49 - [c61]Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer:
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. WG 2013: 298-309 - [i3]Franz-Josef Brandenburg:
1-Visibility Representations of 1-Planar Graphs. CoRR abs/1308.5079 (2013) - 2012
- [j24]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp:
Drawing Recurrent Hierarchies. J. Graph Algorithms Appl. 16(2): 151-198 (2012) - [c60]Franz-Josef Brandenburg:
On the Curve Complexity of Upward Planar Drawings. CATS 2012: 27-36 - [c59]Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber:
On the Density of Maximal 1-Planar Graphs. GD 2012: 327-338 - [c58]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. GD 2012: 529-540 - [c57]Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
On Sparse Maximal 2-Planar Graphs. GD 2012: 555-556 - [c56]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall Tau Distances. WALCOM 2012: 88-99 - [c55]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
The Duals of Upward Planar Graphs on Cylinders. WG 2012: 103-113 - 2011
- [j23]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
Global k-Level Crossing Reduction. J. Graph Algorithms Appl. 15(5): 631-659 (2011) - [j22]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): 391-401 (2011) - [j21]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): 1587-1598 (2011) - [c54]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders. FAW-AAIM 2011: 352-363 - [c53]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner:
Classification of Planar Upward Embedding. GD 2011: 415-426 - [c52]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. GD 2011: 435-440 - [i2]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 abs/1109.1465 (2011) - 2010
- [c51]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Plane Drawings of Queue and Deque Graphs. GD 2010: 68-79 - [c50]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
A Global k-Level Crossing Reduction Algorithm. WALCOM 2010: 70-81
2000 – 2009
- 2009
- [j20]Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
On the complexity of crossings in permutations. Discret. Math. 309(7): 1813-1823 (2009) - [c49]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp:
Coordinate Assignment for Cyclic Level Graphs. COCOON 2009: 66-75 - [c48]Franz-Josef Brandenburg, Mao-cheng Cai:
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW 2009: 4-15 - 2008
- [j19]Franz-Josef Brandenburg:
Drawing Planar Graphs on (8/9)*n2 Area. Electron. Notes Discret. Math. 31: 37-40 (2008) - [c47]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász:
Cyclic Leveling of Directed Graphs. GD 2008: 348-359 - [c46]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried:
Tree Drawings on the Hexagonal Grid. GD 2008: 372-383 - [i1]Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
08191 Working Group Report - X-graphs of Y-graphs and their Representations. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2006
- [c45]Therese Biedl, Franz-Josef Brandenburg:
Partitions of Graphs into Trees. GD 2006: 430-439 - [c44]Franz-Josef Brandenburg, Stephanie Herrmann:
Graph Searching and Search Time. SOFSEM 2006: 197-206 - 2005
- [j18]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) - [j17]Franz-Josef Brandenburg, Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1-3): 199-232 (2005) - [c43]Therese Biedl, Franz-Josef Brandenburg:
Drawing planar bipartite graphs with small area. CCCG 2005: 105-108 - [c42]Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
Crossings and Permutations. GD 2005: 1-12 - 2004
- [j16]Sabine Bachl, Franz-Josef Brandenburg, Daniel Gmach:
Computing and Drawing Isomorphic Subgraphs. J. Graph Algorithms Appl. 8(2): 215-238 (2004) - [c41]Paul Holleis, Franz-Josef Brandenburg:
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. GD 2004: 465-470 - [c40]Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner:
Gravisto: Graph Visualization Toolkit. GD 2004: 502-503 - [c39]Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov:
Graph-Drawing Contest Report. GD 2004: 512-516 - [p1]Franz J. Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber:
BioPath - Exploration and Visualization of Biochemical Pathways. Graph Drawing Software 2004: 215-235 - 2003
- [c38]Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time. GD 2003: 393-405 - [c37]Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks:
Graph Drawing Contest Report. GD 2003: 504-508 - [c36]Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel:
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - [c35]Franz-Josef Brandenburg:
Erratum: Cycles in Generalized Networks. WG 2003: 383 - 2002
- [j15]Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber, Franz-Josef Brandenburg:
The system architecture of the BioPath system. Silico Biol. 2(3): 415-426 (2002) - [c34]Sabine Bachl, Franz-Josef Brandenburg:
Computing and Drawing Isomorphic Subgraphs. GD 2002: 74-85 - [c33]Franz-Josef Brandenburg:
Graph-Drawing Contest Report. GD 2002: 376-379 - [c32]Franz-Josef Brandenburg:
Cycles in Generalized Networks. WG 2002: 47-56 - 2001
- [c31]Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber:
BioPath Visualization of Biochemical Pathways. German Conference on Bioinformatics 2001: 11-15 - [c30]Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber:
BioPath. GD 2001: 455-456 - [c29]Therese Biedl, Franz-Josef Brandenburg:
Graph-Drawing Contest Report. GD 2001: 513-522 - 2000
- [c28]Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner:
Graph-Drawing Contest Report. GD 2000: 410-418
1990 – 1999
- 1999
- [c27]Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg:
Graph Clustering Using Distance-k Cliques. GD 1999: 98-106 - [c26]Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber:
Graph-Drawing Contest Report. GD 1999: 400-409 - 1998
- [j14]Franz-Josef Brandenburg:
The Ancestor Width of Grammars and Languages. Theor. Comput. Sci. 207(1): 25-41 (1998) - 1997
- [j13]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel:
Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum 20(4): 199-207 (1997) - [c25]Franz-Josef Brandenburg:
Homomorphic Representations of Certain Classes of Languages. Advances in Algorithms, Languages, and Complexity 1997: 93-110 - [c24]Franz-Josef Brandenburg:
Graph Clustering 1: Circles of Cliques. GD 1997: 158-168 - [c23]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 - 1996
- [e2]Franz-Josef Brandenburg:
Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995, Proceedings. Lecture Notes in Computer Science 1027, Springer 1996, ISBN 3-540-60723-4 [contents] - 1995
- [c22]Franz-Josef Brandenburg, Michael Himsolt, Christoph Rohrer:
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. GD 1995: 76-87 - 1994
- [c21]Franz-Josef Brandenburg:
Designing Graph Drawings by Layout Graph Grammars. GD 1994: 416-427 - [c20]Franz-Josef Brandenburg, Konstantin Skodinis:
Graph Automata for Linear Graph Languages. TAGT 1994: 336-350 - 1993
- [j12]Franz-Josef Brandenburg, Jürgen Dassow:
Efficient Reductions of Picture Words. RAIRO Theor. Informatics Appl. 27(1): 49-56 (1993) - 1991
- [j11]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): 163-167 (1991) - [c19]Franz-Josef Brandenburg:
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. RTA 1991: 312-322 - 1990
- [c18]Franz-Josef Brandenburg:
Layout Graph Grammars: The Placement Approach. Graph-Grammars and Their Application to Computer Science 1990: 144-156 - [c17]Franz-Josef Brandenburg, Michal Chytil:
Cycle Chain Code Picture Languages. Graph-Grammars and Their Application to Computer Science 1990: 157-173
1980 – 1989
- 1989
- [c16]Franz-Josef Brandenburg:
On the Complexity of Optimal Drawings of Graphs. WG 1989: 166-180 - 1988
- [j10]Franz-Josef Brandenburg:
On the Intersection of Stacks and Queues. Theor. Comput. Sci. 58: 69-80 (1988) - [c15]Franz-Josef Brandenburg:
Nice drawings of graphs are computationally hard. Informatics and Psychology Workshop 1988: 1-15 - [c14]Franz-Josef Brandenburg:
On Polynomial Time Graph Grammars. STACS 1988: 227-236 - 1987
- [j9]Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner:
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Math. Syst. Theory 19(4): 277-299 (1987) - [j8]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) - [j7]Franz-Josef Brandenburg:
Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets. Theor. Comput. Sci. 55(2-3): 183-263 (1987) - [e1]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. Lecture Notes in Computer Science 247, Springer 1987, ISBN 3-540-17219-X [contents] - 1986
- [c13]Franz-Josef Brandenburg:
On Partially Ordered Graph Grammars. Graph-Grammars and Their Application to Computer Science 1986: 99-111 - [c12]Franz-Josef Brandenburg:
Intersections of Some Families of Languages. ICALP 1986: 60-68 - 1984
- [c11]Franz-Josef Brandenburg:
A Truely Morphic Characterization of Recursively Enumerable Sets. MFCS 1984: 205-213 - 1983
- [j6]Franz-Josef Brandenburg:
Uniformly Growing k-TH Power-Free Homomorphisms. Theor. Comput. Sci. 23: 69-82 (1983) - [c10]Franz-Josef Brandenburg:
The computational complexity of certain graph grammars. Theoretical Computer Science 1983: 91-99 - [c9]Franz-Josef Brandenburg:
On the Complexity of the Membership Problem of Graph Grammars. WG 1983: 40-49 - 1982
- [j5]Franz-Josef Brandenburg:
A Note on Generalized Parikh Equality Sets. J. Inf. Process. Cybern. 18(10/11): 565-568 (1982) - [c8]Franz-Josef Brandenburg:
Extended Chomsky-Schützenberger Theorems. ICALP 1982: 83-93 - 1981
- [j4]Franz-Josef Brandenburg:
Unary Multiple Equality Sets: The Languages of Rational Matrices. Inf. Control. 50(3): 199-227 (1981) - [j3]Franz-Josef Brandenburg:
Three Write Heads Are as Good as k. Math. Syst. Theory 14: 1-12 (1981) - [c7]Franz-Josef Brandenburg:
Analogies of PAL and COPY. FCT 1981: 61-70 - [c6]Franz-Josef Brandenburg:
On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report). MFCS 1981: 224-233 - [c5]Franz-Josef Brandenburg:
On the Height of Syntactical Graphs. Theoretical Computer Science 1981: 13-21 - 1980
- [j2]Franz-Josef Brandenburg:
Multiple Equality Sets and Post Machines. J. Comput. Syst. Sci. 21(3): 292-316 (1980) - [j1]Ronald V. Book, Franz-Josef Brandenburg:
Equality Sets and Complexity Classes. SIAM J. Comput. 9(4): 729-743 (1980)
1970 – 1979
- 1979
- [c4]Ronald V. Book, Franz-Josef Brandenburg:
Representing Complexity Classes by Equality Sets (Preliminary Report). ICALP 1979: 49-57 - 1977
- [c3]Franz-Josef Brandenburg:
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. ICALP 1977: 120-134 - [c2]Franz-Josef Brandenburg:
On one-way auxiliary pushdown automata. Theoretical Computer Science 1977: 132-144 - 1973
- [c1]Franz-Josef Brandenburg:
Der Einfluß von Kontext auf spezielle CF-Grammatiken. Automatentheorie und Formale Sprachen 1973: 139-148
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
