Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • 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
  • tree-decomposable graphs 2014-11-24 Paper A Faster Parameterized Algorithm for Treedepth 2014-07-01 Paper Kernelization Using Structural Parameters on Sparse Graph...
    10 bytes (16 words) - 09:53, 7 October 2023
  • 2023-02-03 Paper Compact representation of graphs with bounded bandwidth or treedepth 2022-06-08 Paper An improved bound on the burning number of graphs 2021-10-03...
    10 bytes (16 words) - 07:19, 7 October 2023
  • 2021-07-28 Paper Improved Bounds for the Excluded-Minor Approximation of Treedepth 2021-05-28 Paper https://portal.mardi4nfdi.de/entity/Q4986258 2021-04-27...
    10 bytes (16 words) - 14:19, 6 October 2023
  • constraint satisfaction 2020-03-25 Paper Integer programming and incidence treedepth 2020-02-06 Paper Homomorphism Reconfiguration via Homotopy 2020-01-31 Paper...
    10 bytes (17 words) - 06:00, 7 October 2023
  • de/entity/Q6068235 2023-11-13 Paper On the lossy kernelization for connected treedepth deletion set 2023-05-05 Paper On the optimality of pseudo-polynomial algorithms...
    10 bytes (19 words) - 00:03, 10 December 2023
  • Paper Integer programming and incidence treedepth 2020-02-06 Paper SAT-Encodings for Treecut Width and Treedepth 2019-09-13 Paper On Strict (Outer-)Confluent...
    10 bytes (17 words) - 07:10, 7 October 2023
  • tree-decomposable graphs 2014-11-24 Paper A Faster Parameterized Algorithm for Treedepth 2014-07-01 Paper Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking...
    10 bytes (16 words) - 09:53, 7 October 2023
  • de/entity/Q5091751 2022-07-27 Paper A polynomial excluded-minor approximation of treedepth 2022-03-29 Paper Shrinkage of Decision Lists and DNF Formulas 2020-12-09...
    10 bytes (16 words) - 11:44, 7 October 2023
  • clever shopper problem 2020-02-27 Paper Integer programming and incidence treedepth 2020-02-06 Paper Kernelization of graph Hamiltonicity: proper \(H\)-graphs...
    10 bytes (17 words) - 18:37, 24 September 2023
  • minor 2023-04-27 Paper Clustered colouring of graph classes with bounded treedepth or pathwidth 2023-04-03 Paper Extremal functions for sparse minors 2023-01-18...
    10 bytes (17 words) - 00:08, 11 December 2023
  • de/entity/Q6075921 2023-09-20 Paper Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space 2023-08-10 Paper On the...
    10 bytes (17 words) - 02:52, 7 October 2023
  • complexity of jumping block puzzles 2023-03-30 Paper Exploring the gap between treedepth and vertex cover through vertex integrity 2023-03-22 Paper https://portal...
    10 bytes (17 words) - 19:18, 6 October 2023
  • polynomial in height for posets with planar cover graphs 2024-01-15 Paper Treedepth vs circumference 2023-10-04 Paper https://portal.mardi4nfdi.de/entity/Q6168437...
    10 bytes (17 words) - 16:54, 6 October 2023
  • tree-decomposable graphs 2014-11-24 Paper A Faster Parameterized Algorithm for Treedepth 2014-07-01 Paper Exact algorithms for problems related to the densest \(k\)-set...
    10 bytes (17 words) - 04:34, 9 December 2023
  • 2021-06-11 Paper Improved Bounds for the Excluded-Minor Approximation of Treedepth 2021-05-28 Paper Empirical Evaluation of Approximation Algorithms for Generalized...
    10 bytes (18 words) - 09:05, 7 October 2023
  • Approximating Pathwidth for Graphs of Small Treewidth 2023-10-23 Paper Treedepth vs circumference 2023-10-04 Paper Subgraph densities in a surface 2023-03-31...
    10 bytes (16 words) - 14:01, 7 October 2023
  • graphs 2023-04-19 Paper Clustered colouring of graph classes with bounded treedepth or pathwidth 2023-04-03 Paper Lipschitz bijections between boolean functions...
    10 bytes (19 words) - 11:59, 9 December 2023
  • Approach to Branchwidth 2019-11-22 Paper SAT-Encodings for Treecut Width and Treedepth 2019-09-13 Paper Dependency Learning for QBF 2019-07-12 Paper Long-distance...
    10 bytes (17 words) - 02:43, 25 September 2023
View ( | ) (20 | 50 | 100 | 250 | 500)