activity
20222026
most citedDeontic Paradoxes in ASP with Weak Constraints

6 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2022

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Cornelius Brand, Esra Ceylan, Christian Hatschka +2

Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by tre…