The following pages link to (Q4246749):
Displaying 10 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- (Q4915354) (← links)
