( en | de | ru )

 

Disambiguation of "Pérennes, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Study of a Combinatorial Game in Graphs Through Linear Programming.

, , , and . Algorithmica, 82 (2): 212-244 (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 Klein

Stéphane Haussler

Stéphane Müller

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

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)Sequential Metric Dimension., , , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 36-50. Springer, (2018)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 57-71. Springer, (2009)GMPLS label space minimization through hypergraph layouts., , , , , and . Theor. Comput. Sci., (2012)Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between., , and . Algorithmica, 83 (5): 1459-1492 (2021)Biased Majority Opinion Dynamics: Exploiting Graph k-domination., , and . IJCAI, page 377-383. ijcai.org, (2022)A random growth model with any real or theoretical degree distribution., , and . Theor. Comput. Sci., 940 (Part): 36-51 (2023)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)