"Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion ..."

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-319-26626-8_31

access: closed

type: Conference or Workshop Paper

metadata version: 2025-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/AravindSS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/AravindSS15
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. COCOA 2015: 424-438

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.