André van Renssen

From MaRDI portal
(Redirected from André van Renssen)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Local routing on ordered \(\Theta\)-graphs2026-10-01Paper
Local routing on ordered -graphs
Theoretical Computer Science
2026-09-29Paper
A WSPD, separator and small tree cover for c-packed graphs2026-08-11Paper
Spanner for the 0/1/ weighted region problem2026-08-11Paper
Kinetic geodesic Voronoi diagrams in a simple polygon2026-03-18Paper
A simple dynamization of trapezoidal point location in planar subdivisions2026-03-18Paper
The mutual visibility problem for fat robots with lights
CGT. Computing in Geometry and Topology
2026-03-09Paper
Oriented spanners
Algorithmica
2025-12-30Paper
Shortest paths of mutually visible robots
International Journal of Computational Geometry & Applications
2025-11-12Paper
The tight spanning ratio of the rectangle Delaunay triangulation
Algorithmica
2025-08-29Paper
Computing a subtrajectory cluster from c-packed trajectories2025-07-24Paper
Pattern formation for fat robots with memory
Computational Geometry
2025-07-04Paper
Pattern formation for fat robots with lights
Computational Geometry
2025-03-10Paper
Oriented spanners2025-01-06Paper
The tight spanning ratio of the rectangle Delaunay triangulation2025-01-06Paper
Generalized sweeping line spanners
Theoretical Computer Science
2024-02-20Paper
The mutual visibility problem for fat robots
Lecture Notes in Computer Science
2024-01-16Paper
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
SIAM Journal on Discrete Mathematics
2023-10-26Paper
Generalized sweeping line spanners
Lecture Notes in Computer Science
2023-08-10Paper
Covering a set of line segments with a few squares
Lecture Notes in Computer Science
2023-03-22Paper
Local Routing in Sparse and Lightweight Geometric Graphs
(available as arXiv preprint)
2023-02-03Paper
Graphs with large total angular resolution
Theoretical Computer Science
2023-01-05Paper
Local routing in a tree metric 1-spanner
Journal of Combinatorial Optimization
2022-10-18Paper
Rectilinear link diameter and radius in a rectilinear polygonal domain2022-07-21Paper
Covering a set of line segments with a few squares
Theoretical Computer Science
2022-06-13Paper
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
(available as arXiv preprint)
2022-05-11Paper
Local routing in sparse and lightweight geometric graphs
Algorithmica
2022-05-03Paper
Translation invariant Fréchet distance queries
Algorithmica
2021-11-19Paper
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry
2021-09-17Paper
Bounded-degree spanners in the presence of polygonal obstacles
(available as arXiv preprint)
2021-04-21Paper
Local routing in a tree metric 1-spanner
(available as arXiv preprint)
2021-04-21Paper
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica
2021-04-19Paper
Constrained routing between non-visible vertices
Theoretical Computer Science
2021-03-09Paper
Bounded-degree spanners in the presence of polygonal obstacle
Theoretical Computer Science
2021-01-25Paper
Rectilinear link diameter and radius in a rectilinear polygonal domain
Computational Geometry
2021-01-07Paper
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint)
2020-11-25Paper
Routing in polygonal domains
(available as arXiv preprint)
2020-11-25Paper
Routing on the visibility graph
(available as arXiv preprint)
2020-11-25Paper
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
(available as arXiv preprint)
2020-11-25Paper
Graphs with large total angular resolution
Lecture Notes in Computer Science
2020-10-26Paper
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry
2020-10-23Paper
Routing in histograms
(available as arXiv preprint)
2020-07-22Paper
Routing in polygonal domains
Computational Geometry
2020-04-22Paper
Balanced line separators of unit disk graphs
Computational Geometry
2020-04-22Paper
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry
2019-10-25Paper
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry
2019-10-18Paper
Spanning properties of Yao and -graphs in the presence of constraints
International Journal of Computational Geometry & Applications
2019-09-24Paper
Geometry and generation of a new graph planarity game
Journal of Graph Algorithms and Applications
2019-09-16Paper
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
International Journal of Computational Geometry & Applications
2019-09-09Paper
Competitive routing in the half-\(\theta_6\)-graph2019-05-10Paper
Dynamic graph coloring
Algorithmica
2019-04-25Paper
On plane constrained bounded-degree spanners
Algorithmica
2019-04-25Paper
Routing on the Visibility Graph
(available as arXiv preprint)
2019-02-27Paper
Improved time-space trade-offs for computing Voronoi diagrams
Journal of Computational Geometry
2019-02-27Paper
Time-space trade-offs for triangulations and Voronoi diagrams
Computational Geometry
2018-10-31Paper
Constrained generalized Delaunay graphs are plane spanners
Computational Geometry
2018-10-31Paper
On interference among moving sensors and related problems2018-06-05Paper
Time-space trade-offs for triangulating a simple polygon2018-06-05Paper
Competitive local routing with constraints
(available as arXiv preprint)
2018-06-05Paper
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint)
2018-04-19Paper
Improved time-space trade-offs for computing Voronoi diagrams2018-04-19Paper
On interference among moving sensors and related problems
(available as arXiv preprint)
2018-03-02Paper
Continuous Yao graphs
Computational Geometry
2018-02-12Paper
Constrained routing between non-visible vertices
Lecture Notes in Computer Science
2017-10-23Paper
Time-space trade-offs for triangulating a simple polygon
(available as arXiv preprint)
2017-10-17Paper
Upper and lower bounds for online routing on Delaunay triangulations
Discrete & Computational Geometry
2017-10-10Paper
Dynamic graph coloring
Lecture Notes in Computer Science
2017-09-22Paper
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science
2017-09-22Paper
Hanabi is NP-complete, even for cheaters who look at their cards2017-07-17Paper
The price of order
International Journal of Computational Geometry & Applications
2017-05-19Paper
Hanabi is NP-hard, even for cheaters who look at their cards
Theoretical Computer Science
2017-05-12Paper
New and improved spanning ratios for Yao graphs2017-03-30Paper
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science
2017-02-01Paper
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science
2017-02-01Paper
Towards tight bounds on theta-graphs: more is not always better
Theoretical Computer Science
2016-01-21Paper
Competitive local routing with constraints
Algorithms and Computation
2016-01-11Paper
Upper and lower bounds for online routing on Delaunay triangulations
Algorithms - ESA 2015
2015-11-19Paper
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
SIAM Journal on Computing
2015-11-18Paper
Time-space trade-offs for triangulations and Voronoi diagrams
Lecture Notes in Computer Science
2015-10-30Paper
The price of order
Algorithms and Computation
2015-09-11Paper
Reprint of: Theta-3 is connected
Computational Geometry
2015-04-27Paper
The \(\varTheta_5\)-graph is a spanner
Computational Geometry
2015-03-06Paper
Theta-3 is connected
Computational Geometry
2014-08-13Paper
Upper bounds on the spanning ratio of constrained theta-graphs
LATIN 2014: Theoretical Informatics
2014-03-31Paper
Making triangulations 4-connected using flips
Computational Geometry
2014-01-22Paper
The \(\theta_5\)-graph is a spanner
Graph-Theoretic Concepts in Computer Science
2013-12-06Paper
On the stretch factor of the theta-4 graph
Lecture Notes in Computer Science
2013-08-12Paper
On the spanning ratio of theta-graphs
Lecture Notes in Computer Science
2013-08-12Paper
On plane constrained bounded-degree spanners
Lecture Notes in Computer Science
2012-06-29Paper


Research outcomes over time


This page was built for person: André van Renssen