( en | de | ru )

 

Disambiguation of "Pérennes, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
From Balls and Bins to Points and Vertices.

, , , and . Algorithmic Oper. Res., 4 (2): 133-143 (2009)

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 Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

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)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)Hardness and Approximation of Traffic Grooming., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 561-573. Springer, (2007)Study of a Combinatorial Game in Graphs Through Linear Programming., , , and . Algorithmica, 82 (2): 212-244 (2020)On the Path-Width of Planar Graphs., , and . SIAM J. Discret. Math., 23 (3): 1311-1316 (2009)