Cayley Graphs as Interconnection Networks: A Case Study. - Michael Sampels (Parcella, 1996)

Massively parallel architectures and systolic communication. - Michael Sampels (PDP, 1997)

Large Networks with Small Diameter. - Michael Sampels (WG, 1997)

Algebraische Konstruktion effizienter Verbindungsnetzwerke. - Michael Sampels (Logos Verlag, 1998)

Symmetric Interconnection Networks in the Design of Switches for WANs and LANs. - Michael Sampels; Mykhailo Vilents (MMB (Kurzvorträge), 1999)

Visualization of Automorphisms and Vertex-Symmetry. - Michael Sampels (PPAM, 2001)

A MAX-MIN Ant System for the University Course Timetabling Problem. - Krzysztof Socha; Joshua D. Knowles; Michael Sampels (Ant Algorithms, 2002)

Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. - Christian Blum 001; Michael Sampels (IEEE Congress on Evolutionary Computation, 2002)

On A Particularity In Model-based Search. - Christian Blum 001; Michael Sampels; Mark Zlochin (GECCO, 2002)

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. - Olivia Rossi-Doria; Michael Sampels; Mauro Birattari; Marco Chiarandini; Marco Dorigo; Luca Maria Gambardella; Joshua D. Knowles; Max Manfrin; Monaldo Mastrolilli; Ben Paechter; Luís Paquete; Thomas Stützle (PATAT, 2002)

When Model Bias Is Stronger than Selection Pressure. - Christian Blum 001; Michael Sampels (PPSN, 2002)

Metaheuristics for Group Shop Scheduling. - Michael Sampels; Christian Blum 001; Monaldo Mastrolilli; Olivia Rossi-Doria (PPSN, 2002)

Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art. - Krzysztof Socha; Michael Sampels; Max Manfrin (EvoWorkshops, 2003)

On Generalized Moore Digraphs. - Michael Sampels (PPAM, 2003)

Vertex-symmetric generalized Moore graphs. - Michael Sampels (Discret. Appl. Math., 2004)

An Ant Colony Optimization Algorithm for Shop Scheduling Problems. - Christian Blum 001; Michael Sampels (J. Math. Model. Algorithms, 2004)

Editorial. - Christian Blum 001; Andrea Roli; Michael Sampels (J. Math. Model. Algorithms, 2006)