Michael Kaufmann

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

On the Complexity of Recognizing k^+-Real Face Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

On k-Planar Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

The Density Formula: One Lemma to Bound Them All.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

k-Planar Placement and Packing of Δ-Regular Caterpillars.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.

[BibT_eX]

[DOI]

Algorithmica, September, 2023

Lazy Queue Layouts of Posets.

[BibT_eX]

[DOI]

Algorithmica, May, 2023

Rectilinear Planarity of Partial 2-Trees.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Splitting Vertices in 2-Layer Graph Drawings.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 2023

Nonplanar Graph Drawings with k Vertices per Face.

[BibT_eX]

[DOI]

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

The Family of Fan-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Linear Layouts of Bipartite Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

On the 2-Layer Window Width Minimization Problem.

[BibT_eX]

[DOI]

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

Rectilinear-Upward Planarity Testing of Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Min-k-planar Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Axis-Parallel Right Angle Crossing Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

The mixed page number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The Density of Fan-Planar Graphs.

[BibT_eX]

[DOI]

Torsten Ueckerdt

Electron. J. Comb., 2022

Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

RAC Drawings of Graphs with Low Degree.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Graph Product Structure for h-Framed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

On dispersable book embeddings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The number of crossings in multigraphs with no empty lens.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

The Stub Resolution of 1-planar Graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Fabian Lipp

Pavel Valtr

J. Graph Algorithms Appl., 2021

Stable visualization of connected components in dynamic graphs.

[BibT_eX]

[DOI]

Inf. Vis., 2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution.

[BibT_eX]

[DOI]

Comput. J., 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.

[BibT_eX]

[DOI]

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

Recognizing and Embedding Simple Optimal 2-Planar Graphs.

[BibT_eX]

[DOI]

Henry Förster

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

On RAC drawings of graphs with one bend per edge.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Four Pages Are Indeed Necessary for Planar Graphs.

[BibT_eX]

[DOI]

Torsten Ueckerdt

J. Comput. Geom., 2020

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

On Layered Fan-Planar Graph Drawings.

[BibT_eX]

[DOI]

Martin Nöllenburg

CoRR, 2020

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

Algorithmica, 2020

Layered Fan-Planar Graph Drawings.

[BibT_eX]

[DOI]

Therese Biedl

Steven Chaplick

Martin Nöllenburg

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On Compact RAC Drawings.

[BibT_eX]

[DOI]

Henry Förster

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

On 3D visibility representations of graphs with few crossings per edge.

[BibT_eX]

[DOI]

Patrizio Angelini

Theor. Comput. Sci., 2019

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.

[BibT_eX]

[DOI]

Carla Binucci

Alessandra Tappini

CoRR, 2019

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.

[BibT_eX]

[DOI]

Henry Förster

Algorithmica, 2019

On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge.

[BibT_eX]

[DOI]

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

The QuaSEFE Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Algorithms and insights for RaceTrack.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

1-Fan-bundle-planar drawings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Guest Editors' Foreword and Overview.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Small Universal Point Sets for k-Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Queue Layouts of Planar 3-Trees.

[BibT_eX]

[DOI]

CoRR, 2018

Table cartogram.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Planar Bus Graphs.

[BibT_eX]

[DOI]

Stefan Felsner

Algorithmica, 2018

On Dispersable Book Embeddings.

[BibT_eX]

[DOI]

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

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

[BibT_eX]

[DOI]

Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Fabian Lipp

Pavel Valtr

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

The planar tree packing theorem.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Progress on Partial Edge Drawings.

[BibT_eX]

[DOI]

Martin Nöllenburg

Alexander Wolff

J. Graph Algorithms Appl., 2017

On the Total Number of Bends for Planar Octilinear Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Vertex-Coloring with Defects.

[BibT_eX]

[DOI]

Vincenzo Roselli

J. Graph Algorithms Appl., 2017

The maximum k-differential coloring problem.

[BibT_eX]

[DOI]

Konstantinos S. Stavropoulos

Stephen G. Kobourov

Sankar Veeramoni

J. Discrete Algorithms, 2017

Threshold-coloring and unit-cube contact representation of planar graphs.

[BibT_eX]

[DOI]

Jackson Toeniskoetter

Discret. Appl. Math., 2017

Beyond-Planarity: Density Results for Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

The Book Thickness of 1-Planar Graphs is Constant.

[BibT_eX]

[DOI]

Algorithmica, 2017

An Interactive Tool to Explore and Improve the Ply Number of Drawings.

[BibT_eX]

[DOI]

Niklas Heinsohn

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Vertex- and Empty-Ply Proximity Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

3D Visibility Representations of 1-planar Graphs.

[BibT_eX]

[DOI]

Patrizio Angelini

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Optimal 2- and 3-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

On the Density of 3-Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Multi-omics enrichment analysis using the GeneTrail2 web service.

[BibT_eX]

[DOI]

Bioinform., 2016

Vertex-Coloring with Star-Defects.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

On Contact Graphs with Cubes and Proportional Boxes.

[BibT_eX]

[DOI]

Stephen G. Kobourov

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

AVDTC of generalized 3-Halin graphs.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Information, 2016

On the Density of Non-simple 3-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Low Ply Drawings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Planar Octilinear Drawings with One Bend Per Edge.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Many-to-One Boundary Labeling with Backbones.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Fitting Planar Graphs on Planar Maps.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Network-based interactive navigation and analysis of large biological datasets.

[BibT_eX]

[DOI]

it Inf. Technol., 2015

Contact Representations of Sparse Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2015

The Effect of Almost-Empty Faces on Planar Kandinsky Drawings.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

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

[BibT_eX]

[DOI]

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

Contact Graphs of Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

The Maximum k-Differential Coloring Problem.

[BibT_eX]

[DOI]

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

A New Approach to Partial MUS Enumeration.

[BibT_eX]

[DOI]

Christian Zielke

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Low ply graph drawing.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

A practical approach for 1/4-SHPEDs.

[BibT_eX]

[DOI]

Andreas Lauer

Proceedings of the 6th International Conference on Information, 2015

Sloginsky drawings of graphs.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

PED User Study.

[BibT_eX]

[DOI]

Simon Leibßle

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On Embeddability of Buses in Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

The Book Embedding Problem from a SAT-Solving Perspective.

[BibT_eX]

[DOI]

Christian Zielke

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

A Universal Point Set for 2-Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

1-Planar Graphs have Constant Book Thickness.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

On the Upward Planarity of Mixed Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

1-Bend Orthogonal Partial Edge Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

A note on maximum differential coloring of planar graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Bend-optimal orthogonal graph drawing in the general position model.

[BibT_eX]

[DOI]

Stefan Felsner

Pavel Valtr

Comput. Geom., 2014

On the area requirements of Euclidean minimum spanning trees.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Smooth Orthogonal Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Upward-rightward planar drawings.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information, 2014

Sloggy drawings of graphs.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information, 2014

Boundary Labeling Methods for Dynamic Focus Regions.

[BibT_eX]

[DOI]

Niklas Heinsohn

Andreas Gerasch

Proceedings of the IEEE Pacific Visualization Symposium, 2014

Rebuilding KEGG Maps: Algorithms and Benefits.

[BibT_eX]

[DOI]

Andreas Gerasch

Oliver Kohlbacher

Proceedings of the IEEE Pacific Visualization Symposium, 2014

2013

Smooth Orthogonal Layouts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Geometric RAC Simultaneous Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Computing Cartograms with Optimal Complexity.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Maximum Differential Coloring of Caterpillars and Spiders

[BibT_eX]

[DOI]

CoRR, 2013

Threshold Coloring and Unit-Cube Contact Representation of Graphs

[BibT_eX]

[DOI]

CoRR, 2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On upward point set embeddability.

[BibT_eX]

[DOI]

Tamara Mchedlidze

Comput. Geom., 2013

Approximate proximity drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2013

NetworkTrail - a web service for identifying and visualizing deregulated subnetworks.

[BibT_eX]

[DOI]

Bioinform., 2013

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.

[BibT_eX]

[DOI]

Algorithmica, 2013

Threshold-Coloring and Unit-Cube Contact Representation of Graphs.

[BibT_eX]

[DOI]

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

Planar Packing of Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

MUStICCa: MUS Extraction with Interactive Choice of Candidates.

[BibT_eX]

[DOI]

Johannes Dellert

Christian Zielke

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Slanted Orthogonal Drawings.

[BibT_eX]

[DOI]

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

Table Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

On the Characterization of Plane Bus Graphs.

[BibT_eX]

[DOI]

Stefan Felsner

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

On a Tree and a Path with no Geometric Simultaneous Embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Proportional Contact Representations of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Vertex angle and crossing angle resolution of leveled tree drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

miRTrail - a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

Optimal Polygonal Representation of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).

[BibT_eX]

[DOI]

Sebastian Burg

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Mad at Edge Crossings? Break the Edges!

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

A systematic approach to the one-mode projection of bipartite graphs.

[BibT_eX]

[DOI]

Katharina Anna Zweig

Soc. Netw. Anal. Min., 2011

On the Perspectives Opened by Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Straight-Line Rectangular Drawings of Clustered Graphs.

[BibT_eX]

[DOI]

Patrizio Angelini

Discret. Comput. Geom., 2011

Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Geometric Simultaneous RAC Drawings of Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Polynomial area bounds for MST embeddings of trees.

[BibT_eX]

[DOI]

Alejandro Estrella-Balderrama

Comput. Geom., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.

[BibT_eX]

[DOI]

Ulrik Brandes

Cesim Erten

Algorithmica, 2011

Beyond Unit Propagation in SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Upward Point-Set Embeddability.

[BibT_eX]

[DOI]

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

Combining Traditional Map Labeling with Boundary Labeling.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

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

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Upward Point Set Embeddability for Convex Point Sets Is in P.

[BibT_eX]

[DOI]

Tamara Mchedlidze

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

Combining Problems on RAC Drawings and Simultaneous Graph Drawings.

[BibT_eX]

[DOI]

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

Small Point Sets for Simply-Nested Planar Graphs.

[BibT_eX]

[DOI]

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

2010

On Metro-Line Crossing Minimization.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Comparing trees via crossing minimization.

[BibT_eX]

[DOI]

Henning Fernau

Mathias Poths

J. Comput. Syst. Sci., 2010

Visuelle Analytik biologischer Daten.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Area-Feature Boundary Labeling.

[BibT_eX]

[DOI]

Comput. J., 2010

Boundary Labeling with Octilinear Leaders.

[BibT_eX]

[DOI]

Algorithmica, 2010

An automatic layout algorithm for BPEL processes.

[BibT_eX]

[DOI]

Proceedings of the ACM 2010 Symposium on Software Visualization, 2010

Optimal Polygonal Representation of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Improving Layered Graph Layouts with Edge Bundling.

[BibT_eX]

[DOI]

Sergey Pupyrev

Lev Nachmanson

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

Visualizing Differences between Two Large Graphs.

[BibT_eX]

[DOI]

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

Upward Geometric Graph Embeddings into Point Sets.

[BibT_eX]

[DOI]

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

2009

Constrained Simultaneous and Near-Simultaneous Embeddings.

[BibT_eX]

[DOI]

Stephen G. Kobourov

J. Graph Algorithms Appl., 2009

Planar packing of trees and spider trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Two trees which are self-intersecting when drawn simultaneously.

[BibT_eX]

[DOI]

Imrich Vrto

Discret. Math., 2009

A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis.

[BibT_eX]

[DOI]

Bioinform., 2009

An Interactive Layout Tool for BPMN.

[BibT_eX]

[DOI]

Philip Effinger

Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing, 2009

Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Visualization of Complex BPEL Models.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Modeling and Designing Real-World Networks.

[BibT_eX]

[DOI]

Katharina Anna Zweig

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

On Map Labeling with Leaders.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Dorothea Wagner

J. Graph Algorithms Appl., 2008

Efficient Labeling of Collinear Sites.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Fixed parameter algorithms for one-sided crossing minimization revisited.

[BibT_eX]

[DOI]

Vida Dujmovic

Henning Fernau

Amarendran Ramaswami Subramanian

J. Discrete Algorithms, 2008

GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments.

[BibT_eX]

[DOI]

BMC Bioinform., 2008

DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment.

[BibT_eX]

[DOI]

Burkhard Morgenstern

Algorithms Mol. Biol., 2008

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.

[BibT_eX]

[DOI]

Carsten Sinz

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Computation of Renameable Horn Backdoors.

[BibT_eX]

[DOI]

Carsten Sinz

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

Marc J. van Kreveld

Bettina Speckmann

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

Enhancing Visualizations of Business Processes.

[BibT_eX]

[DOI]

Philip Effinger

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

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.

[BibT_eX]

[DOI]

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

08191 Working Group Report - Visualization of Trajectories.

[BibT_eX]

[DOI]

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

2007

Boundary labeling: Models and efficient algorithms for rectangular maps.

[BibT_eX]

[DOI]

Comput. Geom., 2007

BNDB - The Biochemical Network Database.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

Consistent Minimization of Clustering Objective Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Packing and Squeezing Subgraphs into Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Polynomial Area Bounds for MST Embeddings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Line Crossing Minimization on Metro Maps.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Placing connected components of disconnected graphs.

[BibT_eX]

[DOI]

Dennis Goehlsdorf

Proceedings of the APVIS 2007, 2007

Labeling collinear sites.

[BibT_eX]

[DOI]

Proceedings of the APVIS 2007, 2007

2006

BN++ - A Biological Information System.

[BibT_eX]

[DOI]

J. Integr. Bioinform., 2006

Visualization aided performance tuning of irregular task-parallel computations.

[BibT_eX]

[DOI]

Wolfgang Blochinger

Inf. Vis., 2006

On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences.

[BibT_eX]

[DOI]

Stephan Steigele

Kay Nieselt

Algorithms Mol. Biol., 2006

Drawing activity diagrams.

[BibT_eX]

[DOI]

Proceedings of the ACM 2006 Symposium on Software Visualization, 2006

Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.

[BibT_eX]

[DOI]

Jan Kratochvíl

Amarendran Ramaswami Subramanian

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Multi-stack Boundary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Danny Krizanc

Pierre Fraigniaud

Christos D. Zaroliagis

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Polygon labelling of minimum leader length.

[BibT_eX]

[DOI]

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005

An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.

[BibT_eX]

[DOI]

Amarendran Ramaswami Subramanian

J. Graph Algorithms Appl., 2005

DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment.

[BibT_eX]

[DOI]

Jan Weyer-Menkhoff

Burkhard Morgenstern

BMC Bioinform., 2005

Visualizing structural properties of irregular parallel computations.

[BibT_eX]

[DOI]

Wolfgang Blochinger

Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Boundary Labelling of Optimal Total Leader Length.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

Random Graphs, Small-Worlds and Scale-Free Networks.

[BibT_eX]

[DOI]

Proceedings of the Peer-to-Peer Systems and Applications, 2005

Evolutionary algorithms for the self-organized evolution of networks.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Mixed Upward Planarization - Fast and Robust.

[BibT_eX]

[DOI]

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

A New Approach for Boundary Recognition in Geometric Sensor Networks.

[BibT_eX]

[DOI]

Sándor P. Fekete

Alexander Kröller

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

2004

Automatic layout of UML class diagrams in orthogonal style.

[BibT_eX]

[DOI]

Inf. Vis., 2004

DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors.

[BibT_eX]

[DOI]

BMC Bioinform., 2004

yFiles - Visualization and Automatic Layout of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

2003

An Approach for Mixed Upward Planarization.

[BibT_eX]

[DOI]

Frank Eppinger

J. Graph Algorithms Appl., 2003

Designing Parallel Algorithms for Hierarchical SMP Clusters.

[BibT_eX]

[DOI]

Martin Schmollinger

Int. J. Found. Comput. Sci., 2003

A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram.

[BibT_eX]

[DOI]

Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

Topic Introduction.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002

Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation.

[BibT_eX]

[DOI]

Ezekiel F. Adebiyi

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

Martin Schmollinger

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Graph Drawing Algorithms for Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the 32. Jahrestagung der Gesellschaft für Informatik, Informatik bewegt, INFORMATIK 2002, Dortmund, Germany, September 30, 2002

Maintaining the Mental Map for Circular Drawings.

[BibT_eX]

[DOI]

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

Sketch-Driven Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

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

Electronic brainstorming with graphical structures of ideas.

[BibT_eX]

[DOI]

Thomas Krätschmer

Proceedings of the 10th European Conference on Information Systems, 2002

BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks.

[BibT_eX]

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001

An Approach for Mixed Upward Planarization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

kappa NUMA: A Model for Clusters of SMP-Machines.

[BibT_eX]

[DOI]

Martin Schmollinger

Proceedings of the Parallel Processing and Applied Mathematics, 2001

An efficient algorithm for finding short approximate non-tandem repeats.

[BibT_eX]

Ezekiel F. Adebiyi

Tao Jiang

Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

yFiles: Visualization and Automatic Layout of Graphs.

[BibT_eX]

[DOI]

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

Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.

[BibT_eX]

[DOI]

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

Usage-based Visualization of Web Locations.

[BibT_eX]

[DOI]

Boris Diebold

Proceedings of the Australasian Symposium on Information Visualisation, 2001

2000

On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.

[BibT_eX]

[DOI]

Algorithmica, 2000

Orthogonal graph drawing with constraints.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998

Drawing Planar Partitions II: HH-Drawings.

[BibT_eX]

[DOI]

Therese Biedl

Petra Mutzel

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

Adding Constraints to an Algorithm for Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Visualization of Parallel Execution Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

On Improving Orthogonal Drawings: The 4M-Algorithm.

[BibT_eX]

[DOI]

Carsten Heß

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

Deterministic Permutation Routing on Meshes.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

J. Algorithms, 1997

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.

[BibT_eX]

[DOI]

Alexander Zelikovsky

Discret. Comput. Geom., 1997

Matrix Transpose on Meshes: Theory and Practice.

[BibT_eX]

[DOI]

Ulrich Meyer

Comput. Artif. Intell., 1997

Randomized Multipacket Routing and Sorting on Meshes.

[BibT_eX]

[DOI]

Algorithmica, 1997

Routing on Meshes with Buses.

[BibT_eX]

[DOI]

Rajeev Raman

Algorithmica, 1997

On Triangulating Planar Graphs Under the Four-Connectivity Constraint.

[BibT_eX]

[DOI]

Therese Biedl

Goos Kant

Algorithmica, 1997

Algorithms and Area Bounds for Nonplanar Orthogonal Drawings.

[BibT_eX]

[DOI]

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

Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

Area-Efficient Static and Incremental Graph Drawings.

[BibT_eX]

[DOI]

Therese C. Biedl

Proceedings of the Algorithms, 1997

On Exact Solutions for the Rectilinear Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

BSP-Like External-Memory Computation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Nice Drawings for Planar Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing.

[BibT_eX]

[DOI]

Krishnaiyan Thulasiraman

J. Circuits Syst. Comput., 1996

2-Visibility Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Goos Kant

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

1995

Routing and Sorting on Reconfigurable Meshes.

[BibT_eX]

[DOI]

Heiko Schröder

Parallel Process. Lett., 1995

Solving Cheap Graph Problems an Meshes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Drawing High Degree Graphs with Low Bend Numbers.

[BibT_eX]

[DOI]

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

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.

[BibT_eX]

[DOI]

Torsten Suel

Proceedings of the Algorithms, 1995

1994

A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs.

[BibT_eX]

[DOI]

Kurt Mehlhorn

SIAM J. Comput., 1994

Channel Routing of Multiterminal Nets.

[BibT_eX]

[DOI]

J. ACM, 1994

Deterministic 1-k Routing on Meshes.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Towards practical permutation routing on meshes.

[BibT_eX]

[DOI]

Ulrich Meyer

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Derandomizing Algorithms for Routing and Sorting on Meshes.

[BibT_eX]

[DOI]

Torsten Suel

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Shorter Queues for Permutation Routing on Meshes.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Fast Deterministic Hot-Potato Routing on Processor Arrays.

[BibT_eX]

[DOI]

Harald Lauer

Heiko Schröder

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing.

[BibT_eX]

[DOI]

Krishnaiyan Thulasiraman

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Approaching the 5/4-Approximation for Rectilinear Steiner Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Routing in Polygons without Rectilinear Visible Corners

[BibT_eX]

[DOI]

Gerhard Klär

Inf. Comput., February, 1993

Drawing Graphs in the Plane with High Resolution.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Emo Welzl

Gerhard J. Woeginger

SIAM J. Comput., 1993

Parity Conditions in Homotopic Knock-Knee Routing.

[BibT_eX]

[DOI]

F. Miller Maley

Algorithmica, 1993

Randomized Routing on Meshes with Buses.

[BibT_eX]

[DOI]

Rajeev Raman

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

On local routing of two-terminal nets.

[BibT_eX]

[DOI]

Kurt Mehlhorn

J. Comb. Theory B, 1992

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.

[BibT_eX]

[DOI]

Algorithmica, 1992

Optimal Multi-Packet Routing on the Torus.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

Performance Driven k-Layer Wiring.

[BibT_eX]

[DOI]

Paul Molitor

Wolfgang Vogelgesang

Proceedings of the STACS 92, 1992

Deterministic Routing on Circular Arrays.

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Matching the Bisection Bound for Routing and Sorting on the Mesh.

[BibT_eX]

[DOI]

Sanguthevar Rajasekaran

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991

Minimal stretching of a layout to ensure 2-layer wirability.

[BibT_eX]

[DOI]

Paul Molitor

Integr., 1991

A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs.

[BibT_eX]

[DOI]

Gerhard Klär

Proceedings of the ISA '91 Algorithms, 1991

The Art Gallery Theorem for Polygons With Holes

[BibT_eX]

[DOI]

Frank Hoffmann

Klaus Kriegel

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A linear-time algorithm for routing in a convex grid.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

On the Rectilinear Art Gallery Problem - Algorithmic Aspects.

[BibT_eX]

[DOI]

Frank Hoffmann

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

Allowing overlaps makes switchbox layouts nice.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Zur Physik des Fusionsreaktors. Neue Ergebnisse.

[BibT_eX]

[DOI]

Proceedings of the Forum '90 Wissenschaft und Technik, 1990

Hierarchical Wiring in Multigrids.

[BibT_eX]

[DOI]

Patrik Eklund

Proceedings of the CONPAR 90, 1990

1989

Advances in Homotopic Layout Compaction.

[BibT_eX]

[DOI]

F. Miller Maley

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

On Continuous Homotopic One Layer Routing.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

On Continuous Homotopic One Layer Routing.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and its Applications, 1988

Channel Routing with Short Wires.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Über Lokales Verdrahten von Zwei-Punkt-Netzen.

[BibT_eX]

[DOI]

PhD thesis, 1987

1986

Routing Through a Generalized Switchbox.

[BibT_eX]

[DOI]

Kurt Mehlhorn

J. Algorithms, 1986

1984

Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out.

[BibT_eX]