The following pages link to (Q3086928):
Displaying 24 items.
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- An approval-based model for single-step liquid democracy (Q2670941) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- (Q4972729) (← links)
- (Q5002820) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5091010) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5874521) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
