Lorna Stewart - Publications

in Journals

• L. Stewart and R. Valenzano, On polygon numbers of circle graphs and distance hereditary graphs, Discrete Applied Mathematics, 248 (2018), 3-17.   journal   arXiv
• J. Enright and L. Stewart, Equivalence of the filament and overlap graphs of subtrees of limited trees, Discrete Mathematics and Theoretical Computer Science, 19/1 (2017).   journal
• J. Enright and L. Stewart, Games on interval and permutation graph representations. Theoretical Computer Science, 609/1 (2016), 87-103.   final version
• J. Enright, L. Stewart, and G. Tardos, On list colouring and list homomorphism of permutation and interval graphs. SIAM Journal on Discrete Mathematics, 28-4 (2014), 1675-1685.   final version
• P. Rudnicki and L. Stewart, Simple graphs as simplicial complexes: the Mycielskian of a graph, Formalized Mathematics, 20 (2013), 161-174.   journal
• P. Rudnicki and L. Stewart, The Mycielskian of a graph, Formalized Mathematics, 19 (2011), 27-34.   journal
• E. M. Eschen, C. T. Hoàng, R. Sritharan, and L. Stewart, On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two, Discrete Mathematics, 311 (2011), 431-434.   journal   arXiv
• D. G. Corneil, S. Olariu, L. Stewart, The LBFS structure and recognition of interval graphs, SIAM Journal on Discrete Mathematics, 23 (2009), 1905-1953.   final version
• J. Enright, L. Stewart, Subtree filament graphs are subtree overlap graphs, Information Processing Letters, 104/6 (2007), 228-232.   journal   preprint
• B. Rosgen, L. Stewart, Complexity results on graphs with few cliques, Discrete Mathematics and Theoretical Computer Science, 9/1 (2007).   journal
• J. M. Keil, L. Stewart, Approximating the minimum clique cover and other hard problems in subtree filament graphs, Discrete Applied Mathematics, 154 (2006), 1983-1995.   journal   preprint
• D. G. Corneil, E. Köhler, S. Olariu, L. Stewart, Linear orderings of subfamilies of AT-free graphs, SIAM Journal on Discrete Mathematics, 20 (2006), 105-118.   final version
• N. Abbas, J. Culberson, and L. Stewart, Recognizing maximal unfrozen graphs with respect to independent sets is co-NP-complete, Discrete Mathematics and Theoretical Computer Science, 7/1 (2005), 141-154.   journal
• E. Cenek, L. Stewart, Maximum independent set and maximum clique algorithms for overlap graphs, Discrete Applied Mathematics, 131 (2003), 77-91.   journal
• D. Kratsch, L. Stewart, Approximating bandwidth by mixing layouts of interval graphs, SIAM Journal on Discrete Mathematics 15 (2002), 435-449.   final version
• N. Abbas, L. Stewart, Biconvex graphs: ordering and algorithms, Discrete Applied Mathematics 103 (2000), 1-19.   journal
• N. Abbas, L. Stewart, Clustering bipartite and chordal graphs: complexity, sequential and parallel algorithms, Discrete Applied Mathematics 91 (1999), 1-23.   journal
• D. G. Corneil, S. Olariu, L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM Journal on Computing, 28 (1999), 1284-1297.   final version
• E. S. Elmallah, L. Stewart, Polygon graph recognition, Journal of Algorithms, 26 (1998), 101-140.   journal
• D. G. Corneil, S. Olariu, L. Stewart, Asteroidal triple-free graphs, SIAM Journal on Discrete Mathematics, 10 (1997), 399-430.   final version
• D. Kratsch L. Stewart, Total domination and transformation, Information Processing Letters, 63 (1997), 167-170.   journal
• R. S. Sankaranarayana, L. Stewart, Recursively decomposable well-covered graphs, Discrete Mathematics, 161 (1996), 243-263.
• D. G. Corneil, S. Olariu, L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph, Information Processing Letters, 54 (1995), 253-257.
• J. Gimbel, D. Kratsch, L. Stewart, On cocolourings and cochromatic numbers of graphs, Discrete Applied Mathematics, 48 (1994), 111-127.
• E. S. Elmallah, L. Stewart, Independence and domination in polygon graphs, Discrete Applied Mathematics, 44 (1993), 65-77.
• D. Kratsch, L. Stewart, Domination on cocomparability graphs, SIAM Journal on Discrete Mathematics 6 (1993), 400-417.
• R. S. Sankaranarayana, L. Stewart, Complexity results for well-covered graphs, Networks, 22 (1992), 247-262.
• C. J. Colbourn, L. Stewart, Permutation graphs: Connected domination and Steiner trees, Discrete Mathematics, 86 (1990), 179-189 and Annals of Discrete Mathematics, 48 (1991).
• D. G. Corneil, L. Stewart, Dominating sets in perfect graphs, Discrete Mathematics, 86 (1990), 145-164. Also Annals of Discrete Mathematics, 48 (1991).
• J. Spinrad, A. Brandstädt, L. Stewart, Bipartite permutation graphs, Discrete Applied Mathematics, 18 (1987), 279-292.
• G. Steiner, L. Stewart, A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders, Order, 3 (1987), 359-367.
• C. J. Colbourn, J. M. Keil, L. Stewart, Finding minimum dominating cycles in permutation graphs, Operations Research Letters, 4 (1985), 13-17.
• C. J. Colbourn, L. Stewart, Dominating cycles in series-parallel graphs, Ars Combinatoria, 19A (1985), 107-112.
• D. G. Corneil, Y. Perl, L. Stewart, A linear recognition algorithm for cographs, SIAM Journal on Computing, 14 (1985), 926-934.
• D. G. Corneil, H. Lerchs, L. Stewart, Complement reducible graphs, Discrete Applied Mathematics, 3 (1981), 163-174.

in Conference Proceedings

• Y. Cao, J. Culberson, L. Stewart, DP-complete problems derived from extremal NP-complete properties. In R. Královic and D. Niwinski, editors, Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science MFCS 2009, Lecture Notes in Computer Science, vol. 2204, Springer 2009, 199-210. pdf
• E. Köhler, D. G. Corneil, S. Olariu, L. Stewart, On subfamilies of AT-free graphs (Extended abstract). In A. Brandstädt and V. B. Le, editors, Proceedings of the Workshop on Graph Theoretic Concepts in Computer Science WG 2001, Lecture Notes in Computer Science vol. 2204, Springer 2001, 241-253. pdf
• D. Kratsch, L. Stewart, Approximating bandwidth by mixing layouts of interval graphs, In Christoph Meinel and Sophie Tison, editors, Proceedings of the 16th International Symposium on Theoretical Aspects in Computer Science STACS 1999, Lecture Notes in Computer Science vol. 1563, Springer 1999, 248-258. pdf
• D. G. Corneil, S. Olariu, L Stewart, LBFS orderings and cocomparability graphs, In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1999, ACM/SIAM 1999, S883-S884. pdf
• D. G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (Extended Abstract), In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1998, ACM/SIAM 1998, 175-180. pdf
• D. G. Corneil, S. Olariu, L. Stewart, Computing a dominating pair in an asteroidal triple-free graph in linear time, Lecture Notes in Computer Science, Vol. 955, Proceedings of the 4th International Workshop on Algorithms and Data Structures WADS'95, pages 358-368. Springer-Verlag, 1995.
• D. G. Corneil, S. Olariu, L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs (extended abstract), In Lecture Notes in Computer Science, Vol. 944, Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming ICALP'95, pages 292-302. Springer-Verlag, 1995.
• D. G. Corneil, S. Olariu, L. Stewart, Asteroidal triple-free graphs, Lecture Notes in Computer Science, Vol. 790, Proceedings of the Workshop on Graph Theoretic Concepts in Computer Science WG'93, pages 211-224. Springer-Verlag, 1994.
• N. Abbas and L. Stewart, Partitioning vertices of chordal graphs, Congressus Numerantium, 93:7-16, 1993.
• E. S. Elmallah and L. Stewart, Domination in polygon graphs, Congressus Numerantium, 77:63-76, 1990.
• A. Brandstädt, J. Spinrad, and L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congressus Numerantium, 58:165-174, 1987.
• C. J. Colbourn, P. J. Slater, and L. Stewart, Locating dominating sets in series parallel networks, Congressus Numerantium, 56:135-162, 1987.
• L. Stewart, Permutation graph structure, Congressus Numerantium, 54:87-100, 1986.
• D. G. Corneil, Y. Perl, and L. Stewart, Cographs: Recognition, applications and algorithms, Congressus Numerantium, 43:249-258, 1984.

Theses

• L. Stewart, Permutation graph structure and algorithms (Ph.D. thesis), Technical Report 185/85, Department of Computer Science, University of Toronto, November 1985.
• L. Stewart, Cographs: A class of tree representable graphs (M.Sc. thesis), Technical Report 126/78, Department of Computer Science, University of Toronto, October 1978.

Translation

• Bronwyn Burlingham and Lorna Stewart, A translation of Sur deux propriétés des classes d'ensembles by Edward Szpilrajn-Marczewski, 2009. Translation (pdf) (The original 1945 article can be found at The Polish Digital Mathematics Library)

Unpublished

• B. Rosgen and L. Stewart, The overlap number of a graph.   arXiv