Franz-Josef Brandenburg

Comput. Geom., January, 2024

2023

Unique Triangulated 1-Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Embedding 1-Planar Graphs in Ten Pages.

[BibT_eX]

[DOI]

CoRR, 2023

On Optimal Beyond-Planar Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

2021

Fan-crossing free graphs and their relationship to other beyond-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Correction to: Outer 1-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

On fan-crossing graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Simple k-planar graphs are simple (k + 1)-quasiplanar.

[BibT_eX]

[DOI]

Ignaz Rutter

Csaba D. Tóth

J. Comb. Theory, Ser. B, 2020

Book Embeddings of k-Map Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Fan-Crossing Free Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Characterizing 5-map graphs by 2-fan-crossing graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.

[BibT_eX]

[DOI]

Ignaz Rutter

Csaba D. Tóth

CoRR, 2019

Characterizing and Recognizing 4-Map Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Recognizing IC-Planar and NIC-Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

A First Order Logic Definition of Beyond-Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Data Structures and their Planar Graph Layouts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

On fan-crossing and fan-crossing free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

T-shape visibility representations of 1-planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Recognizing Optimal 1-Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

On Aligned Bar 1-Visibility Graphs.

[BibT_eX]

[DOI]

Alexander Esch

Daniel Neuwirth

J. Graph Algorithms Appl., 2017

NIC-planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

A Note on IC-Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.

[BibT_eX]

[DOI]

Ignaz Rutter

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Ranking chain sum orders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Recognizing and drawing IC-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Path-Additions of Graphs.

[BibT_eX]

[DOI]

Alexander Esch

Daniel Neuwirth

CoRR, 2016

A Reduction System for Optimal 1-Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Outer 1-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Upward planar graphs and their duals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

1-Planarity of Graphs with a Rotation System.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

On the hardness of maximum rank aggregation problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

On 4-Map Graphs and 1-Planar Graphs and their Recognition Problem.

[BibT_eX]

[DOI]

CoRR, 2015

On the Book Thickness of 1-Planar Graphs.

[BibT_eX]

[DOI]

Md. Jawaherul Alam

Stephen G. Kobourov

CoRR, 2015

On Bar (1, j)-Visibility Graphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

1-Visibility Representations of 1-Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Upward planar drawings on the standing and the rolling cylinders.

[BibT_eX]

[DOI]

Comput. Geom., 2014

2013

Optical Graph Recognition.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders.

[BibT_eX]

[DOI]

Andreas Hofmeier

J. Comb. Optim., 2013

Comparing and Aggregating Partial Orders with Kendall tau Distances.

[BibT_eX]

[DOI]

Andreas Hofmeier

Discret. Math. Algorithms Appl., 2013

Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Rolling Upward Planarity Testing of Strongly Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Maximum Rank Aggregation Problems.

[BibT_eX]

[DOI]

Andreas Hofmeier

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Characterizing Planarity by the Splittable Deque.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Recognizing Outer 1-Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs.

[BibT_eX]

[DOI]

Md. Jawaherul Alam

Stephen G. Kobourov

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Drawing Recurrent Hierarchies.

[BibT_eX]

[DOI]

Raymund Fülöp

J. Graph Algorithms Appl., 2012

The Duals of Upward Planar Graphs on Cylinders.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

On the Density of Maximal 1-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Sparse Maximal 2-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On the Curve Complexity of Upward Planar Drawings.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations.

[BibT_eX]

[DOI]

Vladimir Batagelj

IEEE Trans. Vis. Comput. Graph., 2011

Shortest path and maximum flow problems in networks with additive losses and gains.

[BibT_eX]

[DOI]

Mao-cheng Cai

Theor. Comput. Sci., 2011

Global k-Level Crossing Reduction.

[BibT_eX]

[DOI]

Ferdinand Hübner

J. Graph Algorithms Appl., 2011

The Open Graph Archive: A Community-Driven Effort.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Classification of Planar Upward Embedding.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

A Global k-Level Crossing Reduction Algorithm.

[BibT_eX]

[DOI]

Ferdinand Hübner

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Plane Drawings of Queue and Deque Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

On the complexity of crossings in permutations.

[BibT_eX]

[DOI]

Xiaotie Deng

Discret. Math., 2009

Coordinate Assignment for Cyclic Level Graphs.

[BibT_eX]

[DOI]

Raymund Fülöp

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Drawing Planar Graphs on (8/9)*n2 Area.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Cyclic Leveling of Directed Graphs.

[BibT_eX]

[DOI]

Gergö Lovász

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Tree Drawings on the Hexagonal Grid.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

08191 Working Group Report - X-graphs of Y-graphs and their Representations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

2006

Graph Searching and Search Time.

[BibT_eX]

[DOI]

Stephanie Herrmann

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Partitions of Graphs into Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Finite graph automata for linear and boundary graph languages.

[BibT_eX]

[DOI]

Konstantin Skodinis

Theor. Comput. Sci., 2005

Radial Level Planarity Testing and Embedding in Linear Time.

[BibT_eX]

[DOI]

Michael Forster

J. Graph Algorithms Appl., 2005

Crossings and Permutations.

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Drawing planar bipartite graphs with small area.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computing and Drawing Isomorphic Subgraphs.

[BibT_eX]

[DOI]

Sabine Bachl

Daniel Gmach

J. Graph Algorithms Appl., 2004

QUOGGLES: Query On Graphs - A Graphical Largely Extensible System.

[BibT_eX]

[DOI]

Paul Holleis

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Christian A. Duncan

Emden R. Gansner

Stephen G. Kobourov

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Gravisto: Graph Visualization Toolkit.

[BibT_eX]

[DOI]

Michael Forster

Paul Holleis

Marcus Raitner

Proceedings of the Graph Drawing, 12th International Symposium, 2004

BioPath - Exploration and Visualization of Biochemical Pathways.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

2003

Erratum: Cycles in Generalized Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Selected Open Problems in Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Ulrik Brandes

Peter Eades

Joe Marks

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

The system architecture of the BioPath system.

[BibT_eX]

[DOI]

Silico Biol., 2002

Cycles in Generalized Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Computing and Drawing Isomorphic Subgraphs.

[BibT_eX]

[DOI]

Sabine Bachl

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

BioPath.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

BioPath Visualization of Biochemical Pathways.

[BibT_eX]

Proceedings of the Computer science and biology: Proceedings of the German Conference on Bioinformatics, 2001

2000

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Ulrik Brandes

Michael Himsolt

Marcus Raitner

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Graph Clustering Using Distance-k Cliques.

[BibT_eX]

[DOI]

Jubin Edachery

Arunabha Sen

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

The Ancestor Width of Grammars and Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

Algorithmen zum automatischen Zeichnen von Graphen.

[BibT_eX]

[DOI]

Michael Jünger

Petra Mutzel

Inform. Spektrum, 1997

Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen.

[BibT_eX]

[DOI]

Michael Jünger

Petra Mutzel

Thomas Lengauer

Proceedings of the Informatik '97, 1997

Graph Clustering 1: Circles of Cliques.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Homomorphic Representations of Certain Classes of Languages.

[BibT_eX]

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1995

An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Michael Himsolt

Christoph Rohrer

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

Graph Automata for Linear Graph Languages.

[BibT_eX]

[DOI]

Konstantin Skodinis

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Designing Graph Drawings by Layout Graph Grammars.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Efficient Reductions of Picture Words.

[BibT_eX]

[DOI]

Jürgen Dassow

RAIRO Theor. Informatics Appl., 1993

1991

Gemeinsame Stellungnahme der Fakultätentage Elektrotechnik und Informatik zur Abstimmung ihrer Fachgebierte im Bereich Informationstechnik.

[BibT_eX]

Werner Freise

Winfried Görke

Reiner W. Hartenstein

P. Kühn

H. J. Schmitt

Inform. Spektrum, 1991

The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

Cycle Chain Code Picture Languages.

[BibT_eX]

[DOI]

Michal Chytil

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Layout Graph Grammars: The Placement Approach.

[BibT_eX]

[DOI]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989

On the Complexity of Optimal Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

On the Intersection of Stacks and Queues.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

On Polynomial Time Graph Grammars.

[BibT_eX]

[DOI]

Proceedings of the STACS 88, 1988

Nice drawings of graphs are computationally hard.

[BibT_eX]

[DOI]

Proceedings of the Visualization in Human-Computer Interaction, 1988

1987

Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

A Note on: 'Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines.

[BibT_eX]

[DOI]

Andreas Brandstädt

Klaus W. Wagner

Math. Syst. Theory, 1987

1986

Intersections of Some Families of Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

On Partially Ordered Graph Grammars.

[BibT_eX]

[DOI]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1984

A Truely Morphic Characterization of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

Uniformly Growing k-TH Power-Free Homomorphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On the Complexity of the Membership Problem of Graph Grammars.

[BibT_eX]

Proceedings of the WG '83, 1983

The computational complexity of certain graph grammars.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1983

1982

A Note on Generalized Parikh Equality Sets.

[BibT_eX]

J. Inf. Process. Cybern., 1982

Extended Chomsky-Schützenberger Theorems.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

Unary Multiple Equality Sets: The Languages of Rational Matrices

[BibT_eX]

[DOI]

Inf. Control., September, 1981

Three Write Heads Are as Good as k.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1981

On the Height of Syntactical Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Analogies of PAL and COPY.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Equality Sets and Complexity Classes.

[BibT_eX]

[DOI]

Ronald V. Book

SIAM J. Comput., 1980

Multiple Equality Sets and Post Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

1979

Representing Complexity Classes by Equality Sets (Preliminary Report).

[BibT_eX]

[DOI]

Ronald V. Book

Proceedings of the Automata, 1979

1977

On one-way auxiliary pushdown automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1977

The Contextsensitivity Bounds of Contextsensitive Grammars and Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1973

Der Einfluß von Kontext auf spezielle CF-Grammatiken.

[BibT_eX]

[DOI]