On the Cost of Essentially Fair Clusterings MS Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner ... Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 131* | 2019 |
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 | 48 | 2010 |
Single-commodity robust network design with finite and hose demand sets V Cacchiani, M Jünger, F Liers, A Lodi, DR Schmidt Mathematical Programming 157 (1), 297-342, 2016 | 34 | 2016 |
Approximating earliest arrival flows in arbitrary networks M Groß, JPW Kappmeier, DR Schmidt, M Schmidt European Symposium on Algorithms, 551-562, 2012 | 28 | 2012 |
A Local-Search Algorithm for Steiner Forest J Matuschke, M Groß, A Gupta, A Kumar, DR Schmidt, M Schmidt, ... Leibniz International Proceedings in Informatics, 31: 1-31: 17, 2018 | 16* | 2018 |
Single-commodity robust network design problem: Complexity, instances and heuristic solutions E Álvarez-Miranda, V Cacchiani, A Lodi, T Parriani, DR Schmidt European Journal of Operational Research 238 (3), 711-723, 2014 | 14 | 2014 |
Models and algorithms for robust network design with several traffic scenarios E Álvarez-Miranda, V Cacchiani, T Dorneth, M Jünger, F Liers, A Lodi, ... International Symposium on Combinatorial Optimization, 261-272, 2012 | 13 | 2012 |
Stronger MIP formulations for the Steiner forest problem D Schmidt, B Zey, F Margot Mathematical Programming 186 (1), 373-407, 2021 | 6 | 2021 |
Solving k-means on High-Dimensional Big Data MS Jan-Philipp W. Kappmeier, Daniel R. Schmidt Lecture Note in Computer Science, Experimental Algorithms, Proceedings of …, 2015 | 5* | 2015 |
Robust Design of Single-Commodity Networks DR Schmidt Universität zu Köln, 2014 | 5 | 2014 |
Finding all minimum cost flows and a faster algorithm for the K best flow problem D Könen, D Schmidt, C Spisla Discrete Applied Mathematics 321, 333-349, 2022 | 4 | 2022 |
MIP Formulations for the Steiner Forest Problem D Schmidt, B Zey, F Margot arXiv preprint arXiv:1709.01124, 2017 | 4 | 2017 |
Anonymization via clustering of locations in road networks JH Haunert, D Schmidt, M Schmidt | 3 | 2021 |
Chvátal–Gomory cuts for the Steiner tree problem D Gaul, DR Schmidt Discrete Applied Mathematics 291, 188-200, 2021 | 3 | 2021 |
Generalized Hose uncertainty in single-commodity robust network design CE Gounaris, DR Schmidt Optimization Letters 14 (4), 925-944, 2020 | 3 | 2020 |
Applying Graph-based Clustering to Tracklet-Tracklet Correlation F Griese, K Rack, S Schmitz, H Fiedler, B Hofmann, M Schmidt, D Schmidt Proceedings of the International Astronautical Congress, IAC, 2022 | 2 | 2022 |
Robust Network Design AMCA Koster, DR Schmidt Network Design with Applications to Transportation and Logistics, 317-343, 2021 | 2 | 2021 |
An Exact Algorithm for the Steiner Forest Problem DR Schmidt, B Zey, F Margot 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 1 | 2018 |
Kreuzzahlrätsel M Groß, JP Kappmeier, D Plümpe, M Schmidt Mitteilungen der Deutschen Mathematiker-Vereinigung 18 (2), 118-118, 2010 | | 2010 |
Kreuzzahlrätsel: Sudokus waren gestern M Groß, D Plümpe, M Schmidt Informatik-Spektrum 32 (6), 538-545, 2009 | | 2009 |