default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Groß 0001
Person information
- affiliation: Amazon Inc., Luxembourg
- affiliation (former): University of Waterloo, ON, Canada
- affiliation (former): RWTH Aachen, Germany
- affiliation (former): Technical University of Berlin, Institute of Mathematics, Germany
Other persons with the same name
- Martin Groß — disambiguation page
- Martin Groß 0002 — Technical University of Darmstadt, Institute of Sport Science, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Konstantinos Benidis, Georgios S. Paschos, Martin Groß, George Iosifidis:
Middle-mile optimization for next-day delivery. CoRR abs/2310.18388 (2023)- 2022
- [j8]Aaron Bernstein, Yann Disser
, Martin Groß, Sandra Himburg:
General bounds for incremental maximization. Math. Program. 191(2): 953-979 (2022)
2010 – 2019
- 2019
- [j7]Martin Groß, Marc E. Pfetsch, Lars Schewe, Martin Schmidt, Martin Skutella:
Algorithmic results for potential-based flows: Easy and hard cases. Networks 73(3): 306-324 (2019) - [j6]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: 107-121 (2019) - [c10]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: 18:1-18:22 - 2018
- [j5]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80(1): 185-208 (2018) - [j4]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the complexity of instationary gas flows. Oper. Res. Lett. 46(3): 286-290 (2018) - [c9]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - [c8]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA 2018: 817-831 - [i8]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 abs/1811.10319 (2018) - 2017
- [c7]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: 19-30 - [c6]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. ICALP 2017: 43:1-43:14 - [i7]Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. CoRR abs/1701.08809 (2017) - [i6]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR abs/1702.05567 (2017) - [i5]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. CoRR abs/1705.10253 (2017) - [i4]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. CoRR abs/1707.02753 (2017) - [i3]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the Complexity of Instationary Gas Flows. CoRR abs/1708.08748 (2017) - 2015
- [j3]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph orientation and flows over time. Networks 66(3): 196-209 (2015) - [j2]Martin Groß, Martin Skutella:
A tight bound on the speed-up through storage for quickest multi-commodity flows. Oper. Res. Lett. 43(1): 93-95 (2015) - [c5]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC 2015: 176-187 - 2014
- [b1]Martin Groß:
Approximation algorithms for complex network flow over time problems (Approximationsalgorithmen für komplexen Netzwerkfluss über Zeit Probleme). TU Berlin, Germany, 2014 - [c4]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows over Time. ISAAC 2014: 741-752 - [i2]Martin Groß, Martin Skutella:
A tight bound on the speed-up through storage for quickest multi-commodity flows. CoRR abs/1406.4799 (2014) - [i1]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows Over Time. CoRR abs/1409.3081 (2014) - 2012
- [c3]Martin Groß, Martin Skutella:
Maximum Multicommodity Flows over Time without Intermediate Storage. ESA 2012: 539-550 - [c2]Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Approximating Earliest Arrival Flows in Arbitrary Networks. ESA 2012: 551-562 - 2011
- [c1]Martin Groß, Martin Skutella:
Generalized Maximum Flows over Time. WAOA 2011: 247-260
2000 – 2009
- 2009
- [j1]Martin Groß, Daniel Plümpe, Melanie Schmidt:
Kreuzzahlrätsel: Sudokus waren gestern. Inform. Spektrum 32(6): 538-545 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-12 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
