From post

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.

 

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

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)Betweenness Centrality in Random Trees., и . ANALCO, стр. 66-79. SIAM, (2016)On the distribution of random walk hitting times in random trees., и . ANALCO, стр. 73-84. SIAM, (2017)Block Statistics in Subcritical Graph Classes., , и . AofA, том 159 из LIPIcs, стр. 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Hitting Times, Cover Cost, and the Wiener Index of a Tree, и . Journal of Graph Theory, (2016)On the maximum mean subtree order of trees., , и . Eur. J. Comb., (2021)Uncovering a Random Tree., , и . AofA, том 225 из LIPIcs, стр. 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)