Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ellis, John - Department of Computer Science, University of Victoria
Computing the Vertex Separation of Unicyclic Graphs John Ellis and Minko Markov
THE VERTEX SEPARATION AND SEARCH NUMBER OF A GRAPH J. A. Ellis * , I. H. Sudborough + and J. S. Turner #
Lower Bounds on the Pathwidth of some Grid-like John Ellis y and Robert Warren ?
Computing the Cycles in the Perfect Shuffle Permutation \Lambda John Ellis Tobias Krahn Hongbing Fan
Euclidean Strings John Ellis y
The Cycles of the Multiway Perfect Shu e Permutation John Ellis Hongbing Fan
Many to One Embeddings from Grids into Cylinders, Tori and Hypercubes
The Dominating Set Problem is Fixed Parameter Tractable for Graphs of Bounded Genus
Embedding Grids into Grids: Techniques for Large Compression Ratios John A. Ellis
InSitu, Stable Merging by way of the Perfect Shuffle. \Lambda John Ellis and Minko Markov
