1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2024★ 1 cited
Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
Jin-Yi Cai, Ashwin Maran
We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many l…
cs.DS2022★ 1 cited
Counting Cycles on Planar Graphs in Subexponential Time
Jin-Yi Cai, Ashwin Maran
We study the problem of counting all cycles or self-avoiding walks (SAWs) on triangulated planar graphs. We present a subexponential time algorithm for this count…