External Links

Cite Key

Statistics

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

PDF

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.

FPT-approximation for FPT Problems

Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. FPT-approximation for FPT Problems. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 199-218, SIAM, 2022. [doi]

Authors

Daniel Lokshtanov

This author has not been identified. Look up 'Daniel Lokshtanov' in Google

Pranabendu Misra

This author has not been identified. Look up 'Pranabendu Misra' in Google

M. S. Ramanujan 0001

This author has not been identified. Look up 'M. S. Ramanujan 0001' in Google

Saket Saurabh 0001

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

Meirav Zehavi

This author has not been identified. Look up 'Meirav Zehavi' in Google
runs on