| Publication | Date of Publication | Type |
|---|
| Solving optimization problems with diseconomies of scale via decoupling | 2025-08-05 | Paper |
| Submodular Optimization with Contention Resolution Extensions. | 2023-02-03 | Paper |
| Greedy minimization of weakly supermodular set functions | 2021-07-28 | Paper |
scientific article; zbMATH DE number 7370639 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370639 (Why is no real title available?) | 2021-07-09 | Paper |
Integrated Supply Chain Management via Randomized Rounding
INFORMS Journal on Computing | 2020-11-09 | Paper |
An algorithm for online \(k\)-means clustering
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Inapproximability of the multi-level uncapacitated facility location problem | 2019-05-10 | Paper |
Concentration and moment inequalities for polynomials of independent random variables
(available as arXiv preprint) | 2019-05-10 | Paper |
| Concentration and moment inequalities for polynomials of independent random variables | 2019-05-10 | Paper |
| Concentration inequalities for nonlinear matroid intersection | 2019-05-10 | Paper |
| On the maximum quadratic assignment problem | 2019-05-06 | Paper |
Solving Optimization Problems with Diseconomies of Scale via Decoupling
Journal of the ACM | 2019-02-25 | Paper |
Maximizing polynomials subject to assignment constraints
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling | 2018-11-07 | Paper |
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Inapproximability of the multilevel uncapacitated facility location problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm
ACM Transactions on Algorithms | 2018-10-30 | Paper |
A bi-criteria approximation algorithm for \(k\)-means
(available as arXiv preprint) | 2018-04-19 | Paper |
Optimal approximation for submodular and supermodular optimization with bounded curvature
Mathematics of Operations Research | 2017-12-07 | Paper |
Optimal approximation for submodular and supermodular optimization with bounded curvature
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Stochastic Scheduling on Unrelated Machines | 2017-03-03 | Paper |
| Submodular stochastic probing on matroids | 2017-03-03 | Paper |
Energy efficient scheduling and routing via randomized rounding
(available as arXiv preprint) | 2017-02-21 | Paper |
Bidding strategies for fantasy-sports auctions
Web and Internet Economics | 2017-02-10 | Paper |
Polynomial-time approximation schemes for circle and other packing problems
Algorithmica | 2016-10-21 | Paper |
Makespan minimization in job shops: a polynomial time approximation scheme
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Submodular stochastic probing on matroids
Mathematics of Operations Research | 2016-08-10 | Paper |
Submodular stochastic probing on matroids
Mathematics of Operations Research | 2016-08-10 | Paper |
Unrelated machine scheduling with stochastic processing times
Mathematics of Operations Research | 2016-08-10 | Paper |
No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem
Mathematics of Operations Research | 2016-04-15 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Journal of Scheduling | 2016-01-22 | Paper |
| New approximability and inapproximability results for 2-dimensional bin packing | 2015-08-03 | Paper |
| Minimizing migrations in fair multiprocessor scheduling of persistent tasks | 2015-08-03 | Paper |
Concentration inequalities for nonlinear matroid intersection
Random Structures & Algorithms | 2015-05-29 | Paper |
Buffer overflow management in QoS switches
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Online server allocation in a server farm via benefit task systems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| Harmonic algorithm for 3-dimensional strip packing problem | 2014-12-18 | Paper |
| Dynamic pricing for impatient bidders | 2014-12-18 | Paper |
The Santa Claus problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Job shop scheduling with unit processing times | 2014-10-13 | Paper |
Polynomial-time approximation schemes for circle packing problems
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Preemptive and non-preemptive generalized min sum set cover
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Supermodularity and affine policies in dynamic robust optimization
Operations Research | 2014-06-26 | Paper |
Supermodularity and affine policies in dynamic robust optimization
Operations Research | 2014-06-26 | Paper |
Online make-to-order joint replenishment model: primal-dual competitive algorithms
Operations Research | 2014-06-26 | Paper |
| Optimization Problems with Diseconomies of Scale via Decoupling | 2014-04-11 | Paper |
Integrated supply chain management via randomized rounding
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling | 2014-02-05 | Paper |
Large neighborhood local search for the maximum set packing problem
Automata, Languages, and Programming | 2013-08-06 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Lecture Notes in Computer Science | 2013-08-06 | Paper |
No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
Lecture Notes in Computer Science | 2013-08-06 | Paper |
A harmonic algorithm for the 3D strip packing problem
SIAM Journal on Computing | 2013-07-24 | Paper |
Matroid matching: the power of local search
SIAM Journal on Computing | 2013-07-04 | Paper |
An efficient polynomial-time approximation scheme for the joint replenishment problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Integer preemptive scheduling on parallel machines
Operations Research Letters | 2013-03-05 | Paper |
New and improved bounds for the minimum set cover problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 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
Mathematics of Operations Research | 2012-05-24 | Paper |
A note on the Kenyon-Remila strip-packing algorithm
Information Processing Letters | 2012-03-09 | Paper |
A constant approximation algorithm for the one-warehouse multiretailer problem
Management Science | 2012-02-29 | Paper |
| Structural properties of optimal schedules with preemption | 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
Automata, Languages and Programming | 2011-07-06 | Paper |
Submodular maximization over multiple matroids via generalized exchange properties
Mathematics of Operations Research | 2011-04-27 | Paper |
Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
Mathematics of Operations Research | 2011-04-27 | Paper |
Tight bounds for permutation flow shop scheduling
Mathematics of Operations Research | 2011-04-27 | Paper |
On the maximum quadratic assignment problem
Mathematics of Operations Research | 2011-04-27 | Paper |
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics | 2011-03-10 | Paper |
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm
Lecture Notes in Computer Science | 2010-09-07 | Paper |
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
SIAM Journal on Computing | 2010-09-06 | Paper |
Tight approximation algorithms for maximum general assignment problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Improved approximation algorithms for broadcast scheduling
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764798 (Why is no real title available?) | 2010-08-06 | Paper |
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
Fundamenta Mathematicae | 2010-04-09 | Paper |
A structural lemma in 2-dimensional packing, and its implications on approximability
Algorithms and Computation | 2009-12-17 | Paper |
On Hardness of Pricing Items for Single-Minded Bidders
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Integrality Property in Preemptive Parallel Machine Scheduling
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Complete Complexity Classification of Short Shop Scheduling
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters | 2009-08-14 | Paper |
Improved Approximation Algorithms for Broadcast Scheduling
SIAM Journal on Computing | 2009-06-22 | Paper |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM | 2008-12-21 | Paper |
High-multiplicity cyclic job shop scheduling
Operations Research Letters | 2008-11-27 | Paper |
Optimal bundle pricing with monotonicity constraint
Operations Research Letters | 2008-11-27 | Paper |
Bundle Pricing with Comparable Items
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Min Sum Edge Coloring in Multigraphs Via Configuration LP
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Tight Bounds for Permutation Flow Shop Scheduling
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research | 2008-05-27 | Paper |
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research | 2008-05-27 | Paper |
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research | 2008-05-27 | Paper |
Two-dimensional bin packing with one-dimensional resource augmentation
Discrete Optimization | 2008-01-18 | Paper |
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Journal of Scheduling | 2007-05-15 | Paper |
Approximation algorithms for shop scheduling problems with minsum objective: A correction
Journal of Scheduling | 2007-05-15 | Paper |
Machine scheduling with resource dependent processing times
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Hamiltonian completions of sparse random graphs
Discrete Applied Mathematics | 2005-12-27 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Operations Research Letters | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119680 (Why is no real title available?)
(available as arXiv preprint) | 2004-11-29 | Paper |
Pipage rounding: a new method of constructing algorithms with proven performance guarantee
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
Algorithmica | 2004-10-01 | Paper |
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086926 (Why is no real title available?) | 2004-08-11 | Paper |
A note on permutation flow shop problem
Annals of Operations Research | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2079395 (Why is no real title available?) | 2004-07-28 | Paper |
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters | 2004-07-01 | Paper |
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1984541 (Why is no real title available?) | 2003-09-22 | Paper |
The diameter of a long-range percolation graph
Random Structures & Algorithms | 2003-05-25 | Paper |
A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
Journal of Algorithms | 2003-05-14 | Paper |
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters | 2003-04-03 | Paper |
Approximation algorithms for shop scheduling problems with minsum objective
Journal of Scheduling | 2002-08-08 | Paper |
Approximating the maximum quadratic assignment problem
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1757967 (Why is no real title available?) | 2002-06-20 | Paper |
Best possible approximation algorithm for MAX SAT with cardinality constraint.
Algorithmica | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670527 (Why is no real title available?) | 2002-01-06 | Paper |
| scientific article; zbMATH DE number 1670644 (Why is no real title available?) | 2001-12-18 | Paper |
A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1560345 (Why is no real title available?) | 2001-02-01 | Paper |
| scientific article; zbMATH DE number 1445389 (Why is no real title available?) | 2001-01-15 | Paper |
| scientific article; zbMATH DE number 1342117 (Why is no real title available?) | 2000-11-27 | Paper |
Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem
Operations Research Letters | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1500536 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1418275 (Why is no real title available?) | 2000-03-19 | Paper |
An 0. 828-approximation algorithm for the uncapacitated facility location problem
Discrete Applied Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1286021 (Why is no real title available?) | 1999-05-11 | Paper |
| scientific article; zbMATH DE number 1285629 (Why is no real title available?) | 1999-05-10 | Paper |
| scientific article; zbMATH DE number 1182773 (Why is no real title available?) | 1998-08-02 | Paper |
