John A. Ellis

According to our database, John A. Ellis authored at least 20 papers between 1988 and 2013.

Collaborative distances:

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

2013

In-place permuting and perfect shuffling using involutions.

Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey

Inf. Process. Lett., 2013

2012

Parallel and sequential in-place permuting and perfect shuffling using involutions

Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey

CoRR, 2012

2004

Computing the vertex separation of unicyclic graphs.

John A. Ellis, Minko Markov

Inf. Comput., 2004

2003

Euclidean strings.

John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson

Theor. Comput. Sci., 2003

Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes.

John A. Ellis, Stirling Chow, Dennis Manke

SIAM J. Comput., 2003

2002

The Cycles of the Multiway Perfect Shuffle Permutation.

John A. Ellis, Hongbing Fan, Jeffrey O. Shallit

Discret. Math. Theor. Comput. Sci., 2002

The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.

John A. Ellis, Hongbing Fan, Michael R. Fellows

Proceedings of the Algorithm Theory, 2002

2000

Computing the cycles in the perfect shuffle permutation.

John A. Ellis, Tobias Krahn, Hongbing Fan

Inf. Process. Lett., 2000

In situ, Stable Merging by Way of the Perfect Shuffle.

John A. Ellis, Minko Markov

Comput. J., 2000

1998

Embedding Grids into Grids: Dilation Four Suffices.

John A. Ellis, Minko Markov

Parallel Process. Lett., 1998

Addendum to "Embedding Grids into Grids: Dilation Four Suffices".

John A. Ellis

Parallel Process. Lett., 1998

1996

Embedding grids into grids: Techniques for large compression ratios.

John A. Ellis

Networks, 1996

1994

The Vertex Separation and Search Number of a Graph

John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner

Inf. Comput., August, 1994

Serial and Parallel Algorithms for (k, 2)-Partite Graphs.

John A. Ellis, Manrique Mata-Montero, Hausi A. Müller

J. Parallel Distributed Comput., 1994

1992

Edge colouring line graphs of unicyclic graphs.

Leizhen Cai, John A. Ellis

Discret. Appl. Math., 1992

1991

NP-completeness of edge-colouring some restricted graphs.

Leizhen Cai, John A. Ellis

Discret. Appl. Math., 1991

1989

A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.

John A. Ellis, Manrique Mata, Gary MacGillivray

Inf. Process. Lett., 1989

A Las Vegas Graph Colouring Algorithm.

John A. Ellis, P. M. Lepolesa

Comput. J., 1989

On the Complexity of Fixed Parameter Problems (Extended Abstract)

Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Embedding Rectangular Grids into Square Grids.

John A. Ellis

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988