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.

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001. An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. In Markus Bläser, Benjamin Monmege, editors, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). Volume 187 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Authors

Akanksha Agrawal

This author has not been identified. Look up 'Akanksha Agrawal' in Google

Lawqueen Kanesh

This author has not been identified. Look up 'Lawqueen Kanesh' in Google

Fahad Panolan

This author has not been identified. Look up 'Fahad Panolan' 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
runs on