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.

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001. ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. In Mikolaj Bojanczyk, Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Volume 213 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Authors

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google

Tanmay Inamdar 0002

This author has not been identified. Look up 'Tanmay Inamdar 0002' in Google

Saket Saurabh 0001

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