Search results
From MaRDI portal
- Date of Publication Type Spy game: FPT-algorithm and results on graph products 2023-03-30 Paper Spy game: FPT-algorithm, hardness and graph products 2022-06-13...10 bytes (18 words) - 03:45, 12 December 2023
- Directed Grid Theorem into an FPT Algorithm 2022-08-31 Paper Adapting the directed grid theorem into an \textsf{FPT} algorithm 2022-04-27 Paper A proof for...10 bytes (18 words) - 13:34, 28 January 2024
- game: FPT-algorithm and results on graph products 2023-03-30 Paper Hardness of variants of the graph coloring game 2022-10-13 Paper Spy game: FPT-algorithm...10 bytes (18 words) - 10:10, 11 December 2023
- adhesion based on nonlinear foundation 2021-12-17 Paper An improved FPT algorithm for the flip distance problem 2021-11-25 Paper Many-visits TSP revisited...10 bytes (17 words) - 20:44, 11 December 2023
- 2014-04-14 Paper Kernel and fast algorithm for dense triplet inconsistency 2014-01-10 Paper A Faster FPT Algorithm for Bipartite Contraction 2013-12-10 Paper...10 bytes (16 words) - 19:13, 11 December 2023
- Paper The connected greedy coloring game 2023-04-20 Paper Spy game: FPT-algorithm and results on graph products 2023-03-30 Paper Domination and convexity...10 bytes (18 words) - 02:38, 10 December 2023
- Directed Grid Theorem into an FPT Algorithm 2022-08-31 Paper Adapting the directed grid theorem into an \textsf{FPT} algorithm 2022-04-27 Paper Restricted...10 bytes (18 words) - 14:41, 6 October 2023
- Type On computing an optimal semi-matching 2017-10-09 Paper A faster FPT algorithm for 3-path vertex cover 2016-01-05 Paper On the vertex \(k\)-path cover...10 bytes (16 words) - 12:17, 12 December 2023
- split graphs, cographs, and partial \(k\)-trees 2019-06-06 Paper An FPT algorithm for planar multicuts with sources and sinks on the outer face 2019-01-11...10 bytes (16 words) - 12:43, 11 December 2023
- components 2023-12-22 Paper Adapting the Directed Grid Theorem into an FPT Algorithm 2022-08-31 Paper https://portal.mardi4nfdi.de/entity/Q5089241 2022-07-18...10 bytes (18 words) - 10:56, 7 October 2023
- its applications 2018-03-15 Paper An FPT 2-approximation for tree-cut decomposition 2018-02-28 Paper An FPT algorithm and a polynomial kernel for linear...10 bytes (17 words) - 19:22, 6 October 2023
- Publication Type An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth 2024-02-20 Paper A polynomial algorithm for deciding the...10 bytes (16 words) - 10:18, 7 October 2023
- Paper Parameterized Approximation Problems 2008-06-03 Paper A faster FPT algorithm for the maximum agreement forest problem 2007-12-19 Paper Online promise...10 bytes (16 words) - 23:47, 11 December 2023
- https://portal.mardi4nfdi.de/entity/Q3526581 2008-09-25 Paper A faster FPT algorithm for the maximum agreement forest problem 2007-12-19 Paper A fixed-parameter...10 bytes (18 words) - 17:12, 13 December 2023
- Publication Date of Publication Type An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem 2007-12-19 Paper Computing...10 bytes (16 words) - 17:08, 24 September 2023
- sets in graphs: parameterized and exact computation 2023-04-12 Paper An FPT algorithm for matching cut and d-cut 2022-03-22 Paper...10 bytes (16 words) - 23:43, 24 September 2023
- 2023-06-23 Paper Optimal tree decompositions revisited: a simpler linear-time FPT algorithm 2021-12-08 Paper Computing Euclidean Steiner trees over segments 2021-01-20...10 bytes (16 words) - 22:56, 24 September 2023
- Publication Type Improved FPT algorithm for feedback vertex set problem in bipartite tournament 2010-03-24 Paper Improved approximation algorithm for the feedback...10 bytes (16 words) - 10:01, 6 October 2023
- https://portal.mardi4nfdi.de/entity/Q5111296 2020-05-26 Paper A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly...10 bytes (18 words) - 22:17, 24 September 2023
- de/entity/Q4560236 2018-12-10 Paper Ruling out FPT algorithms for weighted coloring on forests 2018-05-17 Paper Ruling out FPT algorithms for weighted coloring on forests...10 bytes (18 words) - 03:48, 12 December 2023
