معرفی
Alan Kuhnle is an Assistant Professor in the Department of Computer Science & Engineering at Texas A&M University, part of the College of Engineering. His research focuses on algorithms and theory, machine learning, data science, and combinatorial optimization with applications to submodular maximization, network analysis, and algorithmic optimization. Kuhnle holds a Ph.D. in Computer Science from the University of Florida (2018), an M.S. in Mathematics (2013) from the same institution, and a B.S. in Mathematics from Florida State University (2010).
His work emphasizes practical and theoretically grounded algorithms for discrete optimization, particularly in submodular function maximization. He has contributed scalable solutions for non-monotone submodular maximization, parallel optimization frameworks, and efficient algorithms for large-scale combinatorial problems. Recent research explores adaptive complexity models, distributed computing paradigms (e.g., MapReduce), and benchmarking learned heuristics for combinatorial optimization.
Kuhnle’s publications span submodular maximization techniques, streaming algorithms, and applications in bioinformatics (e.g., de Bruijn graphs, pan-genomics). His work bridges theoretical guarantees with real-world scalability, addressing challenges in parallel computing, dynamic data structures, and network resilience. Notable contributions include the ResQue Greedy algorithm, DASH distributed framework, and RELS-DQN reinforcement learning-based heuristic for combinatorial optimization.
- Awards: Office of Naval Research Summer Faculty Research Fellow (2022), Best Runner-Up Paper at ASONAM 2018
- Labs/Teams: Active in Texas A&M’s CSE department research groups focused on algorithms and optimization
His research also addresses network vulnerability assessment, interdependency analysis, and misinformation containment in social networks. Kuhnle’s algorithms are designed for billion-scale networks, emphasizing linear-time and nearly linear-time computational efficiency.
