Kristóf Bérczi
Kristóf Bérczi
MTA-ELTE Egerváry Research Group, Department of Operations Research, Eötvös Loránd University
Adresse e-mail validée de cs.elte.hu - Page d'accueil
Titre
Citée par
Citée par
Année
Regular graphs are antimagic
K Bérczi, B Attila, V Máté
The Electronic Journal of Combinatorics 22 (3), P3.34, 2015
312015
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms)
K BERCZI, A FRANK
RIMS Kokyuroku Bessatsu 23, 1-31, 2010
272010
Variations for Lovász’submodular ideas
K Bérczi, A Frank
Building Bridges, 137-164, 2008
242008
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
202012
Restricted b-Matchings in Degree-Bounded Graphs
K Bérczi, LA Végh
International Conference on Integer Programming and Combinatorial …, 2010
182010
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
162016
The directed disjoint shortest paths problem
K Bérczi, Y Kobayashi
LIPIcs-Leibniz International Proceedings in Informatics 87, 2017
142017
Stochastic route planning in public transport
K Bérczi, A Jüttner, M Laumanns, J Szabó
Transportation Research Procedia 27, 1080-1087, 2017
92017
Supermodularity in unweighted graph optimization I: Branchings and matchings
K Bérczi, A Frank
Mathematics of Operations Research 43 (3), 726-753, 2018
82018
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
82016
Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation
K Bérczi, A Frank
Mathematics of Operations Research 43 (3), 754-762, 2018
72018
Improving the integrality gap for multiway cut
K Bérczi, K Chandrasekaran, T Király, V Madan
Mathematical Programming 183 (1), 171-193, 2020
62020
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
62009
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
52020
Supermodularity in unweighted graph optimization III: Highly connected digraphs
K Bérczi, A Frank
Mathematics of Operations Research 43 (3), 763-780, 2018
52018
Supermodularity in unweighted graph optimization IV
K Bérczi, A Frank
Algorithms, 2017
52017
List colouring of two matroids through reduction to partition matroids
K Bérczi, T Schwarcz, Y Yamaguchi
arXiv preprint arXiv:1911.10485, 2019
42019
Algorithmic aspects of covering supermodular functions under matroid constraints
K Bérczi, T Király, Y Kobayashi
EGRES Technical Reports series, http://www.cs.elte.hu/egres, 2015
42015
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
32020
Complexity of packing common bases in matroids
K Bérczi, T Schwarcz
Mathematical Programming, 1-18, 2020
32020
Le systčme ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20