The following pages link to Markus Hecher (Q1647690):
Displaying 13 items.
- Exploiting treewidth for projected model counting and its limits (Q1656576) (← links)
- Treewidth and counting projected answer sets (Q2326718) (← links)
- Answer set solving with bounded treewidth revisited (Q2401930) (← links)
- Taming high treewidth with abstraction, nested dynamic programming, and database technology (Q2661361) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q2694570) (← links)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- The D-FLAT System for Dynamic Programming on Tree Decompositions (Q2938522) (← links)
- (Q5009587) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) (Q5875560) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
