| 2026 | AAAI | Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs. | Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman, Diya Roy, Abhishek Sahu |
| 2023 | WADS | Dominator Coloring and CD Coloring in Almost Cluster Graphs. | Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman |
| 2022 | CSR | Output Sensitive Fault Tolerant Maximum Matching. | Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh |
| 2022 | WALCOM | Structural Parameterizations of Budgeted Graph Coloring. | Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman |
| 2021 | COCOON | Sublinear-Space Approximation Algorithms for Max r-SAT. | Arindam Biswas, Venkatesh Raman |
| 2021 | FCT | Faster FPT Algorithms for Deletion to Pairs of Graph Classes. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2021 | SOFSEM | Parameterizing Role Coloring on Forests. | Sukanya Pandey, Venkatesh Raman, Vibha Sahlot |
| 2020 | MFCS | Approximation in (Poly-) Logarithmic Space. | Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2020 | WG | Recognizing k-Clique Extendible Orderings. | Mathew C. Francis, Rian Neogi, Venkatesh Raman |
| 2019 | COCOON | Fully Dynamic Arboricity Maintenance. | Niranka Banerjee, Venkatesh Raman, Saket Saurabh |
| 2019 | COCOON | Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. | Ashwin Jacob, Venkatesh Raman, Vibha Sahlot |
| 2019 | CSR | Parameterized Complexity of Conflict-Free Set Cover. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2019 | IWOCA | Fixed-Parameter Tractability of (n-k) List Coloring. | Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman |
| 2019 | IWOCA | Solving Group Interval Scheduling Efficiently. | Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2018 | CSR | Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. | Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | CSR | Structural Parameterizations of Dominating Set Variants. | Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman |
| 2018 | ESA | A Framework for In-place Graph Algorithms. | Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | FAW | Some (in)tractable Parameterizations of Coloring and List-Coloring. | Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman |
| 2018 | LATIN | A Polynomial Sized Kernel for Tracking Paths Problem. | Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2017 | FAW | The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. | Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti |
| 2017 | FAW | FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. | Diptapriyo Majumdar, Venkatesh Raman |
| 2017 | WADS | Parameterized Complexity of Geometric Covering Problems Having Conflicts. | Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh |
| 2016 | AAAI | Ontology Re-Engineering: A Case Study from the Automotive Industry. | Nestor Rychtyckyj, Venkatesh Raman, Baskaran Sankaranarayanan, P. Sreenivasa Kumar, Deepak Khemani |
| 2016 | COCOON | Improved Space Efficient Algorithms for BFS, DFS and Applications. | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman |
| 2016 | ISAAC | Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. | Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti |
| 2016 | MFCS | Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. | Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh |
| 2016 | WALCOM | Finding Mode Using Equality Comparisons. | Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti |
| 2016 | WG | Harmonious Coloring: Parameterized Algorithms and Upper Bounds. | Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale |
| 2015 | COCOON | Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh |
| 2015 | ICALP | Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. | Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman |
| 2015 | SPLC | SAT-based analysis of large real-world feature models is easy. | Jia Hui (Jimmy) Liang, Vijay Ganesh, Krzysztof Czarnecki, Venkatesh Raman |
| 2015 | WADS | Sorting and Selection with Equality Comparisons. | Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti |
| 2014 | ESA | LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. | Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman |
| 2014 | ESA | Improved Explicit Data Structures in the Bitprobe Model. | Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman |
| 2014 | ISAAC | Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. | Hicham El-Zein, J. Ian Munro, Venkatesh Raman |
| 2014 | ISAAC | Vertex Cover Reconfiguration and Beyond. | Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman |
| 2014 | IWOCA | Space Efficient Data Structures for Nearest Larger Neighbor. | Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti |
| 2014 | SODA | Selection and Sorting in the "Restore" Model. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | Succinct Data Structures for Representing Equivalence Classes. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | Less Space: Indexing for Queries with Wildcards. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan |
| 2013 | SAT | Upper and Lower Bounds for Weak Backdoor Set Detection. | Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider |
| 2013 | WALCOM | Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem. | Venkatesh Raman, Bal Sri Shankar |
| 2013 | WALCOM | An FPT Algorithm for Tree Deletion Set. | Venkatesh Raman, Saket Saurabh, Ondrej Such |
| 2013 | WG | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2012 | LATIN | Parameterized Complexity of MaxSat above Average. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
| 2012 | STACS | LP can be a cure for Parameterized Problems. | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2012 | SAT | Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo |
| 2012 | WG | Parameterized Algorithms for Even Cycle Transversal. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | COCOON | On Parameterized Independent Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
| 2011 | ESA | Paths, Flowers and Vertex Cover. | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | ISAAC | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | SODA | Bidimensionality and EPTAS. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | AAAI | Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | MFCS | Solving minones-2-sat as Fast as vertex cover. | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
| 2010 | STACS | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | WALCOM | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2010 | WG | A Quartic Kernel for Pathwidth-One Vertex Deletion. | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
| 2009 | CSR | The Budgeted Unique Coverage Problem and Color-Coding. | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | ESA | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
| 2008 | COCOA | Parameterized Algorithms for Generalized Domination. | Venkatesh Raman, Saket Saurabh, Sriganesh Srihari |
| 2008 | ISAAC | Knig Deletion Sets and Vertex Covers above the Matching Size. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2007 | ISAAC | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
| 2007 | ISAAC | The Parameterized Complexity of the Unique Coverage Problem. | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
| 2004 | CPM | A Simple Optimal Representation for Balanced Parentheses. | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
| 2004 | SODA | Succinct ordinal trees with level-ancestor queries. | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
| 2003 | ICALP | Succinct Representations of Permutations. | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2003 | WADS | Parameterized Complexity of Directed Feedback Set Problems in Tournaments. | Venkatesh Raman, Saket Saurabh |
| 2002 | ISAAC | Approximation Algorithms for Some Parameterized Counting Problems. | Vikraman Arvind, Venkatesh Raman |
| 2002 | ISAAC | Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
| 2002 | SODA | Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | ESA | Explicit Deterministic Constructions for Membership in the Bitprobe Model. | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | SODA | Representing dynamic binary trees succinctly. | J. Ian Munro, Venkatesh Raman, Adam J. Storm |
| 2001 | WADS | Succinct Dynamic Data Structures. | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2000 | COCOON | Parameterized Complexity of Finding Subgraphs with Hereditary Properties. | Subhash Khot, Venkatesh Raman |
| 1999 | ISAAC | Upper Bounds for MaxSat: Further Improved. | Nikhil Bansal, Venkatesh Raman |
| 1999 | ISAAC | Static Dictionaries Supporting Rank. | Venkatesh Raman, S. Srinivasa Rao |
| 1999 | WADS | Representing Trees of Higer Degree. | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman |
| 1997 | FOCS | Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. | J. Ian Munro, Venkatesh Raman |
| 1995 | LATIN | Tight Bounds for Finding Degrees from the Adjacency Matrix. | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
| 1993 | WADS | The Complexity of Finding Certain Trees in Tournaments. | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
| 1991 | WADS | Sorting Multisets and Vectors In-Place. | J. Ian Munro, Venkatesh Raman |
| 1989 | WADS | Sorting with Minimum Data Movement (Preliminary Draft). | J. Ian Munro, Venkatesh Raman |