The following pages link to (Q4945215):
Displaying 9 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- (Q4506265) (← links)
- The ring grooming problem (Q4651930) (← links)
- On the complexity of Gödel's proof predicate (Q5190198) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728) (← links)