John M. Boyer - RankMe

22 papers A* 1A 3B 5Journal 6Unranked 6

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Revising the Fellows-Kaschube $K_{3, 3}$ Search. J. Graph Algorithms Appl. John M. Boyer
2019	B	`conf`	On the Expressive Power of Declarative Constructs in Interactive Document Scripts. DocEng John M. Boyer
2018	—	`conf`	Natural language question answering in the financial domain. CASCON John M. Boyer
2017	—	`conf`	Federating natural language question answering services of a cognitive enterprise data platform. CASCON John M. Boyer
2012	J	`jnl`	Interactive Web Documents. Comput. Sci. Res. Dev. John M. Boyer, Charles Wiecha, Rahul P. Akolkar
2012	J	`jnl`	Subgraph Homeomorphism via the Edge Addition Planarity Algorithm. J. Graph Algorithms Appl. John M. Boyer
2009	B	`conf`	A REST protocol and composite format for interactive web documents. ACM Symposium on Document Engineering John M. Boyer, Charles Wiecha, Rahul P. Akolkar
2009	B	`conf`	Enriching the interactive user experience of open document format. ACM Symposium on Document Engineering John M. Boyer, Charles Wiecha
2008	B	`conf`	An office document mashup for document-centric business processes. ACM Symposium on Document Engineering John M. Boyer, Eric Dunn, Maureen Kraft, Jun S. H. Liu, Mihir R. Shah, He Feng Su, Saurabh Tiwari
2008	B	`conf`	Interactive office documents: a new face for web 2.0 applications. ACM Symposium on Document Engineering John M. Boyer
2005	A	`conf`	A New Method for Efficiently Generating Planar Graph Visibility Representations. GD John M. Boyer
2005	J	`jnl`	Simple constant amortized time generation of fixed length numeric partitions. J. Algorithms John M. Boyer
2004	A	`conf`	Additional PC-Tree Planarity Conditions. GD John M. Boyer
2004	—	`conf`	Lempel, Even, and Cederbaum Planarity Method. WEA John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina
2004	J	`jnl`	On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. J. Graph Algorithms Appl. John M. Boyer, Wendy J. Myrvold
2003	—	`conf`	Bulletproof business process automation: securing XML forms with document subset signatures. XML Security John M. Boyer
2003	A	`conf`	Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. GD John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista
2002	—	`conf`	The XForms Computation Engine: Rationale, Theory and Implementation Experience. IMSA John M. Boyer, Mikko Honkala
2001	—	`—`	Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. John M. Boyer
1999	A*	`conf`	Stop Minding Your p's and q's: A Simplified SODA John M. Boyer, Wendy J. Myrvold
1999	J	`jnl`	XFDL: Creating Electronic Commerce Transaction Records Using XML. Comput. Networks Barclay Blair, John M. Boyer
1990	—	`conf`	Partition algorithms for the doubly linked list. ACM Southeast Regional Conference John M. Boyer