Hauptinhalt

Publications

Conferences

• J. Busch, J. Ziegler, C. Aue, A. Ross, D. Sawitzki, and W. Banzhaf (2002).
  Automatic Generation of Control Programs for Walking Robots Using Genetic Programming.
  EuroGP 2002, LNCS 2278, Springer, 258-267.
  Volume at Springer Online, PDF (© Springer-Verlag, 155K), Pictures
• D. Sawitzki (2002).
  Implizite Algorithmen für Graphprobleme. (Implicit Algorithms for Graph Problems.)
  Informatiktage 2002, Konradin Verlag, 53-57. In German.
  PDF (73K), Pictures
• D. Sawitzki (2004).
  A Symbolic Approach to the All-Pairs Shortest-Paths Problem.
  WG 2004, LNCS 3353, Springer, 154-167.
  Volume at Springer Online, PDF (© Springer-Verlag, 250K), Pictures
• D. Sawitzki (2004).
  Experimental Studies of Symbolic Shortest-Path Algorithms.
  WEA 2004, LNCS 3059, Springer, 482-497.
  Volume at Springer Online, PDF (© Springer-Verlag, 316K), Pictures
• D. Sawitzki (2004).
  Implicit Flow Maximization by Iterative Squaring.
  SOFSEM 2004, LNCS 2932, Springer, 301-313.
  Volume at Springer Online, PDF (© Springer-Verlag, 254K), PDF (extended version, 350K), Pictures
• D. Sawitzki (2005).
  Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.
  SOFSEM 2005, LNCS 3381, Springer, 298-309.
  Volume at Springer Online, PDF (© Springer-Verlag, 205K), PDF (extended version, 218K), Pictures
• D. Sawitzki (2005).
  On Symbolic Scheduling Independent Tasks with Restricted Execution Times.
  WEA 2005, LNCS 3503, Springer, 277-289.
  Volume at Springer Online, PDF (© Springer-Verlag, 402K), Pictures
• D. Sawitzki (2006).
  Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
  LATIN 2006, LNCS 3887, Springer, 781-792.
  Volume at Springer Online, PDF (© Springer-Verlag, 486K), PDF (extended version, 181K), Pictures
• D. Sawitzki (2006).
  The Complexity of Problems on Implicitly Represented Inputs.
  SOFSEM 2006, LNCS 3831, Springer, 471-482.
  Volume at Springer Online, PDF (© Springer-Verlag, 393K), PDF (extended version, 175K), Pictures

Journals

• D. Sawitzki (2007).
  Lower Bounds on the OBDD Size of Two Fundamental Functions' Graphs.
  IPL 101(2), 66-71.
  IPL at ScienceDirect

Book Contributions

• M. Nunkesser and D. Sawitzki (2005).
  Blockmodels.
  Chapter 10 in Network Analysis, U. Brandes and T. Erlebach (Eds.), LNCS Tutorial 3418, Springer, 253-292.
  Volume at Springer Online

Theses

• D. Sawitzki (2002).
  Implizite Algorithmen für Graphprobleme. (Implicit Algorithms for Graph Problems.)
  Diploma thesis, University of Dortmund. In German.
• D. Sawitzki (2006).
  Algorithmik und Komplexität OBDD-repräsentierter Graphen. (Algorithmic Aspects and Complexity of OBDD-Represented Graphs.)
  PhD thesis, University of Dortmund. In German.
  PDF (1,453K)

---

Reports

• S.R. Abdallah, C. Aue, A. Benkacem, M. Gregorius, A. Ross, D. Sawitzki, V. Strunk, H. Türk, and M.-C. Varcol (2001).
  Simulator für GP-evolvierte Laufrobotersteuerungsprogramme. (Simulator for GP-Evolved Walking Robot Control Programs.)
  Technical report, University of Dortmund. In German.
  PDF (3,226K)
• D. Sawitzki (2000).
  Multiresolution Mesh Morphing.
  Seminar paper. In German.
  Gzipped PS (1,885K)
• D. Sawitzki (2004).
  Implicit Flow Maximization on Grid Networks.
  Technical report, University of Dortmund.
  PDF (234K)
• D. Sawitzki (2004).
  Implicit Maximization of Flows over Time.
  Technical report, University of Dortmund.
  PDF (211K)
• D. Sawitzki (2004).
  On Graphs with Characteristic Bounded-Width Functions.
  Technical report, University of Dortmund.
  PDF (272K)
• D. Sawitzki (2007).
  Implicit Simulation of FNC Algorithms.
  ECCC Report TR07-028.
  ECCC Online

---

Daniel Sawitzki, 25.3.2007