Sorting with Minimum Data Movement (Preliminary Draft). - J. Ian Munro; Venkatesh Raman 001 (WADS, 1989)

Stable in Situ Sorting and Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001; Jeffrey S. Salowe (BIT, 1990)

Fast Sorting In-Place Sorting with O(n) Data. - J. Ian Munro; Venkatesh Raman 001 (FSTTCS, 1991)

Sorting Multisets and Vectors In-Place. - J. Ian Munro; Venkatesh Raman 001 (WADS, 1991)

Selection from Read-Only Memory and Sorting with Optimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (FSTTCS, 1992)

Sorting with Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (J. Algorithms, 1992)

The Complexity of Finding Certain Trees in Tournaments. - R. Balasubramanian; Venkatesh Raman 001; G. Srinivasaraghavan 001 (WADS, 1993)

Path Balance Heuristic for Self-Adjusting Binary Search Trees. - R. Balasubramanian; Venkatesh Raman 001 (FSTTCS, 1995)

Tight Bounds for Finding Degrees from the Adjacency Matrix. - R. Balasubramanian; Venkatesh Raman 001; G. Srinivasaraghavan 001 (LATIN, 1995)

Fast Stable In-Place Sorting with O (n) Data Moves. - J. Ian Munro; Venkatesh Raman 001 (Algorithmica, 1996)

Selection from Read-Only Memory and Sorting with Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (Theor. Comput. Sci., 1996)

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. - J. Ian Munro; Venkatesh Raman 001 (FOCS, 1997)

Parametrizing Above Guaranteed Values: MaxSat and MaxCut - Meena Mahajan; Venkatesh Raman 001 (Electron. Colloquium Comput. Complex., 1997)

Finding Scores in Tournaments. - R. Balasubramanian; Venkatesh Raman 001; G. Srinivasaragavan (J. Algorithms, 1997)

Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. - Venkatesh Raman 001; Sarnath Ramnath (SWAT, 1998)

An Improved Fixed-Parameter Algorithm for Vertex Cover. - R. Balasubramanian; Michael R. Fellows; Venkatesh Raman 001 (Inf. Process. Lett., 1998)

A Simplified NP-Complete MAXSAT Problem. - Venkatesh Raman 001; Bala Ravikumar; S. Srinivasa Rao 001 (Inf. Process. Lett., 1998)

Upper Bounds for MaxSat: Further Improved. - Nikhil Bansal 001; Venkatesh Raman 001 (ISAAC, 1999)

Static Dictionaries Supporting Rank. - Venkatesh Raman 001; S. Srinivasa Rao 001 (ISAAC, 1999)

Representing Trees of Higer Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Venkatesh Raman 001 (WADS, 1999)

Selecting Small Ranks in EREW PRAM. - Sarnath Ramnath; Venkatesh Raman 001 (Inf. Process. Lett., 1999)

Parameterizing above Guaranteed Values: MaxSat and MaxCut. - Meena Mahajan; Venkatesh Raman 001 (J. Algorithms, 1999)

Improved Upper Bounds for Time-Space Trade-offs for Selection. - Venkatesh Raman 001; Sarnath Ramnath (Nord. J. Comput., 1999)

The complexity of irredundant sets parameterized by size. - Rodney G. Downey; Michael R. Fellows; Venkatesh Raman 001 (Discret. Appl. Math., 2000)

Explicit Deterministic Constructions for Membership in the Bitprobe Model. - Jaikumar Radhakrishnan; Venkatesh Raman 001; S. Srinivasa Rao 001 (ESA, 2001)

Representing dynamic binary trees succinctly. - J. Ian Munro; Venkatesh Raman 001; Adam J. Storm (SODA, 2001)

Succinct Dynamic Data Structures. - Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (WADS, 2001)

A tradeoff between search and update in dictionaries. - Jaikumar Radhakrishnan; Venkatesh Raman 001 (Inf. Process. Lett., 2001)

Space Efficient Suffix Trees. - J. Ian Munro; Venkatesh Raman 001; S. Srinivasa Rao 001 (J. Algorithms, 2001)

Succinct Representation of Balanced Parentheses and Static Trees. - J. Ian Munro; Venkatesh Raman 001 (SIAM J. Comput., 2001)

Approximation Algorithms for Some Parameterized Counting Problems. - Vikraman Arvind; Venkatesh Raman 001 (ISAAC, 2002)

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (ISAAC, 2002)

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. - Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (SODA, 2002)

Approximate Counting small subgraphs of bounded treewidth and related problems - Vikraman Arvind; Venkatesh Raman 001 (Electron. Colloquium Comput. Complex., 2002)

Parameterized complexity of finding subgraphs with hereditary properties. - Subhash Khot; Venkatesh Raman 001 (Theor. Comput. Sci., 2002)

Merging and Sorting By Strip Moves. - Meena Mahajan; Raghavan Rama 001; Venkatesh Raman 001; Vijayakumar Sundarrajan (FSTTCS, 2003)

Succinct Representations of Permutations. - J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (ICALP, 2003)

Parameterized Complexity of Directed Feedback Set Problems in Tournaments. - Venkatesh Raman 001; Saket Saurabh 001 (WADS, 2003)

On the pseudoachromatic number of join of graphs. - R. Balasubramanian; Venkatesh Raman 001; Venkataraman Yegnanarayanan (Int. J. Comput. Math., 2003)

Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. - Venkatesh Raman 001; Saket Saurabh 001 (IWPEC, 2004)

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. - Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (ICTCS, 2005)

Representing Trees of Higher Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (Algorithmica, 2005)

Faster algorithms for feedback vertex set. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2005)

Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. - Sushmita Gupta; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2006)

Parameterizing MAX SNP Problems Above Guaranteed Values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (IWPEC, 2006)

Triangles, 4-Cycles and Parameterized (In-)Tractability. - Venkatesh Raman 001; Saket Saurabh 001 (SWAT, 2006)

Approximate Block Sorting. - Meena Mahajan; Raghavan Rama 001; Venkatesh Raman 001; S. Vijaykumar (Int. J. Found. Comput. Sci., 2006)

Succinct ordinal trees with level-ancestor queries. - Richard F. Geary; Rajeev Raman; Venkatesh Raman 001 (ACM Trans. Algorithms, 2006)

Faster fixed parameter tractable algorithms for finding feedback vertex sets. - Venkatesh Raman 001; Saket Saurabh 001; C. R. Subramanian 001 (ACM Trans. Algorithms, 2006)

A simple optimal representation for balanced parentheses. - Richard F. Geary; Naila Rahman; Rajeev Raman; Venkatesh Raman 001 (Theor. Comput. Sci., 2006)

Parameterized algorithms for feedback set problems and their duals in tournaments. - Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2006)

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (ISAAC, 2007)

The Parameterized Complexity of the Unique Coverage Problem. - Hannes Moser; Venkatesh Raman 001; Somnath Sikdar (ISAAC, 2007)

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets - Rajeev Raman; Venkatesh Raman 001; Srinivasa Rao Satti (CoRR, 2007)

Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. - Venkatesh Raman 001; Saket Saurabh 001 (Inf. Process. Lett., 2007)

Parameterized complexity of the induced subgraph problem in directed graphs. - Venkatesh Raman 001; Somnath Sikdar (Inf. Process. Lett., 2007)

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. - Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Theory Comput. Syst., 2007)

Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. - Rajeev Raman; Venkatesh Raman 001; Srinivasa Rao Satti (ACM Trans. Algorithms, 2007)

Parameterized Algorithms for Generalized Domination. - Venkatesh Raman 001; Saket Saurabh 001; Sriganesh Srihari (COCOA, 2008)

König Deletion Sets and Vertex Covers above the Matching Size. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (ISAAC, 2008)

Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. - Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2008)

The Budgeted Unique Coverage Problem and Color-Coding. - Neeldhara Misra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (CSR, 2009)

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ESA, 2009)

On the Directed Degree-Preserving Spanning Tree Problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (IWPEC, 2009)

Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (CoRR, 2009)

Parameterizing above or below guaranteed values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (J. Comput. Syst. Sci., 2009)

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (AAAI, 2010)

The effect of girth on the kernelization complexity of Connected Dominating Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2010)

Solving minones-2-sat as Fast as vertex cover. - Neeldhara Misra; N. S. Narayanaswamy; Venkatesh Raman 001; Bal Sri Shankar (MFCS, 2010)

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. - Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (SWAT, 2010)

A Quartic Kernel for Pathwidth-One Vertex Deletion. - Geevarghese Philip; Venkatesh Raman 001; Yngve Villanger (WG, 2010)

Paths, Flowers and Vertex Cover. - Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (ESA, 2011)

Bidimensionality and EPTAS. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (SODA, 2011)

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (Algorithmica, 2011)

On the directed Full Degree Spanning Tree problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Discret. Optim., 2011)

Lower bounds on kernelization. - Neeldhara Misra; Venkatesh Raman 001; Saket Saurabh 001 (Discret. Optim., 2011)

Subexponential algorithms for partial cover problems. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Process. Lett., 2011)

Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows. - Venkatesh Raman 001 (The Multivariate Algorithmic Revolution and Beyond, 2012)

LP can be a cure for Parameterized Problems. - N. S. Narayanaswamy; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (STACS, 2012)

Parameterized Algorithms for Even Cycle Transversal. - Pranabendu Misra; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (WG, 2012)

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. - Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2012)

FPT algorithms for Connected Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (J. Comb. Optim., 2012)

Faster algorithms for finding and counting subgraphs. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; B. V. Raghavendra Rao (J. Comput. Syst. Sci., 2012)

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. - Sushmita Gupta; Venkatesh Raman 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2012)

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ACM Trans. Algorithms, 2012)

On Parameterized Independent Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2012)

Succinct representations of permutations and functions. - J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2012)

A Survey of Data Structures in the Bitprobe Model. - Patrick K. Nicholson; Venkatesh Raman 001; S. Srinivasa Rao 001 (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2013)

Succinct Data Structures for Representing Equivalence Classes. - Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2013)

Upper and Lower Bounds for Weak Backdoor Set Detection. - Neeldhara Misra; Sebastian Ordyniak; Venkatesh Raman 001; Stefan Szeider (SAT, 2013)

Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem. - Venkatesh Raman 001; Bal Sri Shankar (WALCOM, 2013)

The Parameterized Complexity of Unique Coverage and Its Variants. - Neeldhara Misra; Hannes Moser; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Algorithmica, 2013)

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. - Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2013)

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. - Frederic Dorn; Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Comput., 2013)

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. - Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Comput., 2013)

An FPT algorithm for Tree Deletion Set. - Venkatesh Raman 001; Saket Saurabh 001; Ondrej Suchý 001 (J. Graph Algorithms Appl., 2013)

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. - Pranabendu Misra; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (Theory Comput. Syst., 2013)

Parameterized complexity of MaxSat Above Average. - Robert Crowston; Gregory Z. Gutin; Mark Jones 001; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2013)

Solving min ones 2-sat as fast as vertex cover. - Neeldhara Misra; N. S. Narayanaswamy; Venkatesh Raman 001; Bal Sri Shankar (Theor. Comput. Sci., 2013)

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. - Samuel Fiorini; R. Krithika 001; N. S. Narayanaswamy; Venkatesh Raman 001 (ESA, 2014)

Improved Explicit Data Structures in the Bitprobe Model. - Moshe Lewenstein; J. Ian Munro; Patrick K. Nicholson; Venkatesh Raman 001 (ESA, 2014)

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. - Hicham El-Zein; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2014)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (ISAAC, 2014)

Space Efficient Data Structures for Nearest Larger Neighbor. - Varunkumar Jayapaul; Seungbum Jo; Venkatesh Raman 001; Srinivasa Rao Satti (IWOCA, 2014)

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. - Paul S. Bonsma; Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (IPEC, 2014)

Reconfiguration over Tree Decompositions. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Marcin Wrochna (IPEC, 2014)

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. - Robert Crowston; Gregory Z. Gutin; Mark Jones 001; Venkatesh Raman 001; Saket Saurabh 001; Anders Yeo (Algorithmica, 2014)

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2014)

Faster Parameterized Algorithms Using Linear Programming. - Daniel Lokshtanov; N. S. Narayanaswamy; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (ACM Trans. Algorithms, 2014)

Evolution and Controllability of CancerNetworks: A Boolean Perspective. - Sriganesh Srihari; Venkatesh Raman 001; Hon Wai Leong; Mark A. Ragan (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

Less space: Indexing for queries with wildcards. - Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001; Sharma V. Thankachan (Theor. Comput. Sci., 2014)

Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. - Stefan Kratsch; Marcin Pilipczuk; Ashutosh Rai 001; Venkatesh Raman 001 (ACM Trans. Comput. Theory, 2014)

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Sasanka Roy; Saket Saurabh 001 (COCOON, 2015)

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. - Diptapriyo Majumdar; Venkatesh Raman 001; Saket Saurabh 001 (IPEC, 2015)

SAT-based analysis of large real-world feature models is easy. - Jia Hui (Jimmy) Liang; Vijay Ganesh 001; Krzysztof Czarnecki 001; Venkatesh Raman 001 (SPLC, 2015)

Sorting and Selection with Equality Comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; Srinivasa Rao Satti (WADS, 2015)

Finding median in read-only memory on integer input. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (Theor. Comput. Sci., 2015)

Improved Space Efficient Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001 (COCOON, 2016)

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. - Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (ISAAC, 2016)

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. - Sudeshna Kolay; Fahad Panolan; Venkatesh Raman 001; Saket Saurabh 001 (MFCS, 2016)

Finding Mode Using Equality Comparisons. - Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (WALCOM, 2016)

Space efficient data structures for nearest larger neighbor. - Varunkumar Jayapaul; Seungbum Jo; Rajeev Raman; Venkatesh Raman 001; Srinivasa Rao Satti (J. Discrete Algorithms, 2016)

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001 (CALDAM, 2017)

Exact and Parameterized Algorithms for (k, i)-Coloring. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; Prafullkumar Tale (CALDAM, 2017)

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (FAW, 2017)

FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. - Diptapriyo Majumdar; Venkatesh Raman 001 (FAW, 2017)

On the Succinct Representation of Equivalence Classes. - Hicham El-Zein; Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001; Timothy M. Chan (Algorithmica, 2017)

On the Parameterized Complexity of Reconfiguration Problems. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Narges Simjour; Akira Suzuki 001 (Algorithmica, 2017)

Biconnectivity, st-numbering and other applications of DFS using O(n) bits. - Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2017)

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. - Amer E. Mouawad; Naomi Nishimura; Vinayak Pathak; Venkatesh Raman 001 (SIAM J. Discret. Math., 2017)

Finding modes with equality comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2017)

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. - Niranka Banerjee; Venkatesh Raman 001; Srinivasa Rao Satti (CSR, 2018)

Structural Parameterizations of Dominating Set Variants. - Dishant Goyal; Ashwin Jacob; Kaushtubh Kumar; Diptapriyo Majumdar; Venkatesh Raman 001 (CSR, 2018)

A Framework for In-place Graph Algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (ESA, 2018)

Some (in)tractable Parameterizations of Coloring and List-Coloring. - Pranav Arora; Aritra Banik; Vijay Kumar Paliwal; Venkatesh Raman 001 (FAW, 2018)

Fréchet Distance Between a Line and Avatar Point Set. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot (Algorithmica, 2018)

Approximability of Clique Transversal in Perfect Graphs. - Samuel Fiorini; R. Krithika 001; N. S. Narayanaswamy; Venkatesh Raman 001 (Algorithmica, 2018)

Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. - Diptapriyo Majumdar; Venkatesh Raman 001 (Algorithmica, 2018)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Sebastian Siebertz (Algorithms, 2018)

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. - R. Krithika 001; Diptapriyo Majumdar; Venkatesh Raman 001 (Theory Comput. Syst., 2018)

Space Efficient Linear Time Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (Theory Comput. Syst., 2018)

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. - Diptapriyo Majumdar; Venkatesh Raman 001; Saket Saurabh 001 (Theory Comput. Syst., 2018)

Selection and Sorting in the "Restore" Model. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ACM Trans. Algorithms, 2018)

Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. - Ashwin Jacob; Venkatesh Raman 001; Vibha Sahlot (COCOON, 2019)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

Solving Group Interval Scheduling Efficiently. - Arindam Biswas 001; Venkatesh Raman 001; Saket Saurabh 001 (IWOCA, 2019)

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. - Neeldhara Misra; Fahad Panolan; Ashutosh Rai 001; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2019)

Harmonious coloring: Parameterized algorithms and upper bounds. - Sudeshna Kolay; Ragukumar Pandurangan; Fahad Panolan; Venkatesh Raman 001; Prafullkumar Tale (Theor. Comput. Sci., 2019)

Tractability of König edge deletion problems. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; S. Vaishali 001 (Theor. Comput. Sci., 2019)

Optimal Output Sensitive Fault Tolerant Cuts. - Niranka Banerjee; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2020)

Parameterized Complexity of Deletion to Scattered Graph Classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (IPEC, 2020)

A Polynomial Sized Kernel for Tracking Paths Problem. - Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2020)

Parameterized Complexity of Geometric Covering Problems Having Conflicts. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot; Saket Saurabh 001 (Algorithmica, 2020)

Improved Kernels for Tracking Path Problems. - Pratibha Choudhary; Venkatesh Raman 001 (CoRR, 2020)

Elusiveness of finding degrees. - Dishant Goyal; Varunkumar Jayapaul; Venkatesh Raman 001 (Discret. Appl. Math., 2020)

A characterization of König-Egerváry graphs with extendable vertex covers. - Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (Inf. Process. Lett., 2020)

Fixed-Parameter Tractability of (n - k) List Coloring. - Aritra Banik; Ashwin Jacob; Vijay Kumar Paliwal; Venkatesh Raman 001 (Theory Comput. Syst., 2020)

List-coloring - Parameterizing from triviality. - Pranav Arora; Aritra Banik; Vijay Kumar Paliwal; Venkatesh Raman 001 (Theor. Comput. Sci., 2020)

Fully dynamic arboricity maintenance. - Niranka Banerjee; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

Fixed-parameter tractable algorithms for Tracking Shortest Paths. - Aritra Banik; Pratibha Choudhary; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

Sublinear-Space Approximation Algorithms for Max r-SAT. - Arindam Biswas 001; Venkatesh Raman 001 (COCOON, 2021)

Faster FPT Algorithms for Deletion to Pairs of Graph Classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (FCT, 2021)

Parameterizing Role Coloring on Forests. - Sukanya Pandey; Venkatesh Raman 001; Vibha Sahlot (SOFSEM, 2021)

Approximation in (Poly-) Logarithmic Space. - Arindam Biswas 001; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2021)

Recognizing k-Clique Extendible Orderings. - Mathew C. Francis; Rian Neogi; Venkatesh Raman 001 (Algorithmica, 2021)

Space-Efficient FPT Algorithms. - Arindam Biswas 001; Venkatesh Raman 001; Srinivasa Rao Satti; Saket Saurabh 001 (CoRR, 2021)

Parameterized Complexity of Conflict-Free Set Cover. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (Theory Comput. Syst., 2021)

Output Sensitive Fault Tolerant Maximum Matching. - Niranka Banerjee; Manoj Gupta 002; Venkatesh Raman 001; Saket Saurabh 001 (CSR, 2022)

Structural Parameterizations with Modulator Oblivion. - Ashwin Jacob; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot (Algorithmica, 2022)

Welcome back! - Hemangee Kalpesh Kapoor; Mausam; Venkatesh Raman 001 (Commun. ACM, 2022)

Dominator Coloring Parameterized by Cluster Vertex Deletion Number. - Aritra Banik; Prahlad Narasimhan Kasthurirangan; Venkatesh Raman 001 (CoRR, 2022)

Finding kings in tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (Discret. Appl. Math., 2022)

Frameworks for designing in-place graph algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2022)

Structural parameterizations of Tracking Paths problem. - Pratibha Choudhary; Venkatesh Raman 001 (Theor. Comput. Sci., 2022)

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2023)

Structural parameterizations of budgeted graph coloring. - Susobhan Bandopadhyay; Suman Banerjee 002; Aritra Banik; Venkatesh Raman 001 (Theor. Comput. Sci., 2023)

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (Algorithms, 2023)

Improved kernels for tracking paths. - Pratibha Choudhary; Michael T. Goodrich; Siddharth Gupta 002; Hadi Khodabandeh; Pedro Matias 001; Venkatesh Raman 001 (Inf. Process. Lett., 2023)

Deletion to scattered graph classes I - Case of finite number of graph classes. - Ashwin Jacob; Jari J. H. de Kroon; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2023)

Dominator coloring and CD coloring in almost cluster graphs. - Aritra Banik; Prahlad Narasimhan Kasthurirangan; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2025)

Parameterized complexity of dominating set variants in almost cluster and split graphs. - Dishant Goyal; Ashwin Jacob; Kaushtubh Kumar; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2025)