Követés
Kristóf Bérczi
Kristóf Bérczi
További nevekKristof Berczi
Matroid Optimization Research Group, Department of Operations Research, Eötvös Loránd University
E-mail megerősítve itt: ttk.elte.hu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Regular graphs are antimagic
K Bérczi, B Attila, V Máté
The Electronic Journal of Combinatorics 22 (3), P3.34, 2015
442015
The directed disjoint shortest paths problem
K Bérczi, Y Kobayashi
LIPIcs-Leibniz International Proceedings in Informatics 87, 2017
412017
Variations for Lovász’submodular ideas
K Bérczi, A Frank
Building Bridges: Between Mathematics and Computer Science, 137-164, 2008
322008
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
312012
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms)
K BERCZI, A FRANK
RIMS Kokyuroku Bessatsu 23, 1-31, 2010
312010
Restricted b-Matchings in Degree-Bounded Graphs
K Bérczi, LA Végh
International Conference on Integer Programming and Combinatorial …, 2010
292010
Stochastic route planning in public transport
K Bérczi, A Jüttner, M Laumanns, J Szabó
Transportation Research Procedia 27, 1080-1087, 2017
242017
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
222020
Improving the integrality gap for multiway cut
K Bérczi, K Chandrasekaran, T Király, V Madan
Mathematical Programming 183 (1), 171-193, 2020
202020
Complexity of packing common bases in matroids
K Bérczi, T Schwarcz
Mathematical Programming, 1-18, 2020
192020
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
172016
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
162021
Approximations for many-visits multiple traveling salesman problems
K Bérczi, M Mnich, R Vincze
Omega 116, 102816, 2023
15*2023
Supermodularity in unweighted graph optimization I: Branchings and matchings
K Bérczi, A Frank
Mathematics of Operations Research 43 (3), 726-753, 2018
152018
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
142023
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
122009
Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation
K Bérczi, A Frank
Mathematics of Operations Research 43 (3), 754-762, 2018
92018
Exchange distance of basis pairs in split matroids
K Bérczi, T Schwarcz
SIAM Journal on Discrete Mathematics 38 (1), 132-147, 2024
82024
autoECART: Automatic energy conservation analysis of rovibronic transitions
R Tóbiás, K Bérczi, C Szabó, AG Császár
Journal of Quantitative Spectroscopy and Radiative Transfer 272, 107756, 2021
82021
Market pricing for matroid rank valuations
K Bérczi, N Kakimura, Y Kobayashi
SIAM Journal on Discrete Mathematics 35 (4), 2662-2678, 2021
82021
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20