"Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS."

Daniel Lokshtanov et al. (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-24766-9_38

access: closed

type: Conference or Workshop Paper

metadata version: 2020-11-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wads/LokshtanovR0SZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/LokshtanovR0SZ19
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537

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.