Kristóf Bérczi

Cited by

	All	Since 2018
Citations	384	290
h-index	11	10
i10-index	14	11

2009201020112012201320142015201620172018201920202021202220234 11 3 10 8 5 12 12 24 39 24 40 68 71 45

Public access

View all

31 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Tamás KirályEötvös Loránd UniversityVerified email at cs.elte.hu
András FrankProfessor emeritus, Eötvös University BudapestVerified email at cs.elte.hu
Yusuke KOBAYASHIKyoto UniversityVerified email at kurims.kyoto-u.ac.jp
Tamás SchwarczEötvös Loránd UniversityVerified email at ttk.elte.hu
Erika Renáta Bérczi-KovácsEötvös Loránd UniversityVerified email at ttk.elte.hu
Attila BernáthLufthansa Sytems Hungária Ltd.Verified email at cs.elte.hu
Karthekeyan ChandrasekaranUniversity of Illinois, Urbana-ChampaignVerified email at illinois.edu
Alpár JüttnerResearch fellow at Eötvös Loránd University of Sciences, BudapestVerified email at cs.elte.hu
Endre BorosDistinguished Professor, MSIS Department, Rutgers UniversityVerified email at rutgers.edu
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk
Matthias MnichTU HamburgVerified email at tuhh.de
Marco LaumannsVerified email at ethz.ch
Jacint SzaboEotvos UniversityVerified email at cs.elte.hu
Roland VinczePostdoctoral Researcher, Augsburg UniversityVerified email at uni-a.de
Yutaro YamaguchiOsaka UniversityVerified email at ist.osaka-u.ac.jp
Fekadu Tolessa GedefaELTE-TTK, Department of Operations ResearchVerified email at math.elte.hu
Petr KučeraCharles University in PragueVerified email at ktiml.mff.cuni.cz
Chao XuUniversity of Electronic Science and Technology of ChinaVerified email at uestc.edu.cn
Euiwoong LeeUniversity of MichiganVerified email at umich.edu
Lydia Mirabel Mendoza-CadenaVerified email at student.elte.hu

Kristóf Bérczi

MTA-ELTE Matroid Optimization Research Group, Dept. of Operations Research, Eötvös Loránd Univ.

Verified email at ttk.elte.hu - Homepage

Approximation algorithms Combinatorial optimization Graph theory Matroid theory Computational social choice


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Regular graphs are antimagic K Bérczi, B Attila, V Máté The Electronic Journal of Combinatorics 22 (3), P3.34, 2015	39	2015
The directed disjoint shortest paths problem K Bérczi, Y Kobayashi LIPIcs-Leibniz International Proceedings in Informatics 87, 2017	29	2017
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms) K BERCZI, A FRANK RIMS Kokyuroku Bessatsu 23, 1-31, 2010	28	2010
Variations for Lovász’submodular ideas K Bérczi, A Frank Building Bridges: Between Mathematics and Computer Science, 137-164, 2008	28	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	24	2012
Restricted b-Matchings in Degree-Bounded Graphs K Bérczi, LA Végh Integer Programming and Combinatorial Optimization: 14th International …, 2010	21	2010
Complexity of packing common bases in matroids K Bérczi, T Schwarcz Mathematical Programming, 1-18, 2020	16	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	15	2016
Stochastic route planning in public transport K Bérczi, A Jüttner, M Laumanns, J Szabó Transportation Research Procedia 27, 1080-1087, 2017	14	2017
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	13	2021
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	13	2020
Supermodularity in unweighted graph optimization I: Branchings and matchings K Bérczi, A Frank Mathematics of Operations Research 43 (3), 726-753, 2018	11	2018
Improving the integrality gap for multiway cut K Bérczi, K Chandrasekaran, T Király, V Madan Mathematical Programming 183 (1-2), 171-193, 2020	10	2020
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	10	2009
Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation K Bérczi, A Frank Mathematics of Operations Research 43 (3), 754-762, 2018	8	2018
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
Market pricing for matroid rank valuations K Bérczi, N Kakimura, Y Kobayashi SIAM Journal on Discrete Mathematics 35 (4), 2662-2678, 2021	7	2021
Approximations for many-visits multiple traveling salesman problems K Bérczi, M Mnich, R Vincze Omega 116, 102816, 2023	5*	2023
Approximating minimum representations of key Horn functions K Bérczi, E Boros, O Cepek, P Kučera, K Makino SIAM Journal on Computing 51 (1), 116-138, 2022	5	2022
A dual approach for dynamic pricing in multi-demand markets K Bérczi, ER Bérczi-Kovács, E Szögi arXiv preprint arXiv:2107.05131, 2021	5	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors