5 citations · 11 across the 11 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Faster Algorithms for Finding Small Induced Patterns in Sparse Host Graphs
Priyanshi Agrawal, Balagopal Komarath
We study algorithms for detecting induced subgraphs corresponding to fixed pattern graphs in host graphs. We show that at least five of the 21 connected graphs on five vertices can…
cs.CC2026
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
Balagopal Komarath, Harshil Mittal, Jayalal Sarma
Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomi…