Andreas Pfandler

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Lower Bounds for QBFs of Bounded Treewidth Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science	2021-01-21	Paper
Backdoors to planning Artificial Intelligence	2019-08-28	Paper
Parameterized complexity of asynchronous border minimization Algorithmica	2019-01-11	Paper
Beyond IC postulates: classification criteria for merging operators	2018-07-12	Paper
Intra- and interdiagram consistency checking of behavioral multiview models Computer Languages, Systems & Structures	2018-05-15	Paper
Conformant planning as a case study of incremental QBF solving Annals of Mathematics and Artificial Intelligence	2017-08-15	Paper
Computational aspects of nearly single-peaked electorates Journal of Artificial Intelligence Research	2017-02-17	Paper
Fixed-parameter algorithms for closed world reasoning	2015-12-11	Paper
Democratix: a declarative approach to winner determination Algorithmic Decision Theory	2015-11-04	Paper
Manipulation of k-Approval in Nearly Single-Peaked Electorates Algorithmic Decision Theory	2015-11-04	Paper
Parameterized complexity of asynchronous border minimization Lecture Notes in Computer Science	2015-09-30	Paper
The complexity of handling minimal solutions in logic-based abduction Journal Of Logic And Computation	2015-07-15	Paper

Research outcomes over time

This page was built for person: Andreas Pfandler