"Tight Running Time Lower Bounds for Vertex Deletion Problems."

Christian Komusiewicz (2018)

> Home

Details and statistics

DOI: 10.1145/3186589

access: closed

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/Komusiewicz18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/Komusiewicz18
Christian Komusiewicz:
Tight Running Time Lower Bounds for Vertex Deletion Problems. ACM Trans. Comput. Theory 10(2): 6:1-6:18 (2018)

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.