Search results
- FRANK, András. Augmenting Graphs to Meet Edge - Connectivity Requirements. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 42 s. Report, No.90634 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- FRANK, András. Conservative Weightings and Ear-Decomposition of Graphs. 1. ed. Bonn : Inst. für Ökon. und Operations Research, 1989. 21 s. Report, No.89618-OR. [Copy count : 2, currently available 2, at library only 0]
book
- FRANK, András. Packing Paths in Planar Graphs. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1989. 8 s. Report, No.88551 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- FRANK, András. Graph Connectivity and Network Flows. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1987. 72 s. Report, No.87473-OR. [Copy count : 1, currently available 1, at library only 0]
book
- FRANK, András - TARDOS, Éva. An Application of the simultaneous approximation in combinatorial optimization. Bonn : Institut für Ökonometrie und Operations Research, 1985. 14 s. Report, No. 85375. [Copy count : 1, currently available 1, at library only 0]
book
- FRANK, András. Edge-disjoint paths in planar graphs. Bonn : Institut für Ökonometrie und Operations Research, 1984. 19 s. Report, No. 84357-OR. [Copy count : 1, currently available 1, at library only 0]
book
- FRANK, András. Finding feasible vectors of Edmonds-Gilles polyhedra. Bonn : Institut für Ökonometrie und Operations Research, 1981. 24 s. Report, No. 81205-OR. [Copy count : 1, currently available 1, at library only 0]
book