default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLily Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Ningge Huang, Yi Tan, Lily Chen
:
On the inclusion chromatic index of a Halin graph. Discret. Math. 348(2): 114266 (2025)- 2024
- [c4]Sebastian Joseph, Lily Chen, Jan Trienes, Hannah Louisa Göke, Monika Coers, Wei Xu, Byron C. Wallace, Junyi Jessy Li:
FactPICO: Factuality Evaluation for Plain Language Summarization of Medical Evidence. ACL (1) 2024: 8437-8464 - [c3]MJ Johns, Emmanuel Chinedum Ezenwa, Seunghyun Lee, Thomas Maiorana, Ciel Wood, Josh D. Levano, Rita Aksum Tesfay, Michael Takami, Cameron A Dodd, Madison Li, Hanne Manning, Regis Pak, Lily Chen, Ria K. Saini, Mário Escarce Junior, Mennatullah Hendawy, Magy Seif El-Nasr, Edward F. Melcer, Katherine Isbister:
Participatory Design of a Serious Game to Improve Wildfire Preparedness with Community Residents and Experts. CHI Extended Abstracts 2024: 261:1-261:8 - [i7]Sebastian Antony Joseph, Lily Chen, Jan Trienes, Hannah Louisa Göke, Monika Coers, Wei Xu, Byron C. Wallace, Junyi Jessy Li:
FactPICO: Factuality Evaluation for Plain Language Summarization of Medical Evidence. CoRR abs/2402.11456 (2024) - 2022
- [j18]Lily Chen, Yanyi Li:
A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs. Axioms 11(1): 33 (2022) - [j17]Lily Chen, Yanyi Li, Xiangqian Zhou:
The inclusion-free edge-colorings of (3, Δ)-bipartite graphs. Discret. Appl. Math. 321: 159-164 (2022) - [j16]Meiqin Wei, Jun Yue, Lily Chen:
The effect of vertex and edge deletion on the edge metric dimension of graphs. J. Comb. Optim. 44(1): 331-342 (2022) - 2020
- [j15]Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou:
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343(4): 111779 (2020) - [j14]Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou:
The strong chromatic index of graphs with edge weight eight. J. Comb. Optim. 40(1): 227-233 (2020) - [c2]Sam Burnett, Lily Chen, Douglas A. Creager, Misha Efimov, Ilya Grigorik, Ben Jones, Harsha V. Madhyastha, Pavlos Papageorge, Brian Rogan, Charles Stahl, Julia Tuttle:
Network Error Logging: Client-side measurement of end-to-end web service reliability. NSDI 2020: 985-998
2010 – 2019
- 2019
- [j13]Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou:
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342(2): 339-343 (2019) - [j12]Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. Discret. Math. 342(11): 2984-2993 (2019) - 2018
- [j11]Lily Chen, Yingbin Ma, Yongtang Shi, Yan Zhao:
On the [1, 2]-domination number of generalized Petersen graphs. Appl. Math. Comput. 327: 1-7 (2018) - 2017
- [j10]Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao:
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33(1): 275-282 (2017) - 2016
- [j9]Mengmeng Liu, Lily Chen:
Bicyclic graphs with maximal edge revised Szeged index. Discret. Appl. Math. 215: 225-230 (2016) - [j8]Lily Chen, Bofeng Huo, Yingbin Ma:
Hardness results for total rainbow connection of graphs. Discuss. Math. Graph Theory 36(2): 355-362 (2016) - 2015
- [j7]Lily Chen, Xueliang Li, Kang Yang, Yan Zhao:
The 3-rainbow index of a graph. Discuss. Math. Graph Theory 35(1): 81-94 (2015) - [c1]Grace Hu, Lily Chen, Johanna Okerlund, Orit Shaer:
Exploring the Use of Google Glass in Wet Laboratories. CHI Extended Abstracts 2015: 2103-2108 - 2014
- [j6]Lily Chen, Xueliang Li, Mengmeng Liu:
Tricyclic graphs with maximal revised Szeged index. Discret. Appl. Math. 177: 71-79 (2014) - [j5]Lily Chen, Xueliang Li, Mengmeng Liu:
The (revised) Szeged index and the Wiener index of a nonbipartite graph. Eur. J. Comb. 36: 237-246 (2014) - 2013
- [j4]Lily Chen, Xueliang Li, Huishu Lian:
Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs. Graphs Comb. 29(5): 1235-1247 (2013) - [j3]Lily Chen, Xueliang Li, Huishu Lian:
Further hardness results on the rainbow vertex-connection number of graphs. Theor. Comput. Sci. 481: 18-23 (2013) - 2011
- [j2]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of a graph. Theor. Comput. Sci. 412(35): 4531-4535 (2011) - [i6]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of graphs. CoRR abs/1101.3126 (2011) - [i5]Lily Chen, Xueliang Li, Huishu Lian:
Further hardness results on the rainbow vertex-connection number of graphs. CoRR abs/1110.1915 (2011) - [i4]Sean Turner, Lily Chen:
MD2 to Historic Status. RFC 6149: 1-7 (2011) - [i3]Sean Turner, Lily Chen:
MD4 to Historic Status. RFC 6150: 1-10 (2011) - [i2]Sean Turner, Lily Chen:
Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms. RFC 6151: 1-7 (2011) - [i1]Tim Polk, Lily Chen, Sean Turner, Paul E. Hoffman:
Security Considerations for the SHA-0 and SHA-1 Message-Digest Algorithms. RFC 6194: 1-7 (2011)
2000 – 2009
- 2005
- [j1]Haidar Chamas, William Bjorkman, Stephen Liu, Lily Chen, Mohamed A. Ali:
Verizon experience with ng ethernet services: evolution to a converged layer 1, 2 network. IEEE Commun. Mag. 43(8): s18-s25 (2005)
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-10-04 20:59 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:
