On a Theorem of Lovász that hom(·, H) Determines the Isomorhphism Type of H. - Jin-Yi Cai; Artem Govorov (CoRR, 2019)

Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs. - Jin-Yi Cai; Artem Govorov (FOCS, 2020)

On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of H. - Jin-Yi Cai; Artem Govorov (ITCS, 2020)

The complexity of counting edge colorings for simple graphs. - Jin-Yi Cai; Artem Govorov (Theor. Comput. Sci., 2021)

On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H. - Jin-yi Cai; Artem Govorov (ACM Trans. Comput. Theory, 2021)

Perfect matchings, rank of connection tensors and graph homomorphisms. - Jin-Yi Cai; Artem Govorov (Comb. Probab. Comput., 2022)

A dichotomy for bounded degree graph homomorphisms with nonnegative weights. - Artem Govorov; Jin-Yi Cai; Martin E. Dyer (J. Comput. Syst. Sci., 2023)