André van Renssen - Google Scholar Citations

Cited by

	All	Since 2015
Citations	411	330
h-index	13	11
i10-index	17	17

100

20112012201320142015201620172018201920205 6 15 46 57 47 45 81 94 1

Co-authors

Prosenjit BoseCarleton UniversityVerified email at scs.carleton.ca
Sander VerdonschotShopifyVerified email at cg.scs.carleton.ca
Matias KormanTufts UniversityVerified email at dais.is.tohoku.ac.jp
Marcel RoeloffzenTU EindhovenVerified email at tue.nl
Jean-Lou De CarufelAssistant Professor of Computer Science, University of OttawaVerified email at uottawa.ca
Perouz TaslakianElement AIVerified email at elementai.com
Pat MorinCarleton UniversityVerified email at scs.carleton.ca
Man-Kwun ChiuNational Institute of InformaticsVerified email at nii.ac.jp
Paul SeiferthFreie Universität BerlinVerified email at inf.fu-berlin.de
Yannik SteinFree University BerlinVerified email at fu-berlin.de
Sang Won BaeKyonggi UniversityVerified email at kgu.ac.kr
Yago DiezAssociate Professor, Yamagata UniversityVerified email at sci.kj.yamagata-u.ac.jp
Wah Loon KengLafayette CollegeVerified email at lafayette.edu
Ge XiaLafayette CollegeVerified email at lafayette.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeVerified email at cs.smith.edu
Wouter MeulemansEindhoven University of TechnologyVerified email at tue.nl
Ljubomir PerkovićProfessor, School of Computing, DePaul UniversityVerified email at cs.depaul.edu
Nicolas BonichonMaître de conférences, Université de BordeauxVerified email at labri.fr
Jean-François BaffierJSPS Post-Doctoral Fellow (Tokyo Institute of Technology)Verified email at m.titech.ac.jp
Valia MitsouResearch Institute on the Foundations of Computer Science (IRIF) and Paris Diderot UniversityVerified email at liris.cnrs.fr

André van Renssen

University of Sydney

Verified email at sydney.edu.au - Homepage

Algorithms Computational Geometry Discrete Geometry Graph Theory


Title	Cited by	Year
New and improved spanning ratios for Yao graphs L Barba, P Bose, M Damian, R Fagerberg, WL Keng, J O'Rourke, ... Proceedings of the thirtieth annual symposium on Computational geometry, 30, 2014	31	2014
Competitive Routing in the Half-θ₆-Graph P Bose, R Fagerberg, A Van Renssen, S Verdonschot Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	28	2012
Area-preserving subdivision schematization W Meulemans, A van Renssen, B Speckmann International Conference on Geographic Information Science, 160-174, 2010	26	2010
The θ5-graph is a spanner P Bose, P Morin, A Van Renssen, S Verdonschot Computational Geometry 48 (2), 108-119, 2015	25	2015
On the spanning ratio of theta-graphs P Bose, A Van Renssen, S Verdonschot Workshop on Algorithms and Data Structures, 182-194, 2013	24	2013
On plane constrained bounded-degree spanners P Bose, R Fagerberg, A Van Renssen, S Verdonschot Algorithmica 81 (4), 1392-1415, 2019	23	2019
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles P Bose, R Fagerberg, A Van Renssen, S Verdonschot SIAM Journal on Computing 44 (6), 1626-1649, 2015	21	2015
On the stretch factor of the Theta-4 graph L Barba, P Bose, JL De Carufel, A Van Renssen, S Verdonschot Workshop on Algorithms and Data Structures, 109-120, 2013	21	2013
Hanabi is np-hard, even for cheaters who look at their cards JF Baffier, MK Chiu, Y Diez, M Korman, V Mitsou, A Van Renssen, ... arXiv preprint arXiv:1603.01911, 2016	20	2016
Dynamic graph coloring L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ... Workshop on Algorithms and Data Structures, 97-108, 2017	17	2017
Making triangulations 4-connected using flips P Bose, D Jansens, A Van Renssen, M Saumell, S Verdonschot Computational geometry 47 (2), 187-197, 2014	17	2014
Optimal Bounds on Theta-Graphs: More is not Always Better. P Bose, JL De Carufel, P Morin, A Van Renssen, S Verdonschot CCCG, 291-296, 2012	17	2012
Time–space trade-offs for triangulations and Voronoi diagrams M Korman, W Mulzer, A Van Renssen, M Roeloffzen, P Seiferth, Y Stein Computational Geometry 73, 35-45, 2018	15	2018
Upper and lower bounds for online routing on delaunay triangulations N Bonichon, P Bose, JL De Carufel, L Perković, A Van Renssen Discrete & Computational Geometry 58 (2), 482-504, 2017	11	2017
Competitive local routing with constraints P Bose, R Fagerberg, A Van Renssen, S Verdonschot International Symposium on Algorithms and Computation, 23-34, 2015	11	2015
Towards tight bounds on theta-graphs: More is not always better P Bose, JL De Carufel, P Morin, A van Renssen, S Verdonschot Theoretical Computer Science 616, 70-93, 2016	10	2016
Time-Space Trade-off Algorithms for Triangulating a Simple Polygon B Aronov, M Korman, S Pratt, A Van Renssen, M Roeloffzen arXiv preprint arXiv:1509.07669, 2015	10	2015
Upper bounds on the spanning ratio of constrained theta-graphs P Bose, A Van Renssen Latin American Symposium on Theoretical Informatics, 108-119, 2014	9	2014
Improved time-space trade-offs for computing Voronoi diagrams B Banyassady, M Korman, W Mulzer, A Van Renssen, M Roeloffzen, ... arXiv preprint arXiv:1708.00814, 2017	8	2017
Theta-3 is connected O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ... Computational geometry 47 (9), 910-917, 2014	8	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors