| How to morph planar graph drawings S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ... SIAM Journal on Computing 46 (2), 824-852, 2017 | 50 | 2017 |
| Adaptive and approximate orthogonal range counting TM Chan, BT Wilkinson ACM Transactions on Algorithms (TALG) 12 (4), 1-15, 2016 | 41 | 2016 |
| Linear-space data structures for range mode query in arrays TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson Theory of Computing Systems 55 (4), 719-741, 2014 | 41 | 2014 |
| Morphing planar graph drawings with a polynomial number of steps S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ... Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 36 | 2013 |
| Linear-space data structures for range minority query in arrays TM Chan, S Durocher, M Skala, BT Wilkinson Scandinavian Workshop on Algorithm Theory, 295-306, 2012 | 27 | 2012 |
| Linear-space data structures for range mode query in arrays TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 290-301, 2012 | 26 | 2012 |
| A gold standard for scalar adjectives B Wilkinson, O Tim Proceedings of the Tenth International Conference on Language Resources and …, 2016 | 16 | 2016 |
| Amortized bounds for dynamic orthogonal range reporting BT Wilkinson Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 8 | 2014 |
| Concurrent range reporting in two-dimensional space P Afshani, C Sheng, Y Tao, BT Wilkinson Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014 | 7 | 2014 |
| Identifying and ordering scalar adjectives using lexical substitution B Wilkinson University of Maryland, Baltimore County, 2017 | 5 | 2017 |
| Approximating convex shapes with respect to symmetric difference under homotheties J Yon, SW Bae, SW Cheng, O Cheong, BT Wilkinson 32nd International Symposium on Computational Geometry (SoCG 2016), 2016 | 4 | 2016 |
| Adaptive range counting and other frequency-based range query problems BT Wilkinson University of Waterloo, 2012 | 3 | 2012 |
| Bichromatic line segment intersection counting in o (n√ log n) time TM Chan, BT Wilkinson 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011, 2011 | 3 | 2011 |
| Fast computation of categorical richness on raster data sets and related problems M de Berg, C Tsirogiannis, BT Wilkinson Proceedings of the 23rd SIGSPATIAL International Conference on Advances in …, 2015 | 1 | 2015 |
| Initial Steps for Building a Lexicon of Adjectives with Scalemates B Wilkinson Proceedings of the 2015 Conference of the North American Chapter of the …, 2015 | 1 | 2015 |
| Exploring the problem space of orthogonal range searching BT Wilkinson Department of Computer Science, Aarhus University, 2015 | 1 | 2015 |
| Property testing on linked lists P Afshani, K Matulef, BT Wilkinson Electronic Colloquium on Computational Complexity, 2013 | 1 | 2013 |
| Revisiting visibility in the plane BT Wilkinson International Symposium on Computational Geometry, 2015 | | 2015 |
| Bichromatic Line Segment Intersection Counting in O (n TM Chan, BT Wilkinson | | 2011 |
| Soroush Alamdari MML Walk, M Vatshelle, H Vosoughpour, BT Wilkinson Cell 2, 2C6, 0 | | |
