Petra Mutzel
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [j44]Nils Kriege, Florian Kurpicz, Petra Mutzel:
On maximum common subgraph problems in series-parallel graphs. Eur. J. Comb. 68: 79-95 (2018) - [c102]Michael Jünger, Petra Mutzel, Christiane Spisla:
Orthogonal Compaction using Additional Bends. VISIGRAPP (3: IVAPP) 2018: 144-155 - [c101]Adalat Jabrayilov, Petra Mutzel:
New Integer Linear Programming Models for the Vertex Coloring Problem. LATIN 2018: 640-652 - [i26]Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert:
Recognizing Cuneiform Signs Using Graph Based Methods. CoRR abs/1802.05908 (2018) - [i25]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. CoRR abs/1803.07515 (2018) - [i24]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) - 2017
- [j43]Julia Sender, Thomas Siwczyk, Petra Mutzel, Uwe Clausen:
Matheuristics for optimizing the network in German wagonload traffic. EURO J. Computational Optimization 5(3): 367-392 (2017) - [j42]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic survivable network design problems: Theory and practice. European Journal of Operational Research 256(2): 333-348 (2017) - [j41]Till Schäfer, Nils 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) - [c100]Till Schäfer, Petra Mutzel:
StruClus: Scalable Structural Graph Set Clustering with Representative Sampling. ADMA 2017: 343-359 - [c99]Christopher Morris, Kristian Kersting, Petra Mutzel:
Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs. ICDM 2017: 327-336 - [c98]Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c97]Andre Droschinsky, Nils Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. SOFSEM 2017: 309-321 - [c96]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 Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. CoRR abs/1708.02772 (2017) - 2016
- [c95]Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden:
Compact Layered Drawings of General Directed Graphs. Graph Drawing 2016: 209-221 - [c94]Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel:
Faster Kernels for Graphs with Continuous Attributes via Hashing. ICDM 2016: 1095-1100 - [c93]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 - [c92]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 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 Kriege, Petra Mutzel:
Finding Largest Common Substructures of Molecules in Quadratic Time. CoRR abs/1610.08739 (2016) - [i10]Therese C. 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) - [c91]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 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 Journal of Experimental Algorithmics 19(1) (2014) - [j37]Nils 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) - [c90]Carsten Gutwenger, Petra Mutzel, Marcus Schaefer:
Practical Experience with Hanani-Tutte for Testing c-Planarity. ALENEX 2014: 86-97 - [c89]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 - [c88]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. Graph Drawing 2014: 25-39 - [c87]Nils Kriege, Marion Neumann, Kristian Kersting, Petra Mutzel:
Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. ICDM 2014: 881-886 - [c86]Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. ISAAC 2014: 81-93 - [c85]Nils Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. IWOCA 2014: 200-212 - [c84]Nils Kriege, Petra Mutzel:
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. MFCS (2) 2014: 505-516 - [c83]Nils 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. Electronic Notes in Discrete Mathematics 41: 245-252 (2013) - [j35]Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Algorithm Engineering im Graphenzeichnen. Informatik Spektrum 36(2): 162-173 (2013) - [c82]Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel:
The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR 2013: 300-315 - [c81]Martin Gronemann, Michael Jünger, Nils Kriege, Petra Mutzel:
MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP 2013: 515-524 - [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) - [c80]Karsten Klein, Nils Kriege, Petra Mutzel:
Scaffold Hunter - Visual Analysis of Chemical Compound Databases. GRAPP/IVAPP 2012: 626-635 - [c79]
- [c78]Denis Kurz, Petra Mutzel, Bernd Zey:
Parameterized Algorithms for Stochastic Steiner Tree Problems. MEMICS 2012: 143-154 - [c77]Karsten Klein, Nils 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 Journal of Experimental 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) - [c76]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 - [c75]Karsten Klein, Nils Kriege, Petra Mutzel:
CT-index: Fingerprint-based graph indexing combining cycles and trees. ICDE 2011: 1115-1126 - [c74]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 Journal of Experimental 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) - [c73]Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel:
An Experimental Evaluation of Multilevel Layout Methods. Graph Drawing 2010: 80-91 - [c72]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. Graph Drawing 2010: 141-152 - [c71]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. Bioinformatics 25(6): 758-764 (2009) - [j26]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on exact crossing minimization using column generation. ACM Journal of Experimental Algorithmics 14 (2009) - [j25]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics 14 (2009) - [c70]Petra Mutzel:
The Crossing Number of Graphs: Theory and Computation. Efficient Algorithms 2009: 305-317 - [c69]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 - [c68]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. Graph Drawing 2009: 94-106 - [c67]Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel:
Port Constraints in Hierarchical Layout of Data Flow Diagrams. Graph Drawing 2009: 135-146 - [c66]Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow:
On Open Problems in Biological Network Visualization. Graph Drawing 2009: 256-267 - [c65]Karsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel:
Scaffold Hunter - Interactive Exploration of Chemical Space. Graph Drawing 2009: 426-427 - [c64]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300 - [c63]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf:
Inserting a vertex into a planar graph. SODA 2009: 375-383 - [r1]
- 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. Discrete Optimization 5(2): 373-388 (2008) - [j23]Petra Mutzel:
Recent Advances in Exact Crossing Minimization (Extended Abstract). Electronic Notes in Discrete Mathematics 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. Integrative Bioinformatics 5(2) (2008) - [c62]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 - [c61]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 - [c60]Markus Chimani, Petra Mutzel, Immanuel M. Bomze:
A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 - [c59]Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
Computing Maximum C-Planar Subgraphs. Graph Drawing 2008: 114-120 - [c58]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. Graph Drawing 2008: 157-168 - [c57]Markus Chimani, Petr Hlinený, Petra Mutzel:
Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434 - [c56]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. Electronic Notes in Discrete Mathematics 28: 177-184 (2007) - [c55]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 - [c54]Markus Chimani, Maria Kandyba, Petra Mutzel:
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. ESA 2007: 681-692 - [c53]Markus Chimani, Petra Mutzel, Jens M. Schmidt:
Efficient Extraction of Multiple Kuratowski Subdivisions. Graph Drawing 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 Journal on Optimization 17(3): 665-687 (2006) - [c52]Carsten Gutwenger, Karsten Klein, Petra Mutzel:
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. Graph Drawing 2006: 126-137 - [c51]Wilhelm Barth, Petra Mutzel, Canan Yildiz:
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. Graph Drawing 2006: 343-354 - [c50]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 - [c49]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) - [c48]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 - [c47]Stefan Hetzl, Petra Mutzel:
A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security 2005: 119-128 - [c46]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization. Graph Drawing 2005: 37-48 - [c45]
- [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. Information Visualization 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) - [c44]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 - [p4]
- [p3]
- [p2]Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
AGD - A Library of Algorithms for Graph Drawing. Graph Drawing Software 2004: 149-172 - [p1]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]