default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVenkatesh Raman 0001
Person information
- affiliation: The Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- Venkatesh Raman 0002 — Pennsylvania State University, USA
- Venkatesh Raman 0003 — Ford Motor Company, Dearborn, MI, USA
- Venkatesh Raman 0004 — Veterans Affairs Medical Center, Division of Cardiology, Washington, DC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j95]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized complexity of dominating set variants in almost cluster and split graphs. J. Comput. Syst. Sci. 150: 103631 (2025)- [j94]Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator coloring and CD coloring in almost cluster graphs. J. Comput. Syst. Sci. 150: 103633 (2025) - 2024
- [i40]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR abs/2405.10556 (2024) - 2023
- [j93]Ashwin Jacob, Diptapriyo Majumdar
, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16(3): 144 (2023) - [j92]Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman:
Improved kernels for tracking paths. Inf. Process. Lett. 181: 106360 (2023) - [j91]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. 136: 280-301 (2023) - [j90]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138: 103460 (2023) - [j89]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940(Part): 209-221 (2023) - [c112]Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS 2023: 106-119 - [i39]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR abs/2303.02687 (2023) - 2022
- [j88]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. Algorithmica 84(8): 2335-2357 (2022) - [j87]Hemangee Kalpesh Kapoor, Mausam, Venkatesh Raman:
Welcome back! Commun. ACM 65(11): 40-42 (2022) - [j86]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding kings in tournaments. Discret. Appl. Math. 322: 240-252 (2022) - [j85]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123: 1-19 (2022) - [j84]Pratibha Choudhary, Venkatesh Raman:
Structural parameterizations of Tracking Paths problem. Theor. Comput. Sci. 934: 91-102 (2022) - [c111]Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
Output Sensitive Fault Tolerant Maximum Matching. CSR 2022: 115-132 - [c110]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. WALCOM 2022: 340-351 - [i38]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR abs/2201.03142 (2022) - [i37]Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR abs/2210.17321 (2022) - 2021
- [j83]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. Algorithmica 83(7): 2303-2331 (2021) - [j82]Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. Algorithmica 83(11): 3338-3362 (2021) - [j81]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65(3): 515-540 (2021) - [c109]Arindam Biswas, Venkatesh Raman:
Sublinear-Space Approximation Algorithms for Max r-SAT. COCOON 2021: 124-136 - [c108]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT 2021: 314-326 - [c107]Sukanya Pandey, Venkatesh Raman, Vibha Sahlot:
Parameterizing Role Coloring on Forests. SOFSEM 2021: 308-321 - [i36]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes I -- case of finite number of graph classes. CoRR abs/2105.04660 (2021) - [i35]Arindam Biswas, Venkatesh Raman:
Sublinear-Space Approximation Algorithms for Max r-SAT. CoRR abs/2107.01673 (2021) - [i34]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. CoRR abs/2110.14498 (2021) - [i33]Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh:
Space-Efficient FPT Algorithms. CoRR abs/2112.15233 (2021) - 2020
- [j80]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j79]Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020) - [j78]Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman:
Elusiveness of finding degrees. Discret. Appl. Math. 286: 128-139 (2020) - [j77]Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. 161: 105964 (2020) - [j76]Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64(7): 1307-1316 (2020) - [j75]Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
List-coloring - Parameterizing from triviality. Theor. Comput. Sci. 821: 102-110 (2020) - [j74]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Fully dynamic arboricity maintenance. Theor. Comput. Sci. 822: 1-14 (2020) - [j73]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846: 1-13 (2020) - [c106]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Optimal Output Sensitive Fault Tolerant Cuts. FSTTCS 2020: 10:1-10:19 - [c105]Pratibha Choudhary, Venkatesh Raman:
Structural Parameterizations of Tracking Paths Problem. ICTCS 2020: 15-27 - [c104]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC 2020: 18:1-18:17 - [c103]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. IPEC 2020: 19:1-19:18 - [c102]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. MFCS 2020: 16:1-16:15 - [c101]Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. WG 2020: 274-285 - [i32]Pratibha Choudhary, Venkatesh Raman:
Improved Kernels for Tracking Path Problems. CoRR abs/2001.03161 (2020) - [i31]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR abs/2001.08977 (2020) - [i30]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. CoRR abs/2002.09972 (2020) - [i29]Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. CoRR abs/2007.06060 (2020) - [i28]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. CoRR abs/2008.04416 (2020) - [i27]Pratibha Choudhary, Venkatesh Raman:
Structural Parameterizations of Tracking Paths Problem. CoRR abs/2008.09806 (2020)
2010 – 2019
- 2019
- [j72]Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - [j71]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772: 132-142 (2019) - [j70]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of König edge deletion problems. Theor. Comput. Sci. 796: 207-215 (2019) - [c100]Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Fully Dynamic Arboricity Maintenance. COCOON 2019: 1-12 - [c99]Ashwin Jacob, Venkatesh Raman, Vibha Sahlot:
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. COCOON 2019: 325-337 - [c98]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. CSR 2019: 191-202 - [c97]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh:
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c96]Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA 2019: 61-69 - [c95]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Solving Group Interval Scheduling Efficiently. IWOCA 2019: 97-107 - 2018
- [j69]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80(8): 2221-2239 (2018) - [j68]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80(9): 2616-2636 (2018) - [j67]Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Algorithmica 80(9): 2683-2724 (2018) - [j66]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz:
Vertex Cover Reconfiguration and Beyond. Algorithms 11(2): 20 (2018) - [j65]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62(8): 1690-1714 (2018) - [j64]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62(8): 1736-1762 (2018) - [j63]Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. 62(8): 1910-1951 (2018) - [j62]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14(2): 11:1-11:18 (2018) - [c94]Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti:
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. CSR 2018: 29-40 - [c93]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Dominating Set Variants. CSR 2018: 157-168 - [c92]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. ESA 2018: 13:1-13:16 - [c91]Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW 2018: 126-139 - [c90]Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 2018: 94-107 - [i26]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of Konig Edge Deletion Problems. CoRR abs/1811.04560 (2018) - 2017
- [j61]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. Algorithmica 78(1): 274-297 (2017) - [j60]Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - [j59]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90: 63-79 (2017) - [j58]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. SIAM J. Discret. Math. 31(3): 2185-2200 (2017) - [j57]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Finding modes with equality comparisons. Theor. Comput. Sci. 704: 28-41 (2017) - [c89]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman:
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. CALDAM 2017: 50-59 - [c88]Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman:
Elusiveness of Finding Degrees. CALDAM 2017: 242-253 - [c87]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale:
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM 2017: 281-293 - [c86]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW 2017: 22-33 - [c85]Diptapriyo Majumdar, Venkatesh Raman:
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. FAW 2017: 209-220 - [c84]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - [i25]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR abs/1711.07872 (2017) - [i24]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for Designing In-place Graph Algorithms. CoRR abs/1711.09859 (2017) - 2016
- [j56]Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36: 63-75 (2016) - [c83]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman:
Improved Space Efficient Algorithms for BFS, DFS and Applications. COCOON 2016: 119-130 - [c82]Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14 - [c81]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC 2016: 22:1-22:13 - [c80]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS 2016: 75:1-75:13 - [c79]Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding Mode Using Equality Comparisons. WALCOM 2016: 351-360 - [c78]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG 2016: 245-256 - [i23]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman:
Improved Space efficient algorithms for BFS, DFS and applications. CoRR abs/1606.04718 (2016) - [i22]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR abs/1606.08645 (2016) - 2015
- [j55]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583: 51-56 (2015) - [c77]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh:
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON 2015: 349-360 - [c76]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) 2015: 985-996 - [c75]Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC 2015: 331-342 - [c74]Jia Hui (Jimmy) Liang, Vijay Ganesh, Krzysztof Czarnecki, Venkatesh Raman:
SAT-based analysis of large real-world feature models is easy. SPLC 2015: 91-100 - [c73]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti:
Sorting and Selection with Equality Comparisons. WADS 2015: 434-445 - [i21]Jia Hui (Jimmy) Liang, Vijay Ganesh, Venkatesh Raman, Krzysztof Czarnecki:
SAT-based Analysis of Large Real-world Feature Models is Easy. CoRR abs/1506.05198 (2015) - [i20]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR abs/1512.04200 (2015) - 2014
- [j54]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68(2): 504-530 (2014) - [j53]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68(3): 739-757 (2014) - [j52]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11(2): 15:1-15:31 (2014) - [j51]Sriganesh Srihari, Venkatesh Raman, Hon Wai Leong, Mark A. Ragan:
Evolution and Controllability of CancerNetworks: A Boolean Perspective. IEEE ACM Trans. Comput. Biol. Bioinform. 11(1): 83-94 (2014) - [j50]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557: 120-127 (2014) - [j49]Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman:
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. ACM Trans. Comput. Theory 7(1): 4:1-4:18 (2014) - [c72]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA 2014: 430-442 - [c71]Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. ESA 2014: 630-641 - [c70]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. ISAAC 2014: 452-463 - [c69]Hicham El-Zein, J. Ian Munro, Venkatesh Raman:
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC 2014: 543-552 - [c68]Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA 2014: 176-187 - [c67]Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC 2014: 110-121 - [c66]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over Tree Decompositions. IPEC 2014: 246-257 - [c65]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. SODA 2014: 995-1004 - [e4]Venkatesh Raman, S. P. Suresh:
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India. LIPIcs 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-77-4 [contents] - [i19]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. CoRR abs/1402.4926 (2014) - [i18]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR abs/1404.3801 (2014) - [i17]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over tree decompositions. CoRR abs/1405.2447 (2014) - 2013
- [j48]Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - [j47]Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Algorithmica 65(4): 711-712 (2013) - [j46]Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. 231: 109-116 (2013) - [j45]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233: 60-70 (2013) - [j44]Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. 17(6): 615-628 (2013) - [j43]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. 53(4): 609-620 (2013) - [j42]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. 506: 115-121 (2013) - [j41]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. 511: 77-84 (2013) - [c64]Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao:
A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms 2013: 303-318 - [c63]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less Space: Indexing for Queries with Wildcards. ISAAC 2013: 89-99 - [c62]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC 2013: 405-412 - [c61]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct Data Structures for Representing Equivalence Classes. ISAAC 2013: 502-512 - [c60]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. IPEC 2013: 281-294 - [c59]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. SAT 2013: 394-402 - [c58]Venkatesh Raman, Bal Sri Shankar:
Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem. WALCOM 2013: 265-273 - [c57]Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT Algorithm for Tree Deletion Set. WALCOM 2013: 286-297 - [c56]Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG 2013: 370-381 - [e3]Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola:
Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Lecture Notes in Computer Science 8066, Springer 2013, ISBN 978-3-642-40272-2 [contents] - [i16]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. CoRR abs/1304.5518 (2013) - [i15]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct data structures for representing equivalence classes. CoRR abs/1306.4287 (2013) - [i14]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. CoRR abs/1308.2409 (2013) - 2012
- [j40]Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. Algorithmica 64(1): 1-2 (2012) - [j39]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24(2): 131-146 (2012) - [j38]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao:
Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012) - [j37]Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. 26(4): 1758-1780 (2012) - [j36]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms 9(1): 11:1-11:23 (2012) - [j35]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012) - [j34]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. 461: 65-75 (2012) - [c55]Venkatesh Raman:
Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows. The Multivariate Algorithmic Revolution and Beyond 2012: 69-73 - [c54]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 - [c53]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368 - [c52]N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
LP can be a cure for Parameterized Problems. STACS 2012: 338-349 - [c51]Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman:
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT 2012: 364-375 - [c50]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms for Even Cycle Transversal. WG 2012: 172-183 - [i13]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms using Linear Programming. CoRR abs/1203.0833 (2012) - [i12]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-parameter tractability of satisfying beyond the number of variables. CoRR abs/1212.0106 (2012) - 2011
- [j33]Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian:
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. Algorithmica 61(4): 857-881 (2011) - [j32]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the directed Full Degree Spanning Tree problem. Discret. Optim. 8(1): 97-109 (2011) - [j31]Neeldhara Misra, Venkatesh Raman, Saket Saurabh:
Lower bounds on kernelization. Discret. Optim. 8(1): 110-128 (2011) - [j30]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16): 814-818 (2011) - [c49]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. COCOON 2011: 98-109 - [c48]Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Paths, Flowers and Vertex Cover. ESA 2011: 382-393 - [c47]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC 2011: 333-343 - [c46]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. SODA 2011: 748-759 - [i11]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations and Functions. CoRR abs/1108.1983 (2011) - [i10]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat Above Average. CoRR abs/1108.4501 (2011) - 2010
- [c45]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010: 65-70 - [c44]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS 2010: 96-107 - [c43]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving minones-2-sat as Fast as vertex cover. MFCS 2010: 549-555 - [c42]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262 - [c41]Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT 2010: 334-345 - [c40]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. WALCOM 2010: 269-280 - [c39]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. WG 2010: 196-207 - [e2]Venkatesh Raman, Saket Saurabh:
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6478, Springer 2010, ISBN 978-3-642-17492-6 [contents] - [i9]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. CoRR abs/1001.0821 (2010) - [i8]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. CoRR abs/1005.5449 (2010) - [i7]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. CoRR abs/1009.0806 (2010)
2000 – 2009
- 2009
- [j29]Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009) - [c38]Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321 - [c37]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA 2009: 694-705 - [c36]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential Algorithms for Partial Cover Problems. FSTTCS 2009: 193-201 - [c35]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the Directed Degree-Preserving Spanning Tree Problem. IWPEC 2009: 276-287 - [i6]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs. CoRR abs/0903.4521 (2009) - [i5]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. CoRR abs/0909.3180 (2009) - [i4]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh:
Faster Algorithms for Finding and Counting Subgraphs. CoRR abs/0912.2371 (2009) - 2008
- [j28]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) - [c34]Venkatesh Raman, Saket Saurabh, Sriganesh Srihari:
Parameterized Algorithms for Generalized Domination. COCOA 2008: 116-126 - [c33]Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847 - 2007
- [j27]Venkatesh Raman, Saket Saurabh:
Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2): 65-72 (2007) - [j26]Venkatesh Raman, Somnath Sikdar:
Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. 104(3): 79-85 (2007) - [j25]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) - [j24]Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4): 43 (2007) - [c32]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 - [c31]Hannes Moser, Venkatesh Raman, Somnath Sikdar:
The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631 - [i3]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) - 2006
- [j23]Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar:
Approximate Block Sorting. Int. J. Found. Comput. Sci. 17(2): 337-356 (2006) - [j22]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2(3): 403-415 (2006) - [j21]Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2(4): 510-534 (2006) - [j20]Venkatesh Raman, Saket Saurabh:
Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3): 446-458 (2006) - [j19]Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3): 231-246 (2006) - [c30]Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. FSTTCS 2006: 139-151 - [c29]Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC 2006: 38-49 - [c28]Venkatesh Raman, Saket Saurabh:
Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT 2006: 304-315 - 2005
- [j18]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) - [j17]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster algorithms for feedback vertex set. Electron. Notes Discret. Math. 19: 273-279 (2005) - [c27]Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389 - 2004
- [c26]Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses. CPM 2004: 159-172 - [c25]Venkatesh Raman, Saket Saurabh:
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC 2004: 260-270 - [c24]Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. SODA 2004: 1-10 - 2003
- [j16]R. Balasubramanian, Venkatesh Raman, V. Yegnanarayanan:
On the pseudoachromatic number of join of graphs. Int. J. Comput. Math. 80(9): 1131-1137 (2003) - [c23]Meena Mahajan, Raghavan Rama, Venkatesh Raman, Vijayakumar Sundarrajan:
Merging and Sorting By Strip Moves. FSTTCS 2003: 314-325 - [c22]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations. ICALP 2003: 345-356 - [c21]Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS 2003: 484-492 - 2002
- [j15]Subhash Khot, Venkatesh Raman:
Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2): 997-1008 (2002) - [c20]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248 - [c19]Vikraman Arvind, Venkatesh Raman:
Approximation Algorithms for Some Parameterized Counting Problems. ISAAC 2002: 453-464 - [c18]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002: 233-242 - [i2]Vikraman Arvind, Venkatesh Raman:
Approximate Counting small subgraphs of bounded treewidth and related problems. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j14]Jaikumar Radhakrishnan, Venkatesh Raman:
A tradeoff between search and update in dictionaries. Inf. Process. Lett. 80(5): 243-247 (2001) - [j13]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001) - [j12]J. Ian Munro, Venkatesh Raman:
Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. 31(3): 762-776 (2001) - [c17]Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao:
Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA 2001: 290-299 - [c16]J. Ian Munro, Venkatesh Raman, Adam J. Storm:
Representing dynamic binary trees succinctly. SODA 2001: 529-536 - [c15]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Dynamic Data Structures. WADS 2001: 426-437 - 2000
- [j11]Rodney G. Downey, Michael R. Fellows, Venkatesh Raman:
The complexity of irredundant sets parameterized by size. Discret. Appl. Math. 100(3): 155-167 (2000) - [c14]Subhash Khot, Venkatesh Raman:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties. COCOON 2000: 137-147
1990 – 1999
- 1999
- [j10]Sarnath Ramnath, Venkatesh Raman:
Selecting Small Ranks in EREW PRAM. Inf. Process. Lett. 71(5-6): 183-186 (1999) - [j9]Meena Mahajan, Venkatesh Raman:
Parameterizing above Guaranteed Values: MaxSat and MaxCut. J. Algorithms 31(2): 335-354 (1999) - [j8]Venkatesh Raman, Sarnath Ramnath:
Improved Upper Bounds for Time-Space Trade-offs for Selection. Nord. J. Comput. 6(2): 162-180 (1999) - [c13]Venkatesh Raman, S. Srinivasa Rao:
Static Dictionaries Supporting Rank. ISAAC 1999: 18-26 - [c12]Nikhil Bansal, Venkatesh Raman:
Upper Bounds for MaxSat: Further Improved. ISAAC 1999: 247-258 - [c11]David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman:
Representing Trees of Higer Degree. WADS 1999: 169-180 - [e1]C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam:
Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings. Lecture Notes in Computer Science 1738, Springer 1999, ISBN 3-540-66836-5 [contents] - 1998
- [j7]Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao:
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998) - [j6]R. Balasubramanian, Michael R. Fellows, Venkatesh Raman:
An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998) - [c10]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Space Efficient Suffix Trees. FSTTCS 1998: 186-196 - [c9]Venkatesh Raman, Sarnath Ramnath:
Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. SWAT 1998: 131-142 - 1997
- [j5]R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan:
Finding Scores in Tournaments. J. Algorithms 24(2): 380-394 (1997) - [c8]J. Ian Munro, Venkatesh Raman:
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. FOCS 1997: 118-126 - [i1]Meena Mahajan, Venkatesh Raman:
Parametrizing Above Guaranteed Values: MaxSat and MaxCut. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j4]J. Ian Munro, Venkatesh Raman:
Fast Stable In-Place Sorting with O (n) Data Moves. Algorithmica 16(2): 151-160 (1996) - [j3]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
- [c7]R. Balasubramanian, Venkatesh Raman:
Path Balance Heuristic for Self-Adjusting Binary Search Trees. FSTTCS 1995: 338-348 - [c6]R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
Tight Bounds for Finding Degrees from the Adjacency Matrix. LATIN 1995: 49-59 - 1993
- [c5]R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
The Complexity of Finding Certain Trees in Tournaments. WADS 1993: 142-150 - 1992
- [j2]J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement. J. Algorithms 13(3): 374-393 (1992) - [c4]J. Ian Munro, Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Optimum Data Movement. FSTTCS 1992: 380-391 - 1991
- [c3]J. Ian Munro, Venkatesh Raman:
Fast Sorting In-Place Sorting with O(n) Data. FSTTCS 1991: 266-277 - [c2]J. Ian Munro, Venkatesh Raman:
Sorting Multisets and Vectors In-Place. WADS 1991: 473-480 - 1990
- [j1]J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990)
1980 – 1989
- 1989
- [c1]J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement (Preliminary Draft). WADS 1989: 552-562
Coauthor Index
S. Srinivasa Rao 0001
aka: Srinivasa Rao Satti
aka: Srinivasa Rao Satti
[c111] [j83] [i33] [j80] [j79] [j77] [j74] [j73] [c106] [c102] [i31] [i28] [j72] [c100] [c97] [c95] [j63] [c90] [c84] [c80] [c77] [c75] [i20] [j54] [j53] [j52] [j48] [j47] [j46] [j45] [j44] [j43] [j41] [c57] [c56] [j40] [j39] [j38] [j37] [j34] [c54] [c53] [c52] [c50] [i13] [i12] [j33] [j32] [j31] [j30] [c49] [c48] [c47] [c46] [i10] [c45] [c44] [c42] [c41] [c40] [e2] [i9] [i8] [c38] [c36] [c35] [i5] [i4] [j28] [c34] [c33] [j27] [j25] [c32] [j22] [j20] [c30] [c28] [j17] [c27] [c25] [c21] [c20]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-05 21:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
