default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErika R. Kovács
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Erika R. Bérczi-Kovács
, András Frank:
A network flow approach to a common generalization of Clar and Fries numbers. Discret. Math. 347(1): 114145 (2024)- [j13]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - [j12]Balázs Vass, Erika R. Bérczi-Kovács, Ádám Fraknói, Costin Raiciu, Gábor Rétvári:
Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches. IEEE/ACM Trans. Netw. 32(5): 4519-4534 (2024) - [c13]Balázs Vass, Erika R. Bérczi-Kovács, Péter Gyimesi, János Tapolcai:
Efficient Computing of Disaster-Disjoint Paths: Greedy and Beyond. INFOCOM (Workshops) 2024: 1-2 - [c12]Erika R. Bérczi-Kovács, Péter Gyimesi, Balázs Vass, János Tapolcai:
Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks. INFOCOM 2024: 951-960 - 2023
- [j11]Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi:
A Dual Approach for Dynamic Pricing in Multidemand Markets. SIAM J. Discret. Math. 37(3): 1771-1787 (2023) - [j10]Balázs Vass, Erika R. Bérczi-Kovács, Ábel Barabás, Zsombor L. Hajdú, János Tapolcai:
A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem. IEEE/ACM Trans. Netw. 31(6): 3051-3062 (2023) - [i6]Erika R. Bérczi-Kovács, Kata Kosztolányi:
Testing popularity in linear time via maximum matching. CoRR abs/2312.01880 (2023) - 2022
- [c11]Balázs Vass, Ádám Fraknói, Erika R. Bérczi-Kovács, Gábor Rétvári:
Compiling packet programs to dRMT switches: theory and algorithms. EuroP4@CoNEXT 2022: 26-32 - [c10]Balázs Vass, Erika R. Bérczi-Kovács, Ábel Barabás, Zsombor L. Hajdú, János Tapolcai:
Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem. INFOCOM 2022: 940-949 - 2021
- [j9]Balázs Vass, János Tapolcai, Erika R. Bérczi-Kovács:
Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes. IEEE/ACM Trans. Netw. 29(4): 1648-1661 (2021) - [i5]Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi:
A dual approach for dynamic pricing in multi-demand markets. CoRR abs/2107.05131 (2021) - [i4]Erika R. Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila Mályusz:
Polynomially tractable cases in the popular roommates problem. CoRR abs/2107.06694 (2021) - 2020
- [j8]Alija Pasic, Péter Babarczi, János Tapolcai, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding. IEEE/ACM Trans. Netw. 28(1): 289-300 (2020) - [c9]Balázs Vass, Erika R. Bérczi-Kovács, Costin Raiciu, Gábor Rétvári:
Compiling Packet Programs to Reconfigurable Switches: Theory and Algorithms. EuroP4@CoNEXT 2020: 28-35 - [i3]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR abs/2006.04428 (2020)
2010 – 2019
- 2019
- [j7]János Tapolcai, Gábor Rétvári, Péter Babarczi, Erika R. Bérczi-Kovács:
Scalable and Efficient Multipath Routing via Redundant Trees. IEEE J. Sel. Areas Commun. 37(5): 982-996 (2019) - 2018
- [j6]Erika R. Bérczi-Kovács, Zoltán Király:
Optimal and heuristic network coding algorithms for multi-layered video broadcast. Networks 71(1): 51-59 (2018) - 2017
- [j5]Kristóf Bérczi, Erika R. Bérczi-Kovács:
Directed hypergraphs and Horn minimization. Inf. Process. Lett. 128: 32-37 (2017) - [j4]Péter Babarczi, János Tapolcai, Alija Pasic, Lajos Rónyai, Erika R. Bérczi-Kovács, Muriel Médard:
Diversity Coding in Two-Connected Networks. IEEE/ACM Trans. Netw. 25(4): 2308-2319 (2017) - [i2]Erika R. Bérczi-Kovács, Zoltán Király:
Network Coding Algorithms for Multi-Layered Video Broadcast. CoRR abs/1712.06435 (2017) - 2016
- [c8]Sergey I. Nikolenko, Kirill Kogan, Gábor Rétvári, Erika R. Bérczi-Kovács, Alexander Shalimov:
How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes. INFOCOM Workshops 2016: 521-526 - [c7]Bálazs Vass, Erika R. Bérczi-Kovács, János Tapolcai:
Shared Risk Link Group Enumeration of Node Excluding Disaster Failures. NaNA 2016: 349-354 - [c6]Bálazs Vass, Erika R. Bérczi-Kovács, János Tapolcai:
Enumerating circular disk failures covering a single node. RNDM 2016: 189-195 - 2015
- [j3]Zoltán Király, Erika R. Kovács:
Randomized and deterministic algorithms for network coding problems in wireless networks. Inf. Process. Lett. 115(4): 507-511 (2015) - [c5]János Tapolcai, Gábor Rétvári, Péter Babarczi, Erika R. Bérczi-Kovács, Panna Kristof, Gábor Enyedi:
Scalable and Efficient Multipath Routing: Complexity and Algorithms. ICNP 2015: 376-385 - [c4]Alija Pasic, János Tapolcai, Péter Babarczi, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Survivable routing meets diversity coding. Networking 2015: 1-9 - [i1]Erika R. Bérczi-Kovács, Attila Bernáth:
The complexity of the Clar number problem and an FPT algorithm. CoRR abs/1508.06889 (2015) - 2014
- [c3]Erika R. Kovács, Morten Videbæk Pedersen, Daniel Enrique Lucani, Frank H. P. Fitzek:
Receiver heterogeneity helps: Network coding for wireless multi-layer multicast. NetCod 2014: 1-6 - 2013
- [j2]Attila Bernáth, Tamás Király, Erika R. Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László A. Végh:
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21(4): 699-712 (2013) - 2012
- [c2]Zoltán Király, Erika Renata Kovács:
Deterministic network coding algorithms and applications for wireless networks. NetCod 2012: 103-107 - 2011
- [j1]Erika R. Kovács, László A. Végh:
The constructive characterization of (κ, ℓ)-edge-connected digraphs. Comb. 31(2): 201-223 (2011) - [c1]Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh:
ILP based diverse path routing with node inclusion. ICUMT 2011: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
