Martin Groß

Available identifiers

Publication	Date of Publication	Type
On the cost of essentially fair clusterings	2023-02-03	Paper
General bounds for incremental maximization	2022-03-22	Paper
A local-search algorithm for Steiner forest	2021-06-15	Paper
General bounds for incremental maximization	2020-05-27	Paper
Maximizing the storage capacity of gas networks: a global MINLP approach	2019-10-29	Paper
Algorithmic results for potential‐based flows: Easy and hard cases	2019-07-30	Paper
On the complexity of instationary gas flows	2019-06-11	Paper
Scheduling maintenance jobs in networks	2018-12-04	Paper
A tight bound on the speed-up through storage for quickest multi-commodity flows	2018-09-28	Paper
Graph orientation and flows over time	2018-05-23	Paper
https://portal.mardi4nfdi.de/entity/Q4607935	2018-03-15	Paper
Matchings with lower quotas: algorithms and complexity	2018-02-28	Paper
On the Complexity of Instationary Gas Flows	2017-08-29	Paper
Scheduling maintenance jobs in networks	2017-07-21	Paper
Many-to-one matchings with lower quotas: algorithms and complexity	2016-01-11	Paper
Graph orientation and flows over time	2015-09-11	Paper
Approximating Earliest Arrival Flows in Arbitrary Networks	2012-09-25	Paper
Maximum multicommodity flows over time without intermediate storage	2012-09-25	Paper
Generalized Maximum Flows over Time	2012-07-16	Paper

This page was built for person: Martin Groß