Optimizing a low-dimensional convex function over a high-dimensional cube. with S. Pokutta and R. Weismantel, to appear in SIAM Jounral on Optimization, 2022
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time with J. Cslovjecsek, F. Eisenbrand, L. Rohwedder and R. Weismantel, SODA 2021
On compact representations of Voronoi cells of lattices with G. Reuland and M. Schymura, Mathematical Programming, 2020
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem with S. Vempala and A. Vetta, ACM Transactions on Algorithms (TALG), 2019
On compact representations of Voronoi cells of lattices. with G. Reuland and M. Schymura. International Conference on Integer Programming and Combinatorial Optimization. Springer, Cham, 2019. S. 261-274
Faster Algorithms for Integer Programs with Block Structure. with F. Eisenbrand and K.-M. Klein. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
On the Economic Efficiency of the Combinatorial Clock Auction. with N. Bousquet, Y. Cai, and A. Vetta, 2016, Proceedings of the twenty-seventh annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1407-1423). Society for Industrial and Applied Mathematics.
Tight lower bounds for block-structured Integer Programs. with A. Lassota, K.-M. Klein, M. Koutecký, and A. Levin
Sparse Approximation Over the Cube. with S. Bruckmeier and R. Weismantel, preprint arXiv:2210.02738, 2022
Deciding whether a Lattice has an Orthonormal Basis is in co-NP. preprint arXiv:1910.03838, 2019
An algorithmic theory of integer programming. with F. Eisenbrand, K.-M. Klein, M. Koutecký, A. Levin, and S. Onn. arXiv preprint arXiv:1904.01361, 2019