| Publication | Date of Publication | Type |
|---|
| Submodular Optimization with Contention Resolution Extensions. | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002622 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999097 | 2021-07-09 | Paper |
| Integrated Supply Chain Management via Randomized Rounding | 2020-11-09 | Paper |
| An Algorithm for Online K-Means Clustering | 2019-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743409 | 2019-05-10 | Paper |
| Concentration and Moment Inequalities for Polynomials of Independent Random Variables | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743432 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633862 | 2019-05-06 | Paper |
| Solving Optimization Problems with Diseconomies of Scale via Decoupling | 2019-02-25 | Paper |
| Maximizing Polynomials Subject to Assignment Constraints | 2018-11-12 | Paper |
| Energy-efficient scheduling and routing via randomized rounding | 2018-11-07 | Paper |
| Inapproximability of the Multilevel Uncapacitated Facility Location Problem | 2018-11-05 | Paper |
| Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs | 2018-11-05 | Paper |
| Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm | 2018-10-30 | Paper |
| A Bi-Criteria Approximation Algorithm for k-Means | 2018-04-19 | Paper |
| Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature | 2017-12-07 | Paper |
| New Approximations for Broadcast Scheduling via Variants of α-point Rounding | 2017-10-05 | Paper |
| Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature | 2017-10-05 | Paper |
| Submodular Stochastic Probing on Matroids | 2017-03-03 | Paper |
| Stochastic Scheduling on Unrelated Machines | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963934 | 2017-02-21 | Paper |
| Bidding Strategies for Fantasy-Sports Auctions | 2017-02-10 | Paper |
| Polynomial-time approximation schemes for circle and other packing problems | 2016-10-21 | Paper |
| Makespan minimization in job shops | 2016-09-29 | Paper |
| Unrelated Machine Scheduling with Stochastic Processing Times | 2016-08-10 | Paper |
| Submodular Stochastic Probing on Matroids | 2016-08-10 | Paper |
| No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem | 2016-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501259 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501361 | 2015-08-03 | Paper |
| Concentration inequalities for nonlinear matroid intersection | 2015-05-29 | Paper |
| Buffer overflow management in QoS switches | 2015-02-27 | Paper |
| Online server allocation in a server farm via benefit task systems | 2015-02-27 | Paper |
| Non-monotone submodular maximization under matroid and knapsack constraints | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934659 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934715 | 2014-12-18 | Paper |
| The Santa Claus problem | 2014-11-25 | Paper |
| Approximating the minimum quadratic assignment problems | 2014-11-18 | Paper |
| Dynamic pricing for impatient bidders | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921672 | 2014-10-13 | Paper |
| Polynomial-Time Approximation Schemes for Circle Packing Problems | 2014-10-08 | Paper |
| Sum edge coloring of multigraphs via configuration LP | 2014-09-09 | Paper |
| Matroid matching | 2014-08-13 | Paper |
| Preemptive and non-preemptive generalized min sum set cover | 2014-06-27 | Paper |
| Supermodularity and Affine Policies in Dynamic Robust Optimization | 2014-06-26 | Paper |
| Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms | 2014-06-26 | Paper |
| Optimization Problems with Diseconomies of Scale via Decoupling | 2014-04-11 | Paper |
| Integrated Supply Chain Management via Randomized Rounding | 2014-03-31 | Paper |
| A complete 4-parametric complexity classification of short shop scheduling problems | 2014-02-05 | Paper |
| Large Neighborhood Local Search for the Maximum Set Packing Problem | 2013-08-06 | Paper |
| No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem | 2013-08-06 | Paper |
| A Harmonic Algorithm for the 3D Strip Packing Problem | 2013-07-24 | Paper |
| Matroid Matching: The Power of Local Search | 2013-07-04 | Paper |
| An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem | 2013-03-19 | Paper |
| Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines | 2013-03-19 | Paper |
| Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
| New and Improved Bounds for the Minimum Set Cover Problem | 2012-11-02 | Paper |
| Preemptive and non-preemptive generalized min sum set cover | 2012-08-23 | Paper |
| Tight Approximation Algorithms for Maximum Separable Assignment Problems | 2012-05-24 | Paper |
| A note on the Kenyon-Remila strip-packing algorithm | 2012-03-09 | Paper |
| A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem | 2012-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115718 | 2012-02-10 | Paper |
| Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case | 2011-09-23 | Paper |
| Maximizing Polynomials Subject to Assignment Constraints | 2011-07-06 | Paper |
| Tight Bounds for Permutation Flow Shop Scheduling | 2011-04-27 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2011-04-27 | Paper |
| Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities | 2011-04-27 | Paper |
| On the Maximum Quadratic Assignment Problem | 2011-04-27 | Paper |
| Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
| Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints | 2010-12-03 | Paper |
| Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm | 2010-09-07 | Paper |
| A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing | 2010-09-06 | Paper |
| Improved approximation algorithms for broadcast scheduling | 2010-08-16 | Paper |
| Tight approximation algorithms for maximum general assignment problems | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579387 | 2010-08-06 | Paper |
| On the rate of convergence to the neutral attractor of a family of one-dimensional maps | 2010-04-09 | Paper |
| A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability | 2009-12-17 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2009-10-28 | Paper |
| On Hardness of Pricing Items for Single-Minded Bidders | 2009-10-28 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
| Complete Complexity Classification of Short Shop Scheduling | 2009-08-18 | Paper |
| Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems | 2009-08-14 | Paper |
| Improved Approximation Algorithms for Broadcast Scheduling | 2009-06-22 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs | 2008-12-21 | Paper |
| High-multiplicity cyclic job shop scheduling | 2008-11-27 | Paper |
| Optimal bundle pricing with monotonicity constraint | 2008-11-27 | Paper |
| Bundle Pricing with Comparable Items | 2008-09-25 | Paper |
| Tight Bounds for Permutation Flow Shop Scheduling | 2008-06-10 | Paper |
| Min Sum Edge Coloring in Multigraphs Via Configuration LP | 2008-06-10 | Paper |
| Minimizing Makespan in No-Wait Job Shops | 2008-05-27 | Paper |
| Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes | 2008-05-27 | Paper |
| Job Shop Scheduling with Unit Processing Times | 2008-05-27 | Paper |
| Two-dimensional bin packing with one-dimensional resource augmentation | 2008-01-18 | Paper |
| Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities | 2007-11-29 | Paper |
| Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times | 2007-08-30 | Paper |
| Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem | 2007-08-28 | Paper |
| LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times | 2007-08-28 | Paper |
| Minimizing migrations in fair multiprocessor scheduling of persistent tasks | 2007-05-15 | Paper |
| Approximation algorithms for shop scheduling problems with minsum objective: A correction | 2007-05-15 | Paper |
| Machine scheduling with resource dependent processing times | 2007-04-19 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Hamiltonian completions of sparse random graphs | 2005-12-27 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| An improved upper bound for the TSP in cubic 3-edge-connected graphs | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Buffer Overflow Management in QoS Switches | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828951 | 2004-11-29 | Paper |
| Pipage rounding: a new method of constructing algorithms with proven performance guarantee | 2004-11-22 | Paper |
| Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems | 2004-10-01 | Paper |
| Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737531 | 2004-08-11 | Paper |
| A note on permutation flow shop problem | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471354 | 2004-07-28 | Paper |
| A note on maximizing a submodular set function subject to a knapsack constraint | 2004-07-01 | Paper |
| Makespan Minimization in Job Shops: A Linear Time Approximation Scheme | 2004-01-08 | Paper |
| A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428906 | 2003-09-22 | Paper |
| The diameter of a long-range percolation graph | 2003-05-25 | Paper |
| A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective | 2003-05-14 | Paper |
| A linear time approximation scheme for makespan minimization in an open shop with release dates | 2003-04-03 | Paper |
| Approximation algorithms for shop scheduling problems with minsum objective | 2002-08-08 | Paper |
| Approximating the maximum quadratic assignment problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537755 | 2002-06-20 | Paper |
| Best possible approximation algorithm for MAX SAT with cardinality constraint. | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753724 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753920 | 2001-12-18 | Paper |
| A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527196 | 2001-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952712 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263699 | 2000-11-27 | Paper |
| Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501555 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941835 | 2000-03-19 | Paper |
| An 0. 828-approximation algorithm for the uncapacitated facility location problem | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242567 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242386 | 1999-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400857 | 1998-08-02 | Paper |
