| Publication | Date of Publication | Type |
|---|
| Approximation algorithms for robust clustering problems using local search techniques | 2024-11-12 | Paper |
| A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games | 2024-02-27 | Paper |
| A convergence analysis of the price of anarchy in atomic congestion games | 2023-05-02 | Paper |
| The pathwidth and treewidth of cographs | 2022-12-09 | Paper |
| Selfishness Need Not Be Bad | 2021-06-17 | Paper |
| A constant FPT approximation algorithm for hard-capacitated \(k\)-means | 2021-01-18 | Paper |
| Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques | 2020-12-20 | Paper |
| Ship Traffic Optimization for the Kiel Canal | 2020-10-20 | Paper |
| Computing network tolls with support constraints | 2018-05-23 | Paper |
| Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems | 2018-04-10 | Paper |
| Scheduling jobs with communication delays: Using infeasible solutions for approximation | 2017-12-05 | Paper |
| Strong equilibria in games with the lexicographical improvement property | 2013-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4918387 | 2013-04-24 | Paper |
| D. Ray Fulkerson and project scheduling | 2013-04-17 | Paper |
| Sequencing and scheduling for filling lines in dairy production | 2012-11-30 | Paper |
| Decision support and optimization in shutdown and turnaround scheduling | 2012-07-28 | Paper |
| Solving Project Scheduling Problems by Minimum Cut Computations | 2012-02-19 | Paper |
| Characterizing the existence of potential functions in weighted congestion games | 2011-11-23 | Paper |
| Integrated Sequencing and Scheduling in Coil Coating | 2011-06-09 | Paper |
| Towards More Intelligence in Logistics with Mathematics | 2010-12-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574261 | 2010-07-09 | Paper |
| A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling | 2010-06-22 | Paper |
| The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications | 2009-12-03 | Paper |
| Characterizing the Existence of Potential Functions in Weighted Congestion Games | 2009-12-01 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion | 2009-07-18 | Paper |
| Traffic Networks and Flows over Time | 2009-07-09 | Paper |
| Solutions to Real-World Instances of PSPACE-Complete Stacking | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3525416 | 2008-09-12 | Paper |
| Partitioning graphs to speedup Dijkstra's algorithm | 2008-06-20 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5706101 | 2005-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664814 | 2005-04-08 | Paper |
| Scheduling with AND/OR Precedence Constraints | 2005-02-21 | Paper |
| Approximation in stochastic scheduling | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450519 | 2004-02-15 | Paper |
| On project scheduling with irregular starting time costs | 2004-01-14 | Paper |
| Linear preselective policies for stochastic project scheduling | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542179 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753722 | 2002-01-06 | Paper |
| A computational study on bounding the makespan distribution in stochastic project networks | 2001-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712379 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494463 | 2001-02-09 | Paper |
| Complexity and modeling aspects of mesh refinement into quadrilaterals | 2000-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941833 | 2000-12-05 | Paper |
| Resource-constrained project scheduling: Notation, classification, models, and methods | 2000-06-14 | Paper |
| Semi-order dimension two is a comparability invariant | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952622 | 2000-05-10 | Paper |
| Proper and unit trapezoid orders and graphs | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938774 | 2000-02-23 | Paper |
| Scheduling series--parallel orders subject to 0/1-communication delays | 1999-06-20 | Paper |
| Scheduling series-parallel orders subject to 0/1-communication delays | 1999-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398381 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370208 | 1998-06-04 | Paper |
| Mesh refinement via bidirected flows | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886066 | 1996-10-21 | Paper |
| Triangulating graphs without asteroidal triples | 1996-07-07 | Paper |
| Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels | 1996-01-30 | Paper |
| Treewidth of cocomparability graphs and a new order-theoretic parameter | 1994-11-10 | Paper |
| On the Interplay Between Interval Dimension and Dimension | 1994-10-25 | Paper |
| The Pathwidth and Treewidth of Cographs | 1993-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477966 | 1990-01-01 | Paper |
| An Incremental Linear-Time Algorithm for Recognizing Interval Graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3468865 | 1988-01-01 | Paper |
| Computing the bump number is easy | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792471 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785976 | 1987-01-01 | Paper |
| On some complexity properties of N-free posets and posets with bounded decomposition diameter | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3752396 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686754 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683873 | 1985-01-01 | Paper |
| Stochastic scheduling problems II-set strategies- | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187059 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683903 | 1984-01-01 | Paper |
| Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time | 1984-01-01 | Paper |
| Stochastic scheduling problems I — General strategies | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187058 | 1984-01-01 | Paper |
| Almost all comparability graphs are UPO | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3333094 | 1984-01-01 | Paper |
| A Fast Algorithm for the Decomposition of Graphs and Posets | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3661627 | 1983-01-01 | Paper |
| Scheduling Problems with a Singular Solution | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910305 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916363 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175013 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184625 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082573 | 1974-01-01 | Paper |
