Pages that link to "Item:Q1759681"
From MaRDI portal
The following pages link to Algorithmic meta-theorems for restrictions of treewidth (Q1759681):
Displayed 40 items.
- Hull number: \(P_5\)-free graphs and reduction rules (Q299077) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Parameterized complexity of fair feedback vertex set problem (Q2663038) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- (Q3304104) (← links)
- (Q3305723) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q4605514) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
- (Q4625695) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5111743) (← links)
- (Q5111886) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Letter graphs and geometric grid classes of permutations: characterization and recognition (Q5918890) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)