Chaitanya Nalam

collaborators

2 papers

math.CO2026

Joins and ear decompositions beyond graphic matroids

Yuhang Bai, KristÃ³f BÃ©rczi, Chaitanya Nalam

For a matroid $M$ , a join is a set $J \subseteq E (M)$ that meets every circuit $C$ in at most $∣ C ∣/2$ elements. Let $I^¼ (M)$ denote the maximum size of a join. Motivated by Frank's m…

cs.DS2025

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness

Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak +1

We give a deterministic algorithm for computing a global minimum vertex cut in a vertex-weighted graph $n$ vertices and $m$ edges in $O (mn)$ time. This breaks the long-sta…