| Year |
Citation |
Score |
| 2017 |
Stewart L, Valenzano RA. On polygon numbers of circle graphs and distance hereditary graphs Discrete Applied Mathematics. 248: 3-17. DOI: 10.1016/J.Dam.2017.09.016 |
0.717 |
|
| 2014 |
Enright J, Stewart L, Tardos G. On list coloring and list homomorphism of permutation and interval graphs Siam Journal On Discrete Mathematics. 28: 1675-1685. DOI: 10.1137/13090465X |
0.728 |
|
| 2014 |
Enright J, Stewart L. Games on interval and permutation graph representations Theoretical Computer Science. DOI: 10.1016/J.Tcs.2015.09.009 |
0.717 |
|
| 2012 |
Rudnicki P, Stewart L. Simple graphs as simplicial complexes: The mycielskian of a graph Formalized Mathematics. 20: 161-174. DOI: 10.2478/V10037-012-0019-8 |
0.709 |
|
| 2011 |
Rudnicki P, Stewart L. The Mycielskian of a graph Formalized Mathematics. 19: 27-34. DOI: 10.2478/V10037-011-0005-6 |
0.577 |
|
| 2011 |
Eschen EM, Hoáng CT, Sritharan R, Stewart L. On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two Discrete Mathematics. 311: 431-434. DOI: 10.1016/J.Disc.2010.12.013 |
0.671 |
|
| 2009 |
Corneil DG, Olariu S, Stewart L. The LBFS structure and rec ognition of interval graphs Siam Journal On Discrete Mathematics. 23: 1905-1953. DOI: 10.1137/S0895480100373455 |
0.757 |
|
| 2007 |
Enright J, Stewart L. Subtree filament graphs are subtree overlap graphs Information Processing Letters. 104: 228-232. DOI: 10.1016/J.Ipl.2007.07.004 |
0.719 |
|
| 2006 |
Corneil DG, Köhler E, Olariu S, Stewart L. Linear orderings of subfamilies of AT-free graphs Siam Journal On Discrete Mathematics. 20: 105-118. DOI: 10.1137/S0895480104445307 |
0.759 |
|
| 2006 |
Keil JM, Stewart L. Approximating the minimum clique cover and other hard problems in subtree filament graphs Discrete Applied Mathematics. 154: 1983-1995. DOI: 10.1016/J.Dam.2006.03.003 |
0.777 |
|
| 2003 |
Čenek E, Stewart L. Maximum independent set and maximum clique algorithms for overlap graphs Discrete Applied Mathematics. 131: 77-91. DOI: 10.1016/S0166-218X(02)00418-3 |
0.767 |
|
| 1999 |
Kratsch D, Stewart L. Approximating Bandwidth by Mixing Layouts of Interval Graphs Electronic Notes in Discrete Mathematics. 3: 106-109. DOI: 10.1016/S1571-0653(05)80035-6 |
0.699 |
|
| 1999 |
Abbas N, Stewart L. Clustering bipartite and chordal graphs: complexity, sequential and parallel algorithm Discrete Applied Mathematics. 91: 1-23. DOI: 10.1016/S0166-218X(98)00094-8 |
0.763 |
|
| 1997 |
Corneil DG, Olariu S, Stewart L. Asteroidal Triple-Free Graphs Siam Journal On Discrete Mathematics. 10: 399-430. DOI: 10.1137/S0895480193250125 |
0.743 |
|
| 1997 |
Kratsch D, Stewart L. Total domination and transformation Information Processing Letters. 63: 167-170. DOI: 10.1016/S0020-0190(97)00115-4 |
0.74 |
|
| 1995 |
Corneil DG, Olariu S, Stewart L. Linear time algorithms for dominating pairs in asteroidal triple-free graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 944: 292-302. DOI: 10.1137/S0097539795282377 |
0.719 |
|
| 1995 |
Corneil DG, Olariu S, Stewart L. A linear time algorithm to compute a dominating path in an AT-free graph Information Processing Letters. 54: 253-257. DOI: 10.1016/0020-0190(95)00021-4 |
0.671 |
|
| 1994 |
Gimbel J, Kratsch D, Stewart L. On cocolourings and cochromatic numbers of graphs Discrete Applied Mathematics. 48: 111-127. DOI: 10.1016/0166-218X(92)00121-2 |
0.759 |
|
| 1993 |
Kratsch D, Stewart L. Domination on cocomparability graphs Siam Journal On Discrete Mathematics. 6: 400-417. DOI: 10.1137/0406032 |
0.777 |
|
| 1987 |
Spinrad J, Brandstädt A, Stewart L. Bipartite permutation graphs Discrete Applied Mathematics. 18: 279-292. DOI: 10.1016/S0166-218X(87)80003-3 |
0.757 |
|
| Show low-probability matches. |