Gergely Csáji

Publication Activity (10 Years)

Years Active: 2022-2024
Publications (10 Years): 24

Top Topics

Computational Complexity

Related Problems

Top Venues

Games Econ. Behav.

Publications

Gergely Csáji
A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems. AAMAS (2024)
Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR (2024)
Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS (2024)
Péter Biró, Gergely Csáji
Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Games Econ. Behav. 145 (2024)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. 147 (2024)
Gergely Csáji
Popularity and Perfectness in One-sided Matching Markets with Capacities. CoRR (2024)
Gergely Csáji
A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems. CoRR (2023)
Gergely Csáji, David F. Manlove, Iain McBride, James Trimble
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples. CoRR (2023)
Jiehua Chen, Gergely Csáji
Optimal Capacity Modification for Many-To-One Matching Problems. AAMAS (2023)
Haris Aziz, Gergely Csáji, Ágnes Cseh
Computational Complexity of k-Stable Matchings. SAGT (2023)
Gergely Csáji
Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences. CoRR (2023)
Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR (2023)
Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola
Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS (2023)
Gergely Csáji, Tamás Király, Yu Yokoi
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA (2023)
Jiehua Chen, Gergely Csáji
Optimal Capacity Modification for Many-To-One Matching Problems. CoRR (2023)
Gergely Csáji
Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings. CoRR (2023)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. Discret. Math. 346 (4) (2023)
Haris Aziz, Gergely Csáji, Ágnes Cseh
Computational complexity of k-stable matchings. CoRR (2023)
Gergely Csáji
On the complexity of stable hypergraph matching, stable multicommodity flow and related problems. Theor. Comput. Sci. 931 (2022)
Péter Biró, Gergely Csáji
Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences. CoRR (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable matching and roommates problems. CoRR (2022)
Gergely Csáji, Tamás Király, Yu Yokoi
Solving the Maximum Popular Matching Problem with Matroid Constraints. CoRR (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. CoRR (2022)
Gergely Csáji, Tamás Király, Yu Yokoi
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. CoRR (2022)