| Optimal capacity modification for many-to-one matching problems J Chen, G Csáji arXiv preprint arXiv:2302.01815, 2023 | 6 | 2023 |
| On the complexity of stable hypergraph matching, stable multicommodity flow and related problems G Csáji Theoretical Computer Science 931, 1-16, 2022 | 5 | 2022 |
| Approximation algorithms for matroidal and cardinal generalizations of stable matching G Csáji, T Király, Y Yokoi Symposium on Simplicity in Algorithms (SOSA), 103-113, 2023 | 4 | 2023 |
| On the complexity of packing rainbow spanning trees K Bérczi, G Csáji, T Király Discrete Mathematics 346 (4), 113297, 2023 | 3 | 2023 |
| Cores in friend-oriented hedonic games: Verification is surprisingly harder than searching J Chen, G Csáji, S Roy, S Simola arXiv preprint arXiv:2203.09655, 2022 | 3 | 2022 |
| Computational Complexity of k-Stable Matchings H Aziz, G Csáji, Á Cseh International Symposium on Algorithmic Game Theory, 311-328, 2023 | 2 | 2023 |
| Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial C Beke, GK Csáji, P Csikvári, S Pituk European Journal of Combinatorics 110, 103678, 2023 | 2 | 2023 |
| Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity J Chen, G Csáji, S Roy, S Simola arXiv preprint arXiv:2203.09655, 2022 | 2 | 2022 |
| Permutation Tutte polynomial C Beke, GK Csáji, P Csikvári, S Pituk arXiv preprint arXiv:2311.01936, 2023 | 1 | 2023 |
| Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings G Csáji arXiv preprint arXiv:2310.12269, 2023 | 1 | 2023 |
| Solving the Maximum Popular Matching Problem with Matroid Constraints G Csáji, T Király, Y Yokoi arXiv preprint arXiv:2209.02195, 2022 | 1 | 2022 |
| Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences P Biró, G Csáji arXiv preprint arXiv:2202.05484, 2022 | 1 | 2022 |
| A new quantum algorithm for the hidden shift problem in G Csáji arXiv preprint arXiv:2102.04171, 2021 | 1 | 2021 |
| The Merino–Welsh conjecture is false for matroids C Beke, GK Csáji, P Csikvári, S Pituk Advances in Mathematics 446, 109674, 2024 | | 2024 |
| A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems G Csáji Proceedings of the 23rd International Conference on Autonomous Agents and …, 2024 | | 2024 |
| Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains P Biró, G Csáji Games and Economic Behavior 145, 217-238, 2024 | | 2024 |
| Popularity and Perfectness in One-sided Matching Markets with Capacities G Csáji arXiv preprint arXiv:2403.00598, 2024 | | 2024 |
| Approximating maximum-size properly colored forests Y Bai, K Bérczi, G Csáji, T Schwarcz arXiv preprint arXiv:2402.00834, 2024 | | 2024 |
| Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded M Benedek, P Biró, G Csáji, M Johnson, D Paulusma, X Ye arXiv preprint arXiv:2312.16653, 2023 | | 2023 |
| Couples can be tractable: New algorithms and hardness results for the Hospitals/Residents problem with Couples G Csáji, D Manlove, I McBride, J Trimble arXiv preprint arXiv:2311.00405, 2023 | | 2023 |
