Gergely Csáji

According to our database, Gergely Csáji authored at least 11 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Popularity and Perfectness in One-sided Matching Markets with Capacities.

Gergely Csáji

CoRR, 2024

2023

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded.

Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye

CoRR, 2023

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples.

Gergely Csáji, David F. Manlove, Iain McBride, James Trimble

CoRR, 2023

Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences.

Gergely Csáji

CoRR, 2023

Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings.

Gergely Csáji

CoRR, 2023

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems.

Gergely Csáji

CoRR, 2023

Computational Complexity of k-Stable Matchings.

Haris Aziz, Gergely Csáji, Ágnes Cseh

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity.

Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola

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

Optimal Capacity Modification for Many-To-One Matching Problems.

Jiehua Chen, Gergely Csáji

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

2022

On the complexity of stable hypergraph matching, stable multicommodity flow and related problems.

Gergely Csáji

Theor. Comput. Sci., 2022

Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences.

Péter Biró, Gergely Csáji

CoRR, 2022