( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Characterization results of all shortest paths interval routing schemes.

, , , and . SIROCCO, page 201-213. Carleton Scientific, (1998)

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 Ocken

Michele Ferrari

Hannelore Michele

Michele Galletti

Michele Susca

 

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)Learning DNF Formulae Under Classes of Probability Distributions., , and . COLT, page 85-92. ACM, (1992)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)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)Deadlock-Free Interval Routing Schemes.. STACS, volume 1200 of Lecture Notes in Computer Science, page 351-362. Springer, (1997)A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load., , and . Parallel Process. Lett., 8 (2): 207-220 (1998)The Impact of Selfishness in Hypergraph Hedonic Games., , and . AAAI, page 1766-1773. AAAI Press, (2020)On Pareto Optimality in Social Distance Games., , and . AAAI, page 349-355. AAAI Press, (2017)Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions., , , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 118-131. Springer, (2015)