Tobias Tscheuschner

According to our database, Tobias Tscheuschner authored at least 8 papers between 2006 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

The complexity of local max-cut

Tobias Tscheuschner

PhD thesis, 2012

2011

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

Robert Elsässer, Tobias Tscheuschner

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

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

Tobias Tscheuschner

CoRR, 2010

Local Search: Simple, Successful, But Sometimes Sluggish.

Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Implementation Aspects.

Marc Mörig, Sven Scholz, Tobias Tscheuschner, Eric Berberich

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

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

Burkhard Monien, Tobias Tscheuschner

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

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

Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

2006

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

Ulf Lorenz, Tobias Tscheuschner

Proceedings of the Advances in Computer Games, 11th International Conference, 2006