Improved kernel results for some FPT problems based on simple observations (Q507431): Difference between revisions

@@ Property / author @@
-Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
-Normal rank
@@ Property / author @@
+Jian'er Chen
@@ Property / author: Jian'er Chen / 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://doi.org/10.1016/j.tcs.2016.06.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2425261484
@@ Property / OpenAlex ID: W2425261484 / rank @@
+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 @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized computational complexity of Dodgson and Young elections
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Cluster editing: kernelization based on edge cuts
@@ Property / cites work: Cluster editing: kernelization based on edge cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Domination Problems in Nowhere-Dense Classes
@@ Property / cites work: Domination Problems in Nowhere-Dense Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The Parametrized Complexity of Some Fundamental Problems in Coding Theory
+Normal rank
@@ Property / cites work @@
+Matching and weighted \(P_2\)-packing: algorithms and kernels
+Normal rank
@@ Property / cites work @@
+Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
+Normal rank
@@ Property / cites work @@
+Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
+Normal rank
@@ Property / cites work @@
+Parameterized algorithmics for linear arrangement problems
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity for Domination Problems on Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity in AI and nonmonotonic reasoning
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Contracting graphs to paths and trees
@@ Property / cites work: Contracting graphs to paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and parameterized algorithms for cograph editing
+Normal rank
@@ Property / cites work @@
+A linear kernel for a planar connected dominating set
+Normal rank
@@ Property / cites work @@
+Improved linear problem kernel for planar connected dominating set
+Normal rank
@@ Property / cites work @@
+Chordal deletion is fixed-parameter tractable
@@ Property / cites work: Chordal deletion is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+The kernelization complexity of connected domination in graphs with (no) small cycles
+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 @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of control and bribery for \(d\)-approval elections
+Normal rank
@@ Property / cites work @@
+Planar graph vertex partition for linear problem kernels
+Normal rank
@@ Property / cites work @@
+A practical exact algorithm for the individual haplotyping problem MEC/GI
+Normal rank
@@ Property / cites work @@
+Radiation hybrid map construction problem parameterized
+Normal rank