| Publication | Date of Publication | Type |
|---|
| On the hardness of scheduling with non-uniform communication delays | 2024-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147434 | 2024-01-15 | Paper |
| From approximate to exact integer programming | 2023-11-09 | Paper |
| Vector balancing in Lebesgue spaces | 2023-10-19 | Paper |
| Polynomiality for Bin Packing with a Constant Number of Item Types | 2022-12-08 | Paper |
| The Vector Balancing Constant for Zonotopes | 2022-10-28 | Paper |
| Improved analysis of online balanced clustering | 2022-10-19 | Paper |
| Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! | 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 | 2021-02-02 | Paper |
| Linear Size Sparsifier and the Geometry of the Operator Norm Ball | 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 | 2019-10-15 | Paper |
| Polynomiality for bin packing with a constant number of item types | 2019-06-20 | Paper |
| The entropy rounding method in approximation algorithms | 2019-05-10 | Paper |
| A logarithmic additive integrality gap for bin packing | 2018-07-16 | Paper |
| The Matching Polytope has Exponential Extension Complexity | 2018-05-17 | Paper |
| Diameter of polyhedra: limits of abstraction | 2017-10-20 | Paper |
| Pricing on paths: a PTAS for the highway problem | 2017-09-29 | Paper |
| Bin packing via discrepancy of permutations | 2017-09-29 | Paper |
| A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies | 2017-09-29 | Paper |
| An improved deterministic rescaling for linear programming algorithms | 2017-08-31 | Paper |
| Number balancing is as hard as Minkowski's theorem and shortest vector | 2017-08-31 | Paper |
| Deterministic discrepancy minimization via the multiplicative weight update method | 2017-08-31 | Paper |
| \(0/1\) polytopes with quadratic Chvátal rank | 2017-06-02 | Paper |
| Constructive Discrepancy Minimization for Convex Sets | 2017-03-10 | Paper |
| Better bin packing approximations via discrepancy theory | 2016-07-04 | Paper |
| Pricing on paths: a PTAS for the highway problem | 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 | 2015-09-25 | Paper |
| The Matching Polytope has Exponential Extension Complexity | 2015-06-26 | Paper |
| Bin packing via discrepancy of permutations | 2014-12-05 | Paper |
| An improved LP-based approximation for Steiner tree | 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 | 2014-05-13 | Paper |
| Steiner tree approximation via iterative randomized rounding | 2014-02-17 | Paper |
| Some \(0/1\) polytopes need exponential size extended formulations | 2014-02-03 | Paper |
| 0/1 polytopes with quadratic Chvátal rank | 2013-03-19 | Paper |
| A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing | 2013-03-19 | Paper |
| Approximating Bin Packing within O(log OPT * log log OPT) bins | 2013-01-17 | Paper |
| Extended formulations for polygons | 2012-10-15 | Paper |
| From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk | 2012-05-24 | Paper |
| Optimal selection of customers for a last-minute offer | 2011-11-17 | Paper |
| Approximation Algorithms for Single and Multi-Commodity Connected Facility Location | 2011-06-24 | Paper |
| Set Covering with Ordered Replacement: Additive and Multiplicative Gaps | 2011-06-24 | Paper |
| Diameter of polyhedra: limits of abstraction | 2011-04-27 | Paper |
| A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks | 2011-02-15 | Paper |
| Connected facility location via random facility sampling and core detouring | 2010-10-07 | Paper |
| Network design via core detouring for problems without a core | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579459 | 2010-08-06 | Paper |
| Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling | 2009-11-10 | Paper |
| An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling | 2009-10-29 | Paper |
| New Hardness Results for Diophantine Approximation | 2009-10-28 | Paper |
| On the Complexity of the Asymmetric VPN Problem | 2009-10-28 | Paper |
| Convexly independent subsets of the Minkowski sum of planar point sets | 2009-04-07 | Paper |
| A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation | 2008-08-28 | Paper |
| Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity | N/A | Paper |
