Jin-Yi Cai

Algorithms & Complexity · 1989–2003

A researcher in the Science corpus: 3 papers; trusts 7 researchers and is trusted by 26 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 18 citations into it; #152 of 516 by trust here, #163 by citations

Whom Jin-Yi Cai trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Eugene M. Luks
2. László Babai
3. Derek Gordon Corneil
4. Peter J. Cameron

Who trusts Jin-Yi Cai overall

1. Christopher Morris
2. Zhengdao Chen
3. Sandra Kiefer
4. B. Douglas
5. Keyulu Xu
6. Martin Grohe
7. Petra Mutzel
8. Sergei Evdokimov
9. Tommi A. Junttila
10. Oleg Pikhurko

Papers from Jin-Yi Cai's perspective

Ordered by how strongly the researchers Jin-Yi Cai trusts endorse each paper. Same corpus, a different order for every researcher.

1. Random Graph Isomorphism
2. Updating XML (ACM SIGMOD Conference)
3. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems
4. A Note on the Graph Isomorphism counting Problem
5. Graph isomorphism problem
6. Detecting changes in XML documents (Proceedings / International Conference on Data Engineering)
7. Isomorphism of graphs of bounded valence can be tested in polynomial time
8. On construction and identification of graphs
9. The graph isomorphism disease
10. 6-Transitive graphs

Their papers

• X-Diff: an effective change detection algorithm for XML documents (2003) — 437 citations
• An optimal lower bound on the number of variables for graph identification (1992)
• An optimal lower bound on the number of variables for graph identification (1989)