Searching for authors named "Stefan Eckhardt" – sorted by Relevance.
-
Combinatorial network abstraction by trees and distances
- and distances ✩ Stefan Eckhardt a,∗ , Sven Kosub a , Moritz G. Maaß a , Hanjo Täubig a , Sebastian Wernicke b a
- Cited by 1 (1 self) – Add To MetaCart
-
Technischen Universit"at M"unchen Fast Lowest Common Ancestor Computations in Dags
- in Dags Stefan Eckhardt Andreas M. M"uhling Johannes Nowak ABCDEFGHIJ KLMNO TUM-I0707 Januar 07 T E C
- Add To MetaCart
-
Technischen Universit"at M"unchen All-Pairs Common-Ancestor Problems in Weighted Dags
- Dags Matthias Baumgart Stefan Eckhardt Jan Griebsch Sven Kosub Johannes Nowak ABCDE FGHIJ KLMNO TUM
- Add To MetaCart
-
Combinatorial Network Abstractionby Trees and Distances
- and Distances Stefan Eckhardt Moritz G. Maass Sven KosubHanjo T "aubig Sebastian Wernicke ABCDEFGHIJ KLMNO
- Add To MetaCart
-
All-Pairs Common-Ancestor Problems in Weighted Dags
- Dags Matthias Baumgart Stefan Eckhardt Jan Griebsch Sven Kosub Johannes Nowak TUM-I0606 April 06 T E C
- Cited by 1 (1 self) – Add To MetaCart

