( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Almost Envy-Free Allocations with Connected Bundles.

, , , , , , , and . CoRR, (2018)

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.

Michele Galletti

Michele Ocken

Michele Ferrari

Hannelore Michele

Michele Cagnoli

 

Other publications of authors with the same name

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , and . SIROCCO, volume 17 of Proceedings in Informatics, page 133-145. Carleton Scientific, (2003)On Nash Equilibria in Non-Cooperative All-Optical Networks., , and . Algorithms, 14 (1): 15 (2021)Pareto approximations for the bicriteria scheduling problem., , and . J. Parallel Distributed Comput., 66 (3): 393-402 (2006)Experimental analysis of online algorithms for the bicriteria scheduling problem., , and . J. Parallel Distributed Comput., 64 (9): 1086-1100 (2004)Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)Optimizing regenerator cost in traffic grooming., , , , and . Theor. Comput. Sci., 412 (52): 7109-7121 (2011)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , and . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)When ignorance helps: Graphical multicast cost sharing games., , , and . Theor. Comput. Sci., 411 (3): 660-671 (2010)On routing of wavebands for all-to-all communications in all-optical paths and cycles., , and . Theor. Comput. Sci., 333 (3): 401-413 (2005)Digraph k-Coloring Games: From Theory to Practice., , , and . SEA, volume 233 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)