2020S

• Preferences in Artificial Intelligence / VU / 184.768
• Project in Computer Science 1 / PR / 184.688
• Project in Computer Science 2 / PR / 184.689

• Algorithms for Sustainable Group Decision Making
  2019 – 2022 / Austrian Science Fund (FWF)
• Fixed-Parameter Tractability in Artificial Intelligence and Reasoning (FAIR)
  2013 – 2018 / Austrian Science Fund (FWF)
• Heterogenous Information Integration
  2012 – 2017 / Austrian Science Fund (FWF)
• SEE: SPARQL Evaluation and Extensions
  2012 – 2016 / Vienna Science and Technology Fund (WWFT)
• Theoretical Tractability vs. Practical Computation
  2008 – 2012 / Austrian Science Fund (FWF)

2019

• Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making / C. Gangl, M. Lackner, J. Maly, S. Woltran / Talk: KR4HC 2019 - Knowledge Representation for Health Care/ProHealth, Poznan, Polen; 2019-06-26 - 2019-06-29; in: "Knowledge Representation for Health Care/ProHealth, KR4HC 2019", (2019), 56 - 62
• A Quantitative Analysis of Multi-Winner Rules / M. Lackner, P. Skowron / Talk: IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Macao, China; 2019-08-10 - 2019-08-16; in: "Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16, 2019", ijcai.org, (2019), ISBN: 978-0-9992411-4-1; 407 - 413
• On Rational Delegations in Liquid Democracy / D. Bloembergen, D. Grossi, M. Lackner / Talk: AAAI 2019 - 33rd Conference on Artificial Intelligence, Honolulu, Hawaii; 2019-01-27 - 2019-02-01; in: "The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI} 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2019", AAAI Press, (2019), 1796 - 1803

2018

• A Quantitative Analysis of Multi-Winner Rules / M. Lackner, P. Skowron / in: "Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018)", Computing Research Repository (CoRR), 2018, 1 - 29
• Approval-Based Multi-Winner Rules and Strategic Voting / M. Lackner, P. Skowron / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018", ijcai.org, (2018), ISBN: 978-0-9992411-2-7; 340 - 346
• Effective Heuristics for Committee Scoring Rules / M. Lackner, P. Faliszewski, D. Peters, N. Talmon / Talk: AAAI 2018, New Orleans, Lousiana, USA; 2018-02-02 - 2018-02-07; in: "Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18)", AAAI Press, (2018), 1023 - 1030
• On the Complexity of Extended and Proportional Justified Representation / M. Lackner, H. Aziz, E. Elkind, S. Huang, L. Sánchez-Fernández, P. Skowron / Talk: AAAI 2018, New Orleans, Lousiana, USA; 2018-02-02 - 2018-02-07; in: "Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18)", AAAI Press, (2018), 902 - 909
• Consistent Approval-Based Multi-Winner Rules / M. Lackner, P. Skowron / Talk: ACM Conference on Economics and Computation, Ithaca, New York, USA; 2018-06-18 - 2018-06-22; in: "Proceedings of the 2018 {ACM} Conference on Economics and Computation", (2018), ISBN: 978-1-4503-5829-3; 47 - 48
• Multiwinner Elections With Diversity Constraints / M. Lackner, R. Bredereck, P. Faliszewski, A. Igarashi, P. Skowron / Talk: AAAI 2018, New Orleans, Lousiana, USA; 2018-02-02 - 2018-02-07; in: "Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18)", AAAI Press, (2018), 933 - 940
• Computing the Schulze Method for Large-Scale Preference Data Sets / T. Csar, M. Lackner, R. Pichler / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm, Sweden", ijcai.org, (2018), ISBN: 978-0-9992411-2-7; 180 - 187

2017

• Computational Aspects of Nearly Single-Peaked Electorates / G. Erdélyi, M. Lackner, A. Pfandler / Journal of Artificial Intelligence Research, 58 (2017), 1
• Computational Social Choice in the Clouds / T. Csar, M. Lackner, R. Pichler, E. Sallinger / Talk: Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz "Datenbanksysteme für Business, Technologie und Web" (BTW), Stuttgart; 2017-03-07; in: "Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz "Datenbanksysteme für Business, Technologie und Web" (BTW)", (2017), 163 - 167
• Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 / T. Csar, M. Lackner, R. Pichler, E. Sallinger / Talk: AAAI 2017, San Francisco; 2017-02-04 - 2017-02-09; in: "AAAI 2017", (2017), 451 - 458

2016

• Winner Determination in Huge Elections with MapReduce / T. Csar, M. Lackner, R. Pichler, E. Sallinger / Talk: 10th Multidisciplinary Workshop on Advances in Preference Handling, New York City, USA; 2016-07-09; in: "10th Multidisciplinary Workshop on Advances in Preference Handling", M. Endres, N. Mattei, A. Pfandler (ed.); (2016), 7 pages

2015

• A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs / M. Bruner, M. Lackner / Algorithmica (online), online (2015), 34 pages
• The Complexity of Recognizing Incomplete Single-Crossing Preferences / E. Elkind, P. Faliszewski, M. Lackner, S. Obraztsova / Talk: Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA; 2015-01-25 - 2015-01-30; in: "Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA", B. Bonet, S. Koenig (ed.); AAAI Press, (2015), 865 - 871
• Manipulation of k-Approval in Nearly Single-Peaked Electorates / G. Erdélyi, M. Lackner, A. Pfandler / Talk: 4th International Conference on Algorithmic Decision Theory, ADT 2015, Lexington, Kentucky, USA; 2015-09-27 - 2015-09-30; in: "Algorithmic Decision Theory, 4th International Conference, ADT 2015 Lexington, KY, USA, September 27 - 30, 2015 Proceedings", T. Walsh (ed.); Springer, Lecture Notes in Computer Science Volume 9346 (2015), ISBN: 978-3-319-23113-6; 71 - 85
• Structure in Dichotomous Preferences / E. Elkind, M. Lackner / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 2019 - 2025

2014

• On the Parameterized Complexity of Generalized CP-Nets / M. Kronegger, M. Lackner, A. Pfandler, R. Pichler / Talk: Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland; 2014-10-08 - 2014-10-11
• On Detecting Nearly Structured Preference Profiles / M. Lackner, E. Elkind / Talk: Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland; 2014-10-08 - 2014-10-11
• The Likelihood of Structure in Preference Profiles / M. Bruner, M. Lackner / Talk: 8th Multidisciplinary Workshop on Advances in Preference Handling, Quebec, Kanada; 2014-06-28
• Detecting Structure in Permutations and Preferences / PhD Thesis by M. Lackner / Supervisor, Reviewer: R. Pichler, St. Szeider, G. Erdélyi; Institut für Informationssysteme, 2014; oral examination: 2014-06-11
• A Parameterized Complexity Analysis of Generalized CP-Nets / M. Kronegger, M. Lackner, A. Pfandler, R. Pichler / Talk: 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR), Wien; 2014-07-17 - 2014-07-18; in: "Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR)", M. R. Fellows, S. Gaspers, T. Walsh (ed.); (2014), 2 pages
• On Detecting Nearly Structured Preference Profiles / E. Elkind, M. Lackner / Talk: Twenty-Eighth AAAI Conference on Aritifical Intelligence (AAAI 2014), Québec City, Québec, Canada; 2014-07-27 - 2014-07-31; in: "Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence", C. Brodley, P. Stone (ed.); (2014), ISBN: 978-1-57735-661-5; 661 - 667
• Incomplete Preferences in Single-Peaked Electorates / M. Lackner / Talk: Twenty-Eighth AAAI Conference on Aritifical Intelligence (AAAI 2014), Québec City, Québec, Canada; 2014-07-27 - 2014-07-31; in: "Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence", C. Brodley, P. Stone (ed.); (2014), ISBN: 978-1-57735-661-5; 742 - 748
• A Parameterized Complexity Analysis of Generalized CP-Nets / M. Kronegger, M. Lackner, A. Pfandler, R. Pichler / Talk: Twenty-Eighth AAAI Conference on Aritifical Intelligence (AAAI 2014), Québec City, Québec, Canada; 2014-07-27 - 2014-07-31; in: "Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence", C. Brodley, P. Stone (ed.); (2014), ISBN: 978-1-57735-661-5; 1091 - 1097

2013

• Single-peaked preference profiles and permutation patterns: A unified perspective / M. Lackner / Talk: 11th Permutation Patterns Conference, Paris; 2013-07-01 - 2013-07-05
• The computational landscape of permutation patterns / M. Bruner, M. Lackner / Talk: 11th Permutation Patterns Conference, Paris, France; 2013-07-01 - 2013-07-05
• The computational landscape of permutation patterns / M. Bruner, M. Lackner / arXiv.org e-Print archive, http://arxiv.org/abs/1301.0340 (2013), 22 pages
• Incomplete Preferences in Single-Peaked Electorates / M. Lackner / Talk: 7th Multidisciplinary Workshop on Advances in Preference Handling, Peking, China; 2013-08-03 - 2013-08-05; in: "7th Multidisciplinary Workshop on Advances in Preference Handling", (2013), 7 pages
• A Parameterized Complexity Analysis of Generalized CP-Nets / M. Kronegger, M. Lackner, A. Pfandler, R. Pichler / Talk: 7th Multidisciplinary Workshop on Advances in Preference Handling, Peking, China; 2013-08-03 - 2013-08-05; in: "7th Multidisciplinary Workshop on Advances in Preference Handling", (2013), 7 pages
• Computational Aspects of Nearly Single-Peaked Electorates / G. Erdélyi, M. Lackner, A. Pfandler / Talk: Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13), Bellevue, Washington, USA; 2013-07-14 - 2013-07-18; in: "Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13)", AAAI Press, (2013), 283 - 289

2012

• Permutation Pattern Matching and its Parameterized Complexity / M. Lackner, M. Bruner / Talk: Conference on Computability in Europe CiE, Cambridge, Great Britain; 2012-06-18 - 2012-06-23
• A Fast Algorithm for Permutation Pattern Matching / M. Lackner / Talk: Universität Siegen, Siegen, Deutschland; 2012-03-22
• Fixed-Parameter Algorithms for Finding Minimal Models / M. Lackner, A. Pfandler / Talk: Universität Siegen, Siegen, Deutschland; 2012-03-22
• Fixed-Parameter Algorithms for Finding Minimal Models / M. Lackner, A. Pfandler / Talk: Logic and interactions 2012, CIRM, Marseille, France; 2012-01-30 - 2012-03-02
• The Complexity of Nearly Single-Peaked Consistency / G. Erdély, M. Lackner, A. Pfandler / Talk: International Workshop on Computational Social Choice (COMSOC), Krakow, Poland; 2012-09-11 - 2012-09-13; in: "Proceedings of fourth int. conference on Computational Social Choice", F. Brandt, P. Faliszewski (ed.); (2012), 12 pages
• Fixed-Parameter Algorithms for Finding Minimal Models / M. Lackner, A. Pfandler / Talk: Principles of Knowledge Representation and Reasoning (KR), Rome, Italy; 2012-06-10 - 2012-06-14; in: "Proceedings of 13th int. conf. on Principles of Knowledge Representation and Reasoning", G. Brewka, T. Eiter, S. McIlraith (ed.); AAAI Press, (2012), ISBN: 978-1-57735-561-8; Paper ID 4880, 11 pages
• A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs / M. Lackner, M. Bruner / Talk: Symposium and Workshops on Algorithm Theory (SWAT), Helsinki, Finnland; 2012-07-04 - 2012-07-06; in: "Lecture Notes of Computer Science", F. Fomin, P. Kaski (ed.); Springer, 7357 (2012), ISBN: 978-3-642-31154-3; 261 - 270
• Multicut on Graphs of Bounded Clique-width / M. Lackner, R. Pichler, St. Rümmele, S. Woltran / Talk: Annual International Conference on Combinatiorial Optimization and Applications (COCOA), Banff, Canada; 2012-08-05 - 2012-08-09; in: "Lecture Notes of Computer Science", G. Lin (ed.); Springer, 7402 (2012), ISBN: 978-3-642-31769-9; 115 - 126
• Fixed-Parameter Algorithms for Closed World Reasoning / M. Lackner, A. Pfandler / Talk: European Conference on Artificial Intelligence (ECAI), Montpellier, France; 2012-08-27 - 2012-08-31; in: "Proceedings of the ECAI Conference", L. Raedt, Ch. Bessiere, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, P. Lucas (ed.); IOS Press, 242 (2012), ISBN: 978-1-61499-097-0; 492 - 497

2011

• On the fixed-parameter tractability of computing minimal models / M. Lackner / Talk: Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien; 2011-08-05 - 2011-08-08
• Hardness results for Weighted Minimal Model SAT / A. Pfandler, M. Lackner / Talk: Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien; 2011-08-05 - 2011-08-08
• Algorithms for finding minimal models / M. Lackner, A. Pfandler / Talk: Workshop - Parameterized Complexity: Not About Graphs, Darwin, Australien; 2011-08-05 - 2011-08-08