Tobias Tscheuschner und Robert Elsässer - Info zur Person

(1 - 14 von 15

)

Smoothed Complexity of 2-FLIP in Local Max-CutColumbia University

www.cs.columbia.edu

— [ET11] Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely. In International Colloquium on ...

Automata, Languages and Programming: 38th International Colloquium,...

books.google.de

Settling the Complexity of Local Max-Cut (Almost) Completely⋆ Robert Elsässer and Tobias Tscheuschner University of Paderborn Faculty of Computer Science ...

Minimum Stable Cut and Treewidth - lamsadeUniversité Paris Dauphine-PSL

www.lamsade.dauphine.fr

Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely. In Luca Aceto, Monika Henzinger, and Jirí Sgall, ...

Sampling Frequency Thresholds for Quantum Advantage ...Research Square

www.researchsquare.com

von D Lykov · · Zitiert von: 3 — 48 Robert Elsässer and Tobias Tscheuschner, “Settling the complexity of local Max-Cut (almost) completely,” in.

Smoothed Analysis of Local Search for the Maximum-Cut ...Heiko Röglin

www.roeglin.org

von M Etscheid · Zitiert von: 53 — [8] Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max- cut (almost) completely. In Proceedings of the 38th International ...

dblp: Robert Elsässer

dblp.uni-trier.de

List of computer science publications by Robert Elsässer

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

link.springer.com

von R Elsässer · · Zitiert von: 26 — Settling the Complexity of Local Max-Cut (Almost) Completely. Robert Elsässer &; Tobias Tscheuschner. Conference paper Accesses. 5 Citations. von M Kirschner · · Zitiert von: 3 — Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. Matthias Kirschner,; Philipp Schengbier &; Tobias Tscheuschner. › chapter

au:Tscheuschner_T in:cs - SciRate Search

scirate.com

@misc{ , author = {Robert Elsaesser, Tobias Tscheuschner}, title = {{S}ettling the complexity of local max-cut (almost) completely}, year = {2010}, eprint ...

ICALP 2011

icalp11.inf.ethz.ch

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm; Robert Elsaesser and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely; Georg Zetzsche. On the capabilities of grammars, automata, and transducers controlled by monoids; Nathalie ...