Cutting through Regular Post Embedding Problems. - Prateek Karandikar; Philippe Schnoebelen (CSR, 2012)

Unidirectional Channel Systems Can Be Tested. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (IFIP TCS, 2012)

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. - Prateek Karandikar; Sylvain Schmitz (FoSSaCS, 2013)

On the index of Simon's congruence for piecewise testability. - Prateek Karandikar; Philippe Schnoebelen (CoRR, 2013)

On the State Complexity of Closures and Interiors of Regular Languages with Subwords. - Prateek Karandikar; Philippe Schnoebelen (DCFS, 2014)

Decidability in the Logic of Subsequences and Supersequences. - Prateek Karandikar; Philippe Schnoebelen (FSTTCS, 2015)

On Reachability for Unidirectional Channel Systems Extended with Regular Tests. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (Log. Methods Comput. Sci., 2015)

Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. - Prateek Karandikar; Philippe Schnoebelen (CoRR, 2015)

On the index of Simon's congruence for piecewise testability. - Prateek Karandikar; Manfred Kufleitner; Philippe Schnoebelen (Inf. Process. Lett., 2015)

Generalized Post Embedding Problems. - Prateek Karandikar; Philippe Schnoebelen (Theory Comput. Syst., 2015)

Subwords : automata, embedding problems, and verification. (Sous-mots : automates, problèmes de plongement, et vérification). - Prateek Karandikar (2015)

The Height of Piecewise-Testable Languages with Applications in Logical Complexity. - Prateek Karandikar; Philippe Schnoebelen (CSL, 2016)

On the state complexity of closures and interiors of regular languages with subwords and superwords. - Prateek Karandikar; Matthias Niewerth; Philippe Schnoebelen (Theor. Comput. Sci., 2016)

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. - Jean Goubault-Larrecq; Simon Halfon; Prateek Karandikar; K. Narayan Kumar; Philippe Schnoebelen (CoRR, 2019)

The height of piecewise-testable languages and the complexity of the logic of subwords. - Prateek Karandikar; Philippe Schnoebelen (Log. Methods Comput. Sci., 2019)