Zilin Jiang

According to our database1, Zilin Jiang authored at least 12 papers between 2014 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Cooperative Colorings of Trees and of Bipartite Graphs.
Electron. J. Comb., 2020

2019
On Capacities of the Two-User Union Channel With Complete Feedback.
IEEE Trans. Inf. Theory, 2019

On the metric dimension of Cartesian powers of a graph.
J. Comb. Theory, Ser. A, 2019

On spectral radii of unraveled balls.
J. Comb. Theory, Ser. B, 2019

Rainbow Fractional Matchings.
Comb., 2019

How to guess an n-digit number.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Ramsey-nice families of graphs.
Eur. J. Comb., 2018

Bipartite algebraic graphs without quadrilaterals.
Discret. Math., 2018

Finding a best approximation pair of points for two polyhedra.
Comput. Optim. Appl., 2018

2017
Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'.
Comb. Probab. Comput., 2017

A Bound on the Number of Edges in Graphs Without an Even Cycle.
Comb. Probab. Comput., 2017

2014
A Slight Improvement to the Colored Bárány's Theorem.
Electron. J. Comb., 2014


  Loading...