Author of the publication

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.

, , and . Algorithmica, 37 (4): 243-262 (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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Domination in partitioned graphs., and . Discussiones Mathematicae Graph Theory, 22 (1): 199-210 (2002)Graphs without induced P5 and C5., and . Discussiones Mathematicae Graph Theory, 24 (3): 503-507 (2004)Graph Domination in Distance Two., , and . Discussiones Mathematicae Graph Theory, 25 (1-2): 121-128 (2005)A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins., , , and . Inf. Process. Lett., 65 (5): 229-233 (1998)Semi on-line algorithms for the partition problem., , , and . Oper. Res. Lett., 21 (5): 235-242 (1997)An upper bound on the number of cliques in a graph., , and . Networks, 23 (3): 207-210 (1993)A General Bin Packing Game: Interest Taken into Account., , , and . Algorithmica, 80 (5): 1534-1555 (2018)Local and global average degree in graphs and multigraphs., , , , and . J. Graph Theory, 18 (7): 647-661 (1994)Saturated graphs with minimal number of edges., and . J. Graph Theory, 10 (2): 203-210 (1986)Aspects of upper defensive alliances., , and . Discret. Appl. Math., (2019)