Lorna K. Stewart
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j26 |      | Piotr Rudnicki, Lorna Stewart: Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph. Formalized Mathematics 20(2): 161-174 (2012) |
| i4 | | Jessica Enright, Lorna Stewart, Gábor Tardos: On List Colouring and List Homomorphism of Permutation and Interval Graphs. CoRR abs/1206.5106 (2012) |
| 2011 | ||
| j25 | | 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. Discrete Mathematics 311(6): 431-434 (2011) |
| j24 | | Piotr Rudnicki, Lorna Stewart: The Mycielskian of a Graph. Formalized Mathematics 19(1): 27-34 (2011) |
| i3 | | |
| 2010 | ||
| i2 | | |
| 2009 | ||
| j23 | | Derek G. Corneil, Stephan Olariu, Lorna Stewart: The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discrete 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 | ||
| j22 | | Bill Rosgen, Lorna Stewart: Complexity Results on Graphs with Few Cliques. Discrete Mathematics & Theoretical Computer Science 9(1) (2007) |
| j21 | | Jessica Enright, Lorna Stewart: Subtree filament graphs are subtree overlap graphs. Inf. Process. Lett. 104(6): 228-232 (2007) |
| 2006 | ||
| j20 | | 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 | ||
| j19 | | 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 | ||
| j18 | | Eowyn Cenek, Lorna Stewart: Maximum independent set and maximum clique algorithms for overlap graphs. Discrete Applied Mathematics 131(1): 77-91 (2003) |
| 2002 | ||
| j17 | | Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discrete 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 | ||
| j16 | | Nesrine Abbas, Lorna K. Stewart: Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics 103(1-3): 1-19 (2000) |
| 1999 | ||
| j15 | | Nesrine Abbas, Lorna K. Stewart: Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. Discrete Applied Mathematics 91(1-3): 1-23 (1999) |
| j14 | | Dieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electronic Notes in Discrete Mathematics 3: 106-109 (1999) |
| j13 | | 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 | ||
| j12 | | |
| c4 | | Derek G. Corneil, Stephan Olariu, Lorna Stewart: The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180 |
| 1997 | ||
| j11 | | Dieter Kratsch, Lorna Stewart: Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997) |
| j10 | | Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997) |
| 1996 | ||
| j9 | | Ramesh S. Sankaranarayana, Lorna K. Stewart: Recursively decomposable well-covered graphs. Discrete Mathematics 161(1-3): 243-263 (1996) |
| 1995 | ||
| j8 | | 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 | ||
| j7 | | John G. Gimbel, Dieter Kratsch, Lorna Stewart: On Cocolourings and Cochromatic Numbers of Graphs. Discrete Applied Mathematics 48(2): 111-127 (1994) |
| 1993 | ||
| j6 | | Ehab S. Elmallah, Lorna K. Stewart: Independence and domination in Polygon Graphs. Discrete Applied Mathematics 44(1-3): 65-77 (1993) |
| j5 | | Dieter Kratsch, Lorna Stewart: Domination on Cocomparability Graphs. SIAM J. Discrete Math. 6(3): 400-417 (1993) |
| c1 | | |
| 1992 | ||
| j4 | | Ramesh S. Sankaranarayana, Lorna K. Stewart: Complexity results for well-covered graphs. Networks 22(3): 247-262 (1992) |
| 1990 | ||
| j3 | | Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990) |
| j2 | | Charles J. Colbourn, Lorna K. Stewart: Permutation graphs: Connected domination and Steiner trees. Discrete Mathematics 86(1-3): 179-189 (1990) |
| 1985 | ||
| j1 | | Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985) |
Colors in the list of coauthors
Last update Wed May 22 11:56:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page