( en | de | ru )

 

Disambiguation of "Pérennes, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter.

, , , , and . COMPLEX NETWORKS (2), volume 944 of Studies in Computational Intelligence, page 597-609. Springer, (2020)

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.

Stéphane Müller

Stéphane Klein

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

Other publications of authors with the same name

Hardness and Approximation of Traffic Grooming., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 561-573. Springer, (2007)Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter., , , , and . COMPLEX NETWORKS (2), volume 944 of Studies in Computational Intelligence, page 597-609. Springer, (2020)Study of a Combinatorial Game in Graphs Through Linear Programming., , , and . Algorithmica, 82 (2): 212-244 (2020)Hardness and approximation of Gathering in static radio networks., , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 57-71. Springer, (2009)Sequential Metric Dimension., , , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 36-50. Springer, (2018)On the Hardness of Equal Shortest Path Routing., , and . Electron. Notes Discret. Math., (2013)Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols., and . SIAM J. Discret. Math., 17 (4): 521-540 (2004)Biased Majority Opinion Dynamics: Exploiting Graph k-domination., , and . IJCAI, page 377-383. ijcai.org, (2022)How to Design Graphs with Low Forwarding Index and Limited Number of Edges., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 221-234. Springer, (2015)