André van Renssen

From MaRDI portal
Person:390114

Available identifiers

zbMath Open van-renssen.andreMaRDI QIDQ390114

List of research outcomes

PublicationDate of PublicationType
Generalized sweeping line spanners2024-02-20Paper
The mutual visibility problem for fat robots2024-01-16Paper
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon2023-10-26Paper
Generalized sweeping line spanners2023-08-10Paper
Covering a set of line segments with a few squares2023-03-22Paper
https://portal.mardi4nfdi.de/entity/Q58755922023-02-03Paper
Graphs with large total angular resolution2023-01-05Paper
Local routing in a tree metric \(1\)-spanner2022-10-18Paper
https://portal.mardi4nfdi.de/entity/Q50910512022-07-21Paper
Covering a set of line segments with a few squares2022-06-13Paper
https://portal.mardi4nfdi.de/entity/Q50757352022-05-11Paper
Local routing in sparse and lightweight geometric graphs2022-05-03Paper
Translation invariant Fréchet distance queries2021-11-19Paper
Snipperclips: cutting tools into desired polygons using themselves2021-09-17Paper
Bounded-degree spanners in the presence of polygonal obstacles2021-04-21Paper
Local routing in a tree metric 1-spanner2021-04-21Paper
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers2021-04-19Paper
Constrained routing between non-visible vertices2021-03-09Paper
Bounded-degree spanners in the presence of polygonal obstacle2021-01-25Paper
Rectilinear link diameter and radius in a rectilinear polygonal domain2021-01-07Paper
https://portal.mardi4nfdi.de/entity/Q51362162020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51362252020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51362342020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51362452020-11-25Paper
Graphs with large total angular resolution2020-10-26Paper
Symmetric assembly puzzles are hard, beyond a few pieces2020-10-23Paper
Routing in histograms2020-07-22Paper
Routing in polygonal domains2020-04-22Paper
Balanced line separators of unit disk graphs2020-04-22Paper
Packing plane spanning graphs with short edges in complete geometric graphs2019-10-25Paper
Faster algorithms for growing prioritized disks and rectangles2019-10-18Paper
Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints2019-09-24Paper
Geometry and Generation of a New Graph Planarity Game2019-09-16Paper
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points2019-09-09Paper
https://portal.mardi4nfdi.de/entity/Q57434792019-05-10Paper
On plane constrained bounded-degree spanners2019-04-25Paper
Dynamic graph coloring2019-04-25Paper
Improved Time-Space Trade-offs for Computing Voronoi Diagrams2019-02-27Paper
Routing on the Visibility Graph2019-02-27Paper
Time-space trade-offs for triangulations and Voronoi diagrams2018-10-31Paper
Constrained generalized Delaunay graphs are plane spanners2018-10-31Paper
On interference among moving sensors and related problems2018-06-05Paper
Time-space trade-offs for triangulating a simple polygon2018-06-05Paper
https://portal.mardi4nfdi.de/entity/Q57453882018-06-05Paper
New and Improved Spanning Ratios for Yao Graphs2018-04-23Paper
Improved Time-Space Trade-offs for Computing Voronoi Diagrams2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46364912018-04-19Paper
On interference among moving sensors and related problems2018-03-02Paper
Continuous Yao graphs2018-02-12Paper
Constrained routing between non-visible vertices2017-10-23Paper
https://portal.mardi4nfdi.de/entity/Q53695322017-10-17Paper
Upper and lower bounds for online routing on Delaunay triangulations2017-10-10Paper
Dynamic graph coloring2017-09-22Paper
Balanced line separators of unit disk graphs2017-09-22Paper
https://portal.mardi4nfdi.de/entity/Q52828002017-07-17Paper
The Price of Order2017-05-19Paper
Hanabi is NP-hard, even for cheaters who look at their cards2017-05-12Paper
New and improved spanning ratios for Yao graphs2017-03-30Paper
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces2017-02-01Paper
Towards tight bounds on theta-graphs: more is not always better2016-01-21Paper
Competitive Local Routing with Constraints2016-01-11Paper
Upper and Lower Bounds for Online Routing on Delaunay Triangulations2015-11-19Paper
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles2015-11-18Paper
Time-Space Trade-offs for Triangulations and Voronoi Diagrams2015-10-30Paper
The Price of Order2015-09-11Paper
Reprint of: Theta-3 is connected2015-04-27Paper
The \(\varTheta_5\)-graph is a spanner2015-03-06Paper
Theta-3 is connected2014-08-13Paper
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs2014-03-31Paper
Making triangulations 4-connected using flips2014-01-22Paper
The θ 5-Graph is a Spanner2013-12-06Paper
On the Stretch Factor of the Theta-4 Graph2013-08-12Paper
On the Spanning Ratio of Theta-Graphs2013-08-12Paper
On plane constrained bounded-degree spanners2012-06-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: André van Renssen