Automatic Generation of Control Programs for Walking Robots Using Genetic Programming. - Jens Busch; Jens Ziegler 001; Christian Aue; Andree Roß; Daniel Sawitzki; Wolfgang Banzhaf (EuroGP, 2002)

Blockmodels. - Marc Nunkesser; Daniel Sawitzki (Network Analysis, 2004)

Implicit Flow Maximization by Iterative Squaring. - Daniel Sawitzki (SOFSEM, 2004)

Experimental Studies of Symbolic Shortest-Path Algorithms. - Daniel Sawitzki (WEA, 2004)

A Symbolic Approach to the All-Pairs Shortest-Paths Problem. - Daniel Sawitzki (WG, 2004)

Lower Bounds on the OBDD Size of Graphs of Some Popular Functions. - Daniel Sawitzki (SOFSEM, 2005)

On Symbolic Scheduling Independent Tasks with Restricted Execution Times. - Daniel Sawitzki (WEA, 2005)

Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms. - Daniel Sawitzki (LATIN, 2006)

The Complexity of Problems on Implicitly Represented Inputs. - Daniel Sawitzki (SOFSEM, 2006)

Algorithmik und Komplexität OBDD-repräsentierter Graphen. - Daniel Sawitzki (2006)

Implicit Simulation of FNC Algorithms. - Daniel Sawitzki (Electron. Colloquium Comput. Complex., 2007)

Lower bounds on the OBDD size of two fundamental functions' graphs. - Daniel Sawitzki (Inf. Process. Lett., 2007)