( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Divide-and-Conquer Approximation Algorithm for Vertex Cover.

, и . SIAM J. Discret. Math., 23 (3): 1261-1280 (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.

Cliff Brackmann

Klonierung und Charakterisierung von hochaffinen Einzelkettenantikörperfragmenten gegen die NS5B-Polymerase des Hepatitis C-Virus. Uni Düsseldorf, (2010)

Cliff Meesenburg

Alice Clifford

Raphaël Clifford

Cliff Scherer

 

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

The Complexity of Scheduling for p-norms of Flow and Stretch, , и . CoRR, (2013)Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms., , , , и . CoRR, (2017)The Online Set Aggregation Problem., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 245-259. Springer, (2018)An Empirical Study of Online Packet Scheduling Algorithms., и . SEA, том 9685 из Lecture Notes in Computer Science, стр. 278-293. Springer, (2016)Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks., , и . SPAA, стр. 294-303. ACM, (2015)Fast algorithms for knapsack via convolution and prediction., , , и . STOC, стр. 1269-1282. ACM, (2018)On A Strictly Convex IBM Model 1., , и . EMNLP, стр. 221-226. The Association for Computational Linguistics, (2015)A Convex Alternative to IBM Model 2., , и . EMNLP, стр. 1574-1583. ACL, (2013)Bounded-space online bin cover., и . J. Sched., 12 (5): 461-474 (2009)Submodular Secretary Problem with Shortlists., , и . ITCS, том 124 из LIPIcs, стр. 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)