Univ.Ass. Dipl.-Ing.
Andreas Pfandler
Vienna University of Technology
Institute of Information Systems
Database and Artificial Intelligence Group
| Address |
Favoritenstraße 9-11/184-2 1040 Wien, Austria |
|---|---|
| "lastname" [at] dbai tuwien ac at | |
| Phone | +43-1-58801-18436 |
| Fax | +43-1-58801-18493 |
| Room | HA 03 32 |
| Office Hours | by appointment |
| TU-Whitepages | Andreas Pfandler |
About
Currently, I am a PhD student and faculty member (research and teaching assistant) at the Database and Artificial Intelligence Group at the Vienna Technnical University of Technology. My advisor is Reinhard Pichler. I hold a Master's degree in Computational Intelligence and a Bachelor's degree in Medizinische Informatik (Medical Computer Science). My current work is related to the project "Fixed-Parameter Tractability in Artificial Intelligence and Reasoning" (FAIR). Before that I have been contributing to the project Turning Theoretical Tractability into Efficient Computation via Datalog at our group.Publications
- Parameterized Complexity of Optimal Planning: A Detailed Map. Martin Kronegger, Andreas Pfandler, Reinhard Pichler, 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), AAAI Press, to appear.
- Backdoors to Abduction. Andreas Pfandler, Stefan Rümmele, Stefan Szeider, 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), AAAI Press, to appear.
- Computational Aspects of Nearly Single-Peaked Electorates. Gábor Erdélyi, Martin Lackner, Andreas Pfandler, Twenty-Seventh Conference on Artificial Intelligence (AAAI-13), AAAI Press, to appear.
- The Complexity of Nearly Single-Peaked Consistency. Gábor Erdélyi, Martin Lackner, Andreas Pfandler, 4th International Workshop on Computational Social Choice (COMSOC 2012), PDF (online proceedings), BibTex.
- Fixed-Parameter Algorithms for Closed World Reasoning. Martin Lackner and Andreas Pfandler, 20th European Conference on Artificial Intelligence (ECAI 2012), IOS Press, PDF, BibTex.
- The Parameterized Complexity of Abduction. Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele, Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), AAAI Press, PDF, BibTex.
- Fixed-Parameter Algorithms for Finding Minimal Models. Martin Lackner and Andreas Pfandler, 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), AAAI Press, PDF, BibTex.
- Train Marshalling Is Fixed Parameter Tractable. Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler and Frances Rosamond, Sixth International Conference on Fun with Algorithms (FUN 2012), Springer, BibTex.
- Decentralized Diagnosis: Complexity Analysis and Datalog Encodings. Andreas Pfandler, Master's thesis at Vienna University of Technology, Austria.
Talks and Presentations
- Fixed-Parameter Algorithms for Closed World Reasoning. 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France, 2012.
- The Parameterized Complexity of Abduction. Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), Toronto, Canada, 2012.
- Fixed-Parameter Algorithms for Finding Minimal Models. Talk given while visiting Gábor Erdélyi, University of Siegen, Siegen, Germany, 2012.
- On the fixed-parameter tractability of computing minimal models. Workshop - Parameterized Complexity: Not about graphs!, Darwin, Australia, 2011.
- Decentralized Diagnosis: Complexity Analysis and Datalog Encodings. Poster presentation, JSC 2010, Vienna, Austria, 2010.