Universität zu Köln

Journal Article

Álvarez-Miranda, Eduardo, Cacchiani, Valentina, Lodi, Andrea, Parriani, Tiziano and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-commodity robust network design problem: Complexity, instances and heuristic solutions. European Journal of Operational Research, 238 (3). pp. 711-723. Elsevier.

Dressler, Daniel, Groß, Martin, Schlechter, Gordon, Schmidt, Melanie, Skutella, Martin, Temme, Sylvie, Kappmeier, Jan-Philipp W., Kelter, Timon, Kulbatzki, Joscha and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2010). On the Use of Network Flow Techniques for Assigning Evacuees to Exits. Procedia Engineering, 3. pp. 205-215. Elsevier.

Dressler, Daniel, Groß, Martin, Kappmeier, Jan-Philipp, Kelter, Timon, Kulbatzki, Joscha, Plümpe, Daniel ORCID: 0000-0001-7381-912X, Schlechter, Gordon, Schmidt, Melanie ORCID: 0000-0003-4856-3905, Skutella, Martin and Temme, Sylvie (2010). On the use of network flow techniques for assigning evacuees to exits. Procedia Engineering, 3. pp. 205-215. Amsterdam [u.a.]: Elsevier. ISSN 1877-7058

Book Section, Proceedings Item or annotation in a legal commentary

Bercea, Ioana Oriana, Groß, Martin, Khuller, Samir, Kumar, Aounon, Rösner, Clemens, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2019). On the Cost of Essentially Fair Clusterings. In: Approximation, randomization, and combinatorial optimization: algorithms and techniques : APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, 18:1-18:22. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 9783959771252

Groß, Martin, Gupta, Anupam, Kumar, Amit, Matuschke, Jannik, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Verschae, José (2018). A Local-Search Algorithm for Steiner Forest. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 31:1-31:17. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 978-3-95977-060-6

Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2015). Solving k-means on High-Dimensional Big Data. In: Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, pp. 259-270. Cham: Springer. ISBN 978-3-319-20085-9

Groß, Martin, Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2012). Approximating Earliest Arrival Flows in Arbitrary Networks. In: Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 551-562. Berlin: Springer. ISBN 978-3-642-33090-2

Álvarez-Miranda, Eduardo, Liers, Frauke, Lodi, Andrea, Parriani, Tiziano, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Cacchiani, Valentina, Dorneth, Tim and Jünger, Michael (2012). Models and Algorithms for Robust Network Design with Several Traffic Scenarios. In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, pp. 261-272. Springer-Verlag.

Preprints, Working Papers or Reports

Cacchiani, Valentina, Jünger, Michael, Liers, Frauke, Lodi, Andrea and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-Commodity Robust Network Design with Finite and Hose Demand Sets. Working Paper.

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mallach, Sven ORCID: 0000-0001-5335-0678 and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2011). Towards shortest longest edges in orthogonal graph drawing. ["eprint_fieldopt_monograph_type_preprint" not defined].

Thesis

Schmidt, Daniel Rainer ORCID: 0000-0001-7381-912X (2014). Robust Design of Single-Commodity Networks. PhD thesis, Universität zu Köln.