Elmar Teufl

According to our database, Elmar Teufl authored at least 7 papers between 2003 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

Memoryless near-collisions, revisited.

Mario Lamberger, Elmar Teufl

Inf. Process. Lett., 2013

2010

Enumeration of matchings in families of self-similar graphs.

Elmar Teufl, Stephan G. Wagner

Discret. Appl. Math., 2010

2009

An Asymptotic Independence Theorem for the Number of Matchings in Graphs.

Elmar Teufl, Stephan G. Wagner

Graphs Comb., 2009

Asymptotic enumeration on self-similar graphs with two boundary vertices.

Elmar Teufl, Stephan G. Wagner

Discret. Math. Theor. Comput. Sci., 2009

Exact and asymptotic enumeration of perfect matchings in self-similar graphs.

Elmar Teufl, Stephan G. Wagner

Discret. Math., 2009

2007

Enumeration problems for classes of self-similar graphs.

Elmar Teufl, Stephan G. Wagner

J. Comb. Theory, Ser. A, 2007

2003

The Average Displacement Of The Simple Random Walk On The Sierpinski Graph.

Elmar Teufl

Comb. Probab. Comput., 2003