Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Karl Bringmann, Jasper Slusallek

Journal title: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Published year: 2021