Erika Renáta Bérczi-Kovács
assistant professor, member
Address: | Department of Operations Research |
| Eötvös Loránd University |
| 1117 Budapest |
| Pázmány Péter sétány, 1/C, 3-519 |
Tel: | (+36-1) 372-2500/1842 |
Email: | erika.berczi-kovacs_at_ttk.elte.hu |
Home page: | |
Publication list: | |
|
|
List of EGRES technical reports
- A network flow approach to a common generalization of Clar and Fries numbers (Erika Renáta Bérczi-Kovács, András Frank)
- Polynomial-Time Algorithm for the Regional SRLG-disjoint Paths Problem (Balázs Vass, Erika Renáta Bérczi-Kovács, Ábel Barabás, Zsombor László Hajdú, János Tapolcai)
- Polynomially tractable cases in the popular roommates problem (Erika Renáta Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila Edmund Mályusz)
- A dual approach for dynamic pricing in multi-demand markets (Kristóf Bérczi, Erika Renáta Bérczi-Kovács, Evelin Szögi)
- Envy-free Relaxations for Goods, Chores, and Mixed Items (Kristóf Bérczi, Erika Renáta Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino)
- The complexity of the Clar number problem and an FPT algorithm (Erika Renáta Bérczi-Kovács, Attila Bernáth)
- Graph independent field size bounds on failure protecting network codes (Erika Renáta Bérczi-Kovács)
- Splitting property via shadow systems (Kristóf Bérczi, Péter Csikvári, Erika Renáta Bérczi-Kovács, László Végh)
- Algorithms for multiplayer multicommodity flow problems (Attila Bernáth, Tamás Király, Erika Renáta Bérczi-Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László Végh)
- Network Coding Algorithms with Predetermined Coding Coefficients and Applications for Wireless Networks (Zoltán Király, Erika Renáta Bérczi-Kovács)
- A Note On Strongly Edge-Disjoint Arborescences (Kristóf Bérczi, Erika Renáta Bérczi-Kovács)
- Multi-Layered Video Broadcast using Network Coding and a Distributed Connectivity Algorithm (Zoltán Király, Erika Renáta Bérczi-Kovács)
- Constructive Characterization Theorems in Combinatorial Optimization (Erika Renáta Bérczi-Kovács, László Végh)
- The constructive characterization of (k,l)-edge-connected digraphs (Erika Renáta Bérczi-Kovács, László Végh)
List of EGRES quick proofs
Last modification: 21.3.2024. Please email your comments to Tamás Király!
|