Venkatesh Raman

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 92

Top Venues

Publications

Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR (2024)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR (2023)
Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS (2023)
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 (2023)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16 (3) (2023)
Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman
Improved kernels for tracking paths. Inf. Process. Lett. 181 (2023)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940 (Part) (2023)
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 (2023)
Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
Output Sensitive Fault Tolerant Maximum Matching. CSR (2022)
Hemangee Kalpesh Kapoor, Mausam, Venkatesh Raman
Welcome back! Commun. ACM 65 (11) (2022)
Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR (2022)
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
Finding kings in tournaments. Discret. Appl. Math. 322 (2022)
Pratibha Choudhary, Venkatesh Raman
Structural parameterizations of Tracking Paths problem. Theor. Comput. Sci. 934 (2022)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural Parameterizations of Budgeted Graph Coloring. WALCOM (2022)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123 (2022)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. Algorithmica 84 (8) (2022)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR (2022)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural Parameterizations of Budgeted Graph Coloring. CoRR (2021)
Arindam Biswas, Venkatesh Raman, Saket Saurabh
Approximation in (Poly-) Logarithmic Space. Algorithmica 83 (7) (2021)
Sukanya Pandey, Venkatesh Raman, Vibha Sahlot
Parameterizing Role Coloring on Forests. SOFSEM (2021)
Arindam Biswas, Venkatesh Raman
Sublinear-Space Approximation Algorithms for Max r-SAT. COCOON (2021)
Mathew C. Francis, Rian Neogi, Venkatesh Raman
Recognizing k-Clique Extendible Orderings. Algorithmica 83 (11) (2021)
Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh
Space-Efficient FPT Algorithms. CoRR (2021)
Arindam Biswas, Venkatesh Raman
Sublinear-Space Approximation Algorithms for Max r-SAT. CoRR (2021)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65 (3) (2021)
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes. CoRR (2021)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT (2021)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. IPEC (2020)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. CoRR (2020)
Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman
Elusiveness of finding degrees. Discret. Appl. Math. 286 (2020)
Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82 (1) (2020)
Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR (2020)
Mathew C. Francis, Rian Neogi, Venkatesh Raman
Recognizing k-Clique Extendible Orderings. WG (2020)
Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846 (2020)
Pratibha Choudhary, Venkatesh Raman
Improved Kernels for Tracking Path Problems. CoRR (2020)
Pratibha Choudhary, Venkatesh Raman
Structural Parameterizations of Tracking Paths Problem. CoRR (2020)
Arindam Biswas, Venkatesh Raman, Saket Saurabh
Approximation in (Poly-) Logarithmic Space. CoRR (2020)
Pratibha Choudhary, Venkatesh Raman
Structural Parameterizations of Tracking Paths Problem. ICTCS (2020)
Niranka Banerjee, Venkatesh Raman, Saket Saurabh
Fully dynamic arboricity maintenance. Theor. Comput. Sci. 822 (2020)
Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
List-coloring - Parameterizing from triviality. Theor. Comput. Sci. 821 (2020)
Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. 161 (2020)
Arindam Biswas, Venkatesh Raman, Saket Saurabh
Approximation in (Poly-) Logarithmic Space. MFCS (2020)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82 (1) (2020)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC (2020)
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64 (7) (2020)
Niranka Banerjee, Venkatesh Raman, Saket Saurabh
Optimal Output Sensitive Fault Tolerant Cuts. FSTTCS (2020)
Mathew C. Francis, Rian Neogi, Venkatesh Raman
Recognizing k-Clique Extendible Orderings. CoRR (2020)
Ashwin Jacob, Venkatesh Raman, Vibha Sahlot
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. COCOON (2019)
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)
Niranka Banerjee, Venkatesh Raman, Saket Saurabh
Fully Dynamic Arboricity Maintenance. COCOON (2019)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772 (2019)
Arindam Biswas, Venkatesh Raman, Saket Saurabh
Solving Group Interval Scheduling Efficiently. IWOCA (2019)
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81 (1) (2019)
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA (2019)
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Conflict-Free Set Cover. CSR (2019)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
Tractability of König edge deletion problems. Theor. Comput. Sci. 796 (2019)
Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN (2018)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62 (8) (2018)
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
Structural Parameterizations of Dominating Set Variants. CSR (2018)
Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. CSR (2018)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80 (9) (2018)
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80 (8) (2018)
Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW (2018)
Diptapriyo Majumdar, Venkatesh Raman
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Algorithmica 80 (9) (2018)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
A Framework for In-place Graph Algorithms. ESA (2018)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62 (8) (2018)
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. 62 (8) (2018)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
Vertex Cover Reconfiguration and Beyond. Algorithms 11 (2) (2018)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
Tractability of Konig Edge Deletion Problems. CoRR (2018)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14 (2) (2018)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
On the Parameterized Complexity of Reconfiguration Problems. Algorithmica 78 (1) (2017)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM (2017)
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW (2017)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS (2017)
Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Finding modes with equality comparisons. Theor. Comput. Sci. 704 (2017)
Diptapriyo Majumdar, Venkatesh Raman
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. FAW (2017)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR (2017)
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) (2017)
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. CALDAM (2017)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for Designing In-place Graph Algorithms. CoRR (2017)
Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman
Elusiveness of Finding Degrees. CALDAM (2017)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90 (2017)
Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
On the Succinct Representation of Equivalence Classes. Algorithmica 78 (3) (2017)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG (2016)
Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36 (2016)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR (2016)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS (2016)
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS (2016)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
Improved Space efficient algorithms for BFS, DFS and applications. CoRR (2016)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
Improved Space Efficient Algorithms for BFS, DFS and Applications. COCOON (2016)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC (2016)
Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
Finding Mode Using Equality Comparisons. WALCOM (2016)
Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
Sorting and Selection with Equality Comparisons. WADS (2015)
Jia Hui (Jimmy) Liang, Vijay Ganesh, Venkatesh Raman, Krzysztof Czarnecki
SAT-based Analysis of Large Real-world Feature Models is Easy. CoRR (2015)
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR (2015)
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) (2015)
Jia Hui (Jimmy) Liang, Vijay Ganesh, Krzysztof Czarnecki, Venkatesh Raman
SAT-based analysis of large real-world feature models is easy. SPLC (2015)
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)
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC (2015)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583 (2015)

Venkatesh Raman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Venkatesh Raman