MALEQ KHAN

Contact Information

Address: Department of Electrical Engineering and Computer Science
Texas A&M University-Kingsville
700 University Blvd., Kingsville, TX 78363
Phone: (361)593-3304
Email: first_name dot last_name at tamuk.edu
Home page: www.maleqkhan.net

Research Interest

Big data analytics
Graph analytics
High performance computing
Parallel and distributed algorithms
Randomized algorithms
Data mining

Education

Awards

Professional Service

Publications

    Journal Papers

  1. Finding and Counting Subgraphs Using MapReduce
    Zhao Zhao, Chen Langshi, Mihai Avram, Meng Li, Guanying Wang, Ali Butt, Maleq Khan, Madhav Marathe, Judy Qiu, and V.S. Anil Kumar
    IEEE Transactions on Multi-Scale Computing Systems, to appear.
  2. Parallel Algorithms for Switching Edges in Heterogeneous Graphs
    Hasanuzzaman Bhuiyan, Maleq Khan, Jiangzhuo Chen, and Madhav Marathe
    Journal of Parallel and Distributed Computing, Vol. 104, Pages 19-35, June 2017.
  3. Parallel Algorithms for Generating Random Networks with Given Degree Sequences
    Maksudul Alam and Maleq Khan
    International Journal of Parallel Programming, Vol. 45, No. 1, Pages 109-127, Feb 2017.
  4. Effect of Modeling Slum Populations on Influenza Spread in Delhi
    Jiangzhuo Chen, Shuyu Chu, Youngyun Chungbaek, Maleq Khan, Christopher Kuhlman, Achla Marathe, Henning Mortveit, Anil Vullikanti, Dawen Xie
    BMJ Open, Vol. 6, No. 9, Sep. 2016.
  5. Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs
    Lawrence B. Holder, Maleq Khan, Christine Klymko, Rajmonda Caceres, Nitesh V. Chawla, Tina Eliassi-Rad, David F. Gleich, Ravi Kumar, Aditya Prakash, Jason Riedy, Yinghui Wu
    SIGKDD Explorations, Vol. 18, No. 1, June 2016.
  6. Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings
    Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, and Kunal Talwar.
    Distributed Computing, Vol. 25, No. 3, Pages 189-205, June 2012.
  7. Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
    Yongwook Choi, Maleq Khan, Anil Kumar, and Gopal Pandurangan.
    Journal of Selected Areas in Communications, Vol. 27, No. 7, Pages 1297-1304, Sep 2009.
  8. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
    Maleq Khan, Gopal Pandurangan, and Anil Kumar.
    IEEE Transactions on Parallel and Distributed Systems, Pages 124-139, Vol. 20, No. 1, Jan 2009.
  9. A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
    Maleq Khan and Gopal Pandurangan.
    Distributed Computing. Pages 391-402, Vol. 20, No. 6, Apr 2008.
  10. A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms
    Maleq Khan, Gopal Pandurangan, and Anil Kumar.
    Theoretical Computer Science, Pages 101-114, Vol. 385, No. 1-3, Oct. 2007.
  11. An Efficient Weighted Nearest Neighbor Classifier using Vertical Data Representation
    William Perrizo, Qin Ding, Maleq Khan, Anne Denton, and Qiang Ding.
    International Journal of Business Intelligence and Data Mining, Vol. 2, No. 1, 2007.
  12. Multimedia Data Transmission and Control using Active Networks
    Bharat Bhargava, Sheng-Yih Wang, Maleq Khan and Ahsan Habib.
    Journal of Computer Communications. Vol. 28, No. 6, Apr. 2005.
  13. Edge-to-Edge Measurement-Based Distributed Network Monitoring
    Ahsan Habib, Maleq Khan, and Bharat Bhargava.
    Journal of Computer Networks, Vol. 44, No. 2, Feb. 2004.

    Conference Papers

  14. A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence
    Hasanuzzaman Bhuiyan, Maleq Khan, and Madhav Marathe
    Fourth Workshop on High Performance Big Graph Data Management, Analysis, and Mining (BigGraphs), in conjunction with the IEEE International Conference on Big Data (IEEE BigData), Boston, MA, Dec. 2017.
  15. Efficient Algorithms for Assortative Edge Switch in Large Labeled Networks
    Hasanuzzaman Bhuiyan, Maleq Khan, and Madhav Marathe
    25th High Performance Computing Symposium (HPC), Virginia Beach, VA, USA, April, 2017. Best Paper Award Runner-up.
  16. An Efficient and Scalable Algorithmic Method for Generating Large-Scale Random Graphs
    Maksudul Alam, Maleq Khan, Anil Vullikanti, and Madhav Marathe
    Intl. Conf. for High Performance Computing, Networking, Storage and Analysis (SC16), Salt Lake City, Nov. 2016. Best Paper Award finalist.
  17. An integrated agent-based approach for modeling disease spread in large populations to support health informatics
    Keith Bissett, Jose Cadena, Maleq Khan, Chris J. Kuhlman, Bryan Lewis, and Pyrros A. Telionis
    IEEE International Conference on Biomedical and Health Informatics (BHI), Las Vegas, 2016.
  18. A Fast Parallel Algorithm for Counting Triangles in Graphs using Dynamic Load Balancing
    Shaikh Arifuzzaman, Maleq Khan and Madhav Marathe
    Second Workshop on High Performance Big Graph Data Management, Analysis, and Mining (BigGraphs), in conjunction with the IEEE International Conference on Big Data (IEEE BigData), Santa Clara, CA, Oct. 2015.
  19. Parallel Algorithms for Generating Random Networks with Given Degree Sequences
    Maksudul Alam and Maleq Khan
    12th IFIP International Conference on Network and Parallel Computing (NPC), New York City, Sep. 2015.
  20. A Space-efficient Parallel Algorithm for Counting Exact Triangles in Massive Networks
    Shaikh Arifuzzaman, Maleq Khan and Madhav Marathe
    17th IEEE International Conference on High Performance Computing and Communications (HPCC), New York City, Aug. 2015.
  21. Fast Parallel Conversion of Edge List to Adjacency List for Large-Scale Graphs
    Shaikh Arifuzzaman and Maleq Khan
    23rd High Performance Computing Symposium (HPC), Alexandria, VA, USA, April 2015.
  22. CINET 2.0: A Cyberinfstructure for Network Science
    Sherif Abdelhamid, Maksudul Alam, Richard Alo, ..., Maleq Khan, ..., Anil Vullikanti and Tak-Lon Wu
    10th IEEE International Conference on eScience, Guaruja, Brazil, Oct. 2014.
  23. Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs
    Hasanuzzaman Bhuiyan, Jiangzhuo Chen, Maleq Khan, and Madhav V. Marathe
    International Conference on Parallel Processing (ICPP), Minneapolis, Sep. 2014.
  24. Distributed-Memory Parallel Algorithms for Generating Massive Scale-free Networks Using Preferential Attachment Model
    Maksudul Alam, Maleq Khan, and Madhav V. Marathe
    Intl. Conf. for High Performance Computing, Networking, Storage and Analysis (SC13), Denver, Nov. 2013.
  25. PATRIC: A Parallel Algorithm for Counting Triangles in Massive Networks
    Shaikh Arifuzzaman, Maleq Khan, and Madhav V. Marathe
    ACM Conference on Information and Knowledge Management (CIKM), San Francisco, Oct. 2013.
  26. A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
    Maleq Khan, Gopal Pandurangan, Guanhong Pei and V.S. Anil Kumar
    26th International Symposium on Distributed Computing (DISC), Salvador, Brazil, Oct. 2012.
  27. CINET: A Cyberinfstructure for Network Science
    Sherif Abdelhamid, Richard Alo, S M Arifuzzaman, ..., Maleq Khan, ..., Anil Vullikanti and Zhao Zhao.
    8th IEEE International Conference on eScience, Chicago, Oct. 2012.
  28. SAHAD: Subgraph Analysis in Massive Networks Using Hadoop
    Zhao Zhao, Guanying Wang, Ali Butt, Maleq Khan, V.S. Anil Kumar, and Madhav Marathe.
    26th IEEE International Parallel & Distributed Processing Symposium (IPDPS), Shanghai, China, May 2012.
  29. On Minimizing Average End-to-End Delay in P2P Live Streaming Systems
    Fei Huang, Maleq Khan, and Binoy Ravindran.
    14th International Conference On Principles Of Distributed Systems (OPODIS), Tozeur, Tunisia, Dec. 2010.
  30. NAP: An Agent-based Scheme on Reducing Churn-Induced Delays for P2P Live Streaming
    Fei Huang, Binoy Ravindran, and Maleq Khan.
    The IEEE International Conference on Peer-to-Peer Computing (P2P), Delft, Netherlands, Aug. 2010.
  31. Subgraph Enumeration in Large Social Contact Networks using Parallel Color Coding and Streaming
    Zhao Zhao, Maleq Khan, V.S. Anil Kumar and Madhav V. Marathe.
    39th International Conference on Parallel Processing (ICPP), San Diego, California, Sep. 2010.
  32. The Effect of Demographic and Spatial Variability on Epidemics: A Comparison between Beijing, Delhi, and Los Angeles.
    Jiangzhuo Chen, Fei Huang, Maleq Khan, Madhav Marathe, Paula Stretz, and Huadong Xia.
    Fifth International Conference on Critical Infrastructures, Beijing, Sep. 2010.
  33. A Study of Information Diffusion over a Realistic Social Network Model
    Andrea Apolloni, Karthik Channakeshava, Lisa Durbeck, Maleq Khan, Chris Kuhlman, Bryan Lewis, and Samarth Swarup.
    International Symposium on Social Computing Applications, Vancouver, Canada, Aug. 2009.
  34. Generation and Analysis of Large Synthetic Social Contact Networks
    Christopher Barrett, Richard Beckman, Maleq Khan, V.S. Anil Kumar, Madhav Marathe, Paula Stretz, Tridib Dutta, and Bryan Lewis.
    Winter Simulation Conference (WSC), Austin, Texas, Dec. 2009.
  35. Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad hoc Networks
    Maleq Khan, V.S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, and S.S. Ravi.
    28th Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, Apr. 2009.
  36. Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings.
    Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, and Kunal Talwar.
    27th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Canada, Aug. 2008.
  37. Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.
    Yongwook Choi, Maleq Khan, Anil Kumar, and Gopal Pandurangan.
    20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, Jun. 2008.
  38. A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
    Maleq Khan and Gopal Pandurangan.
    20th International Symposium on Distributed Computing (DISC), Sep. 2006, Stockholm, Sweden. Best Paper Award.
  39. PINE - Podium Incremental Neighbor Evaluator for Classifying Spatial Data
    William Perrizo, Qin Ding, Anne Denton, Kirk Scott, Qiang Ding, and Maleq Khan.
    ACM Symposium on Applied Computing (ACM-SAC), Melbourne, FL, USA, March 2003.
  40. Fast k-Nearest Neighbor Classification on Spatial Data Streams Using P-trees
    Maleq Khan, Qin Ding, and William Perrizo.
    6th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Taipei, Taiwan, May 2002.
  41. The P-tree Algebra
    Qin Ding, Maleq Khan, Amalendu Roy and William Perrizo.
    ACM Symposium on Applied Computing (ACM-SAC), Madrid, Spain, March 2002.

    Book Chapters

  42. Distributed Memory Parallel Algorithms for Massive Graphs
    Maksudul Alam, Shaikh Arifuzzaman, Hasanuzzaman Bhuiyan, Maleq Khan, V.S. Anil Kumar, and Madhav Marathe
    Parallel Graph Algorithms, CRC Press / Taylor & Francis
    Ed. David Bader
  43. Algorithms for Finding Motifs in Large Labeled Networks
    Maleq Khan, V.S. Anil Kumar, Madhav Marathe, and Zhao Zhao
    Dynamics On and Of Complex Networks, Volume 2, Springer, 2013.
    Eds. Animesh Mukherjee, Monojit Choudhury, Fernando Peruani, Niloy Ganguly, Bivas Mitra
  44. Social Networks
    Maleq Khan, V.S. Anil Kumar, Madhav Marathe, and Paula Stretz
    Encyclopedia of Parallel Computing, first edition, Springer, 2011.
    Ed. David Padua
  45. Theory of Communication Networks
    Gopal Pandurangan and Maleq Khan
    Algorithms and Theory of Computation Handbook, second edition, CRC Press, 2009. A best-selling book.
    Eds. Mikhail Atallah and Marina Blanton

    Posters (peer-reviewed)

  46. Synthetic Populations for Epidemic Modeling
    Abhijin Adiga, Richard Beckman, Keith Bisset, Jiangzhuo Chen, Youngyun Chungbaek, Stephen Eubank, Sandeep Gupta, Maleq Khan, Chris Kuhlman, Eric Lofgren, Bryan Lewis, Achla Marathe, Madhav Marathe, Henning Mortveit, Eric Nordberg, Caitlin Rivers, Paula Stretz, Samarth Swarup, Amanda Wilson and Dawen Xie.
    International Conference on Computational Social Science (IC2S2), Helsinki, Finland, Jun 2015.
  47. Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients.    (Extended abstract)
    S M Arifuzzaman, Maleq Khan, and Madhav Marathe
    Super Computing (SC), Salt Lake City, Nov. 2012.
  48. Parallel Color Coding and Graph Partitioning Enabling Subgraph Counting for Massive Graphs
    Zhao Zhao, Maleq Khan, V.S. Anil Kumar, and Madhav Marathe
    Super Computing (SC), New Orleans, Nov. 2010.
  49. Simulating Social Information Diffusion Using a Synthetic Population.     (Extended abstract)
    Andrea Apolloni, Karthik Channakeshava, Lisa Durbeck, Maleq Khan, Christopher Kuhlman, Bryan Lewis, and Samarth Swarup.
    NICO Complexity Conference, Northwestern University, Evanston, IL, Sep. 2009. Poster Winner.

    Dissertation and Theses

  50. Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Application to Wireless Ad Hoc Networks
    Maleq Khan.
    Ph.D. dissertation, Department of Computer Science, Purdue University, West Lafayette, Indiana, 2007.
  51. Fast Distance Metric Based Data Mining Techniques Using P-trees
    Maleq Khan.
    Masters thesis, Computer Science Department, North Dakota State University, Fargo, North Dakota, 2001.
  52. Performance Analysis of Multiprocessor Systems with Multilevel Cache
    Maleq Khan and Mahmud Hasan.
    Undergraduate thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, 1996.

Impact of My Research

My research articles have been cited at least 1090 times as of Nov 2017. The h-index and i10-index are 16 and 24, respectively. (source: Google Scholar)

Talks

  1. Scalable Parallel Computing of Massive-Scale Graph Analytics for Big Data
    invited talk, at the College of Engineering Dean’s Leadership Board Meeting, Texas A&M University--Kingsville, Oct. 2017.
  2. Efficient Parallel Algorithms for Generating Random Graphs
    invited talk, at The 1st Mid-South Theory Day, Louisiana State University, Baton Rouge, LA, Dec. 2016.
  3. An Efficient and Scalable Algorithmic Method for Generating Large-Scale Random Graphs
    at the Intl. Conf. for High Performance Computing, Networking, Storage and Analysis (SC16), Salt Lake City, Nov. 2016.
  4. Scalable Parallel Algorithms for Network Analysis Problems using HPC Systems
    invited talk, at the Department of Electrical Engineering and Computer Science, Texas A&M University--Kingsville, May 2016.
  5. How to Use CINET: A Cyberinfrastructure for Network Science
    invited talk, at a workshop on the CINET system at the University at Albany - SUNY, Albany, Aug. 2015.
  6. Parallel Graph Algorithms: Challenges and Approaches
    Invited talk, at the Department of Computer Science, University at Albany - SUNY, Albany, Aug. 2015.
  7. How to Use CINET: A Cyberinfrastructure for Network Science
    invited talk, at a workshop on the CINET system at Virginia Tech, Blacksburg, VA, July 2015.
  8. Demonstration of CINET: A Cyberinfrastructure for Network Science
    At the 2nd Workshop on Mining Networks and Graphs, in conjunction with SIAM International Conference on Data Mining (SDM), Vancouver, Canada, May 2015.
  9. Parallel Graph Algorithms: Challenges and Approaches
    Invited talk, at NDSSL weekly seminar, Virginia Bioinformatics Institute, Virginia Tech, Feb. 2015.
  10. Parallel Graph Algorithms: Challenges and Approaches with Practical Considerations
    Invited talk, At NII Shonan Meeting on Algorithms for Large-Scale Graphs, Shonan Village Center, Hayama, Kanagawa, Japan, Oct. 2014.
  11. Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs
    At the International Conference on Parallel Processing (ICPP), Minneapolis, Sep. 2014.
  12. A Parallel Algorithm for Counting Triangles in Massive Networks
    At the ACM Conference on Information and Knowledge Management (CIKM), San Francisco, Oct. 2013.
  13. Experiences and lessons learned in critical infrastructure decision informatics
    Invited talk, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh, July 2011.
  14. Experiences and lessons learned in critical infrastructure decision informatics
    At NetONets (satellite to NetSci 2011), Budapest, Hungary, June 2011
  15. Subgraph Enumeration in Large Social Contact Networks using Parallel Color Coding and Streaming
    At the 39th International Conference on Parallel Processing (ICPP), San Diego, California, Sep. 2010.
  16. A Study of Information Diffusion over a Realistic Social Network Model
    At the International Symposium on Social Computing Applications, Vancouver, Canada, Aug. 2009.
  17. Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings
    At the 27th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Canada, Aug. 2008.
  18. Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems
    Invited talk, Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, Virginia, July 2007.
  19. A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
    At the 20th International Symposium on Distributed Computing (DISC), Stockholm, Sweden, Sep 2006.
  20. Local Distributed Algorithms via Nearest Neighbor Tree
    Invited talk, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh, Jan 2005.
  21. How to Learn Math and Science
    Invited talk, for high-school students at a high school in Bangladesh, Jan 2005.
  22. Local Distributed Algorithms via Nearest Neighbor Tree
    Invited talk, at the 49th Midwest Theory Day, DePaul University, Chicago, Dec 2004.
  23. Energy-Efficient Local Distributed Algorithms for Wireless Ad Hoc Networks
    Invited talk, as a guest lecturer for the graduate course CS 690B: Pervasive Systems", Fall 2004, Purdue University.
  24. Fast k-Nearest Neighbor Classification on Spatial Data Streams Using P-trees
    At the 6th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Taipei, Taiwan, May 2002.
  25. Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Applications to Wireless Ad Hoc Networks
    PhD dissertation defense, Purdue University, Apr. 2007.
  26. Energy-Efficient Local Distributed Algorithms for Wireless Ad Hoc Networks
    PhD preliminary examination, Purdue University, July 2004.
  27. Work-Efficient Distributed Algorithms
    as a part of PhD qualifying examination, Purdue University, Jan. 2004.
  28. Fast Distance Metric Based Data Mining Techniques Using P-trees
    MS thesis defense, North Dakota State University, Dec. 2001.

Teaching

  1. Data Mining, Texas A&M University - Kingsville, Fall 2017
  2. Computer Networks, Texas A&M University - Kingsville, Fall 2017
  3. Massive Parallel Algorithms, Texas A&M University - Kingsville, Spring 2017
  4. Data Structures and Algorithms, Texas A&M University - Kingsville, Spring 2017
  5. Data Mining, Texas A&M University - Kingsville, Fall 2016
  6. Computer Networks, Texas A&M University - Kingsville, Fall 2016
  7. Network Science, July - Oct. 2009, an informal course on network science for the graduate students of Network Dynamics and Simulation Science Laboratory at Virginia Tech. The classes were taught by multiple faculty members including few postdocs. I planned the topics, coordinated the lectures and course materials, and taught some classes.
  8. Introduction to Organizational Computing, Purdue University, Summer 2005
  9. Teaching assistant for graduate course Algorithm Design, Analysis, and Implementation, Purdue University, Fall 2004
  10. Introduction to Programming, American International University Bangladesh, Fall 1998
  11. Discrete Mathematics, American International University Bangladesh, Fall 1998
  12. Structural Programming, East West University, Bangladesh, Summer 1998
  13. Discrete Mathematics, East West University, Bangladesh, Summer 1998
  14. Programming with C and C++, East West University, Bangladesh, Spring 1998
  15. Mathematics for Computer Science, East West University, Bangladesh, Spring 1997
  16. Structural Programming, East West University, Bangladesh, Fall 1997
  17. Discrete Mathematics, East West University, Bangladesh, Fall 1997
  18. Mathematics for Computer Science, East West University, Bangladesh, Summer 1997

Professional Experience

Recent Major Software Projects