Items where Author is "Csáji, Gergely Kál"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 8. ArticleBeke, Csongor and Csáji, Gergely Kál and Csikvári, Péter and Pituk, Sára (2024) The Merino–Welsh conjecture is false for matroids. ADVANCES IN MATHEMATICS, 446. No-109674. ISSN 0001-8708 Biró, Péter and Csáji, Gergely Kál (2024) Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. GAMES AND ECONOMIC BEHAVIOR, 145. pp. 217-238. ISSN 0899-8256 Beke, Csongor and Csáji, Gergely Kál and Csíkvári, Péter and Pituk, Sára (2023) Short Proof of a Theorem of Brylawski on the Coefficients of the Tutte Polynomial. EUROPEAN JOURNAL OF COMBINATORICS, 110. pp. 1-4. ISSN 0195-6698 (print); 1095-9971 (online) Book SectionBenedek, Márton and Biró, Péter and Csáji, Gergely Kál and Johnson, Matthew and Paulusma, Daniel and Ye, Xin (2024) Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. In: AAMAS '24. IFAAMAS, [s.l.], pp. 2153-2155. ISBN 9798400704864 Csáji, Gergely Kál and Manlove, David and McBride, Iain and Trimble, James (2024) Couples Can Be Tractable : New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. In: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. IJCAI, California, pp. 2731-2739. ISBN 9781956792041 Codazzi, Laura and Csáji, Gergely Kál and Mnich, Matthias (2024) Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. In: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. IJCAI, California, pp. 1873-1880. ISBN 9781956792041 Csáji, Gergely Kál (2024) Popular and Dominant Matchings with Uncertain and Multimodal Preferences. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI, California, pp. 2740-2747. ISBN 9781956792041 Csáji, Gergely Kál (2024) A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems. In: AAMAS '24. IFAAMAS, [s.l.], pp. 409-415. ISBN 9798400704864 |