Dr. Daniel Schmidt

born Daniel Plümpe

Es handelt sich NICHT um den Daniel Schmidt des Prüfungsamtes Informatik!! Die Website des Prüfungsamtes für Informatik und Cybersecurity finden Sie hier.

Office	University of Bonn Institut for Computer Science V Room 2.071 Friedrich-Hirzebruch-Allee 8 (formerly Endenicher Allee 19a) D-53115 Bonn	Phone	+49 (228) 73 -60842
		Fax
		E-Mail	daniel.schmidt@uni-bonn.de
Postal address	Universität Bonn Institut für Informatik V Friedrich-Hirzebruch-Allee 5 53115 Bonn Deutschland

• Summer 2021: Lab: Efficient Algorithms for selected problems
• Winter 2020/21: Seminar: Advanced Algorithms
• Winter 2020/21: Advanced Algorithms (with Petra Mutzel)
• Summer 2020: Seminar: Foundations of Data Science
• Summer 2020: Randomized Algorithms and Probabilistic Analysis (with Heiko Röglin)
• Winter 2019/20: Lab: Efficient Algorithms for selected Problems
• Previous teaching at the University of Cologne

• Network design
• Primal-dual algorithms

• Combinatorial Optimization: Branch-and-bound, linear programming based algorithms
• Robust Optimization
• Steiner network problems
• Network design
• Clustering problems

* I. O. Bercea, M. Groß, S. Khuller, A. Kumar, C. Rösner, D. R. Schmidt, and M. Schmidt. On the Cost of Essentially Fair Clusterings. In APPROX 2019: 18:1–18:22. [DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.18] [arXiv:1811.10319]

* D. R. Schmidt, B. Zey, and F. Margot. An Exact Algorithm for the Steiner Forest Problem. In ESA 2018: 70:1–70:14. [DOI: 10.4230/LIPIcs.ESA.2018.70] [arXiv:1709.01124]

* M. Groß, A. Gupta, A. Kumar, J. Matuschke, D. R. Schmidt, M. Schmidt, and J. Verschae. A Local-Search Algorithm for Steiner Forest. In ITCS 2018: 31:1–31:17. [DOI:10.4230/LIPIcs.ITCS.2018.31] [arXiv:1707.02753]

* J.-P. W. Kappmeier, D. R. Schmidt, and M. Schmidt. Solving K-Means on High-Dimensional Big Data. In SEA 2015: 259–270. [DOI: 10.1007/978-3-319-20086-6_20] [arXiv:1502.04265]

* M. Groß, J.-P. W. Kappmeier, D. R. Schmidt, and M. Schmidt. Approximating Earliest Arrival Flows in Arbitrary Networks. In ESA 2012: 551-562. [DOI: 10.1007/978-3-642-33090-2_48]

* E. Álvarez-Miranda, V. Cacchiani, T. Dorneth, M. Jünger, F. Liers, A. Lodi, T. Parriani, and D. R. Schmidt. Models and Algorithms for Robust Network Design with Several Traffic Scenarios. In ISCO 2012: 261–272. [DOI: 10.1007/978-3-642-32147-4_24]

* D. Gaul, and D. R. Schmidt. Chvátal–Gomory cuts for the Steiner tree problem. Discrete Applied Mathematics. 2021. DOI: 10.1016/j.dam.2020.12.016

* D. Schmidt, B. Zey, and F. Margot. Stronger MIP formulations for the Steiner forest problem. Mathematical Programming. 2020. [DOI:10.1007/s10107-019-01460-6]

* C. E. Gounaris, and D. R. Schmidt. Generalized Hose Uncertainty in Single-Commodity Robust Network Design. Optimization Letters. 2019. [DOI: 10.1007/s11590-019-01427-8]

* V. Cacchiani, M. Jünger, F. Liers, A. Lodi, and D. R. Schmidt. Single-Commodity Robust Network Design with Finite and Hose Demand Sets. Mathematical Programming 157, no. 1, pp. 297–342. 2016. [DOI: 10.1007/s10107-016-0991-9] [OO.org]

* E. Álvarez-Miranda, V. Cacchiani, A. Lodi, T. Parriani, and D. R. Schmidt. Single-Commodity Robust Network Design Problem: Complexity, Instances and Heuristic Solutions. European Journal of Operational Research 238, no. 3, pp. 711–723. 2014. [DOI: 10.1016/j.ejor.2014.04.023]

* D. Dressler, M. Groß, J.-P. Kappmeier, T. Kelter, J. Kulbatzki, D. Plümpe, G. Schlechter, M. Schmidt, M. Skutella, and S. Temme. On the Use of Network Flow Techniques for Assigning Evacuees to Exits. Procedia Engineering 3, pp. 205–215. 2010. [DOI: 10.1016/j.proeng.2010.07.019]

* D. R. Schmidt. Robust Design of Single-Commodity Networks. Dissertation, Universität zu Köln, 2014. [KUPS]

* D. Plümpe. Versenden von Nachrichten in Kommunikationsnetzwerken. Diplomarbeit, TU Dortmund, 2009.

* Track B Best Paper Award at the European Symposium on Algorithms (ESA 2018)
(joint work with François Margot and Bernd Zey)

* Dissertationspreis der Gesellschaft für Operations Research e.V (GOR) 2015

* Best Student Paper Award at the European Symposium on Algorithms (ESA 2012)
(joint work with Martin Groß, Jan-Philipp W. Kappmeier and Melanie Schmidt)

* Winner of the InformatiCup 2007, a student's competition of the German Informatics Society (GI)
(joint group project with Martin Groß and Melanie Schmidt)