Employment
-
Indian Institute of Technology Hyderabad Associate Professor
Education
Education history is unavailable.
Projects & Funding
Projects & funding information is unavailable.
Publications (52)
- Bounds and Hardness Results for Conflict-Free Choosability Save
- An approximation algorithm for zero forcing Save
- Conflict-free coloring on subclasses of perfect graphs and bipartite graphs Save
- Some Bounds on the Threshold Dimension of Graphs Save
- Streaming Algorithms for Conflict-Free Coloring Save
- Extremal Results on Conflict‐Free Coloring Save
- Flexible list colorings: Maximizing the number of requests satisfied Save
- Pliable Index Coding via Conflict-Free Colorings of Hypergraphs Save
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring Save
- Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem Save