Elaine M. Eschen

According to our database, Elaine M. Eschen authored at least 28 papers between 1993 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Bipartite completion of colored graphs avoiding chordless cycles of given lengths.

Elaine M. Eschen, R. Sritharan

Discret. Appl. Math., 2022

2017

Completing colored graphs to meet a target property.

Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang

Discret. Appl. Math., 2017

Efficient domination for classes of P₆-free graphs.

Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick

Discret. Appl. Math., 2017

2015

Efficient Domination for Some Subclasses of P₆-Free Graphs in Polynomial Time.

Andreas Brandstädt, Elaine M. Eschen, Erik Friese

CoRR, 2015

Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time.

Andreas Brandstädt, Elaine M. Eschen, Erik Friese

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Algorithms for unipolar and generalized split graphs.

Elaine M. Eschen, Xiaoqiang Wang

Discret. Appl. Math., 2014

2012

Finding a Sun in Building-Free Graphs.

Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan

Graphs Comb., 2012

2011

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.

Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart

Discret. Math., 2011

On graphs without a C₄ or a diamond.

Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan

Discret. Appl. Math., 2011

2010

2K₂ vertex-set partition into nonempty parts.

Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein

Discret. Math., 2010

2009

On graphs without a C4 or a diamond

Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan

CoRR, 2009

2008

2K₂ vertex-set partition into nonempty parts.

Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein

Electron. Notes Discret. Math., 2008

The s-Hamiltonian index.

Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao

Discret. Math., 2008

Group connectivity of certain graphs.

Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai

Ars Comb., 2008

2007

The induced matching and chain subgraph cover problems for convex bipartite graphs.

Andreas Brandstädt, Elaine M. Eschen, R. Sritharan

Theor. Comput. Sci., 2007

The Complexity of the List Partition Problem for Graphs.

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan

SIAM J. Discret. Math., 2007

An O(<i>n</i> ³)-Time Recognition Algorithm for hhds-free Graphs.

Elaine M. Eschen, Chính T. Hoàng, R. Sritharan

Graphs Comb., 2007

Consecutive-ones: Handling Lattice Planarity Efficiently.

Elaine M. Eschen, Nicolas Pinet, Alain Sigayret

Proceedings of the Fifth International Conference on Concept Lattices and Their Applications, 2007

2006

Finding Triangles in Restricted Classes of Graphs.

Elaine M. Eschen, Jeremy P. Spinrad

Electron. Notes Discret. Math., 2006

2005

Disjoint clique cutsets in graphs without long holes.

Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan

J. Graph Theory, 2005

2004

On potentially (K₄-e)-graphic sequences.

Elaine M. Eschen, Jianbing Niu

Australas. J Comb., 2004

The list partition problem for graphs.

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Planar domination graphs.

Elaine M. Eschen, William Klostermeyer, R. Sritharan

Discret. Math., 2003

Recognition of Some Perfectly Orderable Graph Classes.

Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan

Discret. Appl. Math., 2003

Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.

Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

1999

Weakly Triangulated Comparability Graphs.

Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan

SIAM J. Comput., 1999

1995

A Characterization of Some Graph Classes with No Long Holes.

Elaine M. Eschen, R. Sritharan

J. Comb. Theory B, 1995

1993

An O(n²) Algorithm for Circular-Arc Graph Recognition.

Elaine M. Eschen, Jeremy P. Spinrad

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993