| Online algorithms to schedule a proportionate flexible flow shop of batching machines | 0 | 0.34 | 2022 |
| Scheduling a Proportionate Flow Shop of Batching Machines | 0 | 0.34 | 2020 |
| The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. | 0 | 0.34 | 2019 |
| Robust multicovers with budgeted uncertainty. | 1 | 0.37 | 2019 |
| Full implementation of social choice functions in dominant strategies | 0 | 0.34 | 2019 |
| Simultaneous Dominating Set for Spanning Tree Factorings. | 0 | 0.34 | 2018 |
| A Generalized Approximation Framework for Fractional Network Flow and Packing Problems. | 0 | 0.34 | 2018 |
| An FPTAS for the knapsack problem with parametric weights. | 2 | 0.37 | 2018 |
| Maximum flows in generalized processing networks. | 0 | 0.34 | 2017 |
| A network simplex method for the budget-constrained minimum cost flow problem. | 1 | 0.35 | 2017 |
| An FPTAS for the parametric knapsack problem. | 3 | 0.40 | 2017 |
| On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows. | 1 | 0.36 | 2017 |
| Capacitated network design games with weighted players. | 0 | 0.34 | 2016 |
| ConGen: An Application Specific DRAM Memory Controller Generator. | 2 | 0.37 | 2016 |
| The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation | 0 | 0.34 | 2016 |
| On the Online Min-Wait Relocation Problem | 3 | 0.52 | 2015 |
| ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem | 0 | 0.34 | 2015 |
| Relocation in Carsharing Systems Using Flows in Time-Expanded Networks | 1 | 0.39 | 2014 |
| Online Job Admission | 0 | 0.34 | 2013 |
| Models and Algorithms for Carsharing Systems and Related Problems. | 6 | 0.67 | 2013 |
| Online delay management on a single train line: beyond competitive analysis | 5 | 0.44 | 2013 |
| Approximating infeasible 2VPI-systems | 0 | 0.34 | 2012 |
| Interval scheduling on related machines | 5 | 0.49 | 2011 |
| Minimum cost flows with minimum quantities | 5 | 0.66 | 2011 |
| Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization | 6 | 0.47 | 2011 |
| Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines | 3 | 0.42 | 2011 |
| clever or smart: Strategies for the online target date assignment problem | 0 | 0.34 | 2010 |
| New lower bounds for online k-server routing problems | 5 | 0.47 | 2009 |
| Truthful Mechanisms for Selfish Routing and Two-Parameter Agents | 0 | 0.34 | 2009 |
| How hard is it to find extreme Nash equilibria in network congestion games? | 2 | 0.40 | 2009 |
| Approximation algorithms for a vehicle routing problem | 2 | 0.40 | 2008 |
| Improved construction heuristics and iterated local search for the routing and wavelength assignment problem | 3 | 0.44 | 2008 |
| A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints | 1 | 0.36 | 2008 |
| A monotone approximation algorithm for scheduling with precedence constraints | 2 | 0.65 | 2008 |
| Bincoloring | 3 | 0.38 | 2008 |
| Semi-preemptive routing on trees | 1 | 0.38 | 2008 |
| Distributed approximation algorithms for finding 2-edge-connected subgraphs | 2 | 0.38 | 2007 |
| Referee report on the book titled "Production planning by mixed integer programming". | 0 | 0.34 | 2007 |
| How to whack moles | 4 | 0.46 | 2006 |
| Online-Optimization of Large-Scale Vehicle Dispatching Problems | 0 | 0.34 | 2006 |
| Reoptimization gaps versus model errors in online-dispatching of service units for ADAC | 10 | 0.83 | 2006 |
| Competitive Algorithms for Cottage Rental | 0 | 0.34 | 2006 |
| A heuristic for the Stacker Crane Problem on trees which is almost surely exact | 14 | 0.85 | 2006 |
| Deterministic online optical call admission revisited | 1 | 0.35 | 2005 |
| A Hard Dial-a-Ride Problem that is Easy on Average | 4 | 0.49 | 2005 |
| On minimizing the maximum flow time in the online dial-a-ride problem | 2 | 0.37 | 2005 |
| Budget constrained minimum cost connected medians | 1 | 0.40 | 2004 |
| How to cut a cake almost fairly | 8 | 1.56 | 2002 |
| Models and approximation algorithms for channel assignment in radio networks | 96 | 7.54 | 2001 |
| Improving spanning trees by upgrading nodes | 15 | 0.92 | 1999 |
