"Parameterized Complexity of Geometric Covering Problems Having Conflicts."

Aritra Banik et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00600-W

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BanikPRSS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BanikPRSS20
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (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.