John M. Boyer

Learn More
A graph is planar if it can be drawn on the plane with no crossing edges. There are several linear time planar embedding algorithms but all are considered by many to be quite complicated. This paper presents a new method for performing linear time planar graph embedding which avoids some of the complexities of previous approaches (including the need to rst(More)
The standard unit of work in the business process is the electronic form, which includes complex user interface designs, data gathering and validation, wizard-like behaviors and spreadsheet computations. This paper reports state-of-the-art digital signature methods used to help provide security, non-repudiation and auditability within complex electronic(More)
As the world wide web transforms from a vehicle of information dissemination and e-commerce transactions into a writable nexus of human collaboration, the Web 2.0 technologies at the forefront of the tranformation may be seen as special cases of a more general shift in the conceptual application model of the web. This paper recognizes the conceptual(More)
We present a simple pedagogical graph theoretical description of Lempel, Even, and Cederbaum (LEC) planarity method based on concepts due to Thomas. A linear-time implementation of LEC method using the PC-tree data structure of Shih and Hsu is provided and described in details. We report on an experimental study involving this implementation and other(More)
We present new O(n)-time methods for planar embedding and Kura-towski subgraph isolation that were inspired by the Booth-Lueker PQ-tree implementation of the Lempel-Even-Cederbaum vertex addition method. In this paper, we improve upon our conference proceedings formulation and upon the Shih-Hsu PC-tree, both of which perform comprehensive tests of planarity(More)
In this paper we give a new description of the planarity testing and embedding algorithm presented by Boyer and Myrvold [2]. Such a description gives, in our opinion, new insights on the combinatorial foundations of the algorithm. Especially, we give a detailed illustration of a fundamental phase of the algorithm, called walk-up. This phase is essential for(More)
In the race to transform the World Wide Web from a medium for information presentation to a medium for information exchange, the development of practices for ensuring the security, auditability, and non-repudiation of transactions that are well established in the paper-based world has not kept pace in the digital world. Existing Internet technology provides(More)
A graph is planar if it can be drawn on the plane with no crossing edges. There are several linear time planar embedding algorithms but ah are considered by many to be quite complicated. This paper presents a new method for performing linear time planar graph embedding which avoids some of the complexities of previous approaches (including the need to first(More)
Documents allow end-users to encapsulate information related to a collaborative business process into a package that can be saved, emailed, digitally signed, and used as the basis of interaction in an activity or an ad hoc workflow. While documents are used incidentally today in web applications, for example in HTML presentations of content stored otherwise(More)