| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Venkatesh Raman, Saket Saurabh |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Faster Parameterized Algorithms using Linear Programming |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao |
Faster algorithms for finding and counting subgraphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
Parameterized Complexity of MaxSat above Average. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
LP can be a cure for Parameterized Problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh |
Lower bounds on kernelization. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the directed Full Degree Spanning Tree problem. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential algorithms for partial cover problems. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
Parameterized Complexity of MaxSat Above Average |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations and Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Paths, Flowers and Vertex Cover. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
On Parameterized Independent Feedback Vertex Set. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
Solving minones-2-sat as Fast as vertex cover. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh (eds.) |
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
The effect of girth on the kernelization complexity of Connected Dominating Set. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh |
Faster Algorithms for Finding and Counting Subgraphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman, Somnath Sikdar |
Parameterizing above or below guaranteed values. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
The Budgeted Unique Coverage Problem and Color-Coding. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential Algorithms for Partial Cover Problems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
| 1 | Venkatesh Raman, Saket Saurabh, Sriganesh Srihari |
Parameterized Algorithms for Generalized Domination. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
König Deletion Sets and Vertex Covers above the Matching Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Somnath Sikdar |
Parameterized complexity of the induced subgraph problem in directed graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures |
| 1 | Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti |
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
The Parameterized Complexity of the Unique Coverage Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Parameterized algorithms for feedback set problems and their duals in tournaments. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
A simple optimal representation for balanced parentheses. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar |
Approximate Block Sorting. |
Int. J. Found. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
Faster fixed parameter tractable algorithms for finding feedback vertex sets. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
parameterized complexity, Feedback vertex set, girth |
| 1 | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
Succinct ordinal trees with level-ancestor queries. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
XML document representation, Succinct data structures |
| 1 | Meena Mahajan, Venkatesh Raman, Somnath Sikdar |
Parameterizing MAX SNP Problems Above Guaranteed Values. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Triangles, 4-Cycles and Parameterized (In-)Tractability. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushmita Gupta, Venkatesh Raman, Saket Saurabh |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
Faster algorithms for feedback vertex set. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Representing Trees of Higher Degree. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures |
| 1 | Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
Succinct ordinal trees with level-ancestor queries. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
A Simple Optimal Representation for Balanced Parentheses. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Balasubramanian, Venkatesh Raman, V. Yegnanarayanan |
On the pseudoachromatic number of join of graphs. |
Int. J. Comput. Math. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Parameterized Complexity of Directed Feedback Set Problems in Tournaments. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar |
Merging and Sorting By Strip Moves. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Venkatesh Raman |
Approximate Counting small subgraphs of bounded treewidth and related problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Venkatesh Raman |
Parameterized complexity of finding subgraphs with hereditary properties. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Venkatesh Raman |
Approximation Algorithms for Some Parameterized Counting Problems. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Venkatesh Raman |
A tradeoff between search and update in dictionaries. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao |
Space Efficient Suffix Trees. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Succinct Representation of Balanced Parentheses and Static Trees. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao |
Explicit Deterministic Constructions for Membership in the Bitprobe Model. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, Adam J. Storm |
Representing dynamic binary trees succinctly. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Dynamic Data Structures. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Michael R. Fellows, Venkatesh Raman |
The complexity of irredundant sets parameterized by size. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Venkatesh Raman |
Parameterized Complexity of Finding Subgraphs with Hereditary Properties. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarnath Ramnath, Venkatesh Raman |
Selecting Small Ranks in EREW PRAM. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman |
Parameterizing above Guaranteed Values: MaxSat and MaxCut. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Sarnath Ramnath |
Improved Upper Bounds for Time-Space Trade-offs for Selection. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
| 1 | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman |
Representing Trees of Higer Degree. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Venkatesh Raman |
Upper Bounds for MaxSat: Further Improved. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, S. Srinivasa Rao |
Static Dictionaries Supporting Rank. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam (eds.) |
Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings |
FSTTCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | R. Balasubramanian, Michael R. Fellows, Venkatesh Raman |
An Improved Fixed-Parameter Algorithm for Vertex Cover. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao |
A Simplified NP-Complete MAXSAT Problem. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Sarnath Ramnath |
Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao |
Space Efficient Suffix Trees. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman |
Parametrizing Above Guaranteed Values: MaxSat and MaxCut |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan |
Finding Scores in Tournaments. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
balanced parentheses, static trees, rooted ordered tree, planar graphs, abstract data types, abstract data types, binary tree, adjacency, succinct representation |
| 1 | J. Ian Munro, Venkatesh Raman |
Selection from Read-Only Memory and Sorting with Minimum Data Movement. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Fast Stable In-Place Sorting with O (n) Data Moves. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
Tight Bounds for Finding Degrees from the Adjacency Matrix. |
LATIN |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Balasubramanian, Venkatesh Raman |
Path Balance Heuristic for Self-Adjusting Binary Search Trees. |
FSTTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan |
The Complexity of Finding Certain Trees in Tournaments. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Sorting with Minimum Data Movement. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Selection from Read-Only Memory and Sorting with Optimum Data Movement. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Sorting Multisets and Vectors In-Place. |
WADS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Fast Sorting In-Place Sorting with O(n) Data. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe |
Stable in Situ Sorting and Minimum Data Movement. |
BIT |
1990 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Sorting with Minimum Data Movement (Preliminary Draft). |
WADS |
1989 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")