Elaine M. Eschen

Publication Activity (10 Years)

Years Active: 1993-2022
Publications (10 Years): 5

Top Topics

Graph Isomorphism

Complex Structures

Graph Theoretic

Top Venues

Discret. Appl. Math.

Publications

Elaine M. Eschen, R. Sritharan
Bipartite completion of colored graphs avoiding chordless cycles of given lengths. Discret. Appl. Math. 318 (2022)
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
Completing colored graphs to meet a target property. Discret. Appl. Math. 223 (2017)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick
-free graphs. Discret. Appl. Math. 223 (2017)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese
-Free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt, Elaine M. Eschen, Erik Friese
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. WG (2015)
Elaine M. Eschen, Xiaoqiang Wang
Algorithms for unipolar and generalized split graphs. Discret. Appl. Math. 162 (2014)
Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
Completing Colored Graphs to Meet a Target Property. WG (2013)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a Sun in Building-Free Graphs. Graphs Comb. 28 (3) (2012)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Discret. Math. 311 (6) (2011)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
or a diamond. Discret. Appl. Math. 159 (7) (2011)
Elaine M. Eschen, Xiaoqiang Wang
Algorithms for Unipolar and Generalized Split Graphs CoRR (2011)
Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
vertex-set partition into nonempty parts. Discret. Math. 310 (6-7) (2010)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
On graphs without a C4 or a diamond CoRR (2009)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a sun in building-free graphs CoRR (2009)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two CoRR (2009)
Lili Zhang, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao
The s-Hamiltonian index. Discret. Math. 308 (20) (2008)
Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30 (2008)
Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai
Group connectivity of certain graphs. Ars Comb. 89 (2008)
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) (2007)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23 (Supplement-1) (2007)
Elaine M. Eschen, Nicolas Pinet, Alain Sigayret
Consecutive-ones: Handling Lattice Planarity Efficiently. CLA (2007)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21 (4) (2007)
Elaine M. Eschen, Jeremy P. Spinrad
Finding Triangles in Restricted Classes of Graphs. Electron. Notes Discret. Math. 27 (2006)
Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
Disjoint clique cutsets in graphs without long holes. J. Graph Theory 48 (4) (2005)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The list partition problem for graphs. SODA (2004)
Elaine M. Eschen, Jianbing Niu
-e)-graphic sequences. Australas. J Comb. 29 (2004)
Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128 (2-3) (2003)
Elaine M. Eschen, William Klostermeyer, R. Sritharan
Planar domination graphs. Discret. Math. 268 (1-3) (2003)
Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach. CSB (2003)
Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29 (2) (1999)
Elaine M. Eschen, R. Sritharan
A Characterization of Some Graph Classes with No Long Holes. J. Comb. Theory, Ser. B 65 (1) (1995)
Elaine M. Eschen, Jeremy P. Spinrad
) Algorithm for Circular-Arc Graph Recognition. SODA (1993)