Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of finding independent sets in bounded degree (hyper)graphs ..."

Venkatesan Guruswami, Ali Kemal Sinop (2011)

> Home

Details and statistics

DOI: 10.1137/1.9781611973082.125

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/GuruswamiS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GuruswamiS11
Venkatesan Guruswami, Ali Kemal Sinop:
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. SODA 2011: 1615-1626

a service of

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.