default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin A. Wortman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j4]Ayaan M. Kazerouni
, Melissa Lee, Aleata Hubbard Cheuoua, Aakash Gautam, Sahar Hooshmand, Paul Salvador Inventado, Eun-Young Kang, Jane Lehr, Yu Sun, Kevin A. Wortman, Ilmi Yoon, Zoë J. Wood:
The Benefits of Socially Responsible Computing in Early Computing Courses: A Multi-Institutional Study at Primarily Undergraduate Hispanic-Serving Institutions. ACM Trans. Comput. Educ. 25(2): 1-24 (2025)- [c9]Kevin A. Wortman, Aakash Gautam, Sarah Hug, Paul Salvador Inventado, Ayaan M. Kazerouni, Jane Lehr, Kanika Sood, Zoë J. Wood:
Reflecting on Practices to Integrate Socially Responsible Computing in Introductory Computer Science Courses. SIGCSE (1) 2025: 1253-1259 - 2021
- [c8]Shekhar Palit, Kevin A. Wortman:
Perfect Tabular Hashing in Pseudolinear Time. CCWC 2021: 228-232 - [c7]Kevin A. Wortman, Nicholas Smith:
CombinoChord: A Guitar Chord Generator App. CCWC 2021: 785-789 - 2020
- [c6]Coleman Nugent, Kevin A. Wortman:
Crumple Trees. CCWC 2020: 31-37
2010 – 2019
- 2012
- [c5]Jeffrey M. White, Kevin A. Wortman:
Divide-and-Conquer 3D Convex Hulls on the GPU. CCCG 2012: 137-142 - [i6]Jeffrey M. White, Kevin A. Wortman:
Divide-and-Conquer 3D Convex Hulls on the GPU. CoRR abs/1205.1171 (2012) - 2011
- [j3]David Eppstein, Kevin A. Wortman:
Optimal Angular Resolution for Face-Symmetric Drawings. J. Graph Algorithms Appl. 15(4): 551-564 (2011) - 2010
- [j2]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. Discret. Math. Algorithms Appl. 2(4): 553-566 (2010) - [c4]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. COCOON 2010: 90-99 - [c3]Matthew Dickerson, David Eppstein, Kevin A. Wortman:
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22
2000 – 2009
- 2009
- [c2]David Eppstein, Kevin A. Wortman:
Optimal Embedding into Star Metrics. WADS 2009: 290-301 - [i5]David Eppstein, Kevin A. Wortman:
Optimal Embedding Into Star Metrics. CoRR abs/0905.0283 (2009) - [i4]David Eppstein, Kevin A. Wortman:
Optimal Angular Resolution for Face-Symmetric Drawings. CoRR abs/0907.5474 (2009) - 2008
- [i3]Matthew Dickerson, David Eppstein, Kevin A. Wortman:
Dilation, smoothed distance, and minimization diagrams of convex functions. CoRR abs/0812.0607 (2008) - 2007
- [j1]David Eppstein, Kevin A. Wortman:
Minimum dilation stars. Comput. Geom. 37(1): 27-37 (2007) - 2006
- [i2]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. CoRR abs/cs/0602029 (2006) - 2005
- [c1]David Eppstein, Kevin A. Wortman:
Minimum dilation stars. SCG 2005: 321-326 - 2004
- [i1]David Eppstein, Kevin A. Wortman:
Minimum Dilation Stars. CoRR abs/cs/0412025 (2004)
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 2025-11-22 05:33 CET 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:
