Paradigms for parameterized enumeration

DOI10.1007/978-3-642-40313-2_27MaRDI QIDQ2849918zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Paradigms for parameterized enumeration
• scientific article; zbMATH DE number 2090012
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
• Parameterized and Exact Computation
• Parameterized enumeration for modification problems

Cited in

(9)

• Randomised enumeration of small witnesses using a decision oracle
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
• Paradigms for parameterized enumeration
• ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
• Parameterized enumeration for modification problems
• scientific article; zbMATH DE number 2090012 (Why is no real title available?)
• Enumeration complexity
• Parameterized and Exact Computation
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

This page was built for publication: Paradigms for parameterized enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849918)