Player Modeling, Search Algorithms and Strategies in Multi-player Games. - Ulf Lorenz; Tobias Tscheuschner (ACG, 2006)

Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. - Matthias Kirschner; Philipp Schengbier; Tobias Tscheuschner (SEA, 2009)

On the Power of Nodes of Degree Four in the Local Max-Cut Problem. - Burkhard Monien; Tobias Tscheuschner (CIAC, 2010)

Implementation Aspects. - Marc Mörig; Sven Scholz; Tobias Tscheuschner; Eric Berberich (Algorithm Engineering, 2010)

Local Search: Simple, Successful, But Sometimes Sluggish. - Burkhard Monien; Dominic Dumrauf; Tobias Tscheuschner (ICALP (1), 2010)

The local max-cut problem is PLS-complete even on graphs with maximum degree five - Tobias Tscheuschner (CoRR, 2010)

Settling the Complexity of Local Max-Cut (Almost) Completely. - Robert Elsässer; Tobias Tscheuschner (ICALP (1), 2011)

The complexity of local max-cut - Tobias Tscheuschner (2012)