| Regular graphs are antimagic K Bérczi, B Attila, V Máté The Electronic Journal of Combinatorics 22 (3), P3.34, 2015 | 48 | 2015 |
| The directed disjoint shortest paths problem K Bérczi, Y Kobayashi LIPIcs-Leibniz International Proceedings in Informatics 87, 2017 | 44 | 2017 |
| Envy-free relaxations for goods, chores, and mixed items K Bérczi, ER Bérczi-Kovács, E Boros, FT Gedefa, N Kamiyama, T Kavitha, ... Theoretical Computer Science 1002, 114596, 2024 | 36* | 2024 |
| Variations for Lovász’submodular ideas K Bérczi, A Frank Building Bridges: Between Mathematics and Computer Science, 137-164, 2008 | 35 | 2008 |
| Packing Arborescences (Combinatorial Optimization and Discrete Algorithms) K BERCZI, A FRANK RIMS Kokyuroku Bessatsu 23, 1-31, 2010 | 31 | 2010 |
| An algorithm for (n− 3)-connectivity augmentation problem: Jump system approach K Bérczi, Y Kobayashi Journal of Combinatorial Theory, Series B 102 (3), 565-587, 2012 | 30 | 2012 |
| Restricted b-Matchings in Degree-Bounded Graphs K Bérczi, LA Végh International Conference on Integer Programming and Combinatorial …, 2010 | 29 | 2010 |
| Stochastic route planning in public transport K Bérczi, A Jüttner, M Laumanns, J Szabó Transportation Research Procedia 27, 1080-1087, 2017 | 27 | 2017 |
| Complexity of packing common bases in matroids K Bérczi, T Schwarcz Mathematical Programming, 1-18, 2020 | 24 | 2020 |
| Improving the integrality gap for multiway cut K Bérczi, K Chandrasekaran, T Király, V Madan Mathematical Programming 183 (1), 171-193, 2020 | 23 | 2020 |
| 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 | 20 | 2023 |
| Approximations for many-visits multiple traveling salesman problems K Bérczi, M Mnich, R Vincze Omega 116, 102816, 2023 | 19* | 2023 |
| 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 | 18 | 2021 |
| Supermodularity in unweighted graph optimization I: Branchings and matchings K Bérczi, A Frank Mathematics of Operations Research 43 (3), 726-753, 2018 | 18 | 2018 |
| Covering intersecting bi-set families under matroid constraints K Bérczi, T Király, Y Kobayashi SIAM Journal on Discrete Mathematics 30 (3), 1758-1774, 2016 | 16 | 2016 |
| Exchange distance of basis pairs in split matroids K Bérczi, T Schwarcz SIAM Journal on Discrete Mathematics 38 (1), 132-147, 2024 | 15 | 2024 |
| A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph K Bérczi, S Fujishige, N Kamiyama Information processing letters 109 (23-24), 1227-1231, 2009 | 13 | 2009 |
| 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 | 11 | 2024 |
| A 3/2-approximation for the metric many-visits path TSP K Bérczi, M Mnich, R Vincze SIAM journal on discrete mathematics 36 (4), 2995-3030, 2022 | 10 | 2022 |
| autoECART: automatic energy conservation analysis of rovibronic transitions R Tóbiás, K Bérczi, C Szabó, AG Császár Journal of Quantitative Spectroscopy and Radiative Transfer 272, 107756, 2021 | 10 | 2021 |
Tamás KirályEötvös Loránd UniversityVerified email at cs.elte.hu
