Martin Lackner
| Address | Institute of Information Systems Database and Artificial Intelligence Group Vienna University of Technology Favoritenstraße 9-11 1040 Wien Austria |
|---|---|
| lackner [at] dbai tuwien ac at | |
| Room | HA 03 04 |
Short CV
I am a research assistent at the Database and Artificial Intelligence Group at the Vienna Technnical University of Technology since November 2010. I am also a PhD student in the Doctoral Programme Mathematical Logic in Computer Science. My advisor is Reinhard Pichler. I have studied Mathematics in Computer Science at the Vienna University of Technology and at the University of Illinois at Urbana-Champaign.Research interests
- Parameterized complexity theory
- Algorithms
- Logic in Artificial Intelligence, especially Reasoning
- Computational aspects of permutation problems
- Graph width parameters (tree-width, clique-width, etc)
Publications
Fixed-Parameter Algorithms for Finding Minimal Models, joint work with Andreas Pfandler, 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), Preprint
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs, joint work with Marie-Louise Bruner, 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), Arxiv (long version)
Multicut on Graphs of Bounded Clique-width, joint work with Reinhard Pichler, Stefan Rümmele and Stefan Woltran, 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012), to appear
Talks
- Multicut on Graphs of Bounded Clique-width, COCOA 2012, Banff, Canada, 2012
- A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs, SWAT 2012, Helsinki, Finland, 2012
- Permutation Pattern Matching and its Parameterized Complexity, CiE 2012, Cambridge, UK, 2012
- Fixed-Parameter Algorithms for Finding Minimal Models, KR 2012, Rome, Italy, 2012
- Fixed-Parameter Algorithms for Finding Minimal Models, Logic and interactions, Marseille, France, 2012
- On the fixed-parameter tractability of computing minimal models, Workshop - Parameterized Complexity: Not about graphs!, Darwin, Australia, 2011