A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules. - Udo Hönig; Wolfram Schiffmann (GCC (2), 2003)

Fast Optimal Task Graph Scheduling by Means of an Optimized Parallel A*-Algorithm. - Udo Hönig; Wolfram Schiffmann (PDPTA, 2004)

Internet-basierter Übungsbetrieb in Technischer Informatik (Web-Based Exercises in Computer Engineering). - Udo Hönig; Jörg Keller 001; Wolfram Schiffmann (it Inf. Technol., 2004)

An ACO-Based Approach for Scheduling Task Graphs with Communication Costs. - Markus Bank; Udo Hönig; Wolfram Schiffmann (ICPP, 2005)

Improving the Efficiency of Functional Parallelism by Means of Hyper-Scheduling. - Udo Hönig; Wolfram Schiffmann (ICPP Workshops, 2006)

Fault-tolerant static scheduling for grids. - Bernhard Fechner; Udo Hönig; Jörg Keller 001; Wolfram Schiffmann (IPDPS, 2008)

Synergiepotenziale zwischen Grid- und eScience-Technologien für die digitale Langzeitarchivierung. - Udo Hönig; Wolfram Schiffmann (2009)

A parallel shifting bottleneck heuristic for scheduling complex job shops: Architecture and performance assessment. - Rene Driessel; Udo Hönig; Lars Mönch; Wolfram Schiffmann (CASE, 2010)