Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537): Difference between revisions

@@ label / en / label / en @@
+Exploiting c-Closure in Kernelization Algorithms for Graph Problems
@@ Property / DOI @@
-.4230/LIPIcs.ESA.2020.65
@@ Property / DOI: 10.4230/LIPIcs.ESA.2020.65 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2020/12931/pdf/LIPIcs-ESA-2020-65.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W3082339973
@@ Property / OpenAlex ID: W3082339973 / rank @@
+Normal rank
@@ Property / title @@
+Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English)
+Normal rank
@@ Property / cites work @@
+Crown structures for vertex cover kernelization
@@ Property / cites work: Crown structures for vertex cover kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
+Normal rank
@@ Property / cites work @@
+Q3337224
@@ Property / cites work: Q3337224 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Code is \(W[1]\)-complete
@@ Property / cites work: Perfect Code is \(W[1]\)-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Crown reductions for the minimum weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
+Normal rank
@@ Property / cites work @@
+New results on maximum induced matchings in bipartite graphs and beyond
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+Some remarks on the theory of graphs
@@ Property / cites work: Some remarks on the theory of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved induced matchings in sparse graphs
@@ Property / cites work: Improved induced matchings in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Cliques in Social Networks: A New Distribution-Free Model
+Normal rank
@@ Property / cites work @@
+Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity for Domination Problems on Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Combinatorics
@@ Property / cites work: Extremal Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+On the induced matching problem
@@ Property / cites work: On the induced matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of the induced matching problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+FPT Algorithms for Domination in Biclique-Free Graphs
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ESA.2020.65
@@ Property / DOI: 10.4230/LIPICS.ESA.2020.65 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5874537