Ildikó Schlotter

Ágnes Cseh

ACM Trans. Comput. Theory, March, 2025

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms.

[BibT_eX]

[DOI]

Jiehua Chen

CoRR, February, 2025

Popular Arborescences and Their Matroid Generalization.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2025

Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms.

[BibT_eX]

[DOI]

András Sebö

SIAM J. Discret. Math., 2025

Control in Computational Social Choice.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

The Strong Core of Housing Markets with Partial Order Preferences.

[BibT_eX]

[DOI]

Lydia Mirabel Mendoza-Cadena

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Candidate Nomination for Condorcet-consistent Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Stable Hypergraph Matching in Unimodular Hypergraphs.

[BibT_eX]

[DOI]

Péter Biró

Gergely Csáji

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Parameterized complexity of candidate nomination for elections based on positional scoring rules.

[BibT_eX]

[DOI]

Diana Trellová

Auton. Agents Multi Agent Syst., December, 2024

Computational complexity of necessary envy-freeness.

[BibT_eX]

[DOI]

Haris Aziz

Lydia Mirabel Mendoza-Cadena

Toby Walsh

Math. Soc. Sci., 2024

Shortest odd paths in undirected graphs with conservative weight functions.

[BibT_eX]

[DOI]

Alpár Jüttner

Csaba Király

Gyula Pap

Yutaro Yamaguchi

Discret. Appl. Math., 2024

Parameterized Complexity of Submodular Minimization Under Uncertainty.

[BibT_eX]

[DOI]

Naonori Kakimura

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Shortest Two Disjoint Paths in Conservative Graphs.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Arborescences, Colorful Forests, and Popularity.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Parameterized Algorithms for Optimal Refugee Resettlement.

[BibT_eX]

[DOI]

Jiehua Chen

Sofia Simola

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Complexity of stability in trading networks.

[BibT_eX]

[DOI]

Int. J. Game Theory, September, 2023

Recognizing When a Preference System is Close to Admitting a Master List.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Shortest Odd Paths in Conservative Graphs: Connections and Complexity.

[BibT_eX]

[DOI]

András Sebö

CoRR, 2022

The popular assignment problem: when cardinality is more important than popularity.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home?

[BibT_eX]

[DOI]

Péter Biró

Tamás Fleiner

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.

[BibT_eX]

[DOI]

Matthias Mnich

Algorithmica, 2020

Popular Branchings and Their Dual Certificates.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2018

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?

[BibT_eX]

[DOI]

Algorithmica, 2018

A Connection Between Sports and Matroids: How Many Teams Can We Beat?

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Stable Marriage with Covering Constraints-A Complete Computational Trichotomy.

[BibT_eX]

[DOI]

Matthias Mnich

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Obtaining a Proportional Allocation by Deleting Items.

[BibT_eX]

[DOI]

Britta Dorn

Ronald de Haan

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

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists.

[BibT_eX]

[DOI]

Tamás Fleiner

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

2016

Refining the complexity of the sports elimination problem.

[BibT_eX]

[DOI]

Eva Potpinková

Discret. Appl. Math., 2016

Control of Fair Division.

[BibT_eX]

[DOI]

Haris Aziz

Toby Walsh

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

2015

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem.

[BibT_eX]

[DOI]

Tibor Jordán

J. Discrete Algorithms, 2015

2013

Cleaning Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

2011

Stable matching with couples: An empirical study.

[BibT_eX]

[DOI]

Péter Biró

Robert W. Irving

ACM J. Exp. Algorithmics, 2011

Parameterized Complexity of Eulerian Deletion Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Campaign Management under Approval-Driven Voting Rules.

[BibT_eX]

[DOI]

Piotr Faliszewski

Edith Elkind

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Parameterized Complexity of Graph Modification and Stable Matching Problems

[BibT_eX]

[DOI]

PhD thesis, 2010

Multivariate Analyis of Swap Bribery

[BibT_eX]

[DOI]

Britta Dorn

CoRR, 2010

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties.

[BibT_eX]

[DOI]

Algorithmica, 2010

Parameterized Complexity of the Arc-Preserving Subsequence Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Bin Packing with Fixed Number of Bins Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Multivariate Complexity Analysis of Swap Bribery.

[BibT_eX]

[DOI]

Britta Dorn

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Computing the Deficiency of Housing Markets with Duplicate Houses.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009

Stable Assignment with Couples: Parameterized Complexity and Local Search.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Parameterized Graph Cleaning Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

Obtaining a Planar Graph by Vertex Deletion.

[BibT_eX]

[DOI]