1 citations · 3 across the 4 of their papers we have counts for
4 papers
On finding highly connected spanning subgraphs
Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan +1
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph and an integer for every pair of vertices . The objective is to c…
Separation dimension of bounded degree graphs
Noga Alon, Manu Basavaraju, L. Sunil Chandran +2
The 'separation dimension' of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in…
Separation dimension of sparse graphs
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
The separation dimension of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in $…
Acyclic Edge Coloring of Triangle Free Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…