A Bridge between Polynomial Optimization and Games with Imperfect Recall. - Hugo Gimbert; Soumyajit Paul; B. Srivathsan (AAMAS, 2020)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

On the algorithmic complexity of two player zero-sum games of finite duration with imperfect information. (Sur la complexité des jeux à somme nulle à deux joueurs de durée finie avec information imparfaite). - Soumyajit Paul (2023)

Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata. - Yong Li 031; Soumyajit Paul; Sven Schewe; Qiyi Tang 001 (CAV (2), 2025)

Resolving Nondeterminism by Chance. - Soumyajit Paul; David Purser; Sven Schewe; Qiyi Tang 001; Patrick Totzke; Di-De Yen (CONCUR, 2025)

Simplifying Imperfect Recall Games. - Hugo Gimbert; Soumyajit Paul; B. Srivathsan (AAMAS, 2025)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games. - Vincent Cheval; Florian Horn; Soumyajit Paul; Mahsa Shirmohammadi (CoRR, 2025)