The following pages link to André van Renssen (Q390114):
Displaying 50 items.
- Making triangulations 4-connected using flips (Q390117) (← links)
- Theta-3 is connected (Q396473) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- (Q782153) (redirect page) (← links)
- Routing in histograms (Q782155) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Constrained generalized Delaunay graphs are plane spanners (Q1615887) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- On plane constrained bounded-degree spanners (Q1739100) (← links)
- Bounded-degree spanners in the presence of polygonal obstacles (Q2019434) (← links)
- Local routing in a tree metric 1-spanner (Q2019453) (← links)
- Local routing in a tree metric \(1\)-spanner (Q2084633) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- Bounded-degree spanners in the presence of polygonal obstacle (Q2220871) (← links)
- Snipperclips: cutting tools into desired polygons using themselves (Q2230404) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- Translation invariant Fréchet distance queries (Q2665912) (← links)
- On the Stretch Factor of the Theta-4 Graph (Q2842149) (← links)
- On the Spanning Ratio of Theta-Graphs (Q2842156) (← links)
- The θ 5-Graph is a Spanner (Q2864294) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- New and improved spanning ratios for Yao graphs (Q2970433) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783) (← links)
- Competitive Local Routing with Constraints (Q3459846) (← links)
- On interference among moving sensors and related problems (Q4606303) (← links)
- Improved Time-Space Trade-offs for Computing Voronoi Diagrams (Q4626292) (← links)
- Routing on the Visibility Graph (Q4626301) (← links)
- New and Improved Spanning Ratios for Yao Graphs (Q4635525) (← links)
- (Q4636491) (← links)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (Q5075735) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- (Q5136216) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Routing on the visibility graph (Q5136234) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. (Q5136245) (← links)
- Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints (Q5197491) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- (Q5282800) (← links)
