Nabil Mustafa received his Ph.D. in Computer Science from Duke University in 2004, and then did 2-year postdoctoral research work at Max-Planck Institute in Germany before joining LUMS in fall 2006.
His research interests are broadly in theoretical computer science. In the past, he has worked on algorithms using graphics hardware, geometric algorithms for combinatorial problems, graph algorithms, and fast shape-matching algorithms in computational biology. Recently his work has been in combinatorial geometry, specifically on various problems in geometric hitting sets.
Mustafa, N., and Ray, S., In Proceedings of the 23rd ACM Symposium on Computational Geometry, 138-141, Gyeongju, South Korea, June 6-8, 2007.
Mustafa, N., and Ray, S., In Proceedings of the 23rd ACM Symposium on Computational Geometry, 239-244, Gyeongju, South Korea, June 6-8, 2007.
Agarwal, P., Mustafa, N., and Wang, Y., In Journal of Computational Biology, 14 (2):131-43, March 2007. Impact Factor: 2.38.
Krishnan, S., Mustafa, N., and Venkatasubramanian, S., In Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science) (Hardcover), American Mathematical Society, November 21, 2006. ISBN-10: 0821835963
| Discrete Mathematics II | Spring 2007-08 |
| Discrete Mathematics I | Winter 2007-08 |
| Computational Geometry | Summer 2004-05 |
| Randomised Algorithms | Winter 2006-07,Summer 2004-05 |
| Computability and Complexity | Spring 2007-08, Spring 2006-07, Spring 2006-07 |
| Advanced Topics in Combinatorial Geometry | Autumn 2007-08,Winter 2006-07 |
| Discrete Mathematics | Autumn 2006-07 |