| 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, 427-449, 2006 | 298 | 2006 |
| Inserting an edge into a planar graph C Gutwenger, P Mutzel, R Weiskircher Algorithmica 41, 289-308, 2005 | 145 | 2005 |
| Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem GW Klau, I Ljubić, A Moser, P Mutzel, P Neuner, U Pferschy, G Raidl, ... Genetic and Evolutionary Computation Conference, 1304-1315, 2004 | 97 | 2004 |
| Advances in C-Planarity Testing of Clustered Graphs: C Gutwenger, M Jünger, S Leipert, P Mutzel, M Percan, R Weiskircher Graph Drawing: 10th International Symposium, GD 2002 Irvine, CA, USA, August …, 2002 | 89 | 2002 |
| Robustness and resilience GW Klau, R Weiskircher Network analysis: Methodological foundations, 417-437, 2005 | 86 | 2005 |
| Solving the prize-collecting Steiner tree problem to optimality I Ljubic, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti ALENEX/ANALCO 2005, 68-76, 2005 | 57 | 2005 |
| A branch-and-cut approach to the crossing number problem C Buchheim, M Chimani, D Ebner, C Gutwenger, M Jünger, GW Klau, ... Discrete Optimization 5 (2), 373-388, 2008 | 54 | 2008 |
| Exact crossing minimization C Buchheim, D Ebner, M Jünger, GW Klau, P Mutzel, R Weiskircher Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland …, 2006 | 38 | 2006 |
| Two-layer planarization in graph drawing P Mutzel, R Weiskircher Algorithms and Computation: 9th International Symposium, ISAAC’98 Taejon …, 1998 | 34 | 1998 |
| The fractional prize-collecting Steiner tree problem on trees GW Klau, I Ljubić, P Mutzel, U Pferschy, R Weiskircher Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary …, 2003 | 32 | 2003 |
| Optimizing over all combinatorial embeddings of a planar graph P Mutzel, R Weiskircher International Conference on Integer Programming and Combinatorial …, 1999 | 30 | 1999 |
| Force-based label number maximization D Ebner, GW Klau, R Weiskircher Institute of Computer Graphics and Algorithms, Vienna University of …, 2003 | 24 | 2003 |
| A multi-agent system for decentralised fractional shared resource constraint scheduling G Singh, R Weiskircher Web Intelligence and Agent Systems 9 (2), 99-108, 2011 | 22 | 2011 |
| New applications of SPQR-trees in graph drawing R Weiskircher | 22 | 2002 |
| Drawing planar graphs R Weiskircher Drawing Graphs: Methods and Models, 23-45, 2001 | 22 | 2001 |
| Label number maximization in the slider model D Ebner, GW Klau, R Weiskircher Graph Drawing: 12th International Symposium, GD 2004, New York, NY, USA …, 2005 | 19 | 2005 |
| Computing optimal embeddings for planar graphs P Mutzel, R Weiskircher International Computing and Combinatorics Conference, 95-104, 2000 | 18 | 2000 |
| Collaborative resource constraint scheduling with a fractional shared resource G Singh, R Weiskircher 2008 IEEE/WIC/ACM International Conference on Web Intelligence and …, 2008 | 15 | 2008 |
| Subgraph induced planar connectivity augmentation C Gutwenger, M Jünger, S Leipert, P Mutzel, M Percan, R Weiskircher International Workshop on Graph-Theoretic Concepts in Computer Science, 261-272, 2003 | 12 | 2003 |
| AGD: A library of algorithms for graph drawing C Gutwenger, M Jünger, GW Klau, S Leipert, P Mutzel, R Weiskircher International Symposium on Graph Drawing, 473-474, 2001 | 12 | 2001 |