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
[j62]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)- [c134]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 - [c133]Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt:
PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC 2024: 27:1-27:4 - [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 - [i49]Daniel Faber, Adalat Jabrayilov, Petra Mutzel:
SAT Encoding of Partial Ordering Models for Graph Coloring Problems. CoRR abs/2403.15961 (2024) - [i48]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) - [i47]Arne Beines, Michael Kaibel, Philip Mayer, Petra Mutzel, Jonas Sauer:
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. CoRR abs/2410.15920 (2024) - 2023
- [j61]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) - [j60]Md. Saidur Rahman, Petra Mutzel, S. Slamin:
Guest Editors' forewords. J. Graph Algorithms Appl. 27(4): 239-240 (2023) - [j59]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
- [j58]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. J. Comput. Geom. 14(2): 108-171 (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]