| 2025 | SETTA | WEX: Formal Specifications for Windows in Stream Processing. | S. Hitarth, M. Praveen |
| 2024 | SOFSEM | On the Piecewise Complexity of Words and Periodic Words. | M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard |
| 2022 | DLT | Checking Regular Invariance Under Tightly-Controlled String Modifications. | C. Aiswarya, Sahil Mhaskar, M. Praveen |
| 2022 | TIME | Realizability Problem for Constraint LTL. | Ashwin Bhaskar, M. Praveen |
| 2019 | CONCUR | Verification of Flat FIFO Systems. | Alain Finkel, M. Praveen |
| 2018 | LICS | Playing with Repetitions in Data Words Using Energy Games. | Diego Figueira, M. Praveen |
| 2016 | ICALP | Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. | M. Praveen, B. Srivathsan |
| 2015 | PODS | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | M. Praveen, B. Srivathsan |
| 2014 | CSL | Hyper-Ackermannian bounds for pushdown vector addition systems. | Jrme Leroux, M. Praveen, Grgoire Sutre |
| 2013 | CONCUR | A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. | Jrme Leroux, M. Praveen, Grgoire Sutre |
| 2013 | LICS | Reasoning about Data Repetitions with Counter Systems. | Stphane Demri, Diego Figueira, M. Praveen |
| 2011 | CONCUR | Parameterized Complexity Results for 1-safe Petri Nets. | M. Praveen, Kamal Lodaya |
| 2010 | MFCS | Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). | M. Praveen |