From post

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.

 

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

Scheduling and Fixed-Parameter Tractability., и . IPCO, том 8494 из Lecture Notes in Computer Science, стр. 381-392. Springer, (2014)A (2+) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem., и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 973-984. Springer, (2015)Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs., и . DCOSS, том 5067 из Lecture Notes in Computer Science, стр. 415-431. Springer, (2008)Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs., и . ADHOC-NOW, том 5198 из Lecture Notes in Computer Science, стр. 1-14. Springer, (2008)Increasing Speed Scheduling and Flow Scheduling., и . ISAAC (2), том 6507 из Lecture Notes in Computer Science, стр. 279-290. Springer, (2010)Packing Cars into Narrow Roads: PTASs for Limited Supply Highway., и . ESA, том 144 из LIPIcs, стр. 54:1-54:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Partitioned EDF scheduling on a few types of unrelated multiprocessors., , и . Real Time Syst., 49 (2): 219-238 (2013)This House Proves That Debating is Harder Than Soccer., и . FUN, том 49 из LIPIcs, стр. 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fixed-Parameter Approximation Schemes for Weighted Flowtime.. APPROX-RANDOM, том 116 из LIPIcs, стр. 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fixed-Parameter Algorithms for Unsplittable Flow Cover., , и . STACS, том 154 из LIPIcs, стр. 42:1-42:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)