Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. - Timothy M. Chan; Bryan T. Wilkinson (CCCG, 2011)

Morphing Planar Graph Drawings with a Polynomial Number of Steps. - Soroush Alamdari; Patrizio Angelini; Timothy M. Chan; Giuseppe Di Battista; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; Bryan T. Wilkinson (SODA, 2013)

Property Testing on Linked Lists. - Peyman Afshani; Kevin Matulef; Bryan T. Wilkinson (Electron. Colloquium Comput. Complex., 2013)

Amortized Bounds for Dynamic Orthogonal Range Reporting. - Bryan T. Wilkinson (ESA, 2014)

Concurrent Range Reporting in Two-Dimensional Space. - Peyman Afshani; Cheng Sheng 001; Yufei Tao 001; Bryan T. Wilkinson (SODA, 2014)

Linear-Space Data Structures for Range Mode Query in Arrays. - Timothy M. Chan; Stephane Durocher; Kasper Green Larsen; Jason Morrison; Bryan T. Wilkinson (Theory Comput. Syst., 2014)

Fast computation of categorical richness on raster data sets and related problems. - Mark de Berg; Constantinos Tsirogiannis; Bryan T. Wilkinson (SIGSPATIAL/GIS, 2015)

Linear-Space Data Structures for Range Minority Query in Arrays. - Timothy M. Chan; Stephane Durocher; Matthew Skala; Bryan T. Wilkinson (Algorithmica, 2015)

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. - Juyoung Yon; Sang Won Bae 001; Siu-Wing Cheng; Otfried Cheong; Bryan T. Wilkinson (SoCG, 2016)

Adaptive and Approximate Orthogonal Range Counting. - Timothy M. Chan; Bryan T. Wilkinson (ACM Trans. Algorithms, 2016)

How to Morph Planar Graph Drawings. - Soroush Alamdari; Patrizio Angelini; Fidel Barrera-Cruz; Timothy M. Chan; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Penny Haxell; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; et al. (SIAM J. Comput., 2017)