default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn M. Boyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]John M. Boyer
:
Revising the Fellows-Kaschube $K_{3, 3}$ Search. J. Graph Algorithms Appl. 25(1): 513-520 (2021)
2010 – 2019
- 2019
- [c15]John M. Boyer:
On the Expressive Power of Declarative Constructs in Interactive Document Scripts. DocEng 2019: 6:1-6:10 - 2018
- [c14]John M. Boyer:
Natural language question answering in the financial domain. CASCON 2018: 189-200 - 2017
- [c13]John M. Boyer:
Federating natural language question answering services of a cognitive enterprise data platform. CASCON 2017: 241-246 - 2012
- [j5]John M. Boyer, Charles Wiecha, Rahul P. Akolkar:
Interactive Web Documents. Comput. Sci. Res. Dev. 27(2): 127-145 (2012) - [j4]John M. Boyer:
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm. J. Graph Algorithms Appl. 16(2): 381-410 (2012)
2000 – 2009
- 2009
- [c12]John M. Boyer, Charles Wiecha, Rahul P. Akolkar:
A REST protocol and composite format for interactive web documents. ACM Symposium on Document Engineering 2009: 139-148 - [c11]John M. Boyer, Charles Wiecha:
Enriching the interactive user experience of open document format. ACM Symposium on Document Engineering 2009: 153-156 - 2008
- [c10]John M. Boyer:
Interactive office documents: a new face for web 2.0 applications. ACM Symposium on Document Engineering 2008: 8-17 - [c9]John M. Boyer, Eric Dunn, Maureen Kraft, Jun S. H. Liu, Mihir R. Shah, He Feng Su, Saurabh Tiwari:
An office document mashup for document-centric business processes. ACM Symposium on Document Engineering 2008: 100-101 - 2005
- [j3]John M. Boyer:
Simple constant amortized time generation of fixed length numeric partitions. J. Algorithms 54(1): 31-39 (2005) - [c8]John M. Boyer:
A New Method for Efficiently Generating Planar Graph Visibility Representations. GD 2005: 508-511 - 2004
- [j2]John M. Boyer, Wendy J. Myrvold:
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. J. Graph Algorithms Appl. 8(3): 241-273 (2004) - [c7]John M. Boyer:
Additional PC-Tree Planarity Conditions. GD 2004: 82-88 - [c6]John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina:
Lempel, Even, and Cederbaum Planarity Method. WEA 2004: 129-144 - 2003
- [c5]John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista:
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. GD 2003: 25-36 - [c4]John M. Boyer:
Bulletproof business process automation: securing XML forms with document subset signatures. XML Security 2003: 104-111 - 2002
- [c3]John M. Boyer, Mikko Honkala:
The XForms Computation Engine: Rationale, Theory and Implementation Experience. IMSA 2002: 196-204 - 2001
- [b1]John M. Boyer:
Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. University of Victoria, Canada, 2001
1990 – 1999
- 1999
- [j1]Barclay Blair, John M. Boyer:
XFDL: Creating Electronic Commerce Transaction Records Using XML. Comput. Networks 31(11-16): 1611-1622 (1999) - [c2]John M. Boyer, Wendy J. Myrvold:
Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm. SODA 1999: 140-146 - 1990
- [c1]John M. Boyer:
Partition algorithms for the doubly linked list. ACM Southeast Regional Conference 1990: 234
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-04-25 05:58 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:
