( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Diameter of Polyhedra: Limits of Abstraction.

, , , и . Math. Oper. Res., 35 (4): 786-794 (2010)

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.

Karl Rothvoss

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)
 

Другие публикации лиц с тем же именем

Diameter of polyhedra: limits of abstraction., , и . SCG, стр. 386-392. ACM, (2009)The entropy rounding method in approximation algorithms.. SODA, стр. 356-372. SIAM, (2012)Approximating Bin Packing within O(log OPT * Log Log OPT) Bins.. FOCS, стр. 20-29. IEEE Computer Society, (2013)A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation., и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 246-257. Springer, (2008)Pricing on Paths: A PTAS for the Highway Problem., и . SODA, стр. 675-684. SIAM, (2011)Constructive Discrepancy Minimization for Convex Sets.. FOCS, стр. 140-145. IEEE Computer Society, (2014)Network Design via Core Detouring for Problems without a Core., и . ICALP (1), том 6198 из Lecture Notes in Computer Science, стр. 490-502. Springer, (2010)Diameter of Polyhedra: Limits of Abstraction., , , и . Flexible Network Design, том 10211 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Improved Analysis of Online Balanced Clustering., , , , , и . WAOA, том 12982 из Lecture Notes in Computer Science, стр. 224-233. Springer, (2021)Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard., и . RTSS, стр. 397-406. IEEE Computer Society, (2008)