The SCEAS System
| |||||||

## Search the dblp DataBase
Elaine M. Eschen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu
**Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.**[Citation Graph (0, 0)][DBLP] CSB, 2003, pp:593-597 [Conf] - Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
**The list partition problem for graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:391-399 [Conf] - Elaine M. Eschen, Jeremy Spinrad
**An O(n**[Citation Graph (0, 0)][DBLP]^{2}) Algorithm for Circular-Arc Graph Recognition. SODA, 1993, pp:128-137 [Conf] - Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan
**Recognition of Some Perfectly Orderable Graph Classes.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:355-373 [Journal] - Elaine M. Eschen, William Klostermeyer, R. Sritharan
**Planar domination graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:268, n:1-3, pp:129-137 [Journal] - Elaine M. Eschen, R. Sritharan
**A Characterization of Some Graph Classes with No Long Holes.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:156-162 [Journal] - Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan
**Weakly Triangulated Comparability Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:2, pp:378-386 [Journal] - Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
**Disjoint clique cutsets in graphs without long holes.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:4, pp:277-298 [Journal] - Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
**The induced matching and chain subgraph cover problems for convex bipartite graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:381, n:1-3, pp:260-265 [Journal] **Consecutive-ones: Handling Lattice Planarity Efficiently.**[Citation Graph (, )][DBLP]**Group connectivity of certain graphs.**[Citation Graph (, )][DBLP]**On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two**[Citation Graph (, )][DBLP]**On graphs without a C4 or a diamond**[Citation Graph (, )][DBLP]**Finding a sun in building-free graphs**[Citation Graph (, )][DBLP]**The s-Hamiltonian index.**[Citation Graph (, )][DBLP]**2K**[Citation Graph (, )][DBLP]_{2}vertex-set partition into nonempty parts.
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

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