( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the maximum mean subtree order of trees.

, , и . Eur. J. Comb., (2021)

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.

Stephan Wagner

Stephan Wagner

Stephan Wagner

Stephan Wagner

Stephan Wagner

 

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

Matchings in graphs with a given number of cuts., , и . Discret. Appl. Math., (2020)IDMS und Datenschutz Juristische Hürden und deren Überwindung., и . DFN-Forum Kommunikationstechnologien, том P-187 из LNI, стр. 133-142. GI, (2011)A Bijection for the Evolution of B-Trees., и . AofA, том 302 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study., и . AofA, том 302 из LIPIcs, стр. 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models., , , и . AofA, том 302 из LIPIcs, стр. 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Number of Distinct Fringe Subtrees in Binary Search Trees.. AofA, том 302 из LIPIcs, стр. 13:1-13:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hitting Times, Cover Cost, and the Wiener Index of a Tree, и . Journal of Graph Theory, (2016)Betweenness Centrality in Random Trees., и . ANALCO, стр. 66-79. SIAM, (2016)Enhancements to the LOCOSmotion Person Tracking System., , , и . EvAAL, том 386 из Communications in Computer and Information Science, стр. 72-82. Springer, (2013)On the maximum mean subtree order of trees., , и . Eur. J. Comb., (2021)