Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

71 | EE | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321 |

70 | EE | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA 2009: 694-705 |

69 | EE | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar: Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs CoRR abs/0903.4521: (2009) |

68 | EE | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set CoRR abs/0909.3180: (2009) |

67 | EE | Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009) |

2008 | ||

66 | EE | Venkatesh Raman, Saket Saurabh, Sriganesh Srihari: Parameterized Algorithms for Generalized Domination. COCOA 2008: 116-126 |

65 | EE | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847 |

64 | EE | Venkatesh Raman,
Saket Saurabh:
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.
Algorithmica 52(2): 203-225 (2008) |

2007 | ||

63 | EE | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC 2007: 268-279 |

62 | EE | Hannes Moser, Venkatesh Raman, Somnath Sikdar: The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631 |

61 | EE | Rajeev Raman,
Venkatesh Raman,
Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets.
ACM Transactions on Algorithms 3(4): (2007) |

60 | EE | Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets CoRR abs/0705.0552: (2007) |

59 | EE | Venkatesh Raman, Saket Saurabh: Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2): 65-72 (2007) |

58 | EE | Venkatesh Raman, Somnath Sikdar: Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. 104(3): 79-85 (2007) |

57 | EE | Venkatesh Raman, Saket Saurabh, Somnath Sikdar: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3): 563-587 (2007) |

2006 | ||

56 | EE | Sushmita Gupta,
Venkatesh Raman,
Saket Saurabh:
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems.
FSTTCS 2006: 139-151 |

55 | EE | Meena Mahajan, Venkatesh Raman, Somnath Sikdar: Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49 |

54 | EE | Venkatesh Raman, Saket Saurabh: Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT 2006: 304-315 |

53 | EE | Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms 2(3): 403-415 (2006) |

52 | EE | Richard F. Geary, Rajeev Raman, Venkatesh Raman: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2(4): 510-534 (2006) |

51 | EE | Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar: Approximate Block Sorting. Int. J. Found. Comput. Sci. 17(2): 337-356 (2006) |

50 | EE | Venkatesh Raman, Saket Saurabh: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3): 446-458 (2006) |

49 | EE | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3): 231-246 (2006) |

2005 | ||

48 | EE | Venkatesh Raman, Saket Saurabh, Somnath Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389 |

47 | EE | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005) |

46 | EE | Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster algorithms for feedback vertex set. Electronic Notes in Discrete Mathematics 19: 273-279 (2005) |

2004 | ||

45 | EE | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman: A Simple Optimal Representation for Balanced Parentheses. CPM 2004: 159-172 |

44 | EE | Venkatesh Raman, Saket Saurabh: Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC 2004: 260-270 |

43 | EE | Richard F. Geary, Rajeev Raman, Venkatesh Raman: Succinct ordinal trees with level-ancestor queries. SODA 2004: 1-10 |

2003 | ||

42 | EE | Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar: Merging and Sorting By Strip Moves. FSTTCS 2003: 314-325 |

41 | EE | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct Representations of Permutations. ICALP 2003: 345-356 |

40 | EE | Venkatesh Raman, Saket Saurabh: Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS 2003: 484-492 |

39 | EE | R. Balasubramanian, Venkatesh Raman, V. Yegnanarayanan: On the pseudoachromatic number of join of graphs. Int. J. Comput. Math. 80(9): 1131-1137 (2003) |

2002 | ||

38 | EE | Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248 |

37 | EE | Vikraman Arvind, Venkatesh Raman: Approximation Algorithms for Some Parameterized Counting Problems. ISAAC 2002: 453-464 |

36 | EE | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002: 233-242 |

35 | EE | Vikraman Arvind, Venkatesh Raman: Approximate Counting small subgraphs of bounded treewidth and related problems Electronic Colloquium on Computational Complexity (ECCC)(031): (2002) |

34 | Subhash Khot, Venkatesh Raman: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2): 997-1008 (2002) | |

2001 | ||

33 | EE | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao: Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA 2001: 290-299 |

32 | EE | J. Ian Munro, Venkatesh Raman, Adam J. Storm: Representing dynamic binary trees succinctly. SODA 2001: 529-536 |

31 | EE | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct Dynamic Data Structures. WADS 2001: 426-437 |

30 | EE | Jaikumar Radhakrishnan, Venkatesh Raman: A tradeoff between search and update in dictionaries. Inf. Process. Lett. 80(5): 243-247 (2001) |

29 | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao: Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001) | |

28 | EE | J. Ian Munro, Venkatesh Raman: Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. 31(3): 762-776 (2001) |

2000 | ||

27 | EE | Subhash Khot, Venkatesh Raman: Parameterized Complexity of Finding Subgraphs with Hereditary Properties. COCOON 2000: 137-147 |

26 | Rodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100(3): 155-167 (2000) | |

1999 | ||

25 | C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings Springer 1999 | |

24 | EE | Venkatesh Raman, S. Srinivasa Rao: Static Dictionaries Supporting Rank. ISAAC 1999: 18-26 |

23 | EE | Nikhil Bansal, Venkatesh Raman: Upper Bounds for MaxSat: Further Improved. ISAAC 1999: 247-258 |

22 | EE | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman: Representing Trees of Higer Degree. WADS 1999: 169-180 |

21 | EE | Sarnath Ramnath, Venkatesh Raman: Selecting Small Ranks in EREW PRAM. Inf. Process. Lett. 71(5-6): 183-186 (1999) |

20 | Meena Mahajan, Venkatesh Raman: Parameterizing above Guaranteed Values: MaxSat and MaxCut. J. Algorithms 31(2): 335-354 (1999) | |

19 | Venkatesh Raman, Sarnath Ramnath: Improved Upper Bounds for Time-Space Trade-offs for Selection. Nord. J. Comput. 6(2): 162-180 (1999) | |

1998 | ||

18 | EE | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao: Space Efficient Suffix Trees. FSTTCS 1998: 186-196 |

17 | EE | Venkatesh Raman, Sarnath Ramnath: Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. SWAT 1998: 131-142 |

16 | EE | Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao: A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998) |

15 | EE | R. Balasubramanian, Michael R. Fellows, Venkatesh Raman: An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998) |

1997 | ||

14 | EE | J. Ian Munro, Venkatesh Raman: Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. FOCS 1997: 118-126 |

13 | EE | Meena Mahajan, Venkatesh Raman: Parametrizing Above Guaranteed Values: MaxSat and MaxCut Electronic Colloquium on Computational Complexity (ECCC) 4(33): (1997) |

12 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan: Finding Scores in Tournaments. J. Algorithms 24(2): 380-394 (1997) | |

1996 | ||

11 | J. Ian Munro,
Venkatesh Raman:
Fast Stable In-Place Sorting with O (n) Data Moves.
Algorithmica 16(2): 151-160 (1996) | |

10 | EE | J. Ian Munro, Venkatesh Raman: Selection from Read-Only Memory and Sorting with Minimum Data Movement. Theor. Comput. Sci. 165(2): 311-323 (1996) |

1995 | ||

9 | EE | R. Balasubramanian, Venkatesh Raman: Path Balance Heuristic for Self-Adjusting Binary Search Trees. FSTTCS 1995: 338-348 |

8 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan: Tight Bounds for Finding Degrees from the Adjacency Matrix. LATIN 1995: 49-59 | |

1993 | ||

7 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan: The Complexity of Finding Certain Trees in Tournaments. WADS 1993: 142-150 | |

1992 | ||

6 | EE | J. Ian Munro, Venkatesh Raman: Selection from Read-Only Memory and Sorting with Optimum Data Movement. FSTTCS 1992: 380-391 |

5 | J. Ian Munro, Venkatesh Raman: Sorting with Minimum Data Movement. J. Algorithms 13(3): 374-393 (1992) | |

1991 | ||

4 | EE | J. Ian Munro, Venkatesh Raman: Fast Sorting In-Place Sorting with O(n) Data. FSTTCS 1991: 266-277 |

3 | J. Ian Munro, Venkatesh Raman: Sorting Multisets and Vectors In-Place. WADS 1991: 473-480 | |

1990 | ||

2 | J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe: Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990) | |

1989 | ||

1 | J. Ian Munro, Venkatesh Raman: Sorting with Minimum Data Movement (Preliminary Draft). WADS 1989: 552-562 |