Search results
From MaRDI portal
- \(\mathcal{F} \)-minor-free deletion 2021-04-14 Paper A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion 2020-02-24...10 bytes (16 words) - 10:09, 25 September 2023
- kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion 2021-04-14 Paper Lower Bounds for Dynamic Programming on Planar Graphs...10 bytes (20 words) - 12:41, 7 October 2023
- 2012-04-19 Paper Perfect matchings in claw-free cubic graphs 2011-06-01 Paper Rank-width and tree-width of \(H\)-minor-free graphs 2010-10-18 Paper Computing rank-width...10 bytes (19 words) - 23:39, 9 December 2023
- graphs 2007-05-29 Paper Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs 2007-05-29 Paper Connected Graph Searching in Outerplanar...10 bytes (19 words) - 15:04, 10 December 2023
- matroids 2002-12-10 Paper Matroid 4-connectivity: A deletion-contraction theorem 2002-12-10 Paper Totally free expansions of matroids. 2002-12-10 Paper Branch-width...10 bytes (18 words) - 12:02, 13 December 2023
- 2002-12-10 Paper Matroid 4-connectivity: A deletion-contraction theorem 2002-12-10 Paper Totally free expansions of matroids. 2002-12-10 Paper Branch-width and...10 bytes (18 words) - 16:28, 9 December 2023
- \(H\)-minor-free graphs 2010-10-18 Paper Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions 2010-09-27 Paper Fast Minor Testing...10 bytes (19 words) - 23:54, 9 December 2023
- Long induced paths in minor-closed graph classes and beyond 2023-02-17 Paper Enumerating Minimal Dominating Sets in Triangle-Free Graphs 2022-07-18 Paper...10 bytes (18 words) - 14:13, 6 October 2023
- maximal cliques in $P_6$-free graphs of bounded clique number 2023-10-17 Paper (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on...10 bytes (18 words) - 09:05, 7 October 2023
- 2023-05-05 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering 2023-04-04 Paper Parameterized...10 bytes (16 words) - 16:38, 10 December 2023
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes 2021-10-04 Paper Parameterized Complexity of Conflict-Free Graph Coloring 2021-09-17 Paper...10 bytes (19 words) - 07:47, 9 December 2023
- for cycle-free saturation games 2022-07-04 Paper Robust Connectivity of Graphs on Surfaces 2022-06-23 Paper On 3-coloring of \((2P_4,C_5)\)-free graphs 2022-06-08...10 bytes (17 words) - 19:05, 24 September 2023
- Publication Date of Publication Type Edge separators for graphs excluding a minor 2024-02-16 Paper https://portal.mardi4nfdi.de/entity/Q6089654 2023-11-13...10 bytes (16 words) - 13:42, 7 October 2023
- Coloring Problems on H-Free Graphs 2013-03-21 Paper Detecting Induced Minors in AT-Free Graphs 2013-03-21 Paper Choosability on \(H\)-free graphs 2013-03-20...10 bytes (19 words) - 23:54, 9 December 2023
- subgraphs in c >t -free graphs in quasipolynomial time 2023-11-14 Paper Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs 2023-10-31...10 bytes (17 words) - 02:52, 7 October 2023
- Promise SAT on Non-Boolean Domains 2022-03-29 Paper Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes 2021-02-15 Paper Improved hardness...10 bytes (17 words) - 06:00, 7 October 2023
- 2013-03-21 Paper Choosability on \(H\)-free graphs 2013-03-20 Paper Exact algorithms for finding longest cycles in claw-free graphs 2013-03-05 Paper Computing...10 bytes (20 words) - 18:16, 11 December 2023
- planar graphs 2023-10-30 Paper Signed circuit $6$-covers of signed $K_4$-minor-free graphs 2023-10-25 Paper The average degree of edge chromatic critical...10 bytes (17 words) - 21:25, 9 December 2023
- Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. 2023-02-03 Paper Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations...10 bytes (16 words) - 23:41, 9 December 2023
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) 2016-07-22 Paper The Structure of $W_4$-Immersion-Free Graphs...10 bytes (18 words) - 07:10, 7 October 2023
