The following pages link to Michael Abseher (Q2938521):
Displaying 5 items.
- The D-FLAT System for Dynamic Programming on Tree Decompositions (Q2938522) (← links)
- Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (Q2985109) (← links)
- Computing secure sets in graphs using answer set programming (Q3304090) (← links)
- Shift Design with Answer Set Programming (Q3449188) (← links)
- Shift Design with Answer Set Programming* (Q4589186) (← links)
