PhD and Habilitation Talks

• Defense of PhD Thesis. July 27, 2001, Experimental Mathematics Institute Essen, Germany.
  Algorithmen zur Berechnung der Smith-Normalform und deren Implementation auf Parallelrechnern.
  (German)

• Defense of Habilitation Thesis. February 20, 2010, Christian Albrechts University Kiel, Germany.
  The Theory of Tolerances with Applications to the Traveling Salesman Problem.
  (German)

• Habilitation Lecture. April 21, 2010, Christian Albrechts University Kiel, Germany.
  Graph theory: The Hamiltonian Cycle Problem: Definitions, Results and Applications.
  (German)

• Habilitation thesis. January 19, 2011, Christian Albrechts University Kiel, Germany.
  The Primality Test of Agrawal, Kayal and Saxena.
  (German)

Talks at International Conferences/Workshops

• The 7th SIAM Conference on Applied Linear Algebra.
  October 23-25, 2000, Raleigh, United States.
  A New Algorithm for Computing the Smith Normal Form.

• APPOL 2 Workshop.
  March 23-28, 2003, Bertinoro, Italy.
  Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

• The 11th International Conference on Random Structures and Algorithms (RSA).
  August 9-13, 2003, Poznan, Poland.
  Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

• The 10th European PVM/MPI Users' Group Meeting.
  September 29-October 2, 2003, Venice, Italy.
  Parallel Algorithms for Computing the Smith Normal Form of Large Matrices.

• The 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS).
  December 15-17, 2003, Mumbai, India.
  Constructions of Sparse Asymmetric Connectors.

• The 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM).
  June 20-22, 2006, Hongkong, China.
  Some Basics on Tolerances.

• The 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM).
  June 6-8, 2007, Portland, United States.
  Solving Generalized Maximum Dispersion with Linear Programming.

• The 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN).
  August 14, 2007, Halifax, Canada.
  Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.

• The 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA).
  August 21-24, 2008, St. John's, Canada.
  Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.

• The 5th International Conference on Algorithmic Aspects in Information and Management (AAIM).
  June 15-17, 2009, San Francisco, United States.
  Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.

• The 17th Annual European Symposium on Algorithms (ESA).
  September 7-9, 2009, Copenhagen, Denmark.
  Complete Parsimony Haplotype Inference Problem and Algorithms.

• 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).
  May 25-27, 2010, Cologne, Germany.
  An Effective SAT Encoding for Magic Labeling.

• The 5th International Computer Science Symposium in Russia (CSR 2010).
  June 16-20, 2010, Kazan, Russia.
  A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.

• The 4th Conference on Optimal Discrete Structures and Algorithms (ODSA 2010).
  June 13-15, 2010, Rostock, Germany.
  A SAT Based Algorithm for Magic Labeling.

Talks at National Workshops/Events

• Algebra-Kolloquium. January 9-10, 2001, Experimental Mathematics Institute Essen, Germany.
  A New Presentation of the Transformation Matrices of Smith Normal Forms.

• Annual Meeting DFG Graduate School 357. June 14-16, 2002, Leck, Germany.
  Graphenbisection bei der Generierung von Clusterbäumen.
  (German)

• Workshop Optimization in Hypergraphs. October 18-21, 2002, Leck, Germany.
  Verbesserte Approximationsschranken für Maximum-Graph-Partitionsprobleme.
  (German)

• Annual Meeting DFG Graduate School 357. October 10-12, 2003, Leck, Germany.
  Optimale Sortieralgorithmen.
  (German)

• 51. Workshop über Datenstrukturen, Effiziente Algorithmen und Komplexitätstheorie ("Theorietag").
  March 15, 2005, Friedrich Alexander University of Erlangen-Nürnberg, Germany.
  Toleranzbasierte Algorithmen für das Traveling Salesman Problem.
  (German)

• Workshop Tolerance Based Algorithms in Quantitative Logistics.
  April 5, 2006, University of Groningen, The Netherlands.
  How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive

• Workshop Tolerance Based Algorithms in Quantitative Logistics.
  April 5, 2006, University of Groningen, The Netherlands.
  An Improved Helsgaun's Heuristic for the Symmetric Traveling Salesman Problem.

• 2. Workshop Algorithmen und Graphen.
  January 14, 2008, Technical University of Chemnitz, Germany.
  Heuristiken und exakte Algorithmen für das verallgemeinerte Traveling Salesman Problem.
  (German)

• Lange Nacht der Wissenschaften.
  July 4, 2008, Martin Luther University of Halle-Wittenberg, Germany.
  Das Problem des Handelsreisenden: Lösungsansätze mit Weltrekordcharakter.
  (German)

• Kolloquium über Kombinatorik (KolKom).
  November 14-15, 2008, Otto von Guericke University of Magdeburg, Germany.
  Effective Tour Searching for Large TSP Instances.

• DFG SPP Workshop Algorithm Engineering for Integer Programming.
  May 8-9, 2009, Christian Albrechts University of Kiel, Germany.
  Das Traveling Salesman Problem und das Assignment Problem zweiter Ordnung.
  (German)

• 5. Workshop Kombinatorik, Graphentheorie und Algorithmen.
  June 2, 2009, Technical University of Chemnitz, Germany.
  Effektive Tour-Suche für große TSP-Instanzen.
  (German)

Invited Talks

• July 20, 2001, Free University of Berlin, Germany.
  Algorithmen zur Berechnung der Smith-Normalform und deren Implementation auf Parallelrechnern.
  (German)

• August 15, 2001, Christian Albrechts of University Kiel, Germany.
  Algorithmen zur Berechnung der Smith-Normalform und deren Implementation auf Parallelrechnern.
  (German)

• Dezember 12, 2002, University of Bielefeld, SFB 343 (Diskrete Strukturen in der Mathematik), Germany.
  Zahlentheoretische Methoden bei der Konstruktion von nicht-blockierenden Netzwerken.
  (German)

• September 26, 2003, Technical University of Braunschweig, Germany.
  Konstruktionen dünner asymmetrischer Konnektoren.
  (German)

• December 13, 2003, IIT Mumbai, India.
  Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

• December 22, 2003, University of Hamburg, Germany.
  Constructions of Sparse Asymmetric Connectors.

• June 28, 2004, Martin Luther University of Halle-Wittenberg, Germany.
  Optimale Sortieralgorithmen.
  (German)

• July 6, 2004, Ernst Moritz Arndt University of Greifswald, Germany.
  Optimale Sortieralgorithmen.
  (German)

• July 12, 2005, Khmelnitsky National University, Ukraine.
  Efficient Algorithms for Graph Bisection of Sparse Planar Graphs.

• July 19, 2005, Khmelnitsky National University, Ukraine.
  Constructions of Sparse Asymmetric Connectors.

• November 11, 2005, Christian Albrechts of University Kiel, Germany.
  Tolerance Based Greedy Heuristics for the Asymmetric TSP.

• December 21, 2005, Zuse Institute Berlin, Germany.
  Tolerance Based Greedy Heuristics for the Asymmetric TSP.

• December 15, 2008, University of Portsmouth, United Kingdom.
  Effective Tour Searching for Large TSP Instances.

• June 8, 2009, Center for Discrete Mathematics and its Applications,
  University of Warwick, United Kingdom.
  Effective Tour Searching for Large TSP Instances.

• May 6, 2010, Summer School Operational Research with Logistic Applications,
  National Research University of Nizhny Novgorod, Russia.
  Introduction to the Hamiltonian Circuit Problem and the Traveling Salesman Problem.

• May 19, 2010, University of Southern Denmark, Odense, Denmark.
  Effective Heuristics for Large TSP Instances.

• July 19, 2010, University of Bielefeld, Germany.
  Effective Heuristics for Large TSP Instances.

• August 10, 2010, Technical University of Clausthal, Germany.
  Effective Heuristics for Large TSP Instances.

• April 1, 2011, Umeå University, Sweden.
  A 20 Minutes Introduction to Linear Programming.

Copyright notice