| Sl. No. | Name | Poster Title |
| 1 | Arka Ray | Hypergraph (Linearly Ordered) Coloring |
| 2 | Hritiz Gogoi | On Exactness of Semidefinite Programming Relaxation for the Max-Cut Problem |
| 3 | Kartik Vilas Tathe | Non Homogeneous Generalized Fractional Skellam Process |
| 4 | Maruf Alam Tarafdar | Collision of Random Walks in Case of Crossing |
| 5 | Padmapriya S | Establishing Separation Between Computational Complexity Measures Using Projective Geometry |
| 6 | Pinki Pradhan | Improved Sub-Linear Time Moment Estimation Using Weighted Sampling |
| 7 | Rameesh Paul | Robust Algorithms for Recovering Planted r-Colorable Graphs |
| 8 | Satanu Das | A direct proof of a unified law of robustness for Bregman divergence losses. |
| 9 | Shaon Naskar | Polynomials and Their Applications in Optimization |