Amr Magdy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Amr Magdy has a total of 141 co-authors. Here are the top co-authors by number of shared publications:
Mohamed F. Mokbel
University of Minnesota
20 shared publications- Yongyi Liu
University of California Riverside
8 shared publications - Yunfan Kang
Cyber GIS Center for Advanced Digital and Spatial Studies, Department of Geography & GIS, University of Illinois Urbana Champaign, Urbana, IL, USA
7 shared publications Mashaal Musleh
Umm Al-Qura University, Makkah, Saudi Arabia
5 shared publicationsThanaa M. Ghanem
Metropolitan State University, Saint Paul, MN, USA
5 shared publications- Abdulaziz Almaslukh
Information System Department, King Saud University, Riyadh, Saudi Arabia
4 shared publications
Latest Publications
- Open Access
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 23-24
Quantum-Optimized Spatial Permutations: Minimizing Submatrix Rank for Block-Low-Rank Space-Filling Curves
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 23-24
Open AccessQuantum-Optimized Spatial Permutations: Minimizing Submatrix Rank for Block-Low-Rank Space-Filling Curves
- Open Access
- 25 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Spatial Algorithms and Systems
- Vol. 12 (2) , 1-35
Progressive and Scalable Hotspot Detection through Local K-Function in Spatial Networks
The widespread availability of geotagged data combined with modern map services allows for the accurate attachment of data to spatial networks. Applying statistical analysis, such as hotspot detection, over spatial networks is very important for precise quantification and patterns analysis, which empowers effective decision-making in various important applications. Existing hotspot detection algorithms on spatial networks either lack sufficient statistical evidence on detected hotspots, such as clustering, or they provide statistical evidence at a prohibitive computational overhead. In this article, we propose efficient algorithms for detecting hotspots based on the network local K-function for predefined and unknown hotspot radii. The K-function is a widely adopted statistical approach for network pattern analysis that enables the understanding of the density and distribution of activities and events happening within the spatial network. However, its practical application has been limited due to the inefficiency of state-of-the-art algorithms, particularly for large-sized networks. Extensive experimental evaluation using real and synthetic datasets shows that our algorithms are up to 28 times faster than the state-of-the-art algorithms in computing hotspots with a predefined radius and up to more than four orders of magnitude faster in identifying hotspots without a predefined radius. Additionally, to address dynamic changes in the spatial network, we propose an incremental hotspot detection approach that efficiently updates hotspot computations by leveraging prior results as new events are added.
- 25 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Spatial Algorithms and Systems
- Vol. 12 (2) , 1-35
Open AccessProgressive and Scalable Hotspot Detection through Local K-Function in Spatial Networks
The widespread availability of geotagged data combined with modern map services allows for the accurate attachment of data to spatial networks. Applying statistical analysis, such as hotspot detection, over spatial networks is very important for precise quantification and patterns analysis, which empowers effective decision-making in various important applications. Existing hotspot detection algorithms on spatial networks either lack sufficient statistical evidence on detected hotspots, such as clustering, or they provide statistical evidence at a prohibitive computational overhead. In this article, we propose efficient algorithms for detecting hotspots based on the network local K-function for predefined and unknown hotspot radii. The K-function is a widely adopted statistical approach for network pattern analysis that enables the understanding of the density and distribution of activities and events happening within the spatial network. However, its practical application has been limited due to the inefficiency of state-of-the-art algorithms, particularly for large-sized networks. Extensive experimental evaluation using real and synthetic datasets shows that our algorithms are up to 28 times faster than the state-of-the-art algorithms in computing hotspots with a predefined radius and up to more than four orders of magnitude faster in identifying hotspots without a predefined radius. Additionally, to address dynamic changes in the spatial network, we propose an incremental hotspot detection approach that efficiently updates hotspot computations by leveraging prior results as new events are added.
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-14
Quantum Optimization Realized: Quantum Annealing for Combinatorial Spatial Problems in Practice
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-14
Open AccessQuantum Optimization Realized: Quantum Annealing for Combinatorial Spatial Problems in Practice
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Quantum Computing: A Brief Introduction and Its Applications in Spatial Computing
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessQuantum Computing: A Brief Introduction and Its Applications in Spatial Computing
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1206-1209
Spatial Regionalization: Formulations, Algorithms, and Applications
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1206-1209
Open AccessSpatial Regionalization: Formulations, Algorithms, and Applications
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1130-1133
Spatial Regionalization: A Hybrid Quantum Computing Approach
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1130-1133
Open AccessSpatial Regionalization: A Hybrid Quantum Computing Approach
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 221-232
A Deep Multilevel Approach for Non-Uniform Spatial Network Partitioning
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 221-232
Open AccessA Deep Multilevel Approach for Non-Uniform Spatial Network Partitioning
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (1) , 380-398
IMS: Incremental Max-P Regionalization With Statistical Constraints
Spatial regionalization is the process of grouping a set of spatial areas into spatially contiguous and homogeneous regions. This paper introduces an Incremental Max-P regionalization with statistical constraints (IMS) problem; a regionalization process that supports enriched user-defined constraints based on statistical aggregate functions and supports incremental updates. In addition to enabling richer constraints, it allows users to employ multiple constraints simultaneously to significantly push the expressiveness and effectiveness of the existing regionalization literature. The IMS problem is NP-hard and significantly enriches the existing regionalization problems. Such a major enrichment introduces several challenges in both feasibility and scalability. To address these challenges, we propose the FaCT algorithm, a three-phase heuristic approach that finds a feasible set of spatial regions that satisfy IMS constraints while supporting large datasets compared to the existing literature. FaCT supports local and global incremental updates when there are changes in attribute values or constraints. In addition, we incorporate the Iterated Greedy algorithm with FaCT to further improve the solution quality of the IMS problem and the classical max-p regions problem. Our extensive experimental evaluation has demonstrated the effectiveness and scalability of our techniques on several real datasets.
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (1) , 380-398
IMS: Incremental Max-P Regionalization With Statistical Constraints
Spatial regionalization is the process of grouping a set of spatial areas into spatially contiguous and homogeneous regions. This paper introduces an Incremental Max-P regionalization with statistical constraints (IMS) problem; a regionalization process that supports enriched user-defined constraints based on statistical aggregate functions and supports incremental updates. In addition to enabling richer constraints, it allows users to employ multiple constraints simultaneously to significantly push the expressiveness and effectiveness of the existing regionalization literature. The IMS problem is NP-hard and significantly enriches the existing regionalization problems. Such a major enrichment introduces several challenges in both feasibility and scalability. To address these challenges, we propose the FaCT algorithm, a three-phase heuristic approach that finds a feasible set of spatial regions that satisfy IMS constraints while supporting large datasets compared to the existing literature. FaCT supports local and global incremental updates when there are changes in attribute values or constraints. In addition, we incorporate the Iterated Greedy algorithm with FaCT to further improve the solution quality of the IMS problem and the classical max-p regions problem. Our extensive experimental evaluation has demonstrated the effectiveness and scalability of our techniques on several real datasets.
- Open Access
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 39-43
Spatial Regionalization: Algorithms and Challenges
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 39-43
Open AccessSpatial Regionalization: Algorithms and Challenges
- Open Access
Spatial Regionalization: A Hybrid Quantum Computing Approach
Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum computing due to its complexity and large number of variables. In this paper, we introduce the first hybrid quantum-classical method to spatial regionalization by decomposing the problem into manageable subproblems, leveraging the strengths of both classical and quantum computation. This study establishes a foundational framework for effectively integrating quantum computing methods into realistic and complex spatial optimization tasks. Our initial results show a promising quantum performance advantage for a broad range of spatial regionalization problems and their variants.
Open AccessSpatial Regionalization: A Hybrid Quantum Computing Approach
Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum computing due to its complexity and large number of variables. In this paper, we introduce the first hybrid quantum-classical method to spatial regionalization by decomposing the problem into manageable subproblems, leveraging the strengths of both classical and quantum computation. This study establishes a foundational framework for effectively integrating quantum computing methods into realistic and complex spatial optimization tasks. Our initial results show a promising quantum performance advantage for a broad range of spatial regionalization problems and their variants.