Kreuzzahlrätsel: Sudokus waren gestern. - Martin Groß 001; Daniel Plümpe; Melanie Schmidt 001 (Inform. Spektrum, 2009)

Approximating Earliest Arrival Flows in Arbitrary Networks. - Martin Groß 001; Jan-Philipp W. Kappmeier; Daniel R. Schmidt 001; Melanie Schmidt 001 (ESA, 2012)

Models and Algorithms for Robust Network Design with Several Traffic Scenarios. - Eduardo Álvarez-Miranda; Valentina Cacchiani; Tim Dorneth; Michael Jünger; Frauke Liers; Andrea Lodi 001; Tiziano Parriani; Daniel R. Schmidt 001 (ISCO, 2012)

Single-commodity robust network design problem: Complexity, instances and heuristic solutions. - Eduardo Álvarez-Miranda; Valentina Cacchiani; Andrea Lodi 001; Tiziano Parriani; Daniel R. Schmidt 001 (Eur. J. Oper. Res., 2014)

Robust Design of Single-Commodity Networks - Daniel R. Schmidt 001 (2014)

Solving k-means on High-Dimensional Big Data. - Jan-Philipp W. Kappmeier; Daniel R. Schmidt 001; Melanie Schmidt 001 (SEA, 2015)

Single-commodity robust network design with finite and Hose demand sets. - Valentina Cacchiani; Michael Jünger; Frauke Liers; Andrea Lodi 001; Daniel R. Schmidt 001 (Math. Program., 2016)

MIP Formulations for the Steiner Forest Problem. - Daniel R. Schmidt 001; Bernd Zey; François Margot (CoRR, 2017)

An Exact Algorithm for the Steiner Forest Problem. - Daniel R. Schmidt 001; Bernd Zey; François Margot (ESA, 2018)

A Local-Search Algorithm for Steiner Forest. - Martin Groß 001; Anupam Gupta 001; Amit Kumar 001; Jannik Matuschke; Daniel R. Schmidt 001; Melanie Schmidt 001; José Verschae (ITCS, 2018)

On the Cost of Essentially Fair Clusterings. - Ioana Oriana Bercea; Martin Groß 001; Samir Khuller; Aounon Kumar; Clemens Rösner; Daniel R. Schmidt 001; Melanie Schmidt 001 (APPROX-RANDOM, 2019)

Generalized Hose uncertainty in single-commodity robust network design. - Chrysanthos E. Gounaris; Daniel R. Schmidt 001 (Optim. Lett., 2020)

Chvátal-Gomory cuts for the Steiner tree problem. - Daniela Gaul; Daniel R. Schmidt 001 (Discret. Appl. Math., 2021)

Stronger MIP formulations for the Steiner forest problem. - Daniel R. Schmidt 001; Bernd Zey; François Margot (Math. Program., 2021)

Correction to: Stronger MIP formulations for the Steiner forest problem. - Daniel R. Schmidt 001; Bernd Zey; François Margot (Math. Program., 2021)

Finding all minimum cost flows and a faster algorithm for the K best flow problem. - David Könen; Daniel R. Schmidt 001; Christiane Spisla (Discret. Appl. Math., 2022)

Local Search k-means++ with Foresight. - Theo Conrads; Lukas Drexler; Joshua Könen; Daniel R. Schmidt 001; Melanie Schmidt 001 (SEA, 2024)

algo-hhu/FLSpp. - Lukas Drexler; Joshua Könen; Daniel R. Schmidt 001; Melanie Schmidt 001; Giulia Baldini 001 (DROPS Artifacts, 2024)