Lorna K. Stewart
List of publications from the DBLP Bibliography Server - FAQ
| 2007 | ||
|---|---|---|
| 26 | EE | Jessica Enright, Lorna Stewart: Subtree filament graphs are subtree overlap graphs. Inf. Process. Lett. 104(6): 228-232 (2007) |
| 2006 | ||
| 25 | EE | 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 | ||
| 24 | EE | 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 | ||
| 23 | EE | Eowyn Cenek, Lorna Stewart: Maximum independent set and maximum clique algorithms for overlap graphs. Discrete Applied Mathematics 131(1): 77-91 (2003) |
| 2002 | ||
| 22 | EE | Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discrete Math. 15(4): 435-449 (2002) |
| 2001 | ||
| 21 | EE | Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart: On Subfamilies of AT-Free Graphs. WG 2001: 241-253 |
| 2000 | ||
| 20 | Nesrine Abbas, Lorna K. Stewart: Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics 103(1-3): 1-19 (2000) | |
| 1999 | ||
| 19 | EE | Derek G. Corneil, Stephan Olariu, Lorna Stewart: LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884 |
| 18 | EE | Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS 1999: 248-258 |
| 17 | EE | Nesrine Abbas, Lorna K. Stewart: Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. Discrete Applied Mathematics 91(1-3): 1-23 (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 | EE | Dieter Kratsch, Lorna Stewart: Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997) |
| 12 | EE | Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997) |
| 1996 | ||
| 11 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990) |
| 2 | EE | 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) | |
| 1 | Nesrine Abbas | [17] [20] [24] |
| 2 | Eowyn Cenek | [23] |
| 3 | Charles J. Colbourn | [2] |
| 4 | Derek G. Corneil | [1] [3] [6] [8] [9] [10] [12] [15] [16] [19] [21] |
| 5 | Joseph C. Culberson | [24] |
| 6 | Ehab S. Elmallah | [5] [14] |
| 7 | Jessica Enright | [26] |
| 8 | John G. Gimbel | [7] |
| 9 | J. Mark Keil | [25] |
| 10 | Ekkehard Köhler | [21] |
| 11 | Dieter Kratsch | [4] [7] [13] [18] [22] |
| 12 | Stephan Olariu | [6] [8] [9] [10] [12] [15] [16] [19] [21] |
| 13 | Yehoshua Perl | [1] |
| 14 | Ramesh S. Sankaranarayana | [11] |