متابعة
André van Renssen
André van Renssen
University of Sydney
بريد إلكتروني تم التحقق منه على sydney.edu.au - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Area-preserving simplification and schematization of polygonal subdivisions‏
K Buchin, W Meulemans, AV Renssen, B Speckmann‏
ACM Transactions on Spatial Algorithms and Systems (TSAS) 2 (1), 1-36, 2016‏
502016
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers‏
HA Akitaya, EM Arkin, M Damian, ED Demaine, V Dujmović, R Flatland, ...‏
Algorithmica 83, 1316-1351, 2021‏
472021
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-39, 2014‏
472014
The θ5-graph is a spanner‏
P Bose, P Morin, A van Renssen, S Verdonschot‏
Computational Geometry 48 (2), 108-119, 2015‏
40*2015
On plane constrained bounded-degree spanners‏
P Bose, R Fagerberg, A van Renssen, S Verdonschot‏
Algorithmica 81, 1392-1415, 2019‏
362019
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‏
352016
Competitive Routing in the Half-θ6-Graph‏
P Bose, R Fagerberg, A van Renssen, S Verdonschot‏
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012‏
352012
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‏
332016
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‏
332015
Dynamic graph coloring‏
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...‏
Workshop on algorithms and data structures, 97-108, 2017‏
322017
On the stretch factor of the Theta-4 graph‏
L Barba, P Bose, JL De Carufel, A van Renssen, S Verdonschot‏
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013‏
322013
Area-preserving subdivision schematization‏
W Meulemans, A van Renssen, B Speckmann‏
Geographic Information Science: 6th International Conference, GIScience 2010 …, 2010‏
302010
Making triangulations 4-connected using flips‏
P Bose, D Jansens, A Van Renssen, M Saumell, S Verdonschot‏
Computational Geometry 47 (2), 187-197, 2014‏
282014
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, 482-504, 2017‏
242017
On the spanning ratio of theta-graphs‏
P Bose, A van Renssen, S Verdonschot‏
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013‏
232013
Dynamic graph coloring‏
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...‏
Algorithmica 81, 1319-1341, 2019‏
212019
Theta-3 is connected‏
O Aichholzer, SW Bae, L Barba, P Bose, M Korman, A Van Renssen, ...‏
Computational geometry 47 (9), 910-917, 2014‏
202014
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‏
192012
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‏
172018
Translation invariant Fréchet distance queries‏
J Gudmundsson, A van Renssen, Z Saeidi, S Wong‏
Algorithmica 83, 3514-3533, 2021‏
142021
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20