Space-efficient parameterized algorithms on graphs of low shrubdepth
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 7650914 (Why is no real title available?)
- scientific article; zbMATH DE number 7650941 (Why is no real title available?)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Branch-depth: generalizing tree-depth of graphs
- Canonical decompositions in monadically stable and bounded shrubdepth graph classes
- Computing treedepth in polynomial space and linear FPT time
- Easy problems for tree-decomposable graphs
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Fast FPT-approximation of branchwidth
- First-order interpretations of bounded expansion classes
- Fourier meets M\"{o}bius: fast subset convolution
- Fundamentals of parameterized complexity
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space
- Hardness of metric dimension in graphs of constant treewidth
- Intractability of clique-width parameterizations
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- Linear time solvable optimization problems on graphs of bounded clique-width
- Matching is as easy as matrix inversion
- Multi-clique-width
- On space efficiency of algorithms working on structural decompositions of graphs
- On the complexity of problems on tree-structured graphs
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parameterized algorithms
- Parameterized complexity and approximability of the longest compatible sequence problem
- Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters
- Parameterized complexity of firefighting
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Planar k-path in subexponential time and polynomial space
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Space saving by dynamic algebraization based on tree-depth
- Space-efficient parameterized algorithms on graphs of low shrubdepth
- The firefighter problem for graphs of maximum degree three
- The firefighter problem: further steps in understanding its complexity
- The parameterized complexity of sequence alignment and consensus
- Tight hardness results for LCS and other sequence similarity measures
- Transducing paths in graph classes with unbounded shrubdepth
- Treelike decompositions for transductions of sparse graphs
- Width-parametrized SAT: time-space tradeoffs
- XNLP-completeness for parameterized problems on graphs with a linear structure
- \(k\)-NLC graphs and polynomial algorithms
This page was built for publication: Space-efficient parameterized algorithms on graphs of low shrubdepth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907153)
