The SCEAS System
Navigation Menu

Search the dblp DataBase


Elaine M. Eschen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Elaine M. Eschen, Jeremy Spinrad
    An O(n2) Algorithm for Circular-Arc Graph Recognition. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:128-137 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]

  10. Consecutive-ones: Handling Lattice Planarity Efficiently. [Citation Graph (, )][DBLP]

  11. Group connectivity of certain graphs. [Citation Graph (, )][DBLP]

  12. On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two [Citation Graph (, )][DBLP]

  13. On graphs without a C4 or a diamond [Citation Graph (, )][DBLP]

  14. Finding a sun in building-free graphs [Citation Graph (, )][DBLP]

  15. The s-Hamiltonian index. [Citation Graph (, )][DBLP]

  16. 2K2 vertex-set partition into nonempty parts. [Citation Graph (, )][DBLP]

Search in 0.000secs, Finished in 0.001secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002