Authors: DUDAS T KLINZ B WOEGINGER GJ

Citation: T. Dudas et al., THE COMPUTATIONAL-COMPLEXITY OF THE K-MINIMUM SPANNING TREE PROBLEM IN GRADED MATRICES, Computers & mathematics with applications (1987), 36(5), 1998, pp. 61-67

Authors: KLINZ B WOEGINGER GJ

Citation: B. Klinz et Gj. Woeginger, ONE, 2, 3, MANY, OR - COMPLEXITY ASPECTS OF DYNAMIC NETWORK FLOWS WITH DEDICATED ARCS, Operations research letters, 22(4-5), 1998, pp. 119-127

Authors: DUDAS T KLINZ B WOEGINGER GJ

Citation: T. Dudas et al., THE COMPUTATIONAL-COMPLEXITY OF STEINER TREE PROBLEMS IN GRADED MATRICES, Applied mathematics letters, 10(4), 1997, pp. 35-39

Authors: BURKARD RE KLINZ B RUDOLF R

Citation: Re. Burkard et al., PERSPECTIVES OF MONGE PROPERTIES IN OPTIMIZATION, Discrete applied mathematics, 70(2), 1996, pp. 95-161

Authors: KLINZ B RUDOLF R WOEGINGER GJ

Citation: B. Klinz et al., ON THE RECOGNITION OF PERMUTED BOTTLENECK MONGE MATRICES, Discrete applied mathematics, 63(1), 1995, pp. 43-74

Authors: KLINZ B RUDOLF R WOEGINGER GJ

Citation: B. Klinz et al., PERMUTING MATRICES TO AVOID FORBIDDEN SUBMATRICES, Discrete applied mathematics, 60(1-3), 1995, pp. 223-248