Martin Groß

Orcid: 0000-0001-9220-5289

Affiliations:

Amazon Inc., Luxembourg
University of Waterloo, ON, Canada (former)
RWTH Aachen, Germany (former)
Technical University of Berlin, Institute of Mathematics, Germany (former)

According to our database¹, Martin Groß authored at least 19 papers between 2009 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Middle-mile optimization for next-day delivery.

[BibT_eX]

[DOI]

CoRR, 2023

2022

General bounds for incremental maximization.

[BibT_eX]

[DOI]

Math. Program., 2022

2019

Scheduling maintenance jobs in networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Algorithmic results for potential-based flows: Easy and hard cases.

[BibT_eX]

[DOI]

Networks, 2019

On the Cost of Essentially Fair Clusterings.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

On the complexity of instationary gas flows.

[BibT_eX]

[DOI]

Martin Groß

Marc E. Pfetsch

Martin Skutella

Oper. Res. Lett., 2018

Matchings with Lower Quotas: Algorithms and Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2018

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Local-Search Algorithm for Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.

[BibT_eX]

[DOI]

CoRR, 2017

General Bounds for Incremental Maximization.

[BibT_eX]

[DOI]

Aaron Bernstein

Yann Disser

Martin Groß

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2015

A tight bound on the speed-up through storage for quickest multi-commodity flows.

[BibT_eX]

[DOI]

Martin Groß

Martin Skutella

Oper. Res. Lett., 2015

Graph orientation and flows over time.

[BibT_eX]

[DOI]

Ashwin Arulselvan

Martin Groß

Martin Skutella

Networks, 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Approximation algorithms for complex network flow over time problems (Approximationsalgorithmen für komplexen Netzwerkfluss über Zeit Probleme)

[BibT_eX]

[DOI]

Martin Groß

PhD thesis, 2014

2012

Maximum Multicommodity Flows over Time without Intermediate Storage.

[BibT_eX]

[DOI]

Martin Groß

Martin Skutella

Proceedings of the Algorithms - ESA 2012, 2012

Approximating Earliest Arrival Flows in Arbitrary Networks.

[BibT_eX]

[DOI]

Martin Groß

Jan-Philipp W. Kappmeier

Daniel R. Schmidt

Melanie Schmidt

Proceedings of the Algorithms - ESA 2012, 2012

2011

Generalized Maximum Flows over Time.

[BibT_eX]

[DOI]

Martin Groß

Martin Skutella

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2009

Kreuzzahlrätsel: Sudokus waren gestern.

[BibT_eX]

[DOI]

Martin Groß

Daniel Plümpe

Melanie Schmidt

Inform. Spektrum, 2009

Martin Groß

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...