Gergely Csáji

34 papers A* 4A 5B 1Journal 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating maximum-size properly colored forests. Eur. J. Comb. Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz
2026	J	`jnl`	Core-Stable Kidney Exchange via Altruistic Donors. CoRR Gergely Csáji, Thánh Nguyen
2026	J	`jnl`	Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs. CoRR Gergely Csáji, Rares-Ioan Mateiu, Alexandru Popa, Ildikó Schlotter
2026	J	`jnl`	Smart Lotteries in School Choice: Ex-ante Pareto-Improvement with Ex-post Stability. CoRR Haris Aziz, Péter Biró, Gergely Csáji, Tom Demeulemeester
2025	J	`jnl`	Computational Complexity of ACM Trans. Economics and Comput. Haris Aziz, Gergely Csáji, Ágnes Cseh
2025	J	`jnl`	Near-Feasible Solutions to Complex Stable Matching Problems. CoRR Gergely Csáji
2025	A*	`conf`	Stable Hypergraph Matching in Unimodular Hypergraphs. ICALP Péter Biró, Gergely Csáji, Ildikó Schlotter
2025	J	`jnl`	Stable Hypergraph Matching in Unimodular Hypergraphs. CoRR Péter Biró, Gergely Csáji, Ildikó Schlotter
2024	A	`conf`	A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems. AAMAS Gergely Csáji
2024	A	`conf`	Approximating Maximum-Size Properly Colored Forests. ESA Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz
2024	A	`conf`	Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2024	A*	`conf`	Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. IJCAI Gergely Csáji, David F. Manlove, Iain McBride, James Trimble
2024	A*	`conf`	Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. IJCAI Laura Codazzi, Gergely Csáji, Matthias Mnich
2024	J	`jnl`	Ex-post Stability under Two-Sided Matching: Complexity and Characterization. CoRR Haris Aziz, Gergely Csáji, Péter Biró
2024	J	`jnl`	Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances. CoRR Gergely Csáji
2024	J	`jnl`	Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. Kristóf Bérczi, Gergely Csáji, Tamás Király
2024	J	`jnl`	Popular Maximum-Utility Matchings with Matroid Constraints. CoRR Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi
2024	A*	`conf`	Popular and Dominant Matchings with Uncertain and Multimodal Preferences. IJCAI Gergely Csáji
2024	J	`jnl`	Popularity and Perfectness in One-sided Matching Markets with Capacities. CoRR Gergely Csáji
2024	J	`jnl`	Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Games Econ. Behav. Péter Biró, Gergely Csáji
2024	J	`jnl`	The NTU Partitioned Matching Game for International Kidney Exchange Programs. CoRR Gergely Csáji, Tamás Király, Zsuzsa Mészáros-Karkus
2023	J	`jnl`	A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems. CoRR Gergely Csáji
2023	B	`conf`	Computational Complexity of k-Stable Matchings. SAGT Haris Aziz, Gergely Csáji, Ágnes Cseh
2023	J	`jnl`	Computational complexity of k-stable matchings. CoRR Haris Aziz, Gergely Csáji, Ágnes Cseh
2023	J	`jnl`	Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2023	J	`jnl`	Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples. CoRR Gergely Csáji, David F. Manlove, Iain McBride, James Trimble
2023	A	`conf`	Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola
2023	A	`conf`	Optimal Capacity Modification for Many-To-One Matching Problems. AAMAS Jiehua Chen, Gergely Csáji
2023	J	`jnl`	Optimal Capacity Modification for Many-To-One Matching Problems. CoRR Jiehua Chen, Gergely Csáji
2023	J	`jnl`	Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences. CoRR Gergely Csáji
2023	J	`jnl`	Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings. CoRR Gergely Csáji
2022	J	`jnl`	Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. CoRR Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola
2022	J	`jnl`	On the complexity of stable hypergraph matching, stable multicommodity flow and related problems. Theor. Comput. Sci. Gergely Csáji
2022	J	`jnl`	Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences. CoRR Péter Biró, Gergely Csáji