default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames King 0001
Person information
- affiliation: Imperial College London, Department of Mathematics, UK
- affiliation: McGill University, School of Computer Science, Montreal, Canada
Other persons with the same name
- James King — disambiguation page
- James King 0002 — Queen Mary University of London, Department of Computer Science, UK
- James King 0004 — University of Calgary, Department of Computer Science, Canada
- James King 0005 — Software Education, Sydney, Australia
- James King 0006 — Central Research Laboratories, Hayes, Middlesex, UK
- James King 0007 — University of Utah, Salt Lake City, UT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Luc Devroye, James King:
Random hyperplane search trees in high dimensions. J. Comput. Geom. 6(1): 142-164 (2015)- 2013
- [j5]James King:
Fast vertex guarding for polygons with and without holes. Comput. Geom. 46(3): 219-231 (2013) - 2011
- [j4]James King, David G. Kirkpatrick:
Improved Approximation for Guarding Simple Galleries from the Perimeter. Discret. Comput. Geom. 46(2): 252-269 (2011) - [j3]James King, Erik Krohn:
Terrain Guarding is NP-Hard. SIAM J. Comput. 40(5): 1316-1339 (2011) - [i6]James King:
Fast Vertex Guarding for Polygons. CoRR abs/1101.3297 (2011) - [i5]Luc Devroye, James King:
Random hyperplane search trees in high dimensions. CoRR abs/1106.0461 (2011) - 2010
- [j2]Christina Boucher, James King:
Fast motif recognition via application of statistical thresholds. BMC Bioinform. 11(S-1): 11 (2010) - [c3]James King, Erik Krohn:
Terrain Guarding is NP-Hard. SODA 2010: 1580-1593 - [i4]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i3]James King, David G. Kirkpatrick:
Improved Approximation for Guarding Simple Galleries from the Perimeter. CoRR abs/1001.4231 (2010) - [i2]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010)
2000 – 2009
- 2009
- [j1]Luc Devroye, James King, Colin McDiarmid:
Random Hyperplane Search Trees. SIAM J. Comput. 38(6): 2411-2425 (2009) - [i1]James King, Erik Krohn:
The Complexity of Guarding Terrains. CoRR abs/0907.1280 (2009) - 2008
- [c2]James King:
VC-Dimension of Visibility on Terrains. CCCG 2008 - 2006
- [c1]James King:
A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains. LATIN 2006: 629-640
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-08-05 20:20 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:
