Parameterized Enumeration for Modification Problems

DOI10.1007/978-3-319-15579-1_41zbMath1451.68136OpenAlexW4300518170WikidataQ57998294 ScholiaQ57998294MaRDI QIDQ2799203

Heribert Vollmer, Julian Müller, Arne Meier, Raida Ktari, Nadia Creignou, Frédéric Olive

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_41

zbMATH Keywords

enumerationparameterized complexitybounded search treeparameterized enumerationenumeration with ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Randomised enumeration of small witnesses using a decision oracle

Cites Work

• Unnamed Item
• On covering problems of codes
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• On generating all maximal independent sets
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Cluster graph modification problems
• Reverse search for enumeration
• Paradigms for Parameterized Enumeration
• Backdoors to Satisfaction
• Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
• Computing the Minimum Fill-In is NP-Complete
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• On generating all solutions of generalized satisfiability problems
• Node-and edge-deletion NP-complete problems
• A Polynomial Kernel for Proper Interval Vertex Deletion

This page was built for publication: Parameterized Enumeration for Modification Problems