Pages that link to "Item:Q3638049"
From MaRDI portal
The following pages link to Incompressibility through Colors and IDs (Q3638049):
Displaying 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Backdoors to planning (Q2321271) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Color Spanning Objects: Algorithms and Hardness Results (Q2795933) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)