Venkatesh Raman

Orcid: 0000-0001-8123-0980

Affiliations:
  • The Institute of Mathematical Sciences, Chennai, India


According to our database1, Venkatesh Raman authored at least 182 papers between 1989 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs.
CoRR, 2024

2023
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci., December, 2023

Improved kernels for tracking paths.
Inf. Process. Lett., March, 2023

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
Algorithms, March, 2023

Structural parameterizations of budgeted graph coloring.
Theor. Comput. Sci., 2023

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
J. Comput. Syst. Sci., 2023

Dominator Coloring and CD Coloring in Almost Cluster Graphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022
Structural parameterizations of Tracking Paths problem.
Theor. Comput. Sci., 2022

Frameworks for designing in-place graph algorithms.
J. Comput. Syst. Sci., 2022

Finding kings in tournaments.
Discret. Appl. Math., 2022

Dominator Coloring Parameterized by Cluster Vertex Deletion Number.
CoRR, 2022

Welcome back!
Commun. ACM, 2022

Structural Parameterizations with Modulator Oblivion.
Algorithmica, 2022

Output Sensitive Fault Tolerant Maximum Matching.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Parameterized Complexity of Conflict-Free Set Cover.
Theory Comput. Syst., 2021

Space-Efficient FPT Algorithms.
CoRR, 2021

Recognizing k-Clique Extendible Orderings.
Algorithmica, 2021

Approximation in (Poly-) Logarithmic Space.
Algorithmica, 2021

Parameterizing Role Coloring on Forests.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Faster FPT Algorithms for Deletion to Pairs of Graph Classes.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Sublinear-Space Approximation Algorithms for Max r-SAT.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Fixed-parameter tractable algorithms for Tracking Shortest Paths.
Theor. Comput. Sci., 2020

Fully dynamic arboricity maintenance.
Theor. Comput. Sci., 2020

List-coloring - Parameterizing from triviality.
Theor. Comput. Sci., 2020

Fixed-Parameter Tractability of (n - k) List Coloring.
Theory Comput. Syst., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.
Inf. Process. Lett., 2020

Elusiveness of finding degrees.
Discret. Appl. Math., 2020

Improved Kernels for Tracking Path Problems.
CoRR, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.
Algorithmica, 2020

A Polynomial Sized Kernel for Tracking Paths Problem.
Algorithmica, 2020

Parameterized Complexity of Deletion to Scattered Graph Classes.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Optimal Output Sensitive Fault Tolerant Cuts.
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.
Theor. Comput. Sci., 2019

Harmonious coloring: Parameterized algorithms and upper bounds.
Theor. Comput. Sci., 2019

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

Solving Group Interval Scheduling Efficiently.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.
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.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Selection and Sorting in the "Restore" Model.
ACM Trans. Algorithms, 2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.
Theory Comput. Syst., 2018

Space Efficient Linear Time Algorithms for BFS, DFS and Applications.
Theory Comput. Syst., 2018

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
Theory Comput. Syst., 2018

Vertex Cover Reconfiguration and Beyond.
Algorithms, 2018

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

Approximability of Clique Transversal in Perfect Graphs.
Algorithmica, 2018

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

Some (in)tractable Parameterizations of Coloring and List-Coloring.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

A Framework for In-place Graph Algorithms.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Structural Parameterizations of Dominating Set Variants.
Proceedings of the Computer Science - Theory and Applications, 2018

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Finding modes with equality comparisons.
Theor. Comput. Sci., 2017

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas.
SIAM J. Discret. Math., 2017

Biconnectivity, st-numbering and other applications of DFS using O(n) bits.
J. Comput. Syst. Sci., 2017

On the Parameterized Complexity of Reconfiguration Problems.
Algorithmica, 2017

On the Succinct Representation of Equivalence Classes.
Algorithmica, 2017

FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Exact and Parameterized Algorithms for (k, i)-Coloring.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Space efficient data structures for nearest larger neighbor.
J. Discrete Algorithms, 2016

Finding Mode Using Equality Comparisons.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Improved Space Efficient Algorithms for BFS, DFS and Applications.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Finding median in read-only memory on integer input.
Theor. Comput. Sci., 2015

Sorting and Selection with Equality Comparisons.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

SAT-based analysis of large real-world feature models is easy.
Proceedings of the 19th International Conference on Software Product Line, 2015

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.
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.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs.
ACM Trans. Comput. Theory, 2014

Less space: Indexing for queries with wildcards.
Theor. Comput. Sci., 2014

Evolution and Controllability of CancerNetworks: A Boolean Perspective.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Faster Parameterized Algorithms Using Linear Programming.
ACM Trans. Algorithms, 2014

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

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
Algorithmica, 2014

Reconfiguration over Tree Decompositions.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Space Efficient Data Structures for Nearest Larger Neighbor.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Vertex Cover Reconfiguration and Beyond.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Improved Explicit Data Structures in the Bitprobe Model.
Proceedings of the Algorithms - ESA 2014, 2014

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Solving min ones 2-sat as fast as vertex cover.
Theor. Comput. Sci., 2013

Parameterized complexity of MaxSat Above Average.
Theor. Comput. Sci., 2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.
Theory Comput. Syst., 2013

An FPT algorithm for Tree Deletion Set.
J. Graph Algorithms Appl., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.
Inf. Comput., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.
Inf. Comput., 2013

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

The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica, 2013

Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Succinct Data Structures for Representing Equivalence Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Survey of Data Structures in the Bitprobe Model.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Succinct representations of permutations and functions.
Theor. Comput. Sci., 2012

On Parameterized Independent Feedback Vertex Set.
Theor. Comput. Sci., 2012

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.
ACM Trans. Algorithms, 2012

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.
SIAM J. Discret. Math., 2012

Faster algorithms for finding and counting subgraphs.
J. Comput. Syst. Sci., 2012

FPT algorithms for Connected Feedback Vertex Set.
J. Comb. Optim., 2012

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

Parameterized Algorithms for Even Cycle Transversal.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

LP can be a cure for Parameterized Problems.
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.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Subexponential algorithms for partial cover problems.
Inf. Process. Lett., 2011

Lower bounds on kernelization.
Discret. Optim., 2011

On the directed Full Degree Spanning Tree problem.
Discret. Optim., 2011

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

Bidimensionality and EPTAS.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Paths, Flowers and Vertex Cover.
Proceedings of the Algorithms - ESA 2011, 2011

2010
A Quartic Kernel for Pathwidth-One Vertex Deletion.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.
Proceedings of the Algorithm Theory, 2010

Solving minones-2-sat as Fast as vertex cover.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.
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.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Parameterizing above or below guaranteed values.
J. Comput. Syst. Sci., 2009

Polynomial Kernels for Dominating Set in K<sub>i,j</sub>-free and d-degenerate Graphs
CoRR, 2009

On the Directed Degree-Preserving Spanning Tree Problem.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.
Proceedings of the Algorithms, 2009

The Budgeted Unique Coverage Problem and Color-Coding.
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.
Algorithmica, 2008

König Deletion Sets and Vertex Covers above the Matching Size.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Parameterized Algorithms for Generalized Domination.
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.
ACM Trans. Algorithms, 2007

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.
Theory Comput. Syst., 2007

Parameterized complexity of the induced subgraph problem in directed graphs.
Inf. Process. Lett., 2007

Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.
Inf. Process. Lett., 2007

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

The Parameterized Complexity of the Unique Coverage Problem.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Parameterized algorithms for feedback set problems and their duals in tournaments.
Theor. Comput. Sci., 2006

A simple optimal representation for balanced parentheses.
Theor. Comput. Sci., 2006

Faster fixed parameter tractable algorithms for finding feedback vertex sets.
ACM Trans. Algorithms, 2006

Succinct ordinal trees with level-ancestor queries.
ACM Trans. Algorithms, 2006

Approximate Block Sorting.
Int. J. Found. Comput. Sci., 2006

Triangles, 4-Cycles and Parameterized (In-)Tractability.
Proceedings of the Algorithm Theory, 2006

Parameterizing MAX SNP Problems Above Guaranteed Values.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Fast Exponential Algorithms for Maximum <i>r</i>-Regular Induced Subgraph Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Faster algorithms for feedback vertex set.
Electron. Notes Discret. Math., 2005

Representing Trees of Higher Degree.
Algorithmica, 2005

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003
On the pseudoachromatic number of join of graphs.
Int. J. Comput. Math., 2003

Parameterized Complexity of Directed Feedback Set Problems in Tournaments.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Succinct Representations of Permutations.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Merging and Sorting By Strip Moves.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Parameterized complexity of finding subgraphs with hereditary properties.
Theor. Comput. Sci., 2002

Approximate Counting small subgraphs of bounded treewidth and related problems
Electron. Colloquium Comput. Complex., 2002

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Approximation Algorithms for Some Parameterized Counting Problems.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Succinct Representation of Balanced Parentheses and Static Trees.
SIAM J. Comput., 2001

Space Efficient Suffix Trees.
J. Algorithms, 2001

A tradeoff between search and update in dictionaries.
Inf. Process. Lett., 2001

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

Representing dynamic binary trees succinctly.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Explicit Deterministic Constructions for Membership in the Bitprobe Model.
Proceedings of the Algorithms, 2001

2000
The complexity of irredundant sets parameterized by size.
Discret. Appl. Math., 2000

1999
Improved Upper Bounds for Time-Space Trade-offs for Selection.
Nord. J. Comput., 1999

Parameterizing above Guaranteed Values: MaxSat and MaxCut.
J. Algorithms, 1999

Selecting Small Ranks in EREW PRAM.
Inf. Process. Lett., 1999

Representing Trees of Higer Degree.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Static Dictionaries Supporting Rank.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Upper Bounds for MaxSat: Further Improved.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
A Simplified NP-Complete MAXSAT Problem.
Inf. Process. Lett., 1998

An Improved Fixed-Parameter Algorithm for Vertex Cover.
Inf. Process. Lett., 1998

Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage.
Proceedings of the Algorithm Theory, 1998

1997
Finding Scores in Tournaments.
J. Algorithms, 1997

Parametrizing Above Guaranteed Values: MaxSat and MaxCut
Electron. Colloquium Comput. Complex., 1997

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Selection from Read-Only Memory and Sorting with Minimum Data Movement.
Theor. Comput. Sci., 1996

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

1995
Tight Bounds for Finding Degrees from the Adjacency Matrix.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Path Balance Heuristic for Self-Adjusting Binary Search Trees.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1993
The Complexity of Finding Certain Trees in Tournaments.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992
Sorting with Minimum Data Movement.
J. Algorithms, 1992

Selection from Read-Only Memory and Sorting with Optimum Data Movement.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
Sorting Multisets and Vectors In-Place.
Proceedings of the Algorithms and Data Structures, 1991

Fast Sorting In-Place Sorting with O(n) Data.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Stable in Situ Sorting and Minimum Data Movement.
BIT, 1990

1989
Sorting with Minimum Data Movement (Preliminary Draft).
Proceedings of the Algorithms and Data Structures, 1989


  Loading...