See the Google Scholar Citations here.

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, K. Chandrasekaran, T. Király, E. Lee, C. Xu, Beating the 2-approximation factor for global bicut, Mathematical programming (2017/10).

J11   K. Bérczi, A. Bernáth, T. Király, G. Pap, Blocking optimal structures, Discrete Mathematics, 341(7) (2018), pp. 1864-1872.

J12   K. Bérczi, A. Jüttner, M. Laumanns, J. Szabó, Stochastic route planning in public transport, Transportation Research Procedia (27), pp. 1080-1087.

J13   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.

J14   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization I: Branchings and matchings, Mathematics of Operations Research, 43 (3), pp. 726-753.

J15   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation, Mathematics of Operations Research, 43 (3), pp. 754-762.

J16   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization III: Highly-connected digraphs, Mathematics of Operations Research, 43 (3), pp. 763-780.

J17   K. Bérczi, A. Jüttner, M. Laumanns, J. Szabó, Arrival time dependent routing policies in public transport, Discrete Applied Mathematics (2018).

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).

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.

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.

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.

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)

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!)

Technical Reports

R1   K. Bérczi, A. Frank Variations for Lovász' submodular ideas, TR-2008-07, EGRES Technical Reports series, http://www.cs.elte.hu/egres (June 2008)

R2   K. Bérczi, A. Frank Packing arborescences, TR-2009-04, EGRES Technical Reports series, http://www.cs.elte.hu/egres (May 2009)

R3   K. Bérczi, L.A. Végh Restricted b-matchings in degree-bounded graphs, TR-2009-12, EGRES Technical Reports series, http://www.cs.elte.hu/egres (September 2009)

R4   K. Bérczi and E.R. Kovács, A note on strongly edge-disjoint arborescences, TR-2011-04, EGRES Technical Reports series, http://www.cs.elte.hu/egres (March 2011)

R5   K. Bérczi, Subgraphs with restricted degree differences, QP-2011-04, EGRES Quick Proofs series, http://www.cs.elte.hu/egres (May 2011)

R6   K. Bérczi and E.R. Kovács, Constructive characterization of dumpy digraphs, QP-2011-05, EGRES Quick Proofs series, http://www.cs.elte.hu/egres (May 2011)

R7   K. Bérczi and E.R. Kovács, A note on conservative costs, QP-2011-06, EGRES Quick Proofs series, http://www.cs.elte.hu/egres (May 2011)

R8   K. Bérczi, The triangle-free 2-matching polytope of subcubic graphs, TR-2012-02, EGRES Technical Reports series, http://www.cs.elte.hu/egres (April 2012)

R9   K. Bérczi, P. Csikvári, E.R. Kovács, L.A. Végh, Splitting property via shadow systems, TR-2013-02, EGRES Technical Reports series, http://www.cs.elte.hu/egres (March 2013)

R12   K. Bérczi, T. Király, Y. Kobayashi, Covering intersecting bi-set famlies under matroid constraints, TR-2013-06, EGRES Technical Reports series, http://www.cs.elte.hu/egres (September 2013)

R11   K. Bérczi, A. Bernáth, M. Vizer, Regular graphs are antimagic, ArXiv preprint arXiv:1504.08146. QP-2015-03, EGRES Quick Proof series, http://www.cs.elte.hu/egres (April 2015).

R12   K. Bérczi, A. Bernáth, M. Vizer, A note on V-free 2-matchings, ArXiv preprint arXiv:1505.03717. QP-2015-04, EGRES Quick Proof series, http://www.cs.elte.hu/egres (April 2015). A journal version is submitted.

R13   K. Bérczi, T. Király, Y. Kobayashi, Algorithmic aspects of covering supermodular functions under matroid constraints, TR-2015-05, EGRES Technical Reports series, http://www.cs.elte.hu/egres (May 2015)

R14   K. Bérczi, A. Frank, Non-TDI graph-optimization with supermodular functions (extended abstract), TR-2015-14, EGRES Technical Reports series, http://www.cs.elte.hu/egres (August 2015)

R15   K. Bérczi, A note on packing half-regular bipartite graphs, QP-2016-01, EGRES Quick Proof series, http://www.cs.elte.hu/egres (June 2016)

R16   K. Bérczi, A. Joó, King-serf duo by monochromatic paths in k-edge-coloured tournaments, TR-2016-08, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R17   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization I: Branchings and matchings , TR-2016-09, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R18   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation , TR-2016-10, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R19   K. Bérczi, A. Frank, Supermodularity in unweighted graph optimization III: Highly connected digraphs , TR-2016-11, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R20   K. Bérczi, Y. Kobayashi, An algorithm for identifying cycle-plus-triangles graphs , TR-2016-12, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R21   K. Bérczi, Y. Kobayashi, The directed disjoint shortest paths problem , TR-2016-13, EGRES Technical Reports series, http://www.cs.elte.hu/egres (July 2016)

R22   K. Bérczi, A. Bernáth, T. Király, G. Pap, Blocking optimal structures, TR-2017-07, EGRES Technical Reports series, http://www.cs.elte.hu/egres (September 2017)

R23   K. Bérczi, K. Chandrasekaran, T. Király, E. Lee, C. Xu, Beating the 2-approximation factor for Global Bicut, TR-2017-09, EGRES Technical Reports series, http://www.cs.elte.hu/egres (October 2017)

R24   K. Bérczi, K. Chandrasekaran, T. Király, V. Madan, A tight $\sqrt{2}$-approximation for linear 3-cut, TR-2017-10, EGRES Technical Reports series, http://www.cs.elte.hu/egres (2017)

R25   K. Bérczi, H. Gábor, Total domatic number of triangulated planar graphs, QP-2018-01, EGRES Quick Proof series, http://www.cs.elte.hu/egres (2018)

R26   K. Bérczi, Z. Paulovics Triangle-free Eulerian planar graphs are friendly, QP-2018-02, EGRES Quick Proof series, http://www.cs.elte.hu/egres (2018)

R27   K. Bérczi, E. Boros, O. Cepek, K. Makino, P. Kucera, Minimal representation of elementary Horn functions, TR-2018-12, EGRES Technical Reports series, http://www.cs.elte.hu/egres (2018)