default search action
Evan Shellshear
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Jayden Fitzsimon, Shrikant Agrawal, Kirti Khade, Evan Shellshear, Jonathon Allport, Archie C. Chapman:
A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation. IGTR 24(4): 2250015:1-2250015:29 (2022) - 2021
- [i1]S. Kate Devitt, Rachel Horne, Zena Assaad, Ellen Broad, Hanna Kurniawati, Beth Cardier, Andrew Scott, Seth Lazar, Maia Gould, Chelle Adamson, Charles Karl, Frank Schrever, Sue Keay, Kieran Tranter, Evan Shellshear, Dan Hunter, Mark Brady, Tom Putland:
Trust and Safety. CoRR abs/2104.06512 (2021) - 2020
- [c7]Evan Shellshear, Yi Li, Robert Bohlin, Johan S. Carlson:
Contact-based Bounding Volume Hierarchy for Assembly Tasks. ICRA 2020: 9185-9190 - [c6]Yi Li, Evan Shellshear, Robert Bohlin, Johan S. Carlson:
Construction of Bounding Volume Hierarchies for Triangle Meshes with Mixed Face Sizes. ICRA 2020: 9191-9195
2010 – 2019
- 2016
- [j9]David Eriksson, Evan Shellshear:
Fast exact shortest distance queries for massive point clouds. Graph. Model. 84: 28-37 (2016) - [j8]Evan Shellshear:
Space Boards: Combining Tangible Interfaces with the Surrounding Space via RGB-D Cameras. Int. J. Creative Interfaces Comput. Graph. 7(1): 40-56 (2016) - [c5]Linus Källberg, Evan Shellshear, Thomas Larsson:
An External Memory Algorithm for the Minimum Enclosing Ball Problem. VISIGRAPP (1: GRAPP) 2016: 83-90 - 2015
- [j7]Evan Shellshear, Rolf Berlin, Johan S. Carlson:
Maximizing Smart Factory Systems by Incrementally Updating Point Clouds. IEEE Computer Graphics and Applications 35(2): 62-69 (2015) - [c4]Evan Shellshear, Johan S. Carlson, Robert Bohlin, Sebastian Tafuri:
A multi-threaded memetic packing algorithm for the ISO luggage packing problem. CASE 2015: 1509-1514 - 2014
- [j6]Evan Shellshear, Sebastian Tafuri, Johan S. Carlson:
A multi-threaded algorithm for computing the largest non-colliding moving geometry. Comput. Aided Des. 49: 1-7 (2014) - [j5]Evan Shellshear:
1D sweep-and-prune self-collision detection for deforming cables. Vis. Comput. 30(5): 553-564 (2014) - [c3]David Eriksson, Evan Shellshear:
Approximate Distance Queries for Path-planning in Massive Point Clouds. ICINCO (2) 2014: 20-28 - [c2]Evan Shellshear, Robert Bohlin:
A Heuristic Framework for Path Planning the Largest Volume Object from a Start to Goal Configuration. ICINCO (2) 2014: 264-271 - 2013
- [j4]Evan Shellshear, Fadi Bitar, Ulf Assarsson:
PDQ: Parallel Distance Queries for deformable meshes. Graph. Model. 75(2): 69-78 (2013) - 2012
- [c1]Sebastian Tafuri, Evan Shellshear, Robert Bohlin, Johan S. Carlson:
Automatic collision free path planning in hybrid triangle and point models: a case study. WSC 2012: 282:1-282:11 - 2011
- [j3]Evan Shellshear:
A Note on Characterizing Core stability with Fuzzy Games. IGTR 13(1): 105-118 (2011) - 2010
- [j2]Evan Shellshear:
New apportionment Methods Using Simple Games. IGTR 12(3): 211-222 (2010)
2000 – 2009
- 2009
- [j1]Evan Shellshear, Peter Sudhölter:
On core stability, vital coalitions, and extendability. Games Econ. Behav. 67(2): 633-644 (2009)
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 21: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