André van Renssen

According to our database1, André van Renssen
  • authored at least 78 papers between 2010 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Routing on the Visibility Graph.
CoRR, 2018

Continuous Yao graphs.
Comput. Geom., 2018

2017
Hanabi is NP-hard, even for cheaters who look at their cards.
Theor. Comput. Sci., 2017

On interference among moving sensors and related problems.
JoCG, 2017

Competitive local routing with constraints.
JoCG, 2017

Time-space trade-offs for triangulating a simple polygon.
JoCG, 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.
Discrete & Computational Geometry, 2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain.
CoRR, 2017

Constrained Routing Between Non-Visible Vertices.
CoRR, 2017

Balanced Line Separators of Unit Disk Graphs.
CoRR, 2017

Dynamic Graph Coloring.
CoRR, 2017

Improved Time-Space Trade-offs for Computing Voronoi Diagrams.
CoRR, 2017

Routing in Polygons with Holes.
CoRR, 2017

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
CoRR, 2017

On Plane Constrained Bounded-Degree Spanners.
CoRR, 2017

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.
CoRR, 2017

Balanced Line Separators of Unit Disk Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Dynamic Graph Coloring.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Routing on the Visibility Graph.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Routing in Polygonal Domains.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Constrained Routing Between Non-Visible Vertices.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Snipperclips: Cutting Tools into Desired Polygons using Themselves.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Area-Preserving Simplification and Schematization of Polygonal Subdivisions.
ACM Trans. Spatial Algorithms and Systems, 2016

Towards tight bounds on theta-graphs: More is not always better.
Theor. Comput. Sci., 2016

The Price of Order.
Int. J. Comput. Geometry Appl., 2016

The Price of Order.
CoRR, 2016

Constrained Generalized Delaunay Graphs Are Plane Spanners.
CoRR, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
CoRR, 2016

Time-Space Trade-offs for Triangulating a Simple Polygon.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

On Interference Among Moving Sensors and Related Problems.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.
SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.
JoCG, 2015

Time-Space Trade-offs for Triangulations and Voronoi Diagrams.
CoRR, 2015

On Kinetic Range Spaces and their Applications.
CoRR, 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.
CoRR, 2015

Time-Space Trade-offs for Triangulating a Simple Polygon.
CoRR, 2015

The θ5-graph is a spanner.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

Time-Space Trade-offs for Triangulations and Voronoi Diagrams.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Competitive Local Routing with Constraints.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.
Proceedings of the Algorithms - ESA 2015, 2015

Constrained Empty-Rectangle Delaunay Graphs.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs.
CoRR, 2014

Competitive Local Routing with Constraints.
CoRR, 2014

Optimal local routing on Delaunay triangulations defined by empty equilateral triangles.
CoRR, 2014

Towards Tight Bounds on Theta-Graphs.
CoRR, 2014

Continuous Yao Graphs.
CoRR, 2014

Theta-3 is connected.
CoRR, 2014

Making triangulations 4-connected using flips.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Price of Order.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

New and Improved Spanning Ratios for Yao Graphs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

On the Spanning Ratio of Constrained Yao-Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Continuous Yao Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On the stretch factor of the Theta-4 graph
CoRR, 2013

New and Improved Spanning Ratios for Yao Graphs.
CoRR, 2013

The θ 5-Graph is a Spanner.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On the Spanning Ratio of Theta-Graphs.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Stretch Factor of the Theta-4 Graph.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Theta-3 is connected.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
The theta-5-graph is a spanner
CoRR, 2012

Competitive routing in the half-θ6-graph.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On Plane Constrained Bounded-Degree Spanners.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Optimal Bounds on Theta-Graphs: More is not Always Better.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Making triangulations 4-connected using flips
CoRR, 2011

The 2x2 Simple Packing Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Making triangulations 4-connected using flips.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Area-Preserving Subdivision Schematization.
Proceedings of the Geographic Information Science, 6th International Conference, 2010


  Loading...