Search results
From MaRDI portal
- Paper Tree decompositions and social graphs 2021-03-26 Paper Polynomial treedepth bounds in linear colorings 2021-02-01 Paper Approximating V<scp>ertex</scp>...10 bytes (18 words) - 06:01, 13 December 2023
- Publication Date of Publication Type Polynomial treedepth bounds in linear colorings 2021-02-01 Paper https://portal.mardi4nfdi.de/entity/Q5111296 2020-05-26...10 bytes (18 words) - 22:17, 24 September 2023
- routing networks 2021-04-22 Paper Polynomial treedepth bounds in linear colorings 2021-02-01 Paper Treedepth bounds in linear colorings 2018-11-22 Paper...10 bytes (16 words) - 22:17, 24 September 2023
- Exploring the gap between treedepth and vertex cover through vertex integrity 2023-03-22 Paper Exploring the gap between treedepth and vertex cover through...10 bytes (16 words) - 09:18, 25 September 2023
- of Publication Type Efficient interprocedural data-flow analysis using treedepth and treewidth 2023-08-17 Paper Non-polynomial worst-case analysis of recursive...10 bytes (18 words) - 03:21, 13 December 2023
- Parameterized by Treedepth in Single Exponential Time and Polynomial Space 2023-08-10 Paper Hamiltonian cycle parameterized by treedepth in single exponential...10 bytes (20 words) - 17:16, 6 October 2023
- Parameterized by Treedepth in Single Exponential Time and Polynomial Space 2023-08-10 Paper Hamiltonian cycle parameterized by treedepth in single exponential...10 bytes (16 words) - 17:16, 6 October 2023
- Approach to Branchwidth 2019-11-22 Paper SAT-Encodings for Treecut Width and Treedepth 2019-09-13 Paper SAT-based local improvement for finding tree decompositions...10 bytes (16 words) - 20:34, 24 September 2023
- mardi4nfdi.de/entity/Q6089682 2023-11-13 Paper A heuristic approach to the treedepth decomposition problem for large graphs 2022-06-08 Paper New models and...10 bytes (16 words) - 09:51, 25 September 2023
- \(\chi\)-boundedness 2024-04-09 Paper Pathwidth vs Cocircumference 2024-03-14 Paper Treedepth vs circumference 2023-10-04 Paper https://portal.mardi4nfdi.de/entity/Q6168437...10 bytes (16 words) - 06:00, 7 October 2023
- Publication Date of Publication Type Exploring the gap between treedepth and vertex cover through vertex integrity 2023-03-22 Paper Parameterized Complexity...10 bytes (16 words) - 19:18, 6 October 2023
- Publication Date of Publication Type A heuristic approach to the treedepth decomposition problem for large graphs 2022-06-08 Paper Classification of de...10 bytes (17 words) - 13:32, 12 December 2023
- Pathwidth and Treewidth 2015-09-15 Paper A Faster Parameterized Algorithm for Treedepth 2014-07-01 Paper Kernelization Using Structural Parameters on Sparse Graph...10 bytes (18 words) - 09:53, 7 October 2023
- 2021-10-26 Paper Improved Bounds for the Excluded-Minor Approximation of Treedepth 2021-05-28 Paper Empirical Evaluation of Approximation Algorithms for Generalized...10 bytes (16 words) - 01:15, 25 September 2023
- power deletion 2023-10-06 Paper On the lossy kernelization for connected treedepth deletion set 2023-05-05 Paper A Colored Path Problem and Its Applications...10 bytes (16 words) - 18:37, 24 September 2023
- approximability of the happy set problem 2023-09-21 Paper Exploring the gap between treedepth and vertex cover through vertex integrity 2023-03-22 Paper https://portal...10 bytes (16 words) - 19:28, 6 October 2023
- directed trees in a digraph 2023-03-30 Paper Exploring the gap between treedepth and vertex cover through vertex integrity 2023-03-22 Paper https://portal...10 bytes (16 words) - 09:17, 7 October 2023
- bin packing with budgeted uncertainty 2020-01-16 Paper How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? 2019-09-10...10 bytes (16 words) - 23:41, 9 December 2023
- graph classes 2023-06-12 Paper On the lossy kernelization for connected treedepth deletion set 2023-05-05 Paper Constrained hitting set problem with intervals...10 bytes (16 words) - 12:32, 7 October 2023
- Parameterized complexity of multicut in weighted trees 2023-10-12 Paper Treedepth vs circumference 2023-10-04 Paper Balanced substructures in bicolored graphs...10 bytes (16 words) - 03:44, 7 October 2023
