Artem Govorov

According to our database, Artem Govorov authored at least 7 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

A dichotomy for bounded degree graph homomorphisms with nonnegative weights.

Artem Govorov, Jin-Yi Cai, Martin E. Dyer

J. Comput. Syst. Sci., 2023

2022

Perfect matchings, rank of connection tensors and graph homomorphisms.

Jin-Yi Cai, Artem Govorov

Comb. Probab. Comput., 2022

2021

On a Theorem of Lovász that (&sdot, <i>H</i>) Determines the Isomorphism Type of <i>H</i>.

Jin-yi Cai, Artem Govorov

ACM Trans. Comput. Theory, 2021

The complexity of counting edge colorings for simple graphs.

Jin-Yi Cai, Artem Govorov

Theor. Comput. Sci., 2021

2020

On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of H.

Jin-Yi Cai, Artem Govorov

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs.

Jin-Yi Cai, Artem Govorov

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

On a Theorem of Lovász that hom(·, H) Determines the Isomorhphism Type of H.

Jin-Yi Cai, Artem Govorov

CoRR, 2019