| 2008 |
|---|
| 15 | | Jingjing Chen,
Elaine M. Eschen,
Hong-Jian Lai:
Group connectivity of certain graphs.
Ars Comb. 89: (2008) |
| 14 | EE | Zhang Lili,
Elaine M. Eschen,
Hong-Jian Lai,
Yehong Shao:
The s-Hamiltonian index.
Discrete Mathematics 308(20): 4779-4785 (2008) |
| 13 | EE | Simone Dantas,
Elaine M. Eschen,
Luerbio Faria,
Celina M. Herrera de Figueiredo,
Sulamita Klein:
2K2 vertex-set partition into nonempty parts.
Electronic Notes in Discrete Mathematics 30: 291-296 (2008) |
| 2007 |
|---|
| 12 | EE | Elaine M. Eschen,
Nicolas Pinet,
Alain Sigayret:
Consecutive-ones: Handling Lattice Planarity Efficiently.
CLA 2007 |
| 11 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discrete Math. 21(4): 900-929 (2007) |
| 10 | EE | Andreas Brandstädt,
Elaine M. Eschen,
R. Sritharan:
The induced matching and chain subgraph cover problems for convex bipartite graphs.
Theor. Comput. Sci. 381(1-3): 260-265 (2007) |
| 2006 |
|---|
| 9 | EE | Elaine M. Eschen,
Jeremy Spinrad:
Finding Triangles in Restricted Classes of Graphs.
Electronic Notes in Discrete Mathematics 27: 25-26 (2006) |
| 2005 |
|---|
| 8 | EE | Elaine M. Eschen,
Chính T. Hoàng,
Mark D. T. Petrick,
R. Sritharan:
Disjoint clique cutsets in graphs without long holes.
Journal of Graph Theory 48(4): 277-298 (2005) |
| 2004 |
|---|
| 7 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The list partition problem for graphs.
SODA 2004: 391-399 |
| 2003 |
|---|
| 6 | EE | Cun-Quan Zhang,
Yunkai Liu,
Elaine M. Eschen,
Keqiang Wu:
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.
CSB 2003: 593-597 |
| 5 | EE | Elaine M. Eschen,
Julie L. Johnson,
Jeremy Spinrad,
R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes.
Discrete Applied Mathematics 128(2-3): 355-373 (2003) |
| 4 | EE | Elaine M. Eschen,
William Klostermeyer,
R. Sritharan:
Planar domination graphs.
Discrete Mathematics 268(1-3): 129-137 (2003) |
| 1999 |
|---|
| 3 | | Elaine M. Eschen,
Ryan Hayward,
Jeremy Spinrad,
R. Sritharan:
Weakly Triangulated Comparability Graphs.
SIAM J. Comput. 29(2): 378-386 (1999) |
| 1995 |
|---|
| 2 | EE | Elaine M. Eschen,
R. Sritharan:
A Characterization of Some Graph Classes with No Long Holes.
J. Comb. Theory, Ser. B 65(1): 156-162 (1995) |
| 1993 |
|---|
| 1 | | Elaine M. Eschen,
Jeremy Spinrad:
An O(n²) Algorithm for Circular-Arc Graph Recognition.
SODA 1993: 128-137 |
