| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 30948 (Why is no real title available?) | 1992-06-28 | Paper |
Random pseudo-polynomial algorithms for exact matroid problems
Journal of Algorithms | 1992-06-28 | Paper |
The image of weighted combinatorial problems
Annals of Operations Research | 1992-06-27 | Paper |
Polymatroids: Construction and random algorithms
Calcolo | 1992-06-26 | Paper |
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Multi-constrained matroidal knapsack problems
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3980505 (Why is no real title available?) | 1986-01-01 | Paper |
Most and least uniform spanning trees
Discrete Applied Mathematics | 1986-01-01 | Paper |
Some experience in applying a stochastic method to location problems
Mathematical Programming Studies | 1986-01-01 | Paper |
Linking-Centers and Reliable-Trees of a Network
IEEE Transactions on Reliability | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900496 (Why is no real title available?) | 1985-01-01 | Paper |
The matroidal knapsack: A class of (often) well-solvable problems
Operations Research Letters | 1984-01-01 | Paper |
Unlabelled Partition Systems: Optimization and Complexity
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
On the complexity of finding multi-constrained spanning trees
Discrete Applied Mathematics | 1983-01-01 | Paper |
The Bounded Path Tree Problem
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3672014 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3731752 (Why is no real title available?) | 1980-01-01 | Paper |
Complexity of spanning tree problems: Part I
European Journal of Operational Research | 1980-01-01 | Paper |
Thek best spanning arborescences of a network
Networks | 1980-01-01 | Paper |
Ranking arborescences in O(Km log n) time
European Journal of Operational Research | 1980-01-01 | Paper |
Polynomial bounding for NP-hard problems
Mathematical Programming Studies | 1980-01-01 | Paper |
A note on finding optimum branchings
Networks | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3639649 (Why is no real title available?) | 1978-01-01 | Paper |
The Min-Max Spanning Tree Problem and some extensions
Information Processing Letters | 1978-01-01 | Paper |
Heuristically guided algorithm for k-parity matroid problems
Discrete Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3543817 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3557512 (Why is no real title available?) | 1975-01-01 | Paper |
Bounds for 3-matroid intersection problems
Information Processing Letters | 1975-01-01 | Paper |
