| Tudataset: A collection of benchmark datasets for learning with graphs C Morris, NM Kriege, F Bause, K Kersting, P Mutzel, M Neumann arXiv preprint arXiv:2007.08663, 2020 | 1275 | 2020 |
| A linear time implementation of SPQR-trees C Gutwenger, P Mutzel International Symposium on Graph Drawing, 77-90, 2000 | 401 | 2000 |
| Subgraph matching kernels for attributed graphs N Kriege, P Mutzel ICML 2012 and arXiv preprint arXiv:1206.6483, 2012 | 398 | 2012 |
| 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms M Jünger, P Mutzel Graph algorithms and applications i, 3-27, 2002 | 354 | 2002 |
| Graph drawing software M Jünger, P Mutzel Springer Science & Business Media, 2012 | 331 | 2012 |
| Benchmark data sets for graph kernels K Kersting, NM Kriege, C Morris, P Mutzel, M Neumann | 324 | 2016 |
| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem I Ljubić, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti Mathematical programming 105 (2), 427-449, 2006 | 310 | 2006 |
| Interactive exploration of chemical space with Scaffold Hunter S Wetzel, K Klein, S Renner, D Rauh, TI Oprea, P Mutzel, H Waldmann Nature chemical biology 5 (8), 581-583, 2009 | 271 | 2009 |
| The Open Graph Drawing Framework (OGDF). M Chimani, C Gutwenger, M Jünger, GW Klau, K Klein, P Mutzel Handbook of graph drawing and visualization 2011, 543-569, 2013 | 251 | 2013 |
| Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings C Morris, G Rattan, P Mutzel Advances in Neural Information Processing Systems 33, 21824-21840, 2020 | 236 | 2020 |
| Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm C De Simone, M Diehl, M Jünger, P Mutzel, G Reinelt, G Rinaldi Journal of Statistical Physics 80 (1), 487-496, 1995 | 231 | 1995 |
| A graph–theoretic approach to steganography S Hetzl, P Mutzel IFIP international conference on communications and multimedia security, 119-128, 2005 | 217 | 2005 |
| The thickness of graphs: a survey P Mutzel, T Odenthal, M Scharbrodt Graphs and combinatorics 14 (1), 59-73, 1998 | 158 | 1998 |
| Inserting an edge into a planar graph C Gutwenger, P Mutzel, R Weiskircher Algorithmica 41 (4), 289-308, 2005 | 150 | 2005 |
| Faster kernels for graphs with continuous attributes via hashing C Morris, NM Kriege, K Kersting, P Mutzel 2016 IEEE 16th International Conference on Data Mining (ICDM), 1095-1100, 2016 | 146 | 2016 |
| On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm K Mehlhorn, P Mutzel Algorithmica 16 (2), 233-242, 1996 | 145 | 1996 |
| Maximum planar subgraphs and nice embeddings: Practical layout tools M Jünger, P Mutzel Algorithmica 16 (1), 33-59, 1996 | 143 | 1996 |
| Retention time alignment algorithms for LC/MS data must consider non-linear shifts K Podwojski, A Fritsch, DC Chamrad, W Paul, B Sitek, K Stühler, P Mutzel, ... Bioinformatics 25 (6), 758-764, 2009 | 136 | 2009 |
| Level planarity testing in linear time M Jünger, S Leipert, P Mutzel International Symposium on Graph Drawing, 224-237, 1998 | 136 | 1998 |
| A new approach for visualizing UML class diagrams C Gutwenger, M Jünger, K Klein, J Kupke, S Leipert, P Mutzel Proceedings of the 2003 ACM symposium on Software visualization, 179-188, 2003 | 134 | 2003 |
Michael JüngerUniversity of CologneVerified email at informatik.uni-koeln.de
