| 2008 |
|---|
| 50 | | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
Scheduling, 10.02. - 15.02.2008
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 49 | EE | Rolf H. Möhring:
Routing in Graphs with Applications to Material Flow Problems.
ALENEX 2008: 64-64 |
| 48 | EE | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
08071 Abstracts Collection -- Scheduling.
Scheduling 2008 |
| 47 | EE | Jane W.-S. Liu,
Rolf H. Möhring,
Kirk Pruhs:
08071 Executive Summary -- Scheduling.
Scheduling 2008 |
| 46 | EE | Rolf H. Möhring,
Martin Oellrich:
Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?.
Taschenbuch der Algorithmen 2008: 127-138 |
| 2007 |
|---|
| 45 | EE | Felix G. König,
Marco E. Lübbecke,
Rolf H. Möhring,
Guido Schäfer,
Ines Spenke:
Solutions to Real-World Instances of PSPACE-Complete Stacking.
ESA 2007: 729-740 |
| 2006 |
|---|
| 44 | | Leo G. Kroon,
Rolf H. Möhring:
5th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2005, September 14, 2005, Palma de Mallorca, Spain
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 43 | EE | Rolf H. Möhring,
Heiko Schilling,
Birk Schütz,
Dorothea Wagner,
Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm.
ACM Journal of Experimental Algorithmics 11: (2006) |
| 2005 |
|---|
| 42 | | Susanne Albers,
Rolf H. Möhring,
Georg Ch. Pflug,
Rüdiger Schultz:
Algorithms for Optimization with Incomplete Information, 16.-21. January 2005
IBFI, Schloss Dagstuhl, Germany 2005 |
| 41 | EE | Leo G. Kroon,
Rolf H. Möhring:
ATMOS 2005 Abstracts Collection - Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
ATMOS 2005 |
| 40 | EE | Leo G. Kroon,
Rolf H. Möhring:
ATMOS Preface - Algorithmic Methods and Models for Optimization of Railways.
ATMOS 2005 |
| 39 | EE | Susanne Albers,
Rolf H. Möhring,
Georg Ch. Pflug,
Rüdiger Schultz:
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information.
Algorithms for Optimization with Incomplete Information 2005 |
| 38 | EE | Susanne Albers,
Rolf H. Möhring,
Georg Ch. Pflug,
Rüdiger Schultz:
05031 Summary-- Algorithms for Optimization with Incomplete Information.
Algorithms for Optimization with Incomplete Information 2005 |
| 37 | EE | Ekkehard Köhler,
Rolf H. Möhring,
Heiko Schilling:
Acceleration of Shortest Path and Constrained Shortest Path Computation.
WEA 2005: 126-138 |
| 36 | EE | Rolf H. Möhring,
Heiko Schilling,
Birk Schütz,
Dorothea Wagner,
Thomas Willhalm:
Partitioning Graphs to Speed Up Dijkstra's Algorithm.
WEA 2005: 189-202 |
| 35 | EE | Rolf H. Möhring,
Rajeev Raman:
Preface.
Algorithmica 42(3-4): 199-201 (2005) |
| 2004 |
|---|
| 34 | EE | Christian Liebchen,
Rolf H. Möhring:
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond.
ATMOS 2004: 3-40 |
| 33 | EE | Rolf H. Möhring,
Ekkehard Köhler,
Ewgenij Gawrilow,
Björn Stenzel:
Conflict-free Real-time AGV Routing.
OR 2004: 18-24 |
| 32 | EE | Ekkehard Köhler,
Rolf H. Möhring,
Gregor Wünsch:
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.
OR 2004: 192-199 |
| 31 | EE | Rolf H. Möhring,
Martin Skutella,
Frederik Stork:
Scheduling with AND/OR Precedence Constraints.
SIAM J. Comput. 33(2): 393-415 (2004) |
| 2003 |
|---|
| 30 | EE | Thomas Erlebach,
Vanessa Kääb,
Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines.
WAOA 2003: 123-136 |
| 2002 |
|---|
| 29 | | Rolf H. Möhring,
Rajeev Raman:
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings
Springer 2002 |
| 28 | EE | Christian Liebchen,
Rolf H. Möhring:
A Case Study in Periodic Timetabling.
Electr. Notes Theor. Comput. Sci. 66(6): (2002) |
| 2001 |
|---|
| 27 | EE | Rolf H. Möhring:
Scheduling under Uncertainty: Bounding the Makespan Distribution.
Computational Discrete Mathematics 2001: 79-97 |
| 26 | EE | Arfst Ludwig,
Rolf H. Möhring,
Frederik Stork:
A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks.
Annals OR 102(1-4): 49-64 (2001) |
| 25 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Frederik Stork,
Marc Uetz:
On project scheduling with irregular starting time costs.
Oper. Res. Lett. 28(4): 149-154 (2001) |
| 2000 |
|---|
| 24 | EE | Rolf H. Möhring:
Scheduling under uncertainty: Optimizing against a randomizing adversary.
APPROX 2000: 15-26 |
| 23 | EE | Rolf H. Möhring,
Martin Skutella,
Frederik Stork:
Forcing relations for AND/OR precedence constraints.
SODA 2000: 235-236 |
| 22 | EE | Rolf H. Möhring,
Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.
Algorithmica 26(1): 148-171 (2000) |
| 1999 |
|---|
| 21 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Frederik Stork,
Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
ESA 1999: 139-150 |
| 20 | | Rolf H. Möhring,
Andreas S. Schulz,
Marc Uetz:
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
RANDOM-APPROX 1999: 144-155 |
| 19 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Marc Uetz:
Approximation in stochastic scheduling: the power of LP-based priority policies.
J. ACM 46(6): 924-942 (1999) |
| 18 | | Rolf H. Möhring,
Markus W. Schäffter:
Scheduling series-parallel orders subject to 0/1-communication delays.
Parallel Computing 25(1): 23-40 (1999) |
| 1997 |
|---|
| 17 | | Rolf H. Möhring:
Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings
Springer 1997 |
| 16 | | Rolf H. Möhring,
Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals.
ISAAC 1997: 263-272 |
| 15 | EE | Rolf H. Möhring,
Franz Josef Radermacher,
Maria Grazia Speranza:
Scheduling at Villa Vigoni.
Discrete Applied Mathematics 72(1-2): 1-3 (1997) |
| 14 | EE | Rolf H. Möhring,
Matthias Müller-Hannemann,
Karsten Weihe:
Mesh refinement via bidirected flows: modeling, complexity, and computational results.
J. ACM 44(3): 395-426 (1997) |
| 1996 |
|---|
| 13 | | Rolf H. Möhring,
Markus W. Schäffter,
Andreas S. Schulz:
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).
ESA 1996: 76-90 |
| 12 | EE | Rolf H. Möhring:
Triangulating Graphs Without Asteroidal Triples.
Discrete Applied Mathematics 64(3): 281-287 (1996) |
| 1995 |
|---|
| 11 | | Rolf H. Möhring,
Matthias Müller-Hannemann,
Karsten Weihe:
Using Network Flows for Surface Modeling.
SODA 1995: 350-359 |
| 1994 |
|---|
| 10 | | Rolf H. Möhring,
Rudolf Müller,
Franz Josef Radermacher:
Advanced DSS for Scheduling: Software Engineering Aspects and the Role of Eigenmodels.
HICSS (3) 1994: 290-299 |
| 9 | EE | Stefan Felsner,
Michel Habib,
Rolf H. Möhring:
On the Interplay Between Interval Dimension and Dimension.
SIAM J. Discrete Math. 7(1): 32-40 (1994) |
| 1993 |
|---|
| 8 | | Hans L. Bodlaender,
Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs.
SIAM J. Discrete Math. 6(2): 181-188 (1993) |
| 1991 |
|---|
| 7 | | Rolf H. Möhring:
Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings
Springer 1991 |
| 6 | EE | Michel Habib,
David Kelly,
Rolf H. Möhring:
Interval dimension is a comparability invariant.
Discrete Mathematics 88(2-3): 211-229 (1991) |
| 1990 |
|---|
| 5 | | Hans L. Bodlaender,
Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs.
SWAT 1990: 301-309 |
| 1989 |
|---|
| 4 | | Norbert Korte,
Rolf H. Möhring:
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs.
SIAM J. Comput. 18(1): 68-81 (1989) |
| 1987 |
|---|
| 3 | EE | Michel Habib,
Rolf H. Möhring:
On some complexity properties of N-free posets and posets with bounded decomposition diameter.
Discrete Mathematics 63(2-3): 157-182 (1987) |
| 1986 |
|---|
| 2 | | Norbert Korte,
Rolf H. Möhring:
A Simple Linear -TIme Algorithm to Recognize Interval Graphs.
WG 1986: 1-16 |
| 1984 |
|---|
| 1 | EE | Rolf H. Möhring:
Almost all comparability graphs are UPO.
Discrete Mathematics 50: 63-70 (1984) |
