The following pages link to (Q3118384):
Displaying 21 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- (Q4972729) (← links)
- (Q5002812) (← links)
- (Q5005129) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5091010) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- (Q5109514) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Twin-treewidth: a single-exponential logic-based approach (Q6606218) (← links)
