Lorna Stewart
Affiliations: | Computing Science | University of Alberta, Edmonton, Alberta, Canada |
Area:
Computer ScienceGoogle:
"Lorna Stewart"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Stewart L, Valenzano RA. (2017) On polygon numbers of circle graphs and distance hereditary graphs Discrete Applied Mathematics. 248: 3-17 |
| Enright J, Stewart L, Tardos G. (2014) On list coloring and list homomorphism of permutation and interval graphs Siam Journal On Discrete Mathematics. 28: 1675-1685 |
| Enright J, Stewart L. (2014) Games on interval and permutation graph representations Theoretical Computer Science |
| Rudnicki P, Stewart L. (2012) Simple graphs as simplicial complexes: The mycielskian of a graph Formalized Mathematics. 20: 161-174 |
| Rudnicki P, Stewart L. (2011) The Mycielskian of a graph Formalized Mathematics. 19: 27-34 |
| Eschen EM, Hoáng CT, Sritharan R, et al. (2011) On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two Discrete Mathematics. 311: 431-434 |
| Corneil DG, Olariu S, Stewart L. (2009) The LBFS structure and rec ognition of interval graphs Siam Journal On Discrete Mathematics. 23: 1905-1953 |
| Enright J, Stewart L. (2007) Subtree filament graphs are subtree overlap graphs Information Processing Letters. 104: 228-232 |
| Corneil DG, Köhler E, Olariu S, et al. (2006) Linear orderings of subfamilies of AT-free graphs Siam Journal On Discrete Mathematics. 20: 105-118 |
| Keil JM, Stewart L. (2006) Approximating the minimum clique cover and other hard problems in subtree filament graphs Discrete Applied Mathematics. 154: 1983-1995 |