( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Capacitated vertex covering.

, , , и . J. Algorithms, 48 (1): 257-270 (2003)

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.

Alireza Samir

Kais al- Samir

Samer al- Samir

Samer al- Samir

Imad Samir

 

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

Scalable and Secure Data Collection Using Bistro., , , , и . DG.O, Digital Government Research Center, (2002)Balancing Minimum Spanning and Shortest Path Trees., , и . SODA, стр. 243-250. ACM/SIAM, (1993)Approximating the Minimum Equivalent Diagraph., , и . SODA, стр. 177-186. ACM/SIAM, (1994)Four colors suffice!. SIGACT News, 36 (2): 43-44 (2005)Algorithms for data migration with cloning., , и . PODS, стр. 27-36. ACM, (2003)Optimal Batch Schedules for Parallel Machines., и . WADS, том 8037 из Lecture Notes in Computer Science, стр. 475-486. Springer, (2013)Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)., и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 521-532. Springer, (2017)Revisiting Connected Dominating Sets: An Optimal Local Algorithm?, и . APPROX-RANDOM, том 60 из LIPIcs, стр. 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Cost of Essentially Fair Clusterings., , , , , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximation algorithms for data placement on parallel disks., , , , и . SODA, стр. 223-232. ACM/SIAM, (2000)