Skip to content

A4C.1 Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

ICALP 202189 subscribers

About this video

Advanced · Editorial review

Whole-channel inclusion: ICALP 2021 (title sample: This is a full recording archive of ICALP 2021 academic conference talks presenting original theoretical computer science research, which squarely fits expert technical talks/primary-source proceedings.; 3 of 3 sampled transcripts read as real teaching); this title passed a strict title check.

Video by ICALP 2021, played through YouTube's embedded player.