The following pages link to Sander Verdonschot (Q390116):
Displayed 38 items.
- Making triangulations 4-connected using flips (Q390117) (← links)
- Theta-3 is connected (Q396473) (← links)
- Flips in edge-labelled pseudo-triangulations (Q680154) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- On plane constrained bounded-degree spanners (Q1739100) (← links)
- Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
- Flipping in spirals (Q1984590) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Reconstructing a convex Polygon from its \(\omega\)-cloud (Q2330549) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← 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)
- (Q2928592) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- New and improved spanning ratios for Yao graphs (Q2970433) (← links)
- Optimizing Regular Edge Labelings (Q3073665) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Competitive Local Routing with Constraints (Q3459846) (← links)
- Routing on the Visibility Graph (Q4626301) (← links)
- New and Improved Spanning Ratios for Yao Graphs (Q4635525) (← links)
- Weight Balancing on Boundaries and Skeletons (Q4635568) (← links)
- A History of Flips in Combinatorial Triangulations (Q4899262) (← links)
- (Q5077652) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- Improved bounds for guarding plane graphs with edges (Q5116478) (← links)
- Routing on the visibility graph (Q5136234) (← links)
- On the Average Number of Edges in Theta Graphs (Q5194764) (← links)
- On Rectilinear Partitions with Minimum Stabbing Number (Q5199251) (← links)
- (Q5743479) (← links)
- (Q5745388) (← links)
- (Q5854566) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Constrained routing between non-visible vertices (Q5918146) (← links)
- Dynamic graph coloring (Q5920096) (← links)