LUMS Home

Nabil Mustafa

Assistant Professor
Ph.D. Duke University 2004
Algorithms, Computational Geometry, Graphics and Visualization, Discrete and Combinatorial Geometry
Email: nabil [at] lums dot edu dot pk
Extension: 4411

Bio-Sketch


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.


Research Interests


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.



Recent Publications of Nabil Mustafa

  • An Optimal Generalization of the Centerpoint Theorem, and its Extensions

    Mustafa, N., and Ray, S., In Proceedings of the 23rd ACM Symposium on Computational Geometry, 138-141, Gyeongju, South Korea, June 6-8, 2007.

  • Weak Epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension

    Mustafa, N., and Ray, S., In Proceedings of the 23rd ACM Symposium on Computational Geometry, 239-244, Gyeongju, South Korea, June 6-8, 2007.

  • Fast Molecular Shape Matching using Contact Maps

    Agarwal, P., Mustafa, N., and Wang, Y., In Journal of Computational Biology, 14 (2):131-43, March 2007. Impact Factor: 2.38.

  • Statistical Data Depth and the Graphics Hardware

    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