Kreuzzahlrätsel: Sudokus waren gestern. - Martin Groß 001; Daniel Plümpe; Melanie Schmidt 001 (Inform. Spektrum, 2009)

Generalized Maximum Flows over Time. - Martin Groß 001; Martin Skutella (WAOA, 2011)

Approximating Earliest Arrival Flows in Arbitrary Networks. - Martin Groß 001; Jan-Philipp W. Kappmeier; Daniel R. Schmidt 001; Melanie Schmidt 001 (ESA, 2012)

Maximum Multicommodity Flows over Time without Intermediate Storage. - Martin Groß 001; Martin Skutella (ESA, 2012)

Approximation algorithms for complex network flow over time problems (Approximationsalgorithmen für komplexen Netzwerkfluss über Zeit Probleme) - Martin Groß 001 (2014)

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (ISAAC, 2015)

Graph orientation and flows over time. - Ashwin Arulselvan; Martin Groß 001; Martin Skutella (Networks, 2015)

A tight bound on the speed-up through storage for quickest multi-commodity flows. - Martin Groß 001; Martin Skutella (Oper. Res. Lett., 2015)

General Bounds for Incremental Maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001 (ICALP, 2017)

A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. - Samuel Fiorini; Martin Groß 001; Jochen Könemann; Laura Sanità (CoRR, 2017)

A Local-Search Algorithm for Steiner Forest. - Martin Groß 001; Anupam Gupta 001; Amit Kumar 001; Jannik Matuschke; Daniel R. Schmidt 001; Melanie Schmidt 001; José Verschae (ITCS, 2018)

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. - Samuel Fiorini; Martin Groß 001; Jochen Könemann; Laura Sanità (SODA, 2018)

Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (Algorithmica, 2018)

On the complexity of instationary gas flows. - Martin Groß 001; Marc E. Pfetsch; Martin Skutella (Oper. Res. Lett., 2018)

On the Cost of Essentially Fair Clusterings. - Ioana Oriana Bercea; Martin Groß 001; Samir Khuller; Aounon Kumar; Clemens Rösner; Daniel R. Schmidt 001; Melanie Schmidt 001 (APPROX-RANDOM, 2019)

Algorithmic results for potential-based flows: Easy and hard cases. - Martin Groß 001; Marc E. Pfetsch; Lars Schewe; Martin Schmidt 003; Martin Skutella (Networks, 2019)

Scheduling maintenance jobs in networks. - Fidaa Abed; Lin Chen 009; Yann Disser; Martin Groß 001; Nicole Megow; Julie Meißner; Alexander T. Richter; Roman Rischke (Theor. Comput. Sci., 2019)

General bounds for incremental maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001; Sandra Himburg (Math. Program., 2022)

Middle-mile optimization for next-day delivery. - Konstantinos Benidis; Georgios S. Paschos; Martin Groß 001; George Iosifidis (CoRR, 2023)