( en | de | ru )

 

Disambiguation of "Mömke, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
On the Advice Complexity of Online Problems.

, , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 331-340. Springer, (2009)

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.

Stefanie Hedwig Mömke

Torsten Mömken

Henrik Mömken

Tobias Tobias

Tobias Balkenhol

Adaptive Digitalfilter für die aktive Schalldämmung in Röhrensystemen. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Robust Reoptimization of Steiner Trees., and . FSTTCS, volume 45 of LIPIcs, page 10-24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Improved integrality gap upper bounds for traveling salesperson problems with distances one and two., and . Eur. J. Oper. Res., 266 (2): 436-457 (2018)Robust Reoptimization of Steiner Trees., and . Algorithmica, 82 (7): 1966-1988 (2020)A 4-Approximation Algorithm for Maximum Independent Set of Rectangles., , , , , and . CoRR, (2021)Structural Properties of Hard Metric TSP Inputs - (Extended Abstract).. SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 394-405. Springer, (2011)Improved Approximations for Hard Optimization Problems via Problem Instance Classification., , and . Rainbow of Computer Science, volume 6570 of Lecture Notes in Computer Science, page 3-19. Springer, (2011)Efficient Algorithms for the Spoonerism Problem., , , , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 78-92. Springer, (2007)Randomized Online Algorithms with High Probability Guarantees., , , and . STACS, volume 25 of LIPIcs, page 470-481. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Unsplittable Flow on a Path: The Game!., , and . SODA, page 906-926. SIAM, (2022)Approximating Graphic TSP by Matchings., and . FOCS, page 560-569. IEEE Computer Society, (2011)