The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Venkatesh Raman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Subhash Khot, Venkatesh Raman
    Parameterized Complexity of Finding Subgraphs with Hereditary Properties. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:137-147 [Conf]
  2. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
    A Simple Optimal Representation for Balanced Parentheses. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:159-172 [Conf]
  3. Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
    Explicit Deterministic Constructions for Membership in the Bitprobe Model. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:290-299 [Conf]
  4. J. Ian Munro, Venkatesh Raman
    Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:118-126 [Conf]
  5. R. Balasubramanian, Venkatesh Raman
    Path Balance Heuristic for Self-Adjusting Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:338-348 [Conf]
  6. Sushmita Gupta, Venkatesh Raman, Saket Saurabh
    Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:139-151 [Conf]
  7. Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar
    Merging and Sorting By Strip Moves. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:314-325 [Conf]
  8. J. Ian Munro, Venkatesh Raman
    Fast Sorting In-Place Sorting with O(n) Data. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:266-277 [Conf]
  9. J. Ian Munro, Venkatesh Raman
    Selection from Read-Only Memory and Sorting with Optimum Data Movement. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:380-391 [Conf]
  10. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:186-196 [Conf]
  11. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Representations of Permutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:345-356 [Conf]
  12. Venkatesh Raman, Saket Saurabh, Somnath Sikdar
    Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:375-389 [Conf]
  13. Vikraman Arvind, Venkatesh Raman
    Approximation Algorithms for Some Parameterized Counting Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:453-464 [Conf]
  14. Nikhil Bansal, Venkatesh Raman
    Upper Bounds for MaxSat: Further Improved. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:247-258 [Conf]
  15. Venkatesh Raman, S. Srinivasa Rao
    Static Dictionaries Supporting Rank. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:18-26 [Conf]
  16. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
    Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:241-248 [Conf]
  17. Meena Mahajan, Venkatesh Raman, Somnath Sikdar
    Parameterizing MAX SNP Problems Above Guaranteed Values. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:38-49 [Conf]
  18. Venkatesh Raman, Saket Saurabh
    Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:260-270 [Conf]
  19. R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
    Tight Bounds for Finding Degrees from the Adjacency Matrix. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:49-59 [Conf]
  20. Richard F. Geary, Rajeev Raman, Venkatesh Raman
    Succinct ordinal trees with level-ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1-10 [Conf]
  21. J. Ian Munro, Venkatesh Raman, Adam J. Storm
    Representing dynamic binary trees succinctly. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:529-536 [Conf]
  22. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:233-242 [Conf]
  23. Venkatesh Raman, Sarnath Ramnath
    Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:131-142 [Conf]
  24. Venkatesh Raman, Saket Saurabh
    Triangles, 4-Cycles and Parameterized (In-)Tractability. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:304-315 [Conf]
  25. R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
    The Complexity of Finding Certain Trees in Tournaments. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:142-150 [Conf]
  26. David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
    Representing Trees of Higer Degree. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:169-180 [Conf]
  27. J. Ian Munro, Venkatesh Raman
    Sorting with Minimum Data Movement (Preliminary Draft). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:552-562 [Conf]
  28. J. Ian Munro, Venkatesh Raman
    Sorting Multisets and Vectors In-Place. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:473-480 [Conf]
  29. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:426-437 [Conf]
  30. Venkatesh Raman, Saket Saurabh
    Parameterized Complexity of Directed Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:484-492 [Conf]
  31. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
  32. J. Ian Munro, Venkatesh Raman
    Fast Stable In-Place Sorting with O (n) Data Moves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:151-160 [Journal]
  33. J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
    Stable in Situ Sorting and Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:2, pp:220-234 [Journal]
  34. Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
    The complexity of irredundant sets parameterized by size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:155-167 [Journal]
  35. Vikraman Arvind, Venkatesh Raman
    Approximate Counting small subgraphs of bounded treewidth and related problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:031, pp:- [Journal]
  36. Meena Mahajan, Venkatesh Raman
    Parametrizing Above Guaranteed Values: MaxSat and MaxCut [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:33, pp:- [Journal]
  37. R. Balasubramanian, Venkatesh Raman, V. Yegnanarayanan
    On the pseudoachromatic number of join of graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2003, v:80, n:9, pp:1131-1137 [Journal]
  38. Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar
    Approximate Block Sorting. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:2, pp:337-356 [Journal]
  39. R. Balasubramanian, Michael R. Fellows, Venkatesh Raman
    An Improved Fixed-Parameter Algorithm for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:163-168 [Journal]
  40. Jaikumar Radhakrishnan, Venkatesh Raman
    A tradeoff between search and update in dictionaries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:243-247 [Journal]
  41. Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
    A Simplified NP-Complete MAXSAT Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:1-6 [Journal]
  42. Sarnath Ramnath, Venkatesh Raman
    Selecting Small Ranks in EREW PRAM. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:5-6, pp:183-186 [Journal]
  43. R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan
    Finding Scores in Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:380-394 [Journal]
  44. Meena Mahajan, Venkatesh Raman
    Parameterizing above Guaranteed Values: MaxSat and MaxCut. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:2, pp:335-354 [Journal]
  45. J. Ian Munro, Venkatesh Raman
    Sorting with Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:374-393 [Journal]
  46. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:205-222 [Journal]
  47. Venkatesh Raman, Sarnath Ramnath
    Improved Upper Bounds for Time-Space Trade-offs for Selection. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:2, pp:162-180 [Journal]
  48. J. Ian Munro, Venkatesh Raman
    Succinct Representation of Balanced Parentheses and Static Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:762-776 [Journal]
  49. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
    Faster fixed parameter tractable algorithms for finding feedback vertex sets. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:403-415 [Journal]
  50. Richard F. Geary, Rajeev Raman, Venkatesh Raman
    Succinct ordinal trees with level-ancestor queries. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:510-534 [Journal]
  51. Subhash Khot, Venkatesh Raman
    Parameterized complexity of finding subgraphs with hereditary properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:997-1008 [Journal]
  52. J. Ian Munro, Venkatesh Raman
    Selection from Read-Only Memory and Sorting with Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:311-323 [Journal]
  53. Venkatesh Raman, Saket Saurabh
    Parameterized algorithms for feedback set problems and their duals in tournaments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:446-458 [Journal]
  54. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
    A simple optimal representation for balanced parentheses. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:3, pp:231-246 [Journal]
  55. Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
    Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  56. Venkatesh Raman, Saket Saurabh
    Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:2, pp:65-72 [Journal]
  57. Venkatesh Raman, Somnath Sikdar
    Parameterized complexity of the induced subgraph problem in directed graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:3, pp:79-85 [Journal]

  58. Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. [Citation Graph (, )][DBLP]


  59. The Budgeted Unique Coverage Problem and Color-Coding. [Citation Graph (, )][DBLP]


  60. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. [Citation Graph (, )][DBLP]


  61. Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]


  62. The Parameterized Complexity of the Unique Coverage Problem. [Citation Graph (, )][DBLP]


  63. The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. [Citation Graph (, )][DBLP]


  64. König Deletion Sets and Vertex Covers above the Matching Size. [Citation Graph (, )][DBLP]


  65. On the Directed Degree-Preserving Spanning Tree Problem. [Citation Graph (, )][DBLP]


  66. Solving minones-2-sat as Fast as vertex cover. [Citation Graph (, )][DBLP]


  67. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]


  68. Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]


  69. FPT Algorithms for Connected Feedback Vertex Set. [Citation Graph (, )][DBLP]


  70. Parameterized Algorithms for Generalized Domination. [Citation Graph (, )][DBLP]


  71. Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. [Citation Graph (, )][DBLP]


  72. Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs [Citation Graph (, )][DBLP]


  73. FPT Algorithms for Connected Feedback Vertex Set [Citation Graph (, )][DBLP]


  74. Faster Algorithms for Finding and Counting Subgraphs [Citation Graph (, )][DBLP]


  75. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [Citation Graph (, )][DBLP]


  76. Bidimensionality and EPTAS [Citation Graph (, )][DBLP]


Search in 0.294secs, Finished in 0.297secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002