The following pages link to (Q2954991):
Displayed 15 items.
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- (Q5090465) (← links)
- (Q5092423) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)