default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBryan T. Wilkinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]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, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017)- 2016
- [j3]Timothy M. Chan, Bryan T. Wilkinson:
Adaptive and Approximate Orthogonal Range Counting. ACM Trans. Algorithms 12(4): 45:1-45:15 (2016) - [c9]Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson:
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. SoCG 2016: 63:1-63:15 - [i2]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, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - 2015
- [j2]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica 72(4): 901-913 (2015) - [c8]Mark de Berg, Constantinos Tsirogiannis, Bryan T. Wilkinson:
Fast computation of categorical richness on raster data sets and related problems. SIGSPATIAL/GIS 2015: 18:1-18:10 - 2014
- [j1]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. Theory Comput. Syst. 55(4): 719-741 (2014) - [c7]Bryan T. Wilkinson:
Amortized Bounds for Dynamic Orthogonal Range Reporting. ESA 2014: 842-856 - [c6]Peyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson:
Concurrent Range Reporting in Two-Dimensional Space. SODA 2014: 983-994 - 2013
- [c5]Timothy M. Chan, Bryan T. Wilkinson:
Adaptive and Approximate Orthogonal Range Counting. SODA 2013: 241-251 - [c4]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [i1]Peyman Afshani, Kevin Matulef, Bryan T. Wilkinson:
Property Testing on Linked Lists. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. STACS 2012: 290-301 - [c2]Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Minority Query in Arrays. SWAT 2012: 295-306 - 2011
- [c1]Timothy M. Chan, Bryan T. Wilkinson:
Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time. CCCG 2011
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-04 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
