Erika Renáta Bérczi-Kovács
Erika Renáta Bérczi-Kovács
Verified email at cs.elte.hu
Title
Cited by
Cited by
Year
Survivable routing meets diversity coding
A Pašić, J Tapolcai, P Babarczi, ER Bérczi-Kovács, Z Király, L Rónyai
2015 IFIP Networking Conference (IFIP Networking), 1-9, 2015
16*2015
Diversity coding in two-connected networks
P Babarczi, J Tapolcai, A Pašić, L Rónyai, ER Bérczi-Kovács, M Médard
IEEE/ACM Transactions on Networking 25 (4), 2308-2319, 2017
142017
The complexity of the Clar number problem and an exact algorithm
ER Bérczi-Kovács, A Bernáth
Journal of Mathematical Chemistry, 1-9, 2017
14*2017
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes
SI Nikolenko, K Kogan, G Rétvári, ER Bérczi-Kovács, A Shalimov
2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS …, 2016
132016
Optimal and heuristic network coding algorithms for multi‐layered video broadcast
ER Bérczi‐Kovács, Z Király
Networks, 2017
12*2017
Scalable and efficient multipath routing: complexity and algorithms
J Tapolcai, G Rétvári, P Babarczi, ER Bérczi-Kovács, P Kristóf, G Enyedi
2015 IEEE 23rd International Conference on Network Protocols (ICNP), 376-385, 2015
112015
Survivable routing meets diversity coding
A Pašić, J Tapolcai, P Babarczi, ER Bérczi-Kovács, Z Király, L Rónyai
2015 IFIP Networking Conference (IFIP Networking), 1-9, 2015
92015
Enumerating Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes
B Vass, E Berczi-Kovacs, J Tapolcai
DRCN 2017-Design of Reliable Communication Networks; 13th International …, 2017
82017
Randomized and deterministic algorithms for network coding problems in wireless networks
Z Király, ER Kovács
Information Processing Letters 115 (4), 507-511, 2015
6*2015
Constructive characterization theorems in combinatorial optimization
ER Kovács, LA Végh
RIMS Kôkyűroku Bessatsu, 2009
6*2009
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
Scalable and efficient multipath routing via redundant trees
J Tapolcai, G Rétvári, P Babarczi, ER Bérczi-Kovács
IEEE Journal on Selected Areas in Communications 37 (5), 982-996, 2019
52019
Receiver heterogeneity helps: Network coding for wireless multi-layer multicast
ER Kovács, MV Pedersen, DE Lucani, FHP Fitzek
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
42014
Shared risk link group enumeration of node excluding disaster failures
B Vass, E Bérczi-Kovács, J Tapolcai
2016 International Conference on Networking and Network Applications (NaNA …, 2016
32016
Algorithms for multiplayer multicommodity flow problems
A Bernáth, T Király, ER Kovács, G Mádi-Nagy, G Pap, J Pap, J Szabó, ...
Central European Journal of Operations Research 21 (4), 699-712, 2013
32013
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding
A Pašić, P Babarczi, J Tapolcai, ER Bérczi-Kovács, Z Király, L Rónyai
IEEE/ACM Transactions on Networking 28 (1), 289-300, 2020
22020
Enumerating circular disk failures covering a single node
B Vass, ER Bérczi-Kovács, J Tapolcai
2016 8th International Workshop on Resilient Networks Design and Modeling …, 2016
22016
Graph independent field size bounds on failure protecting network codes
ER Bérczi-Kovács
Technical Report TR-2015-01, Egerváry Research Group, Budapest, 2015. www …, 2015
22015
Worst case bin packing for OTN electrical layer networks dimensioning
T Király, A Bernáth, L Végh, L Bajzik, E Kovács, K Bérczi, A Jüttner, ...
2011 13th International Conference on Transparent Optical Networks, 1-6, 2011
22011
A Note On Strongly Edge-Disjoint Arborescences
K Bérczi, ER Kovács
7th Japanese-Hungarian Symposium on Discrete Mathematics and its …, 2011
22011
The system can't perform the operation now. Try again later.
Articles 1–20