Skip to content

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

VenueA*STOC
Year2025
ProceedingsSTOC

Browse the full STOC paper archive.