ILP based diverse path routing with node inclusion. - Zsolt Lakatos; Lajos Bajzik; Tamás Kárász; Kristóf Bérczi; Erika R. Kovács; László A. Végh (ICUMT, 2011)

The constructive characterization of (κ, ℓ)-edge-connected digraphs. - Erika R. Kovács; László A. Végh (Comb., 2011)

Deterministic network coding algorithms and applications for wireless networks. - Zoltán Király; Erika Renata Kovács (NetCod, 2012)

Algorithms for multiplayer multicommodity flow problems. - 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 (Central Eur. J. Oper. Res., 2013)

Receiver heterogeneity helps: Network coding for wireless multi-layer multicast. - Erika R. Kovács; Morten Videbæk Pedersen; Daniel Enrique Lucani; Frank H. P. Fitzek (NetCod, 2014)

Scalable and Efficient Multipath Routing: Complexity and Algorithms. - János Tapolcai; Gábor Rétvári; Péter Babarczi; Erika R. Bérczi-Kovács; Panna Kristof; Gábor Enyedi (ICNP, 2015)

Survivable routing meets diversity coding. - Alija Pasic; János Tapolcai; Péter Babarczi; Erika R. Bérczi-Kovács; Zoltán Király; Lajos Rónyai (Networking, 2015)

The complexity of the Clar number problem and an FPT algorithm. - Erika R. Bérczi-Kovács; Attila Bernáth (CoRR, 2015)

Randomized and deterministic algorithms for network coding problems in wireless networks. - Zoltán Király; Erika R. Kovács (Inf. Process. Lett., 2015)

How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes. - Sergey I. Nikolenko; Kirill Kogan; Gábor Rétvári; Erika R. Bérczi-Kovács; Alexander Shalimov (INFOCOM Workshops, 2016)

Shared Risk Link Group Enumeration of Node Excluding Disaster Failures. - Bálazs Vass; Erika R. Bérczi-Kovács; János Tapolcai (NaNA, 2016)

Enumerating circular disk failures covering a single node. - Bálazs Vass; Erika R. Bérczi-Kovács; János Tapolcai (RNDM, 2016)

Network Coding Algorithms for Multi-Layered Video Broadcast. - Erika R. Bérczi-Kovács; Zoltán Király (CoRR, 2017)

Directed hypergraphs and Horn minimization. - Kristóf Bérczi; Erika R. Bérczi-Kovács (Inf. Process. Lett., 2017)

Diversity Coding in Two-Connected Networks. - Péter Babarczi; János Tapolcai; Alija Pasic; Lajos Rónyai; Erika R. Bérczi-Kovács; Muriel Médard (IEEE/ACM Trans. Netw., 2017)

Optimal and heuristic network coding algorithms for multi-layered video broadcast. - Erika R. Bérczi-Kovács; Zoltán Király (Networks, 2018)

Scalable and Efficient Multipath Routing via Redundant Trees. - János Tapolcai; Gábor Rétvári; Péter Babarczi; Erika R. Bérczi-Kovács (IEEE J. Sel. Areas Commun., 2019)

Compiling Packet Programs to Reconfigurable Switches: Theory and Algorithms. - Balázs Vass; Erika R. Bérczi-Kovács; Costin Raiciu; Gábor Rétvári (EuroP4@CoNEXT, 2020)

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding. - Alija Pasic; Péter Babarczi; János Tapolcai; Erika R. Bérczi-Kovács; Zoltán Király; Lajos Rónyai (IEEE/ACM Trans. Netw., 2020)

A dual approach for dynamic pricing in multi-demand markets. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Evelin Szögi (CoRR, 2021)

Polynomially tractable cases in the popular roommates problem. - Erika R. Bérczi-Kovács; Ágnes Cseh; Kata Kosztolányi; Attila Mályusz (CoRR, 2021)

Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes. - Balázs Vass; János Tapolcai; Erika R. Bérczi-Kovács (IEEE/ACM Trans. Netw., 2021)

Compiling packet programs to dRMT switches: theory and algorithms. - Balázs Vass; Ádám Fraknói; Erika R. Bérczi-Kovács; Gábor Rétvári (EuroP4@CoNEXT, 2022)

Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem. - Balázs Vass; Erika R. Bérczi-Kovács; Ábel Barabás; Zsombor L. Hajdú; János Tapolcai (INFOCOM, 2022)

A Dual Approach for Dynamic Pricing in Multidemand Markets. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Evelin Szögi (SIAM J. Discret. Math., 2023)

A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem. - Balázs Vass; Erika R. Bérczi-Kovács; Ábel Barabás; Zsombor L. Hajdú; János Tapolcai (IEEE/ACM Trans. Netw., 2023)

Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks. - Erika R. Bérczi-Kovács; Péter Gyimesi; Balázs Vass; János Tapolcai (INFOCOM, 2024)

Efficient Computing of Disaster-Disjoint Paths: Greedy and Beyond. - Balázs Vass; Erika R. Bérczi-Kovács; Péter Gyimesi; János Tapolcai (INFOCOM (Workshops), 2024)

Envy-free relaxations for goods, chores, and mixed items. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa; Naoyuki Kamiyama; Telikepalli Kavitha; Yusuke Kobayashi 001; Kazuhisa Makino (Theor. Comput. Sci., 2024)

A network flow approach to a common generalization of Clar and Fries numbers. - Erika R. Bérczi-Kovács; András Frank (Discret. Math., 2024)

Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches. - Balázs Vass; Erika R. Bérczi-Kovács; Ádám Fraknói; Costin Raiciu; Gábor Rétvári (IEEE/ACM Trans. Netw., 2024)

Testing popularity in linear time via maximum matching. - Erika R. Bérczi-Kovács; Kata Kosztolányi (Discret. Appl. Math., 2025)

DateLine: Efficient Algorithm for Computing Region Disjoint Paths in Backbone Networks. - Erika R. Bérczi-Kovács; Péter Gyimesi; Balázs Vass; János Tapolcai (IEEE J. Sel. Areas Commun., 2025)