"Parameterized Complexity of Independent Set in H-Free Graphs."

Édouard Bonnet et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00730-6

access: closed

type: Journal Article

metadata version: 2025-04-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BonnetBCTW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BonnetBCTW20
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020)

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.