default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetra Mutzel
Person information
- affiliation: University of Bonn, Germany
- affiliation (former): Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]Lukas Metz, Petra Mutzel, Tim Niemann
, Lukas Schürmann, Sebastian Stiller, Andreas M. Tillmann:
Delay-resistant robust vehicle routing with heterogeneous time windows. Comput. Oper. Res. 164: 106553 (2024)- [c133]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. GD 2024: 31:1-31:19 - [c132]Daniel Faber, Adalat Jabrayilov, Petra Mutzel:
SAT Encoding of Partial Ordering Models for Graph Coloring Problems. SAT 2024: 12:1-12:20 - [c131]Jonas Charfreitag, Christine Dahn, Michael Kaibel, Philip Mayer, Petra Mutzel, Lukas Schürmann:
Separator Based Data Reduction for the Maximum Cut Problem. SEA 2024: 4:1-4:21 - [c130]Philip Mayer, Petra Mutzel:
Engineering A* Search for the Flip Distance of Plane Triangulations. SEA 2024: 23:1-23:20 - [i48]Daniel Faber, Adalat Jabrayilov, Petra Mutzel:
SAT Encoding of Partial Ordering Models for Graph Coloring Problems. CoRR abs/2403.15961 (2024) - [i47]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. CoRR abs/2409.02858 (2024) - 2023
- [j60]Md. Saidur Rahman, Petra Mutzel, Slamin:
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022. Algorithmica 85(11): 3325-3326 (2023) - [j59]Md. Saidur Rahman, Petra Mutzel, S. Slamin:
Guest Editors' forewords. J. Graph Algorithms Appl. 27(4): 239-240 (2023) - [j58]Md. Saidur Rahman, Petra Mutzel, Slamin:
Special issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022). Theor. Comput. Sci. 973: 114095 (2023) - [c129]Jonas Charfreitag, Sven Mallach, Petra Mutzel:
Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching. ACDA 2023: 63-74 - [c128]Lukas Schürmann, Petra Mutzel:
A Reduced Cost-based Model Strengthening Method. ACDA 2023: 75-86 - [c127]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. KDD 2023: 1770-1782 - [c126]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. SDM 2023: 19-27 - [c125]Lutz Oettershagen, Petra Mutzel:
An Index For Temporal Closeness Computation in Evolving Graphs. SDM 2023: 280-288 - [c124]Sophie Duong, Peter Rottmann, Jan-Henrik Haunert, Petra Mutzel:
Clustering Building Footprint Polygons Based on Graph Similarity Measures. UrbanAI@SIGSPATIAL 2023: 22-31 - [i46]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. CoRR abs/2305.16001 (2023) - 2022
- [j57]Lutz Oettershagen, Petra Mutzel:
Computing top-k temporal closeness in temporal networks. Knowl. Inf. Syst. 64(2): 507-535 (2022) - [c123]Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel:
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX 2022: 54-66 - [c122]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - [c121]Lutz Oettershagen, Petra Mutzel:
TGLib: An Open-Source Library for Temporal Graph Analysis. ICDM (Workshops) 2022: 1240-1245 - [c120]Petra Mutzel, Tim Niemann, Lukas Schürmann, Sebastian Stiller, Andreas M. Tillmann:
Vehicle Routing with Heterogeneous Time Windows. OR 2022: 171-177 - [c119]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. WWW 2022: 1640-1650 - [p9]Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils M. Kriege, Sven Rahmann:
Protein Complex Similarity. Mach. Learn. under Resour. Constraints Vol. 3 (3) 2022: 85-102 - [p8]Andre Droschinsky, Lina Humbeck, Oliver Koch, Nils M. Kriege, Petra Mutzel, Till Schäfer:
Graph-Based Methods for Rational Drug Design. Algorithms for Big Data 2022: 76-96 - [e8]Petra Mutzel, Md. Saidur Rahman, Slamin:
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings. Lecture Notes in Computer Science 13174, Springer 2022, ISBN 978-3-030-96730-7 [contents] - [i45]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. CoRR abs/2202.03706 (2022) - [i44]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - [i43]Adalat Jabrayilov, Petra Mutzel:
Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem. CoRR abs/2206.13678 (2022) - [i42]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks. CoRR abs/2209.07332 (2022) - [i41]Lutz Oettershagen, Petra Mutzel:
TGLib: An Open-Source Library for Temporal Graph Analysis. CoRR abs/2209.12587 (2022) - 2021
- [j56]Sven Gedicke, Adalat Jabrayilov, Benjamin Niedermann, Petra Mutzel, Jan-Henrik Haunert:
Point feature label placement for multi-page maps on small-screen devices. Comput. Graph. 100: 66-80 (2021) - [j55]Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26: 1.9:1-1.9:30 (2021) - [j54]Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling:
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs. Theor. Comput. Sci. 852: 172-184 (2021) - [e7]Petra Mutzel, Rasmus Pagh, Grzegorz Herman:
29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference). LIPIcs 204, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-204-4 [contents] - [i40]Lutz Oettershagen, Petra Mutzel:
An Index for Single Source All Destinations Distance Queries in Temporal Graphs. CoRR abs/2111.10095 (2021) - 2020
- [j53]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82(2): 355-384 (2020) - [j52]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Classifying Dissemination Processes in Temporal Graphs. Big Data 8(5): 363-378 (2020) - [j51]Tobias Brinkjost, Christiane Ehrt, Oliver Koch, Petra Mutzel:
SCOT: Rethinking the classification of secondary structure elements. Bioinform. 36(8): 2417-2428 (2020) - [j50]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. J. Graph Algorithms Appl. 24(3): 155-170 (2020) - [c118]Andre Droschinsky, Petra Mutzel, Erik Thordsen:
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. ALENEX 2020: 146-160 - [c117]Lutz Oettershagen, Petra Mutzel:
Efficient Top-k Temporal Closeness Calculation in Temporal Networks. ICDM 2020: 402-411 - [c116]Christopher Morris, Gaurav Rattan, Petra Mutzel:
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. NeurIPS 2020 - [c115]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. SDM 2020: 496-504 - [i39]Christopher Morris, Nils M. Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, Marion Neumann:
TUDataset: A collection of benchmark datasets for learning with graphs. CoRR abs/2007.08663 (2020) - [i38]Anne Driemel, Petra Mutzel, Lutz Oettershagen:
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs. CoRR abs/2009.06778 (2020)
2010 – 2019
- 2019
- [j49]Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel:
A unifying view of explicit and implicit feature maps of graph kernels. Data Min. Knowl. Discov. 33(6): 1505-1547 (2019) - [j48]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. J. Graph Algorithms Appl. 23(3): 499-524 (2019) - [c114]Adalat Jabrayilov, Petra Mutzel:
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. ALENEX 2019: 107-116 - [c113]Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils M. Kriege, Sven Rahmann:
Protein Complex Similarity Based on Weisfeiler-Lehman Labeling. SISAP 2019: 308-322 - [c112]Petra Mutzel:
Algorithmic Data Science (Invited Talk). STACS 2019: 3:1-3:15 - [c111]Petra Mutzel, Lutz Oettershagen:
On the Enumeration of Bicriteria Temporal Paths. TAMC 2019: 518-535 - [p7]Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc J. van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, Bettina Speckmann:
10 Reasons to Get Interested in Graph Drawing. Computing and Software Science 2019: 85-104 - [i37]Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. CoRR abs/1903.06061 (2019) - [i36]Christopher Morris, Petra Mutzel:
Towards a practical k-dimensional Weisfeiler-Leman algorithm. CoRR abs/1904.01543 (2019) - [i35]Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR abs/1904.11965 (2019) - [i34]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. CoRR abs/1911.05496 (2019) - 2018
- [j47]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On maximum common subgraph problems in series-parallel graphs. Eur. J. Comb. 68: 79-95 (2018) - [j46]Michael Jünger, Petra Mutzel, Christiane Spisla:
More Compact Orthogonal Drawings by Allowing Additional Bends †. Inf. 9(7): 153 (2018) - [j45]Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. J. Graph Algorithms Appl. 22(4): 607-616 (2018) - [j44]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. SIAM J. Discret. Math. 32(4): 2482-2492 (2018) - [c110]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs. CCCG 2018: 11-17 - [c109]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. GD 2018: 187-199 - [c108]Michael Jünger, Petra Mutzel, Christiane Spisla:
Orthogonal Compaction using Additional Bends. VISIGRAPP (3: IVAPP) 2018: 144-155 - [c107]Christine Dahn, Nils M. Kriege, Petra Mutzel:
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. IWOCA 2018: 141-152 - [c106]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. IWOCA 2018: 273-284 - [c105]Adalat Jabrayilov, Petra Mutzel:
New Integer Linear Programming Models for the Vertex Coloring Problem. LATIN 2018: 640-652 - [c104]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. MFCS 2018: 54:1-54:15 - [c103]Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert:
Recognizing Cuneiform Signs Using Graph Based Methods. COST@SDM 2018: 31-44 - [i33]Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert:
Recognizing Cuneiform Signs Using Graph Based Methods. CoRR abs/1802.05908 (2018) - [i32]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. CoRR abs/1803.07515 (2018) - [i31]Christine Dahn, Nils M. Kriege, Petra Mutzel:
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. CoRR abs/1803.10983 (2018) - [i30]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. CoRR abs/1805.00821 (2018) - [i29]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs. CoRR abs/1805.06780 (2018) - [i28]Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. CoRR abs/1805.10754 (2018) - [i27]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. CoRR abs/1806.06617 (2018) - [i26]Adalat Jabrayilov, Petra Mutzel:
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. CoRR abs/1806.10697 (2018) - [i25]Petra Mutzel, Lutz Oettershagen:
On the Enumeration of Bicriteria Temporal Paths. CoRR abs/1812.02507 (2018) - [i24]Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling:
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs. CoRR abs/1812.03074 (2018) - 2017
- [j43]Julia Sender, Thomas Siwczyk, Petra Mutzel, Uwe Clausen:
Matheuristics for optimizing the network in German wagonload traffic. EURO J. Comput. Optim. 5(3): 367-392 (2017) - [j42]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic survivable network design problems: Theory and practice. Eur. J. Oper. Res. 256(2): 333-348 (2017) - [j41]Till Schäfer, Nils M. Kriege, Lina Humbeck, Karsten Klein, Oliver Koch, Petra Mutzel:
Scaffold Hunter: a comprehensive visual analytics framework for drug discovery. J. Cheminformatics 9(1): 28:1-28:18 (2017) - [c102]Till Schäfer, Petra Mutzel:
StruClus: Scalable Structural Graph Set Clustering with Representative Sampling. ADMA 2017: 343-359 - [c101]Christopher Morris, Kristian Kersting, Petra Mutzel:
Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs. ICDM 2017: 327-336 - [c100]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c99]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. SOFSEM 2017: 309-321 - [c98]Fritz Bökler, Petra Mutzel:
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. WALCOM 2017: 190-203 - [i23]Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel:
A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels. CoRR abs/1703.00676 (2017) - [i22]Christopher Morris, Kristian Kersting, Petra Mutzel:
Global Weisfeiler-Lehman Graph Kernels. CoRR abs/1703.02379 (2017) - [i21]Michael Jünger, Petra Mutzel, Christiane Spisla:
Orthogonal Compaction Using Additional Bends. CoRR abs/1706.06514 (2017) - [i20]Adalat Jabrayilov, Petra Mutzel:
New Integer Linear Programming Models for the Vertex Coloring Problem. CoRR abs/1706.10191 (2017) - [i19]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. CoRR abs/1708.02772 (2017) - 2016
- [c97]Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden:
Compact Layered Drawings of General Directed Graphs. GD 2016: 209-221 - [c96]Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel:
Faster Kernels for Graphs with Continuous Attributes via Hashing. ICDM 2016: 1095-1100 - [c95]Denis Kurz, Petra Mutzel:
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph. ISAAC 2016: 49:1-49:13 - [c94]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. MFCS 2016: 33:1-33:14 - [i18]Denis Kurz, Petra Mutzel:
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph. CoRR abs/1601.02867 (2016) - [i17]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. CoRR abs/1602.07210 (2016) - [i16]Fritz Bökler, Petra Mutzel:
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. CoRR abs/1604.08147 (2016) - [i15]Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden:
Compact Layered Drawings of General Directed Graphs. CoRR abs/1609.01755 (2016) - [i14]Till Schäfer, Petra Mutzel:
StruClus: Structural Clustering of Large-Scale Graph Databases. CoRR abs/1609.09000 (2016) - [i13]Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel:
Faster Kernels for Graphs with Continuous Attributes via Hashing. CoRR abs/1610.00064 (2016) - [i12]Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel:
Output-sensitive Complexity of Multiobjective Combinatorial Optimization. CoRR abs/1610.07204 (2016) - [i11]Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. CoRR abs/1610.08739 (2016) - [i10]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs With Bounded Pathwidth. CoRR abs/1612.03854 (2016) - 2015
- [j40]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - [c93]Fritz Bökler, Petra Mutzel:
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. ESA 2015: 288-299 - [i9]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. CoRR abs/1510.00549 (2015) - 2014
- [j39]Karsten Klein, Oliver Koch, Nils M. Kriege, Petra Mutzel, Till Schäfer:
Scaffold hunter: visual analysis of biological activity data. J. Cheminformatics 6(S-1): 33 (2014) - [j38]David A. Bader, Petra Mutzel:
Introduction to Special Issue ALENEX'12. ACM J. Exp. Algorithmics 19(1) (2014) - [j37]Nils M. Kriege, Petra Mutzel, Till Schäfer:
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics. J. Graph Algorithms Appl. 18(4): 577-602 (2014) - [c92]Carsten Gutwenger, Petra Mutzel, Marcus Schaefer:
Practical Experience with Hanani-Tutte for Testing c-Planarity. ALENEX 2014: 86-97 - [c91]Carsten Gutwenger, Ulf Rüegg, Miro Spönemann, Reinhard von Hanxleden, Petra Mutzel:
Examining the Compactness of Automatically Generated Layouts for Practical Diagrams. ED/GViP@Diagrams 2014: 42-52 - [c90]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c89]Nils M. Kriege, Marion Neumann, Kristian Kersting, Petra Mutzel:
Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. ICDM 2014: 881-886 - [c88]Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93 - [c87]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. IWOCA 2014: 200-212 - [c86]Nils M. Kriege, Petra Mutzel:
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. MFCS (2) 2014: 505-516 - [c85]Nils M. Kriege, Petra Mutzel, Till Schäfer:
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. WALCOM 2014: 90-101 - [i8]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - 2013
- [j36]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic Survivable Network Design Problems. Electron. Notes Discret. Math. 41: 245-252 (2013) - [j35]Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Algorithm Engineering im Graphenzeichnen. Inform. Spektrum 36(2): 162-173 (2013) - [c84]Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel:
The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR 2013: 300-315 - [c83]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP 2013: 515-524 - [c82]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
The Landscape Metaphor for Visualization of Molecular Similarities. VISIGRAPP (Selected Papers) 2013: 85-100 - [r3]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [r2]Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel:
The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization 2013: 543-569 - 2012
- [j34]Markus Chimani, Petr Hlinený, Petra Mutzel:
Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012) - [j33]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16: 67-78 (2012) - [c81]Karsten Klein, Nils M. Kriege, Petra Mutzel:
Scaffold Hunter - Visual Analysis of Chemical Compound Databases. GRAPP/IVAPP 2012: 626-635 - [c80]Nils M. Kriege, Petra Mutzel:
Subgraph Matching Kernels for Attributed Graphs. ICML 2012 - [c79]Denis Kurz, Petra Mutzel, Bernd Zey:
Parameterized Algorithms for Stochastic Steiner Tree Problems. MEMICS 2012: 143-154 - [c78]Karsten Klein, Nils M. Kriege, Petra Mutzel:
Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space. VISIGRAPP (Selected Papers) 2012: 176-192 - [e6]David A. Bader, Petra Mutzel:
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012. SIAM / Omnipress 2012, ISBN 978-1-61197-212-2 [contents] - 2011
- [j32]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j31]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics 17(1) (2011) - [j30]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. J. Graph Algorithms Appl. 15(1): 127-155 (2011) - [c77]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 - [c76]Karsten Klein, Nils M. Kriege, Petra Mutzel:
CT-index: Fingerprint-based graph indexing combining cycles and trees. ICDE 2011: 1115-1126 - [c75]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner Tree Algorithms for Bounded Treewidth. IWOCA 2011: 374-386 - [i7]Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel:
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1(5): 47-60 (2011) - 2010
- [j29]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-free upward crossing minimization. ACM J. Exp. Algorithmics 15 (2010) - [j28]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124(1-2): 413-439 (2010) - [c74]Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel:
An Experimental Evaluation of Multilevel Layout Methods. GD 2010: 80-91 - [c73]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. GD 2010: 141-152 - [c72]Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439 - [e5]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
Algorithm Engineering, 27.06. - 02.07.2010. Dagstuhl Seminar Proceedings 10261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i6]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering 2010 - [i5]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Executive Summary - Algorithm Engineering. Algorithm Engineering 2010
2000 – 2009
- 2009
- [j27]Katharina Podwojski, Arno Fritsch, Daniel C. Chamrad, Wolfgang Paul, Barbara Sitek, Kai Stühler, Petra Mutzel, Christian Stephan, Helmut E. Meyer, Wolfgang Urfer, Katja Ickstadt, Jörg Rahnenführer:
Retention time alignment algorithms for LC/MS data must consider non-linear shifts. Bioinform. 25(6): 758-764 (2009) - [j26]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithmics 14 (2009) - [j25]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining optimal k-cardinality trees fast. ACM J. Exp. Algorithmics 14 (2009) - [c71]Petra Mutzel:
The Crossing Number of Graphs: Theory and Computation. Efficient Algorithms 2009: 305-317 - [c70]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 - [c69]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. GD 2009: 94-106 - [c68]Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel:
Port Constraints in Hierarchical Layout of Data Flow Diagrams. GD 2009: 135-146 - [c67]Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow:
On Open Problems in Biological Network Visualization. GD 2009: 256-267 - [c66]Karsten Klein, Nils M. Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel:
Scaffold Hunter - Interactive Exploration of Chemical Space. GD 2009: 426-427 - [c65]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300 - [c64]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf:
Inserting a vertex into a planar graph. SODA 2009: 375-383 - [r1]Petra Mutzel:
Optimization in Leveled Graphs. Encyclopedia of Optimization 2009: 2813-2820 - 2008
- [j24]Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - [j23]Petra Mutzel:
Recent Advances in Exact Crossing Minimization (Extended Abstract). Electron. Notes Discret. Math. 31: 33-36 (2008) - [j22]Carsten Gutwenger, Karsten Klein, Petra Mutzel:
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. J. Graph Algorithms Appl. 12(1): 73-95 (2008) - [j21]Dorothea Emig, Melissa S. Cline, Karsten Klein, Anne Kunert, Petra Mutzel, Thomas Lengauer, Mario Albrecht:
Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks. J. Integr. Bioinform. 5(2) (2008) - [c63]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 - [c62]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 - [c61]Markus Chimani, Petra Mutzel, Immanuel M. Bomze:
A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 - [c60]Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
Computing Maximum C-Planar Subgraphs. GD 2008: 114-120 - [c59]J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz:
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. GD 2008: 157-168 - [c58]Markus Chimani, Petr Hlinený, Petra Mutzel:
Approximating the Crossing Number of Apex Graphs. GD 2008: 432-434 - [c57]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 - [e4]Stephen P. Borgatti, Stephen G. Kobourov, Oliver Kohlbacher, Petra Mutzel:
Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05. - 09.05.2008. Dagstuhl Seminar Proceedings 08191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i4]Stephen P. Borgatti, Stephen G. Kobourov, Oliver Kohlbacher, Petra Mutzel:
08191 Abstracts Collection - Graph Drawing with Applications to Bioinformatics and Social Sciences. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - [i3]Stephen P. Borgatti, Stephen G. Kobourov, Oliver Kohlbacher, Petra Mutzel:
08191 Executive Summary - Graph Drawing with Applications to Bioinformatics and Social Sciences. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j20]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
On the Minimum Cut of Planarizations. Electron. Notes Discret. Math. 28: 177-184 (2007) - [c56]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c55]Markus Chimani, Maria Kandyba, Petra Mutzel:
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. ESA 2007: 681-692 - [c54]Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions. GD 2007: 159-170 - 2006
- [j19]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) - [j18]Petra Mutzel, René Weiskircher:
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming. SIAM J. Optim. 17(3): 665-687 (2006) - [c53]Carsten Gutwenger, Karsten Klein, Petra Mutzel:
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. GD 2006: 126-137 - [c52]Wilhelm Barth, Petra Mutzel, Canan Yildiz:
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. GD 2006: 343-354 - [c51]Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl:
A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202 - [c50]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 - [e3]Michael Jünger, Stephen G. Kobourov, Petra Mutzel:
Graph Drawing, 8.-13. May 2005. Dagstuhl Seminar Proceedings 05191, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j17]Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an Edge into a Planar Graph. Algorithmica 41(4): 289-308 (2005) - [c49]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 - [c48]Stefan Hetzl, Petra Mutzel:
A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security 2005: 119-128 - [c47]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization. GD 2005: 37-48 - [c46]Petra Mutzel:
Recent Advances in Graph Drawing. SOFSEM 2005: 41 - [i2]Michael Jünger, Stephen G. Kobourov, Petra Mutzel:
05191 Executive Summary - Graph Drawing. Graph Drawing 2005 - [i1]Michael Jünger, Petra Mutzel, Stephen G. Kobourov:
05191 Abstracts Collection - Graph Drawing. Graph Drawing 2005 - 2004
- [j16]Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller:
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3): 189-208 (2004) - [j15]Wilhelm Barth, Petra Mutzel, Michael Jünger:
Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8(2): 179-194 (2004) - [c45]Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher:
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 - [p6]Petra Mutzel, Michael Jünger:
Graph Drawing: Exact Optimization Helps! The Sharpest Cut 2004: 327-352 - [p5]Michael Jünger, Petra Mutzel:
Introduction. Graph Drawing Software 2004: 1-7 - [p4]Michael Jünger, Petra Mutzel:
Technical Foundations. Graph Drawing Software 2004: 9-53 - [p3]Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
AGD - A Library of Algorithms for Graph Drawing. Graph Drawing Software 2004: 149-172 - [p2]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
A Diagramming Software for UML Class Diagrams. Graph Drawing Software 2004: 257-278 - [e2]Michael Jünger, Petra Mutzel:
Graph Drawing Software. Springer 2004, ISBN 978-3-642-62214-4 [contents] - 2003
- [j14]Petra Mutzel, Michael Jünger:
Guest Editors' Foreword. J. Graph Algorithms Appl. 7(4): 307-309 (2003) - [j13]Gunnar W. Klau, Petra Mutzel:
Optimal labeling of point features in rectangular labeling models. Math. Program. 94(2-3): 435-458 (2003) - [c44]Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher:
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 - [c43]Carsten Gutwenger, Petra Mutzel:
An Experimental Study of Crossing Minimization Heuristics. GD 2003: 13-24 - [c42]Carsten Gutwenger, Petra Mutzel:
Graph Embedding with Minimum Depth and Maximum External Face. GD 2003: 259-272 - [c41]Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel:
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - [c40]Petra Mutzel:
The SPQR-Tree Data Structure in Graph Drawing. ICALP 2003: 34-46 - [c39]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
A New Approach for Visualizing UML Class Diagrams. SOFTVIS 2003: 179-188 - [c38]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 - 2002
- [c37]Petra Mutzel, René Weiskircher:
Bend Minimization in Orthogonal Drawings Using Integer Programming. COCOON 2002: 484-493 - [c36]Wilhelm Barth, Michael Jünger, Petra Mutzel:
Simple and Efficient Bilayer Cross Counting. GD 2002: 130-141 - [c35]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs. GD 2002: 220-235 - [e1]Petra Mutzel, Michael Jünger, Sebastian Leipert:
Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers. Lecture Notes in Computer Science 2265, Springer 2002, ISBN 3-540-43309-0 [contents] - 2001
- [j12]Petra Mutzel:
An Alternative Method to Crossing Minimization on Hierarchical Graphs. SIAM J. Optim. 11(4): 1065-1080 (2001) - [c34]Petra Mutzel, Peter Eades:
Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294 - [c33]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel:
Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323 - [c32]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
Caesar Automatic Layout of UML Class Diagrams. GD 2001: 461-462 - [c31]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher:
AGD: A Library of Algorithms for Graph Drawing. GD 2001: 473-474 - [c30]Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an edge into a planar graph. SODA 2001: 246-255 - 2000
- [j11]John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron:
A polyhedral approach to sequence alignment problems. Discret. Appl. Math. 104(1-3): 143-186 (2000) - [c29]Petra Mutzel, René Weiskircher:
Computing Optimal Embeddings for Planar Graphs. COCOON 2000: 95-104 - [c28]Gunnar W. Klau, Petra Mutzel:
Optimal Labelling of Point Features in the Slider Model. COCOON 2000: 340-350 - [c27]Gunnar W. Klau, Karsten Klein, Petra Mutzel:
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). GD 2000: 37-51 - [c26]Carsten Gutwenger, Petra Mutzel:
A Linear Time Implementation of SPQR-Trees. GD 2000: 77-90
1990 – 1999
- 1999
- [j10]Giuseppe Di Battista, Petra Mutzel:
Guest Editors' Introduction. J. Graph Algorithms Appl. 3(4): 1-2 (1999) - [c25]Gunnar W. Klau, Petra Mutzel:
Combining Graph Labeling and Compaction. GD 1999: 27-37 - [c24]Petra Mutzel, Thomas Ziegler:
The Constrained Crossing Minimization Problem. GD 1999: 175-185 - [c23]Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber:
Graph-Drawing Contest Report. GD 1999: 400-409 - [c22]Petra Mutzel, René Weiskircher:
Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. GI Jahrestagung 1999: 199-206 - [c21]Gunnar W. Klau, Petra Mutzel:
Optimal Compaction of Orthogonal Grid Drawings. IPCO 1999: 304-319 - [c20]Petra Mutzel, René Weiskircher:
Optimizing over All Combinatorial Embeddings of a Planar Graph. IPCO 1999: 361-376 - [p1]Peter Eades, Petra Mutzel:
Graph Drawing Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j9]Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt:
The thickness of a minor-excluded class of graphs. Discret. Math. 182(1-3): 169-176 (1998) - [j8]Petra Mutzel, Thomas Odenthal, Mark Scharbrodt:
The Thickness of Graphs: A Survey. Graphs Comb. 14(1): 59-73 (1998) - [j7]Michael Jünger, Sebastian Leipert, Petra Mutzel:
A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(7): 609-612 (1998) - [c19]Carsten Gutwenger, Petra Mutzel:
Planar Polyline Drawings with Good Angular Resolution. GD 1998: 167-182 - [c18]Michael Jünger, Sebastian Leipert, Petra Mutzel:
Level Planarity Testing in Linear Time. GD 1998: 224-237 - [c17]Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North:
Graph-Drawing Contest Report. GD 1998: 423-435 - [c16]Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert:
A Library of Algorithms for Graph Drawing. GD 1998: 456-457 - [c15]Petra Mutzel, René Weiskircher:
Two-Layer Planarization in Graph Drawing. ISAAC 1998: 69-78 - [c14]Sergej Fialko, Petra Mutzel:
A New Approximation Algorithm for the Planar Augmentation Problem. SODA 1998: 260-269 - [c13]Therese Biedl, Michael Kaufmann, Petra Mutzel:
Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136 - 1997
- [j6]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel:
Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum 20(4): 199-207 (1997) - [j5]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. 4(4): 433-447 (1997) - [j4]Michael Jünger, Petra Mutzel:
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1(1): 1-25 (1997) - [c12]Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal:
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. GD 1997: 13-24 - [c11]Michael Jünger, Sebastian Leipert, Petra Mutzel:
Pitfalls of Using PQ-Trees in Automatic Graph Drawing. GD 1997: 193-204 - [c10]Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome:
ArchE: A Graph Drawing System for Archaeology. GD 1997: 297-302 - [c9]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer:
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. GI Jahrestagung 1997: 58-67 - [c8]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes. RECOMB 1997: 84-92 - [c7]Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu:
A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250 - [c6]David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher:
AGD-Library: A Library of Algorithms for Graph Drawing. WAE 1997: 112-123 - 1996
- [j3]Michael Jünger, Petra Mutzel:
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16(1): 33-59 (1996) - [j2]Kurt Mehlhorn, Petra Mutzel:
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996) - [c5]Petra Mutzel:
An Alternative Method to Crossing Minimization on Hierarchical Graphs. GD 1996: 318-333 - 1995
- [c4]Petra Mutzel:
A Polyhedral Approach to Planar Augmentation and Related Problems. ESA 1995: 494-507 - [c3]Michael Jünger, Petra Mutzel:
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. GD 1995: 337-348 - 1994
- [c2]Michael Jünger, Petra Mutzel:
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. GD 1994: 119-130 - 1993
- [j1]M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby:
Book reviews. ZOR Methods Model. Oper. Res. 37(1): 112-117 (1993) - [c1]Michael Jünger, Petra Mutzel:
Solving the maximum weight planar subgraph. IPCO 1993: 479-492
Coauthor Index
[c133] [i47] [c123] [j55] [j48] [i35] [j46] [c109] [c108] [i27] [i21] [j35] [c83] [c82] [r3] [r2] [j31] [c77] [c72] [j24] [c59] [e3] [c47] [i2] [i1] [j16] [j15] [p6] [p5] [p4] [p3] [p2] [e2] [j14] [c39] [c38] [c36] [c35] [e1] [c33] [c32] [c31] [c23] [j9] [j7] [c18] [c16] [j6] [j5] [j4] [c12] [c11] [c9] [c8] [j3] [c3] [c2] [c1]
[c127] [c126] [i46] [c119] [p9] [p8] [i45] [i42] [j54] [j52] [j50] [c115] [i39] [j49] [c113] [i37] [i34] [j47] [j45] [c107] [c104] [c103] [i33] [i31] [i30] [i28] [i24] [j41] [c99] [i23] [i19] [c96] [c94] [i17] [i13] [i11] [j39] [j37] [c89] [c88] [c87] [c86] [c85] [c83] [c82] [c81] [c80] [c78] [c76] [c66]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
