Kristóf Bérczi

Cited by

	All	Since 2017
Citations	323	255
h-index	9	9
i10-index	9	9

200920102011201220132014201520162017201820192020202120224 4 5 10 8 5 12 11 25 39 29 41 75 45

Public access

View all

27 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
Yusuke KOBAYASHIKyoto UniversityVerified email at kurims.kyoto-u.ac.jp
András FrankProfessor emeritus, Eötvös University BudapestVerified email at cs.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
Tamás SchwarczEötvös Loránd UniversityVerified email at ttk.elte.hu
Marco LaumannsVerified email at ethz.ch
Jacint SzaboEotvos UniversityVerified email at cs.elte.hu
Alpár JüttnerResearch fellow at Eötvös Loránd University of Sciences, BudapestVerified email at cs.elte.hu
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk
Endre BorosDistinguished Professor, MSIS Department, Rutgers UniversityVerified email at rutgers.edu
Matthias MnichTU HamburgVerified email at tuhh.de
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
Tibor JordánProfessor of mathematics, Eötvös University, BudapestVerified email at math.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	36	2015
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms) K BERCZI, A FRANK RIMS Kokyuroku Bessatsu 23, 1-31, 2010	27*	2010
Variations for Lovász’submodular ideas K Bérczi, A Frank Building Bridges, 137-164, 2008	26	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 International Conference on Integer Programming and Combinatorial …, 2010	21	2010
The directed disjoint shortest paths problem K Bérczi, Y Kobayashi LIPIcs-Leibniz International Proceedings in Informatics 87, 2017	18	2017
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
Improving the integrality gap for multiway cut K Bérczi, K Chandrasekaran, T Király, V Madan Mathematical Programming 183 (1), 171-193, 2020	11	2020
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	11	2020
Complexity of packing common bases in matroids K Bérczi, T Schwarcz Mathematical Programming, 1-18, 2020	9	2020
Periodic railway timetabling with sequential decomposition in the PESP model S Herrigel, M Laumanns, J Szabo, U Weidmann Journal of rail transport planning & management 8 (3-4), 167-183, 2018	9	2018
Supermodularity in unweighted graph optimization I: Branchings and matchings K Bérczi, A Frank Mathematics of Operations Research 43 (3), 726-753, 2018	9	2018
Stochastic route planning in public transport K Bérczi, A Jüttner, M Laumanns, J Szabó Transportation Research Procedia 27, 1080-1087, 2017	9	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	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
Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation K Bérczi, A Frank Mathematics of Operations Research 43 (3), 754-762, 2018	7	2018
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	7	2009
Market pricing for matroid rank valuations K Bérczi, N Kakimura, Y Kobayashi SIAM Journal on Discrete Mathematics 35 (4), 2662-2678, 2021	5	2021
Scheduling with non-renewable resources: Minimizing the sum of completion times K Bérczi, T Király, S Omlor International symposium on combinatorial optimization, 167-178, 2020	5	2020
Arrival time dependent routing policies in public transport K Bérczi, A Jüttner, M Laumanns, J Szabó Discrete Applied Mathematics 251, 93-102, 2018	5	2018

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 this author

Cited by

Co-authors