World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
43
Citations
8328
World Ranking
7954
National Ranking
90

Overview

Venkatesh Raman is affiliated with the Institute of Mathematical Sciences in India and specializes in computer science with a focus on computational theory and mathematics. Their research portfolio encompasses topics primarily connected to graph theory, complexity, and algorithms.

Their main fields of study include:

  • Computer Science

More specifically, the subfields they have contributed to cover:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology
  • Artificial Intelligence

The central themes in their research work are:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Graph Labeling and Dimension Problems
  • Optimization and Search Problems
  • Semigroups and Automata Theory
  • Interconnection Networks and Systems
  • Limits and Structures in Graph Theory

Venkatesh Raman has coauthored extensively with several researchers, frequently collaborating with:

  • Ashwin Jacob
  • Diptapriyo Majumdar
  • Aritra Banik
  • Saket Saurabh
  • Pratibha Choudhary

Their scholarly contributions have appeared in a variety of publication venues including:

  • arXiv (Cornell University)
  • Journal of Computer and System Sciences
  • Theoretical Computer Science
  • Theory of Computing Systems
  • Algorithmica

Some recent notable papers by Venkatesh Raman cover a range of topics in parameterized complexity, algorithms, and graph theory. These include:

  • "Parameterized Complexity of Conflict-Free Set Cover," 2021, Theory of Computing Systems
  • "Expansion Lemma-Variations and Applications to Polynomial-Time Preprocessing," 2023, Algorithms
  • "Parameterized complexity of dominating set variants in almost cluster and split graphs," 2025, Journal of Computer and System Sciences
  • "Fixed-parameter tractable algorithms for Tracking Shortest Paths," 2020, Theoretical Computer Science
  • "Structural Parameterizations with Modulator Oblivion," 2022, Algorithmica

Best Publications

  • Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

    Rajeev Raman;Venkatesh Raman;Srinivasa Rao Satti

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

    Rajeev Raman;Venkatesh Raman;S. Srinivasa Rao

  • Succinct Representation of Balanced Parentheses and Static Trees

    J. Ian Munro;Venkatesh Raman

  • Parameterizing above Guaranteed Values

    Meena Mahajan;Venkatesh Raman

  • Representing Trees of Higher Degree

    David Benoit;Erik D. Demaine;J. Ian Munro;Rajeev Raman

  • Parameterized Complexity of Finding Subgraphs with Hereditary Properties

    Subhash Khot;Venkatesh Raman

  • An improved fixed-parameter algorithm for vertex cover

    R. Balasubramanian;Michael R. Fellows;Venkatesh Raman

  • Succinct representation of balanced parentheses, static trees and planar graphs

    J.I. Munro;V. Raman

  • Space Efficient Suffix Trees

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

  • Space Efficient Suffix Trees

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

  • Faster Parameterized Algorithms Using Linear Programming

    Daniel Lokshtanov;N. S. Narayanaswamy;Venkatesh Raman;M. S. Ramanujan

  • Succinct ordinal trees with level-ancestor queries

    Richard F. Geary;Rajeev Raman;Venkatesh Raman

  • A simple optimal representation for balanced parentheses

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

  • Succinct Dynamic Data Structures

    Rajeev Raman;Venkatesh Raman;S. Srinivasa Rao

  • Succinct representations of permutations

    J. Ian Munro;Rajeev Raman;Venkatesh Raman;Satti Srinivasa Rao

  • Selection from read-only memory and sorting with minimum data movement

    J. Ian Munro;Venkatesh Raman

  • Parameterizing above or below guaranteed values

    Meena Mahajan;Venkatesh Raman;Somnath Sikdar

  • Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles

    Venkatesh Raman;Saket Saurabh

  • Upper Bounds for MaxSat: Further Improved

    Nikhil Bansal;Venkatesh Raman

  • Approximation Algorithms for Some Parameterized Counting Problems

    V. Arvind;Venkatesh Raman

  • Parametrizing Above Guaranteed Values: MaxSat and MaxCut

    Meena Mahajan;Venkatesh Raman

Frequent Co-Authors

Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
J. Ian Munro
J. Ian Munro University of Waterloo
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Rajeev Raman
Rajeev Raman University of Leicester
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Gregory Gutin
Gregory Gutin Royal Holloway University of London
Timothy M. Chan
Timothy M. Chan University of Illinois at Urbana-Champaign
Michael R. Fellows
Michael R. Fellows Lebanese American University
Anders Yeo
Anders Yeo University of Southern Denmark

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Expanding your studies beyond computer science can open the door to diverse and rewarding career options. Many students consider interdisciplinary fields such as environmental or mechanical engineering, where online programs now offer flexibility and affordability. For those interested in sustainability and designing solutions for a cleaner planet, environmental engineering schools online provide a practical and innovative path.

Mechanical engineering remains a high-demand discipline, and pursuing a mechanical engineering degree online cost is often competitive when compared to traditional programs. Similarly, if you are passionate about understanding the fundamental laws of nature, consider the cheapest online physics degree options, which allow you to study physics flexibly and potentially at a lower cost.

Data science is another in-demand area, bridging computer science, mathematics, and business needs. A data scientist degree can prepare you for roles that analyze and interpret complex data. Exploring these related online degrees can broaden your skills and career opportunities in the technology field.

Best Scientists Citing Venkatesh Raman

Trending Scientists

Recently Published Articles