The SCEAS System
| |||||||

## Search the dblp DataBase
John A. Ellis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- John A. Ellis
**Embedding Rectangular Grids into Square Grids.**[Citation Graph (0, 0)][DBLP] AWOC, 1988, pp:181-190 [Conf] - Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata
**On the Complexity of Fixed Parameter Problems (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:210-215 [Conf] - John A. Ellis, Hongbing Fan, Michael R. Fellows
**The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.**[Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:180-189 [Conf] - John Ellis, Minko Markov
**In situ, Stable Merging by Way of the Perfect Shuffle.**[Citation Graph (0, 0)][DBLP] Comput. J., 2000, v:43, n:1, pp:40-53 [Journal] - John A. Ellis, Hongbing Fan, Jeffrey Shallit
**The Cycles of the Multiway Perfect Shuffle Permutation.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:169-180 [Journal] - John A. Ellis, Tobias Krahn, Hongbing Fan
**Computing the cycles in the perfect shuffle permutation.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:5, pp:217-224 [Journal] - John A. Ellis, Manrique Mata, Gary MacGillivray
**A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:4, pp:199-204 [Journal] - John A. Ellis, Hongbing Fan, Michael R. Fellows
**The dominating set problem is fixed parameter tractable for graphs of bounded genus.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:2, pp:152-168 [Journal] - John A. Ellis, Manrique Mata-Montero, Hausi A. Müller
**Serial and Parallel Algorithms for (k, 2)-Partite Graphs.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1994, v:22, n:2, pp:129-137 [Journal] - John A. Ellis
**Embedding grids into grids: Techniques for large compression ratios.**[Citation Graph (0, 0)][DBLP] Networks, 1996, v:27, n:1, pp:1-17 [Journal] - John A. Ellis
**Addendum to ``Embedding Grids into Grids: Dilation Four Suffices''.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1998, v:8, n:4, pp:547- [Journal] - John A. Ellis, Minko Markov
**Embedding Grids into Grids: Dilation Four Suffices.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1998, v:8, n:2, pp:243-250 [Journal] - John A. Ellis
**Embedding Rectangular Grids into Square Grids.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1991, v:40, n:1, pp:46-52 [Journal] **NP-completeness of edge-colouring some restricted graphs.**[Citation Graph (, )][DBLP]**Edge colouring line graphs of unicyclic graphs.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |