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.

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant. Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. In Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté, editors, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. Volume 254 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Pierre Bergé

This author has not been identified. Look up 'Pierre Bergé' in Google

Édouard Bonnet

This author has not been identified. Look up 'Édouard Bonnet' in Google

Hugues Déprés

This author has not been identified. Look up 'Hugues Déprés' in Google

Rémi Watrigant

This author has not been identified. Look up 'Rémi Watrigant' in Google
runs on