Gergely Csáji

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

Collaborative distances:

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

2024

Solving the Maximum Popular Matching Problem with Matroid Constraints.

Gergely Kál Csáji, Tamás Király, Yu Yokoi

SIAM J. Discret. Math., 2024

Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains.

Péter Biró, Gergely Csáji

Games Econ. Behav., 2024

Manipulating the outcome of stable marriage and roommates problems.

Kristóf Bérczi, Gergely Csáji, Tamás Király

Games Econ. Behav., 2024

Permutation Tutte polynomial.

Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk

Eur. J. Comb., 2024

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances.

Gergely Csáji

CoRR, 2024

The NTU Partitioned Matching Game for International Kidney Exchange Programs.

Gergely Csáji, Tamás Király, Zsuzsa Mészáros-Karkus

CoRR, 2024

Popular Maximum-Utility Matchings with Matroid Constraints.

Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi

CoRR, 2024

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

Gergely Csáji

CoRR, 2024

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

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Popular and Dominant Matchings with Uncertain and Multimodal Preferences.

Gergely Csáji

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities.

Laura Codazzi, Gergely Csáji, Matthias Mnich

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Approximating Maximum-Size Properly Colored Forests.

Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems.

Gergely Csáji

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

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

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial.

Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk

Eur. J. Comb., May, 2023

On the complexity of packing rainbow spanning trees.

Kristóf Bérczi, Gergely Kál Csáji, Tamás Király

Discret. Math., April, 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

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching.

Gergely Kál Csáji, Tamás Király, Yu Yokoi

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 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

Manipulating the outcome of stable matching and roommates problems.

Kristóf Bérczi, Gergely Kál Csáji, Tamás Király

CoRR, 2022

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

Péter Biró, Gergely Csáji

CoRR, 2022