• Our DFG project Tolerance based methods for solving the TSP has found 10 (current) world record tours for VLSI instances from the TSP homepage .
• The short paper An Effective SAT Encoding for Magic Labeling (Author: G. Jäger) (see Publications) has been accepted for 9th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). I have presented it in Cologne at May 25-27 (see Talks).
• The paper A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem (Authors: G. Jäger, W. Zhang) (see Publications) has been accepted for 5th International Computer Science Symposium in Russia (CSR 2010). I have presented it in Kazan (Russia) at June 16-20 (see Talks).
• The paper Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (Authors: C. Ernst, C. Dong, G. Jäger, D. Richter, P. Molitor) (see Publications) has been accepted for 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010). Dirk Richter has presented it in Weihai (China) at July 19-22.
• The paper An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem. (Authors: G. Jäger, W. Zhang) (see Publications) has been accepted for Journal of Artifical Intelligence Research, the primary journal for the field of artificial intelligence.

Fields of Research