The following pages link to Andreas Pfandler (Q1749131):
Displaying 11 items.
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Backdoors to planning (Q2321271) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Computational Aspects of Nearly Single-Peaked Electorates (Q2962574) (← links)
- Manipulation of k-Approval in Nearly Single-Peaked Electorates (Q3449523) (← links)
- Democratix: A Declarative Approach to Winner Determination (Q3449538) (← links)
- (Q3457256) (← links)
- (Q4576184) (← links)
- Lower Bounds for QBFs of Bounded Treewidth (Q5145651) (← links)
- The complexity of handling minimal solutions in logic-based abduction (Q5262485) (← links)
