July 06, 2001 conference-paper Non-approximability results for optimization problems on bounded degree instances ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/380752.380839 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 217 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 Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs 2022 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research 0 citations 1 result References 0