The SCEAS System
| |||||||

## Search the dblp DataBase
Lorna Stewart:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Derek G. Corneil, Stephan Olariu, Lorna Stewart
**Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.**[Citation Graph (0, 0)][DBLP] ICALP, 1995, pp:292-302 [Conf] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:175-180 [Conf] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**LBFS Orderings and Cocomparability Graphs.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:883-884 [Conf] - Dieter Kratsch, Lorna Stewart
**Approximating Bandwidth by Mixing Layouts of Interval Graphs.**[Citation Graph (0, 0)][DBLP] STACS, 1999, pp:248-258 [Conf] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time.**[Citation Graph (0, 0)][DBLP] WADS, 1995, pp:358-368 [Conf] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**Asteroidal Triple-Free Graphs.**[Citation Graph (0, 0)][DBLP] WG, 1993, pp:211-224 [Conf] - Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
**On Subfamilies of AT-Free Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:241-253 [Conf] - Eowyn Cenek, Lorna Stewart
**Maximum independent set and maximum clique algorithms for overlap graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:77-91 [Journal] - John G. Gimbel, Dieter Kratsch, Lorna Stewart
**On Cocolourings and Cochromatic Numbers of Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:48, n:2, pp:111-127 [Journal] - J. Mark Keil, Lorna Stewart
**Approximating the minimum clique cover and other hard problems in subtree filament graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:14, pp:1983-1995 [Journal] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:5, pp:253-257 [Journal] - Dieter Kratsch, Lorna Stewart
**Total Domination and Transformation.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:3, pp:167-170 [Journal] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:4, pp:1284-1297 [Journal] - Derek G. Corneil, Stephan Olariu, Lorna Stewart
**Asteroidal Triple-Free Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1997, v:10, n:3, pp:399-430 [Journal] - Dieter Kratsch, Lorna Stewart
**Approximating Bandwidth by Mixing Layouts of Interval Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2002, v:15, n:4, pp:435-449 [Journal] - Dieter Kratsch, Lorna Stewart
**Domination on Cocomparability Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1993, v:6, n:3, pp:400-417 [Journal] - Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
**Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:141-154 [Journal] - Jessica Enright, Lorna Stewart
**Subtree filament graphs are subtree overlap graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:6, pp:228-232 [Journal] **DP-Complete Problems Derived from Extremal NP-Complete Properties.**[Citation Graph (, )][DBLP]**On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two**[Citation Graph (, )][DBLP]**The overlap number of a graph**[Citation Graph (, )][DBLP]**Complexity Results on Graphs with Few Cliques.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |