Fast Lowest Common Ancestor Computations in Dags. - Stefan Eckhardt; Andreas Michael Mühling; Johannes Nowak (ESA, 2007)

All-Pairs Ancestor Problems in Weighted Dags. - Matthias Baumgart 001; Stefan Eckhardt; Jan Griebsch; Sven Kosub; Johannes Nowak (ESCAPE, 2007)

Combinatorial network abstraction by trees and distances. - Stefan Eckhardt; Sven Kosub; Moritz G. Maaß; Hanjo Täubig; Sebastian Wernicke 001 (Theor. Comput. Sci., 2008)

Complexity analysis of tries and spanning tree problems. - Bernd Stefan Eckhardt (2009)

Smoothed Analysis of Trie Height by Star-like PFAs. - Stefan Eckhardt; Sven Kosub; Johannes Nowak (CoRR, 2020)