Armin Robert Mikler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Armin Robert Mikler has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Chetan Tiwari
Department of Computer Science, Georgia State University, Atlanta, GA 30302, USA
5 shared publications - Emma Louise McDaniel
Georgia State Universrity, USA
4 shared publications - Anu G. Bourgeois
Georgia State University, Atlanta, GA, USA
3 shared publications - Mario M. Kubek
Georgia State University
3 shared publications - Ardavan Sassani
Georgia State University, Atlanta, USA
2 shared publications - Herwig Unger
FernUniversität in Hagen
2 shared publications
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 1170-1186
Interpretable Adverse Event Detection Using a Neuro-Symbolic and Graph-Based Approach
- 2 July 2026
- Published by Springer Nature
- p. 1170-1186
Interpretable Adverse Event Detection Using a Neuro-Symbolic and Graph-Based Approach
- Open Access
- 11 June 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (6) , 475
A Spatial Alignment Problem
This work concerns the harmonization of geospatial data to improve linkages between place-based characteristics and health outcomes. Such data are typically available as geographic layers, each representing a distinct attribute (e.g., income or distance to a clinic). Since layers are typically constructed independently, their boundaries tend to be spatially incongruent, which can create inconsistencies and introduce bias. This motivates developing algorithmic approaches for aligning such layers while aiming to preserve spatial integrity. This paper formalizes the problem of aligning k collections of m spatial supports over n spatial units in a d-dimensional Euclidean space such that maximum distortion to any collection is minimized. In the above setting, k is the number of layers; n is an indivisible population unit (e.g., census tract); m denotes supports, which are larger regions aggregating a set of contiguous units in order to capture broader regional patterns or enhance statistical stability; and . It is shown that: (1) the one-dimensional case is solvable in time polynomial in k, m, and n; (2) the two-dimensional case is NP-hard for two collections of two supports each; and (3) a heuristic can be provided for aligning a set of collections in the two-dimensional case, which is of practical importance.- 11 June 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (6) , 475
Open AccessA Spatial Alignment Problem
This work concerns the harmonization of geospatial data to improve linkages between place-based characteristics and health outcomes. Such data are typically available as geographic layers, each representing a distinct attribute (e.g., income or distance to a clinic). Since layers are typically constructed independently, their boundaries tend to be spatially incongruent, which can create inconsistencies and introduce bias. This motivates developing algorithmic approaches for aligning such layers while aiming to preserve spatial integrity. This paper formalizes the problem of aligning k collections of m spatial supports over n spatial units in a d-dimensional Euclidean space such that maximum distortion to any collection is minimized. In the above setting, k is the number of layers; n is an indivisible population unit (e.g., census tract); m denotes supports, which are larger regions aggregating a set of contiguous units in order to capture broader regional patterns or enhance statistical stability; and . It is shown that: (1) the one-dimensional case is solvable in time polynomial in k, m, and n; (2) the two-dimensional case is NP-hard for two collections of two supports each; and (3) a heuristic can be provided for aligning a set of collections in the two-dimensional case, which is of practical importance. - Open Access
- 13 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 26 (4) , 1-29
Equity-Driven Proportional Allocation of Resources (EDPAR) Framework: A Case Study of Georgia Public School Districts and CS AP Teacher Distribution
With the growing demand for computer scientists and information technology personnel, there is increasing recognition of the importance of introducing students to computer science (CS) education throughout their K–12 studies. Across the United States, there is a concerted effort to integrate CS courses into high school curricula and to expose students to CS concepts as early as elementary school. In response, many states have passed legislation mandating that all high schools offer CS courses, under the assumption that increasing the number of course offerings will equate to broader access and opportunity for all students. However, this paper demonstrates that simply expanding the availability of CS courses does not inherently ensure equitable access, particularly when the underlying distribution of qualified teachers and other key resources remains uneven. These policy efforts, while well-intentioned, risk reinforcing or even exacerbating existing disparities in access to quality CS education and, by extension, potential participation in the technical workforce. To address this challenge, we introduce the Equity Driven Proportional Allocation of Resources (EDPAR) framework as both a method for assessing equity in resource distribution and a practical tool for identifying where resources, such as teachers, should be allocated using a student-weighted approach based on current imbalances. EDPAR supports policymakers and educational leaders in making data-informed decisions that go beyond course availability by quantifying systemic inequities in current resource allocation. We present a case study of Georgia public high schools to illustrate the application of EDPAR, focusing specifically on the allocation of Advanced Placement (AP) Computer Science teachers and its relation to the proportion of Historically Marginalized Groups (HMGs) enrolled in each school. Importantly, the EDPAR framework is generalizable and can be applied to guide equitable and proportional allocation of any quantifiable educational resource across schools or districts.
- 13 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 26 (4) , 1-29
Open AccessEquity-Driven Proportional Allocation of Resources (EDPAR) Framework: A Case Study of Georgia Public School Districts and CS AP Teacher Distribution
With the growing demand for computer scientists and information technology personnel, there is increasing recognition of the importance of introducing students to computer science (CS) education throughout their K–12 studies. Across the United States, there is a concerted effort to integrate CS courses into high school curricula and to expose students to CS concepts as early as elementary school. In response, many states have passed legislation mandating that all high schools offer CS courses, under the assumption that increasing the number of course offerings will equate to broader access and opportunity for all students. However, this paper demonstrates that simply expanding the availability of CS courses does not inherently ensure equitable access, particularly when the underlying distribution of qualified teachers and other key resources remains uneven. These policy efforts, while well-intentioned, risk reinforcing or even exacerbating existing disparities in access to quality CS education and, by extension, potential participation in the technical workforce. To address this challenge, we introduce the Equity Driven Proportional Allocation of Resources (EDPAR) framework as both a method for assessing equity in resource distribution and a practical tool for identifying where resources, such as teachers, should be allocated using a student-weighted approach based on current imbalances. EDPAR supports policymakers and educational leaders in making data-informed decisions that go beyond course availability by quantifying systemic inequities in current resource allocation. We present a case study of Georgia public high schools to illustrate the application of EDPAR, focusing specifically on the allocation of Advanced Placement (AP) Computer Science teachers and its relation to the proportion of Historically Marginalized Groups (HMGs) enrolled in each school. Importantly, the EDPAR framework is generalizable and can be applied to guide equitable and proportional allocation of any quantifiable educational resource across schools or districts.
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1399-1400
Computer Science Enrollment Through a Community Data Lens
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1399-1400
Open AccessComputer Science Enrollment Through a Community Data Lens
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 23-30
Accelerating Discovery and Retrieval of Heterogeneous Geospatial Data: A Scalable Location-Centric Database Architecture for Disaster Response and Recovery
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 23-30
Open AccessAccelerating Discovery and Retrieval of Heterogeneous Geospatial Data: A Scalable Location-Centric Database Architecture for Disaster Response and Recovery
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 709-710
Bridge Programs: Pathways to Computing for All
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 709-710
Open AccessBridge Programs: Pathways to Computing for All
- Open Access
On Self-improving Token Embeddings
This article introduces a novel and fast method for refining pre-trained static word or, more generally, token embeddings. By incorporating the embeddings of neighboring tokens in text corpora, it continuously updates the representation of each token, including those without pre-assigned embeddings. This approach effectively addresses the out-of-vocabulary problem, too. Operating independently of large language models and shallow neural networks, it enables versatile applications such as corpus exploration, conceptual search, and word sense disambiguation. The method is designed to enhance token representations within topically homogeneous corpora, where the vocabulary is restricted to a specific domain, resulting in more meaningful embeddings compared to general-purpose pre-trained vectors. As an example, the methodology is applied to explore storm events and their impacts on infrastructure and communities using narratives from a subset of the NOAA Storm Events database. The article also demonstrates how the approach improves the representation of storm-related terms over time, providing valuable insights into the evolving nature of disaster narratives.
Open AccessOn Self-improving Token Embeddings
This article introduces a novel and fast method for refining pre-trained static word or, more generally, token embeddings. By incorporating the embeddings of neighboring tokens in text corpora, it continuously updates the representation of each token, including those without pre-assigned embeddings. This approach effectively addresses the out-of-vocabulary problem, too. Operating independently of large language models and shallow neural networks, it enables versatile applications such as corpus exploration, conceptual search, and word sense disambiguation. The method is designed to enhance token representations within topically homogeneous corpora, where the vocabulary is restricted to a specific domain, resulting in more meaningful embeddings compared to general-purpose pre-trained vectors. As an example, the methodology is applied to explore storm events and their impacts on infrastructure and communities using narratives from a subset of the NOAA Storm Events database. The article also demonstrates how the approach improves the representation of storm-related terms over time, providing valuable insights into the evolving nature of disaster narratives.
- Open Access
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 192-198
Navigating Complexity: A Multi-Domain Ontology Evaluation with Cluster Centroids as Hierarchical Representatives
- 13 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 192-198
Open AccessNavigating Complexity: A Multi-Domain Ontology Evaluation with Cluster Centroids as Hierarchical Representatives
- Open Access
- 21 November 2024
- Published by PeerJ in PeerJ Computer Science
- Vol. 10, e2446
A distributed algorithm for solving large-scale p-median problems using expectation maximization
The p-median problem selects p source locations to serve n destinations such that the average distance between the destinations and corresponding sources is minimized. It is a well-studied NP-hard combinatorial optimization problem with many existing heuristic solutions, however, existing algorithms are not scalable for large-scale problems. The fast interchange (FI) heuristic which yields results close to the optimal solution with respect to the objective function value becomes suboptimal with respect to time requirements for large-scale problems. We present a novel distributed divide and conquer algorithm, EM-FI, to solve large-scale p-median problems quickly even with limited computing resources. The algorithm identifies the existing spatial clusters of the destination locations using expectation maximization (EM) and solves them as independent p-median problems using integer programming or FI concurrently. The proposed algorithm showed an order of magnitude improvement in time without the loss of quality in terms of the objective function value on synthetic and real datasets.
- 21 November 2024
- Published by PeerJ in PeerJ Computer Science
- Vol. 10, e2446
Open AccessA distributed algorithm for solving large-scale p-median problems using expectation maximization
The p-median problem selects p source locations to serve n destinations such that the average distance between the destinations and corresponding sources is minimized. It is a well-studied NP-hard combinatorial optimization problem with many existing heuristic solutions, however, existing algorithms are not scalable for large-scale problems. The fast interchange (FI) heuristic which yields results close to the optimal solution with respect to the objective function value becomes suboptimal with respect to time requirements for large-scale problems. We present a novel distributed divide and conquer algorithm, EM-FI, to solve large-scale p-median problems quickly even with limited computing resources. The algorithm identifies the existing spatial clusters of the destination locations using expectation maximization (EM) and solves them as independent p-median problems using integer programming or FI concurrently. The proposed algorithm showed an order of magnitude improvement in time without the loss of quality in terms of the objective function value on synthetic and real datasets.