| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147425 | 2024-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147425 | 2024-01-15 | Paper |
| Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) | 2022-10-14 | Paper |
| Non-adaptive stochastic score classification and explainable halfspace evaluation | 2022-08-16 | Paper |
| Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization | 2022-06-30 | Paper |
| Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems | 2022-06-27 | Paper |
| Constrained Assortment Optimization Under the Paired Combinatorial Logit Model | 2022-05-31 | Paper |
| Stochastic makespan minimization in structured set systems | 2022-03-22 | Paper |
| On some variants of Euclidean \(k\)-supplier | 2022-03-11 | Paper |
| Stochastic Load Balancing on Unrelated Machines | 2021-06-03 | Paper |
| Approximation algorithms for the a priori traveling repairman | 2021-04-07 | Paper |
| Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136319 | 2020-11-25 | Paper |
| Adaptive Submodular Ranking and Routing | 2020-11-04 | Paper |
| Online covering with \(\ell_q\)-norm objectives and applications to network design | 2020-10-21 | Paper |
| Online Covering with Sum of $ell_q$-Norm Objectives. | 2020-05-27 | Paper |
| The Euclidean k-Supplier Problem | 2020-04-30 | Paper |
| Malleable scheduling for flows of jobs and applications to MapReduce | 2020-03-06 | Paper |
| An approximation algorithm for vehicle routing with compatibility constraints | 2020-02-10 | Paper |
| Approximating max-cut under graph-MSO constraints | 2020-02-10 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2020-01-21 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743496 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633862 | 2019-05-06 | Paper |
| Minimum Latency Submodular Cover | 2018-11-05 | Paper |
| Algorithms for Hub Label Optimization | 2018-11-05 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2018-10-30 | Paper |
| Better Scalable Algorithms for Broadcast Scheduling | 2018-10-30 | Paper |
| Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets | 2018-10-30 | Paper |
| Approximating graph-constrained max-cut | 2018-10-26 | Paper |
| Algorithms and Adaptivity Gaps for Stochastic Probing | 2018-07-16 | Paper |
| Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions | 2018-07-16 | Paper |
| Locating depots for capacitated vehicle routing | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607971 | 2018-03-15 | Paper |
| Approximation-Friendly Discrepancy Rounding | 2018-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365103 | 2017-09-29 | Paper |
| Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems | 2017-09-22 | Paper |
| Adaptive submodular ranking | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351914 | 2017-08-31 | Paper |
| Minimum makespan vehicle routing problem with compatibility constraints | 2017-08-04 | Paper |
| Approximation algorithms for inventory problems with submodular or routing costs | 2016-11-25 | Paper |
| Max-Cut Under Graph Constraints | 2016-08-10 | Paper |
| Approximation-Friendly Discrepancy Rounding | 2016-08-10 | Paper |
| Capacitated Vehicle Routing with Nonuniform Speeds | 2016-04-15 | Paper |
| On the adaptivity gap of stochastic orienteering | 2015-12-09 | Paper |
| Minimum congestion mapping in a cloud | 2015-09-11 | Paper |
| Cluster before you hallucinate | 2015-06-26 | Paper |
| Minimum Congestion Mapping in a Cloud | 2015-06-24 | Paper |
| Facility Location with Matroid or Knapsack Constraints | 2015-05-29 | Paper |
| Approximating Sparse Covering Integer Programs Online | 2015-04-24 | Paper |
| Running Errands in Time: Approximation Algorithms for Stochastic Orienteering | 2015-04-01 | Paper |
| Non-monotone submodular maximization under matroid and knapsack constraints | 2015-02-04 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191563 | 2014-10-06 | Paper |
| Thresholded covering algorithms for robust and max-min optimization | 2014-08-29 | Paper |
| Min-Max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| Min-max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| On the Adaptivity Gap of Stochastic Orienteering | 2014-06-02 | Paper |
| On generalizations of network design problems with degree bounds | 2013-11-11 | Paper |
| The Approximability of the Binary Paintshop Problem | 2013-10-04 | Paper |
| Stochastic Vehicle Routing with Recourse | 2013-08-12 | Paper |
| Approximating Sparse Covering Integer Programs Online | 2013-08-12 | Paper |
| Minimum Latency Submodular Cover | 2013-08-12 | Paper |
| Algorithms for Hub Label Optimization | 2013-08-06 | Paper |
| Multicast Routing for Energy Minimization Using Speed Scaling | 2013-04-19 | Paper |
| A Stochastic Probing Problem with Applications | 2013-03-19 | Paper |
| Thrifty Algorithms for Multistage Robust Optimization | 2013-03-19 | Paper |
| The Euclidean k-Supplier Problem | 2013-03-19 | Paper |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings | 2012-12-06 | Paper |
| Approximation algorithms for distance constrained vehicle routing problems | 2012-06-18 | Paper |
| Technical Note—Approximation Algorithms for VRP with Stochastic Demands | 2012-06-18 | Paper |
| Locating Depots for Capacitated Vehicle Routing | 2011-08-17 | Paper |
| The directed orienteering problem | 2011-07-01 | Paper |
| Capacitated Vehicle Routing with Non-uniform Speeds | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002798 | 2011-05-24 | Paper |
| On the Maximum Quadratic Assignment Problem | 2011-04-27 | Paper |
| A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems | 2011-04-27 | Paper |
| Tight Bounds for Permutation Flow Shop Scheduling | 2011-04-27 | Paper |
| Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints | 2010-12-03 | Paper |
| An improved approximation algorithm for requirement cut | 2010-09-07 | Paper |
| Thresholded Covering Algorithms for Robust and Max-min Optimization | 2010-09-07 | Paper |
| Better Scalable Algorithms for Broadcast Scheduling | 2010-09-07 | Paper |
| Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems | 2010-09-07 | Paper |
| Additive Guarantees for Degree-Bounded Directed Network Design | 2010-09-06 | Paper |
| When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings | 2010-09-06 | Paper |
| Approximating the k-multicut problem | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579458 | 2010-08-06 | Paper |
| On generalizations of network design problems with degree bounds | 2010-06-22 | Paper |
| On k-Column Sparse Packing Programs | 2010-06-22 | Paper |
| Simpler analysis of LP extreme points for traveling salesman and survivable network design problems | 2010-06-08 | Paper |
| Approximation algorithms for requirement cut on graphs | 2010-02-23 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2009-10-29 | Paper |
| Exact train pathing | 2009-08-28 | Paper |
| Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302102 | 2009-01-05 | Paper |
| The Directed Minimum Latency Problem | 2008-11-27 | Paper |
| Dial a Ride from k-Forest | 2008-09-25 | Paper |
| Tight Bounds for Permutation Flow Shop Scheduling | 2008-06-10 | Paper |
| Minimum Vehicle Routing with a Common Deadline | 2007-08-28 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
