( en | de | ru )

 

Disambiguation of "Milis, Ioannis"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

, , , , , , , , , , and . FOCS, page 32-44. IEEE Computer Society, (1999)

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.

Irmtraut Milisch

Merje Miliste

Claudio Milisenda

Ioannis Tzamichas

Ioannis Filippis

 

Other publications of authors with the same name

Approximating the max-edge-coloring problem., , , and . Theor. Comput. Sci., 411 (34-36): 3055-3067 (2010)Bounded Max-colorings of Graphs., , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 353-365. Springer, (2010)Improved Approximation Algorithms for the Max-Edge Coloring Problem., and . TAPAS, volume 6595 of Lecture Notes in Computer Science, page 206-216. Springer, (2011)Energy-Efficient Algorithms for Non-preemptive Speed-Scaling., , , and . WAOA, volume 8952 of Lecture Notes in Computer Science, page 107-118. Springer, (2014)On the Maximum Edge Coloring Problem., , and . WAOA, volume 5426 of Lecture Notes in Computer Science, page 279-292. Springer, (2008)Designing PTASs for MIN-SUM Scheduling Problems., and . FCT, volume 2138 of Lecture Notes in Computer Science, page 432-444. Springer, (2001)The max quasi-independent set Problem., , , , , and . CSR, volume 6072 of Lecture Notes in Computer Science, page 60-71. Springer, (2010)Scheduling Trees with Large Communication Delays on Two Identical Processors., , , and . Euro-Par, volume 1900 of Lecture Notes in Computer Science, page 288-295. Springer, (2000)Exact and Approximation Algorithms for Densest k-Subgraph., , , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 114-125. Springer, (2013)NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract)., , and . WG, volume 903 of Lecture Notes in Computer Science, page 387-394. Springer, (1994)