Petra Mutzel

Proceedings of the IEEE International Conference on Data Mining Workshops, 2022

McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Graph-Based Methods for Rational Drug Design.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Protein Complex Similarity.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning under Resource Constraints - Volume 3: Applications, 2022

2021

Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Quantum Annealing versus Digital Computing: An Experimental Comparison.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2021

An Index for Single Source All Destinations Distance Queries in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Point feature label placement for multi-page maps on small-screen devices.

[BibT_eX]

[DOI]

Comput. Graph., 2021

2020

Maximum Cut Parameterized by Crossing Number.

[BibT_eX]

[DOI]

Christine Dahn

Martina Juhnke-Kubitzke

Alexander Nover

J. Graph Algorithms Appl., 2020

Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs.

[BibT_eX]

[DOI]

Anne Driemel

CoRR, 2020

TUDataset: A collection of benchmark datasets for learning with graphs.

[BibT_eX]

[DOI]

CoRR, 2020

SCOT: Rethinking the classification of secondary structure elements.

[BibT_eX]

[DOI]

Bioinform., 2020

Classifying Dissemination Processes in Temporal Graphs.

[BibT_eX]

[DOI]

Big Data, 2020

Crossing Number for Graphs with Bounded Pathwidth.

[BibT_eX]

[DOI]

Algorithmica, 2020

Temporal Graph Kernels for Classifying Dissemination Processes.

[BibT_eX]

[DOI]

Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.

[BibT_eX]

[DOI]

Gaurav Rattan

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Top-k Temporal Closeness Calculation in Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Data Mining, 2020

Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach.

[BibT_eX]

[DOI]

Erik Thordsen

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

10 Reasons to Get Interested in Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width.

[BibT_eX]

[DOI]

Christiane Spisla

J. Graph Algorithms Appl., 2019

A unifying view of explicit and implicit feature maps of graph kernels.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Towards a practical k-dimensional Weisfeiler-Leman algorithm.

[BibT_eX]

[DOI]

CoRR, 2019

On the Enumeration of Bicriteria Temporal Paths.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Algorithmic Data Science (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Protein Complex Similarity Based on Weisfeiler-Lehman Labeling.

[BibT_eX]

[DOI]

Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints.

[BibT_eX]

[DOI]

Adalat Jabrayilov

Silvia Fernández-Merchant

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Bishellable drawings of Kn.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Oswin Aichholzer

SIAM J. Discret. Math., 2018

A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

More Compact Orthogonal Drawings by Allowing Additional Bends †.

[BibT_eX]

[DOI]

Christiane Spisla

Inf., 2018

On maximum common subgraph problems in series-parallel graphs.

[BibT_eX]

[DOI]

Florian Kurpicz

Eur. J. Comb., 2018

The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Recognizing Cuneiform Signs Using Graph Based Methods.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Cost-Sensitive Learning, 2018

Largest Weight Common Subtree Embeddings with Distance Penalties.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

New Integer Linear Programming Models for the Vertex Coloring Problem.

[BibT_eX]

[DOI]

Adalat Jabrayilov

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

The Crossing Number of Seq-Shellable Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.

[BibT_eX]

[DOI]

Christine Dahn

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Orthogonal Compaction using Additional Bends.

[BibT_eX]

[DOI]

Christiane Spisla

Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), 2018

The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Scaffold Hunter: a comprehensive visual analytics framework for drug discovery.

[BibT_eX]

[DOI]

J. Cheminformatics, 2017

Stochastic survivable network design problems: Theory and practice.

[BibT_eX]

[DOI]

Ivana Ljubic

Eur. J. Oper. Res., 2017

Matheuristics for optimizing the network in German wagonload traffic.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2017

A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels.

[BibT_eX]

[DOI]

CoRR, 2017

Global Weisfeiler-Lehman Graph Kernels.

[BibT_eX]

[DOI]

Kristian Kersting

CoRR, 2017

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem.

[BibT_eX]

[DOI]

Fritz Bökler

Proceedings of the WALCOM: Algorithms and Computation, 2017

Finding Largest Common Substructures of Molecules in Quadratic Time.

[BibT_eX]

[DOI]

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

Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs.

[BibT_eX]

[DOI]

Kristian Kersting

Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

StruClus: Scalable Structural Graph Set Clustering with Representative Sampling.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications - 13th International Conference, 2017

2016

StruClus: Structural Clustering of Large-Scale Graph Databases.

[BibT_eX]

[DOI]

CoRR, 2016

Output-sensitive Complexity of Multiobjective Combinatorial Optimization.

[BibT_eX]

[DOI]

CoRR, 2016

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph.

[BibT_eX]

[DOI]

Denis Kurz

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Faster Kernels for Graphs with Continuous Attributes via Hashing.

[BibT_eX]

[DOI]

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Compact Layered Drawings of General Directed Graphs.

[BibT_eX]

[DOI]

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

2015

Drawing Partially Embedded and Simultaneously Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Fritz Bökler

Proceedings of the Algorithms - ESA 2015, 2015

2014

Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Introduction to Special Issue ALENEX'12.

[BibT_eX]

[DOI]

David A. Bader

ACM J. Exp. Algorithmics, 2014

Scaffold hunter: visual analysis of biological activity data.

[BibT_eX]

[DOI]

J. Cheminformatics, 2014

SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

Examining the Compactness of Automatically Generated Layouts for Practical Diagrams.

[BibT_eX]

[DOI]

Ulf Rüegg

Miro Spönemann

Proceedings of the Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice co-located with Diagrams 2014, 2014

Practical Experience with Hanani-Tutte for Testing c-Planarity.

[BibT_eX]

[DOI]

Marcus Schaefer

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

The Open Graph Drawing Framework (OGDF).

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Crossings and Planarization.

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Algorithm Engineering im Graphenzeichnen.

[BibT_eX]

[DOI]

Inform. Spektrum, 2013

Stochastic Survivable Network Design Problems.

[BibT_eX]

[DOI]

Ivana Ljubic

Electron. Notes Discret. Math., 2013

The Landscape Metaphor for Visualization of Molecular Similarities.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision, Imaging and Computer Graphics - Theory and Applications, 2013

MolMap - Visualizing Molecule Libraries as Topographic Maps.

[BibT_eX]

Proceedings of the GRAPP & IVAPP 2013: Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications, 2013

The Rooted Maximum Node-Weight Connected Subgraph Problem.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Ivana Ljubic

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

Improved Steiner tree algorithms for bounded treewidth.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Vertex insertion approximates the crossing number of apex graphs.

[BibT_eX]

[DOI]

Petr Hlinený

Eur. J. Comb., 2012

Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision, Imaging and Computer Graphics. Theory and Application, 2012

Parameterized Algorithms for Stochastic Steiner Tree Problems.

[BibT_eX]

[DOI]

Denis Kurz

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Subgraph Matching Kernels for Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Machine Learning, 2012

Scaffold Hunter - Visual Analysis of Chemical Compound Databases.

[BibT_eX]

[DOI]

Alejandro Estrella-Balderrama

Proceedings of the GRAPP & IVAPP 2012: Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications, 2012

2011

Upward Planarization Layout.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

An SDP approach to multi-level crossing minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.

[BibT_eX]

[DOI]

Ulrik Brandes

Cesim Erten

Algorithmica, 2011

CT-index: Fingerprint-based graph indexing combining cycles and trees.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Data Engineering, 2011

2010

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.

[BibT_eX]

[DOI]

Math. Program., 2010

Layer-free upward crossing minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.

[BibT_eX]

[DOI]

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

An Experimental Evaluation of Multilevel Layout Methods.

[BibT_eX]

[DOI]

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

10261 Executive Summary - Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

10261 Abstracts Collection - Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

2009

Optimization in Leveled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Obtaining optimal k-cardinality trees fast.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Experiments on exact crossing minimization using column generation.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Retention time alignment algorithms for LC/MS data must consider non-linear shifts.

[BibT_eX]

[DOI]

Bioinform., 2009

Inserting a vertex into a planar graph.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Planar Biconnectivity Augmentation with Fixed Embedding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Port Constraints in Hierarchical Layout of Data Flow Diagrams.

[BibT_eX]

[DOI]

Miro Spönemann

Hauke Fuhrmann

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

Scaffold Hunter - Interactive Exploration of Chemical Space.

[BibT_eX]

[DOI]

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

On Open Problems in Biological Network Visualization.

[BibT_eX]

[DOI]

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

On the Hardness and Approximability of Planar Biconnectivity Augmentation.

[BibT_eX]

[DOI]

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

The Crossing Number of Graphs: Theory and Computation.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks.

[BibT_eX]

[DOI]

J. Integr. Bioinform., 2008

Planarity Testing and Optimal Edge Insertion with Embedding Constraints.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Recent Advances in Exact Crossing Minimization (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

A branch-and-cut approach to the crossing number problem.

[BibT_eX]

[DOI]

Discret. Optim., 2008

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.

[BibT_eX]

[DOI]

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

Approximating the Crossing Number of Apex Graphs.

[BibT_eX]

[DOI]

Petr Hlinený

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

Computing Maximum C-Planar Subgraphs.

[BibT_eX]

[DOI]

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

A New Approach to Exact Crossing Minimization.

[BibT_eX]

[DOI]

Immanuel M. Bomze

Proceedings of the Algorithms, 2008

08191 Executive Summary - Graph Drawing with Applications to Bioinformatics and Social Sciences.

[BibT_eX]

[DOI]

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

08191 Abstracts Collection - Graph Drawing with Applications to Bioinformatics and Social Sciences.

[BibT_eX]

[DOI]

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

Strong Formulations for 2-Node-Connected Steiner Network Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Obtaining Optimal k-Cardinality Trees Fast.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

On the Minimum Cut of Planarizations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Efficient Extraction of Multiple Kuratowski Subdivisions.

[BibT_eX]

[DOI]

Jens M. Schmidt

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

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.

[BibT_eX]

[DOI]

Maria Kandyba

Proceedings of the Algorithms, 2007

Colored Simultaneous Geometric Embeddings.

[BibT_eX]

[DOI]

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

2006

Bend Minimization in Planar Orthogonal Drawings Using Integer Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Math. Program., 2006

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.

[BibT_eX]

[DOI]

Proceedings of the Operations Research, 2006

A New Approximation Algorithm for Bend Minimization in the Kandinsky Model.

[BibT_eX]

[DOI]

Wilhelm Barth

Canan Yildiz

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

2005

Inserting an Edge into a Planar Graph.

[BibT_eX]

[DOI]

Algorithmica, 2005

Recent Advances in Graph Drawing.

[BibT_eX]

[DOI]

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

Exact Crossing Minimization.

[BibT_eX]

[DOI]

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

05191 Abstracts Collection - Graph Drawing.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Proceedings of the Graph Drawing, 8.-13. May 2005, 2005

05191 Executive Summary - Graph Drawing.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Proceedings of the Graph Drawing, 8.-13. May 2005, 2005

A Graph-Theoretic Approach to Steganography.

[BibT_eX]

[DOI]

Stefan Hetzl

Proceedings of the Communications and Multimedia Security, 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Simple and Efficient Bilayer Cross Counting.

[BibT_eX]

[DOI]

Wilhelm Barth

J. Graph Algorithms Appl., 2004

Automatic layout of UML class diagrams in orthogonal style.

[BibT_eX]

[DOI]

Inf. Vis., 2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2004

Technical Foundations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Introduction.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

AGD - A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

A Diagramming Software for UML Class Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Graph Drawing: Exact Optimization Helps!

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

Optimal labeling of point features in rectangular labeling models.

[BibT_eX]

[DOI]

Math. Program., 2003

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).

[BibT_eX]

[DOI]

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

A New Approach for Visualizing UML Class Diagrams.

[BibT_eX]

[DOI]

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

The SPQR-Tree Data Structure in Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Graph Embedding with Minimum Depth and Maximum External Face.

[BibT_eX]

[DOI]

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

An Experimental Study of Crossing Minimization Heuristics.

[BibT_eX]

[DOI]

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

Selected Open Problems in Graph Drawing.

[BibT_eX]

[DOI]

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

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Advances in C-Planarity Testing of Clustered Graphs.

[BibT_eX]

[DOI]

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

Bend Minimization in Orthogonal Drawings Using Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

An Alternative Method to Crossing Minimization on Hierarchical Graphs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2001

AGD: A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

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

Caesar Automatic Layout of UML Class Diagrams.

[BibT_eX]

[DOI]

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

Graphs in Software Visualization - Introduction.

[BibT_eX]

[DOI]

Peter Eades

Proceedings of the Software Visualization, 2001

Graph Drawing Algorithm Engineering with AGD.

[BibT_eX]

[DOI]

Proceedings of the Software Visualization, 2001

2000

A polyhedral approach to sequence alignment problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

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

A Linear Time Implementation of SPQR-Trees.

[BibT_eX]

[DOI]

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

Computing Optimal Embeddings for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Optimal Labelling of Point Features in the Slider Model.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Guest Editors' Introduction.

[BibT_eX]

[DOI]

Giuseppe Di Battista

J. Graph Algorithms Appl., 1999

Optimizing over All Combinatorial Embeddings of a Planar Graph.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Optimal Compaction of Orthogonal Grid Drawings.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen.

[BibT_eX]

[DOI]

Proceedings of the Informatik '99, 1999

The Constrained Crossing Minimization Problem.

[BibT_eX]

[DOI]

Thomas Ziegler

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

Combining Graph Labeling and Compaction.

[BibT_eX]

[DOI]

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

Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Peter Eades

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

A note on computing a maximal planar subgraph using PQ-trees.

[BibT_eX]

[DOI]

Sebastian Leipert

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

The Thickness of Graphs: A Survey.

[BibT_eX]

[DOI]

Thomas Odenthal

Mark Scharbrodt

Graphs Comb., 1998

The thickness of a minor-excluded class of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Drawing Planar Partitions II: HH-Drawings.

[BibT_eX]

[DOI]

Therese Biedl

Michael Kaufmann

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

A New Approximation Algorithm for the Planar Augmentation Problem.

[BibT_eX]

[DOI]

Sergej Fialko

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Two-Layer Planarization in Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

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

Level Planarity Testing in Linear Time.

[BibT_eX]

[DOI]

Sebastian Leipert

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

Planar Polyline Drawings with Good Angular Resolution.

[BibT_eX]

[DOI]

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

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

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

1997

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1997

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

Algorithmen zum automatischen Zeichnen von Graphen.

[BibT_eX]

[DOI]

Inform. Spektrum, 1997

AGD-Library: A Library of Algorithms for Graph Drawing.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

A branch-and-cut algorithm for multiple sequence alignment.

[BibT_eX]

[DOI]

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

A branch-and-cut approach to physical mapping with end-probes.

[BibT_eX]

[DOI]

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

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

[BibT_eX]

[DOI]

Thomas Lengauer

Proceedings of the Informatik '97, 1997

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem.

[BibT_eX]

[DOI]

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

Pitfalls of Using PQ-Trees in Automatic Graph Drawing.

[BibT_eX]

[DOI]

Sebastian Leipert

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

ArchE: A Graph Drawing System for Archaeology.

[BibT_eX]

[DOI]

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

1996

On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Algorithmica, 1996

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.

[BibT_eX]

[DOI]

Algorithmica, 1996

1995

Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.

[BibT_eX]

[DOI]

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

A Polyhedral Approach to Planar Augmentation and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Book reviews.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

Solving the maximum weight planar subgraph.

[BibT_eX]