Pages that link to "Item:Q2719133"
From MaRDI portal
The following pages link to Fixed-Parameter Tractability, Definability, and Model-Checking (Q2719133):
Displaying 30 items.
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Simplifying the weft hierarchy (Q820144) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- On the fixed-parameter tractability of parameterized model-checking problems (Q963328) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- (Q4972729) (← links)
- (Q5002812) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5091010) (← links)
- (Q5111868) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5874521) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
