John M. Boyer

According to our database, John M. Boyer authored at least 22 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Revising the Fellows-Kaschube $K_{3, 3}$ Search.

John M. Boyer

J. Graph Algorithms Appl., 2021

2019

On the Expressive Power of Declarative Constructs in Interactive Document Scripts.

John M. Boyer

Proceedings of the ACM Symposium on Document Engineering 2019, 2019

2018

Natural language question answering in the financial domain.

John M. Boyer

Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering, 2018

2017

Federating natural language question answering services of a cognitive enterprise data platform.

John M. Boyer

Proceedings of the 27th Annual International Conference on Computer Science and Software Engineering, 2017

2012

Subgraph Homeomorphism via the Edge Addition Planarity Algorithm.

John M. Boyer

J. Graph Algorithms Appl., 2012

Interactive Web Documents.

John M. Boyer, Charles Wiecha, Rahul P. Akolkar

Comput. Sci. Res. Dev., 2012

2009

A REST protocol and composite format for interactive web documents.

John M. Boyer, Charles Wiecha, Rahul P. Akolkar

Proceedings of the 2009 ACM Symposium on Document Engineering, 2009

Enriching the interactive user experience of open document format.

John M. Boyer, Charles Wiecha

Proceedings of the 2009 ACM Symposium on Document Engineering, 2009

2008

An office document mashup for document-centric business processes.

John M. Boyer, Eric Dunn, Maureen Kraft, Jun S. H. Liu, Mihir R. Shah, He Feng Su, Saurabh Tiwari

Proceedings of the 2008 ACM Symposium on Document Engineering, 2008

Interactive office documents: a new face for web 2.0 applications.

John M. Boyer

Proceedings of the 2008 ACM Symposium on Document Engineering, 2008

2005

Simple constant amortized time generation of fixed length numeric partitions.

John M. Boyer

J. Algorithms, 2005

A New Method for Efficiently Generating Planar Graph Visibility Representations.

John M. Boyer

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition.

John M. Boyer, Wendy J. Myrvold

J. Graph Algorithms Appl., 2004

Lempel, Even, and Cederbaum Planarity Method.

John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Additional PC-Tree Planarity Conditions.

John M. Boyer

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Bulletproof business process automation: securing XML forms with document subset signatures.

John M. Boyer

Proceedings of the 2003 ACM Workshop on XML Security, Fairfax, VA, USA, October 31, 2003, 2003

Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.

John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

The XForms Computation Engine: Rationale, Theory and Implementation Experience.

John M. Boyer, Mikko Honkala

Proceedings of the Internet and Multimedia Systems and Applications, 2002

2001

Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.

John M. Boyer

PhD thesis, 2001

1999

XFDL: Creating Electronic Commerce Transaction Records Using XML.

Barclay Blair, John M. Boyer

Comput. Networks, 1999

Stop Minding Your p's and q's: A Simplified <i>O</i>(<i>n</i>) Planar Embedding Algorithm.

John M. Boyer, Wendy J. Myrvold

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1990

Partition algorithms for the doubly linked list.

John M. Boyer

Proceedings of the 28th Annual Southeast Regional Conference, 1990