Robert Bredereck

Junjie Luo

Inf. Comput., January, 2024

2023

A multivariate complexity analysis of the material consumption scheduling problem.

[BibT_eX]

[DOI]

J. Sched., August, 2023

Fine-grained view on bribery for group identification.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., June, 2023

Improving Resource Allocations by Sharing in Pairs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Algorithmics of Egalitarian versus Equitable Sequences of Committees.

[BibT_eX]

[DOI]

Eva Michelle Deltl

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficiently Computing Smallest Agreeable Sets.

[BibT_eX]

[DOI]

Nimrod Talmon

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Bribery Can Get Harder in Structured Multiwinner Approval Election.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Rank Aggregation Using Scoring Rules.

[BibT_eX]

[DOI]

Niclas Boehmer

Dominik Peters

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Bribery Can Get Harder in Structured Multiwinner Approval Election.

[BibT_eX]

[DOI]

Bartosz Kusek

Piotr Faliszewski

CoRR, 2022

Envy-free allocations respecting social networks.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Single-Peaked Opinion Updates.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

When Votes Change and Committees Should (Not).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners.

[BibT_eX]

[DOI]

Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

On Improving Resource Allocations by Sharing.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Combating Collusion Rings Is Hard but Possible.

[BibT_eX]

[DOI]

Niclas Boehmer

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Complexity of Shift Bribery in Committee Elections.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Bribery and Control in Stable Marriage.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2021

Robustness among multiwinner voting rules.

[BibT_eX]

[DOI]

Artif. Intell., 2021

On coalitional manipulation for multiwinner elections: shortlisting.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2021

Putting a Compass on the Map of Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

High-Multiplicity Fair Allocation Made More Practical.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Robustness of Winners: Counting Briberies in Elections.

[BibT_eX]

[DOI]

CoRR, 2020

Multistage Committee Election.

[BibT_eX]

[DOI]

CoRR, 2020

Stable roommates with narcissistic, single-peaked, and single-crossing preferences.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

Multidimensional Stable Roommates with Master List.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Line-Up Elections: Parallel Voting with Shared Candidate Pool.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks.

[BibT_eX]

[DOI]

Lilian Jacobs

Leon Kellerhals

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Strategic Campaign Management in Apportionment Elections.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Parameterized Algorithms for Finding a Collective Set of Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Adapting Stable Matchings to Evolving Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Electing Successive Committees: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Assessing the computational complexity of multilayer subgraph detection.

[BibT_eX]

[DOI]

Netw. Sci., 2019

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.

[BibT_eX]

[DOI]

Vincent Froese

Marcel Koseler

Marcelo Garlet Millani

Algorithmica, 2019

An Experimental View on Committees Providing Justified Representation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas.

[BibT_eX]

[DOI]

Junjie Luo

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Hedonic Diversity Games.

[BibT_eX]

[DOI]

Edith Elkind

Ayumi Igarashi

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Parameterized complexity of team formation in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Multiwinner Elections With Diversity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Partitioning Perfect Graphs into Stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Fixed-parameter algorithms for DAG Partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Group Activity Selection on Social Networks.

[BibT_eX]

[DOI]

CoRR, 2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.

[BibT_eX]

[DOI]

Leon Kellerhals

Viatcheslav Korenwein

Philipp Zschoche

Proceedings of the Theory and Applications of Models of Computation, 2017

Manipulating Opinion Diffusion in Social Networks.

[BibT_eX]

[DOI]

Edith Elkind

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

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

On Parameterized Complexity of Group Activity Selection Problems on Social Networks.

[BibT_eX]

[DOI]

Ayumi Igarashi

Edith Elkind

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Teams in Online Scheduling Polls: Game-Theoretic Aspects.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Finding large degree-anonymous subgraphs is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Are there any nicely structured preference profiles nearby?

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Math. Soc. Sci., 2016

Large-Scale Election Campaigns: Combinatorial Shift Bribery.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting.

[BibT_eX]

[DOI]

Nimrod Talmon

Inf. Process. Lett., 2016

Prices matter for the parameterized complexity of shift bribery.

[BibT_eX]

[DOI]

Inf. Comput., 2016

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.

[BibT_eX]

[DOI]

Vincent Froese

Marcel Koseler

Marcelo Garlet Millani

CoRR, 2016

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.

[BibT_eX]

[DOI]

Bernhard Bliem

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.

[BibT_eX]

[DOI]

René van Bevern

Laurent Bulteau

Nimrod Talmon

Gerhard J. Woeginger

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

How to Put Through Your Agenda in Collective Binary Decisions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

The complexity of degree anonymization by vertex addition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Network-Based Vertex Dissolution.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On explaining integer vectors by few homogeneous segments.

[BibT_eX]

[DOI]

Sepp Hartung

Ondrej Suchý

J. Comput. Syst. Sci., 2015

Using Patterns to Form Homogeneous Teams.

[BibT_eX]

[DOI]

Algorithmica, 2015

Elections with Few Candidates: Prices, Weights, and Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

The effect of homogeneity on the computational complexity of combinatorial data anonymization.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

[BibT_eX]

[DOI]

CoRR, 2014

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2014

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.

[BibT_eX]

[DOI]

Nadja Betzler

Auton. Agents Multi Agent Syst., 2014

Network-Based Dissolution.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

A characterization of the single-crossing domain.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Soc. Choice Welf., 2013

Pattern-Guided <i>k</i>-Anonymity.

[BibT_eX]

[DOI]

Algorithms, 2013

On Explaining Integer Vectors by Few Homogenous Segments.

[BibT_eX]

[DOI]

Sepp Hartung

Ondrej Suchý

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The Complexity of Finding a Large Subgraph under Anonymity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Parameterized Complexity of DAG Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

On Bounded-Degree Vertex Deletion parameterized by treewidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Graph and Election Problems Parameterized by Feedback Set Numbers

[BibT_eX]

[DOI]

CoRR, 2011

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Pattern-Guided Data Anonymization and Clustering.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

The Effect of Homogeneity on the Complexity of k-Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice

[BibT_eX]

[DOI]

CoRR, 2010

Partial Kernelization for Rank Aggregation: Theory and Experiments.

[BibT_eX]

[DOI]

Nadja Betzler