Muhammad Ahsan Asim

Muhammad Ahsan Asim is an Associate Teaching Professor in the Department of Computer Science and Electrical Engineering at the University of Missouri–Kansas City (UMKC), School of Science and Engineering. He is actively engaged in research and teaching, with a focus on theoretical and applied aspects of graph algorithms and discrete mathematics.

• Ph.D. in Mathematical Sciences, University Malaysia Terengganu (UMT), 2018
• MS in Computer Science, Blekinge Institute of Technology (BTH), Sweden, 2008

His primary research interests lie in Graph Theory and Algorithms, Computational Complexity Theory, Combinatorial Optimization, and Experimental Mathematics. He applies algorithmic techniques to problems in graph labeling, topological indices, and resolvability, with applications in computer networks, digital circuits, and data science. His recent work emphasizes algorithmic solutions to complex labeling problems in structured graphs such as grid graphs, trees, and networks.

The analysis of his 15 most recent publications reveals a consistent focus on graph labeling, particularly edge irregularity, total labeling, and resolving sets. These works span both theoretical developments and algorithmic implementations, often applied to chemical graphs, network topologies, and discrete structures. The keywords across these articles include Graph Theory, Discrete Mathematics, Combinatorics, and Theoretical Computer Science, with subfields ranging from metal-organic networks to circulant graphs and benzenoid structures.

He has no listed scientific awards in the provided text.

Muhammad Ahsan Asim advises and collaborates with several researchers and students, including Muhammad Shahzad, Wajdi Alghamdi, and Sadia Husain. His work is often supported through collaborative research grants, particularly in the domain of graph-theoretic applications in computing and chemistry. He is associated with Roslan Hasni's Lab, indicating active participation in a research team focused on algorithmic graph theory and its applications.

He is involved in advanced computational research, particularly in applying algorithmic methods to solve labeling problems that are intractable via manual computation. His lab work includes modeling network structures, analyzing topological descriptors, and developing iterative algorithms for graph strength computation.