2 citations · 4 across the 5 of their papers we have counts for
10 papers
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…
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…