default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaleq Khan
Person information
- affiliation: Virginia Tech, Blacksburg, Virginia, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Sharon Boddu, Maleq Khan:
ALZI: An Improved Parallel Algorithm for Finding Connected Components in Large Graphs. Euro-Par (3) 2024: 134-147- 2022
- [p1]Md. Maksudul Alam, Shaikh Arifuzzaman, Md Hasanuzzaman Bhuiyan, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe:
Distributed Memory Parallel Algorithms for Massive Graphs. Massive Graph Analytics 2022: 85-107 - 2020
- [j14]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs. ACM Trans. Knowl. Discov. Data 14(1): 5:1-5:34 (2020) - [j13]Md. Maksudul Alam, Maleq Khan, Kalyan S. Perumalla
, Madhav V. Marathe:
Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model. ACM Trans. Parallel Comput. 7(2): 13:1-13:35 (2020) - [c31]Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang:
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. ALENEX 2020: 81-93
2010 – 2019
- 2019
- [c30]Tasnimun Faika, Taesic Kim, Justin Ochoa, Maleq Khan, Sung-Won Park, Chung S. Leung:
A Blockchain-Based Internet of Things (IoT) Network for Security-Enhanced Wireless Battery Management Systems. IAS 2019: 1-6 - 2018
- [j12]Zhao Zhao, Langshi Chen, Mihai Avram, Meng Li, Guanying Wang, Ali Raza Butt, Maleq Khan, Madhav V. Marathe, Judy Qiu, Anil Vullikanti:
Finding and Counting Tree-Like Subgraphs Using MapReduce. IEEE Trans. Multi Scale Comput. Syst. 4(3): 217-230 (2018) - 2017
- [j11]Md. Maksudul Alam, Maleq Khan:
Parallel Algorithms for Generating Random Networks with Given Degree Sequences. Int. J. Parallel Program. 45(1): 109-127 (2017) - [j10]Md Hasanuzzaman Bhuiyan, Maleq Khan, Jiangzhuo Chen, Madhav V. Marathe:
Parallel algorithms for switching edges in heterogeneous graphs. J. Parallel Distributed Comput. 104: 19-35 (2017) - [c29]Md Hasanuzzaman Bhuiyan, Maleq Khan, Madhav V. Marathe:
A parallel algorithm for generating a random graph with a prescribed degree sequence. IEEE BigData 2017: 3312-3321 - [c28]Md Hasanuzzaman Bhuiyan, Maleq Khan, Madhav V. Marathe:
Efficient algorithms for assortative edge switch in large labeled networks. SpringSim (HPC) 2017: 2:1-2:12 - [i6]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs. CoRR abs/1706.05151 (2017) - [i5]Md Hasanuzzaman Bhuiyan, Maleq Khan, Madhav V. Marathe:
A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence. CoRR abs/1708.07290 (2017) - 2016
- [j9]Lawrence B. Holder, Rajmonda Sulo Caceres, David F. Gleich, E. Jason Riedy, Maleq Khan, Nitesh V. Chawla, Ravi Kumar, Yinghui Wu, Christine Klymko, Tina Eliassi-Rad, B. Aditya Prakash:
Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs. SIGKDD Explor. 18(1): 39-45 (2016) - [c27]Keith Bissett, Jose Cadena, Maleq Khan, Chris J. Kuhlman, Bryan L. Lewis, Pyrros A. Telionis:
An integrated agent-based approach for modeling disease spread in large populations to support health informatics. BHI 2016: 629-632 - [c26]Md. Maksudul Alam, Maleq Khan, Anil Vullikanti, Madhav V. Marathe:
An efficient and scalable algorithmic method for generating large: scale random graphs. SC 2016: 372-383 - [i4]Huijuan Shao, K. S. M. Tozammel Hossain, Hao Wu, Maleq Khan, Anil Vullikanti, B. Aditya Prakash, Madhav V. Marathe, Naren Ramakrishnan:
Forecasting the Flu: Designing Social Network Sensors for Epidemics. CoRR abs/1602.06866 (2016) - 2015
- [c25]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
A fast parallel algorithm for counting triangles in graphs using dynamic load balancing. IEEE BigData 2015: 1839-1847 - [c24]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
A Space-Efficient Parallel Algorithm for Counting Exact Triangles in Massive Networks. HPCC/CSS/ICESS 2015: 527-534 - [c23]Shaikh Arifuzzaman, Maleq Khan:
Fast parallel conversion of edge list to adjacency list for large-scale graphs. SpringSim (HPS) 2015: 17-24 - 2014
- [c22]Sherif Hanie El Meligy Abdelhamid, Md. Maksudul Alam, Richard A. Aló, Shaikh Arifuzzaman, Peter H. Beckman, Tirtha Bhattacharjee, Md Hasanuzzaman Bhuiyan, Keith R. Bisset, Stephen G. Eubank, Albert C. Esterline, Edward A. Fox, Geoffrey C. Fox, S. M. Shamimul Hasan, Harshal Hayatnagarkar, Maleq Khan, Chris J. Kuhlman, Madhav V. Marathe, Natarajan Meghanathan, Henning S. Mortveit, Judy Qiu, S. S. Ravi, Zalia Shams, Ongard Sirisaengtaksin, Samarth Swarup, Anil Kumar S. Vullikanti, Tak-Lon Wu:
CINET 2.0: A CyberInfrastructure for Network Science. eScience 2014: 324-331 - [c21]Md Hasanuzzaman Bhuiyan, Jiangzhuo Chen, Maleq Khan, Madhav V. Marathe:
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs. ICPP 2014: 60-69 - [i3]Md. Maksudul Alam, Maleq Khan:
Parallel Algorithm for Generating Massive Random Networks with a Given Sequence of Expected Degrees. CoRR abs/1406.1215 (2014) - [i2]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
Parallel Algorithms for Counting Triangles in Networks with Large Degrees. CoRR abs/1406.5687 (2014) - 2013
- [c20]Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe:
PATRIC: a parallel algorithm for counting triangles in massive networks. CIKM 2013: 529-538 - [c19]Md. Maksudul Alam, Maleq Khan, Madhav V. Marathe:
Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model. SC 2013: 91:1-91:12 - 2012
- [j8]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Comput. 25(3): 189-205 (2012) - [c18]Sherif Elmeligy Abdelhamid, Richard A. Aló, S. M. Arifuzzaman, Peter H. Beckman, Md Hasanuzzaman Bhuiyan, Keith R. Bisset, Edward A. Fox, Geoffrey Charles Fox, Kevin Hall, S. M. Shamimul Hasan, Anurodh Joshi, Maleq Khan, Chris J. Kuhlman, Spencer J. Lee, Jonathan Leidig, Hemanth Makkapati, Madhav V. Marathe, Henning S. Mortveit, Judy Qiu, S. S. Ravi, Zalia Shams, Ongard Sirisaengtaksin, Rajesh Subbiah, Samarth Swarup, Nick Trebon, Anil Vullikanti, Zhao Zhao:
CINET: A cyberinfrastructure for network science. eScience 2012: 1-8 - [c17]Zhao Zhao, Guanying Wang, Ali Raza Butt, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe:
SAHAD: Subgraph Analysis in Massive Networks Using Hadoop. IPDPS 2012: 390-401 - [c16]S. M. Arifuzzaman, Maleq Khan, Madhav V. Marathe:
Abstract: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients. SC Companion 2012: 1448-1449 - [c15]S. M. Arifuzzaman, Maleq Khan, Madhav V. Marathe:
Poster: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients. SC Companion 2012: 1450 - [c14]Maleq Khan, Gopal Pandurangan, Guanhong Pei, Anil Kumar S. Vullikanti:
Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. DISC 2012: 409-410 - [i1]Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan, Guanhong Pei:
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. CoRR abs/1206.1113 (2012) - 2011
- [r1]Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz:
Social Networks. Encyclopedia of Parallel Computing 2011: 1842-1848 - 2010
- [c13]Zhao Zhao, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe:
Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming. ICPP 2010: 594-603 - [c12]Fei Huang, Maleq Khan, Binoy Ravindran:
On Minimizing Average End-to-End Delay in P2P Live Streaming Systems. OPODIS 2010: 459-474 - [c11]Fei Huang, Binoy Ravindran, Maleq Khan:
NAP: An Agent-Based Scheme on Reducing Churn-Induced Delays for P2P Live Streaming. Peer-to-Peer Computing 2010: 1-10 - [c10]Stephen G. Eubank, Anil Vullikanti, Maleq Khan, Madhav V. Marathe, Christopher L. Barrett:
Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs. SBP 2010: 1
2000 – 2009
- 2009
- [j7]Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar:
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. IEEE J. Sel. Areas Commun. 27(7): 1297-1304 (2009) - [j6]Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar:
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 20(1): 124-139 (2009) - [c9]Andrea Apolloni, Karthik Channakeshava, Lisa Durbeck, Maleq Khan, Chris J. Kuhlman, Bryan L. Lewis, Samarth Swarup:
A Study of Information Diffusion over a Realistic Social Network Model. CSE (4) 2009: 675-682 - [c8]Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, S. S. Ravi:
Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. INFOCOM 2009: 370-378 - [c7]Christopher L. Barrett, Richard J. Beckman, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz, Tridib Dutta, Bryan L. Lewis:
Generation and Analysis of Large Synthetic Social Contact Networks. WSC 2009: 1003-1014 - 2008
- [j5]Maleq Khan, Gopal Pandurangan:
A fast distributed approximation algorithm for minimum spanning trees. Distributed Comput. 20(6): 391-402 (2008) - [c6]Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings. PODC 2008: 263-272 - [c5]Yongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan:
Energy-optimal distributed algorithms for minimum spanning trees. SPAA 2008: 188-190 - 2007
- [b1]Maleq Khan:
Distributed approximation algorithms for minimum spanning trees and other related problems with applications to wireless ad hoc networks. Purdue University, USA, 2007 - [j4]William Perrizo, Qin Ding, Maleq Khan, Anne Denton, Qiang Ding:
An efficient weighted nearest neighbour classifier using vertical data representation. Int. J. Bus. Intell. Data Min. 2(1): 64-78 (2007) - [j3]Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar:
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385(1-3): 101-114 (2007) - 2006
- [c4]Maleq Khan, Gopal Pandurangan:
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees. DISC 2006: 355-369 - 2005
- [j2]Bharat K. Bhargava, Sheng-Yih Wang, Maleq Khan, Ahsan Habib:
Multimedia data transmission and control using active networks. Comput. Commun. 28(6): 623-639 (2005) - 2004
- [j1]Ahsan Habib, Maleq Khan, Bharat K. Bhargava:
Edge-to-edge measurement-based distributed network monitoring. Comput. Networks 44(2): 211-233 (2004) - 2003
- [c3]William Perrizo, Qin Ding, Anne Denton, Kirk Scott, Qiang Ding, Maleq Khan:
PINE - Podium Incremental Neighbor Evaluator for Classifying Spatial Data. SAC 2003: 503-508 - 2002
- [c2]Maleq Khan, Qin Ding, William Perrizo:
k-nearest Neighbor Classification on Spatial Data Streams Using P-trees. PAKDD 2002: 517-518 - [c1]Qin Ding, Maleq Khan, Amalendu Roy, William Perrizo:
The P-tree algebra. SAC 2002: 426-431
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
