Regular graphs are antimagic K Bérczi, B Attila, V Máté The Electronic Journal of Combinatorics 22 (3), P3.34, 2015 | 43 | 2015 |
The directed disjoint shortest paths problem K Bérczi, Y Kobayashi LIPIcs-Leibniz International Proceedings in Informatics 87, 2017 | 36 | 2017 |
Variations for Lovász’submodular ideas K Bérczi, A Frank Building Bridges: Between Mathematics and Computer Science, 137-164, 2008 | 32 | 2008 |
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 | 31 | 2012 |
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms) K BERCZI, A FRANK RIMS Kokyuroku Bessatsu 23, 1-31, 2010 | 31 | 2010 |
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 | 21 | 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, ... arXiv preprint arXiv:2006.04428, 2020 | 20 | 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 | 19 | 2020 |
Complexity of packing common bases in matroids K Bérczi, T Schwarcz Mathematical Programming, 1-18, 2020 | 19 | 2020 |
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 | 17 | 2016 |
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 |
Supermodularity in unweighted graph optimization I: Branchings and matchings K Bérczi, A Frank Mathematics of Operations Research 43 (3), 726-753, 2018 | 14 | 2018 |
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 |
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 | 12 | 2009 |
Approximations for many-visits multiple traveling salesman problems K Bérczi, M Mnich, R Vincze Omega 116, 102816, 2023 | 10* | 2023 |
Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation K Bérczi, A Frank Mathematics of Operations Research 43 (3), 754-762, 2018 | 9 | 2018 |
Market pricing for matroid rank valuations K Bérczi, N Kakimura, Y Kobayashi SIAM Journal on Discrete Mathematics 35 (4), 2662-2678, 2021 | 8 | 2021 |
Global and fixed-terminal cuts in digraphs K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu arXiv preprint arXiv:1612.00156, 2016 | 8 | 2016 |
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 |