Complement reducible graphs. - Derek G. Corneil; H. Lerchs; L. Stewart Burlingham (Discret. Appl. Math., 1981)

A Linear Recognition Algorithm for Cographs. - Derek G. Corneil; Yehoshua Perl; Lorna K. Stewart (SIAM J. Comput., 1985)

Permutation graph structure and algorithms. - Lorna Stewart (1985)

Bipartite permutation graphs. - Jeremy P. Spinrad; Andreas Brandstädt; Lorna Stewart (Discret. Appl. Math., 1987)

Permutation graphs: Connected domination and Steiner trees. - Charles J. Colbourn; Lorna K. Stewart (Discret. Math., 1990)

Dominating sets in perfect graphs. - Derek G. Corneil; Lorna K. Stewart (Discret. Math., 1990)

Complexity results for well-covered graphs. - Ramesh S. Sankaranarayana; Lorna K. Stewart (Networks, 1992)

Independence and domination in Polygon Graphs. - Ehab S. Elmallah; Lorna K. Stewart (Discret. Appl. Math., 1993)

Domination on Cocomparability Graphs. - Dieter Kratsch; Lorna Stewart (SIAM J. Discret. Math., 1993)

On Cocolourings and Cochromatic Numbers of Graphs. - John G. Gimbel; Dieter Kratsch; Lorna Stewart (Discret. Appl. Math., 1994)

Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (WADS, 1995)

A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (Inf. Process. Lett., 1995)

Recursively decomposable well-covered graphs. - Ramesh S. Sankaranarayana; Lorna K. Stewart (Discret. Math., 1996)

Total Domination and Transformation. - Dieter Kratsch; Lorna Stewart (Inf. Process. Lett., 1997)

Asteroidal Triple-Free Graphs. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (SIAM J. Discret. Math., 1997)

The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). - Derek G. Corneil; Stephan Olariu; Lorna Stewart (SODA, 1998)

Polygon Graph Recognition. - Ehab S. Elmallah; Lorna K. Stewart (J. Algorithms, 1998)

LBFS Orderings and Cocomparability Graphs. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (SODA, 1999)

Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. - Nesrine Abbas; Lorna K. Stewart (Discret. Appl. Math., 1999)

Approximating Bandwidth by Mixing Layouts of Interval Graphs. - Dieter Kratsch; Lorna Stewart (Electron. Notes Discret. Math., 1999)

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (SIAM J. Comput., 1999)

Biconvex graphs: ordering and algorithms. - Nesrine Abbas; Lorna K. Stewart (Discret. Appl. Math., 2000)

On Subfamilies of AT-Free Graphs. - Ekkehard Köhler; Derek G. Corneil; Stephan Olariu; Lorna Stewart (WG, 2001)

Maximum independent set and maximum clique algorithms for overlap graphs. - Eowyn Cenek; Lorna Stewart (Discret. Appl. Math., 2003)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. - Nesrine Abbas; Joseph C. Culberson; Lorna Stewart (Discret. Math. Theor. Comput. Sci., 2005)

Approximating the minimum clique cover and other hard problems in subtree filament graphs. - J. Mark Keil; Lorna Stewart (Discret. Appl. Math., 2006)

Linear Orderings of Subfamilies of AT-Free Graphs. - Derek G. Corneil; Ekkehard Köhler; Stephan Olariu; Lorna Stewart (SIAM J. Discret. Math., 2006)

Complexity Results on Graphs with Few Cliques. - Bill Rosgen; Lorna Stewart (Discret. Math. Theor. Comput. Sci., 2007)

Subtree filament graphs are subtree overlap graphs. - Jessica A. Enright; Lorna Stewart (Inf. Process. Lett., 2007)

DP-Complete Problems Derived from Extremal NP-Complete Properties. - Yi Cao; Joseph C. Culberson; Lorna Stewart (MFCS, 2009)

The LBFS Structure and Recognition of Interval Graphs. - Derek G. Corneil; Stephan Olariu; Lorna Stewart (SIAM J. Discret. Math., 2009)

The overlap number of a graph - Bill Rosgen; Lorna Stewart (CoRR, 2010)

3-List Colouring Permutation Graphs - Jessica A. Enright; Lorna Stewart (CoRR, 2011)

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. - Elaine M. Eschen; Chính T. Hoàng; R. Sritharan; Lorna Stewart (Discret. Math., 2011)

The Mycielskian of a Graph. - Piotr Rudnicki; Lorna Stewart (Formaliz. Math., 2011)

On List Colouring and List Homomorphism of Permutation and Interval Graphs - Jessica A. Enright; Lorna Stewart; Gábor Tardos (CoRR, 2012)

Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph. - Piotr Rudnicki; Lorna Stewart (Formaliz. Math., 2012)

On List Coloring and List Homomorphism of Permutation and Interval Graphs. - Jessica A. Enright; Lorna Stewart; Gábor Tardos (SIAM J. Discret. Math., 2014)

Games on interval and permutation graph representations. - Jessica A. Enright; Lorna Stewart (Theor. Comput. Sci., 2016)

Equivalence of the filament and overlap graphs of subtrees of limited trees. - Jessica A. Enright; Lorna Stewart (Discret. Math. Theor. Comput. Sci., 2017)

On polygon numbers of circle graphs and distance hereditary graphs. - Lorna Stewart; Richard Anthony Valenzano (Discret. Appl. Math., 2018)