| Publication | Date of Publication | Type |
|---|
| On approximating partial scenario set cover | 2024-12-12 | Paper |
| A bicriteria almost equal minimum cost flow model for day-ahead trading | 2024-09-17 | Paper |
| On the mixed connectivity conjecture of Beineke and Harary | 2024-09-03 | Paper |
| Modifying networks to obtain low cost trees | 2024-06-05 | Paper |
| Algorithms and complexity for the almost equal maximum flow problem | 2024-05-17 | Paper |
| Complexity and approximability of certain bicriteria location problems | 2024-02-28 | Paper |
| Almost disjoint paths and separating by forbidden pairs | 2024-02-23 | Paper |
| Compact location problems with budget and communication constraints | 2023-12-12 | Paper |
| Robust flows with adaptive mitigation | 2023-07-12 | Paper |
| 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem | 2022-12-12 | Paper |
| Towards obtaining a 3-decomposition from a perfect matching | 2022-11-08 | Paper |
| Online algorithms to schedule a proportionate flexible flow shop of batching machines | 2022-11-04 | Paper |
| Simultaneously dominating all spanning trees of a graph | 2022-06-14 | Paper |
| The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs | 2021-08-30 | Paper |
| Algorithms and complexity for the almost equal maximum flow problem | 2021-08-30 | Paper |
| Robust single machine makespan scheduling with release date uncertainty | 2021-04-07 | Paper |
| Scheduling a proportionate flow shop of batching machines | 2020-12-11 | Paper |
| On the Bicriterion Maximum Flow Network Interdiction Problem | 2020-10-06 | Paper |
| Towards obtaining a 3-Decomposition from a perfect Matching | 2020-08-21 | Paper |
| Robust Single Machine Makespan Scheduling with Release Date Uncertainty | 2020-07-27 | Paper |
| Robust absolute single machine makespan scheduling-location problem on trees | 2020-02-11 | Paper |
| An FPTAS for the knapsack problem with parametric weights | 2020-02-10 | Paper |
| On the Mixed Connectivity Conjecture of Beineke and Harary | 2019-08-30 | Paper |
| Full implementation of social choice functions in dominant strategies | 2019-06-24 | Paper |
| Robust multicovers with budgeted uncertainty | 2019-01-09 | Paper |
| Improving spanning trees by upgrading nodes | 2018-07-04 | Paper |
| A network simplex method for the budget-constrained minimum cost flow problem | 2018-05-25 | Paper |
| Robust bottleneck routing games | 2018-05-23 | Paper |
| Capacitated network design games with weighted players | 2018-05-23 | Paper |
| A generalized approximation framework for fractional network flow and packing problems | 2018-02-09 | Paper |
| Maximum flows in generalized processing networks | 2017-08-03 | Paper |
| On the complexity and approximability of budget-constrained minimum cost flows | 2017-06-30 | Paper |
| An FPTAS for the parametric knapsack problem | 2017-06-30 | Paper |
| Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four | 2017-01-19 | Paper |
| On the online min-wait relocation problem | 2016-10-17 | Paper |
| The Canadian tour operator problem on paths: tight bounds and resource augmentation | 2016-10-12 | Paper |
| Computation of equilibria and the price of anarchy in bottleneck congestion games | 2016-06-30 | Paper |
| Robust optimization for routing problems on trees | 2016-06-30 | Paper |
| Budget-constrained minimum cost flows | 2016-05-11 | Paper |
| The generalized assignment problem with minimum quantities | 2016-03-15 | Paper |
| Static and dynamic source locations in undirected networks | 2015-11-06 | Paper |
| Rejoinder on: ``Static and dynamic source locations in undirected networks | 2015-11-06 | Paper |
| Convex generalized flows | 2015-07-06 | Paper |
| Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load | 2015-06-24 | Paper |
| Generalized max flow in series-parallel graphs | 2014-04-15 | Paper |
| Minimum cost flows with minimum quantities | 2013-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3144455 | 2012-12-08 | Paper |
| Approximating Infeasible 2VPI-Systems | 2012-11-06 | Paper |
| Graphentheoretische Konzepte und Algorithmen | 2012-10-02 | Paper |
| Erratum to ``Minimum cost flows with minimum quantities | 2012-07-25 | Paper |
| The online TSP against fair adversaries | 2012-05-30 | Paper |
| Selfish bin coloring | 2012-04-04 | Paper |
| Truthful mechanisms for selfish routing and two-parameter agents | 2011-11-23 | Paper |
| Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization | 2011-09-20 | Paper |
| Interval scheduling on related machines | 2011-06-30 | Paper |
| MIP Formulations for Flowshop Scheduling with Limited Buffers | 2011-05-12 | Paper |
| Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines | 2011-03-25 | Paper |
| New lower bounds for online \(k\)-server routing problems | 2010-08-16 | Paper |
| Clever or smart: strategies for the online target date assignment problem | 2010-05-05 | Paper |
| Truthful Mechanisms for Selfish Routing and Two-Parameter Agents | 2009-12-01 | Paper |
| How hard is it to find extreme Nash equilibria in network congestion games? | 2009-11-06 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Online Job Admission | 2009-08-05 | Paper |
| Semi-preemptive routing on trees | 2009-03-04 | Paper |
| A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301726 | 2009-01-20 | Paper |
| Bincoloring | 2008-11-18 | Paper |
| Approximation algorithms for a vehicle routing problem | 2008-11-17 | Paper |
| Pruning in column generation for service vehicle dispatching | 2008-09-03 | Paper |
| A monotone approximation algorithm for scheduling with precedence constraints | 2008-08-06 | Paper |
| Online-Optimization of Large-Scale Vehicle Dispatching Problems | 2007-05-29 | Paper |
| Competitive Algorithms for Cottage Rental | 2007-05-29 | Paper |
| A hard dial-a-ride problem that is easy on average | 2007-05-15 | Paper |
| Budget constrained minimum cost connected medians | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| A heuristic for the Stacker Crane Problem on trees which is almost surely exact | 2006-12-07 | Paper |
| How to whack moles | 2006-09-14 | Paper |
| Reoptimization gaps versus model errors in online-dispatching of service units for ADAC | 2006-08-17 | Paper |
| On budget-constrained flow improvement. | 2006-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708506 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5314567 | 2005-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828941 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452913 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448759 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494399 | 2003-08-26 | Paper |
| News from the online traveling repairman. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414509 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414508 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411397 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411288 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796167 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779167 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766688 | 2002-07-22 | Paper |
| Models and approximation algorithms for channel assignment in radio networks | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762578 | 2002-02-21 | Paper |
| Euler is standing in line dial-a-ride problems with precedence-constraints | 2001-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728857 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728897 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728895 | 2001-11-04 | Paper |
| Upgrading bottleneck constrained forests | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762577 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494412 | 2000-08-10 | Paper |
| On the minimum label spanning tree problem | 2000-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944966 | 2000-06-07 | Paper |
| Improving Minimum Cost Spanning Trees by Upgrading Nodes | 2000-02-06 | Paper |
| Improving spanning trees by upgrading nodes | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389556 | 1999-08-10 | Paper |
| Approximation algorithms for certain network improvement problems | 1999-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232790 | 1999-03-15 | Paper |
| Modifying edges of a network to obtain short subgraphs | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359752 | 1998-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395331 | 1998-08-04 | Paper |
| Compact location problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359755 | 1998-04-22 | Paper |
