Search results
- ERDÖS, Péter L. Enumeration of Rooted Forests. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 12 s. Report, No.90631 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- HOÁNG, Chính T. - MAFFRAY, Frédéric - PREISSMANN, Myriam. New Properties of Perfectly Orderable Graphs and Strongly Perfect Graphs. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 16 s. Report, No.90641 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- KOVALEV, M.M. - PISARUK, N.N. Greedy Algorithms on Convex-Ordered Sets. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 11 s. Report, No.90640 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- TRICK, Michael A. A Tutorial on Network Flows and Machings. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 101 s. Report, No.89621 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- HOÁNG, Chính T. Recognition and Optimization Algorithms for Co - Triangulated Graphs. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 11 s. Report, No.90637 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- LOEBL, Martin. Unprovable Combinatorial Statements. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 12 s. Report, No.90633 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- 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
- HOÁNG, Ghính T. Algorithms for Minimum Weighted Colouring of Perfectly Ordered, Comparability, Triangulated, and Clique Separable Graphs. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 12 s. Report, 90632 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- PRÖMEL, Hans Jürgen - STEGER, Angelika. Excluding Induced Subgraphs 2 : Extremal Graphs. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 13 s. Report, No.90642 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- HOÁNG, Chính T. The Complexity of Recognizing Weakly Triangulated Graphs That Are Perfectly Orderable. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 7 s. Report, No.90638 - OR. [Copy count : 1, currently available 1, at library only 0]
book