default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Pfandler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c26]Adrian Haret, Martin Lackner, Andreas Pfandler, Johannes Peter Wallner:
Proportional Belief Merging. AAAI 2020: 2822-2829- [c25]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
Lower Bounds for QBFs of Bounded Treewidth. LICS 2020: 410-424
2010 – 2019
- 2019
- [j6]Martin Kronegger, Sebastian Ordyniak
, Andreas Pfandler:
Backdoors to planning. Artif. Intell. 269: 49-75 (2019) - [j5]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. Algorithmica 81(1): 201-223 (2019) - [i5]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. CoRR abs/1910.01047 (2019) - 2017
- [j4]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80(1): 21-45 (2017) - [j3]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. J. Artif. Intell. Res. 58: 297-337 (2017) - [c24]Markus Endres, Andreas Pfandler:
PPI17 - Vorwort. BTW (Workshops) 2017: 155-157 - 2016
- [c23]Adrian Haret, Andreas Pfandler, Stefan Woltran:
Beyond IC Postulates: Classification Criteria for Merging Operators. ECAI 2016: 372-380 - [c22]Markus Endres, Andreas Pfandler:
Unsere Empfehlung für Sie: Präferenzen und Personalisierung in der Informatik. GI-Jahrestagung 2016: 1927-1934 - 2015
- [j2]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
Intra- and interdiagram consistency checking of behavioral multiview models. Comput. Lang. Syst. Struct. 44: 72-88 (2015) - [j1]Andreas Pfandler, Reinhard Pichler, Stefan Woltran:
The complexity of handling minimal solutions in logic-based abduction. J. Log. Comput. 25(3): 805-825 (2015) - [c21]Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler:
Variable-Deletion Backdoors to Planning. AAAI 2015: 3305-3312 - [c20]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Manipulation of k-Approval in Nearly Single-Peaked Electorates. ADT 2015: 71-85 - [c19]Günther Charwat, Andreas Pfandler:
Democratix: A Declarative Approach to Winner Determination. ADT 2015: 253-269 - [c18]Andreas Pfandler, Emanuel Sallinger:
Distance-Bounded Consistent Query Answering. IJCAI 2015: 2262-2269 - [c17]Ronald de Haan, Martin Kronegger, Andreas Pfandler:
Fixed-Parameter Tractable Reductions to SAT for Planning. IJCAI 2015: 2897-2903 - [c16]Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran:
On the Parameterized Complexity of Belief Revision. IJCAI 2015: 3149-3155 - [c15]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. TAMC 2015: 428-440 - [i4]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. CoRR abs/1503.08078 (2015) - 2014
- [c14]Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler:
A Parameterized Complexity Analysis of Generalized CP-Nets. AAAI 2014: 1091-1097 - [c13]Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler:
Backdoors to Planning. AAAI 2014: 2300-2307 - [c12]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. AISC 2014: 120-131 - [c11]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
A SAT-Based Debugging Tool for State Machines and Sequence Diagrams. SLE 2014: 21-40 - [i3]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR abs/1405.7253 (2014) - 2013
- [c10]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. AAAI 2013: 283-289 - [c9]Martin Kronegger, Andreas Pfandler, Reinhard Pichler:
Parameterized Complexity of Optimal Planning: A Detailed Map. IJCAI 2013: 954-961 - [c8]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. IJCAI 2013: 1046-1052 - [c7]Mario Alviano, Francesco Calimeri, Günther Charwat, Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Jörg Pührer, Christoph Redl, Francesco Ricca, Patrik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao:
The Fourth Answer Set Programming Competition: Preliminary Report. LPNMR 2013: 42-53 - [c6]Günther Charwat, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Andreas Pfandler, Christoph Redl, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao:
VCWC: A Versioning Competition Workflow Compiler. LPNMR 2013: 233-238 - [c5]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. MoDeVVa@MoDELS 2013: 31-40 - [i2]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. CoRR abs/1304.5961 (2013) - 2012
- [c4]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele:
The Parameterized Complexity of Abduction. AAAI 2012: 743-749 - [c3]Martin Lackner, Andreas Pfandler:
Fixed-Parameter Algorithms for Closed World Reasoning. ECAI 2012: 492-497 - [c2]Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond:
Train Marshalling Is Fixed Parameter Tractable. FUN 2012: 51-56 - [c1]Martin Lackner, Andreas Pfandler:
Fixed-Parameter Algorithms for Finding Minimal Models. KR 2012 - [i1]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. CoRR abs/1211.2627 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
