Dalila B.M.M. Fontes

Papers

Total Citations

H-Index

About

Dalila B.M.M. Fontes is a distinguished researcher whose work bridges combinatorial optimization, network design, and multi-agent systems. Her most impactful contributions center on the **maximum edge weight clique problem (MEWC)**—a challenging generalization of the classic maximum clique problem with critical applications in broadband network design, computer vision, and pattern recognition. In her highly cited 2017 paper (13 citations), Fontes developed novel formulations and solution approaches for MEWC, establishing a foundational framework for tackling this NP-hard problem. She further advanced the field with an evolutionary approach in 2018 (9 citations), demonstrating how metaheuristics can efficiently solve large-scale instances. Beyond clique problems, Fontes has explored optimal formation reorganization for nonholonomic mobile robots, combining shortest-path planning with multi-agent coordination. Her work on switching formations of indistinguishable agents (2018) integrates results from optimal control and robotics, showcasing her versatility across theoretical optimization and practical autonomous systems. With a growing citation impact, Fontes continues to shape research in discrete optimization and intelligent systems, offering powerful tools for both algorithm designers and practitioners in telecommunications and robotics.