Lorna Stewart

Lorna K. Stewart

	2009
30		Yi Cao, Joseph C. Culberson, Lorna Stewart: DP-Complete Problems Derived from Extremal NP-Complete Properties. MFCS 2009: 199-210
29		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
28		Bill Rosgen, Lorna Stewart: Complexity Results on Graphs with Few Cliques. Discrete Mathematics & Theoretical Computer Science 9(1): (2007)
27		Jessica Enright, Lorna Stewart: Subtree filament graphs are subtree overlap graphs. Inf. Process. Lett. 104(6): 228-232 (2007)
	2006
26		J. Mark Keil, Lorna Stewart: Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discrete Applied Mathematics 154(14): 1983-1995 (2006)
	2005
25		Nesrine Abbas, Joseph C. Culberson, Lorna Stewart: Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discrete Mathematics & Theoretical Computer Science 7(1): 141-154 (2005)
	2003
24		Eowyn Cenek, Lorna Stewart: Maximum independent set and maximum clique algorithms for overlap graphs. Discrete Applied Mathematics 131(1): 77-91 (2003)
	2002
23		Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discrete Math. 15(4): 435-449 (2002)
	2001
22		Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart: On Subfamilies of AT-Free Graphs. WG 2001: 241-253
	2000
21		Nesrine Abbas, Lorna K. Stewart: Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics 103(1-3): 1-19 (2000)
	1999
20		Derek G. Corneil, Stephan Olariu, Lorna Stewart: LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884
19		Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS 1999: 248-258
18		Nesrine Abbas, Lorna K. Stewart: Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. Discrete Applied Mathematics 91(1-3): 1-23 (1999)
17		Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electronic Notes in Discrete Mathematics 3: 106-109 (1999)
16		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)
	1998
15		Derek G. Corneil, Stephan Olariu, Lorna Stewart: The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180
14		Ehab S. Elmallah, Lorna K. Stewart: Polygon Graph Recognition. J. Algorithms 26(1): 101-140 (1998)
	1997
13		Dieter Kratsch, Lorna Stewart: Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997)
12		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997)
	1996
11		Ramesh S. Sankaranarayana, Lorna K. Stewart: Recursively decomposable well-covered graphs. Discrete Mathematics 161(1-3): 243-263 (1996)
	1995
10		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP 1995: 292-302
9		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368
8		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)
	1994
7		John G. Gimbel, Dieter Kratsch, Lorna Stewart: On Cocolourings and Cochromatic Numbers of Graphs. Discrete Applied Mathematics 48(2): 111-127 (1994)
	1993
6		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. WG 1993: 211-224
5		Ehab S. Elmallah, Lorna K. Stewart: Independence and domination in Polygon Graphs. Discrete Applied Mathematics 44(1-3): 65-77 (1993)
4		Dieter Kratsch, Lorna Stewart: Domination on Cocomparability Graphs. SIAM J. Discrete Math. 6(3): 400-417 (1993)
	1990
3		Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990)
2		Charles J. Colbourn, Lorna K. Stewart: Permutation graphs: Connected domination and Steiner trees. Discrete Mathematics 86(1-3): 179-189 (1990)
	1985
1		Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985)

Coauthor Index

1	Nesrine Abbas	[18] [21] [25]
2	Yi Cao	[30]
3	Eowyn Cenek	[24]
4	Charles J. Colbourn	[2]
5	Derek G. Corneil	[1] [3] [6] [8] [9] [10] [12] [15] [16] [20] [22]
6	Joseph C. Culberson	[25] [30]
7	Ehab S. Elmallah	[5] [14]
8	Jessica Enright	[27]
9	Elaine M. Eschen	[29]
10	John G. Gimbel	[7]
11	Chính T. Hoàng	[29]
12	J. Mark Keil	[26]
13	Ekkehard Köhler	[22]
14	Dieter Kratsch	[4] [7] [13] [17] [19] [23]
15	Stephan Olariu	[6] [8] [9] [10] [12] [15] [16] [20] [22]
16	Yehoshua Perl	[1]
17	Bill Rosgen	[28]
18	Ramesh S. Sankaranarayana	[11]
19	R. Sritharan	[29]

Colors in the list of coauthors