Lorna Stewart - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2018

On polygon numbers of circle graphs and distance hereditary graphsLorna Stewart, Richard Anthony Valenzano. DAM, 248:3-17, 2018. [doi]

2017

Equivalence of the filament and overlap graphs of subtrees of limited treesJessica Enright, Lorna Stewart. dmtcs, 19(1), 2017. [doi]

2016

Games on interval and permutation graph representationsJessica Enright, Lorna Stewart. TCS, 609:87-103, 2016. [doi]

2014

On List Coloring and List Homomorphism of Permutation and Interval GraphsJessica Enright, Lorna Stewart, Gábor Tardos. siamdm, 28(4):1675-1685, 2014. [doi]

2012

Simple Graphs as Simplicial Complexes: the Mycielskian of a GraphPiotr Rudnicki, Lorna Stewart. fm, 20(2):161-174, 2012. [doi]

2011

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most twoElaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart. DM, 311(6):431-434, 2011. [doi]

The Mycielskian of a GraphPiotr Rudnicki, Lorna Stewart. fm, 19(1):27-34, 2011. [doi]

2009

DP-Complete Problems Derived from Extremal NP-Complete PropertiesYi Cao, Joseph C. Culberson, Lorna Stewart. mfcs 2009: 199-210 [doi]

The LBFS Structure and Recognition of Interval GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. siamdm, 23(4):1905-1953, 2009. [doi]

2007

Subtree filament graphs are subtree overlap graphsJessica Enright, Lorna Stewart. ipl, 104(6):228-232, 2007. [doi]

Complexity Results on Graphs with Few CliquesBill Rosgen, Lorna Stewart. dmtcs, 9(1), 2007. [doi]

2006

Approximating the minimum clique cover and other hard problems in subtree filament graphsJ. Mark Keil, Lorna Stewart. DAM, 154(14):1983-1995, 2006. [doi]

2005

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-completeNesrine Abbas, Joseph C. Culberson, Lorna Stewart. dmtcs, 7(1):141-154, 2005. [doi]

2003

Maximum independent set and maximum clique algorithms for overlap graphsEowyn Cenek, Lorna Stewart. DAM, 131(1):77-91, 2003. [doi]

2002

Approximating Bandwidth by Mixing Layouts of Interval GraphsDieter Kratsch, Lorna Stewart. siamdm, 15(4):435-449, 2002. [doi]

2001

On Subfamilies of AT-Free GraphsEkkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart. criwg 2001: 241-253 [doi]

1999

1998

The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract)Derek G. Corneil, Stephan Olariu, Lorna Stewart. soda 1998: 175-180

1997

Asteroidal Triple-Free GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. siamdm, 10(3):399-430, 1997. [doi]

Total Domination and TransformationDieter Kratsch, Lorna Stewart. ipl, 63(3):167-170, 1997. [doi]

1995

Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear TimeDerek G. Corneil, Stephan Olariu, Lorna Stewart. wads 1995: 358-368

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. icalp 1995: 292-302

A Linear Time Algorithm to Compute a Dominating Path in an AT-Free GraphDerek G. Corneil, Stephan Olariu, Lorna Stewart. ipl, 54(5):253-257, 1995. [doi]

1994

On Cocolourings and Cochromatic Numbers of GraphsJohn G. Gimbel, Dieter Kratsch, Lorna Stewart. DAM, 48(2):111-127, 1994. [doi]

1993

Asteroidal Triple-Free GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. criwg 1994: 211-224

Domination on Cocomparability GraphsDieter Kratsch, Lorna Stewart. siamdm, 6(3):400-417, 1993.

1987

Bipartite permutation graphsJeremy Spinrad, Andreas Brandstädt, Lorna Stewart. DAM, 18(3):279-292, 1987. [doi]

1985

Permutation graph structure and algorithmsLorna Stewart. PhD thesis, University of Toronto, Canada, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL