Sander Verdonschot
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Convex polygons in Cartesian products (available as arXiv preprint) | 2022-07-18 | Paper |
| Weight balancing on boundaries (available as arXiv preprint) | 2022-05-18 | Paper |
| Flipping in spirals Computational Geometry | 2021-09-16 | Paper |
| scientific article; zbMATH DE number 7324096 (Why is no real title available?) | 2021-03-17 | Paper |
| Constrained routing between non-visible vertices Theoretical Computer Science | 2021-03-09 | Paper |
| Routing on the visibility graph (available as arXiv preprint) | 2020-11-25 | Paper |
| Improved bounds for guarding plane graphs with edges | 2020-08-25 | Paper |
| Power domination on triangular grids with triangular and hexagonal shape Journal of Combinatorial Optimization | 2020-07-29 | Paper |
| Reconstructing a convex Polygon from its \(\omega\)-cloud (available as arXiv preprint) | 2019-10-22 | Paper |
| On the average number of edges in theta graphs 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
| Competitive routing in the half-\(\theta_6\)-graph | 2019-05-10 | Paper |
| Improved bounds for guarding plane graphs with edges Graphs and Combinatorics | 2019-05-03 | Paper |
| Improved bounds for guarding plane graphs with edges Graphs and Combinatorics | 2019-05-03 | Paper |
| Dynamic graph coloring Algorithmica | 2019-04-25 | Paper |
| On plane constrained bounded-degree spanners Algorithmica | 2019-04-25 | Paper |
| Routing on the Visibility Graph (available as arXiv preprint) | 2019-02-27 | Paper |
| Competitive local routing with constraints (available as arXiv preprint) | 2018-06-05 | Paper |
| New and improved spanning ratios for Yao graphs Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Weight Balancing on Boundaries and Skeletons Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Flipping edge-labelled triangulations Computational Geometry | 2018-02-19 | Paper |
| Continuous Yao graphs Computational Geometry | 2018-02-12 | Paper |
| Flips in edge-labelled pseudo-triangulations Computational Geometry | 2018-01-22 | Paper |
| Constrained routing between non-visible vertices Lecture Notes in Computer Science | 2017-10-23 | Paper |
| Dynamic graph coloring Lecture Notes in Computer Science | 2017-09-22 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
| Gabriel triangulations and angle-monotone graphs: local routing and recognition Lecture Notes in Computer Science | 2017-02-21 | Paper |
| Towards tight bounds on theta-graphs: more is not always better Theoretical Computer Science | 2016-01-21 | Paper |
| Competitive local routing with constraints Algorithms and Computation | 2016-01-11 | Paper |
| Optimal local routing on Delaunay triangulations defined by empty equilateral triangles SIAM Journal on Computing | 2015-11-18 | Paper |
| Reprint of: Theta-3 is connected Computational Geometry | 2015-04-27 | Paper |
| The \(\varTheta_5\)-graph is a spanner Computational Geometry | 2015-03-06 | Paper |
| On the number of regular edge labelings Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
| Theta-3 is connected Computational Geometry | 2014-08-13 | Paper |
| Making triangulations 4-connected using flips Computational Geometry | 2014-01-22 | Paper |
| The \(\theta_5\)-graph is a spanner Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
| On the stretch factor of the theta-4 graph Lecture Notes in Computer Science | 2013-08-12 | Paper |
| On the spanning ratio of theta-graphs Lecture Notes in Computer Science | 2013-08-12 | Paper |
| A history of flips in combinatorial triangulations Lecture Notes in Computer Science | 2013-01-07 | Paper |
| On plane constrained bounded-degree spanners Lecture Notes in Computer Science | 2012-06-29 | Paper |
| On rectilinear partitions with minimum stabbing number Lecture Notes in Computer Science | 2011-08-12 | Paper |
| Optimizing regular edge labelings Graph Drawing | 2011-02-11 | Paper |
Research outcomes over time
This page was built for person: Sander Verdonschot
