Mohammad T. Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science in the Department of Computer Science.
In addition, he holds a research affiliate position in the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) and is a permanent member of the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University.
Hajiaghayi's research interests are algorithmic game theory and combinatorial auctions, network design, combinatorial optimizations and approximation algorithms, fixed-parameter algorithms, algorithmic graph theory, distributed and mobile computing, and computational geometry and embeddings. He has published more than 110 papers in top conferences and journals of computer science, won a few best paper awards, and served in program committees or editorial boards of several well-known international conferences and journals.
Hajiaghayi received a National Science Foundation (NSF) CAREER Award in 2010, a Google Faculty Research Award in 2010, an ONR Young Investigator Award in 2011, and the University of Maryland Research and Scholarship Award (RASA) in 2011. He won best paper awards at the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2010, the International Symposium on Algorithms and Computation (ISAAC) 2006, and the Robocup 2001 Conference.
Before joining the University of Maryland, he was a senior researcher in the Algorithms and Theoretical Computer Science group at AT&T Labs, and still serves as a research consultant.
Prior to that, Hajiaghayi was a one-year postdoctoral fellow in the School of Computer Science at Carnegie Mellon University (with the ALADDIN project) and a one-year postdoctoral associate at MIT CSAIL, where he also earned his doctorate in applied mathematics in 2005. While earning his doctorate, he also spent some time at IBM Research centers and Microsoft Research centers.
Hajiaghayi received his M.Sc. in computer science from the University of Waterloo in 2001 and his B.Sc. in computer engineering from Sharif University of Technology in 2000.
2010. Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Transactions on Networking (TON). 18(1):216-228.
2010. Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. SIAM Journal on Computing. 39(5):1772-1798.
2009. Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.
2009. Scheduling to minimize staleness and stretch in real-time data warehouses. Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures. :29-38.
2009. Network-aware forward caching. Proceedings of the 18th international conference on World wide web. :291-300.
2009. Hat guessing games. SIAM review. 51(2):399-413.
2007. Scheduling to minimize gaps and power consumption. Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. :46-54.
2007. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Transactions on Networking (TON). 15(6):1345-1358.
2007. Oblivious routing on node-capacitated and directed graphs. ACM Transactions on Algorithms (TALG). 3(4):51–es-51–es.
2007. Cell breathing in wireless LANs: Algorithms and evaluation. IEEE Transactions on Mobile Computing. 6(2):164-178.
2006. The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :631-640.
2006. Improved lower and upper bounds for universal TSP in planar metrics. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :649-658.
2006. Combination can be hard: Approximability of the unique coverage problem. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :162-171.
2006. Oblivious network design. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :970-979.
2006. New lower bounds for oblivious routing in undirected graphs. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :918-927.
2005. Online auctions with re-usable goods. Proceedings of the 6th ACM conference on Electronic commerce. :165-174.
2005. Algorithmic graph minor theory: Decomposition, approximation, and coloring. Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :637-646.
2004. Adaptive limited-supply online auctions. Proceedings of the 5th ACM Conference on Electronic Commerce. :71-80.
2004. Bidimensional Parameters and Local Treewidth. Latin 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004: Proceedings. :109-109.
2004. Low-dimensional embedding with extra information. Proceedings of the twentieth annual symposium on Computational geometry. :320-329.
2003. Random MAX SAT, random MAX CUT, and their phase transitions. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. :364-373.
2002. Exponential speedup of fixed-parameter algorithms on K 3, 3-minor-free or K 5-minor-free graphs. Algorithms and Computation. :277-287.