Max Robotics — Global Service Robot Directory + US Certification

About

Basma Mohamed is a rising researcher in the field of graph theory and combinatorial optimization, with a sharp focus on the metric dimension problem—a fundamental concept with direct applications in robot navigation, network verification, and geographical routing. Her work addresses the challenge of determining the minimum number of landmarks (or resolving sets) needed to uniquely identify every vertex in a graph, a problem that is NP-hard in general. Mohamed has made significant contributions by solving this problem for specific graph families, including cyclic networks, subdivisions of the Lilly graph, tadpole graphs, and special trees, as well as ladder graphs. Her 2023 paper on domination and secure resolving sets in cyclic networks has already garnered 17 citations, while her work on the metric dimension of graph subdivisions has earned 15 citations. She has also authored a comprehensive survey on the metric dimension problem and its variants, reflecting her deep expertise and ability to synthesize complex literature. Additionally, Mohamed has developed hybrid optimization algorithms to tackle the metric dimension problem, showcasing her skill in combining theoretical insight with computational methods. Her research is foundational for advancing autonomous systems and network design.