55 citations · 277 across the 43 of their papers we have counts for
Showing 2017 · cs.LOShow all
2 papers · 2 filters
cs.LO2017
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Johannes K. Fichte, Markus Hecher, Michael Morak +1
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing pra…
cs.LO2017
Answer Set Solving with Bounded Treewidth Revisited
Johannes Fichte, Markus Hecher, Michael Morak +1
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of…