Sander Verdonschot

Orcid: 0000-0002-7892-2561

According to our database¹, Sander Verdonschot authored at least 44 papers between 2010 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

2021

Constrained routing between non-visible vertices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Flipping in spirals.

[BibT_eX]

[DOI]

Sander Verdonschot

Comput. Geom., 2021

2020

Convex polygons in cartesian products.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Power domination on triangular grids with triangular and hexagonal shape.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

2019

Improved Bounds for Guarding Plane Graphs with Edges.

[BibT_eX]

[DOI]

Graphs Comb., 2019

On Plane Constrained Bounded-Degree Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2019

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2019

Reconstructing a Convex Polygon from Its \omega ω -cloud.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Routing on the visibility graph.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Reconstructing a convex polygon from its ω-cloud.

[BibT_eX]

[DOI]

CoRR, 2018

Flipping edge-labelled triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Competitive local routing with constraints.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Flips in edge-labelled pseudo-triangulations.

[BibT_eX]

[DOI]

Prosenjit Bose

Sander Verdonschot

Comput. Geom., 2017

Power Domination on Triangular Grids.

[BibT_eX]

Prosenjit Bose

Claire Pennarun

Sander Verdonschot

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Towards tight bounds on theta-graphs: More is not always better.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Rectangle-of-influence triangulations.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Realizing Farthest-Point Voronoi Diagrams.

[BibT_eX]

Therese Biedl

Carsten Grimm

Leonidas Palios

Jonathan Richard Shewchuk

Sander Verdonschot

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Flips and Spanners.

[BibT_eX]

[DOI]

Sander Verdonschot

CoRR, 2015

The θ<sub>5</sub>-graph is a spanner.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

2014

On the Number of Regular Edge Labelings.

[BibT_eX]

[DOI]

Kevin Buchin

Bettina Speckmann

Sander Verdonschot

Discret. Math. Theor. Comput. Sci., 2014

Towards Tight Bounds on Theta-Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Making triangulations 4-connected using flips.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

On the Average Number of Edges in Theta Graphs.

[BibT_eX]

[DOI]

Pat Morin

Sander Verdonschot

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

The θ 5-Graph is a Spanner.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On the Spanning Ratio of Theta-Graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

André van Renssen

Sander Verdonschot

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Stretch Factor of the Theta-4 Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

The theta-5-graph is a spanner

[BibT_eX]

[DOI]

CoRR, 2012

Competitive routing in the half-θ<sub>6</sub>-graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Evolution Strategies for Optimizing Rectangular Cartograms.

[BibT_eX]

[DOI]

Kevin Buchin

Bettina Speckmann

Sander Verdonschot

Proceedings of the Geographic Information Science - 7th International Conference, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

On Rectilinear Partitions with Minimum Stabbing Number.

[BibT_eX]

[DOI]

Mark de Berg

Amirali Khosravi

Sander Verdonschot

Vincent van der Weele

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

A History of Flips in Combinatorial Triangulations.

[BibT_eX]

[DOI]

Prosenjit Bose

Sander Verdonschot

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

Optimizing Regular Edge Labelings.

[BibT_eX]

[DOI]

Kevin Buchin

Bettina Speckmann

Sander Verdonschot

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Sander Verdonschot

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...