default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElaine M. Eschen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Elaine M. Eschen
, R. Sritharan:
Bipartite completion of colored graphs avoiding chordless cycles of given lengths. Discret. Appl. Math. 318: 97-112 (2022)
2010 – 2019
- 2017
- [j20]Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick:
Efficient domination for classes of P6-free graphs. Discret. Appl. Math. 223: 15-27 (2017) - [j19]Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing colored graphs to meet a target property. Discret. Appl. Math. 223: 39-51 (2017) - 2015
- [c6]Andreas Brandstädt, Elaine M. Eschen, Erik Friese:
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. WG 2015: 78-89 - [i5]Andreas Brandstädt, Elaine M. Eschen, Erik Friese:
Efficient Domination for Some Subclasses of P6-Free Graphs in Polynomial Time. CoRR abs/1503.00091 (2015) - 2014
- [j18]Elaine M. Eschen, Xiaoqiang Wang:
Algorithms for unipolar and generalized split graphs. Discret. Appl. Math. 162: 195-201 (2014) - 2013
- [c5]Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing Colored Graphs to Meet a Target Property. WG 2013: 189-200 - 2012
- [j17]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. Graphs Comb. 28(3): 347-364 (2012) - 2011
- [j16]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. Discret. Appl. Math. 159(7): 581-587 (2011) - [j15]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): 431-434 (2011) - [i4]Elaine M. Eschen, Xiaoqiang Wang:
Algorithms for Unipolar and Generalized Split Graphs. CoRR abs/1106.6061 (2011) - 2010
- [j14]Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Discret. Math. 310(6-7): 1259-1264 (2010)
2000 – 2009
- 2009
- [i3]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 abs/0907.0691 (2009) - [i2]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009) - [i1]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009) - 2008
- [j13]Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai:
Group connectivity of certain graphs. Ars Comb. 89 (2008) - [j12]Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao:
The s-Hamiltonian index. Discret. Math. 308(20): 4779-4785 (2008) - [j11]Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30: 291-296 (2008) - 2007
- [j10]Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
An O(n 3)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23(Supplement-1): 209-231 (2007) - [j9]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): 900-929 (2007) - [j8]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): 260-265 (2007) - [c4]Elaine M. Eschen, Nicolas Pinet, Alain Sigayret:
Consecutive-ones: Handling Lattice Planarity Efficiently. CLA 2007 - 2006
- [j7]Elaine M. Eschen, Jeremy P. Spinrad:
Finding Triangles in Restricted Classes of Graphs. Electron. Notes Discret. Math. 27: 25-26 (2006) - 2005
- [j6]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): 277-298 (2005) - 2004
- [j5]Elaine M. Eschen, Jianbing Niu:
On potentially (K4-e)-graphic sequences. Australas. J Comb. 29: 59-66 (2004) - [c3]Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
The list partition problem for graphs. SODA 2004: 391-399 - 2003
- [j4]Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128(2-3): 355-373 (2003) - [j3]Elaine M. Eschen, William Klostermeyer, R. Sritharan:
Planar domination graphs. Discret. Math. 268(1-3): 129-137 (2003) - [c2]Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu:
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach. CSB 2003: 593-597
1990 – 1999
- 1999
- [j2]Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan:
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29(2): 378-386 (1999) - 1995
- [j1]Elaine M. Eschen, R. Sritharan:
A Characterization of Some Graph Classes with No Long Holes. J. Comb. Theory B 65(1): 156-162 (1995) - 1993
- [c1]Elaine M. Eschen, Jeremy P. Spinrad:
An O(n2) Algorithm for Circular-Arc Graph Recognition. SODA 1993: 128-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
