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.

 

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

Online Maximum Matching with Recourse., , и . MFCS, том 117 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Quantum Query Complexity of Some Graph Problems., , , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 481-493. Springer, (2004)Competitive Analysis of Scheduling Algorithms for Aggregated Links., , и . LATIN, том 3887 из Lecture Notes in Computer Science, стр. 617-628. Springer, (2006)On tiling under tomographic constraints., , , и . Theor. Comput. Sci., 290 (3): 2125-2136 (2003)The local-global conjecture for scheduling with non-linear cost., , , и . J. Sched., 20 (3): 239-254 (2017)Nash Equilibria in Voronoi Games on Graphs., и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 17-28. Springer, (2007)Preemptive scheduling of equal-length jobs to maximize weighted throughput., , , , и . Oper. Res. Lett., 32 (3): 258-264 (2004)Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems., , , и . AAIM, том 5034 из Lecture Notes in Computer Science, стр. 120-130. Springer, (2008)Quantum Query Complexity of Some Graph Problems., , , и . SIAM J. Comput., 35 (6): 1310-1328 (2006)Online Bin Packing with Advice of Small Size., , , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 40-53. Springer, (2015)