1. Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form;Murota,1995
2. K. Murota, Finding optimal minors of valuated bimatroids, Appl. Math. Lett. (to appear).
3. Eine Kennzeichnung gut optimierbarer Funktionenklassen, Staatsexamensarbeit Bielefeld;Hadasch,1992
4. A.W.M. Dress and W. Terhalle, Well-layered maps—A class of greedily optimizable set functions, Appl. Math. Lett. (to appear).
5. Valuated matroids: A new look at the greedy algorithm;Dress;Appl. Math. Lett.,1990