April 01, 2000 article Open access Some APX-completeness results for cubic graphs Theoretical Computer Science DOI: 10.1016/s0304-3975(98)00158-3 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 372 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 Algorithmic Persuasion with Evidence 2024 ACM Transactions on Economics and Computation article Decision Sciences Game Theory and Applications Open access 0 citations Stackelberg Max Closure with Multiple Followers 2022 Mathematics of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access 3 citations 2 results References 0