2008 |
13 | EE | 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 |
12 | EE | John M. Boyer:
Interactive office documents: a new face for web 2.0 applications.
ACM Symposium on Document Engineering 2008: 8-17 |
2005 |
11 | EE | John M. Boyer:
A New Method for Efficiently Generating Planar Graph Visibility Representations.
Graph Drawing 2005: 508-511 |
10 | EE | John M. Boyer:
Simple constant amortized time generation of fixed length numeric partitions.
J. Algorithms 54(1): 31-39 (2005) |
2004 |
9 | EE | John M. Boyer:
Additional PC-Tree Planarity Conditions.
Graph Drawing 2004: 82-88 |
8 | EE | John M. Boyer,
Cristina G. Fernandes,
Alexandre Noma,
José Coelho de Pina:
Lempel, Even, and Cederbaum Planarity Method.
WEA 2004: 129-144 |
7 | EE | John M. Boyer,
Wendy J. Myrvold:
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition.
J. Graph Algorithms Appl. 8(2): 241-273 (2004) |
2003 |
6 | EE | 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.
Graph Drawing 2003: 25-36 |
5 | EE | John M. Boyer:
Bulletproof business process automation: securing XML forms with document subset signatures.
XML Security 2003: 104-111 |
2002 |
4 | | John M. Boyer,
Mikko Honkala:
The XForms Computation Engine: Rationale, Theory and Implementation Experience.
IMSA 2002: 196-204 |
1999 |
3 | EE | 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 |
2 | EE | Barclay Blair,
John M. Boyer:
XFDL: Creating Electronic Commerce Transaction Records Using XML.
Computer Networks 31(11-16): 1611-1622 (1999) |
1990 |
1 | EE | John M. Boyer:
Partition algorithms for the doubly linked list.
ACM Southeast Regional Conference 1990: 234 |