Approximate CVPp in Time 20.802 n. - Friedrich Eisenbrand; Moritz Venzin (ESA, 2020)

Approximate $ mathrm{CVP}_{ infty}$ in time $2^{0.802 , n}$. - Friedrich Eisenbrand; Moritz Venzin (CoRR, 2020)

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. - Jana Cslovjecsek; Friedrich Eisenbrand; Michal Pilipczuk; Moritz Venzin; Robert Weismantel (ESA, 2021)

A QPTAS for stabbing rectangles. - Friedrich Eisenbrand; Martina Gallato; Ola Svensson; Moritz Venzin (CoRR, 2021)

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

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

Covering Convex Bodies and the Closest Vector Problem. - Márton Naszódi; Moritz Venzin (Discret. Comput. Geom., 2022)

Approximate CVPp in time 20.802n. - Friedrich Eisenbrand; Moritz Venzin (J. Comput. Syst. Sci., 2022)

Approximation algorithms for combinatorial optimization with predictions. - Antonios Antoniadis 001; Marek Eliás 001; Adam Polak 001; Moritz Venzin (ICLR, 2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems. - Sander Borst; Marek Eliás 001; Moritz Venzin (SODA, 2025)

Learning-Augmented Online Covering Problems. - Afrouz Jabal Ameli; Laura Sanità; Moritz Venzin (CoRR, 2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs. - Sander Borst; Moritz Venzin (CoRR, 2025)