Marcel Roeloffzen

Available identifiers

zbMath Open roeloffzen.marcelMaRDI QIDQ283881

List of research outcomes

Publication	Date of Publication	Type
Experimental analysis of algorithms for the dynamic graph coloring problem	2024-10-08	Paper
Segment visibility counting queries in polygons	2024-09-11	Paper
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	2023-10-26	Paper
Rectilinear link diameter and radius in a rectilinear polygonal domain	2022-07-21	Paper
Snipperclips: cutting tools into desired polygons using themselves	2021-09-17	Paper
Rectilinear link diameter and radius in a rectilinear polygonal domain	2021-01-07	Paper
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points	2020-11-25	Paper
Routing in polygonal domains	2020-11-25	Paper
Faster DBScan and HDBscan in low-dimensional Euclidean spaces	2020-11-25	Paper
Symmetric assembly puzzles are hard, beyond a few pieces	2020-10-23	Paper
Routing in histograms	2020-07-22	Paper
Routing in polygonal domains	2020-04-22	Paper
Balanced line separators of unit disk graphs	2020-04-22	Paper
Packing plane spanning graphs with short edges in complete geometric graphs	2019-10-25	Paper
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points	2019-09-09	Paper
Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces	2019-09-09	Paper
Dynamic graph coloring	2019-04-25	Paper
Improved time-space trade-offs for computing Voronoi diagrams	2019-02-27	Paper
Time-space trade-offs for triangulations and Voronoi diagrams	2018-10-31	Paper
Time-space trade-offs for triangulating a simple polygon	2018-06-05	Paper
On interference among moving sensors and related problems	2018-06-05	Paper
Packing short plane spanning trees in complete geometric graphs	2018-04-19	Paper
Improved time-space trade-offs for computing Voronoi diagrams	2018-04-19	Paper
On interference among moving sensors and related problems	2018-03-02	Paper
Line segment covering of cells in arrangements	2017-10-18	Paper
Time-space trade-offs for triangulating a simple polygon	2017-10-17	Paper
Dynamic graph coloring	2017-09-22	Paper
Balanced line separators of unit disk graphs	2017-09-22	Paper
Hanabi is NP-complete, even for cheaters who look at their cards	2017-07-17	Paper
Hanabi is NP-hard, even for cheaters who look at their cards	2017-05-12	Paper
Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model	2017-03-09	Paper
Symmetric assembly puzzles are hard, beyond a few pieces	2017-02-01	Paper
Distance-sensitive planar point location	2016-05-17	Paper
Line segment covering of cells in arrangements	2016-02-05	Paper
Time-space trade-offs for triangulations and Voronoi diagrams	2015-10-30	Paper
Kinetic 2-centers in the black-box model	2015-02-17	Paper
Kinetic convex hulls and Delaunay triangulations in the black-box model	2014-03-24	Paper
Distance-Sensitive Planar Point Location	2013-08-12	Paper
Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes	2012-09-25	Paper

Research outcomes over time

This page was built for person: Marcel Roeloffzen