( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

, , , , and . ICALP, volume 80 of LIPIcs, page 125:1-125:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Michele Galletti

Hannelore Michele

Michèle Mattusch

 

Other publications of authors with the same name

Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)Learning DNF Formulae Under Classes of Probability Distributions., , and . COLT, page 85-92. ACM, (1992)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 Pareto Optimality in Social Distance Games., , and . AAAI, page 349-355. AAAI Press, (2017)The Impact of Selfishness in Hypergraph Hedonic Games., , and . AAAI, page 1766-1773. AAAI Press, (2020)On the Price of Stability of Fractional Hedonic Games., , , , and . AAMAS, page 1239-1247. ACM, (2015)Pricing Problems with Buyer Preselection., , , and . MFCS, volume 117 of LIPIcs, page 47:1-47:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Graphical Congestion Games., , , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 70-81. Springer, (2008)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)