The Average Displacement Of The Simple Random Walk On The Sierpinski Graph. - Elmar Teufl (Comb. Probab. Comput., 2003)

Enumeration problems for classes of self-similar graphs. - Elmar Teufl; Stephan G. Wagner (J. Comb. Theory A, 2007)

Exact and asymptotic enumeration of perfect matchings in self-similar graphs. - Elmar Teufl; Stephan G. Wagner (Discret. Math., 2009)

Asymptotic enumeration on self-similar graphs with two boundary vertices. - Elmar Teufl; Stephan G. Wagner (Discret. Math. Theor. Comput. Sci., 2009)

An Asymptotic Independence Theorem for the Number of Matchings in Graphs. - Elmar Teufl; Stephan G. Wagner (Graphs Comb., 2009)

Enumeration of matchings in families of self-similar graphs. - Elmar Teufl; Stephan G. Wagner (Discret. Appl. Math., 2010)

Memoryless near-collisions, revisited. - Mario Lamberger; Elmar Teufl (Inf. Process. Lett., 2013)