Kernelizations for Parameterized Counting Problems

DOI10.1007/978-3-540-72504-6_64zbMath1200.68127OpenAlexW2122202324MaRDI QIDQ5425483

Marc Thurley

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_64

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Compactors for parameterized counting problems ⋮ Unnamed Item ⋮ Confronting intractability via parameters ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ On the complexity of finding and counting solution-free sets of integers ⋮ Unnamed Item

This page was built for publication: Kernelizations for Parameterized Counting Problems