John A. Ellis

23 papers A* 2Journal 19Unranked 2
YearRankTypeTitle / Venue / Authors
2013 J jnl
In-place permuting and perfect shuffling using involutions.
Inf. Process. Lett.
Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
2012 J jnl
Parallel and sequential in-place permuting and perfect shuffling using involutions
CoRR
Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
2004 J jnl
Computing the vertex separation of unicyclic graphs.
Inf. Comput.
John A. Ellis, Minko Markov
2004 J jnl
The dominating set problem is fixed parameter tractable for graphs of bounded genus.
J. Algorithms
John A. Ellis, Hongbing Fan, Michael R. Fellows
2003 J jnl
Euclidean strings.
Theor. Comput. Sci.
John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
2003 J jnl
Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes.
SIAM J. Comput.
John A. Ellis, Stirling Chow, Dennis Manke
2002 J jnl
The Cycles of the Multiway Perfect Shuffle Permutation.
Discret. Math. Theor. Comput. Sci.
John A. Ellis, Hongbing Fan, Jeffrey O. Shallit
2002 — conf
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.
SWAT
John A. Ellis, Hongbing Fan, Michael R. Fellows
2000 J jnl
Computing the cycles in the perfect shuffle permutation.
Inf. Process. Lett.
John A. Ellis, Tobias Krahn, Hongbing Fan
2000 J jnl
In situ, Stable Merging by Way of the Perfect Shuffle.
Comput. J.
John A. Ellis, Minko Markov
1998 J jnl
Addendum to "Embedding Grids into Grids: Dilation Four Suffices".
Parallel Process. Lett.
John A. Ellis
1998 J jnl
Embedding Grids into Grids: Dilation Four Suffices.
Parallel Process. Lett.
John A. Ellis, Minko Markov
1996 J jnl
Embedding grids into grids: Techniques for large compression ratios.
Networks
John A. Ellis
1994 J jnl
Serial and Parallel Algorithms for (k, 2)-Partite Graphs.
J. Parallel Distributed Comput.
John A. Ellis, Manrique Mata-Montero, Hausi A. Müller
1994 J jnl
The Vertex Separation and Search Number of a Graph
Inf. Comput.
John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner
1992 J jnl
Edge colouring line graphs of unicyclic graphs.
Discret. Appl. Math.
Leizhen Cai, John A. Ellis
1992 A* ed.
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada
STOC
S. Rao Kosaraju, Mike Fellows, Avi Wigderson, John A. Ellis
1991 J jnl
Embedding Rectangular Grids into Square Grids.
IEEE Trans. Computers
John A. Ellis
1991 J jnl
NP-completeness of edge-colouring some restricted graphs.
Discret. Appl. Math.
Leizhen Cai, John A. Ellis
1989 J jnl
A Las Vegas Graph Colouring Algorithm.
Comput. J.
John A. Ellis, P. M. Lepolesa
1989 J jnl
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.
Inf. Process. Lett.
John A. Ellis, Manrique Mata, Gary MacGillivray
1989 A* conf
On the Complexity of Fixed Parameter Problems (Extended Abstract)
FOCS
Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata
1988 — conf
Embedding Rectangular Grids into Square Grids.
AWOC
John A. Ellis