"FPT Algorithms for Finding Near-Cliques in c-Closed Graphs."

Balaram Behera et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITCS.2022.17

access: open

type: Conference or Workshop Paper

metadata version: 2023-11-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/innovations/BeheraH0RS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/BeheraH0RS22
Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri:
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS 2022: 17:1-17:24

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.