TU Wien
Database and Artificial Intelligence Group
Favoritenstraße 9, 1040 Wien, Austria
Research: Artificial Intelligence, Computational Social Choice, Algorithms

Short biography

Martin Lackner is a postdoctoral researcher at TU Wien as a part of the Database and Artificial Intelligence Group. Before that, he was postdoctoral researcher at the University of Oxford. In June 2014, he completed his doctoral studies in computer science (Dr. techn.) at the TU Wien with Reinhard Pichler as advisor and Stefan Szeider as co-advisor. Martin Lackner has studied Mathematics in Computer Science at TU Wien and spent a semester abroad at the University of Illinois at Urbana-Champaign, USA.

Research interests

I am working in the broad area of Artificial Intelligence and more specifically in Computational Social Choice, a discipline concerned with algorithmic aspects of joint decision making. My interests beyond Computational Social Choice are algorithms, especially parameterized algorithms, computational aspects of permutation problems, and logic in Artificial Intelligence.

Manuscripts

  1. Martin Lackner and Piotr Skowron Consistent Approval-Based Multi-Winner Rules [ Arxiv ]

Publications

2018

  1. Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner and Piotr Skowron Multiwinner Elections with Diversity Constraints In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), AAAI Press, 2018.
    [ BibTeX | PDF | Arxiv ]
  2. Piotr Faliszewski, Martin Lackner, Dominik Peters and Nimrod Talmon Effective Heuristics for Committee Scoring Rules In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), AAAI Press, 2018.
    [ BibTeX | PDF ]
  3. Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez-Fernández and Piotr Skowron On the Complexity of Extended and Proportional Justified Representation In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), AAAI Press, 2018.
    [ BibTeX | PDF ]

2017

  1. Edith Elkind, Martin Lackner and Dominik Peters Structured Preferences In Trends in Computational Social Choice, pages 187-207, AI Access, 2017.
    [ BibTeX | PDF ]
  2. Gábor Erdélyi, Martin Lackner and Andreas Pfandler Computational Aspects of Nearly Single-Peaked Electorates In Journal of Artificial Intelligence Research (JAIR), 58: 297-337, 2017.
    [ BibTeX | www | PDF ]
  3. Marie-Louise Lackner and Martin Lackner On the Likelihood of Single-Peaked Preferences In Social Choice and Welfare, 48 (4): 717-745, 2017.
    [ BibTeX | www | Arxiv ]
  4. Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters and Edith Elkind Proportional Rankings In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), AAAI Press, 2017.
    [ BibTeX | PDF | Arxiv ]
  5. Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner and Piotr Skowron The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), AAAI Press, 2017.
    [ BibTeX | PDF | Arxiv ]
  6. Markus Brill, Rupert Freeman, Svante Janson and Martin Lackner Phragmén's Voting Methods and Justified Representation In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pages 406-413, AAAI Press, 2017.
    [ BibTeX | PDF ]
  7. Dominik Peters and Martin Lackner Preferences Single-Peaked on a Circle In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pages 649-655, AAAI Press, 2017.
    [ BibTeX | PDF ]
  8. L. Sánchez-Fernández, E. Elkind, M. Lackner, N. Fernández, J. A. Fisteus, P. Basanta Val and P. Skowron Proportional Justified Representation In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pages 670-676, AAAI Press, 2017.
    [ BibTeX | PDF | Arxiv ]
  9. Theresa Csar, Martin Lackner, Reinhard Pichler and Emanuel Sallinger Winner Determination in Huge Elections with MapReduce In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pages 451-458, AAAI Press, 2017.
    [ BibTeX | PDF ]

2016

  1. Marie-Louise Bruner and Martin Lackner A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs In Algorithmica, 75 (1): 84-117, 2016.
    [ BibTeX | www | Arxiv ]
  2. Edith Elkind, Martin Lackner and Dominik Peters Preference Restrictions in Computational Social Choice: Recent Progress In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), Early Career Spotlight track, pages 4062-4065, AAAI Press, 2016.
    [ BibTeX | PDF ]
  3. Michael H. Albert, Marie-Louise Lackner, Martin Lackner and Vincent Vatter The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations In Discrete Mathematics & Theoretical Computer Science, vol. 18 no. 2, Permutation Patterns 2015, 2016.
    [ BibTeX | www | Arxiv ]

2015

  1. Edith Elkind and Martin Lackner Structure in Dichotomous Preferences In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 2019-2025, AAAI Press, 2015.
    [ BibTeX | PDF | Arxiv ]
  2. Edith Elkind, Piotr Faliszewski, Martin Lackner and Svetlana Obraztsova The Complexity of Recognizing Incomplete Single-Crossing Preferences In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pages 865-871, AAAI Press, 2015.
    [ BibTeX | www | PDF ]
  3. Gábor Erdélyi, Martin Lackner and Andreas Pfandler Manipulation of k-Approval in Nearly Single-Peaked Electorates In Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), pages 71-85, Springer International Publishing, Lecture Notes in Computer Science 9346, 2015.
    [ BibTeX | www | PDF ]

2014

  1. Martin Lackner Incomplete Preferences in Single-Peaked Electorates In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 742-748, AAAI Press, 2014.
    [ BibTeX | www | PDF ]
  2. Edith Elkind and Martin Lackner On Detecting Nearly Structured Preference Profiles In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 661-667, AAAI Press, 2014.
    [ BibTeX | www | PDF ]
  3. Martin Kronegger, Martin Lackner, Andreas Pfandler and Reinhard Pichler A Parameterized Complexity Analysis of Generalized CP-Nets In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 1091-1097, AAAI Press, 2014.
    [ BibTeX | www | PDF ]
  4. Marie-Louise Bruner and Martin Lackner The Likelihood of Structure in Preference Profiles In Proceedings of the 8th Multidisciplinary Workshop on Advances in Preference Handling (MPref 2014), 2014.
    [ BibTeX | PDF ]
  5. Martin Lackner Detecting Structure in Permutations and Preferences Ph.D. Thesis, Vienna University of Technology, 2014.
    [ BibTeX ]

2013

  1. Gábor Erdélyi, Martin Lackner and Andreas Pfandler Computational Aspects of Nearly Single-Peaked Electorates In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI 2013), pages 283-289, AAAI Press, 2013.
    [ BibTeX | www | PDF | Arxiv ]
  2. Martin Lackner Incomplete Preferences in Single-Peaked Electorates In Proceedings of the 7th Multidisciplinary Workshop on Advances in Preference Handling (MPref 2013), 2013.
    [ BibTeX | PDF ]
  3. Martin Kronegger, Martin Lackner, Andreas Pfandler and Reinhard Pichler A Parameterized Complexity Analysis of Generalized CP-Nets In Proceedings of the 7th Multidisciplinary Workshop on Advances in Preference Handling (MPref 2013), 2013.
    [ BibTeX | PDF ]
  4. Marie-Louise Bruner and Martin Lackner The Computational Landscape of Permutation Patterns In Pure Mathematics and Applications: Special Issue for the Permutation Patterns 2012 Conference, 24 (2): 83-101, 2013.
    [ BibTeX | PDF | Arxiv ]

2012

  1. Martin Lackner and Andreas Pfandler Fixed-Parameter Algorithms for Finding Minimal Models In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pages 85-95, AAAI Press, 2012.
    [ BibTeX | www | PDF ]
  2. Martin Lackner and Andreas Pfandler Fixed-Parameter Algorithms for Closed World Reasoning In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pages 492-497, IOS Press, 2012.
    [ BibTeX | www | PDF ]
  3. Marie-Louise Bruner and Martin Lackner A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs In Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), pages 261-270, Springer Berlin / Heidelberg, Lecture Notes in Computer Science 7357, 2012.
    [ BibTeX | www | PDF ]
  4. Gábor Erdélyi, Martin Lackner and Andreas Pfandler The Complexity of Nearly Single-Peaked Consistency In Proceedings of the 4th International Workshop on Computational Social Choice (COMSOC 2012), 2012.
    [ BibTeX | PDF ]
  5. Martin Lackner, Reinhard Pichler, Stefan Rümmele and Stefan Woltran Multicut on Graphs of Bounded Clique-Width In Proceedings of the 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012), pages 115-126, Springer Berlin / Heidelberg, Lecture Notes in Computer Science 7402, 2012.
    [ BibTeX | www | PDF ]
  6. Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler and Frances A. Rosamond Train Marshalling Is Fixed Parameter Tractable In Proceedings of the Sixth International Conference on Fun with Algorithms (FUN 2012), pages 51-56, Springer Berlin / Heidelberg, Lecture Notes in Computer Science 7288, 2012.
    [ BibTeX | www ]
  7. Marie-Louise Bruner and Martin Lackner From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching In TinyToCS, Vol. 1, 2012.
    [ BibTeX | PDF ]