Martin Groß

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 20

Top Topics

Top Venues

Oper. Res. Lett.

Publications

Konstantinos Benidis, Georgios S. Paschos, Martin Groß, George Iosifidis
Middle-mile optimization for next-day delivery. CoRR (2023)
Aaron Bernstein, Yann Disser, Martin Groß, Sandra Himburg
General bounds for incremental maximization. Math. Program. 191 (2) (2022)
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM (2019)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling maintenance jobs in networks. Theor. Comput. Sci. 754 (2019)
Martin Groß, Marc E. Pfetsch, Lars Schewe, Martin Schmidt, Martin Skutella
Algorithmic results for potential-based flows: Easy and hard cases. Networks 73 (3) (2019)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. ITCS (2018)
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
On the cost of essentially fair clusterings. CoRR (2018)
Martin Groß, Marc E. Pfetsch, Martin Skutella
On the complexity of instationary gas flows. Oper. Res. Lett. 46 (3) (2018)
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA (2018)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80 (1) (2018)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CIAC (2017)
Aaron Bernstein, Yann Disser, Martin Groß
General Bounds for Incremental Maximization. CoRR (2017)
Martin Groß, Marc E. Pfetsch, Martin Skutella
On the Complexity of Instationary Gas Flows. CoRR (2017)
Aaron Bernstein, Yann Disser, Martin Groß
General Bounds for Incremental Maximization. ICALP (2017)
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR (2017)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CoRR (2017)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. CoRR (2017)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC (2015)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph orientation and flows over time. Networks 66 (3) (2015)
Martin Groß, Martin Skutella
A tight bound on the speed-up through storage for quickest multi-commodity flows. Oper. Res. Lett. 43 (1) (2015)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph Orientation and Flows Over Time. CoRR (2014)
Martin Groß, Martin Skutella
A tight bound on the speed-up through storage for quickest multi-commodity flows. CoRR (2014)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph Orientation and Flows over Time. ISAAC (2014)
Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
Approximating Earliest Arrival Flows in Arbitrary Networks. ESA (2012)
Martin Groß, Martin Skutella
Maximum Multicommodity Flows over Time without Intermediate Storage. ESA (2012)
Martin Groß, Martin Skutella
Generalized Maximum Flows over Time. WAOA (2011)
Martin Groß, Daniel Plümpe, Melanie Schmidt
Kreuzzahlrätsel: Sudokus waren gestern. Inform. Spektrum 32 (6) (2009)