On the cost of essentially fair clusterings IO Bercea, M Groß, S Khuller, A Kumar, C Rösner, DR Schmidt, ... arXiv preprint arXiv:1811.10319, 2018 | 120 | 2018 |
Approximating weighted tree augmentation via Chvátal-Gomory cuts S Fiorini, M Groß, J Könemann, L Sanità Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 63* | 2018 |
On the use of network flow techniques for assigning evacuees to exits D Dressler, M Groß, JP Kappmeier, T Kelter, J Kulbatzki, D Plümpe, ... Procedia Engineering 3, 205-215, 2010 | 47 | 2010 |
Maximizing the storage capacity of gas networks: a global MINLP approach R Burlacu, H Egger, M Groß, A Martin, ME Pfetsch, L Schewe, M Sirvent, ... Optimization and Engineering 20 (2), 543-573, 2019 | 41 | 2019 |
Algorithmic results for potential‐based flows: Easy and hard cases M Groß, ME Pfetsch, L Schewe, M Schmidt, M Skutella Networks 73 (3), 306-324, 2019 | 41 | 2019 |
Generalized maximum flows over time M Groß, M Skutella Approximation and Online Algorithms: 9th International Workshop, WAOA 2011 …, 2012 | 40 | 2012 |
Matchings with lower quotas: Algorithms and complexity A Arulselvan, Á Cseh, M Groß, DF Manlove, J Matuschke Algorithmica 80, 185-208, 2018 | 27 | 2018 |
Approximating earliest arrival flows in arbitrary networks M Groß, JPW Kappmeier, DR Schmidt, M Schmidt Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012 | 27 | 2012 |
Approximation Algorithms for Complex Network Flow Over Time Problems M Groß | 20 | 2014 |
Maximum multicommodity flows over time without intermediate storage M Groß, M Skutella European Symposium on Algorithms, 539-550, 2012 | 20 | 2012 |
A local-search algorithm for Steiner forest M Groß, A Gupta, A Kumar, J Matuschke, DR Schmidt, M Schmidt, ... arXiv preprint arXiv:1707.02753, 2017 | 15 | 2017 |
General bounds for incremental maximization A Bernstein, Y Disser, M Groß, S Himburg Mathematical Programming 191 (2), 953-979, 2022 | 12 | 2022 |
Scheduling maintenance jobs in networks F Abed, L Chen, Y Disser, M Groß, N Megow, J Meißner, AT Richter, ... Theoretical Computer Science 754, 107-121, 2019 | 11 | 2019 |
A tight bound on the speed-up through storage for quickest multi-commodity flows M Groß, M Skutella Operations Research Letters 43 (1), 93-95, 2015 | 8 | 2015 |
A global optimization approach for instationary gas transport in pipeline networks R Burlacu, H Egger, M Groß, A Martin, M Pfetsch, L Schewe, M Sirvent, ... | 6 | 2018 |
Graph orientation and flows over time A Arulselvan, M Groß, M Skutella Networks 66 (3), 196-209, 2015 | 3 | 2015 |
Graph orientation and flows over time A Arulselvan, M Groß, M Skutella International Symposium on Algorithms and Computation, 741-752, 2014 | 3 | 2014 |
Flows over time with commodity-dependent transit times M Groß Diplomarbeit (= Master's Thesis), TU Dortmund, 2009 | 2 | 2009 |
On the complexity of instationary gas flows M Groß, ME Pfetsch, M Skutella Operations Research Letters 46 (3), 286-290, 2018 | 1 | 2018 |
Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken P Domschke, M Groß, FM Hante, B Hiller, L Schewe, M Schmidt gwf-Gas+ Energie 156 (11), 880-885, 2015 | 1 | 2015 |