PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tscheuschner, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
Settling the Complexity of Local Max-Cut (Almost) Completely.

, and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 171-182. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tobias Menold University of Stuttgart

Tobias Rentschler University of Stuttgart

Tobias Schwinn University of Stuttgart

Tobias Eisenreich University of Stuttgart

Tobias Schlager University of Stuttgart

 

Other publications of authors with the same name

Settling the Complexity of Local Max-Cut (Almost) Completely., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 171-182. Springer, (2011)Implementation Aspects., , , and . Algorithm Engineering, volume 5971 of Lecture Notes in Computer Science, page 237-289. Springer, (2010)Player Modeling, Search Algorithms and Strategies in Multi-player Games., and . ACG, volume 4250 of Lecture Notes in Computer Science, page 210-224. Springer, (2006)Local Search: Simple, Successful, But Sometimes Sluggish., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 1-17. Springer, (2010)The local max-cut problem is PLS-complete even on graphs with maximum degree five. CoRR, (2010)Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games., , and . SEA, volume 5526 of Lecture Notes in Computer Science, page 173-184. Springer, (2009)On the Power of Nodes of Degree Four in the Local Max-Cut Problem., and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 264-275. Springer, (2010)