( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Traffic grooming in WDM networks with multi-layer switches.

, , и . ICC, стр. 2896-2901. IEEE, (2002)

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.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

Другие публикации лиц с тем же именем

On the Hardness of Equal Shortest Path Routing., , и . Electron. Notes Discret. Math., (2013)Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols., и . SIAM J. Discret. Math., 17 (4): 521-540 (2004)Sequential Metric Dimension., , , , и . WAOA, том 11312 из Lecture Notes in Computer Science, стр. 36-50. Springer, (2018)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 57-71. Springer, (2009)GMPLS label space minimization through hypergraph layouts., , , , , и . Theor. Comput. Sci., (2012)Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between., , и . Algorithmica, 83 (5): 1459-1492 (2021)Biased Majority Opinion Dynamics: Exploiting Graph k-domination., , и . IJCAI, стр. 377-383. ijcai.org, (2022)A random growth model with any real or theoretical degree distribution., , и . Theor. Comput. Sci., 940 (Part): 36-51 (2023)Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter., , , , и . COMPLEX NETWORKS (2), том 944 из Studies in Computational Intelligence, стр. 597-609. Springer, (2020)Study of a Combinatorial Game in Graphs Through Linear Programming., , , и . Algorithmica, 82 (2): 212-244 (2020)