( en | de | ru )

 

Disambiguation of "Milis, Ioannis"

Author of the publication

copydeleteadd this publication to your clipboard
On the Maximum Edge Coloring Problem.

, , and . WAOA, volume 5426 of Lecture Notes in Computer Science, page 279-292. Springer, (2008)

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 Filippis

Ioannis Tzamichas

 

Other publications of authors with the same name

Approximating the max-edge-coloring problem., , , and . Theor. Comput. Sci., 411 (34-36): 3055-3067 (2010)On the parallel complexity of the alternating Hamiltonian cycle problem., , and . RAIRO Oper. Res., 33 (4): 421-437 (1999)Approximating a Class of Classification Problems.. Efficient Approximation and Online Algorithms, volume 3484 of Lecture Notes in Computer Science, Springer, (2006)A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph., , , and . Parallel Process. Lett., 8 (3): 399-405 (1998)Max Edge Coloring of Trees, , and . CoRR, (2009)Scheduling MapReduce Jobs on Identical and Unrelated Processors., , , , and . Theory Comput. Syst., 64 (5): 754-782 (2020)Designing PTASs for MIN-SUM scheduling problems., and . Discret. Appl. Math., 154 (4): 622-639 (2006)Improved Approximation Algorithms for the Max-Edge Coloring Problem., and . TAPAS, volume 6595 of Lecture Notes in Computer Science, page 206-216. Springer, (2011)Bounded Max-colorings of Graphs., , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 353-365. Springer, (2010)Energy-Efficient Algorithms for Non-preemptive Speed-Scaling., , , and . WAOA, volume 8952 of Lecture Notes in Computer Science, page 107-118. Springer, (2014)