Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-018-0431-8
@@ Property / DOI: 10.1007/s00453-018-0431-8 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-018-0431-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2795452868
@@ Property / OpenAlex ID: W2795452868 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating maximal independent sets with applications to graph colouring.
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization and Sparseness: the case of Dominating Set
+Normal rank
@@ Property / cites work @@
+Improved FPT algorithms for weighted independent set in bull-free graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum feedback vertex set problem: Exact and enumeration algorithms
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
+Normal rank
@@ Property / cites work @@
+A randomized polynomial kernel for subset feedback vertex set
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Representative Sets and Irrelevant Vertices
@@ Property / cites work: Representative Sets and Irrelevant Vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Compression via Matroids
@@ Property / cites work: Compression via Matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320435
@@ Property / cites work: Q3320435 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms through enumerating maximal independent sets and other techniques
+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 @@
+A polynomial Turing-kernel for weighted independent set in bull-free graphs
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00453-018-0431-8
@@ Property / DOI: 10.1007/S00453-018-0431-8 / rank @@
+Normal rank