Rolf H. Möhring

Nicole Megow, Rolf H. Möhring, Jens Schulz: Decision Support and Optimization in Shutdown and Turnaround Scheduling. INFORMS Journal on Computing 23(2): 189-204 (2011)

Rolf H. Möhring: Algorithm Engineering and Industrial Applications. it - Information Technology 53(6): 302- (2011)

Wiebke Höhn, Felix G. König, Rolf H. Möhring, Marco E. Lübbecke: Integrated Sequencing and Scheduling in Coil Coating. Management Science 57(4): 647-666 (2011)

Tobias Harks, Max Klimm, Rolf H. Möhring: Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. 49(1): 46-70 (2011)

Torsten J. Gellert, Wiebke Höhn, Rolf H. Möhring: Sequencing and scheduling for filling lines in dairy production. Optimization Letters 5(3): 491-504 (2011)

Rolf H. Möhring, Martin Oellrich: The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table? Algorithms Unplugged 2011: 119-130

Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317

Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis (Eds.): Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Lecture Notes in Computer Science 5868, Springer 2009, isbn 978-3-642-05464-8

Ekkehard Köhler, Rolf H. Möhring, Martin Skutella: Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196

Tobias Harks, Max Klimm, Rolf H. Möhring: Characterizing the Existence of Potential Functions in Weighted Congestion Games. SAGT 2009: 97-108

Tobias Harks, Max Klimm, Rolf H. Möhring: Strong Nash Equilibria in Games with the Lexicographical Improvement Property. WINE 2009: 463-470

Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27

Tobias Harks, Max Klimm, Rolf H. Möhring: Strong Nash Equilibria in Games with the Lexicographical Improvement Property. CoRR abs/0909.0347 (2009)

Rolf H. Möhring: Routing in Graphs with Applications to Material Flow Problems. ALENEX 2008: 64-64

Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs: 08071 Executive Summary -- Scheduling. Scheduling 2008

Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs: 08071 Abstracts Collection -- Scheduling. Scheduling 2008

Rolf H. Möhring, Martin Oellrich: Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?. Taschenbuch der Algorithmen 2008: 127-138

Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs (Eds.): Scheduling, 10.02. - 15.02.2008. Dagstuhl Seminar Proceedings 08071, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008

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

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)

Leo G. Kroon, Rolf H. Möhring (Eds.): 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2005, September 14, 2005, Palma de Mallorca, Spain. OASICS 2, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006

Rolf H. Möhring, Rajeev Raman: Preface. Algorithmica 42(3-4): 199-201 (2005)

Olaf Jahn, Rolf H. Möhring, Andreas S. Schulz, Nicolás E. Stier Moses: System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Operations Research 53(4): 600-616 (2005)

Leo G. Kroon, Rolf H. Möhring: ATMOS Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS 2005

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

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

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

Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling: Acceleration of Shortest Path and Constrained Shortest Path Computation. WEA 2005: 126-138

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

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz (Eds.): Algorithms for Optimization with Incomplete Information, 16.-21. January 2005. Dagstuhl Seminar Proceedings 05031, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005

Rolf H. Möhring, Martin Skutella, Frederik Stork: Scheduling with AND/OR Precedence Constraints. SIAM J. Comput. 33(2): 393-415 (2004)

Christian Liebchen, Rolf H. Möhring: The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond. ATMOS 2004: 3-40

Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, Björn Stenzel: Conflict-free Real-time AGV Routing. OR 2004: 18-24

Ekkehard Köhler, Rolf H. Möhring, Gregor Wünsch: Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. OR 2004: 192-199

Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz: Solving Project Scheduling Problems by Minimum Cut Computations. Management Science 49(3): 330-350 (2003)

Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring: Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA 2003: 123-136

Christian Liebchen, Rolf H. Möhring: A Case Study in Periodic Timetabling. Electr. Notes Theor. Comput. Sci. 66(6): 18-31 (2002)

Rolf H. Möhring, Rajeev Raman (Eds.): Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2461, Springer 2002, isbn 3-540-44180-8

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)

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)

Rolf H. Möhring: Scheduling under Uncertainty: Bounding the Makespan Distribution. Computational Discrete Mathematics 2001: 79-97

Rolf H. Möhring, Matthias Müller-Hannemann: Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. Algorithmica 26(1): 148-171 (2000)

Rolf H. Möhring, Frederik Stork: Linear preselective policies for stochastic project scheduling. Math. Meth. of OR 52(3): 501-515 (2000)

Rolf H. Möhring: Scheduling under uncertainty: Optimizing against a randomizing adversary. APPROX 2000: 15-26

Rolf H. Möhring, Martin Skutella, Frederik Stork: Forcing relations for AND/OR precedence constraints. SODA 2000: 235-236

Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1): 3-41 (1999)

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)

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)

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

Rolf H. Möhring, Andreas S. Schulz, Marc Uetz: Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. RANDOM-APPROX 1999: 144-155

Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza: Scheduling at Villa Vigoni. Discrete Applied Mathematics 72(1-2): 1-3 (1997)

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)

Rolf H. Möhring, Matthias Müller-Hannemann: Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. ISAAC 1997: 263-272

Rolf H. Möhring (Ed.): Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings. Lecture Notes in Computer Science 1335, Springer 1997, isbn 3-540-63757-5

Rolf H. Möhring: Triangulating Graphs Without Asteroidal Triples. Discrete Applied Mathematics 64(3): 281-287 (1996)

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

Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe: Using Network Flows for Surface Modeling. SODA 1995: 350-359

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)

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

Hans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SIAM J. Discrete Math. 6(2): 181-188 (1993)

Michel Habib, David Kelly, Rolf H. Möhring: Interval dimension is a comparability invariant. Discrete Mathematics 88(2-3): 211-229 (1991)

Rolf H. Möhring (Ed.): Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings. Lecture Notes in Computer Science 484, Springer 1991, isbn 3-540-53832-1

Hans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309

Norbert Korte, Rolf H. Möhring: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM J. Comput. 18(1): 68-81 (1989)

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)

Norbert Korte, Rolf H. Möhring: A Simple Linear -TIme Algorithm to Recognize Interval Graphs. WG 1986: 1-16

Rolf H. Möhring: Almost all comparability graphs are UPO. Discrete Mathematics 50: 63-70 (1984)