Chair of Algorithm Engineering
Department of Computer Science
TU Dortmund

Room:	238
Phone:	+49 231 755-7707
Fax:	+49 231 755-7740
E-Mail:	bernd.zeytu-dortmund.de

• Algorithm Engineering
• Combinatorial Optimization
• Graph Algorithms, Network Design Problems (in particular Steiner tree problems)
• Integer Programming, Branch&Cut, Benders Decomposition
• Stochastic (Integer) Programming, 2-Stage Branch&Cut, (Integer) L-Shaped Method

• Stochastic Survivable Network Design Problems
  Ivana Ljubic, Petra Mutzel, and Bernd Zey
  International Network Optimization Conference (INOC)
  Electronic Notes in Discrete Mathematics (ENDM), 2013, to appear

• Parameterized Algorithms for Stochastic Steiner Tree Problems
  Denis Kurz, Petra Mutzel and Bernd Zey
  Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2012)
  Lecture Notes in Computer Science 7721, Springer-Verlag, 2013, pp.143-154

• The Stochastic Steiner Tree Problem on Partial k-Trees
  Fritz Boekler, Petra Mutzel and Bernd Zey
  Proceedings of the Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS) 2012, NOVPRESS Brno, October 2012

• Improved Steiner Tree Algorithms for Bounded Treewidth
  Markus Chimani, Petra Mutzel, and Bernd Zey
  International Workshop on Combinatorial Algorithms (IWOCA 2011)
  Lecture Notes in Computer Science 7056, Springer-Verlag, 2011, pp. 374-386.

• Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
  Immanuel Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, and Bernd Zey
  in: 21st International Symposium on Algorithms and Computation (ISAAC 2010)
  Lecture Notes in Computer Science 6506, Springer-Verlag, 2010, pp. 427-439

• Planar Biconnectivity Augmentation With Fixed Embedding
  Carsten Gutwenger, Petra Mutzel, and Bernd Zey
  in: 20th International Workshop on Combinatorial Algorithms 2009 (IWOCA 2009)
  Lecture Notes in Computer Science 5874, Springer-Verlag, 2009, pp. 289-300

• On the Hardness and Approximability of Planar Biconnectivity Augmentation
  Carsten Gutwenger, Petra Mutzel, and Bernd Zey
  in: 15th Annual International Computing and Combinatorics Conference 2009 (COCOON 2009)
  Lecture Notes in Computer Science 5609, Springer-Verlag, 2009, pp. 249-257

• Improved Steiner Tree Algorithms for Bounded Treewidth
  Markus Chimani, Petra Mutzel, and Bernd Zey
  Journal of Discrete Algorithms, 2012, pp. 67-78

• Stochastic Survivable Network Design Problems
  Ivana Ljubic, Petra Mutzel, and Bernd Zey, algorithm engineering report TR12-1-003, 2012. Visit our stoch. network design webpage for further informations

• TR 2010–03: Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
  Immanuel Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey, 2010. Visit our SSTP webpage for further informations

• TR09-09: Algorithms for Planar Graph Augmentation
  Bernd Zey, Diploma Thesis (Master Thesis), TU Dortmund, December

• Wintersemester 2013/2014
  • PG 573: MONET
• Sommersemester 2013
  • PG 573: MONET
  • Seminar Algorithm Engineering
• Wintersemester 2012/2013
  • Algorithmen und Datenstrukturen (Übung)
• Sommersemester 2012
  • Effiziente Algorithmen (Übung)
  • Seminar Algorithm Engineering
• Wintersemester 2011/2012
  • Programmierpraktikum zur Vorlesung "Einführung in die Programmierung"
  • Proseminar "Analyse sozialer Netzwerke
  • Seminar Algorithm Engineering
• Sommersemester 2011
  • Effiziente Algorithmen (Übung)
  • Fachprojekt Algorithm Engineering
• Wintersemester 2010/2011
  • Algorithmen und Datenstrukturen (Übung)
  •  Seminar "Algorithm Engineering"
• Sommersemester 2010
  • Effiziente Algorithmen (und Komplexitätstheorie) (Übung)
  • Seminar "Graphenalgorithmen"
• Sommersemester 2009
  • Seminar "Algorithm Engineering"

• Diplom- und Master-StudentInnen
  • Andreas Hörsken: Flexible Lösungsverfahren für Packungsprobleme in der auftragsbezogenen Kommissionierung, 05/2011
  • Denis Kurz: Parameterized Algorithms for Stochastic Steiner Tree Problems, 01/2012
  • Fritz Bökler: Algorithmen für das Stochastische Steinerbaumproblem auf Serien-Parallelen Graphen, 04/2012
  • Carola Thalmann: Entwicklung von VSS-ähnlichen Bewertungsmethoden für das stochastische Steinerbaumproblem und deren Analyse, 09/2012
  • Maximilian Ramke: Entwicklung primaler Heuristiken für das stochastische Steinerbaumproblem, 12/2012

• Bachelor-StudentInnen
  • Mirjam Koch: Analyse der Terminplanung auf der endoskopischen Station des St. Anna Hospitals in Herne und Modellierung einer integrierbaren IT-Lösung, 11/2011

• Hinweise zur Foliengestaltung (von Markus Chimani)

• Stochastic Steiner Tree Problem Webpage - containing instances from the SSTPLib
• Stochastic Network Design Problem Webpage - containing instances from the SSNDPLib
• OGDF - Open Graph Drawing Framework
• DISS - Dynamische und Integrative Disposition in Stückgutspeditionsanlagen
• List of conferences and workshops in the field of Combinatorial Optimization, Discrete and Parallel Algorithms (Carsten Gutwenger's page)