Pages that link to "Item:Q1886318"
From MaRDI portal
The following pages link to The complexity of first-order and monadic second-order logic revisited (Q1886318):
Displaying 50 items.
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- To drive or not to drive: a logical and computational analysis of European transport regulations (Q821552) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- The tree-width of C (Q2174562) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- (Q3384888) (← links)
- (Q3386630) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q4605514) (← links)
- (Q4625695) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
