Tobias Tscheuschner

Settling the Complexity of Local Max-Cut (Almost) Completely

Robert Elsässer, Tobias Tscheuschner, Robert Elsässer, 2010, ICALP.

On the Power of Nodes of Degree Four in the Local Max-Cut Problem

Burkhard Monien, Tobias Tscheuschner, 2010, CIAC.

Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games

Matthias Kirschner, Tobias Tscheuschner, Philipp Schengbier, 2009, SEA.

THE 17 th INTERNATIONAL PADERBORN COMPUTER-CHESS CHAMPIONSHIP

Tobias Tscheuschner, 2008 .

Local Search: Simple, Successful, But Sometimes Sluggish

Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner, 2010, ICALP.

The local max-cut problem is PLS-complete even on graphs with maximum degree five pdf

Tobias Tscheuschner, 2010, ArXiv.

Player Modeling, Search Algorithms and Strategies in Multi-player Games

Ulf Lorenz, Tobias Tscheuschner, 2006, ACG.

Implementation Aspects

Eric Berberich, Tobias Tscheuschner, Sven Scholz, 2010, Algorithm Engineering.