| 2024 | DCC | Succinct Data Structure for Graphs with d-Dimensional t-Representation. | Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane |
| 2024 | STACS | A Faster Algorithm for Vertex Cover Parameterized by Solution Size. | David G. Harris, N. S. Narayanaswamy |
| 2023 | GECCO | Effective Parallelization of the Vehicle Routing Problem. | Rajesh Pandian Muniasamy, Somesh Singh, Rupesh Nasre, N. S. Narayanaswamy |
| 2022 | DCC | Succinct Data Structure for Path Graphs. | Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane |
| 2022 | WALCOM | Parameterized Complexity of Minimum Membership Dominating Set. | Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi |
| 2021 | MFCS | Budgeted Dominating Sets in Uncertain Graphs. | Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan |
| 2020 | GECCO | Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data. | Nirav Patel, N. S. Narayanaswamy, Alok Joshi |
| 2020 | STACS | Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. | S. M. Dhannya, N. S. Narayanaswamy |
| 2019 | COCOON | Data Structures for Incremental Interval Coloring. | Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy |
| 2018 | COCOON | Minimum Membership Hitting Sets of Axis Parallel Segments. | N. S. Narayanaswamy, S. M. Dhannya, C. Ramya |
| 2018 | CSR | Facility Location on Planar Graphs with Unreliable Links. | N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan |
| 2018 | FAW | Exact Algorithms for Allocation Problems. | Sundar Annamalai, N. S. Narayanaswamy |
| 2016 | ESA | Hitting Set for Hypergraphs of Low VC-dimension. | Karl Bringmann, Lszl Kozma, Shay Moran, N. S. Narayanaswamy |
| 2016 | MFCS | On the Complexity Landscape of Connected f-Factor Problems. | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan |
| 2016 | WAOA | A Refined Analysis of Online Path Coloring in Trees. | Astha Chauhan, N. S. Narayanaswamy |
| 2015 | CIAC | Block Sorting Is APX-Hard. | N. S. Narayanaswamy, Swapnoneel Roy |
| 2015 | CSR | Approximation and Exact Algorithms for Special Cases of Connected f-Factors. | N. S. Narayanaswamy, C. S. Rahul |
| 2015 | WALCOM | Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. | Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna |
| 2014 | ESA | LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. | Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman |
| 2014 | WALCOM | On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. | N. S. Narayanaswamy, G. Ramakrishna |
| 2013 | WAOA | Approximability of Connected Factors. | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul |
| 2012 | ICAART | Planning for the Convoy Movement Problem. | Anand Kumar, I. Murugeswari, Deepak Khemani, N. S. Narayanaswamy |
| 2012 | STACS | LP can be a cure for Parameterized Problems. | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2012 | WALCOM | Generalized Above Guarantee Vertex Cover and r-Partization. | R. Krithika, N. S. Narayanaswamy |
| 2011 | WALCOM | A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. | Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan |
| 2010 | MFCS | Solving minones-2-sat as Fast as vertex cover. | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
| 2009 | COMAD | TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases. | Saurabh Kejriwal, N. S. Narayanaswamy |
| 2009 | FlAIRS | Tuning Search Heuristics for Classical Planning with Macro Actions. | I. Murugeswari, N. S. Narayanaswamy |
| 2006 | COCOON | Sequences Characterizing | Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber |
| 2004 | COCOON | On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. | L. Sunil Chandran, N. S. Narayanaswamy |
| 2004 | COCOON | Dynamic Storage Allocation and On-Line Colouring Interval Graphs. | N. S. Narayanaswamy |
| 2004 | SAT | Algorithms for Satisfiability using Independent Sets of Variables. | Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy |
| 2004 | SAT | Algorithms for Satisfiability Using Independent Sets of Variables. | Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy |
| 2002 | MFCS | An Optimal Lower Bound for Resolution with 2-Conjunctions. | Jan Johannsen, N. S. Narayanaswamy |
| 2002 | STACS | On the Complexity of Protein Similarity Search under mRNA Structure Constraints. | Rolf Backofen, N. S. Narayanaswamy, Firas Swidan |
| 2001 | COCOON | On Assigning Prefix Free Codes to the Vertices of a Graph. | N. S. Narayanaswamy, C. E. Veni Madhavan |