Optimizing Regular Edge Labelings. - Kevin Buchin; Bettina Speckmann; Sander Verdonschot (GD, 2010)

A History of Flips in Combinatorial Triangulations. - Prosenjit Bose; Sander Verdonschot (EGC, 2011)

On Rectilinear Partitions with Minimum Stabbing Number. - Mark de Berg; Amirali Khosravi; Sander Verdonschot; Vincent van der Weele (WADS, 2011)

Optimal Bounds on Theta-Graphs: More is not Always Better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CCCG, 2012)

Competitive Routing on a Bounded-Degree Plane Spanner. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (CCCG, 2012)

Evolution Strategies for Optimizing Rectangular Cartograms. - Kevin Buchin; Bettina Speckmann; Sander Verdonschot (GIScience, 2012)

Competitive routing in the half-θ6-graph. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SODA, 2012)

The theta-5-graph is a spanner - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2012)

On the Stretch Factor of the Theta-4 Graph. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; André van Renssen; Sander Verdonschot (WADS, 2013)

On the Spanning Ratio of Theta-Graphs. - Prosenjit Bose; André van Renssen; Sander Verdonschot (WADS, 2013)

The θ 5-Graph is a Spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (WG, 2013)

New and Improved Spanning Ratios for Yao Graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot (CoRR, 2013)

On the Average Number of Edges in Theta Graphs. - Pat Morin; Sander Verdonschot (ANALCO, 2014)

Continuous Yao Graphs. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; André van Renssen; Perouz Taslakian; Sander Verdonschot (CCCG, 2014)

Weight Balancing on Boundaries and Skeletons. - Luis Barba; Otfried Cheong; Jean-Lou De Carufel; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot; et al. (SoCG, 2014)

Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2014)

Making triangulations 4-connected using flips. - Prosenjit Bose; Dana Jansens; André van Renssen; Maria Saumell; Sander Verdonschot (Comput. Geom., 2014)

Towards Tight Bounds on Theta-Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2014)

On the Number of Regular Edge Labelings. - Kevin Buchin; Bettina Speckmann; Sander Verdonschot (Discret. Math. Theor. Comput. Sci., 2014)

Reprint of: Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2015)

The θ5-graph is a spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (Comput. Geom., 2015)

Flips and Spanners. - Sander Verdonschot (CoRR, 2015)

New and improved spanning ratios for Yao graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Wah Loon Keng; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot; Ge Xia (J. Comput. Geom., 2015)

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SIAM J. Comput., 2015)

Realizing Farthest-Point Voronoi Diagrams. - Therese Biedl; Carsten Grimm; Leonidas Palios; Jonathan Richard Shewchuk; Sander Verdonschot (CCCG, 2016)

Rectangle-of-influence triangulations. - Therese Biedl; Anna Lubiw; Saeed Mehrabi 001; Sander Verdonschot (CCCG, 2016)

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. - Nicolas Bonichon; Prosenjit Bose; Paz Carmi; Irina Kostitsyna; Anna Lubiw; Sander Verdonschot (GD, 2016)

Towards tight bounds on theta-graphs: More is not always better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2016)

Power Domination on Triangular Grids. - Prosenjit Bose; Claire Pennarun; Sander Verdonschot (CCCG, 2017)

Flips in edge-labelled pseudo-triangulations. - Prosenjit Bose; Sander Verdonschot (Comput. Geom., 2017)

Competitive local routing with constraints. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (J. Comput. Geom., 2017)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

Flipping edge-labelled triangulations. - Prosenjit Bose; Anna Lubiw; Vinayak Pathak; Sander Verdonschot (Comput. Geom., 2018)

Reconstructing a convex polygon from its ω-cloud. - Prosenjit Bose; Jean-Lou De Carufel; Elena Khramtcova; Sander Verdonschot (CoRR, 2018)

Routing on the visibility graph. - Prosenjit Bose; Matias Korman; Sander Verdonschot; André van Renssen (J. Comput. Geom., 2018)

Reconstructing a Convex Polygon from Its omega ω -cloud. - Elena Arseneva; Prosenjit Bose; Jean-Lou De Carufel; Sander Verdonschot (CSR, 2019)

Dynamic Graph Coloring. - Luis Barba; Jean Cardinal; Matias Korman; Stefan Langerman; André van Renssen; Marcel Roeloffzen; Sander Verdonschot (Algorithmica, 2019)

On Plane Constrained Bounded-Degree Spanners. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (Algorithmica, 2019)

Improved Bounds for Guarding Plane Graphs with Edges. - Ahmad Biniaz; Prosenjit Bose; Aurélien Ooms; Sander Verdonschot (Graphs Comb., 2019)

Power domination on triangular grids with triangular and hexagonal shape. - Prosenjit Bose; Valentin Gledel; Claire Pennarun; Sander Verdonschot (J. Comb. Optim., 2020)

Convex polygons in cartesian products. - Jean-Lou De Carufel; Adrian Dumitrescu; Wouter Meulemans; Tim Ophelders; Claire Pennarun; Csaba D. Tóth; Sander Verdonschot (J. Comput. Geom., 2020)

Flipping in spirals. - Sander Verdonschot (Comput. Geom., 2021)

Constrained routing between non-visible vertices. - Prosenjit Bose; Matias Korman; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2021)

Weight balancing on boundaries. - Luis Barba; Otfried Cheong; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot (J. Comput. Geom., 2022)