activity
20042020
most citedShawn: A new approach to simulating wireless sensor networks

88 citations · 249 across the 16 of their papers we have counts for

collaborators

17 papers

cs.CY2020★ 1 cited

Beyond privacy regulations: an ethical approach to data usage in transportation

Johannes M. van Hulst, Mattia Zeni, Alexander Kröller +2

With the exponential advancement of business technology in recent years, data-driven decision making has become the core of most industries. With the rise of new privacy regulation…

cs.CG2014★ 4 cited

Engineering Art Galleries

Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs +3

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there h…

cs.CG2014

Algorithms for Art Gallery Illumination

Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer +4

The Art Gallery Problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a give…

cs.CG2014★ 22 cited

Efficient Computation of Visibility Polygons

Francisc Bungiu, Michael Hemmer, John Hershberger +2

Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations…

cs.DB2014★ 9 cited

The Wiselib TupleStore: A Modular RDF Database for the Internet of Things

Henning Hasemann, Alexander Kröller, Max Pagel

The Internet of Things movement provides self-configuring and universally interoperable devices. While such devices are often built with a specific application in mind, they often…

cs.CG2013

Facets for Art Gallery Problems

Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller +1

The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region P, such that all points in P are guarded. The problem is known to be NP-h…