Schulz, Andreas S.;Telha, Claudio.Integer Factorization: Why Two-Item Joint Replenishment Is Hard.Operations Research.2022

Tsigonias-Dimitriadis, Alexandros.Lotteries, Prophets, and Pandora’s Box: A New Take on Classic Problems in Mechanism Design and Online Selection.2022.Dissertation.166 p.

Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, Themistoklis.On the Smoothed Complexity of Combinatorial Local Search.2022

Friesecke, Gero;Schulz, Andreas S.;Vögler, Daniela.Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems.SIAM Journal on Scientific Computing.2022.44.3.A1632-A1654

Giannakopoulos, Yiannis;Noarov, Georgy;Schulz, Andreas S..Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses.Mathematics of Operations Research.2022.47.1.643-664

Borgwardt, Steffen;Brugger, Matthias.Circuits in Extended Formulations.CoRR.2022.abs/2208.05467

Waldmann, Clara.Congestion Games: Equilibria, Networks, and Complexity.2022.Dissertation

Martin, Layla;Minner, Stefan;Poças, Diogo;Schulz, Andreas S..The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems.Transp. Sci..2021.55.6.1232--1259

Chalermsook, Parinya;Kaul, Matthias;Mnich, Matthias;Spoerhase, Joachim;Uniyal, Sumedha;Vaz, Daniel.Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter.CoRR.2021.abs/2111.06299

Chalermsook, Parinya;Das, Syamantak;Kook, Yunbum;Laekhanukit, Bundit;Liu, Yang P.;Peng, Richard;Sellke, Mark;Vaz, Daniel.Vertex Sparsification for Edge Connectivity.SODA.USA.SIAM.2021