Rolf H. Möhring

From MaRDI portal
Person:207372

Available identifiers

zbMath Open mohring.rolf-hWikidataQ102105492 ScholiaQ102105492MaRDI QIDQ207372

List of research outcomes

PublicationDate of PublicationType
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games2024-02-27Paper
A convergence analysis of the price of anarchy in atomic congestion games2023-05-02Paper
The pathwidth and treewidth of cographs2022-12-09Paper
Selfishness Need Not Be Bad2021-06-17Paper
A constant FPT approximation algorithm for hard-capacitated \(k\)-means2021-01-18Paper
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques2020-12-20Paper
Ship Traffic Optimization for the Kiel Canal2020-10-20Paper
Computing network tolls with support constraints2018-05-23Paper
Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems2018-04-10Paper
Scheduling jobs with communication delays: Using infeasible solutions for approximation2017-12-05Paper
Strong equilibria in games with the lexicographical improvement property2013-06-26Paper
https://portal.mardi4nfdi.de/entity/Q49183872013-04-24Paper
D. Ray Fulkerson and project scheduling2013-04-17Paper
Sequencing and scheduling for filling lines in dairy production2012-11-30Paper
Decision Support and Optimization in Shutdown and Turnaround Scheduling2012-07-28Paper
Solving Project Scheduling Problems by Minimum Cut Computations2012-02-19Paper
Characterizing the existence of potential functions in weighted congestion games2011-11-23Paper
Integrated Sequencing and Scheduling in Coil Coating2011-06-09Paper
Towards More Intelligence in Logistics with Mathematics2010-12-28Paper
https://portal.mardi4nfdi.de/entity/Q35742612010-07-09Paper
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling2010-06-22Paper
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications2009-12-03Paper
Characterizing the Existence of Potential Functions in Weighted Congestion Games2009-12-01Paper
Approximation and Online Algorithms2009-08-11Paper
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion2009-07-18Paper
Traffic Networks and Flows over Time2009-07-09Paper
Solutions to Real-World Instances of PSPACE-Complete Stacking2008-09-25Paper
https://portal.mardi4nfdi.de/entity/Q35254162008-09-12Paper
Partitioning graphs to speedup Dijkstra's algorithm2008-06-20Paper
Experimental and Efficient Algorithms2005-11-30Paper
Experimental and Efficient Algorithms2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q57061012005-11-04Paper
https://portal.mardi4nfdi.de/entity/Q46648142005-04-08Paper
Scheduling with AND/OR Precedence Constraints2005-02-21Paper
Approximation in stochastic scheduling2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q44505192004-02-15Paper
On project scheduling with irregular starting time costs2004-01-14Paper
Linear preselective policies for stochastic project scheduling2003-08-18Paper
https://portal.mardi4nfdi.de/entity/Q45421792002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27537222002-01-06Paper
A computational study on bounding the makespan distribution in stochastic project networks2001-10-31Paper
https://portal.mardi4nfdi.de/entity/Q27123792001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q44944632001-02-09Paper
Complexity and modeling aspects of mesh refinement into quadrilaterals2000-12-05Paper
https://portal.mardi4nfdi.de/entity/Q49418332000-12-05Paper
Resource-constrained project scheduling: Notation, classification, models, and methods2000-06-14Paper
Semi-order dimension two is a comparability invariant2000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49526222000-05-10Paper
Proper and unit trapezoid orders and graphs2000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49387742000-02-23Paper
Scheduling series--parallel orders subject to 0/1-communication delays1999-06-20Paper
Scheduling series-parallel orders subject to 0/1-communication delays1999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43983811998-07-19Paper
https://portal.mardi4nfdi.de/entity/Q43702081998-06-04Paper
Mesh refinement via bidirected flows1998-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48860661996-10-21Paper
Triangulating graphs without asteroidal triples1996-07-07Paper
Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels1996-01-30Paper
Treewidth of cocomparability graphs and a new order-theoretic parameter1994-11-10Paper
On the Interplay Between Interval Dimension and Dimension1994-10-25Paper
The Pathwidth and Treewidth of Cographs1993-07-21Paper
https://portal.mardi4nfdi.de/entity/Q34779661990-01-01Paper
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs1989-01-01Paper
Computing the bump number is easy1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34688651988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37924711988-01-01Paper
On some complexity properties of N-free posets and posets with bounded decomposition diameter1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859761987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37523961986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36838731985-01-01Paper
Stochastic scheduling problems II-set strategies-1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867541985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51870591985-01-01Paper
Almost all comparability graphs are UPO1984-01-01Paper
Stochastic scheduling problems I — General strategies1984-01-01Paper
Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33330941984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36839031984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51870581984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36616271983-01-01Paper
A Fast Algorithm for the Decomposition of Graphs and Posets1983-01-01Paper
Scheduling Problems with a Singular Solution1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39103051981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39163631981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41750131977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41846251977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40825731974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rolf H. Möhring