Lily Chen

Orcid: 0000-0002-3487-4967

According to our database1, Lily Chen authored at least 26 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FactPICO: Factuality Evaluation for Plain Language Summarization of Medical Evidence.
CoRR, 2024

2022
The effect of vertex and edge deletion on the edge metric dimension of graphs.
J. Comb. Optim., 2022

The inclusion-free edge-colorings of (3, Δ)-bipartite graphs.
Discret. Appl. Math., 2022

A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs.
Axioms, 2022

2020
The strong chromatic index of graphs with edge weight eight.
J. Comb. Optim., 2020

The strong edge-coloring for graphs with small edge weight.
Discret. Math., 2020

Network Error Logging: Client-side measurement of end-to-end web service reliability.
Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation, 2020

2019
DP-4-colorability of two classes of planar graphs.
Discret. Math., 2019

Strong edge-coloring for planar graphs with large girth.
Discret. Math., 2019

2018
On the [1, 2]-domination number of generalized Petersen graphs.
Appl. Math. Comput., 2018

2017
A solution to a conjecture on the generalized connectivity of graphs.
J. Comb. Optim., 2017

2016
Hardness results for total rainbow connection of graphs.
Discuss. Math. Graph Theory, 2016

Bicyclic graphs with maximal edge revised Szeged index.
Discret. Appl. Math., 2016

2015
The 3-rainbow index of a graph.
Discuss. Math. Graph Theory, 2015

Exploring the Use of Google Glass in Wet Laboratories.
Proceedings of the 33rd Annual ACM Conference Extended Abstracts on Human Factors in Computing Systems, 2015

2014
The (revised) Szeged index and the Wiener index of a nonbipartite graph.
Eur. J. Comb., 2014

Tricyclic graphs with maximal revised Szeged index.
Discret. Appl. Math., 2014

2013
Further hardness results on the rainbow vertex-connection number of graphs.
Theor. Comput. Sci., 2013

Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs.
Graphs Comb., 2013

2011
Security Considerations for the SHA-0 and SHA-1 Message-Digest Algorithms.
RFC, March, 2011

Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms.
RFC, March, 2011

MD4 to Historic Status.
RFC, March, 2011

MD2 to Historic Status.
RFC, March, 2011

The complexity of determining the rainbow vertex-connection of a graph.
Theor. Comput. Sci., 2011

The complexity of determining the rainbow vertex-connection of graphs
CoRR, 2011

2005
Verizon experience with ng ethernet services: evolution to a converged layer 1, 2 network.
IEEE Commun. Mag., 2005


  Loading...