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.

 

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

A preemptive open shop scheduling problem with one resource., , и . Oper. Res. Lett., 10 (1): 9-15 (1991)Constraints of Availability in Timetabling and Scheduling.. PATAT, том 2740 из Lecture Notes in Computer Science, стр. 3-23. Springer, (2002)Some Combinatorial Models for Course Scheduling.. PATAT, том 1153 из Lecture Notes in Computer Science, стр. 296-308. Springer, (1995)Weighted Node Coloring: When Stable Sets Are Expensive., , , и . WG, том 2573 из Lecture Notes in Computer Science, стр. 114-125. Springer, (2002)The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small., , , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 377-388. Springer, (2004)Deadline Scheduling of Multiprocessor Tasks., , , и . Discret. Appl. Math., 65 (1-3): 81-95 (1996)Restrictions and Preassignments in Preemptive open Shop Scheduling., , , и . Discret. Appl. Math., 68 (1-2): 169-188 (1996)Polar cographs., , и . Discret. Appl. Math., 156 (10): 1652-1660 (2008)The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models., , , , и . Ann. Oper. Res., 188 (1): 1-18 (2011)Combinatorics and Algorithms for Augmenting Graphs., , , и . Graphs Comb., 32 (4): 1339-1352 (2016)