Author of the publication

Block Statistics in Subcritical Graph Classes.

, , and . AofA, volume 159 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Matchings in graphs with a given number of cuts., , and . Discret. Appl. Math., (2020)IDMS und Datenschutz Juristische Hürden und deren Überwindung., and . DFN-Forum Kommunikationstechnologien, volume P-187 of LNI, page 133-142. GI, (2011)A Bijection for the Evolution of B-Trees., and . AofA, volume 302 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study., and . AofA, volume 302 of LIPIcs, page 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models., , , and . AofA, volume 302 of LIPIcs, page 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Number of Distinct Fringe Subtrees in Binary Search Trees.. AofA, volume 302 of LIPIcs, page 13:1-13:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Probability That a Random Digraph Is Acyclic., , and . AofA, volume 159 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Statistics of Parking Functions and Labeled Forests., and . AofA, volume 302 of LIPIcs, page 29:1-29:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hitting Times, Cover Cost, and the Wiener Index of a Tree, and . Journal of Graph Theory, (2016)Betweenness Centrality in Random Trees., and . ANALCO, page 66-79. SIAM, (2016)