1. Trade-offs in dynamic coloring for bipartite and general graphs

Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potlury. In Algorithmica.

2.  Dynamic Data Structures for interval coloring

 Girish Raguvir J., Manas Jyoti Kashyop, N. S. Narayanaswamy. In Theoretical Computer Science.

3.  Lazy or eager dynamic matching may not be fast

Manas Jyoti Kashyop and N. S. Narayanaswamy. In Information Processing Letters.

4.  Faster Algorithms for shortest path and network flow based on graph decomposition 

Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane. In Journal of Graph Algorithms and Applications.

1. Data structures for incremental interval coloring

Girish Raguvir J., Manas Jyoti Kashyop, N. S. Narayanaswamy. In COCOON 2019.

2.  Faster network algorithms based on graph decomposition

Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane. In  WALCOM 2018.

1. An Invitation to Dynamic Graph Problems: Basics - I 

Manas Jyoti Kashyop and N. S. Narayanaswamy. In Resonance, August 2022. 

2. An Invitation to Dynamic Graph Problems: Upper Bounds- II 

Manas Jyoti Kashyop and N. S. Narayanaswamy. In Resonance, September 2022. 

3. An Invitation to Dynamic Graph Problems: Lower Bounds- III 

Manas Jyoti Kashyop and N. S. Narayanaswamy. In Resonance, October 2022.