Venkatesh Raman
Venkatesh Raman
Professor, IMSc Chennai
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
R Raman, V Raman, SR Satti
ACM Transactions on Algorithms (TALG) 3 (4), 43-es, 2007
Succinct representation of balanced parentheses and static trees
JI Munro, V Raman
SIAM Journal on Computing 31 (3), 762-776, 2001
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43, 275-292, 2005
Parameterizing above guaranteed values: MaxSat and MaxCut
M Mahajan, V Raman
Journal of Algorithms 31 (2), 335-354, 1999
An improved fixed-parameter algorithm for vertex cover
R Balasubramanian, MR Fellows, V Raman
Information Processing Letters 65 (3), 163-168, 1998
Succinct representation of balanced parentheses, static trees and planar graphs
JI Munro, V Raman
Proceedings 38th Annual Symposium on Foundations of Computer Science, 118-126, 1997
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014
Succinct ordinal trees with level-ancestor queries
RF Geary, R Raman, V Raman
ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006
Space efficient suffix trees
JI Munro, V Raman, SS Rao
Journal of Algorithms 39 (2), 205-222, 2001
Parameterized complexity of finding subgraphs with hereditary properties
S Khot, V Raman
Theoretical Computer Science 289 (2), 997-1008, 2002
Succinct dynamic data structures
R Raman, V Raman, SS Rao
Algorithms and Data Structures: 7th International Workshop, WADS 2001 …, 2001
Succinct representations of permutations
JI Munro, R Raman, V Raman, SS Rao
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
Upper bounds for MaxSat: Further improved
A Aggarwal, CP Rangan, N Bansal, V Raman
Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999
Parameterizing above or below guaranteed values
M Mahajan, V Raman, S Sikdar
Journal of Computer and System Sciences 75 (2), 137-153, 2009
Approximation algorithms for some parameterized counting problems
V Arvind, V Raman
Algorithms and Computation: 13th International Symposium, ISAAC 2002 …, 2002
On the parameterized complexity of reconfiguration problems
AE Mouawad, N Nishimura, V Raman, N Simjour, A Suzuki
Algorithmica 78 (1), 274-297, 2017
Parameterized algorithms for feedback set problems and their duals in tournaments
V Raman, S Saurabh
Theoretical Computer Science 351 (3), 446-458, 2006
Bidimensionality and EPTAS
FV Fomin, D Lokshtanov, V Raman, S Saurabh
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
A simple optimal representation for balanced parentheses
RF Geary, N Rahman, R Raman, V Raman
Theoretical Computer Science 368 (3), 231-246, 2006
Selection from read-only memory and sorting with minimum data movement
JI Munro, V Raman
Theoretical Computer Science 165 (2), 311-323, 1996
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20