( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity and online algorithms for minimum skyline coloring of intervals.

, , , , , и . Theor. Comput. Sci., (2019)

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.

Hong Fu

Hong Liu

Liu Hong

Hong Liu

Fu Ying Liu

 

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

The Power of Amortization on Scheduling with Explorable Uncertainty., , , и . WAOA, том 14297 из Lecture Notes in Computer Science, стр. 90-103. Springer, (2023)Optimization of Masking Expansion Algorithm in Psychoacoustic Models., , и . IPTC, стр. 161-164. IEEE Computer Society, (2011)On the Grundy number of Cameron graphs., , , , и . Electron. Notes Discret. Math., (2017)Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs., , и . WAOA, том 11926 из Lecture Notes in Computer Science, стр. 217-231. Springer, (2019)Complexity and online algorithms for minimum skyline coloring of intervals., , , , , и . Theor. Comput. Sci., (2019)Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization., , и . Algorithmica, 82 (12): 3415-3457 (2020)P_3-Games on Chordal Bipartite Graphs., , , , , и . CoRR, (2016)Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs., , и . Theory Comput. Syst., 65 (6): 1009-1032 (2021)Optimal Nonpreemptive Scheduling in a Smart Grid Model., , и . ISAAC, том 64 из LIPIcs, стр. 53:1-53:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Convex Independence in Permutation Graphs., , , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 710-717. Springer, (2016)