#250,725

Most Influential Person

German computer scientist

According to Wikipedia, Petra Mutzel is a German computer scientist, a University Professor of computer science at the University of Bonn. Her research is in the areas of algorithm engineering, graph drawing and combinatorial optimization.

- Graph Drawing Software (2003) (355)
- A Linear Time Implementation of SPQR-Trees (2000) (244)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (1997) (237)
- An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem (2006) (222)
- TUDataset: A collection of benchmark datasets for learning with graphs (2020) (212)
- Interactive exploration of chemical space with Scaffold Hunter. (2009) (200)
- Computational Molecular Biology (1996) (172)
- Subgraph Matching Kernels for Attributed Graphs (2012) (170)
- The Open Graph Drawing Framework (OGDF) (2013) (147)
- Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm (1995) (141)
- A Graph-Theoretic Approach to Steganography (2005) (140)
- The Thickness of Graphs: A Survey (1998) (110)
- Inserting an Edge into a Planar Graph (2001) (94)
- Level Planarity Testing in Linear Time (1998) (84)
- Retention time alignment algorithms for LC/MS data must consider non-linear shifts (2009) (84)
- A new approach for visualizing UML class diagrams (2003) (83)
- A branch-and-cut algorithm for multiple sequence alignment (1997) (77)
- An Alternative Method to Crossing Minimization on Hierarchical Graphs (1996) (76)
- Planar Polyline Drawings with Good Angular Resolution (1998) (72)
- Advances in C-Planarity Testing of Clustered Graphs (2002) (70)
- Faster Kernels for Graphs with Continuous Attributes via Hashing (2016) (67)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (1996) (64)
- A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem (1997) (64)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (1996) (62)
- Optimal Compaction of Orthogonal Grid Drawings (1999) (61)
- Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem (2004) (60)
- Selected Open Problems in Graph Drawing (2003) (60)
- The Maximum Weight Connected Subgraph Problem (2013) (59)
- Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs (2017) (57)
- Simple and Efficient Bilayer Cross Counting (2002) (49)
- Exact ground states of two-dimensional ±J Ising spin glasses (1996) (46)
- Quasi-orthogonal drawing of planar graphs (1998) (45)
- Solving the Prize-Collecting Steiner Tree Problem to Optimality (2005) (45)
- Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings (2019) (44)
- An Experimental Study of Crossing Minimization Heuristics (2003) (44)
- CT-index: Fingerprint-based graph indexing combining cycles and trees (2011) (43)
- Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization (1995) (42)
- On Open Problems in Biological Network Visualization (2009) (41)
- Drawing Planar Partitions II: HH-Drawings (1998) (40)
- A New Approach to Exact Crossing Minimization (2008) (39)
- Crossings and Planarization (2013) (39)
- Scaffold Hunter: a comprehensive visual analytics framework for drug discovery (2017) (37)
- Combining Graph Labeling and Compaction (1999) (36)
- Automatic Layout of UML Class Diagrams in Orthogonal Style (2004) (36)
- A Polyhedral Approach to Planar Augmentation and Related Problems (1995) (36)
- A note on computing a maximal planar subgraph using PQ-trees (1998) (35)
- Optimal labeling of point features in rectangular labeling models (2003) (35)
- Exact Crossing Minimization (2005) (34)
- An Experimental Evaluation of Multilevel Layout Methods (2010) (34)
- An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract) (2000) (33)
- Improved Steiner Tree Algorithms for Bounded Treewidth (2011) (32)
- Graph Drawing Algorithms (1999) (32)
- The Open Graph Drawing Framework (2013) (32)
- A branch-and-cut approach to the crossing number problem (2008) (32)
- An SDP approach to multi-level crossing minimization (2011) (31)
- Layer-free upward crossing minimization (2008) (31)
- AGD: A Library of Algorithms for Graph Drawing (1998) (30)
- Inserting a vertex into a planar graph (2009) (29)
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints (2006) (29)
- A new approximation algorithm for the planar augmentation problem (1998) (28)
- Pitfalls of Using PQ-Trees in Automatic Graph Drawing (1997) (28)
- Drawing Partially Embedded and Simultaneously Planar Graphs (2014) (27)
- A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes (1997) (26)
- Obtaining optimal k-cardinality trees fast (2008) (26)
- Output-sensitive Complexity of Multiobjective Combinatorial Optimization (2016) (26)
- Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels (2014) (26)
- A Library of Algorithms for Graph Drawing (1998) (25)
- A branch-and-cut approach to physical mapping with end-probes (1997) (24)
- Port Constraints in Hierarchical Layout of Data Flow Diagrams (2009) (24)
- Vertex insertion approximates the crossing number of apex graphs (2012) (23)
- Optimizing over All Combinatorial Embeddings of a Planar Graph (1999) (22)
- Experiments on exact crossing minimization using column generation (2006) (22)
- The Rooted Maximum Node-Weight Connected Subgraph Problem (2013) (22)
- Two-Layer Planarization in Graph Drawing (1998) (22)
- Optimal Labelling of Point Features in the Slider Model (2000) (21)
- The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract (2003) (21)
- AGD-Library: A Library of Algorithms for Graph Drawing (1997) (21)
- Upward Planarization Layout (2009) (19)
- A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels (2017) (19)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (2015) (19)
- New Integer Linear Programming Models for the Vertex Coloring Problem (2017) (19)
- Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut (1993) (19)
- Recognizing Cuneiform Signs Using Graph Based Methods (2018) (19)
- Visual Analysis of Biological Activity Data with Scaffold Hunter (2013) (18)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (2009) (18)
- Orientation-based models for {0,1,2}-survivable network design: theory and practice (2010) (17)
- A unifying view of explicit and implicit feature maps of graph kernels (2017) (17)
- OGDF an Open Graph Drawing Framework (2007) (17)
- Algorithmen zum automatischen Zeichnen von Graphen (1997) (17)
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks (2006) (17)
- The Constrained Crossing Minimization Problem (1999) (17)
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut (2010) (15)
- The SPQR-Tree Data Structure in Graph Drawing (2003) (15)
- The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems (1994) (15)
- CHIPMUNK: A Virtual Synthesizable Small‐Molecule Library for Medicinal Chemistry, Exploitable for Protein–Protein Interaction Modulators (2018) (14)
- Graph Embedding with Minimum Depth and Maximum External Face (2003) (13)
- An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm (1993) (13)
- Graph Drawing Algorithm Engineering with AGD (2001) (13)
- Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs (2019) (13)
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks (2007) (13)
- The thickness of a minor-excluded class of graphs (1998) (13)
- Computing Maximum C-Planar Subgraphs (2009) (12)
- Computing Optimal Embeddings for Planar Graphs (2000) (12)
- Efficient Extraction of Multiple Kuratowski Subdivisions (2007) (12)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (2008) (10)
- On the Minimum Cut of Planarizations (2007) (10)
- Practical Experience with Hanani-Tutte for Testing c-Planarity (2014) (10)
- Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints (2010) (10)
- A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks (2007) (10)
- Solving the maximum weight planar subgraph (1993) (10)
- ArchE: A Graph Drawing System for Archaeology (1997) (10)
- Temporal Graph Kernels for Classifying Dissemination Processes (2019) (10)
- Stochastic survivable network design problems: Theory and practice (2017) (10)
- Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space (2012) (10)
- Compact Layered Drawings of General Directed Graphs (2016) (9)
- Bend Minimization in Orthogonal Drawings Using Integer Programming (2002) (9)
- Towards a practical k-dimensional Weisfeiler-Leman algorithm (2019) (9)
- Bishellable drawings of Kn (2015) (9)
- Faster Algorithms for the Maximum Common Subtree Isomorphism Problem (2016) (9)
- Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics (2014) (9)
- Caesar Automatic Layout of UML Class Diagrams (2001) (9)
- Colored Simultaneous Geometric Embeddings (2007) (9)
- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model (2006) (9)
- Subgraph induced planar connectivity augmentation (2003) (9)
- Stochastic Survivable Network Design Problems (2013) (9)
- A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph (2016) (9)
- Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers (2002) (9)
- On the Hardness and Approximability of Planar Biconnectivity Augmentation (2009) (8)
- Corrigendum: Interactive exploration of chemical space with Scaffold Hunter (2009) (8)
- Approximating the Crossing Number of Apex Graphs (2009) (7)
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search (2014) (7)
- Finding Largest Common Substructures of Molecules in Quadratic Time (2016) (7)
- On maximum common subgraph problems in series-parallel graphs (2014) (7)
- A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs (2018) (7)
- ArchEd: an Interactive Tool for Visualizing Harris Matrices (2001) (6)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (2014) (6)
- Crossing Number for Graphs with Bounded Pathwidth (2016) (6)
- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (2014) (6)
- Revised Papers from the 9th International Symposium on Graph Drawing (2001) (6)
- On the Enumeration of Bicriteria Temporal Paths (2018) (6)
- Parameterized Algorithms for Stochastic Steiner Tree Problems (2012) (6)
- StruClus: Scalable Structural Graph Set Clustering with Representative Sampling (2017) (5)
- Maximum Cut Parameterized by Crossing Number (2019) (5)
- The constrained crossing minimization problem: a first approach (1999) (5)
- Examining the Compactness of Automatic Layout Algorithms for Practical Diagrams (2014) (5)
- Graphs in Software Visualization - Introduction (2001) (5)
- Automatic Layout and Labelling of State Diagrams (2003) (4)
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem (2016) (4)
- WiGis : a Framework for Web-based Interactive Graph Visualizations (2012) (4)
- Planar Biconnectivity Augmentation with Fixed Embedding (2009) (4)
- Bend–Minimal Orthogonal Drawing of Non–Planar Graphs (2004) (4)
- Global Weisfeiler-Lehman Graph Kernels (2017) (4)
- Technical Foundations (2004) (4)
- Protein Complex Similarity Based on Weisfeiler-Lehman Labeling (2019) (4)
- A Graph-drawing Perspective to Some Open Problems in Molecular Biology (2008) (4)
- 10 Reasons to Get Interested in Graph Drawing (2019) (4)
- Recent Advances in Exact Crossing Minimization (Extended Abstract) (2008) (4)
- Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks (2008) (3)
- SCOT: Rethinking the classification of secondary structure elements (2019) (3)
- Approximate and exact algorithms for the maximum planar subgraph problem (1994) (3)
- The Crossing Number of Seq-Shellable Drawings of Complete Graphs (2018) (3)
- MolMap - Visualizing Molecule Libraries as Topographic Maps (2016) (3)
- AGD - A Library of Algorithms for Graph Drawing (2004) (3)
- RNA Structural Alignment by Means of Lagrangian Relaxation (2004) (3)
- Graph Drawing: Exact Optimization Helps! (2004) (3)
- Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs (2018) (3)
- Matheuristics for optimizing the network in German wagonload traffic (2017) (3)
- Classifying Dissemination Processes in Temporal Graphs (2020) (3)
- Quantum Annealing versus Digital Computing (2021) (3)
- Orthogonal Compaction using Additional Bends (2017) (3)
- Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract) (2003) (3)
- A Diagramming Software for UML Class Diagrams (2004) (2)
- Algorithmic Data Science (Invited Talk) (2019) (2)
- Point feature label placement for multi-page maps on small-screen devices (2021) (2)
- Optimization in Leveled Graphs (2009) (2)
- McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems (2022) (2)
- Scaffold Hunter - Visual Analysis of Chemical Compound Databases (2018) (2)
- The Crossing Number of Graphs: Theory and Computation (2009) (2)
- Bend Minimization in Planar Orthogonal Drawings Using Integer Programming (2006) (2)
- Algorithm Engineering im Graphenzeichnen (2013) (2)
- Increasing Virus Test Capacity via Recursive Pool Testing with an Application to SARS-CoV-2 Testing (2020) (2)
- Efficient Extraction of Multiple Kuratowski Subdivisions (TR) (2007) (2)
- Visualizing Domain Interaction Networks and the Impact of Alternative Splicing Events (2008) (2)
- StruClus: Structural Clustering of Large-Scale Graph Databases (2016) (2)
- Efficient Top-k Temporal Closeness Calculation in Temporal Networks (2020) (2)
- Computing top-k temporal closeness in temporal networks (2022) (2)
- Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach (2020) (2)
- More Compact Orthogonal Drawings by Allowing Additional Bends † (2018) (2)
- Chapter 4 Graphs in Software Visualization (2002) (2)
- Cover Feature: CHIPMUNK: A Virtual Synthesizable Small‐Molecule Library for Medicinal Chemistry, Exploitable for Protein–Protein Interaction Modulators (ChemMedChem 6/2018) (2018) (1)
- The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs (2018) (1)
- Planarity Testing for C-Connected Clustered Graphs (2006) (1)
- On the Minimum Cut of Planarizations Technical Report TR 06-1003 (2006) (1)
- Largest Weight Common Subtree Embeddings with Distance Penalties (2018) (1)
- Scaffold Hunter - Interactive Exploration of Chemical Space (2009) (1)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (2018) (1)
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (2018) (1)
- Graph Drawing with Applications to Bioinformatics and Social Sciences 3 Social Networks from a Graph Drawing Perspective (2008) (1)
- The Landscape Metaphor for Visualization of Molecular Similarities (2013) (1)
- Automatisiertes Zeichnen von Diagrammen (1995) (1)
- Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191) (2011) (1)
- 08191 Executive Summary - Graph Drawing with Applications to Bioinformatics and Social Sciences (2008) (1)
- Introduction to Special Issue ALENEX'12 (2015) (0)
- Protein complex similarity based on 1 Weisfeiler-Lehman labeling (2018) (0)
- 10261 Abstracts Collection Algorithm Engineering Dagstuhl Seminar (2010) (0)
- Finding Provably Optimal Solutions for the ( Prize Collecting ) Steiner Tree Problem (2005) (0)
- Guest Editors' Foreword (2003) (0)
- Chapter 10. Challenges in Algorithm Engineering (0)
- Graph Drawing, 8.-13. May 2005 (2006) (0)
- Computational Results with Another Method of Solving Very Long and Thin LPs (1990) (0)
- Guest Editors' Introduction (1999) (0)
- Acknowledgement to referees (1995) (0)
- Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs (2020) (0)
- 10261 Executive Summary - Algorithm Engineering (2010) (0)
- The Thickness of Graphs withoutK 5-Minors (1994) (0)
- The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs (2018) (0)
- Algorithmic Data Science (2019) (0)
- An improved lower bound for crossing numbers (2002) (0)
- XVII EGC , Alicante , June 26-28 , 2017 Bishellable drawings of K n a (2017) (0)
- Drawing Partially Embedded and (2015) (0)
- Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem (2022) (0)
- Graph Drawing with Algorithm Engineering Methods (2011) (0)
- Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen (1999) (0)
- Temporal Walk Centrality: Ranking Nodes in Evolving Networks (2022) (0)
- Examining the Compactness of Automatically Generated Layouts for Practical Diagrams (2014) (0)
- Bishellable drawings of $K_n$ (2015) (0)
- On the Enumeration and Counting of Bicriteria Temporal Paths. (2018) (0)
- th International Symposium on Graph Drawing September 22-25 , 2009 , Chicago , Illinois , USA Program Committee (2012) (0)
- Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen (1997) (0)
- Minimum-Error Triangulations for Sea Surface Reconstruction (2022) (0)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (2018) (0)
- Graph Drawing (2002) (0)
- Scaffold hunter: visual analysis of biological activity data (2014) (0)
- Automati Layout and Labellingof State (2000) (0)
- 05191 Executive Summary - Graph Drawing (2005) (0)
- 10261 Abstracts Collection - Algorithm Engineering (2010) (0)
- Simple and EÆcient Bilayer Cross Counting (0)
- Diplomarbeit Optimal Crossing Minimization using Integer Linear Programming (2005) (0)
- Warum Mathematik studieren (2008) (0)
- An Index for Single Source All Destinations Distance Queries in Temporal Graphs (2021) (0)
- mSTAR: Multicriteria Spatio Temporal Altimetry Retracking (2021) (0)
- Ò Üôööññòøøð Óñôôöö×óò Óó Çöøøóóóòòð Óñôô Blockinøøóò Ððóööøøñ×´´üøøòòòò (2007) (0)
- Recent Advances in Graph Drawing (2005) (0)
- Book reviews (1993) (0)
- Discrete Optimization Stochastic survivable network design problems : Theory and practice (2018) (0)
- Advances in Graph Drawing Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing, GD 2001: Guest Editors' Foreword (2006) (0)
- 05191 Abstracts Collection - Graph Drawing (2005) (0)
- 08191 Abstracts Collection - Graph Drawing with Applications to Bioinformatics and Social Sciences (2008) (0)

This paper list is powered by the following services:

Petra Mutzel is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!