activity
20122020
most citedTwo Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings

1 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2018

On Independent Cliques and Linear Complementarity Problems

Karan N. Chadha, Ankur A. Kulkarni

In recent work (Pandit and Kulkarni [Discrete Applied Mathematics, 244 (2018), pp. 155--169]), the independence number of a graph was characterized as the maximum of the n…