September 01, 1986 article Graph minors. II. Algorithmic aspects of tree-width Journal of Algorithms DOI: 10.1016/0196-6774(86)90023-4 OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 1,560 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Perfect Matching Under Precedence Constraints 2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access 0 citations An Investigation of the Recoverable Robust Assignment Problem 2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access 6 citations Minimum color‐degree perfect b‐matchings 2020 Networks article Computer Science Complexity and Algorithms in Graphs Open access 1 citations 3 results References 0