×
Compute Distance To:
Author ID: raman.venkatesh Recent zbMATH articles by "Raman, Venkatesh"
Published as: Raman, Venkatesh; Raman, V.
Homepage: https://www.imsc.res.in/venkatesh_raman
External Links: MGP · ResearchGate · dblp · GND
all top 5

Co-Authors

3 single-authored
68 Saurabh, Saket
25 Munro, J. Ian
17 Sikdar, Somnath
14 Misra, Neeldhara
13 Lokshtanov, Daniel
12 Satti, Srinivasa Rao
11 Banik, Aritra
11 Raman, Rajeev
10 Majumdar, Diptapriyo
10 Rao, Satti Srinivasa
9 Panolan, Fahad
9 Philip, Geevarghese
8 Jayapaul, Varunkumar
7 Chakraborty, Sankardeep
7 Mouawad, Amer E.
7 Nishimura, Naomi
7 Ramanujan, M. S.
6 Banerjee, Niranka
6 Fomin, Fedor V.
6 Jacob, Ashwin
6 Narayanaswamy, N. S.
5 Chan, Timothy Moon-Yew
5 Lewenstein, Moshe
5 Mahajan, Meena
5 Sahlot, Vibha
5 Subramanian, C. R.
4 Biswas, Arindam
4 Crowston, Robert
4 Geary, Richard F.
4 Gutin, Gregory Z.
4 Paliwal, Vijay Kumar
4 Rai, Ashutosh
3 Choudhary, Pratibha
3 Goyal, Dishant
3 Kolay, Sudeshna
3 Krithika, R.
3 Mishra, Sounaka
3 Misra, Pranabendu
3 Neogi, Rian
3 Shankar, Bal Sri
3 Tale, Prafullkumar
2 Arora, Pranav
2 Balasubramanian, Ramachandran
2 Benoit, David
2 Demaine, Erik D.
2 Dorn, Frederic
2 El-Zein, Hicham
2 Fellows, Michael Ralph
2 Fiorini, Samuel
2 Gupta, Sushmita
2 Heggernes, Pinar
2 Jo, Seungbum
2 Khot, Subhash Ajit
2 Kratsch, Dieter
2 Kratsch, Stefan
2 Moser, Hannes
2 Mukherjee, Anish
2 Nicholson, Patrick K.
2 Pandurangan, Ragukumar
2 Pathak, Vinayak
2 Pilipczuk, Marcin L.
2 Radhakrishnan, Jaikumar
2 Rahman, Naila
2 Rama, Raghavan
2 Ramnath, Sarnath
2 Simjour, Narges
2 Suchý, Ondřej
2 Suzuki, Akira
2 Thankachan, Sharma V.
2 Yeo, Anders
1 Arvind, Vikraman
1 Bansal, Nikhil
1 Bonsma, Paul S.
1 Brodnik, Andrej
1 Downey, Rodney Graham
1 Francis, Mathew C.
1 Jayapaul, Varukumar
1 Kumar, Kaushtubh
1 López-Ortiz, Alejandro
1 Ordyniak, Sebastian
1 Raghavendra Rao, B. V.
1 Rangan, Chandrasekharan Pandu
1 Ravikumar, Bala
1 Roy, Sasanka
1 Salowe, Jeffrey S.
1 Satti, Srinivas Rao
1 Srihari, Sriganesh
1 Srinivasaragavan, G.
1 Storm, Adam J.
1 Suresh, S. P.
1 Szeider, Stefan
1 Vaishali, S.
1 Vijaykumar, Suhas
1 Villanger, Yngve
1 Viola, Alfredo
1 Wrochna, Marcin
1 Yegnanarayanan, Venkataraman

Publications by Year

Citations contained in zbMATH Open

137 Publications have been cited 1,369 times in 801 Documents Cited by Year
Parameterizing above guaranteed values: MaxSat and MaxCut. Zbl 0921.68052
Mahajan, Meena; Raman, Venkatesh
78
1999
Succinct indexable dictionaries with applications to encoding \(k\)-ary trees and multisets. Zbl 1093.68582
Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
75
2002
Succinct representation of balanced parentheses and static trees. Zbl 1017.68037
Munro, J. Ian; Raman, Venkatesh
71
2001
Representing trees of higher degree. Zbl 1086.68034
Benoit, David; Demaine, Erik D.; Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
49
2005
Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets. Zbl 1446.68046
Raman, Rajeev; Raman, Venkatesh; Satti, Srinivasa Rao
47
2007
Parameterized complexity of finding subgraphs with hereditary properties. Zbl 1061.68061
Khot, Subhash; Raman, Venkatesh
45
2002
Parameterizing above or below guaranteed values. Zbl 1155.68400
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath
40
2009
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
36
2014
Parameterized algorithms for feedback set problems and their duals in tournaments. Zbl 1086.68105
Raman, Venkatesh; Saurabh, Saket
32
2006
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles. Zbl 1170.68019
Raman, Venkatesh; Saurabh, Saket
28
2008
Upper bounds for MaxSat: Further improved. Zbl 0971.68069
Bansal, Nikhil; Raman, Venkatesh
27
1999
Space efficient suffix trees. Zbl 0977.68069
Munro, J. Ian; Raman, Venkatesh; Rao, S. Srinivasa
26
2001
Succinct ordinal trees with level-ancestor queries. Zbl 1321.68223
Geary, Richard F.; Raman, Rajeev; Raman, Venkatesh
25
2006
Selection from read-only memory and sorting with minimum data movement. Zbl 0872.68045
Munro, J. Ian; Raman, Venkatesh
25
1996
An improved fixed-parameter algorithm for vertex cover. Zbl 1337.05095
Balasubramanian, R.; Fellows, Michael R.; Raman, Venkatesh
25
1998
Succinct representations of permutations and functions. Zbl 1245.68075
Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
22
2012
A simple optimal representation for balanced parentheses. Zbl 1103.68040
Geary, Richard F.; Rahman, Naila; Raman, Rajeev; Raman, Venkatesh
22
2006
Succinct dynamic data structures. Zbl 0997.68520
Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
21
2001
Faster fixed parameter tractable algorithms for finding feedback vertex sets. Zbl 1321.05275
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R.
20
2006
Approximation algorithms for some parameterized counting problems. Zbl 1019.68135
Arvind, V.; Raman, Venkatesh
19
2002
The complexity of bounded length graph recoloring and CSP reconfiguration. Zbl 1456.68065
Bonsma, Paul; Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
19
2014
Efficient exact algorithms through enumerating maximal independent sets and other techniques. Zbl 1148.68054
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
18
2007
Bidimensionality and EPTAS. Zbl 1377.68324
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
18
2011
The complexity of König subgraph problems and above-guarantee vertex cover. Zbl 1243.05203
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
16
2011
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
16
2012
On the parameterized complexity of reconfiguration problems. Zbl 1360.68516
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
16
2017
A simplified NP-complete MAXSAT problem. Zbl 1339.68122
Raman, Venkatesh; Ravikumar, B.; Srinivasa Rao, S.
16
1998
Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. Zbl 1256.68084
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
16
2009
On the parameterized complexity of reconfiguration problems. Zbl 1350.68155
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
15
2013
Succinct representations of permutations. Zbl 1039.68546
Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, Satti Srinivasa
14
2003
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
14
2012
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68246
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
13
2015
Vertex cover reconfiguration and beyond. Zbl 1432.68164
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
13
2014
Lower bounds on kernelization. Zbl 1248.90078
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket
13
2011
Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. Zbl 1261.05066
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket
13
2012
The complexity of irredundant sets parameterized by size. Zbl 0948.68133
Downey, Rodney G.; Fellows, Michael R.; Raman, Venkatesh
12
2000
Subexponential algorithms for partial cover problems. Zbl 1260.05159
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
12
2011
Reconfiguration over tree decompositions. Zbl 1456.68132
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Wrochna, Marcin
12
2014
Faster algorithms for finding and counting subgraphs. Zbl 1246.05149
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V.
11
2012
Representing dynamic binary trees succinctly. Zbl 0987.68054
Munro, J. Ian; Raman, Venkatesh; Storm, Adam J.
11
2001
Faster fixed parameter tractable algorithms for undirected feedback vertex set. Zbl 1019.68082
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R.
11
2002
Polynomial kernels for Dominating Set in graphs of bounded degeneracy and beyond. Zbl 1301.68164
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
10
2012
LP can be a cure for parameterized problems. Zbl 1245.68111
Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
10
2012
Paths, flowers and vertex cover. Zbl 1346.05287
Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
10
2011
Improved upper bounds for time-space trade-offs for selection. Zbl 0946.68156
Raman, Venkatesh; Ramnath, Sarnath
10
1999
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
9
2010
The parameterized complexity of unique coverage and its variants. Zbl 1290.68059
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
9
2013
Kernels for structural parameterizations of vertex cover – case of small degree modulators. Zbl 1378.68089
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
9
2015
Parameterized algorithms for even cycle transversal. Zbl 1341.05248
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
8
2012
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. Zbl 1183.05084
Raman, Venkatesh; Saurabh, Saket
8
2007
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs. Zbl 1465.68203
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Roy, Sasanka; Saurabh, Saket
7
2015
Improved exact exponential algorithms for vertex bipartization and other problems. Zbl 1171.68646
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
7
2005
Explicit deterministic constructions for membership in the bitprobe model. Zbl 1006.68523
Radhakrishnan, Jaikumar; Raman, Venkatesh; Rao, S. Srinivasa
7
2001
Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits. Zbl 1375.68089
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
7
2017
Parameterized complexity of MaxSat above average. Zbl 1353.68116
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket
6
2012
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1230.68104
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
6
2010
Biconnectivity, chain decomposition and \(st\)-numbering using \(O(n)\) bits. Zbl 1398.05193
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
6
2016
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
6
2010
The complexity of finding subgraphs whose matching number equals the vertex cover number. Zbl 1193.05133
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
6
2007
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68247
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
6
2017
Improved space efficient algorithms for BFS, DFS and applications. Zbl 1477.68197
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh
6
2016
Succinct ordinal trees with level-ancestor queries. Zbl 1317.68043
Geary, Richard F.; Raman, Rajeev; Raman, Venkatesh
5
2004
Selection and sorting in the “restore” model. Zbl 1421.68033
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
5
2014
Triangles, 4-cycles and parameterized (in-)tractability. Zbl 1142.68374
Raman, Venkatesh; Saurabh, Saket
5
2006
Fast exponential algorithms for maximum \(r\)-regular induced subgraph problems. Zbl 1177.68154
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket
5
2006
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Zbl 1285.68207
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
5
2010
Parameterized algorithms for generalized domination. Zbl 1168.05354
Raman, Venkatesh; Saurabh, Saket; Srihari, Sriganesh
5
2008
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. Zbl 1417.05082
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket
4
2013
Faster, space-efficient selection algorithms in read-only memory for integers. Zbl 1310.68218
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
4
2013
Sorting multisets and vectors in-place. Zbl 0765.68027
Munro, J. Ian; Raman, Venkatesh
4
1991
Stable in situ sorting and minimum data movement. Zbl 0696.68086
Munro, J. Ian; Raman, Venkatesh; Salowe, Jeffrey S.
4
1990
Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs. Zbl 1398.68248
Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket
4
2016
Parameterized complexity of the induced subgraph problem in directed graphs. Zbl 1185.05076
Raman, Venkatesh; Sikdar, Somnath
4
2007
A survey of data structures in the bitprobe model. Zbl 1395.68103
Nicholson, Patrick K.; Raman, Venkatesh; Rao, S. Srinivasa
4
2013
The parameterized complexity of the unique coverage problem. Zbl 1193.68139
Moser, Hannes; Raman, Venkatesh; Sikdar, Somnath
4
2007
Parameterizing MAX SNP problems above guaranteed values. Zbl 1154.68430
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath
4
2006
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1433.68290
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
3
2013
Sorting with minimum data movement. Zbl 0772.68023
Munro, J. Ian; Raman, Venkatesh
3
1992
Sorting and selection with equality comparisons. Zbl 1451.68085
Jayapaul, Varunkumar; Munro, J. Ian; Raman, Venkatesh; Satti, Srinivasa Rao
3
2015
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2014
Parameterized complexity of finding subgraphs with hereditary properties. Zbl 0988.68081
Khot, Subhash; Raman, Venkatesh
3
2000
On the pseudoachromatic number of join of graphs. Zbl 1044.05038
Balasubramanian, R.; Raman, Venkatesh; Yegnanarayanan, V.
3
2003
Fixed-parameter tractability of \((n-k)\) list coloring. Zbl 1464.68129
Banik, Aritra; Jacob, Ashwin; Paliwal, Vijay Kumar; Raman, Venkatesh
3
2019
Finding scores in tournaments. Zbl 0888.68048
Balasubramanian, R.; Raman, Venkatesh; Srinivasaragavan, G.
3
1997
Space efficient linear time algorithms for BFS, DFS and applications. Zbl 1430.68173
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
3
2018
Polynomial kernels for vertex cover parameterized by small degree modulators. Zbl 1419.05179
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
3
2018
A simple optimal representation for balanced parentheses. Zbl 1103.68474
Geary, Richard F.; Rahman, Naila; Raman, Rajeev; Raman, Venkatesh
3
2004
The effect of girth on the kernelization complexity of connected dominating set. Zbl 1245.68094
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2010
The budgeted unique coverage problem and color-coding (extended abstract). Zbl 1248.68257
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
3
2009
Fréchet distance between a line and avatar point set. Zbl 1391.68105
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha
3
2018
Path balance heuristic for self-adjusting binary search trees. Zbl 1354.68235
Balasubramanian, R.; Raman, Venkatesh
3
1995
Space efficient data structures for nearest larger neighbor. Zbl 1351.68086
Jayapaul, Varunkumar; Jo, Seungbum; Raman, Rajeev; Raman, Venkatesh; Satti, Srinivasa Rao
3
2016
Improved explicit data structures in the bitprobe model. Zbl 1425.68090
Lewenstein, Moshe; Munro, J. Ian; Nicholson, Patrick K.; Raman, Venkatesh
2
2014
An FPT algorithm for Tree Deletion Set. Zbl 1276.05118
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
2
2013
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. Zbl 1358.68313
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
2
2013
Solving min ones 2-SAT as fast as vertex cover. Zbl 1301.68163
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri
2
2013
Parameterized complexity of MaxSat above average. Zbl 1358.68126
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket
2
2013
Less space: indexing for queries with wildcards. Zbl 1329.68315
Lewenstein, Moshe; Munro, J. Ian; Raman, Venkatesh; Thankachan, Sharma V.
2
2013
Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Zbl 1202.68012
2
2010
A tradeoff between search and update in dictionaries. Zbl 1003.68034
Radhakrishnan, Jaikumar; Raman, Venkatesh
2
2001
Parameterized complexity of geometric covering problems having conflicts. Zbl 1436.68145
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket
1
2020
A polynomial sized kernel for tracking paths problem. Zbl 1436.68142
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
1
2020
Fixed-parameter tractability of \((n-k)\) list coloring. Zbl 1464.68129
Banik, Aritra; Jacob, Ashwin; Paliwal, Vijay Kumar; Raman, Venkatesh
3
2019
Deconstructing parameterized hardness of Fair Vertex Deletion problems. Zbl 07172850
Jacob, Ashwin; Raman, Venkatesh; Sahlot, Vibha
2
2019
Fully dynamic arboricity maintenance. Zbl 1441.68160
Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket
1
2019
Parameterized complexity of conflict-free set cover. Zbl 07121067
Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh
1
2019
Space efficient linear time algorithms for BFS, DFS and applications. Zbl 1430.68173
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
3
2018
Polynomial kernels for vertex cover parameterized by small degree modulators. Zbl 1419.05179
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
3
2018
Fréchet distance between a line and avatar point set. Zbl 1391.68105
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha
3
2018
Some (in)tractable parameterizations of coloring and list-coloring. Zbl 1446.68074
Arora, Pranav; Banik, Aritra; Paliwal, Vijay Kumar; Raman, Venkatesh
2
2018
Revisiting connected vertex cover: FPT algorithms and lossy kernels. Zbl 1430.68225
Krithika, R.; Majumdar, Diptapriyo; Raman, Venkatesh
2
2018
Selection and sorting in the “restore” model. Zbl 1421.68032
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
1
2018
Approximability of clique transversal in perfect graphs. Zbl 1392.68201
Fiorini, Samuel; Krithika, R.; Narayanaswamy, N. S.; Raman, Venkatesh
1
2018
A polynomial sized kernel for tracking paths problem. Zbl 1436.68143
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
1
2018
A framework for in-place graph algorithms. Zbl 07378683
Chakraborty, Sankardeep; Mukherjee, Anish; Raman, Venkatesh; Satti, Srinivasa Rao
1
2018
On the parameterized complexity of reconfiguration problems. Zbl 1360.68516
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
16
2017
Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits. Zbl 1375.68089
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
7
2017
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68247
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
6
2017
The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments. Zbl 07048097
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao
1
2017
Parameterized complexity of geometric covering problems having conflicts. Zbl 1436.68144
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket
1
2017
Exact and parameterized algorithms for \((k,i)\)-coloring. Zbl 06702495
Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Tale, Prafullkumar
1
2017
Biconnectivity, chain decomposition and \(st\)-numbering using \(O(n)\) bits. Zbl 1398.05193
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao
6
2016
Improved space efficient algorithms for BFS, DFS and applications. Zbl 1477.68197
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh
6
2016
Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs. Zbl 1398.68248
Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket
4
2016
Space efficient data structures for nearest larger neighbor. Zbl 1351.68086
Jayapaul, Varunkumar; Jo, Seungbum; Raman, Rajeev; Raman, Venkatesh; Satti, Srinivasa Rao
3
2016
Fréchet distance between a line and avatar point set. Zbl 1390.68705
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha
2
2016
Finding mode using equality comparisons. Zbl 1475.68216
Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao
1
2016
Shortest reconfiguration paths in the solution space of Boolean formulas. Zbl 1374.68246
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh
13
2015
Kernels for structural parameterizations of vertex cover – case of small degree modulators. Zbl 1378.68089
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
9
2015
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs. Zbl 1465.68203
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Roy, Sasanka; Saurabh, Saket
7
2015
Sorting and selection with equality comparisons. Zbl 1451.68085
Jayapaul, Varunkumar; Munro, J. Ian; Raman, Venkatesh; Satti, Srinivasa Rao
3
2015
Finding median in read-only memory on integer input. Zbl 1310.68219
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
2
2015
Space efficient data structures for nearest larger neighbor. Zbl 1350.68075
Jayapaul, Varunkumar; Jo, Seungbum; Raman, Venkatesh; Satti, Srinivasa Rao
2
2015
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
36
2014
The complexity of bounded length graph recoloring and CSP reconfiguration. Zbl 1456.68065
Bonsma, Paul; Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
19
2014
Vertex cover reconfiguration and beyond. Zbl 1432.68164
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh
13
2014
Reconfiguration over tree decompositions. Zbl 1456.68132
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Wrochna, Marcin
12
2014
Selection and sorting in the “restore” model. Zbl 1421.68033
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
5
2014
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2014
Improved explicit data structures in the bitprobe model. Zbl 1425.68090
Lewenstein, Moshe; Munro, J. Ian; Nicholson, Patrick K.; Raman, Venkatesh
2
2014
Fixed-parameter tractability of satisfying beyond the number of variables. Zbl 1360.68502
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket; Yeo, Anders
2
2014
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. Zbl 1347.68171
Kratsch, Stefan; Pilipczuk, Marcin; Rai, Ashutosh; Raman, Venkatesh
2
2014
On the parameterized complexity of reconfiguration problems. Zbl 1350.68155
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira
15
2013
The parameterized complexity of unique coverage and its variants. Zbl 1290.68059
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
9
2013
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. Zbl 1417.05082
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket
4
2013
Faster, space-efficient selection algorithms in read-only memory for integers. Zbl 1310.68218
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh
4
2013
A survey of data structures in the bitprobe model. Zbl 1395.68103
Nicholson, Patrick K.; Raman, Venkatesh; Rao, S. Srinivasa
4
2013
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1433.68290
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
3
2013
An FPT algorithm for Tree Deletion Set. Zbl 1276.05118
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
2
2013
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. Zbl 1358.68313
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
2
2013
Solving min ones 2-SAT as fast as vertex cover. Zbl 1301.68163
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri
2
2013
Parameterized complexity of MaxSat above average. Zbl 1358.68126
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket
2
2013
Less space: indexing for queries with wildcards. Zbl 1329.68315
Lewenstein, Moshe; Munro, J. Ian; Raman, Venkatesh; Thankachan, Sharma V.
2
2013
A polynomial kernel for Feedback Arc Set on bipartite tournaments. Zbl 1277.05077
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
1
2013
Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Zbl 1270.68019
1
2013
Improved fixed-parameter algorithm for the minimum weight 3-SAT problem. Zbl 1379.68177
Raman, Venkatesh; Shankar, Bal Sri
1
2013
An FPT algorithm for tree deletion set. Zbl 1379.68176
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
1
2013
Succinct representations of permutations and functions. Zbl 1245.68075
Munro, J. Ian; Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa
22
2012
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
16
2012
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
14
2012
Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. Zbl 1261.05066
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket
13
2012
Faster algorithms for finding and counting subgraphs. Zbl 1246.05149
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V.
11
2012
Polynomial kernels for Dominating Set in graphs of bounded degeneracy and beyond. Zbl 1301.68164
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
10
2012
LP can be a cure for parameterized problems. Zbl 1245.68111
Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
10
2012
Parameterized algorithms for even cycle transversal. Zbl 1341.05248
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
8
2012
Parameterized complexity of MaxSat above average. Zbl 1353.68116
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket
6
2012
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. Zbl 1357.68073
Kratsch, Stefan; Pilipczuk, Marcin; Rai, Ashutosh; Raman, Venkatesh
2
2012
Bidimensionality and EPTAS. Zbl 1377.68324
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
18
2011
The complexity of König subgraph problems and above-guarantee vertex cover. Zbl 1243.05203
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
16
2011
Lower bounds on kernelization. Zbl 1248.90078
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket
13
2011
Subexponential algorithms for partial cover problems. Zbl 1260.05159
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
12
2011
Paths, flowers and vertex cover. Zbl 1346.05287
Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
10
2011
A polynomial kernel for Feedback Arc Set on bipartite tournaments. Zbl 1350.68154
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
2
2011
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
9
2010
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1230.68104
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
6
2010
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
6
2010
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Zbl 1285.68207
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
5
2010
The effect of girth on the kernelization complexity of connected dominating set. Zbl 1245.68094
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2010
Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Zbl 1202.68012
2
2010
Parameterizing above or below guaranteed values. Zbl 1155.68400
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath
40
2009
Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. Zbl 1256.68084
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
16
2009
The budgeted unique coverage problem and color-coding (extended abstract). Zbl 1248.68257
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
3
2009
Subexponential algorithms for partial cover problems. Zbl 1248.68215
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
2
2009
On the directed degree-preserving spanning tree problem. Zbl 1273.68182
Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
2
2009
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles. Zbl 1170.68019
Raman, Venkatesh; Saurabh, Saket
28
2008
Parameterized algorithms for generalized domination. Zbl 1168.05354
Raman, Venkatesh; Saurabh, Saket; Srihari, Sriganesh
5
2008
König deletion sets and vertex covers above the matching size. Zbl 1183.68313
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
2
2008
Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets. Zbl 1446.68046
Raman, Rajeev; Raman, Venkatesh; Satti, Srinivasa Rao
47
2007
Efficient exact algorithms through enumerating maximal independent sets and other techniques. Zbl 1148.68054
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
18
2007
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. Zbl 1183.05084
Raman, Venkatesh; Saurabh, Saket
8
2007
The complexity of finding subgraphs whose matching number equals the vertex cover number. Zbl 1193.05133
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
6
2007
Parameterized complexity of the induced subgraph problem in directed graphs. Zbl 1185.05076
Raman, Venkatesh; Sikdar, Somnath
4
2007
The parameterized complexity of the unique coverage problem. Zbl 1193.68139
Moser, Hannes; Raman, Venkatesh; Sikdar, Somnath
4
2007
Parameterized algorithms for feedback set problems and their duals in tournaments. Zbl 1086.68105
Raman, Venkatesh; Saurabh, Saket
32
2006
Succinct ordinal trees with level-ancestor queries. Zbl 1321.68223
Geary, Richard F.; Raman, Rajeev; Raman, Venkatesh
25
2006
A simple optimal representation for balanced parentheses. Zbl 1103.68040
Geary, Richard F.; Rahman, Naila; Raman, Rajeev; Raman, Venkatesh
22
2006
Faster fixed parameter tractable algorithms for finding feedback vertex sets. Zbl 1321.05275
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R.
20
2006
Triangles, 4-cycles and parameterized (in-)tractability. Zbl 1142.68374
Raman, Venkatesh; Saurabh, Saket
5
2006
Fast exponential algorithms for maximum \(r\)-regular induced subgraph problems. Zbl 1177.68154
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket
5
2006
Parameterizing MAX SNP problems above guaranteed values. Zbl 1154.68430
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath
4
2006
...and 37 more Documents
all top 5

Cited by 936 Authors

72 Saurabh, Saket
60 Raman, Venkatesh
47 Navarro, Gonzalo
34 Fomin, Fedor V.
29 Lokshtanov, Daniel
25 Gutin, Gregory Z.
25 Munro, J. Ian
21 Chen, Jian-er
20 Zehavi, Meirav
19 Niedermeier, Rolf
19 Yeo, Anders
18 Pilipczuk, Marcin L.
18 Satti, Srinivasa Rao
16 Fernau, Henning
16 Golovach, Petr A.
16 Ito, Takehiro
16 Pilipczuk, Michał
15 Gagie, Travis
15 Ramanujan, M. S.
15 Thilikos, Dimitrios M.
14 He, Meng
14 Mnich, Matthias
14 Sadakane, Kunihiko
13 Cygan, Marek
13 Kratsch, Stefan
13 Wang, Jianxin
12 Paulusma, Daniël
12 Raman, Rajeev
12 Thankachan, Sharma V.
11 Mouawad, Amer E.
11 Panolan, Fahad
11 Uehara, Ryuhei
11 Villanger, Yngve
10 Crowston, Robert
10 Guo, Jiong
10 Johnson, Matthew
10 Kanj, Iyad A.
10 Otachi, Yota
9 Bang-Jensen, Jørgen
9 Bonamy, Marthe
9 Dabrowski, Konrad Kazimierz
9 Fellows, Michael Ralph
9 Gaspers, Serge
9 Heggernes, Pinar
9 Jansen, Bart M. P.
9 Krithika, R.
9 Misra, Neeldhara
9 Xiao, Mingyu
8 Barbay, Jérémy
8 Bazgan, Cristina
8 Bille, Philip
8 Chakraborty, Sankardeep
8 Fischer, Johannes
8 Kim, Eun Jung
8 Komusiewicz, Christian
8 Kratsch, Dieter
8 Lampis, Michael
8 Li, Wenjun
8 Majumdar, Diptapriyo
8 Marx, Dániel
8 Nishimura, Naomi
8 Ono, Hirotaka
8 Philip, Geevarghese
8 Puglisi, Simon J.
8 Rao, Satti Srinivasa
8 Sau, Ignasi
8 Szeider, Stefan
8 Wojtaszczyk, Jakub Onufry
8 Xia, Ge
7 Grossi, Roberto
7 Misra, Pranabendu
7 Nekrich, Yakov
7 Paschos, Vangelis Th.
7 Shah, Rahul
7 Sikdar, Somnath
7 Suzuki, Akira
6 Agrawal, Akanksha
6 Belazzougui, Djamal
6 Farzan, Arash
6 Feghali, Carl
6 Gørtz, Inge Li
6 Hanaka, Tesshu
6 Klein, Shmuel Tomi
6 Moser, Hannes
6 Paul, Christophe
6 Shapira, Dana
6 Sikora, Florian
6 Tsur, Dekel
6 van ’t Hof, Pim
6 Yamanaka, Katsuhisa
6 Yang, Yongjie
6 Zhou, Xiao
5 Banik, Aritra
5 Bodlaender, Hans L.
5 Bousquet, Nicolas
5 Branković, Ljiljana
5 Chandrasekaran, Karthekeyan
5 Curticapean, Radu
5 Eiben, Eduard
5 Hon, Wing-Kai
...and 836 more Authors
all top 5

Cited in 79 Serials

155 Theoretical Computer Science
121 Algorithmica
44 Journal of Computer and System Sciences
40 Discrete Applied Mathematics
34 Information Processing Letters
32 Theory of Computing Systems
28 Journal of Discrete Algorithms
25 SIAM Journal on Discrete Mathematics
16 Information and Computation
13 Journal of Combinatorial Optimization
12 Computational Geometry
11 Algorithms
10 SIAM Journal on Computing
6 International Journal of Foundations of Computer Science
6 ACM Journal of Experimental Algorithmics
4 Journal of Graph Theory
4 Discrete Optimization
3 Artificial Intelligence
3 Information Sciences
3 Mathematical Programming. Series A. Series B
3 Mathematics in Computer Science
3 ACM Transactions on Computation Theory
2 Acta Informatica
2 Discrete Mathematics
2 Applied Mathematics and Computation
2 BIT
2 Journal of Combinatorial Theory. Series B
2 European Journal of Combinatorics
2 Annals of Pure and Applied Logic
2 Discrete & Computational Geometry
2 Annals of Operations Research
2 Combinatorics, Probability and Computing
2 Journal of Mathematical Sciences (New York)
2 The Electronic Journal of Combinatorics
2 Discrete Mathematics, Algorithms and Applications
2 Computer Science Review
1 ACM Computing Surveys
1 Mathematics of Operations Research
1 Networks
1 Operations Research
1 Programming and Computer Software
1 Synthese
1 Operations Research Letters
1 Combinatorica
1 Computer Aided Geometric Design
1 Acta Mathematicae Applicatae Sinica. English Series
1 Graphs and Combinatorics
1 Journal of Computer Science and Technology
1 Facta Universitatis. Series Mathematics and Informatics
1 Computers & Operations Research
1 Asia-Pacific Journal of Operational Research
1 Applied Mathematics Letters
1 Machine Learning
1 Journal of Global Optimization
1 Designs, Codes and Cryptography
1 Linear Algebra and its Applications
1 Distributed Computing
1 The Australasian Journal of Combinatorics
1 Cybernetics and Systems Analysis
1 Georgian Mathematical Journal
1 Annals of Mathematics and Artificial Intelligence
1 Constraints
1 Journal of Scheduling
1 Journal of Graph Algorithms and Applications
1 Journal of the ACM
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Annals of Mathematics. Second Series
1 Interdisciplinary Information Sciences (IIS)
1 Fundamenta Informaticae
1 RAIRO. Operations Research
1 Discrete and Continuous Dynamical Systems. Series B
1 4OR
1 AKCE International Journal of Graphs and Combinatorics
1 Optimization Letters
1 Science China. Information Sciences
1 RAIRO. Theoretical Informatics and Applications
1 ACM Transactions on Algorithms
1 Journal of Theoretical Biology
1 Bulletin of the Hellenic Mathematical Society

Citations by Year