January 01, 1978 conference-paper Open access Node-and edge-deletion NP-complete problems ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/800133.804355 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 444 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 Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems 2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access 0 citations Online Node- and Edge-Deletion Problems with Advice 2021 Algorithmica article Computer Science Optimization and Search Problems Open access 7 citations Further Results on Online Node- and Edge-Deletion Problems with Advice 2020 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access 1 citations 3 results References 0