A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. - Friedrich Eisenbrand; Thomas Rothvoß (ICALP (1), 2008)

Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. - Friedrich Eisenbrand; Thomas Rothvoß (RTSS, 2008)

Approximating connected facility location problems via random facility sampling and core detouring. - Friedrich Eisenbrand; Fabrizio Grandoni 001; Thomas Rothvoß; Guido Schäfer (SODA, 2008)

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. - Friedrich Eisenbrand; János Pach; Thomas Rothvoß; Nir B. Sopher (Electron. J. Comb., 2008)

New Hardness Results for Diophantine Approximation. - Friedrich Eisenbrand; Thomas Rothvoß (APPROX-RANDOM, 2009)

On the Complexity of the Asymmetric VPN Problem. - Thomas Rothvoß; Laura Sanità (APPROX-RANDOM, 2009)

Diameter of polyhedra: limits of abstraction. - Friedrich Eisenbrand; Nicolai Hähnle; Thomas Rothvoß (SCG, 2009)

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. - Andreas Karrenbauer; Thomas Rothvoß (ESA, 2009)

Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. - Robert I. Davis 001; Thomas Rothvoß; Sanjoy K. Baruah; Alan Burns 001 (Real Time Syst., 2009)

Recent Hardness Results for Periodic Uni-processor Scheduling. - Friedrich Eisenbrand; Thomas Rothvoß (Scheduling, 2010)

Network Design via Core Detouring for Problems without a Core. - Fabrizio Grandoni 001; Thomas Rothvoß (ICALP (1), 2010)

EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. - Friedrich Eisenbrand; Thomas Rothvoß (SODA, 2010)

An improved LP-based approximation for steiner tree. - Jaroslaw Byrka; Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (STOC, 2010)

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks. - Andreas Karrenbauer; Thomas Rothvoß (WAOA, 2010)

Prizing on Paths: A PTAS for the Highway Problem - Fabrizio Grandoni 001; Thomas Rothvoß (CoRR, 2010)

Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers) - David Pritchard 001; Thomas Rothvoß (CoRR, 2010)

Optimal Selection of Customers for a Last-Minute Offer. - Roberto Cominetti; José R. Correa; Thomas Rothvoß; Jaime San Martín (Oper. Res., 2010)

Connected facility location via random facility sampling and core detouring. - Friedrich Eisenbrand; Fabrizio Grandoni 001; Thomas Rothvoß; Guido Schäfer (J. Comput. Syst. Sci., 2010)

Diameter of Polyhedra: Limits of Abstraction. - Friedrich Eisenbrand; Nicolai Hähnle; Alexander A. Razborov; Thomas Rothvoß (Math. Oper. Res., 2010)

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. - Friedrich Eisenbrand; Naonori Kakimura; Thomas Rothvoß; Laura Sanità (IPCO, 2011)

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. - Fabrizio Grandoni 001; Thomas Rothvoß (IPCO, 2011)

Directed Steiner Tree and the Lasserre Hierarchy - Thomas Rothvoß (CoRR, 2011)

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk. - Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (Math. Oper. Res., 2011)

The entropy rounding method in approximation algorithms. - Thomas Rothvoß (SODA, 2012)

Matroids and integrality gaps for hypergraphic steiner tree relaxations. - Michel X. Goemans; Neil Olver; Thomas Rothvoß; Rico Zenklusen (STOC, 2012)

A simpler proof for O(congestion + dilation) packet routing - Thomas Rothvoß (CoRR, 2012)

Extended Formulations for Polygons. - Samuel Fiorini; Thomas Rothvoß; Hans Raj Tiwary (Discret. Comput. Geom., 2012)

Approximating Bin Packing within O(log OPT * Log Log OPT) Bins. - Thomas Rothvoß (FOCS, 2013)

A Simpler Proof for $O( textrm{Congestion} + textrm{Dilation})$ Packet Routing. - Thomas Rothvoß (IPCO, 2013)

Steiner Tree Approximation via Iterative Randomized Rounding. - Jaroslaw Byrka; Fabrizio Grandoni 001; Thomas Rothvoß; Laura Sanità (J. ACM, 2013)

Some 0/1 polytopes need exponential size extended formulations. - Thomas Rothvoß (Math. Program., 2013)

Cover-Decomposition and Polychromatic Numbers. - Béla Bollobás; David Pritchard 001; Thomas Rothvoß; Alex D. Scott (SIAM J. Discret. Math., 2013)

Bin Packing via Discrepancy of Permutations. - Friedrich Eisenbrand; Dömötör Pálvölgyi; Thomas Rothvoß (ACM Trans. Algorithms, 2013)

A direct proof for Lovett's bound on the communication complexity of low rank matrices. - Thomas Rothvoß (CoRR, 2014)

A Lasserre-based $(1+ varepsilon)$-approximation for $Pm mid p_j=1, textrm{prec} mid C_{ max}$. - Elaine Levey; Thomas Rothvoss (CoRR, 2015)

Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms. - Robert I. Davis 001; Alan Burns 001; Sanjoy K. Baruah; Thomas Rothvoß; Laurent George 001; Oliver Gettings (Real Time Syst., 2015)

Lecture Notes on the ARV Algorithm for Sparsest Cut. - Thomas Rothvoss (CoRR, 2016)

Pricing on Paths: A PTAS for the Highway Problem. - Fabrizio Grandoni 001; Thomas Rothvoß (SIAM J. Comput., 2016)

Better Bin Packing Approximations via Discrepancy Theory. - Thomas Rothvoss (SIAM J. Comput., 2016)

An Improved Deterministic Rescaling for Linear Programming Algorithms. - Rebecca Hoberg; Thomas Rothvoss (IPCO, 2017)

Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. - Rebecca Hoberg; Harishchandra Ramadas; Thomas Rothvoss; Xin Yang 017 (IPCO, 2017)

Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. - Avi Levy; Harishchandra Ramadas; Thomas Rothvoss (IPCO, 2017)

A Logarithmic Additive Integrality Gap for Bin Packing. - Rebecca Hoberg; Thomas Rothvoss (SODA, 2017)

0/1 Polytopes with Quadratic Chvátal Rank. - Thomas Rothvoß; Laura Sanità (Oper. Res., 2017)

The Matching Polytope has Exponential Extension Complexity. - Thomas Rothvoss (J. ACM, 2017)

Constructive Discrepancy Minimization for Convex Sets. - Thomas Rothvoss (SIAM J. Comput., 2017)

A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. - Rebecca Hoberg; Thomas Rothvoss (SODA, 2019)

Scheduling with Communication Delays via LP Hierarchies and Clustering. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Jakub Tarnawski; Yihao Zhang (FOCS, 2020)

A Tale of Santa Claus, Hypergraphs and Matroids. - Sami Davies; Thomas Rothvoss; Yihao Zhang (SODA, 2020)

Linear Size Sparsifier and the Geometry of the Operator Norm Ball. - Victor Reis; Thomas Rothvoss (SODA, 2020)

Polynomiality for Bin Packing with a Constant Number of Item Types. - Michel X. Goemans; Thomas Rothvoss (J. ACM, 2020)

Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Jakub Tarnawski; Yihao Zhang (SODA, 2021)

Improved Analysis of Online Balanced Clustering. - Marcin Bienkowski; Martin Böhm 001; Martin Koutecký; Thomas Rothvoß; Jirí Sgall; Pavel Veselý 001 (WAOA, 2021)

Approximate CVP in time 20.802 n - now in any norm! - Thomas Rothvoss; Moritz Venzin (CoRR, 2021)

Tight bounds on the Fourier growth of bounded functions on the hypercube. - Siddharth Iyer; Anup Rao 001; Victor Reis; Thomas Rothvoss; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2021)

A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies. - Elaine Levey; Thomas Rothvoß (SIAM J. Comput., 2021)

Approximate $ mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm! - Thomas Rothvoss; Moritz Venzin (IPCO, 2022)

On the Hardness of Scheduling With Non-Uniform Communication Delays. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Sai Sandeep; Jakub Tarnawski; Yihao Zhang (SODA, 2022)

Approximate Carathéodory bounds via Discrepancy Theory. - Victor Reis; Thomas Rothvoss (CoRR, 2022)

The Vector Balancing Constant for Zonotopes. - Laurel Heck; Victor Reis; Thomas Rothvoss (CoRR, 2022)

The Vector Balancing Constant for Zonotopes. - Rainie Bozzai; Victor Reis; Thomas Rothvoss (FOCS, 2023)

The Subspace Flatness Conjecture and Faster Integer Programming. - Victor Reis; Thomas Rothvoss (FOCS, 2023)

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. - Sally Dong; Thomas Rothvoss (CoRR, 2023)

Stronger Coreset Bounds for Kernel Density Estimators via Chaining. - Rainie Bozzai; Thomas Rothvoss (CoRR, 2023)

Vector balancing in Lebesgue spaces. - Victor Reis; Thomas Rothvoss (Random Struct. Algorithms, 2023)

The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. - Sally Dong; Thomas Rothvoss (IPCO, 2024)

Optimal Online Discrepancy Minimization. - Janardhan Kulkarni; Victor Reis; Thomas Rothvoss (STOC, 2024)

A Geometric Perspective on the Injective Norm of Sums of Random Tensors. - Afonso S. Bandeira; Sivakanth Gopi; Haotian Jiang; Kevin Lucca; Thomas Rothvoss (CoRR, 2024)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory. - Jerry Chee; Arturs Backurs; Rainie Heck; Li Zhang; Janardhan Kulkarni; Thomas Rothvoss; Sivakanth Gopi (COLT, 2025)

Forall-exist statements in pseudopolynomial time. - Eleonore Bach; Friedrich Eisenbrand; Thomas Rothvoss; Robert Weismantel (SODA, 2025)

Tensor Concentration Inequalities: A Geometric Approach. - Afonso S. Bandeira; Sivakanth Gopi; Haotian Jiang; Kevin Lucca; Thomas Rothvoss (STOC, 2025)

A parameterized linear formulation of the integer hull. - Friedrich Eisenbrand; Thomas Rothvoss (CoRR, 2025)

From approximate to exact integer programming. - Daniel Dadush; Friedrich Eisenbrand; Thomas Rothvoss (Math. Program., 2025)