"Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs."

Jana Novotná et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2019.23

access: open

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/NovotnaOPRLW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/NovotnaOPRLW19
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11

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.