On the Complexity of Train Assignment Problems. - Thomas Erlebach; Martin Gantenbein; Daniel Hürlimann; Gabriele Neyer; Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (ISAAC, 2001)

Server Placements, Roman Domination and other Dominating Set Variants. - Aris Pagourtzis; Paolo Penna; Konrad Schlude; Kathleen Steinhöfel; David Scot Taylor; Peter Widmayer (IFIP TCS, 2002)

Distributed Highly Available Search Trees. - Konrad Schlude; Eljas Soisalon-Soininen; Peter Widmayer (SIROCCO, 2002)

Distributed data & resources: models, tractability, and complexity. - Konrad Schlude (2002)

Improving Customer Proximity to Railway Stations. - Evangelos Kranakis; Paolo Penna; Konrad Schlude; David Scot Taylor; Peter Widmayer (CIAC, 2003)

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. - Konrad Schlude; Eljas Soisalon-Soininen; Peter Widmayer (Theory Comput. Syst., 2003)

On the Complexity of Variations of Equal Sum Subsets. - Mark Cieliebak; Stephan J. Eidenbenz; Aris Pagourtzis; Konrad Schlude (Nord. J. Comput., 2008)