Petra Mutzel

According to our database1, Petra Mutzel authored at least 184 papers between 1993 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs.
Theor. Comput. Sci., 2021

2020
Maximum Cut Parameterized by Crossing Number.
J. Graph Algorithms Appl., 2020

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

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

SCOT: Rethinking the classification of secondary structure elements.
Bioinform., 2020

Classifying Dissemination Processes in Temporal Graphs.
Big Data, 2020

Crossing Number for Graphs with Bounded Pathwidth.
Algorithmica, 2020

Temporal Graph Kernels for Classifying Dissemination Processes.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.
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.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
10 Reasons to Get Interested in Graph Drawing.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width.
J. Graph Algorithms Appl., 2019

A unifying view of explicit and implicit feature maps of graph kernels.
Data Min. Knowl. Discov., 2019

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

Towards a practical k-dimensional Weisfeiler-Leman algorithm.
CoRR, 2019

On the Enumeration of Bicriteria Temporal Paths.
Proceedings of the Theory and Applications of Models of Computation, 2019

Algorithmic Data Science (Invited Talk).
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Protein Complex Similarity Based on Weisfeiler-Lehman Labeling.
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.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018

A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.
J. Graph Algorithms Appl., 2018

More Compact Orthogonal Drawings by Allowing Additional Bends <sup>†</sup>.
Inf., 2018

On maximum common subgraph problems in series-parallel graphs.
Eur. J. Comb., 2018

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

Recognizing Cuneiform Signs Using Graph Based Methods.
Proceedings of the International Workshop on Cost-Sensitive Learning, 2018

Largest Weight Common Subtree Embeddings with Distance Penalties.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

New Integer Linear Programming Models for the Vertex Coloring Problem.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

The Crossing Number of Seq-Shellable Drawings of Complete Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Orthogonal Compaction using Additional Bends.
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.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Scaffold Hunter: a comprehensive visual analytics framework for drug discovery.
J. Cheminformatics, 2017

Stochastic survivable network design problems: Theory and practice.
Eur. J. Oper. Res., 2017

Matheuristics for optimizing the network in German wagonload traffic.
EURO J. Comput. Optim., 2017

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

Global Weisfeiler-Lehman Graph Kernels.
CoRR, 2017

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Finding Largest Common Substructures of Molecules in Quadratic Time.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

StruClus: Scalable Structural Graph Set Clustering with Representative Sampling.
Proceedings of the Advanced Data Mining and Applications - 13th International Conference, 2017

2016
StruClus: Structural Clustering of Large-Scale Graph Databases.
CoRR, 2016

Output-sensitive Complexity of Multiobjective Combinatorial Optimization.
CoRR, 2016

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem.
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.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Faster Kernels for Graphs with Continuous Attributes via Hashing.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Compact Layered Drawings of General Directed Graphs.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Drawing Partially Embedded and Simultaneously Planar Graphs.
J. Graph Algorithms Appl., 2015

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

2014
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics.
J. Graph Algorithms Appl., 2014

Introduction to Special Issue ALENEX'12.
ACM J. Exp. Algorithmics, 2014

Scaffold hunter: visual analysis of biological activity data.
J. Cheminformatics, 2014

SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

Examining the Compactness of Automatically Generated Layouts for Practical Diagrams.
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.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
The Open Graph Drawing Framework (OGDF).
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

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

Algorithm Engineering im Graphenzeichnen.
Inform. Spektrum, 2013

Stochastic Survivable Network Design Problems.
Electron. Notes Discret. Math., 2013

The Landscape Metaphor for Visualization of Molecular Similarities.
Proceedings of the Computer Vision, Imaging and Computer Graphics - Theory and Applications, 2013

MolMap - Visualizing Molecule Libraries as Topographic Maps.
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.
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.
J. Discrete Algorithms, 2012

Vertex insertion approximates the crossing number of apex graphs.
Eur. J. Comb., 2012

Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space.
Proceedings of the Computer Vision, Imaging and Computer Graphics. Theory and Application, 2012

Parameterized Algorithms for Stochastic Steiner Tree Problems.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Subgraph Matching Kernels for Attributed Graphs.
Proceedings of the 29th International Conference on Machine Learning, 2012

Scaffold Hunter - Visual Analysis of Chemical Compound Databases.
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.
J. Graph Algorithms Appl., 2011

An SDP approach to multi-level crossing minimization.
ACM J. Exp. Algorithmics, 2011

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

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

CT-index: Fingerprint-based graph indexing combining cycles and trees.
Proceedings of the 27th International Conference on Data Engineering, 2011

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

Layer-free upward crossing minimization.
ACM J. Exp. Algorithmics, 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

An Experimental Evaluation of Multilevel Layout Methods.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

10261 Executive Summary - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

10261 Abstracts Collection - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

2009
Optimization in Leveled Graphs.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Obtaining optimal <i>k</i>-cardinality trees fast.
ACM J. Exp. Algorithmics, 2009

Experiments on exact crossing minimization using column generation.
ACM J. Exp. Algorithmics, 2009

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

Inserting a vertex into a planar graph.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Planar Biconnectivity Augmentation with Fixed Embedding.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Port Constraints in Hierarchical Layout of Data Flow Diagrams.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Scaffold Hunter - Interactive Exploration of Chemical Space.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

On Open Problems in Biological Network Visualization.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

On the Hardness and Approximability of Planar Biconnectivity Augmentation.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

The Crossing Number of Graphs: Theory and Computation.
Proceedings of the Efficient Algorithms, 2009

2008
Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks.
J. Integr. Bioinform., 2008

Planarity Testing and Optimal Edge Insertion with Embedding Constraints.
J. Graph Algorithms Appl., 2008

Recent Advances in Exact Crossing Minimization (Extended Abstract).
Electron. Notes Discret. Math., 2008

A branch-and-cut approach to the crossing number problem.
Discret. Optim., 2008

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Approximating the Crossing Number of Apex Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Computing Maximum C-Planar Subgraphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

A New Approach to Exact Crossing Minimization.
Proceedings of the Algorithms, 2008

08191 Executive Summary - Graph Drawing with Applications to Bioinformatics and Social Sciences.
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.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

Strong Formulations for 2-Node-Connected Steiner Network Problems.
Proceedings of the Combinatorial Optimization and Applications, 2008

Obtaining Optimal k-Cardinality Trees Fast.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
On the Minimum Cut of Planarizations.
Electron. Notes Discret. Math., 2007

Efficient Extraction of Multiple Kuratowski Subdivisions.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.
Proceedings of the Algorithms, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming.
SIAM J. Optim., 2006

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.
Proceedings of the Operations Research, 2006

A New Approximation Algorithm for Bend Minimization in the Kandinsky Model.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2005
Inserting an Edge into a Planar Graph.
Algorithmica, 2005

Recent Advances in Graph Drawing.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Exact Crossing Minimization.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

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

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

A Graph-Theoretic Approach to Steganography.
Proceedings of the Communications and Multimedia Security, 2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.
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.
J. Graph Algorithms Appl., 2004

Automatic layout of UML class diagrams in orthogonal style.
Inf. Vis., 2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004

Technical Foundations.
Proceedings of the Graph Drawing Software, 2004

Introduction.
Proceedings of the Graph Drawing Software, 2004

AGD - A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing Software, 2004

A Diagramming Software for UML Class Diagrams.
Proceedings of the Graph Drawing Software, 2004

Graph Drawing: Exact Optimization Helps!
Proceedings of the Sharpest Cut, 2004

2003
Optimal labeling of point features in rectangular labeling models.
Math. Program., 2003

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2003

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A New Approach for Visualizing UML Class Diagrams.
Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

The SPQR-Tree Data Structure in Graph Drawing.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Graph Embedding with Minimum Depth and Maximum External Face.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

An Experimental Study of Crossing Minimization Heuristics.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Selected Open Problems in Graph Drawing.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
Proceedings of the Algorithms, 2003

2002
Advances in C-Planarity Testing of Clustered Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Bend Minimization in Orthogonal Drawings Using Integer Programming.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
An Alternative Method to Crossing Minimization on Hierarchical Graphs.
SIAM J. Optim., 2001

AGD: A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Caesar Automatic Layout of UML Class Diagrams.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graphs in Software Visualization - Introduction.
Proceedings of the Software Visualization, 2001

Graph Drawing Algorithm Engineering with AGD.
Proceedings of the Software Visualization, 2001

2000
A polyhedral approach to sequence alignment problems.
Discret. Appl. Math., 2000

An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

A Linear Time Implementation of SPQR-Trees.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Computing Optimal Embeddings for Planar Graphs.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Optimal Labelling of Point Features in the Slider Model.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Guest Editors' Introduction.
J. Graph Algorithms Appl., 1999

Optimizing over All Combinatorial Embeddings of a Planar Graph.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Optimal Compaction of Orthogonal Grid Drawings.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen.
Proceedings of the Informatik '99, 1999

The Constrained Crossing Minimization Problem.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Combining Graph Labeling and Compaction.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

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

1998
A note on computing a maximal planar subgraph using PQ-trees.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998

The Thickness of Graphs: A Survey.
Graphs Comb., 1998

The thickness of a minor-excluded class of graphs.
Discret. Math., 1998

Drawing Planar Partitions II: HH-Drawings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

A New Approximation Algorithm for the Planar Augmentation Problem.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Two-Layer Planarization in Graph Drawing.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998


Level Planarity Testing in Linear Time.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Planar Polyline Drawings with Good Angular Resolution.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
J. Graph Algorithms Appl., 1997

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.
J. Comput. Biol., 1997

Algorithmen zum automatischen Zeichnen von Graphen.
Inform. Spektrum, 1997

A branch-and-cut algorithm for multiple sequence alignment.
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.
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.
Proceedings of the Informatik '97, 1997

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Pitfalls of Using PQ-Trees in Automatic Graph Drawing.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

ArchE: A Graph Drawing System for Archaeology.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

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

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
Algorithmica, 1996

1995
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

A Polyhedral Approach to Planar Augmentation and Related Problems.
Proceedings of the Algorithms, 1995

1994
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Book reviews.
ZOR Methods Model. Oper. Res., 1993

Solving the maximum weight planar subgraph.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993


  Loading...