2004 |
18 | EE | John A. Ellis,
Minko Markov:
Computing the vertex separation of unicyclic graphs.
Inf. Comput. 192(2): 123-161 (2004) |
17 | EE | John A. Ellis,
Hongbing Fan,
Michael R. Fellows:
The dominating set problem is fixed parameter tractable for graphs of bounded genus.
J. Algorithms 52(2): 152-168 (2004) |
2003 |
16 | EE | John A. Ellis,
Stirling Chow,
Dennis Manke:
Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes.
SIAM J. Comput. 32(2): 386-407 (2003) |
15 | EE | John A. Ellis,
Frank Ruskey,
Joe Sawada,
Jamie Simpson:
Euclidean strings.
Theor. Comput. Sci. 1-3(301): 321-340 (2003) |
2002 |
14 | EE | John A. Ellis,
Hongbing Fan,
Michael R. Fellows:
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.
SWAT 2002: 180-189 |
13 | EE | John A. Ellis,
Hongbing Fan,
Jeffrey Shallit:
The Cycles of the Multiway Perfect Shuffle Permutation.
Discrete Mathematics & Theoretical Computer Science 5(1): 169-180 (2002) |
2000 |
12 | | John A. Ellis,
Minko Markov:
In situ, Stable Merging by Way of the Perfect Shuffle.
Comput. J. 43(1): 40-53 (2000) |
11 | EE | John A. Ellis,
Tobias Krahn,
Hongbing Fan:
Computing the cycles in the perfect shuffle permutation.
Inf. Process. Lett. 75(5): 217-224 (2000) |
1998 |
10 | | John A. Ellis,
Minko Markov:
Embedding Grids into Grids: Dilation Four Suffices.
Parallel Processing Letters 8(2): 243-250 (1998) |
9 | | John A. Ellis:
Addendum to ``Embedding Grids into Grids: Dilation Four Suffices''.
Parallel Processing Letters 8(4): 547 (1998) |
1996 |
8 | EE | John A. Ellis:
Embedding grids into grids: Techniques for large compression ratios.
Networks 27(1): 1-17 (1996) |
1994 |
7 | | John A. Ellis,
Manrique Mata-Montero,
Hausi A. Müller:
Serial and Parallel Algorithms for (k, 2)-Partite Graphs.
J. Parallel Distrib. Comput. 22(2): 129-137 (1994) |
1992 |
6 | EE | Leizhen Cai,
John A. Ellis:
Edge colouring line graphs of unicyclic graphs.
Discrete Applied Mathematics 36(1): 75-82 (1992) |
1991 |
5 | EE | Leizhen Cai,
John A. Ellis:
NP-completeness of edge-colouring some restricted graphs.
Discrete Applied Mathematics 30(1): 15-27 (1991) |
4 | | John A. Ellis:
Embedding Rectangular Grids into Square Grids.
IEEE Trans. Computers 40(1): 46-52 (1991) |
1989 |
3 | | Karl R. Abrahamson,
John A. Ellis,
Michael R. Fellows,
Manuel E. Mata:
On the Complexity of Fixed Parameter Problems (Extended Abstract)
FOCS 1989: 210-215 |
2 | | John A. Ellis,
Manrique Mata,
Gary MacGillivray:
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.
Inf. Process. Lett. 32(4): 199-204 (1989) |
1988 |
1 | | John A. Ellis:
Embedding Rectangular Grids into Square Grids.
AWOC 1988: 181-190 |