External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Short Cycles Make ::::W:::: -hard Problems Hard: FPT Algorithms for ::::W:::: -hard Problems in Graphs with no Short Cycles

Venkatesh Raman, Saket Saurabh. Short Cycles Make ::::W:::: -hard Problems Hard: FPT Algorithms for ::::W:::: -hard Problems in Graphs with no Short Cycles. Algorithmica, 52(2):203-225, 2008. [doi]

Authors

Venkatesh Raman

This author has not been identified. Look up 'Venkatesh Raman' in Google

Saket Saurabh

This author has not been identified. Look up 'Saket Saurabh' in Google
runs on