See the Google Scholar Citations here.

Preprints

A1   K. Bérczi, E. Boros, O. Čepek, P. Kučera, and K. Makino, Approximating minimum representations of key Horn functions, arXiv:1811.05160 (2019).
A2   K. Bérczi, T. Király, and S. Omlor, Scheduling with non-renewable resources: Minimizing the sum of completion times, arXiv:1911.12138 (2019).
A3   K. Bérczi, E. Boros, O. Čepek, P. Kučera, and K. Makino, Unique key Horn functions, arXiv:2002.06964 (2020).
A4   K. Bérczi, E. R. Bérczi-Kovács, E. Boros, F. G. Tolessa, N. Kamiyama, K. Telikepalli, Y. Kobayashi, and K. Makino, Envy-free relaxations for goods, chores, and mixed items, arXiv:2006.04428 (2020).
A5   K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuations, arXiv:2007.08759 (2020).
A6   K. Bérczi, M. Mnich, and R. Vincze, A 3/2-approximation for the metric Many-visits Path TSP, arXiv:2007.11389 (2020).
A7   K. Bérczi, T. Schwarcz, and Y. Yamaguchi, List colouring of two matroids through reduction to partition matroids, arXiv:1911.10485 (2020).
A8   K. Bérczi and T. Schwarcz, Rainbow and monochromatic circuits and cuts in binary matroid, arXiv:2012.05037 (2021).

Journal Articles

J1   K. Bérczi, S. Fujishige, N. Kamiyama, A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph, Information Processing Letters, Volume 109, Issue 23-24 (2009), pp. 1227-1231.
J2   K. Bérczi and A. Frank, Packing arborescences, Combinatorial Optimization and Discrete Algorithms, RIMS Kokyuroku Bessatsu 23 (2010), pp. 1–31.
J3   K. Bérczi and Y. Kobayashi, An algorithm for (n-3)-connectivity augmentation problem: Jump System Approach, Journal of Combinatorial Theory Series B, Volume 102 (3) (2012), pp. 565-587.
J4   K. Bérczi, A. Bernáth, M. Vizer, Regular graphs are antimagic, The Electronic Journal of Combinatorics, Volume 22, Issue 3 (2015), Paper P3.34.
J5   K. Bérczi, T. Király, Y. Kobayashi, Covering intersecting bi-set families under matroid constraints, SIAM J. Discrete Math. 30-3 (2016), pp. 1758-1774.
J6   K. Bérczi, A. Bernáth, M. Vizer, A note on V-free 2-matchings, The Electronic Journal of Combinatorics, Volume 23, Issue 4 (2016), Paper P4.27.
J7   K. Bérczi, A. Joó, King-serf duo by monochromatic paths in k-edge-coloured tournaments, The Electronic Journal of Combinatorics, Volume 24, Issue 1 (2017), Paper P1.42.
J8   K. Bérczi, Y. Kobayashi, An algorithm for identifying cycle-plus-triangles graphs, Discrete Applied Mathematics, 226(C) (), pp. 10-16.
J9   K. Bérczi, E.R. Bérczi-Kovács, Directed hypergraphs and Horn minimization, Information Processing Letters, 128(C) (2017), pp. 32-37.
J10   K. Bérczi, A. Bernáth, T. Király, G. Pap, Blocking optimal structures, Discrete Mathematics, 341(7) (2018), pp. 1864-1872.
J11   K. Bérczi, A. Jüttner, M. Laumanns, J. Szabó, Stochastic route planning in public transport, Transportation Research Procedia (27), pp. 1080-1087.
J12   K. Bérczi, S. Iwata, J. Kato, Y. Yamaguchi, Making bipartite graphs DM-irreducible, SIAM Journal on Discrete Mathematics, 32 (1) (2018), pp. 560-590.
J13   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization I: Branchings and matchings, Mathematics of Operations Research, 43 (3), pp. 726-753.
J14   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation, Mathematics of Operations Research, 43 (3), pp. 754-762.
J15   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization III: Highly-connected digraphs, Mathematics of Operations Research, 43 (3), pp. 763-780.
J16   K. Bérczi, A. Jüttner, M. Laumanns, J. Szabó, Arrival time dependent routing policies in public transport, Discrete Applied Mathematics (2018).
J17   K. Bérczi, K. Chandrasekaran, T. Király, E. Lee, and C. Xu, Beating the 2-approximation factor for global bicut, Mathematical Programming, vol. 177, no. 1–2, pp. 291-320 (2019).
J18   K. Bérczi, Z. Király, C. Liu, and I. Miklós, Packing tree degree sequences, INFORMATICA-Journal Of Computing and Informatics, vol. 43, no. 1, pp. 11-17 (2019).
J19   K. Bérczi, K. Chandrasekaran, T. Király, and V. Madan, Improving the integrality gap for multiway cut, Mathematical Programming, vol. 183, no. 1–2, pp. 171-193 (2020).
J20   K. Bérczi, K. Chandrasekaran, T. Király, and V. Madan, A tight √2-approximation for linear 3-cut, Mathematical Programming, vol. 184, no. 1–2, pp. 411-443 (2020).
J21   K. Bérczi and T. Schwarcz, Complexity of packing common bases in matroids, Mathematical Programming (2020).
J22   K. Bérczi, E. Boros, O. Čepek, K. Elbassioni, P. Kučera, and K. Makino, Generating clause sequences of a CNF formula, Theoretical Computer Science, vol. 856, pp. 68–74 (2021).
J23 R. Tóbiás, K. Bérczi, Cs. Szabó, A.G. Császár, autoECART: Automatic Energy Conservation Analysis of Rovibronic Transitions, Journal of Quantitative Spectroscopy and Radiative Transfer, 107756 (2021).

Refereed Conference Proceedings

P1   K. Bérczi and L.A. Végh, Restricted b-matchings in degree-bounded graphs, In: F. Eisenbrand and F.B. Shepherd (eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Volume 6080 (2010), pp. 43-56.
P2   L. Bajzik, K. Bérczi, A. Bernáth, T. Jordán, A. Jüttner, T. Király, E.R. Kovács, L.A. Végh, Worst case bin packing for OTN electrical layer networks dimensioning, 13th International Conference on Transparent Optical Networks, Stockholm, Sweden (June 2011), pp. 43-49.
P3   L. Bajzik, K. Bérczi, T. Kárász, E.R. Kovács, Zs. Lakatos, L.A. Végh, ILP based diverse path routing with node inclusion, 3rd International Congress on Ultra Modern Telecommunications and Control Systems, Budapest, Hungary, (October 2011), pp. 750-758.
P4   K. Bérczi, Z. Király, C. Liu, I. Miklós, Packing tree degree sequences, Middle-European Conference on Applied Theoretical Computer Science (MATCOS 2016), Ljubljana, Slovenia (October 2016), pp. 61-64.
P5   K. Bérczi, K. Chandrasekaran, T. Király, E. Lee, C. Xu, Global and fixed-terminal cuts in digraphs, The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’2017), Berkeley, 2017, pp. 1–20.
P6   J. Yallouz, J. Tapolcai, A. Kőrösi, K. Bérczi, L. Gyimóthi and A. Orda, Packing Strictly-Shortest Paths in a Tree for QoS-Aware Routing, IFIP Networking 2017, Stockholm, Sweden (June 2017).
P7   K. Bérczi and Y. Kobayashi, The Directed Disjoint Shortest Paths Problem, The 25th Annual European Symposium on Algorithms (ESA 2017), Vienna, 2017, pp. 1–13.
P8   K. Bérczi, K. Chandrasekaran, T. Király, V. Madan, A tight √2-approximation for linear 3-cut, Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA (January 2018).
P9   K. Bérczi, K. Chandrasekaran, T. Király, V. Madan, Improving the integrality gap for multiway cut, Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, Michigan, USA, pp. 115–127.
P10   K. Bérczi, T. Király, and S. Omlor, Scheduling with non-renewable resources: Minimizing the sum of completion times, 6th International Symposium on Combinatorial Optimization (ISCO 2020), pp. 167-178.
P11   K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuations, 31st International Symposium on Algorithms and Computation (ISAAC 2020), pp. 1-15.

Other Conference Proceedings

O1   K. Bérczi and E.R. Kovács, A note on strongly edge-disjoint arborescences, In: S. Iwata (eds.), Proceedings of 7th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, Kyoto, Japan (June 2011), pp. 10-18.
O2   K. Bérczi, P. Csikvári, E.R. Kovács, L.A. Végh, Splitting property via shadow systems, In: A. Frank, A. Recski, G. Wiener (eds.), Proceedings of 8th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, Veszprém, Hungary (June 2013), pp. 33-44.
O3   K. Bérczi, A. Frank, Graph optimization problems with common root (Parts I and II), Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan (June 2015), pp. 242-266.
O4   K. Bérczi, T. Király, Y. Kobayashi, Algorithmic aspects of covering supermodular functions under matroid constraints, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan (June 2015), pp. 301-306.
O5   K. Bérczi, A. Jüttner, Road Surveillance Optimization - An Asymmetric Vehicle Routing Problem with Visiting Frequencies, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan (June 2015), pp. 460-464.
O6   K. Bérczi, E. R. Bérczi-Kovács, Directed hypergraphs and Horn minimization, Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary (May 2017), pp. 59-65.
O7   K. Bérczi, A. Bernáth, T. Király, G. Pap, Blocking optimal structures, Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary (May 2017), pp. 67-75.
O8   K. Bérczi, E. Boros, O. Čepek, P. Kučera, and K. Makino, Approximating minimum representations of key Horn functions, 16th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2020), pp. 1–8.

Surveys in Books

S1   K. Bérczi and A. Frank, Variations for Lovász' submodular ideas, In: M. Grötschel, G.O.H. Katona(eds.), Building Bridges Between Mathematics and Computer Science, Bolyai Society, Series: Mathematical Studies, 19, Springer 2008, pp. 137--164.

Patents

T1   K. Bérczi, A. Jüttner, M. Korom, M. Laumanns, T. Nonner, J. Szabó, Stochastic route planning in public transport, US 20150268052 (September 2015)

Lecture Notes

L1   K. Bérczi, A. Frank, V. Kaszanitzky, Cs. Király, T. Király, E.R. Kovács, Gy. Pap, J. Pap, Operációkutatási példatár (in hungarian), Typotex Kiadó, 2013.

Theses

D1   K. Bérczi, Packings and coverings in directed graphs, Master thesis, Eötvös Loránd University, Budapest (2008)
D2   K. Bérczi, Arborescence packing and restricted b-matchings, PhD thesis, Eötvös Loránd University, Budapest (2013)
         (Updated version - last updated on 13/01/2014. Many thanks to Zoltán Szigeti for pointing out several mistakes!)