default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames D. Palmer 0002
Person information
- affiliation: Northern Arizona University, Flagstaff, AZ, USA
- affiliation (PhD): University of Texas at Dallas, Richardson, TX, USA
Other persons with the same name
- James D. Palmer 0001 — George Mason University, Fairfax, VA, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Jun Rao, James D. Palmer:
Logarithmic rubric scoring. J. Comput. Sci. Coll. 36(7): 20-26 (2021)
2010 – 2019
- 2019
- [c13]James D. Palmer, Nakai McAddis:
Documentation as a cross-cutting concern of software. SIGDOC 2019: 18:1-18:7 - 2016
- [c12]John C. Georgas
, James D. Palmer, Michael J. McCormick:
Supporting Software Architecture Learning Using Runtime Visualization. CSEE&T 2016: 101-110 - 2010
- [c11]James Dean Palmer:
Ficticious: MicroLanguages for interactive fiction. SPLASH/OOPSLA Companion 2010: 61-68
2000 – 2009
- 2009
- [j2]Ovidiu Daescu, James D. Palmer:
Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geom. Appl. 19(1): 33-57 (2009) - [j1]Ovidiu Daescu, Yam Ki Cheung, James D. Palmer:
Parallel Optimal Weighted Links. Trans. Comput. Sci. 3: 66-81 (2009) - [c10]James Dean Palmer:
Ginger: implementing a new Lisp family syntax. ACM Southeast Regional Conference 2009 - [c9]James Dean Palmer, Eddie Hillenbrand:
Reimagining literate programming. OOPSLA Companion 2009: 1007-1014 - 2008
- [p2]Ovidiu Daescu, James D. Palmer:
Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. Generalized Voronoi Diagram 2008: 215-232 - [p1]James D. Palmer:
Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization. Generalized Voronoi Diagram 2008: 267-283 - 2007
- [c8]James D. Palmer:
High Order Voronoi Sculpture. ISVD 2007: 110-116 - [c7]James D. Palmer:
Exploiting bibliographic web services with CiTeX. SAC 2007: 1673-1676 - 2006
- [c6]Ovidiu Daescu, James D. Palmer:
Finding optimal weighted bridges with applications. ACM Southeast Regional Conference 2006: 12-17 - [c5]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. SCG 2006: 483-484 - [c4]James Dean Palmer:
Using Line and Texture to Visualize Higher-Order Voronoi Diagrams. ISVD 2006: 166-172 - [c3]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR 2006: 187-202 - 2005
- [c2]Ovidiu Daescu, James D. Palmer:
1-link shortest paths in weighted regions. SCG 2005: 378-379 - [c1]Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap:
k-Link Shortest Paths in Weighted Subdivisions. WADS 2005: 325-337
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-05-18 21:29 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:
