default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorna Stewart
Person information
- affiliation: University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j33]Lorna Stewart, Richard Anthony Valenzano:
On polygon numbers of circle graphs and distance hereditary graphs. Discret. Appl. Math. 248: 3-17 (2018)- 2017
- [j32]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) - 2016
- [j31]Jessica A. Enright
, Lorna Stewart:
Games on interval and permutation graph representations. Theor. Comput. Sci. 609: 87-103 (2016) - 2015
- [i6]Jessica A. Enright, Lorna Stewart:
Equivalence of the filament and overlap graphs of subtrees of limited trees. CoRR abs/1508.01441 (2015) - 2014
- [j30]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): 1675-1685 (2014) - [i5]Lorna Stewart, Richard Anthony Valenzano:
On polygon numbers of circle graphs and distance hereditary graphs. CoRR abs/1401.1541 (2014) - 2012
- [j29]Piotr Rudnicki, Lorna Stewart:
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph. Formaliz. Math. 20(2): 161-174 (2012) - [i4]Jessica A. Enright, Lorna Stewart, Gábor Tardos:
On List Colouring and List Homomorphism of Permutation and Interval Graphs. CoRR abs/1206.5106 (2012) - 2011
- [j28]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): 431-434 (2011) - [j27]Piotr Rudnicki, Lorna Stewart:
The Mycielskian of a Graph. Formaliz. Math. 19(1): 27-34 (2011) - [i3]Jessica A. Enright, Lorna Stewart:
3-List Colouring Permutation Graphs. CoRR abs/1104.5009 (2011) - 2010
- [i2]Bill Rosgen, Lorna Stewart:
The overlap number of a graph. CoRR abs/1008.2170 (2010)
2000 – 2009
- 2009
- [j26]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discret. Math. 23(4): 1905-1953 (2009) - [c8]Yi Cao, Joseph C. Culberson, Lorna Stewart:
DP-Complete Problems Derived from Extremal NP-Complete Properties. MFCS 2009: 199-210 - [i1]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 abs/0907.0691 (2009) - 2007
- [j25]Bill Rosgen, Lorna Stewart:
Complexity Results on Graphs with Few Cliques. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j24]Jessica A. Enright, Lorna Stewart:
Subtree filament graphs are subtree overlap graphs. Inf. Process. Lett. 104(6): 228-232 (2007) - 2006
- [j23]J. Mark Keil, Lorna Stewart:
Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discret. Appl. Math. 154(14): 1983-1995 (2006) - [j22]Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart:
Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discret. Math. 20(1): 105-118 (2006) - 2005
- [j21]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): 141-154 (2005) - 2003
- [j20]Eowyn Cenek, Lorna Stewart:
Maximum independent set and maximum clique algorithms for overlap graphs. Discret. Appl. Math. 131(1): 77-91 (2003) - 2002
- [j19]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discret. Math. 15(4): 435-449 (2002) - 2001
- [c7]Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart:
On Subfamilies of AT-Free Graphs. WG 2001: 241-253 - 2000
- [j18]Nesrine Abbas, Lorna K. Stewart:
Biconvex graphs: ordering and algorithms. Discret. Appl. Math. 103(1-3): 1-19 (2000)
1990 – 1999
- 1999
- [j17]Nesrine Abbas, Lorna K. Stewart:
Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. Discret. Appl. Math. 91(1-3): 1-23 (1999) - [j16]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electron. Notes Discret. Math. 3: 106-109 (1999) - [j15]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM J. Comput. 28(4): 1284-1297 (1999) - [c6]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884 - [c5]Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS 1999: 248-258 - 1998
- [j14]Ehab S. Elmallah, Lorna K. Stewart:
Polygon Graph Recognition. J. Algorithms 26(1): 101-140 (1998) - [c4]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180 - 1997
- [j13]Dieter Kratsch, Lorna Stewart:
Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997) - [j12]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 10(3): 399-430 (1997) - 1996
- [j11]Ramesh S. Sankaranarayana, Lorna K. Stewart:
Recursively decomposable well-covered graphs. Discret. Math. 161(1-3): 243-263 (1996) - 1995
- [j10]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): 253-257 (1995) - [c3]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP 1995: 292-302 - [c2]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368 - 1994
- [j9]John G. Gimbel, Dieter Kratsch, Lorna Stewart:
On Cocolourings and Cochromatic Numbers of Graphs. Discret. Appl. Math. 48(2): 111-127 (1994) - 1993
- [j8]Ehab S. Elmallah, Lorna K. Stewart:
Independence and domination in Polygon Graphs. Discret. Appl. Math. 44(1-3): 65-77 (1993) - [j7]Dieter Kratsch, Lorna Stewart:
Domination on Cocomparability Graphs. SIAM J. Discret. Math. 6(3): 400-417 (1993) - [c1]Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Asteroidal Triple-Free Graphs. WG 1993: 211-224 - 1992
- [j6]Ramesh S. Sankaranarayana, Lorna K. Stewart:
Complexity results for well-covered graphs. Networks 22(3): 247-262 (1992) - 1990
- [j5]Derek G. Corneil, Lorna K. Stewart:
Dominating sets in perfect graphs. Discret. Math. 86(1-3): 145-164 (1990) - [j4]Charles J. Colbourn, Lorna K. Stewart:
Permutation graphs: Connected domination and Steiner trees. Discret. Math. 86(1-3): 179-189 (1990)
1980 – 1989
- 1987
- [j3]Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart:
Bipartite permutation graphs. Discret. Appl. Math. 18(3): 279-292 (1987) - 1985
- [b1]Lorna Stewart:
Permutation graph structure and algorithms. University of Toronto, Canada, 1985 - [j2]Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart:
A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985) - 1981
- [j1]Derek G. Corneil, H. Lerchs, L. Stewart Burlingham:
Complement reducible graphs. Discret. Appl. Math. 3(3): 163-174 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
