Paradigms for parameterized enumeration (Q2398214): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57998263
@@ Property / Wikidata QID: Q57998263 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1772241399
@@ Property / OpenAlex ID: W1772241399 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2171
@@ Property / arXiv ID: 1306.2171 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+On generating all solutions of generalized satisfiability problems
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Paradigms for Parameterized Enumeration
@@ Property / cites work: Paradigms for Parameterized Enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
+Normal rank
@@ Property / cites work @@
+Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
+Normal rank
@@ Property / cites work @@
+Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808679
@@ Property / cites work: Q4808679 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Kernel for Proper Interval Vertex Deletion
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of acyclic and almost acyclic CNF formulas
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2398214