PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient offline algorithms for the bicriteria k-server problem and online applications.

, , and . J. Discrete Algorithms, 4 (3): 414-432 (2006)

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.

Dr. Michele Nottoli University of Stuttgart

 

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)Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem., , and . WEA, volume 2647 of Lecture Notes in Computer Science, page 33-46. Springer, (2003)On the Price of Stability of Fractional Hedonic Games., , , , and . AAMAS, page 1239-1247. ACM, (2015)A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load., , and . Parallel Processing Letters, 8 (2): 207-220 (1998)Deadlock-Free Interval Routing Schemes.. STACS, volume 1200 of Lecture Notes in Computer Science, page 351-362. Springer, (1997)Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves., , , and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 363-374. Springer, (2006)On Minimizing the Number of ADMs in a General Topology Optical Network., , and . DISC, volume 4167 of Lecture Notes in Computer Science, page 459-473. Springer, (2006)Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems., , , , and . EWSA, volume 4344 of Lecture Notes in Computer Science, page 17-32. Springer, (2006)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)