Rolf Svenning

According to our database, Rolf Svenning authored at least 8 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

RolfSvenning/ContiguousArtGallery.

Rolf Svenning

Dataset, June, 2025

Buffered Partially-Persistent External-Memory Search Trees.

Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning

CoRR, March, 2025

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems.

Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas C. Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da Wei Zheng

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

The Contiguous Art Gallery Problem is Solvable in Polynomial Time.

Magnus Christian Ring Merrild, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning

CoRR, 2024

The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory.

Nodari Sitchinava, Rolf Svenning

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Fast Area-Weighted-Peeling of Convex Hulls for Outlier Detection.

Vinesh Sridhar, Rolf Svenning

Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023

Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location.

Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

External Memory Fully Persistent Search Trees.

Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023