Mustaq Ahmed

My primary research interest is Algorithms and Data Structures, particularly for constrained optimization problems in graphs and in Computational Geometry. My recent research is mostly on constrained shortest paths in terrains and graphs.

Google Publications

  •  

    Shortest paths avoiding forbidden subpaths

    Mustaq Ahmed, Anna Lubiw

    Networks (2012) (to appear)

  •   

    On the number of shortest descending paths on the surface of a convex terrain

    Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy

    Journal of Discrete Algorithms, vol. 9(2) (2011), pp. 182-189

  •   

    Shortest descending paths: Towards an exact algorithm

    Mustaq Ahmed, Anna Lubiw

    International J. Computational Geometry and Applications, vol. 21(4) (2011), pp. 431-466

Previous Publications

  •  

    On the number of shortest descent paths on the surface of a convex terrain

    Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy

    Journal of Discrete Algorithms, vol. 9, no. 2 (2011), pp. 182-189

  •   

    Approximation algorithms for shortest descending paths in terrains

    Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy

    J. Discrete Alg., vol. 8 (2010), pp. 214-230

  •   

    Constrained shortest paths in terrains and graphs

    Mustaq Ahmed

    Ph.D. Thesis, University of Waterloo (2009)

  •   

    Ordered interval routing schemes

    Mustaq Ahmed

    J. Discrete Alg., vol. 7 (2009), pp. 363-376

  •   

    Shortest descending paths through given faces

    Mustaq Ahmed, Anna Lubiw

    Comput. Geom. Theory Appl., vol. 42 (2009), pp. 464-470

  •   

    Shortest gently descending paths

    Mustaq Ahmed, Anna Lubiw, Anil Maheshwari

    Proceedings of the Third Annual Workshop on Algorithms and Computation (WALCOM), Springer-Verlag (2009), pp. 59-70

  •   

    Shortest paths avoiding forbidden subpaths

    Mustaq Ahmed, Anna Lubiw

    Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS) (2009), pp. 63-74

  •  

    Shortest paths avoiding forbidden subpaths

    Mustaq Ahmed, Anna Lubiw

    STACS 2009, pp. 63-74

  •  

    Approximation algorithms for shortest descending paths in terrains

    Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy

    CoRR, vol. 0805.1401v1 [cs.CG] (2008)

  •  

    Shortest anisotropic paths with few bends is NP-complete

    Mustaq Ahmed, Anna Lubiw

    The 18th Fall Workshop on Computational Geometry (FWCG): Abstracts, Rensselaer Polytechnic Institute, Troy, New York (2008), pp. 28-29

  •  

    Shortest paths avoiding forbidden subpaths

    Mustaq Ahmed, Anna Lubiw

    CoRR, vol. 0807.0807v1 [cs.DM] (2008)

  •  

    An approximation algorithm for shortest descending paths

    Mustaq Ahmed, Anna Lubiw

    CoRR, vol. 0705.1364v1 [cs.CG] (2007)

  •  

    Shortest descending paths through given faces

    Mustaq Ahmed, Anna Lubiw

    Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG) (2006), pp. 35-38

  •  

    A new exact string matching algorithm

    Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury

    International Journal of Computer Mathematics, vol. 80 (2003), pp. 825-834

  •  

    Cryptosystems using Huffman coding techniques

    Sawsan Eskander, Mustaq Ahmed, M. Kaykobad

    Proceedings of International Conference on Computer and Information Technology (ICCIT) (2001), pp. 278-282

  •  

    On partitioning of consecutive integers

    Mustaq Ahmed, Rezaul Alam Chowdhury, M. Kaykobad

    Proceedings of International Conference on Electrical and Computer Engineering (ICECE) (2001), pp. 297-299

  •  

    A new exact string matching algorithm

    Rezaul Alam Chowdhury, Mustaq Ahmed, M. Kaykobad

    Proceedings of International Conference on Computer and Information Technology (ICCIT) (1999), pp. 187-192

  •  

    Algorithms for solving systems of linear equations

    Suman Kumar Nath, Rezaul Alam Chowdhury, Mustaq Ahmed, M. Kaykobad

    Proceedings of International Conference on Computer and Information Technology (ICCIT) (1999), pp. 33-36