Franz-Josef Brandenburg

	2012
80		Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier: Comparing and Aggregating Partial Orders with Kendall Tau Distances. WALCOM 2012: 88-99
79		Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp: Drawing Recurrent Hierarchies. J. Graph Algorithms Appl. 16(2): 151-198 (2012)
	2011
78		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
77		Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner: Classification of Planar Upward Embedding. Graph Drawing 2011: 415-426
76		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: 435-440
75		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)
74		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)
73		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)
	2010
72		Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner: Plane Drawings of Queue and Deque Graphs. Graph Drawing 2010: 68-79
71		Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner: A Global k-Level Crossing Reduction Algorithm. WALCOM 2010: 70-81
	2009
70		Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp: Coordinate Assignment for Cyclic Level Graphs. COCOON 2009: 66-75
69		Franz-Josef Brandenburg, Mao-cheng Cai: Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW 2009: 4-15
68		Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng: On the complexity of crossings in permutations. Discrete Mathematics 309(7): 1813-1823 (2009)
	2008
67		Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász: Cyclic Leveling of Directed Graphs. Graph Drawing 2008: 348-359
66		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		Franz-Josef Brandenburg: Drawing Planar Graphs on (8/9)*n2 Area. Electronic Notes in Discrete Mathematics 31: 37-40 (2008)
	2006
64		Therese C. Biedl, Franz-Josef Brandenburg: Partitions of Graphs into Trees. Graph Drawing 2006: 430-439
63		Franz-Josef Brandenburg, Stephanie Herrmann: Graph Searching and Search Time. SOFSEM 2006: 197-206
	2005
62		Therese C. Biedl, Franz-Josef Brandenburg: Drawing planar bipartite graphs with small area. CCCG 2005: 105-108
61		Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng: Crossings and Permutations. Graph Drawing 2005: 1-12
60		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		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		Paul Holleis, Franz-Josef Brandenburg: QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. Graph Drawing 2004: 465-470
57		Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner: Gravisto: Graph Visualization Toolkit. Graph Drawing 2004: 502-503
56		Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov: Graph-Drawing Contest Report. Graph Drawing 2004: 512-516
55		Sabine Bachl, Franz-Josef Brandenburg, Daniel Gmach: Computing and Drawing Isomorphic Subgraphs. J. Graph Algorithms Appl. 8(2): 215-238 (2004)
	2003
54		Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster: Radial Level Planarity Testing and Embedding in Linear Time. Graph Drawing 2003: 393-405
53		Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 2003: 504-508
52		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		Franz-Josef Brandenburg: Erratum: Cycles in Generalized Networks. WG 2003: 383
	2002
50		Franz-Josef Brandenburg: Graph-Drawing Contest Report. Graph Drawing 2002: 376-379
49		Sabine Bachl, Franz-Josef Brandenburg: Computing and Drawing Isomorphic Subgraphs. Graph Drawing 2002: 74-85
48		Franz-Josef Brandenburg: Cycles in Generalized Networks. WG 2002: 47-56
47		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		Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber: BioPath. Graph Drawing 2001: 455-456
44		Therese C. Biedl, Franz-Josef Brandenburg: Graph-Drawing Contest Report. Graph Drawing 2001: 513-522
	2000
43		Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner: Graph-Drawing Contest Report. Graph Drawing 2000: 410-418
	1999
42		Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber: Graph-Drawing Contest Report. Graph Drawing 1999: 400-409
41		Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg: Graph Clustering Using Distance-k Cliques. Graph Drawing 1999: 98-106
	1998
40		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

Coauthor Index

1	Christopher Auer	[72] [77]
2	Sabine Bachl	[49] [55]
3	Christian Bachmaier	[54] [57] [60] [66] [67] [70] [71] [72] [75] [76] [77] [79]
4	Vladimir Batagelj	[74]
5	Therese C. Biedl	[44] [61] [62] [64] [68]
6	Ronald V. Book	[4] [5]
7	Ulrik Brandes	[43] [53]
8	Andreas Brandstädt	[21]
9	Wolfgang Brunner	[66] [67] [70] [71] [72] [79]
10	Mao-cheng Cai	[69] [73]
11	Michal Chytil	[27]
12	Jürgen Dassow	[31]
13	Xiaotie Deng	[61] [68]
14	Walter Didimo	[74]
15	Christian A. Duncan	[56]
16	Peter Eades	[53]
17	Jubin Edachery	[41]
18	Philip Effinger	[75] [76]
19	David Eppstein	[52]
20	Michael Forster	[45] [46] [47] [54] [57] [60]
21	Werner Freise	[29]
22	Raymund Fülöp	[70] [79]
23	Emden R. Gansner	[56]
24	Andreas Gleißner	[72] [77] [78] [80]
25	Daniel Gmach	[55]
26	Michael T. Goodrich	[52]
27	Winfried Görke	[29]
28	Carsten Gutwenger	[75] [76]
29	Reiner W. Hartenstein	[29]
30	Stephanie Herrmann	[63]
31	Michael Himsolt	[34] [43]
32	Andreas Hofmeier	[66] [78] [80]
33	Paul Holleis	[57] [58]
34	Ferdinand Hübner	[71]
35	Michael Jünger	[36] [38] [42]
36	Jyrki Katajainen	[75] [76]
37	Karsten Klein	[75] [76]
38	Stephen G. Kobourov	[52] [56]
39	P. Kühn	[29]
40	Thomas Lengauer	[38]
41	Giuseppe Liotta	[52] [74]
42	Gergö Lovász	[67]
43	Joe Marks	[42] [53]
44	Marco Matzeder	[66]
45	Petra Mutzel	[36] [38] [42] [52]
46	Pietro Palladino	[74]
47	Maurizio Patrignani	[74]
48	Andreas Pick	[45] [46] [47]
49	Marcus Raitner	[43] [45] [46] [47] [57]
50	Christoph Rohrer	[34]
51	H. J. Schmitt	[29]
52	Falk Schreiber	[42] [45] [46] [47]
53	Arunabha Sen	[41]
54	Konstantin Skodinis	[32] [59]
55	Miro Spönemann	[75] [76]
56	Matthias Stegmaier	[75] [76]
57	Thomas Unfried	[66]
58	Guy Vidal-Naquet	[22]
59	Klaus W. Wagner	[21]
60	Martin Wirsing	[22]
61	Michael Wybrow	[75] [76]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page