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.

Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs

Ying Liu, Shiteng Chen. Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, editors, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. Volume 289 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Authors

Ying Liu

This author has not been identified. Look up 'Ying Liu' in Google

Shiteng Chen

This author has not been identified. Look up 'Shiteng Chen' in Google
runs on