| Complexity of packing common bases in matroids K Bérczi, T Schwarcz Mathematical Programming 188 (1), 1-18, 2021 | 19 | 2021 |
| List coloring of two matroids through reduction to partition matroids K Bérczi, T Schwarcz, Y Yamaguchi SIAM Journal on Discrete Mathematics 35 (3), 2192-2209, 2021 | 16 | 2021 |
| Hypergraph characterization of split matroids K Bérczi, T Király, T Schwarcz, Y Yamaguchi, Y Yokoi Journal of Combinatorial Theory, Series A 194, 105697, 2023 | 12 | 2023 |
| Exchange distance of basis pairs in split matroids K Bérczi, T Schwarcz SIAM Journal on Discrete Mathematics 38 (1), 132-147, 2024 | 6 | 2024 |
| Rainbow and monochromatic circuits and cocircuits in binary matroids K Bérczi, T Schwarcz Discrete Mathematics 345 (6), 112830, 2022 | 4* | 2022 |
| Weighted exchange distance of basis pairs K Bérczi, B Mátravölgyi, T Schwarcz Discrete Applied Mathematics 349, 130-143, 2024 | 3 | 2024 |
| Reconfiguration of the Union of Arborescences Y Kobayashi, R Mahara, T Schwarcz arXiv preprint arXiv:2304.13217, 2023 | 3 | 2023 |
| Reconfiguration of basis pairs in regular matroids K Bérczi, B Mátravölgyi, T Schwarcz Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1653-1664, 2024 | 2 | 2024 |
| Monotonic Decompositions of Submodular Set Functions K Bérczi, B Gehér, A Imolay, L Lovász, T Schwarcz arXiv preprint arXiv:2406.04728, 2024 | 1 | 2024 |
| Problems on Group-labeled Matroid Bases F Hörsch, A Imolay, R Mizutani, T Oki, T Schwarcz arXiv preprint arXiv:2402.16259, 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 |
| Partitioning into common independent sets via relaxing strongly base orderability K Bérczi, T Schwarcz Journal of Combinatorial Theory, Series A 202, 105817, 2024 | | 2024 |
Kristóf BércziMatroid Optimization Research Group, Department of Operations Research, Eötvös Loránd University在 ttk.elte.hu 的电子邮件经过验证
