The following pages link to (Q3077955):
Displaying 50 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Clique-width of path powers (Q266933) (← links)
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Contextual hyperedge replacement (Q493120) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- Second-order propositional modal logic: expressiveness and completeness results (Q1731834) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← 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)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
