On cross-intersecting families of independent sets in graphs. - Vikram Kamat (Australas. J Comb., 2011)

Stability Analysis for k-wise Intersecting Families. - Vikram Kamat (Electron. J. Comb., 2011)

Erdos-Ko-Rado theorems for chordal graphs and trees. - Glenn Hurlbert; Vikram Kamat (J. Comb. Theory A, 2011)

Tight Co-Degree Condition for Perfect Matchings in 4-Graphs. - Andrzej Czygrinow; Vikram Kamat (Electron. J. Comb., 2012)

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. - Prachi Goyal; Vikram Kamat; Neeldhara Misra (MFCS, 2013)

On the Parameterized Complexity of the Maximum Edge Coloring Problem. - Prachi Goyal; Vikram Kamat; Neeldhara Misra (CoRR, 2013)

An Erdős–Ko–Rado theorem for matchings in the complete graph - Vikram Kamat; Neeldhara Misra (CoRR, 2013)

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. - Vikram Kamat; Neeldhara Misra (CIAC, 2015)

Spotting Trees with Few Leaves. - Andreas Björklund; Vikram Kamat; Lukasz Kowalik; Meirav Zehavi (SIAM J. Discret. Math., 2017)

New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems. - Glenn Hurlbert; Vikram Kamat (Discret. Math., 2018)

Erdős-Ko-Rado theorems on the weak Bruhat lattice. - Susanna Fishel; Glenn Hurlbert; Vikram Kamat; Karen Meagher (Discret. Appl. Math., 2019)

Cut-Colorings in Coloring Graphs. - Prateek Bhakta; Benjamin Brett Buckner; Lauren Farquhar; Vikram Kamat; Sara Krehbiel; Heather M. Russell (Graphs Comb., 2019)

An Erdős-Ko-Rado theorem for unions of length 2 paths. - Carl Feghali; Glenn Hurlbert; Vikram Kamat (Discret. Math., 2020)

On intersecting families of independent sets in trees. - Glenn Hurlbert; Vikram Kamat (Discret. Appl. Math., 2022)

On intersecting families of subgraphs of perfect matchings. - Melissa Fuentes; Vikram Kamat (Discret. Math., 2025)