April 01, 1989 article Open access Linear time algorithms for NP-hard problems restricted to partial k-trees Discrete Applied Mathematics DOI: 10.1016/0166-218x(89)90031-0 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 581 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 The Complexity of Homomorphism Reconstructibility 2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access 0 citations 1 result References 0