Lorna Stewart

Publication Activity (10 Years)

Years Active: 1987-2018
Publications (10 Years): 4

Top Topics

Frequent Subtrees

Graph Theoretic

Top Venues

Formaliz. Math.

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Publications

Lorna Stewart, Richard Anthony Valenzano
On polygon numbers of circle graphs and distance hereditary graphs. Discret. Appl. Math. 248 (2018)
Jessica A. Enright, Lorna Stewart
Equivalence of the filament and overlap graphs of subtrees of limited trees. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Jessica A. Enright, Lorna Stewart
Games on interval and permutation graph representations. Theor. Comput. Sci. 609 (2016)
Jessica A. Enright, Lorna Stewart
Equivalence of the filament and overlap graphs of subtrees of limited trees. CoRR (2015)
Lorna Stewart, Richard Anthony Valenzano
On polygon numbers of circle graphs and distance hereditary graphs. CoRR (2014)
Jessica A. Enright, Lorna Stewart, Gábor Tardos
On List Coloring and List Homomorphism of Permutation and Interval Graphs. SIAM J. Discret. Math. 28 (4) (2014)
Piotr Rudnicki, Lorna Stewart
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph. Formaliz. Math. 20 (2) (2012)
Jessica A. Enright, Lorna Stewart, Gábor Tardos
On List Colouring and List Homomorphism of Permutation and Interval Graphs CoRR (2012)
Piotr Rudnicki, Lorna Stewart
The Mycielskian of a Graph. Formaliz. Math. 19 (1) (2011)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Discret. Math. 311 (6) (2011)
Jessica A. Enright, Lorna Stewart
3-List Colouring Permutation Graphs CoRR (2011)
Bill Rosgen, Lorna Stewart
The overlap number of a graph CoRR (2010)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discret. Math. 23 (4) (2009)
Yi Cao, Joseph C. Culberson, Lorna Stewart
DP-Complete Problems Derived from Extremal NP-Complete Properties. MFCS (2009)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two CoRR (2009)
Jessica A. Enright, Lorna Stewart
Subtree filament graphs are subtree overlap graphs. Inf. Process. Lett. 104 (6) (2007)
Bill Rosgen, Lorna Stewart
Complexity Results on Graphs with Few Cliques. Discret. Math. Theor. Comput. Sci. 9 (1) (2007)
Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart
Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discret. Math. 20 (1) (2006)
J. Mark Keil, Lorna Stewart
Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discret. Appl. Math. 154 (14) (2006)
Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discret. Math. Theor. Comput. Sci. 7 (1) (2005)
Eowyn Cenek, Lorna Stewart
Maximum independent set and maximum clique algorithms for overlap graphs. Discret. Appl. Math. 131 (1) (2003)
Dieter Kratsch, Lorna Stewart
Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discret. Math. 15 (4) (2002)
Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
On Subfamilies of AT-Free Graphs. WG (2001)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM J. Comput. 28 (4) (1999)
Dieter Kratsch, Lorna Stewart
Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS (1999)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
LBFS Orderings and Cocomparability Graphs. SODA (1999)
Dieter Kratsch, Lorna Stewart
Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electron. Notes Discret. Math. 3 (1999)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA (1998)
Dieter Kratsch, Lorna Stewart
Total Domination and Transformation. Inf. Process. Lett. 63 (3) (1997)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 10 (3) (1997)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. Inf. Process. Lett. 54 (5) (1995)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP (1995)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS (1995)
John G. Gimbel, Dieter Kratsch, Lorna Stewart
On Cocolourings and Cochromatic Numbers of Graphs. Discret. Appl. Math. 48 (2) (1994)
Dieter Kratsch, Lorna Stewart
Domination on Cocomparability Graphs. SIAM J. Discret. Math. 6 (3) (1993)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Asteroidal Triple-Free Graphs. WG (1993)
Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart
Bipartite permutation graphs. Discret. Appl. Math. 18 (3) (1987)