VLDB 2026 Research / reviewers in the wild / expert
Ted Edward Holmberg
dblp:339/8329
· DBLP profile ↗
4ranked-venue papers in the field
4as first author
4since 2021 · last 2025
0009-0006-6778-1966ORCID · reported
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 4 (4 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Knowledge-Graph Translation Layer for Mission-Aware Multi-Agent Path Planning in Spatiotemporal Dynamics
Ted Edward Holmberg, Elias Ioup, Mahdi Abdelguerfi |
IEEE Big Data | 1 |
| 2024 | Knowledge Graph-Based Multi-Agent Path Planning in Dynamic Environments using WAITRabstractThis paper addresses the challenge of multi-agent path planning for efficient data collection in dynamic, uncertain environments, exemplified by autonomous underwater vehicles (AUVs) navigating the Gulf of Mexico. Traditional greedy algorithms, though computationally efficient, often fall short in long-term planning due to their short-sighted nature, missing crucial data collection opportunities and increasing exposure to hazards. To address these limitations, we introduce WAITR (Weighted Aggregate Inter-Temporal Reward), a novel path-planning framework that integrates a knowledge graph with pathlet-based planning, segmenting the environment into dynamic, speed-adjusted sub-regions (pathlets). This structure enables coordinated, adaptive planning, as agents can operate within time-bound regions while dynamically responding to environmental changes. WAITR’s cumulative scoring mechanism balances immediate data collection with long-term optimization of Points of Interest (POIs), ensuring safer navigation and comprehensive data coverage. Experimental results show that WAITR substantially improves POI coverage and reduces exposure to hazards, achieving up to 27.1% greater event coverage than traditional greedy methods. Ted Edward Holmberg, Elias Ioup, Mahdi Abdelguerfi |
IEEE Big Data | 1 |
| 2023 | STROOBnet Optimization via GPU-Accelerated Proximal Recurrence StrategiesabstractSpatiotemporal networks’ observational capabilities are crucial for accurate data gathering and informed decisions across multiple sectors. This study focuses on the Spatiotemporal Ranged Observer-Observable Bipartite Network (STROOBnet), linking observational nodes (e.g., surveillance cameras) to events within defined geographical regions, enabling efficient monitoring. Using data from Real-Time Crime Camera (RTCC) systems and Calls for Service (CFS) in New Orleans, where RTCC combats rising crime amidst reduced police presence, we address the network’s initial observational imbalances. Aiming for uniform observational efficacy, we propose the Proximal Recurrence approach. It outperformed traditional clustering methods like k-means and DBSCAN by offering holistic event frequency and spatial consideration, enhancing observational coverage. Ted Edward Holmberg, Mahdi Abdelguerfi, Elias Ioup |
IEEE Big Data | 1 |
| 2022 | A Stochastic Geo-spatiotemporal Bipartite Network to Optimize GCOOS Sensor Placement StrategiesabstractThis paper proposes two new measures applicable in a spatial bipartite network model: coverage and coverage robustness. The bipartite network must consist of observer nodes, observable nodes, and edges that connect observer nodes to observable nodes. The coverage and coverage robustness scores evaluate the effectiveness of the observer node placements. This measure is beneficial for stochastic data as it may be coupled with Monte Carlo simulations to identify optimal placements for new observer nodes. In this paper, we construct a Geo-SpatioTemporal Bipartite Network (GSTBN) within the stochastic and dynamical environment of the Gulf of Mexico. This GSTBN consists of GCOOS sensor nodes and HYCOM Region of Interest (RoI) event nodes. The goal is to identify optimal placements to expand GCOOS to improve the forecasting outcomes by the HYCOM ocean prediction model. Ted Edward Holmberg, Elias Ioup, Mahdi Abdelguerfi |
IEEE Big Data | 1 |