Venkatesh Raman

According to our database, Venkatesh Raman authored at least 181 papers between 1989 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

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

J. Comput. Syst. Sci., December, 2023

Improved kernels for tracking paths.

Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman

Inf. Process. Lett., March, 2023

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Algorithms, March, 2023

Structural parameterizations of budgeted graph coloring.

Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman

Theor. Comput. Sci., 2023

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

J. Comput. Syst. Sci., 2023

Dominator Coloring and CD Coloring in Almost Cluster Graphs.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Structural parameterizations of Tracking Paths problem.

Pratibha Choudhary, Venkatesh Raman

Theor. Comput. Sci., 2022

Frameworks for designing in-place graph algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2022

Finding kings in tournaments.

Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti

Discret. Appl. Math., 2022

Dominator Coloring Parameterized by Cluster Vertex Deletion Number.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

CoRR, 2022

Welcome back!

Hemangee Kalpesh Kapoor, Mausam, Venkatesh Raman

Commun. ACM, 2022

Structural Parameterizations with Modulator Oblivion.

Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot

Algorithmica, 2022

Output Sensitive Fault Tolerant Maximum Matching.

Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Parameterized Complexity of Conflict-Free Set Cover.

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Theory Comput. Syst., 2021

Space-Efficient FPT Algorithms.

Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh

CoRR, 2021

Recognizing k-Clique Extendible Orderings.

Mathew C. Francis, Rian Neogi, Venkatesh Raman

Algorithmica, 2021

Approximation in (Poly-) Logarithmic Space.

Arindam Biswas, Venkatesh Raman, Saket Saurabh

Algorithmica, 2021

Parameterizing Role Coloring on Forests.

Sukanya Pandey, Venkatesh Raman, Vibha Sahlot

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Faster FPT Algorithms for Deletion to Pairs of Graph Classes.

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Sublinear-Space Approximation Algorithms for Max r-SAT.

Arindam Biswas, Venkatesh Raman

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths.

Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2020

Fully dynamic arboricity maintenance.

Niranka Banerjee, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2020

List-coloring - Parameterizing from triviality.

Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman

Theor. Comput. Sci., 2020

Fixed-Parameter Tractability of (n - k) List Coloring.

Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman

Theory Comput. Syst., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.

Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Inf. Process. Lett., 2020

Elusiveness of finding degrees.

Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman

Discret. Appl. Math., 2020

Improved Kernels for Tracking Path Problems.

Pratibha Choudhary, Venkatesh Raman

CoRR, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh

Algorithmica, 2020

A Polynomial Sized Kernel for Tracking Paths Problem.

Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Algorithmica, 2020

Parameterized Complexity of Deletion to Scattered Graph Classes.

Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Optimal Output Sensitive Fault Tolerant Cuts.

Niranka Banerjee, Venkatesh Raman, Saket Saurabh

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Tractability of König edge deletion problems.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali

Theor. Comput. Sci., 2019

Harmonious coloring: Parameterized algorithms and upper bounds.

Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale

Theor. Comput. Sci., 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh

Algorithmica, 2019

Solving Group Interval Scheduling Efficiently.

Arindam Biswas, Venkatesh Raman, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.

Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems.

Ashwin Jacob, Venkatesh Raman, Vibha Sahlot

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Selection and Sorting in the "Restore" Model.

Timothy M. Chan, J. Ian Munro, Venkatesh Raman

ACM Trans. Algorithms, 2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.

Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh

Theory Comput. Syst., 2018

Space Efficient Linear Time Algorithms for BFS, DFS and Applications.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

Theory Comput. Syst., 2018

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.

R. Krithika, Diptapriyo Majumdar, Venkatesh Raman

Theory Comput. Syst., 2018

Vertex Cover Reconfiguration and Beyond.

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz

Algorithms, 2018

Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization.

Diptapriyo Majumdar, Venkatesh Raman

Algorithmica, 2018

Approximability of Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Algorithmica, 2018

Fréchet Distance Between a Line and Avatar Point Set.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot

Algorithmica, 2018

Some (in)tractable Parameterizations of Coloring and List-Coloring.

Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

A Framework for In-place Graph Algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Structural Parameterizations of Dominating Set Variants.

Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman

Proceedings of the Computer Science - Theory and Applications, 2018

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.

Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Finding modes with equality comparisons.

Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao

Theor. Comput. Sci., 2017

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.

Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman

SIAM J. Discret. Math., 2017

Biconnectivity, st-numbering and other applications of DFS using O(n) bits.

Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2017

On the Parameterized Complexity of Reconfiguration Problems.

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki

Algorithmica, 2017

On the Succinct Representation of Equivalence Classes.

Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan

Algorithmica, 2017

FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters.

Diptapriyo Majumdar, Venkatesh Raman

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.

Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Exact and Parameterized Algorithms for (k, i)-Coloring.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.

Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Space efficient data structures for nearest larger neighbor.

Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

J. Discrete Algorithms, 2016

Finding Mode Using Equality Comparisons.

Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.

Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Improved Space Efficient Algorithms for BFS, DFS and Applications.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Finding median in read-only memory on integer input.

Timothy M. Chan, J. Ian Munro, Venkatesh Raman

Theor. Comput. Sci., 2015

Sorting and Selection with Equality Comparisons.

Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

SAT-based analysis of large real-world feature models is easy.

Jia Hui (Jimmy) Liang, Vijay Ganesh, Krzysztof Czarnecki, Venkatesh Raman

Proceedings of the 19th International Conference on Software Product Line, 2015

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.

Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs.

Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman

ACM Trans. Comput. Theory, 2014

Less space: Indexing for queries with wildcards.

Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan

Theor. Comput. Sci., 2014

Evolution and Controllability of CancerNetworks: A Boolean Perspective.

Sriganesh Srihari, Venkatesh Raman, Hon Wai Leong, Mark A. Ragan

IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Faster Parameterized Algorithms Using Linear Programming.

Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

ACM Trans. Algorithms, 2014

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Algorithmica, 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.

Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo

Algorithmica, 2014

Reconfiguration over Tree Decompositions.

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.

Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Space Efficient Data Structures for Nearest Larger Neighbor.

Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Vertex Cover Reconfiguration and Beyond.

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes.

Hicham El-Zein, J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Improved Explicit Data Structures in the Bitprobe Model.

Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman

Proceedings of the Algorithms - ESA 2014, 2014

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Proceedings of the Algorithms - ESA 2014, 2014

2013

Solving min ones 2-sat as fast as vertex cover.

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

Theor. Comput. Sci., 2013

Parameterized complexity of MaxSat Above Average.

Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Theory Comput. Syst., 2013

An FPT algorithm for Tree Deletion Set.

Venkatesh Raman, Saket Saurabh, Ondrej Suchý

J. Graph Algorithms Appl., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.

Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Inf. Comput., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.

Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Inf. Comput., 2013

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II.

Venkatesh Raman, Saket Saurabh

Algorithmica, 2013

The Parameterized Complexity of Unique Coverage and Its Variants.

Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Algorithmica, 2013

Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem.

Venkatesh Raman, Bal Sri Shankar

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Succinct Data Structures for Representing Equivalence Classes.

Moshe Lewenstein, J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.

Timothy M. Chan, J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Survey of Data Structures in the Bitprobe Model.

Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct representations of permutations and functions.

J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Theor. Comput. Sci., 2012

On Parameterized Independent Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2012

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

ACM Trans. Algorithms, 2012

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.

Sushmita Gupta, Venkatesh Raman, Saket Saurabh

SIAM J. Discret. Math., 2012

Faster algorithms for finding and counting subgraphs.

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao

J. Comput. Syst. Sci., 2012

FPT algorithms for Connected Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

J. Comb. Optim., 2012

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I.

Venkatesh Raman, Saket Saurabh

Algorithmica, 2012

Parameterized Algorithms for Even Cycle Transversal.

Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

LP can be a cure for Parameterized Problems.

N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows.

Venkatesh Raman

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Subexponential algorithms for partial cover problems.

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Inf. Process. Lett., 2011

Lower bounds on kernelization.

Neeldhara Misra, Venkatesh Raman, Saket Saurabh

Discret. Optim., 2011

On the directed Full Degree Spanning Tree problem.

Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Discret. Optim., 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian

Algorithmica, 2011

Bidimensionality and EPTAS.

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Paths, Flowers and Vertex Cover.

Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Proceedings of the Algorithms - ESA 2011, 2011

2010

A Quartic Kernel for Pathwidth-One Vertex Deletion.

Geevarghese Philip, Venkatesh Raman, Yngve Villanger

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.

Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Proceedings of the Algorithm Theory, 2010

Solving minones-2-sat as Fast as vertex cover.

Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Parameterizing above or below guaranteed values.

Meena Mahajan, Venkatesh Raman, Somnath Sikdar

J. Comput. Syst. Sci., 2009

Polynomial Kernels for Dominating Set in K_i,j-free and d-degenerate Graphs

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

CoRR, 2009

On the Directed Degree-Preserving Spanning Tree Problem.

Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

Proceedings of the Algorithms, 2009

The Budgeted Unique Coverage Problem and Color-Coding.

Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Proceedings of the Computer Science, 2009

2008

Short Cycles Make <i>W</i> -hard Problems Hard: FPT Algorithms for <i>W</i> -hard Problems in Graphs with no Short Cycles.

Venkatesh Raman, Saket Saurabh

Algorithmica, 2008

König Deletion Sets and Vertex Covers above the Matching Size.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Parameterized Algorithms for Generalized Domination.

Venkatesh Raman, Saket Saurabh, Sriganesh Srihari

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Succinct indexable dictionaries with applications to encoding <i>k</i>-ary trees, prefix sums and multisets.

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

ACM Trans. Algorithms, 2007

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.

Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Theory Comput. Syst., 2007

Parameterized complexity of the induced subgraph problem in directed graphs.

Venkatesh Raman, Somnath Sikdar

Inf. Process. Lett., 2007

Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.

Venkatesh Raman, Saket Saurabh

Inf. Process. Lett., 2007

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

CoRR, 2007

The Parameterized Complexity of the Unique Coverage Problem.

Hannes Moser, Venkatesh Raman, Somnath Sikdar

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Parameterized algorithms for feedback set problems and their duals in tournaments.

Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2006

A simple optimal representation for balanced parentheses.

Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman

Theor. Comput. Sci., 2006

Faster fixed parameter tractable algorithms for finding feedback vertex sets.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

ACM Trans. Algorithms, 2006

Succinct ordinal trees with level-ancestor queries.

Richard F. Geary, Rajeev Raman, Venkatesh Raman

ACM Trans. Algorithms, 2006

Approximate Block Sorting.

Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar

Int. J. Found. Comput. Sci., 2006

Triangles, 4-Cycles and Parameterized (In-)Tractability.

Venkatesh Raman, Saket Saurabh

Proceedings of the Algorithm Theory, 2006

Parameterizing MAX SNP Problems Above Guaranteed Values.

Meena Mahajan, Venkatesh Raman, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Fast Exponential Algorithms for Maximum <i>r</i>-Regular Induced Subgraph Problems.

Sushmita Gupta, Venkatesh Raman, Saket Saurabh

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Faster algorithms for feedback vertex set.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Electron. Notes Discret. Math., 2005

Representing Trees of Higher Degree.

David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Algorithmica, 2005

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.

Venkatesh Raman, Saket Saurabh, Somnath Sikdar

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.

Venkatesh Raman, Saket Saurabh

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

On the pseudoachromatic number of join of graphs.

R. Balasubramanian, Venkatesh Raman, V. Yegnanarayanan

Int. J. Comput. Math., 2003

Parameterized Complexity of Directed Feedback Set Problems in Tournaments.

Venkatesh Raman, Saket Saurabh

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Succinct Representations of Permutations.

J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Merging and Sorting By Strip Moves.

Meena Mahajan, Raghavan Rama, Venkatesh Raman, Vijayakumar Sundarrajan

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Parameterized complexity of finding subgraphs with hereditary properties.

Subhash Khot, Venkatesh Raman

Theor. Comput. Sci., 2002

Approximate Counting small subgraphs of bounded treewidth and related problems

Vikraman Arvind, Venkatesh Raman

Electron. Colloquium Comput. Complex., 2002

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.

Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.

Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Approximation Algorithms for Some Parameterized Counting Problems.

Vikraman Arvind, Venkatesh Raman

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Succinct Representation of Balanced Parentheses and Static Trees.

J. Ian Munro, Venkatesh Raman

SIAM J. Comput., 2001

Space Efficient Suffix Trees.

J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao

J. Algorithms, 2001

A tradeoff between search and update in dictionaries.

Jaikumar Radhakrishnan, Venkatesh Raman

Inf. Process. Lett., 2001

Succinct Dynamic Data Structures.

Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Representing dynamic binary trees succinctly.

J. Ian Munro, Venkatesh Raman, Adam J. Storm

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Explicit Deterministic Constructions for Membership in the Bitprobe Model.

Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Algorithms, 2001

2000

The complexity of irredundant sets parameterized by size.

Rodney G. Downey, Michael R. Fellows, Venkatesh Raman

Discret. Appl. Math., 2000

1999

Improved Upper Bounds for Time-Space Trade-offs for Selection.

Venkatesh Raman, Sarnath Ramnath

Nord. J. Comput., 1999

Parameterizing above Guaranteed Values: MaxSat and MaxCut.

Meena Mahajan, Venkatesh Raman

J. Algorithms, 1999

Selecting Small Ranks in EREW PRAM.

Sarnath Ramnath, Venkatesh Raman

Inf. Process. Lett., 1999

Representing Trees of Higer Degree.

David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Static Dictionaries Supporting Rank.

Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Upper Bounds for MaxSat: Further Improved.

Nikhil Bansal, Venkatesh Raman

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

A Simplified NP-Complete MAXSAT Problem.

Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao

Inf. Process. Lett., 1998

An Improved Fixed-Parameter Algorithm for Vertex Cover.

R. Balasubramanian, Michael R. Fellows, Venkatesh Raman

Inf. Process. Lett., 1998

Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage.

Venkatesh Raman, Sarnath Ramnath

Proceedings of the Algorithm Theory, 1998

1997

Finding Scores in Tournaments.

R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan

J. Algorithms, 1997

Parametrizing Above Guaranteed Values: MaxSat and MaxCut

Meena Mahajan, Venkatesh Raman

Electron. Colloquium Comput. Complex., 1997

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.

J. Ian Munro, Venkatesh Raman

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Selection from Read-Only Memory and Sorting with Minimum Data Movement.

J. Ian Munro, Venkatesh Raman

Theor. Comput. Sci., 1996

Fast Stable In-Place Sorting with <i>O (n)</i> Data Moves.

J. Ian Munro, Venkatesh Raman

Algorithmica, 1996

1995

Tight Bounds for Finding Degrees from the Adjacency Matrix.

R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Path Balance Heuristic for Self-Adjusting Binary Search Trees.

R. Balasubramanian, Venkatesh Raman

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1993

The Complexity of Finding Certain Trees in Tournaments.

R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Sorting with Minimum Data Movement.

J. Ian Munro, Venkatesh Raman

J. Algorithms, 1992

Selection from Read-Only Memory and Sorting with Optimum Data Movement.

J. Ian Munro, Venkatesh Raman

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991

Sorting Multisets and Vectors In-Place.

J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Data Structures, 1991

Fast Sorting In-Place Sorting with O(n) Data.

J. Ian Munro, Venkatesh Raman

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

Stable in Situ Sorting and Minimum Data Movement.

J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe

BIT, 1990

1989

Sorting with Minimum Data Movement (Preliminary Draft).

J. Ian Munro, Venkatesh Raman

Proceedings of the Algorithms and Data Structures, 1989