Sander Verdonschot

From MaRDI portal
Person:390116

Available identifiers

zbMath Open verdonschot.sanderMaRDI QIDQ390116

List of research outcomes





PublicationDate of PublicationType
Convex polygons in Cartesian products2022-07-18Paper
Weight balancing on boundaries2022-05-18Paper
Flipping in spirals2021-09-16Paper
https://portal.mardi4nfdi.de/entity/Q58545662021-03-17Paper
Constrained routing between non-visible vertices2021-03-09Paper
Routing on the visibility graph2020-11-25Paper
Improved bounds for guarding plane graphs with edges2020-08-25Paper
Power domination on triangular grids with triangular and hexagonal shape2020-07-29Paper
Reconstructing a convex Polygon from its \(\omega\)-cloud2019-10-22Paper
On the average number of edges in theta graphs2019-09-17Paper
Competitive routing in the half-\(\theta_6\)-graph2019-05-10Paper
Improved bounds for guarding plane graphs with edges2019-05-03Paper
On plane constrained bounded-degree spanners2019-04-25Paper
Dynamic graph coloring2019-04-25Paper
Routing on the Visibility Graph2019-02-27Paper
Competitive local routing with constraints2018-06-05Paper
Weight Balancing on Boundaries and Skeletons2018-04-23Paper
New and improved spanning ratios for Yao graphs2018-04-23Paper
Flipping edge-labelled triangulations2018-02-19Paper
Continuous Yao graphs2018-02-12Paper
Flips in edge-labelled pseudo-triangulations2018-01-22Paper
Constrained routing between non-visible vertices2017-10-23Paper
Dynamic graph coloring2017-09-22Paper
New and improved spanning ratios for Yao graphs2017-03-30Paper
Gabriel triangulations and angle-monotone graphs: local routing and recognition2017-02-21Paper
Towards tight bounds on theta-graphs: more is not always better2016-01-21Paper
Competitive local routing with constraints2016-01-11Paper
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles2015-11-18Paper
Reprint of: Theta-3 is connected2015-04-27Paper
The \(\varTheta_5\)-graph is a spanner2015-03-06Paper
On the number of regular edge labelings2014-11-10Paper
Theta-3 is connected2014-08-13Paper
Making triangulations 4-connected using flips2014-01-22Paper
The \(\theta_5\)-graph is a spanner2013-12-06Paper
On the stretch factor of the theta-4 graph2013-08-12Paper
On the spanning ratio of theta-graphs2013-08-12Paper
A history of flips in combinatorial triangulations2013-01-07Paper
On plane constrained bounded-degree spanners2012-06-29Paper
On rectilinear partitions with minimum stabbing number2011-08-12Paper
Optimizing regular edge labelings2011-02-11Paper

Research outcomes over time

This page was built for person: Sander Verdonschot