35 citations · 40 across the 10 of their papers we have counts for
12 papers
Predicting the Citation Count and CiteScore of Journals One Year in Advance
William Croft, Jörg-Rüdiger Sack
Prediction of the future performance of academic journals is a task that can benefit a variety of stakeholders including editorial staff, publishers, indexing services, researchers…
A New Model in Firefighting Theory
Rolf Klein, David Kübel, Elmar Langetepe +2
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexag…
Differential Privacy Via a Truncated and Normalized Laplace Mechanism
William Lee Croft, Jörg-Rüdiger Sack, Wei Shi
When querying databases containing sensitive information, the privacy of individuals stored in the database has to be guaranteed. Such guarantees are provided by differentially pri…
Rectilinear Shortest Paths Among Transient Obstacles
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
This paper presents an optimal algorithm for determining time-minimal rectilinear paths among transient rectilinear obstacles. An obstacle is transient if it exis…
Time-Dependent Shortest Path Queries Among Growing Discs
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
The determination of time-dependent collision-free shortest paths has received a fair amount of attention. Here, we study the problem of computing a time-dependent shortest path am…
Query Shortest Paths Amidst Growing Discs
Arash Nouri, Jorg-Rudiger Sack
The determination of collision-free shortest paths among growing discs has previously been studied for discs with fixed growing rates. Here, we study a more general case of this pr…
Approximating the Integral Fréchet Distance
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
A pseudo-polynomial time -approximation algorithm is presented for computing the integral and average Fréchet distance between two given polygonal curves a…
A Novel Geographic Partitioning System for Anonymizing Health Care Data
William Lee Croft, Wei Shi, Jorg-Rudiger Sack +1
With large volumes of detailed health care data being collected, there is a high demand for the release of this data for research purposes. Hospitals and organizations are faced wi…
Geographic Partitioning Techniques for the Anonymization of Health Care Data
William Lee Croft, Wei Shi, Jorg-Rudiger Sack +1
Hospitals and health care organizations collect large amounts of detailed health care data that is in high demand by researchers. Thus, the possessors of such data are in need of m…
Similarity of Polygonal Curves in the Presence of Outliers
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari +2
The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of out…
Visiting All Sites with Your Dog
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
Given a polygonal curve P, a pointset S, and an ε> 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to εto…
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari +1
We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of t…