Gergely Kál Csáji

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

Collaborative distances:

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

2024

Approximating maximum-size properly colored forests.

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

CoRR, 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

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

2022

Solving the Maximum Popular Matching Problem with Matroid Constraints.

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

CoRR, 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