The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rolf H. Möhring: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rolf H. Möhring
    Scheduling under Uncertainty: Bounding the Makespan Distribution. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:79-97 [Conf]
  2. Rolf H. Möhring
    Scheduling under uncertainty: Optimizing against a randomizing adversary. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:15-26 [Conf]
  3. Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz
    05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  4. Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz
    05031 Summary-- Algorithms for Optimization with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  5. Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
    Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:76-90 [Conf]
  6. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
    Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:139-150 [Conf]
  7. Rolf H. Möhring, Rudolf Müller, Franz Josef Radermacher
    Advanced DSS for Scheduling: Software Engineering Aspects and the Role of Eigenmodels. [Citation Graph (0, 0)][DBLP]
    HICSS (3), 1994, pp:290-299 [Conf]
  8. Rolf H. Möhring, Matthias Müller-Hannemann
    Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:263-272 [Conf]
  9. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
    Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:144-155 [Conf]
  10. Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
    Using Network Flows for Surface Modeling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:350-359 [Conf]
  11. Rolf H. Möhring, Martin Skutella, Frederik Stork
    Forcing relations for AND/OR precedence constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:235-236 [Conf]
  12. Hans L. Bodlaender, Rolf H. Möhring
    The Pathwidth and Treewidth of Cographs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:301-309 [Conf]
  13. Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring
    Scheduling AND/OR-Networks on Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:123-136 [Conf]
  14. Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling
    Acceleration of Shortest Path and Constrained Shortest Path Computation. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:126-138 [Conf]
  15. Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
    Partitioning Graphs to Speed Up Dijkstra's Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:189-202 [Conf]
  16. Norbert Korte, Rolf H. Möhring
    A Simple Linear -TIme Algorithm to Recognize Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:1-16 [Conf]
  17. Rolf H. Möhring, Matthias Müller-Hannemann
    Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:148-171 [Journal]
  18. Rolf H. Möhring, Rajeev Raman
    Preface. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:199-201 [Journal]
  19. Rolf H. Möhring
    Triangulating Graphs Without Asteroidal Triples. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:3, pp:281-287 [Journal]
  20. Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza
    Scheduling at Villa Vigoni. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:1-3 [Journal]
  21. Christian Liebchen, Rolf H. Möhring
    A Case Study in Periodic Timetabling. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
  22. Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
    Mesh refinement via bidirected flows: modeling, complexity, and computational results. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:395-426 [Journal]
  23. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
    Approximation in stochastic scheduling: the power of LP-based priority policies. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:924-942 [Journal]
  24. Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
    Partitioning graphs to speedup Dijkstra's algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  25. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
    On project scheduling with irregular starting time costs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:4, pp:149-154 [Journal]
  26. Rolf H. Möhring, Markus W. Schäffter
    Scheduling series-parallel orders subject to 0/1-communication delays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:1, pp:23-40 [Journal]
  27. Norbert Korte, Rolf H. Möhring
    An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:68-81 [Journal]
  28. Rolf H. Möhring, Martin Skutella, Frederik Stork
    Scheduling with AND/OR Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:393-415 [Journal]
  29. Hans L. Bodlaender, Rolf H. Möhring
    The Pathwidth and Treewidth of Cographs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:181-188 [Journal]
  30. Stefan Felsner, Michel Habib, Rolf H. Möhring
    On the Interplay Between Interval Dimension and Dimension. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:32-40 [Journal]
  31. Felix G. König, Macro Lübbecke, Rolf Möhring, Guido Schäfer, Ines Spenke
    Solutions to Real-World Instances of PSPACE-Complete Stacking. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:729-740 [Conf]
  32. Michel Habib, Rolf H. Möhring
    On some complexity properties of N-free posets and posets with bounded decomposition diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:157-182 [Journal]
  33. Rolf H. Möhring
    Almost all comparability graphs are UPO. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:63-70 [Journal]
  34. Michel Habib, David Kelly, Rolf H. Möhring
    Interval dimension is a comparability invariant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:211-229 [Journal]

  35. Routing in Graphs with Applications to Material Flow Problems. [Citation Graph (, )][DBLP]


  36. A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. [Citation Graph (, )][DBLP]


  37. 08071 Abstracts Collection -- Scheduling. [Citation Graph (, )][DBLP]


  38. 08071 Executive Summary -- Scheduling. [Citation Graph (, )][DBLP]


  39. Traffic Networks and Flows over Time. [Citation Graph (, )][DBLP]


  40. Strong Nash Equilibria in Games with the Lexicographical Improvement Property. [Citation Graph (, )][DBLP]


  41. ATMOS 2005 Abstracts Collection - Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways. [Citation Graph (, )][DBLP]


  42. The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond. [Citation Graph (, )][DBLP]


  43. ATMOS Preface - Algorithmic Methods and Models for Optimization of Railways. [Citation Graph (, )][DBLP]


  44. Characterizing the Existence of Potential Functions in Weighted Congestion Games. [Citation Graph (, )][DBLP]


  45. Conflict-free Real-time AGV Routing. [Citation Graph (, )][DBLP]


  46. Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. [Citation Graph (, )][DBLP]


  47. Strong Nash Equilibria in Games with the Lexicographical Improvement Property [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.042secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002