Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Stewart, Lorna - Department of Computing Science, University of Alberta
APPROXIMATING BANDWIDTH BY MIXING LAYOUTS OF INTERVAL GRAPHS
Approximating the minimum clique cover and other hard problems in subtree filament graphs
SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 1, pp. 105118
A Translation of Sur deux proprietes des classes d'ensembles by Edward Szpilrajn-Marczewski
ASTEROIDAL TRIPLE-FREE GRAPHS DEREK G. CORNEIL, STEPHAN OLARIU, AND LORNA STEWART
LINEAR TIME ALGORITHMS FOR DOMINATING PAIRS IN ASTEROIDAL TRIPLE-FREE GRAPHS
THE LBFS STRUCTURE AND RECOGNITION OF INTERVAL GRAPHS
