| Publication | Date of Publication | Type |
|---|
The power of adaptivity for stochastic submodular cover
Operations Research | 2024-07-29 | Paper |
Cluster before you hallucinate: node-capacitated network design and energy efficient routing
SIAM Journal on Computing | 2024-06-05 | Paper |
| Minimum cost adaptive submodular cover | 2024-05-14 | Paper |
Online generalized network design under (dis)economies of scale
Mathematics of Operations Research | 2024-03-05 | Paper |
| Online generalized network design under (dis)economies of scale | 2024-01-15 | Paper |
Stochastic makespan minimization in structured set systems (extended abstract)
Integer Programming and Combinatorial Optimization | 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
INFORMS Journal on Computing | 2022-06-30 | Paper |
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Mathematics of Operations Research | 2022-06-27 | Paper |
Constrained assortment optimization under the paired combinatorial logit model
Operations Research | 2022-05-31 | Paper |
Stochastic makespan minimization in structured set systems
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
On some variants of Euclidean \(k\)-supplier
Operations Research Letters | 2022-03-11 | Paper |
Stochastic load balancing on unrelated machines
Mathematics of Operations Research | 2021-06-03 | Paper |
Approximation algorithms for the a priori traveling repairman
Operations Research Letters | 2021-04-07 | Paper |
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Approximation algorithms for stochastic \(k\)-TSP | 2020-11-25 | Paper |
Adaptive submodular ranking and routing
Operations Research | 2020-11-04 | Paper |
Online covering with \(\ell_q\)-norm objectives and applications to network design
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
| Online Covering with Sum of $ell_q$-Norm Objectives. | 2020-05-27 | Paper |
The Euclidean \(k\)-supplier problem
Mathematics of Operations Research | 2020-04-30 | Paper |
Malleable scheduling for flows of jobs and applications to MapReduce
Journal of Scheduling | 2020-03-06 | Paper |
Approximating max-cut under graph-MSO constraints
Operations Research Letters | 2020-02-10 | Paper |
An approximation algorithm for vehicle routing with compatibility constraints
Operations Research Letters | 2020-02-10 | Paper |
Hallucination helps: energy efficient virtual circuit routing
SIAM Journal on Computing | 2020-01-21 | Paper |
Hallucination helps: energy efficient virtual circuit routing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| scientific article; zbMATH DE number 7053373 (Why is no real title available?) | 2019-05-10 | Paper |
| On the maximum quadratic assignment problem | 2019-05-06 | Paper |
Algorithms for hub label optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Minimum latency submodular cover
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Minimum makespan multi-vehicle dial-a-ride
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Better scalable algorithms for broadcast scheduling
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Approximating graph-constrained max-cut
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Algorithms and adaptivity gaps for stochastic probing
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Adaptivity gaps for stochastic probing: submodular and XOS functions
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Locating depots for capacitated vehicle routing
Networks | 2018-05-23 | Paper |
| Stochastic load balancing on unrelated machines | 2018-03-15 | Paper |
Approximation-friendly discrepancy rounding
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
| The matroid median problem | 2017-09-29 | Paper |
Approximation algorithms for optimal decision trees and adaptive TSP problems
Mathematics of Operations Research | 2017-09-22 | Paper |
| Adaptive submodular ranking | 2017-08-31 | Paper |
| The container selection problem | 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
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Max-cut under graph constraints
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Approximation-friendly discrepancy rounding
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Capacitated vehicle routing with nonuniform speeds
Mathematics of Operations Research | 2016-04-15 | Paper |
On the adaptivity gap of stochastic orienteering
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Minimum congestion mapping in a cloud
SIAM Journal on Computing | 2015-06-24 | Paper |
Facility Location with Matroid or Knapsack Constraints
Mathematics of Operations Research | 2015-05-29 | Paper |
Approximating sparse covering integer programs online
Mathematics of Operations Research | 2015-04-24 | Paper |
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
Mathematics of Operations Research | 2015-04-01 | 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 |
Dial a ride from \(k\)-forest
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Solving packing integer programs via randomized rounding with alterations
Theory of Computing | 2014-10-06 | Paper |
Thresholded covering algorithms for robust and max-min optimization
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Min-max Graph Partitioning and Small Set Expansion
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Min-Max Graph Partitioning and Small Set Expansion
SIAM Journal on Computing | 2014-07-30 | Paper |
On the adaptivity gap of stochastic orienteering
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
On generalizations of network design problems with degree bounds
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
The Approximability of the Binary Paintshop Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Approximating sparse covering integer programs online
Automata, Languages, and Programming | 2013-08-12 | Paper |
Stochastic vehicle routing with recourse
Automata, Languages, and Programming | 2013-08-12 | Paper |
Minimum latency submodular cover
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Algorithms for hub label optimization
Automata, Languages, and Programming | 2013-08-06 | Paper |
Multicast routing for energy minimization using speed scaling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
A stochastic probing problem with applications
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Thrifty algorithms for multistage robust optimization
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
The Euclidean \(k\)-supplier problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings
Algorithmica | 2012-12-06 | Paper |
Approximation algorithms for distance constrained vehicle routing problems
Networks | 2012-06-18 | Paper |
Approximation algorithms for VRP with stochastic demands
Operations Research | 2012-06-18 | Paper |
Locating depots for capacitated vehicle routing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
The directed orienteering problem
Algorithmica | 2011-07-01 | Paper |
Capacitated vehicle routing with non-uniform speeds
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
On the LP relaxation of the asymmetric traveling salesman path problem
Theory of Computing | 2011-05-24 | Paper |
A plant location guide for the unsure: approximation algorithms for min-Max location problems
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 |
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
An improved approximation algorithm for requirement cut
Operations Research Letters | 2010-09-07 | Paper |
Thresholded Covering Algorithms for Robust and Max-min Optimization
Automata, Languages and Programming | 2010-09-07 | Paper |
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Automata, Languages and Programming | 2010-09-07 | Paper |
Better Scalable Algorithms for Broadcast Scheduling
Automata, Languages and Programming | 2010-09-07 | Paper |
Additive guarantees for degree-bounded directed network design
SIAM Journal on Computing | 2010-09-06 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Approximating the k-multicut problem
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764865 (Why is no real title available?) | 2010-08-06 | Paper |
On \(k\)-column sparse packing programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On generalizations of network design problems with degree bounds
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters | 2010-06-08 | Paper |
Approximation algorithms for requirement cut on graphs
Algorithmica | 2010-02-23 | Paper |
Minimum makespan multi-vehicle dial-a-ride
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Exact train pathing
Journal of Scheduling | 2009-08-28 | Paper |
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5485591 (Why is no real title available?) | 2009-01-05 | Paper |
The Directed Minimum Latency Problem
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Dial a Ride from k-Forest
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Tight Bounds for Permutation Flow Shop Scheduling
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Minimum Vehicle Routing with a Common Deadline
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
