Martin Lackner

According to our database1, Martin Lackner authored at least 44 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Preferences Single-Peaked on a Circle.
J. Artif. Intell. Res., 2020

Incomplete Preferences in Single-Peaked Electorates.
J. Artif. Intell. Res., 2020

Approval-Based Committee Voting: Axioms, Algorithms, and Applications.
CoRR, 2020

Approval-Based Shortlisting.
CoRR, 2020

Strategic Campaign Management in Apportionment Elections.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Perpetual Voting: Fairness in Long-Term Decision Making.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Proportional Belief Merging.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A Mathematical Analysis of an Election System Proposed by Gottlob Frege.
CoRR, 2019

A Quantitative Analysis of Multi-Winner Rules.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

On Rational Delegations in Liquid Democracy.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Consistent Approval-Based Multi-Winner Rules.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Approval-Based Multi-Winner Rules and Strategic Voting.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Computing the Schulze Method for Large-Scale Preference Data Sets.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Effective Heuristics for Committee Scoring Rules.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Multiwinner Elections With Diversity Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

On the Complexity of Extended and Proportional Justified Representation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
On the likelihood of single-peaked preferences.
Soc. Choice Welf., 2017

Computational Aspects of Nearly Single-Peaked Electorates.
J. Artif. Intell. Res., 2017

Optimal Average Satisfaction and Extended Justified Representation in Polynomial Time.
CoRR, 2017

Committees providing EJR can be computed efficiently.
CoRR, 2017

Proportional Rankings.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Computational Social Choice in the Clouds.
Proceedings of the Datenbanksysteme für Business, 2017

Proportional Justified Representation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Winner Determination in Huge Elections with MapReduce.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Phragmén's Voting Methods and Justified Representation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations.
Discret. Math. Theor. Comput. Sci., 2016

A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs.
Algorithmica, 2016

Preference Restrictions in Computational Social Choice: Recent Progress.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Structure in Dichotomous Preferences.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Manipulation of k-Approval in Nearly Single-Peaked Electorates.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

The Complexity of Recognizing Incomplete Single-Crossing Preferences.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Incomplete Preferences in Single-Peaked Electorates.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

A Parameterized Complexity Analysis of Generalized CP-Nets.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

On Detecting Nearly Structured Preference Profiles.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

The Likelihood of Structure in Preference Profiles.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
The computational landscape of permutation patterns
CoRR, 2013

2012
From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching.
Tiny Trans. Comput. Sci., 2012

Fixed-Parameter Algorithms for Finding Minimal Models.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Train Marshalling Is Fixed Parameter Tractable.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Fixed-Parameter Algorithms for Closed World Reasoning.
Proceedings of the ECAI 2012, 2012

Multicut on Graphs of Bounded Clique-Width.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
A W[1]-Completeness Result for Generalized Permutation Pattern Matching
CoRR, 2011

2002
Supporting Design by Contract in Java.
J. Object Technol., 2002


  Loading...