Elaine M. Eschen

Orcid: 0000-0002-1089-5245

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Bipartite completion of colored graphs avoiding chordless cycles of given lengths.
Discret. Appl. Math., 2022

2017
Completing colored graphs to meet a target property.
Discret. Appl. Math., 2017

Efficient domination for classes of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2017

2015
Efficient Domination for Some Subclasses of P<sub>6</sub>-Free Graphs in Polynomial Time.
CoRR, 2015

Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
Algorithms for unipolar and generalized split graphs.
Discret. Appl. Math., 2014

2012
Finding a Sun in Building-Free Graphs.
Graphs Comb., 2012

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

On graphs without a C<sub>4</sub> or a diamond.
Discret. Appl. Math., 2011

2010
2K<sub>2</sub> vertex-set partition into nonempty parts.
Discret. Math., 2010

2009
On graphs without a C4 or a diamond
CoRR, 2009

2008
2K<sub>2</sub> vertex-set partition into nonempty parts.
Electron. Notes Discret. Math., 2008

The s-Hamiltonian index.
Discret. Math., 2008

Group connectivity of certain graphs.
Ars Comb., 2008

2007
The induced matching and chain subgraph cover problems for convex bipartite graphs.
Theor. Comput. Sci., 2007

The Complexity of the List Partition Problem for Graphs.
SIAM J. Discret. Math., 2007

An O(<i>n</i> <sup>3</sup>)-Time Recognition Algorithm for hhds-free Graphs.
Graphs Comb., 2007

Consecutive-ones: Handling Lattice Planarity Efficiently.
Proceedings of the Fifth International Conference on Concept Lattices and Their Applications, 2007

2006
Finding Triangles in Restricted Classes of Graphs.
Electron. Notes Discret. Math., 2006

2005
Disjoint clique cutsets in graphs without long holes.
J. Graph Theory, 2005

2004
On potentially (K<sub>4</sub>-e)-graphic sequences.
Australas. J Comb., 2004

The list partition problem for graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Planar domination graphs.
Discret. Math., 2003

Recognition of Some Perfectly Orderable Graph Classes.
Discret. Appl. Math., 2003

Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

1999
Weakly Triangulated Comparability Graphs.
SIAM J. Comput., 1999

1995
A Characterization of Some Graph Classes with No Long Holes.
J. Comb. Theory B, 1995

1993
An O(n<sup>2</sup>) Algorithm for Circular-Arc Graph Recognition.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993


  Loading...