Rolf H. Möhring

According to our database1, Rolf H. Möhring authored at least 87 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Selfishness Need Not Be Bad.
Oper. Res., 2021

2020
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
CoRR, 2020

A convergence analysis of the price of anarchy in atomic congestion games.
CoRR, 2020

A sensitivity analysis for the price of anarchy in non-atomic congestion games.
CoRR, 2020

2019
Ship Traffic Optimization for the Kiel Canal.
Oper. Res., 2019

2018
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems.
Theor. Comput. Sci., 2018

Selfishness need not be bad: a general proof.
CoRR, 2018

2017
Stochastic Runtime Analysis of the Cross-Entropy Algorithm.
IEEE Trans. Evol. Comput., 2017

Selfishness need not be bad.
CoRR, 2017

2016
Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

2015
Computing network tolls with support constraints.
Networks, 2015

2013
Strong equilibria in games with the lexicographical improvement property.
Int. J. Game Theory, 2013

2012
Conflict-free vehicle routing.
EURO J. Transp. Logist., 2012

2011
Sequencing and scheduling for filling lines in dairy production.
Optim. Lett., 2011

Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory Comput. Syst., 2011

Integrated Sequencing and Scheduling in Coil Coating.
Manag. Sci., 2011

Algorithm Engineering and Industrial Applications.
it Inf. Technol., 2011

Decision Support and Optimization in Shutdown and Turnaround Scheduling.
INFORMS J. Comput., 2011

The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table?
Proceedings of the Algorithms Unplugged, 2011

2010
10071 Executive Summary - Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

10071 Abstracts Collection - Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

2009
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Traffic Networks and Flows over Time.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Sequencing and Scheduling in Coil Coating with Shuttles.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

09261 Executive Summary - Models and Algorithms for Optimization in Logistics.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

09261 Abstracts Collection - Models and Algorithms for Optimization in Logistics.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008
Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?.
Proceedings of the Taschenbuch der Algorithmen, 2008

08071 Abstracts Collection -- Scheduling.
Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008

08071 Executive Summary -- Scheduling.
Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008

Routing in Graphs with Applications to Material Flow Problems.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
Solutions to Real-World Instances of PSPACE-Complete Stacking.
Proceedings of the Algorithms, 2007

2006
Partitioning graphs to speedup Dijkstra's algorithm.
ACM J. Exp. Algorithmics, 2006

Fast Point-to-Point Shortest Path Computations with Arc-Flags.
Proceedings of the Shortest Path Problem, 2006

2005
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
Oper. Res., 2005

Preface.
Algorithmica, 2005

Partitioning Graphs to Speed Up Dijkstra's Algorithm.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Acceleration of Shortest Path and Constrained Shortest Path Computation.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

05031 Summary-- Algorithms for Optimization with Incomplete Information.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

ATMOS 2005 Abstracts Collection - Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

ATMOS Preface - Algorithmic Methods and Models for Optimization of Railways.
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

2004
Scheduling with AND/OR Precedence Constraints.
SIAM J. Comput., 2004

Conflict-free Real-time AGV Routing.
Proceedings of the Operations Research, 2004

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.
Proceedings of the Operations Research, 2004

The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003
Solving Project Scheduling Problems by Minimum Cut Computations.
Manag. Sci., 2003

Scheduling AND/OR-Networks on Identical Parallel Machines.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002
A Case Study in Periodic Timetabling.
Electron. Notes Theor. Comput. Sci., 2002

2001
On project scheduling with irregular starting time costs.
Oper. Res. Lett., 2001

A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks.
Ann. Oper. Res., 2001

Scheduling under Uncertainty: Bounding the Makespan Distribution.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000
Linear preselective policies for stochastic project scheduling.
Math. Methods Oper. Res., 2000

Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.
Algorithmica, 2000

Forcing relations for AND/OR precedence constraints.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Scheduling under uncertainty: Optimizing against a randomizing adversary.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Scheduling series-parallel orders subject to 0/1-communication delays.
Parallel Comput., 1999

Approximation in stochastic scheduling: the power of LP-based priority policies.
J. ACM, 1999

Resource-constrained project scheduling: Notation, classification, models, and methods.
Eur. J. Oper. Res., 1999

Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
Proceedings of the Randomization, 1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999

Verteilte Verbindungssuche im öffentlichen Personenverkehr Graphentheoretische Modelle und Algorithmen.
Proceedings of the Angewandte Mathematik, 1999

1997
Mesh refinement via bidirected flows: modeling, complexity, and computational results.
J. ACM, 1997

Scheduling at Villa Vigoni.
Discret. Appl. Math., 1997

Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Triangulating Graphs Without Asteroidal Triples.
Discret. Appl. Math., 1996

Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).
Proceedings of the Algorithms, 1996

1995
Advanced DSS for scheduling: software engineering aspects and the role of Eigenmodels.
Ann. Oper. Res., 1995

Editorial.
Ann. Oper. Res., 1995

Using Network Flows for Surface Modeling.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
On the Interplay Between Interval Dimension and Dimension.
SIAM J. Discret. Math., 1994

1993
The Pathwidth and Treewidth of Cographs.
SIAM J. Discret. Math., 1993

1991
Interval dimension is a comparability invariant.
Discret. Math., 1991

1989
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs.
SIAM J. Comput., 1989

Design aspects of an advanced model-oriented DSS for scheduling problems in civil engineering.
Decis. Support Syst., 1989

1988
Design aspects of advanced decision support systems.
Decis. Support Syst., 1988

1987
On some complexity properties of N-free posets and posets with bounded decomposition diameter.
Discret. Math., 1987

1986
Book reviews.
Z. Oper. Research, 1986

A Simple Linear -TIme Algorithm to Recognize Interval Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985
Stochastic scheduling problems II-set strategies-.
Z. Oper. Research, 1985

1984
Stochastic scheduling problems I - General strategies.
Z. Oper. Research, 1984

Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time.
Oper. Res., 1984

Almost all comparability graphs are UPO.
Discret. Math., 1984

1983
A Fast Algorithm for the Decomposition of Graphs and Posets.
Math. Oper. Res., 1983

Book reviews.
Z. Oper. Research, 1983

Book reviews.
Z. Oper. Research, 1983


  Loading...