"On the Complexity of Some Colorful Problems Parameterized by Treewidth."

Michael R. Fellows et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-73556-4_38

access: closed

type: Conference or Workshop Paper

metadata version: 2025-05-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/FellowsFLRSST07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/FellowsFLRSST07
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377

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.