Ranked Document Retrieval with Forbidden Pattern. - Sudip Biswas; Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (CPM, 2015)

Restricted Shortest Path in Temporal Graphs. - Sudip Biswas; Arnab Ganguly 002; Rahul Shah 001 (DEXA (1), 2015)

Forbidden Extension Queries. - Sudip Biswas; Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (FSTTCS, 2015)

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. - Arnab Ganguly 002; Wing-Kai Hon; Kunihiko Sadakane; Rahul Shah 001; Sharma V. Thankachan; Yilin Yang (CPM, 2016)

Space-Time Trade-Offs for the Shortest Unique Substring Problem. - Arnab Ganguly 002; Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan (ISAAC, 2016)

A Framework for Dynamic Parameterized Dictionary Matching. - Arnab Ganguly 002; Wing-Kai Hon; Rahul Shah 001 (SWAT, 2016)

Parameterized Pattern Matching - Succinctly. - Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (CoRR, 2016)

Stabbing Colors in One Dimension. - Arnab Ganguly 002; Wing-Kai Hon; Rahul Shah 001 (DCC, 2017)

Structural Pattern Matching - Succinctly. - Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (ISAAC, 2017)

pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems. - Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (SODA, 2017)

A Large-Scale Network with Moving Servers. - Arnab Ganguly 002; Kavita Ramanan; Philippe Robert; Wen Sun (SIGMETRICS Perform. Evaluation Rev., 2017)

Space-time trade-offs for finding shortest unique substrings and maximal unique matches. - Arnab Ganguly 002; Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan (Theor. Comput. Sci., 2017)

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. - Paniz Abedin; Arnab Ganguly 002; Wing-Kai Hon; Yakov Nekrich; Kunihiko Sadakane; Rahul Shah 001; Sharma V. Thankachan (COCOON, 2018)

The Heaviest Induced Ancestors Problem Revisited. - Paniz Abedin; Sahar Hooshmand; Arnab Ganguly 002; Sharma V. Thankachan (CPM, 2018)

A Linear Space Data Structure for Range LCP Queries. - Arnab Ganguly 002; Manish Patil; Rahul Shah 001; Sharma V. Thankachan (Fundam. Informaticae, 2018)

Space-efficient indexes for forbidden extension queries. - Sudip Biswas; Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (J. Discrete Algorithms, 2018)

Ranked document retrieval for multiple patterns. - Sudip Biswas; Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (Theor. Comput. Sci., 2018)

I/O Optimal Data Structures for Categorical Range Skyline Queries. - Daniel Gibney; Sharma V. Thankachan; Arnab Ganguly 002; Rahul Shah 001 (CCCG, 2019)

Parameterized Text Indexing with One Wildcard. - Arnab Ganguly 002; Wing-Kai Hon; Yu-An Huang; Solon P. Pissis; Rahul Shah 001; Sharma V. Thankachan (DCC, 2019)

Categorical Range Reporting with Frequencies. - Arnab Ganguly 002; J. Ian Munro; Yakov Nekrich; Rahul Shah 001; Sharma V. Thankachan (ICDT, 2019)

Range Shortest Unique Substring Queries. - Paniz Abedin; Arnab Ganguly 002; Solon P. Pissis; Sharma V. Thankachan (SPIRE, 2019)

Context-Aware Design of Cyber-Physical Human Systems (CPHS). - Supratik Mukhopadhyay; Subhajit Sidhanta; Arnab Ganguly 002; Qun Liu 004; Edward Collier; Yimin Zhu; Ravindra Gudishala; Chanachok Chokwitthaya; Robert DiBiano; Alimire Nabijiang; Sanaz Saeidi (COMSNETS, 2020)

FM-Index Reveals the Reverse Suffix Array. - Arnab Ganguly 002; Daniel Gibney; Sahar Hooshmand; M. Oguzhan Külekci; Sharma V. Thankachan (CPM, 2020)

Succinct Non-overlapping Indexing. - Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (Algorithmica, 2020)

Efficient Data Structures for Range Shortest Unique Substring Queries. - Paniz Abedin; Arnab Ganguly 002; Solon P. Pissis; Sharma V. Thankachan (Algorithms, 2020)

A linear-space data structure for range-LCP queries in poly-logarithmic time. - Paniz Abedin; Arnab Ganguly 002; Wing-Kai Hon; Kotaro Matsuda; Yakov Nekrich; Kunihiko Sadakane; Rahul Shah 001; Sharma V. Thankachan (Theor. Comput. Sci., 2020)

LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching. - Arnab Ganguly 002; Dhrumil Patel; Rahul Shah 001; Sharma V. Thankachan (ICALP, 2021)

I/O-optimal categorical 3-sided skyline queries. - Arnab Ganguly 002; Daniel Gibney; Sharma V. Thankachan; Rahul Shah 001 (Theor. Comput. Sci., 2021)

A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. - Arnab Ganguly 002; Wing-Kai Hon; Kunihiko Sadakane; Rahul Shah 001; Sharma V. Thankachan; Yilin Yang (Theor. Comput. Sci., 2021)

Fully Functional Parameterized Suffix Trees in Compact Space. - Arnab Ganguly 002; Rahul Shah 001; Sharma V. Thankachan (ICALP, 2022)

The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. - Paniz Abedin; Sahar Hooshmand; Arnab Ganguly 002; Sharma V. Thankachan (Algorithmica, 2022)

On the Hardness of Wildcard Pattern Matching on de Bruijn Graphs. - Arnab Ganguly 002; Daniel Gibney; Arghya Kusum Das; Sharma V. Thankachan (ICCABS, 2023)

Bounded-Ratio Gapped String Indexing. - Arnab Ganguly 002; Daniel Gibney; Paul Macnichol; Sharma V. Thankachan (SPIRE, 2024)

Two-Dimensional Longest Common Extension Queries in Compact Space. - Arnab Ganguly 002; Daniel Gibney; Rahul Shah 001; Sharma V. Thankachan (STACS, 2025)