The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Petra Mutzel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
    Solving the Prize-Collecting Steiner Tree Problem to Optimality. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:68-76 [Conf]
  2. Stefan Hetzl, Petra Mutzel
    A Graph-Theoretic Approach to Steganography. [Citation Graph (0, 0)][DBLP]
    Communications and Multimedia Security, 2005, pp:119-128 [Conf]
  3. Gunnar W. Klau, Petra Mutzel
    Optimal Labelling of Point Features in the Slider Model. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:340-350 [Conf]
  4. Petra Mutzel, René Weiskircher
    Computing Optimal Embeddings for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:95-104 [Conf]
  5. Petra Mutzel, René Weiskircher
    Bend Minimization in Orthogonal Drawings Using Integer Programming. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:484-493 [Conf]
  6. Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel
    Graph Drawing Algorithm Engineering with AGD. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:307-323 [Conf]
  7. Michael Jünger, Petra Mutzel, Stephen G. Kobourov
    05191 Abstracts Collection - Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:- [Conf]
  8. Michael Jünger, Stephen G. Kobourov, Petra Mutzel
    05191 Executive Summary - Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:- [Conf]
  9. Petra Mutzel, Peter Eades
    Graphs in Software Visualization - Introduction. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:285-294 [Conf]
  10. Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher
    The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:691-702 [Conf]
  11. Petra Mutzel
    A Polyhedral Approach to Planar Augmentation and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:494-507 [Conf]
  12. Wilhelm Barth, Michael Jünger, Petra Mutzel
    Simple and Efficient Bilayer Cross Counting. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:130-141 [Conf]
  13. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
    Selected Open Problems in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:515-539 [Conf]
  14. Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:400-409 [Conf]
  15. Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
    Exact Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:37-48 [Conf]
  16. Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:423-435 [Conf]
  17. Wilhelm Barth, Petra Mutzel, Canan Yildiz
    A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:343-354 [Conf]
  18. Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
    Caesar Automatic Layout of UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:461-462 [Conf]
  19. Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher
    AGD: A Library of Algorithms for Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:473-474 [Conf]
  20. Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
    Advances in C-Planarity Testing of Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:220-235 [Conf]
  21. Carsten Gutwenger, Petra Mutzel
    A Linear Time Implementation of SPQR-Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:77-90 [Conf]
  22. Carsten Gutwenger, Petra Mutzel
    An Experimental Study of Crossing Minimization Heuristics. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:13-24 [Conf]
  23. Carsten Gutwenger, Petra Mutzel
    Graph Embedding with Minimum Depth and Maximum External Face. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:259-272 [Conf]
  24. Carsten Gutwenger, Petra Mutzel
    Planar Polyline Drawings with Good Angular Resolution. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:167-182 [Conf]
  25. Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome
    ArchE: A Graph Drawing System for Archaeology. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:297-302 [Conf]
  26. Michael Jünger, Sebastian Leipert, Petra Mutzel
    Pitfalls of Using PQ-Trees in Automatic Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:193-204 [Conf]
  27. Michael Jünger, Sebastian Leipert, Petra Mutzel
    Level Planarity Testing in Linear Time. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:224-237 [Conf]
  28. Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
    A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:13-24 [Conf]
  29. Michael Jünger, Petra Mutzel
    The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:119-130 [Conf]
  30. Michael Jünger, Petra Mutzel
    Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:337-348 [Conf]
  31. Gunnar W. Klau, Karsten Klein, Petra Mutzel
    An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:37-51 [Conf]
  32. Gunnar W. Klau, Petra Mutzel
    Combining Graph Labeling and Compaction. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:27-37 [Conf]
  33. Petra Mutzel
    An Alternative Method to Crossing Minimization on Hierarchical Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:318-333 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:456-457 [Conf]
  35. Petra Mutzel, Thomas Ziegler
    The Constrained Crossing Minimization Problem. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:175-185 [Conf]
  36. Carsten Gutwenger, Karsten Klein, Petra Mutzel
    Planarity Testing and Optimal Edge Insertion with Embedding Constraints. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:126-137 [Conf]
  37. 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. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1304-1315 [Conf]
  38. 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. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1997, pp:58-67 [Conf]
  39. Petra Mutzel, René Weiskircher
    Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:199-206 [Conf]
  40. Petra Mutzel
    The SPQR-Tree Data Structure in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:34-46 [Conf]
  41. Michael Jünger, Petra Mutzel
    Solving the maximum weight planar subgraph. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:479-492 [Conf]
  42. Gunnar W. Klau, Petra Mutzel
    Optimal Compaction of Orthogonal Grid Drawings. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:304-319 [Conf]
  43. Petra Mutzel, René Weiskircher
    Optimizing over All Combinatorial Embeddings of a Planar Graph. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:361-376 [Conf]
  44. Petra Mutzel, René Weiskircher
    Two-Layer Planarization in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:69-78 [Conf]
  45. Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
    A branch-and-cut approach to physical mapping with end-probes. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:84-92 [Conf]
  46. Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:241-250 [Conf]
  47. Sergej Fialko, Petra Mutzel
    A New Approximation Algorithm for the Planar Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:260-269 [Conf]
  48. Carsten Gutwenger, Petra Mutzel, René Weiskircher
    Inserting an edge into a planar graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:246-255 [Conf]
  49. Petra Mutzel
    Recent Advances in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:41- [Conf]
  50. Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
    A New Approach for Visualizing UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2003, pp:179-188 [Conf]
  51. Markus Chimani, Carsten Gutwenger, Petra Mutzel
    Experiments on Exact Crossing Minimization Using Column Generation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:303-315 [Conf]
  52. Therese C. Biedl, Michael Kaufmann, Petra Mutzel
    Drawing Planar Partitions II: HH-Drawings. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:124-136 [Conf]
  53. Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
    Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:261-272 [Conf]
  54. Carsten Gutwenger, Petra Mutzel, René Weiskircher
    Inserting an Edge into a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:289-308 [Journal]
  55. Michael Jünger, Petra Mutzel
    Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:33-59 [Journal]
  56. Kurt Mehlhorn, Petra Mutzel
    On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:233-242 [Journal]
  57. John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron
    A polyhedral approach to sequence alignment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:143-186 [Journal]
  58. Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel
    Algorithmen zum automatischen Zeichnen von Graphen. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1997, v:20, n:4, pp:199-207 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    Information Visualization, 2004, v:3, n:3, pp:189-208 [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:4, pp:433-448 [Journal]
  61. Wilhelm Barth, Petra Mutzel, Michael Jünger
    Simple and Efficient Bilayer Cross Counting. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:179-194 [Journal]
  62. Giuseppe Di Battista, Petra Mutzel
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:1-2 [Journal]
  63. Petra Mutzel, Michael Jünger
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:307-309 [Journal]
  64. Michael Jünger, Petra Mutzel
    2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1997, v:1, n:, pp:- [Journal]
  65. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:427-449 [Journal]
  66. Michael Jünger, Sebastian Leipert, Petra Mutzel
    A note on computing a maximal planar subgraph using PQ-trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1998, v:17, n:7, pp:609-612 [Journal]
  67. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]
  68. Markus Chimani, Maria Kandyba, Petra Mutzel
    A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:681-692 [Conf]
  69. Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
    The thickness of a minor-excluded class of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:169-176 [Journal]

  70. Obtaining Optimal k-Cardinality Trees Fast. [Citation Graph (, )][DBLP]


  71. The Crossing Number of Graphs: Theory and Computation. [Citation Graph (, )][DBLP]


  72. On the Hardness and Approximability of Planar Biconnectivity Augmentation. [Citation Graph (, )][DBLP]


  73. A New Approach to Exact Crossing Minimization. [Citation Graph (, )][DBLP]


  74. On Open Problems in Biological Network Visualization. [Citation Graph (, )][DBLP]


  75. An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]


  76. Computing Maximum C-Planar Subgraphs. [Citation Graph (, )][DBLP]


  77. Approximating the Crossing Number of Apex Graphs. [Citation Graph (, )][DBLP]


  78. Port Constraints in Hierarchical Layout of Data Flow Diagrams. [Citation Graph (, )][DBLP]


  79. Efficient Extraction of Multiple Kuratowski Subdivisions. [Citation Graph (, )][DBLP]


  80. Scaffold Hunter - Interactive Exploration of Chemical Space. [Citation Graph (, )][DBLP]


  81. Upward Planarization Layout. [Citation Graph (, )][DBLP]


  82. Inserting a vertex into a planar graph. [Citation Graph (, )][DBLP]


  83. Layer-Free Upward Crossing Minimization. [Citation Graph (, )][DBLP]


  84. Strong Formulations for 2-Node-Connected Steiner Network Problems. [Citation Graph (, )][DBLP]


  85. A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. [Citation Graph (, )][DBLP]


  86. Planar Biconnectivity Augmentation with Fixed Embedding. [Citation Graph (, )][DBLP]


  87. Retention time alignment algorithms for LC/MS data must consider non-linear shifts. [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002