Approximate Counting via the Poisson-Laplace-Mellin
Method, (with C.-K.
Lee and H. Prodinger),
Discrete Math. Theor. Comput. Sci. Proc., Proceedings of the 23rd International
Meeting on Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms, 13-28 (2012).
Enumeration of d-combining Tree-Child Networks,
(with Y.-S. Chang, H. Liu, M. Wallner and G.-R. Yu),
LIPICS, Proceedings of the 33rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 225, Paper 5 (2022).
The Node Profile of Symmetric
Digital Search Trees, talk given at 26th International Meeting on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms, Strobl, Austria, June 8, 2015.
Combinatorics of Phylogenetic Networks, plenary talk
given at Twelfth Cross-strait Conference on Graph Theory and Combinatorics, Hualien, Taiwan, July 10, 2023.
Counting Phylogenetic Networks with the Component
Graph Method, invited talk given at the mini-symposium "Challenges and Recent Advances in Phylogenetics" of the 10th
International Conference on Industrial and Applied Mathematics (ICIAM 2023), Tokyo, Japan, August 22, 2023.
Limit Laws for Patterns in Ranked Tree-Child
Networks, talk given at the workshop "Foundations of Phylogenetic Networks" of the one-month IMS program "Mathematics of Evolution -
Phylogenetic Trees and Networks", Singapore, September 6, 2023.