Author of the publication

Minimizing total busy time in parallel scheduling with application to optical networks.

, , , , , , and . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)

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

On the convergence of multicast games in directed networks., , and . SPAA, page 330-338. ACM, (2007)Experimental Evaluations of Algorithms for IP Table Minimization., , , , and . WEA, volume 4525 of Lecture Notes in Computer Science, page 324-337. Springer, (2007)Artificial intelligence and renegotiation of commercial lease contracts affected by pandemic-related contingencies from Covid-19. The project A.I.A.Co., , , , , , and . CoRR, (2022)Additively Separable Hedonic Games with Social Context., , and . Games, 12 (3): 71 (2021)On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . Algorithmica, 68 (3): 671-691 (2014)The price of stability for undirected broadcast network design with fair cost allocation is constant., , and . Games Econ. Behav., (2020)On the performances of Nash equilibria in isolation games., , , and . J. Comb. Optim., 22 (3): 378-391 (2011)When Ignorance Helps: Graphical Multicast Cost Sharing Games., , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 108-119. Springer, (2008)On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . OPODIS, volume 7109 of Lecture Notes in Computer Science, page 96-111. Springer, (2011)Traffic Grooming: Combinatorial Results and Practical Resolutions., , , , , , , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)