The SCEAS System
| |||||||

## Search the dblp DataBase
Venkatesh Raman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Subhash Khot, Venkatesh Raman
**Parameterized Complexity of Finding Subgraphs with Hereditary Properties.**[Citation Graph (0, 0)][DBLP] COCOON, 2000, pp:137-147 [Conf] - 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] - 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] - 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] - R. Balasubramanian, Venkatesh Raman
**Path Balance Heuristic for Self-Adjusting Binary Search Trees.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1995, pp:338-348 [Conf] - Sushmita Gupta, Venkatesh Raman, Saket Saurabh
**Fast Exponential Algorithms for Maximum**[Citation Graph (0, 0)][DBLP]*r*-Regular Induced Subgraph Problems. FSTTCS, 2006, pp:139-151 [Conf] - 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] - 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] - 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] - J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
**Space Efficient Suffix Trees.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1998, pp:186-196 [Conf] - 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] - 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] - Vikraman Arvind, Venkatesh Raman
**Approximation Algorithms for Some Parameterized Counting Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:453-464 [Conf] - Nikhil Bansal, Venkatesh Raman
**Upper Bounds for MaxSat: Further Improved.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:247-258 [Conf] - Venkatesh Raman, S. Srinivasa Rao
**Static Dictionaries Supporting Rank.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:18-26 [Conf] - 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] - Meena Mahajan, Venkatesh Raman, Somnath Sikdar
**Parameterizing MAX SNP Problems Above Guaranteed Values.**[Citation Graph (0, 0)][DBLP] IWPEC, 2006, pp:38-49 [Conf] - 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] - 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] - 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] - J. Ian Munro, Venkatesh Raman, Adam J. Storm
**Representing dynamic binary trees succinctly.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:529-536 [Conf] - 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] - 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] - Venkatesh Raman, Saket Saurabh
**Triangles, 4-Cycles and Parameterized (In-)Tractability.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:304-315 [Conf] - 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] - 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] - J. Ian Munro, Venkatesh Raman
**Sorting with Minimum Data Movement (Preliminary Draft).**[Citation Graph (0, 0)][DBLP] WADS, 1989, pp:552-562 [Conf] - J. Ian Munro, Venkatesh Raman
**Sorting Multisets and Vectors In-Place.**[Citation Graph (0, 0)][DBLP] WADS, 1991, pp:473-480 [Conf] - Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
**Succinct Dynamic Data Structures.**[Citation Graph (0, 0)][DBLP] WADS, 2001, pp:426-437 [Conf] - Venkatesh Raman, Saket Saurabh
**Parameterized Complexity of Directed Feedback Set Problems in Tournaments.**[Citation Graph (0, 0)][DBLP] WADS, 2003, pp:484-492 [Conf] - 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] - J. Ian Munro, Venkatesh Raman
**Fast Stable In-Place Sorting with**[Citation Graph (0, 0)][DBLP]*O (n)*Data Moves. Algorithmica, 1996, v:16, n:2, pp:151-160 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] **Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.**[Citation Graph (, )][DBLP]**The Budgeted Unique Coverage Problem and Color-Coding.**[Citation Graph (, )][DBLP]**Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.**[Citation Graph (, )][DBLP]**Subexponential Algorithms for Partial Cover Problems.**[Citation Graph (, )][DBLP]**The Parameterized Complexity of the Unique Coverage Problem.**[Citation Graph (, )][DBLP]**The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.**[Citation Graph (, )][DBLP]**König Deletion Sets and Vertex Covers above the Matching Size.**[Citation Graph (, )][DBLP]**On the Directed Degree-Preserving Spanning Tree Problem.**[Citation Graph (, )][DBLP]**Solving minones-2-sat as Fast as vertex cover.**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.**[Citation Graph (, )][DBLP]**Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.**[Citation Graph (, )][DBLP]**FPT Algorithms for Connected Feedback Vertex Set.**[Citation Graph (, )][DBLP]**Parameterized Algorithms for Generalized Domination.**[Citation Graph (, )][DBLP]**Short Cycles Make**[Citation Graph (, )][DBLP]*W*-hard Problems Hard: FPT Algorithms for*W*-hard Problems in Graphs with no Short Cycles.**Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs**[Citation Graph (, )][DBLP]**FPT Algorithms for Connected Feedback Vertex Set**[Citation Graph (, )][DBLP]**Faster Algorithms for Finding and Counting Subgraphs**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs**[Citation Graph (, )][DBLP]**Bidimensionality and EPTAS**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |