| Publication | Date of Publication | Type |
|---|
| On the hardness of scheduling with non-uniform communication delays | 2024-07-19 | Paper |
| scientific article; zbMATH DE number 7788514 (Why is no real title available?) | 2024-01-15 | Paper |
From approximate to exact integer programming
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Vector balancing in Lebesgue spaces
Random Structures & Algorithms | 2023-10-19 | Paper |
Polynomiality for Bin Packing with a Constant Number of Item Types
Journal of the ACM | 2022-12-08 | Paper |
| The Vector Balancing Constant for Zonotopes | 2022-10-28 | Paper |
Improved analysis of online balanced clustering
(available as arXiv preprint) | 2022-10-19 | Paper |
Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
(available as arXiv preprint) | 2022-08-16 | Paper |
| Approximate Carath\'eodory bounds via Discrepancy Theory | 2022-07-07 | Paper |
| Tight bounds on the Fourier growth of bounded functions on the hypercube | 2021-07-13 | Paper |
A Tale of Santa Claus, Hypergraphs and Matroids
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Linear Size Sparsifier and the Geometry of the Operator Norm Ball
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| An Elementary Exposition of Pisier's Inequality | 2020-09-22 | Paper |
A Fourier-analytic approach for the discrepancy of random set systems
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Polynomiality for bin packing with a constant number of item types
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Polynomiality for bin packing with a constant number of item types
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| The entropy rounding method in approximation algorithms | 2019-05-10 | Paper |
A logarithmic additive integrality gap for bin packing
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The matching polytope has exponential extension complexity
Journal of the ACM | 2018-05-17 | Paper |
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Pricing on paths: a PTAS for the highway problem | 2017-09-29 | Paper |
A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Bin packing via discrepancy of permutations | 2017-09-29 | Paper |
An improved deterministic rescaling for linear programming algorithms
(available as arXiv preprint) | 2017-08-31 | Paper |
Number balancing is as hard as Minkowski's theorem and shortest vector
(available as arXiv preprint) | 2017-08-31 | Paper |
Deterministic discrepancy minimization via the multiplicative weight update method
(available as arXiv preprint) | 2017-08-31 | Paper |
\(0/1\) polytopes with quadratic Chvátal rank
Operations Research | 2017-06-02 | Paper |
Constructive Discrepancy Minimization for Convex Sets
SIAM Journal on Computing | 2017-03-10 | Paper |
Better bin packing approximations via discrepancy theory
SIAM Journal on Computing | 2016-07-04 | Paper |
Pricing on paths: a PTAS for the highway problem
SIAM Journal on Computing | 2016-03-23 | Paper |
Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
Real-Time Systems | 2015-09-25 | Paper |
The matching polytope has exponential extension complexity
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Bin packing via discrepancy of permutations
ACM Transactions on Algorithms | 2014-12-05 | Paper |
An improved LP-based approximation for Steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
| EDF-schedulability of synchronous periodic task systems is coNP-hard | 2014-05-22 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Steiner tree approximation via iterative randomized rounding
Journal of the ACM | 2014-02-17 | Paper |
Some \(0/1\) polytopes need exponential size extended formulations
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
Cover-decomposition and polychromatic numbers
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
0/1 polytopes with quadratic Chvátal rank
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
| Approximating Bin Packing within O(log OPT * log log OPT) bins | 2013-01-17 | Paper |
Extended formulations for polygons
Discrete & Computational Geometry | 2012-10-15 | Paper |
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
Mathematics of Operations Research | 2012-05-24 | Paper |
Optimal selection of customers for a last-minute offer
Operations Research | 2011-11-17 | Paper |
Cover-decomposition and polychromatic numbers
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Diameter of polyhedra: limits of abstraction
Mathematics of Operations Research | 2011-04-27 | Paper |
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
Approximation and Online Algorithms | 2011-02-15 | Paper |
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Network design via core detouring for problems without a core
Automata, Languages and Programming | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5764866 (Why is no real title available?) | 2010-08-06 | Paper |
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
Real-Time Systems | 2009-11-10 | Paper |
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
Lecture Notes in Computer Science | 2009-10-29 | Paper |
New Hardness Results for Diophantine Approximation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
On the Complexity of the Asymmetric VPN Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Convexly independent subsets of the Minkowski sum of planar point sets
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Convexly independent subsets of the Minkowski sum of planar point sets
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
Automata, Languages and Programming | 2008-08-28 | Paper |
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
(available as arXiv preprint) | N/A | Paper |
