Development and Performance Evaluation of Fast Combinatorial Unranking Implementations. - András Majdán; Gábor Rétvári; János Tapolcai (EUNICE, 2014)

Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond. - Gábor Rétvári; János Tapolcai; Attila Korösi; András Majdán; Zalán Heszberger (IEEE/ACM Trans. Netw., 2016)

Making the Data Plane Ready for NFV: An Effective Way of Handling Resources. - Marton Szabo; András Majdán; Gergely Pongrácz; László Toka; Balázs Sonkoly (SIGCOMM Posters and Demos, 2017)

FERO: Fast and Efficient Resource Orchestrator for a Data Plane Built on Docker and DPDK. - Balázs Sonkoly; Marton Szabo; Balázs Németh 001; András Majdán; Gergely Pongrácz; László Toka (INFOCOM, 2018)

Analysis of Routing Entropy in Hyperbolic Trees. - Zalán Heszberger; András Majdán; András Gulyás; András Biró; László Balázs; József Bíró (CSCI, 2021)

Navigable Architectures for Complex Communication Networks. - András Majdán; Lejla Pasic; Zalán Heszberger; Rolland Vida; József Bíró (VCC, 2024)

A Distributed and Self-Organizing Attack Model in Hyperbolically Embedded Networks. - András Majdán; Lejla Pasic; Dániel Ficzere; Gergely Hollósi; József Bíró (NetSoft, 2025)

IoT Connectivity Management by Hyperbolic Trees. - András Majdán; Lejla Pasic; Dániel Ficzere; Gergely Hollósi; Zalán Heszberger; Rolland Vida; József Bíró (NOMS, 2025)