|
41 |
Trees, taxonomy, and strongly compatible multi-state characters
Dress, Andreas W. M.. - Bielefeld : Univ., 1996
|
|
|
|
42 |
Analyzing and visualizing sequence and distance data using splits tree
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
43 |
Rewarding maps - on greedy optimization of set functions
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
44 |
T-theory
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
45 |
The real tree
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
46 |
Tilings and symbols
Delgado, Olaf. - Bielefeld : Univ., 1995
|
|
|
|
47 |
Well-layered maps - a class of greedily optimizable set functions
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
48 |
Well-layered maps and the maximum-degree k x k-subdeterminant of a matrix of rational functions
Dress, Andreas W. M.. - Bielefeld : Univ., 1995
|
|
|
|
49 |
A relational approach to split decomposition
Bandelt, Hans-Jürgen. - Bielefeld : Univ., Forschungsschwerpunkt Mathematisierung, [1994]
|
|
|
|
50 |
Cellular automata, a simple approach to complexity
Dress, Andreas W. M.. - Bielefeld : Univ., Forschungsschwerpunkt Mathematisierung, [1994]
|
|
Administration
