Venkatesh Raman

253 papers A* 9A 10B 50C 4Misc 15Journal 136Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs. AAAI Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman, Diya Roy, Abhishek Sahu
2025	J	`jnl`	Dominator coloring and CD coloring in almost cluster graphs. J. Comput. Syst. Sci. Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
2025	J	`jnl`	Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs. CoRR Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman, Diya Roy, Abhishek Sahu
2025	J	`jnl`	Parameterized complexity of dominating set variants in almost cluster and split graphs. J. Comput. Syst. Sci. Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2024	J	`jnl`	Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2023	J	`jnl`	Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2023	J	`jnl`	Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023	B	`conf`	Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
2023	J	`jnl`	Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023	J	`jnl`	Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023	J	`jnl`	Improved kernels for tracking paths. Inf. Process. Lett. Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman
2023	J	`jnl`	Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2022	J	`jnl`	Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2022	J	`jnl`	Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
2022	J	`jnl`	Finding kings in tournaments. Discret. Appl. Math. Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
2022	J	`jnl`	Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
2022	Misc	`conf`	Output Sensitive Fault Tolerant Maximum Matching. CSR Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
2022	B	`conf`	Structural Parameterizations of Budgeted Graph Coloring. WALCOM Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2022	J	`jnl`	Structural Parameterizations with Modulator Oblivion. Algorithmica Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2022	J	`jnl`	Structural parameterizations of Tracking Paths problem. Theor. Comput. Sci. Pratibha Choudhary, Venkatesh Raman
2022	J	`jnl`	Welcome back! Commun. ACM Hemangee Kalpesh Kapoor, Mausam, Venkatesh Raman
2021	J	`jnl`	Approximation in (Poly-) Logarithmic Space. Algorithmica Arindam Biswas, Venkatesh Raman, Saket Saurabh
2021	J	`jnl`	Deletion to Scattered Graph Classes I -- case of finite number of graph classes. CoRR Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2021	B	`conf`	Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2021	J	`jnl`	Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2021	B	`conf`	Parameterizing Role Coloring on Forests. SOFSEM Sukanya Pandey, Venkatesh Raman, Vibha Sahlot
2021	J	`jnl`	Recognizing k-Clique Extendible Orderings. Algorithmica Mathew C. Francis, Rian Neogi, Venkatesh Raman
2021	J	`jnl`	Space-Efficient FPT Algorithms. CoRR Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh
2021	J	`jnl`	Structural Parameterizations of Budgeted Graph Coloring. CoRR Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2021	Misc	`conf`	Sublinear-Space Approximation Algorithms for Max r-SAT. COCOON Arindam Biswas, Venkatesh Raman
2021	J	`jnl`	Sublinear-Space Approximation Algorithms for Max r-SAT. CoRR Arindam Biswas, Venkatesh Raman
2020	J	`jnl`	A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2020	B	`conf`	Approximation in (Poly-) Logarithmic Space. MFCS Arindam Biswas, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Approximation in (Poly-) Logarithmic Space. CoRR Arindam Biswas, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Elusiveness of finding degrees. Discret. Appl. Math. Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman
2020	J	`jnl`	Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
2020	J	`jnl`	Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Fully dynamic arboricity maintenance. Theor. Comput. Sci. Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Improved Kernels for Tracking Path Problems. CoRR Pratibha Choudhary, Venkatesh Raman
2020	J	`jnl`	List-coloring - Parameterizing from triviality. Theor. Comput. Sci. Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
2020	—	`conf`	Optimal Output Sensitive Fault Tolerant Cuts. FSTTCS Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2020	B	`conf`	Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2020	J	`jnl`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2020	B	`conf`	Recognizing k-Clique Extendible Orderings. WG Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020	J	`jnl`	Recognizing k-Clique Extendible Orderings. CoRR Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020	—	`conf`	Structural Parameterizations of Tracking Paths Problem. ICTCS Pratibha Choudhary, Venkatesh Raman
2020	J	`jnl`	Structural Parameterizations of Tracking Paths Problem. CoRR Pratibha Choudhary, Venkatesh Raman
2020	B	`conf`	Structural Parameterizations with Modulator Oblivion. IPEC Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020	J	`jnl`	Structural Parameterizations with Modulator Oblivion. CoRR Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2019	Misc	`conf`	Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. COCOON Ashwin Jacob, Venkatesh Raman, Vibha Sahlot
2019	C	`conf`	Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
2019	Misc	`conf`	Fully Dynamic Arboricity Maintenance. COCOON Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2019	J	`jnl`	Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2019	J	`jnl`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2019	Misc	`conf`	Parameterized Complexity of Conflict-Free Set Cover. CSR Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2019	—	`conf`	Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019	C	`conf`	Solving Group Interval Scheduling Efficiently. IWOCA Arindam Biswas, Venkatesh Raman, Saket Saurabh
2019	J	`jnl`	Tractability of König edge deletion problems. Theor. Comput. Sci. Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2018	A	`conf`	A Framework for In-place Graph Algorithms. ESA Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
2018	B	`conf`	A Polynomial Sized Kernel for Tracking Paths Problem. LATIN Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2018	J	`jnl`	Approximability of Clique Transversal in Perfect Graphs. Algorithmica Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2018	J	`jnl`	Fréchet Distance Between a Line and Avatar Point Set. Algorithmica Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2018	Misc	`conf`	Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. CSR Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti
2018	J	`jnl`	Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
2018	J	`jnl`	Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2018	J	`jnl`	Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2018	Misc	`conf`	Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
2018	J	`jnl`	Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
2018	Misc	`conf`	Structural Parameterizations of Dominating Set Variants. CSR Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2018	J	`jnl`	Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. Algorithmica Diptapriyo Majumdar, Venkatesh Raman
2018	J	`jnl`	Tractability of Konig Edge Deletion Problems. CoRR Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2018	J	`jnl`	Vertex Cover Reconfiguration and Beyond. Algorithms Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
2017	J	`jnl`	Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
2017	—	`conf`	Elusiveness of Finding Degrees. CALDAM Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman
2017	—	`conf`	Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
2017	Misc	`conf`	FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. FAW Diptapriyo Majumdar, Venkatesh Raman
2017	J	`jnl`	Finding modes with equality comparisons. Theor. Comput. Sci. Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
2017	J	`jnl`	Frameworks for Designing In-place Graph Algorithms. CoRR Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
2017	—	`conf`	Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. CALDAM Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman
2017	J	`jnl`	On the Parameterized Complexity of Reconfiguration Problems. Algorithmica Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2017	J	`jnl`	On the Succinct Representation of Equivalence Classes. Algorithmica Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
2017	B	`conf`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2017	J	`jnl`	Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2017	J	`jnl`	Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. SIAM J. Discret. Math. Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
2017	Misc	`conf`	The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
2016	B	`conf`	Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
2016	J	`jnl`	Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
2016	B	`conf`	Finding Mode Using Equality Comparisons. WALCOM Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
2016	—	`conf`	Fréchet Distance Between a Line and Avatar Point Set. FSTTCS Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2016	B	`conf`	Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2016	Misc	`conf`	Improved Space Efficient Algorithms for BFS, DFS and Applications. COCOON Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
2016	J	`jnl`	Improved Space efficient algorithms for BFS, DFS and applications. CoRR Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
2016	B	`conf`	Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2016	J	`jnl`	Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2015	J	`jnl`	Finding median in read-only memory on integer input. Theor. Comput. Sci. Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2015	B	`conf`	Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
2015	J	`jnl`	Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2015	J	`jnl`	SAT-based Analysis of Large Real-world Feature Models is Easy. CoRR Jia Hui (Jimmy) Liang, Vijay Ganesh, Venkatesh Raman, Krzysztof Czarnecki
2015	B	`conf`	SAT-based analysis of large real-world feature models is easy. SPLC Jia Hui (Jimmy) Liang, Vijay Ganesh, Krzysztof Czarnecki, Venkatesh Raman
2015	—	`conf`	Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
2015	B	`conf`	Sorting and Selection with Equality Comparisons. WADS Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
2015	Misc	`conf`	Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh
2014	—	`ed.`	34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, New Delhi, India, December 15-17, 2014 FSTTCS Venkatesh Raman, S. P. Suresh
2014	J	`jnl`	Evolution and Controllability of CancerNetworks: A Boolean Perspective. IEEE ACM Trans. Comput. Biol. Bioinform. Sriganesh Srihari, Venkatesh Raman, Hon Wai Leong, Mark A. Ragan
2014	J	`jnl`	Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2014	J	`jnl`	Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2014	A	`conf`	Improved Explicit Data Structures in the Bitprobe Model. ESA Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman
2014	J	`jnl`	Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. ACM Trans. Comput. Theory Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
2014	A	`conf`	LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2014	J	`jnl`	Less space: Indexing for queries with wildcards. Theor. Comput. Sci. Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
2014	B	`conf`	Reconfiguration over Tree Decompositions. IPEC Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
2014	J	`jnl`	Reconfiguration over tree decompositions. CoRR Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
2014	A*	`conf`	Selection and Sorting in the "Restore" Model. SODA Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2014	J	`jnl`	Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
2014	C	`conf`	Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti
2014	B	`conf`	The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
2014	J	`jnl`	The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2014	B	`conf`	Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC Hicham El-Zein, J. Ian Munro, Venkatesh Raman
2014	B	`conf`	Vertex Cover Reconfiguration and Beyond. ISAAC Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
2014	J	`jnl`	Vertex Cover Reconfiguration and Beyond. CoRR Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
2013	J	`jnl`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2013	—	`conf`	A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao
2013	B	`conf`	An FPT Algorithm for Tree Deletion Set. WALCOM Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	B	`conf`	Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Algorithmica Venkatesh Raman, Saket Saurabh
2013	B	`conf`	Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem. WALCOM Venkatesh Raman, Bal Sri Shankar
2013	B	`conf`	Less Space: Indexing for Queries with Wildcards. ISAAC Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
2013	B	`conf`	On the Parameterized Complexity of Reconfiguration Problems. IPEC Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2013	J	`jnl`	On the Parameterized Complexity of Reconfiguration Problems. CoRR Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2013	B	`conf`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2013	—	`ed.`	Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday Space-Efficient Data Structures, Streams, and Algorithms Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola
2013	B	`conf`	Succinct Data Structures for Representing Equivalence Classes. ISAAC Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	Succinct data structures for representing equivalence classes. CoRR Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2013	J	`jnl`	Upper and Lower Bounds for Weak Backdoor Set Detection CoRR Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2013	A	`conf`	Upper and Lower Bounds for Weak Backdoor Set Detection. SAT Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2012	J	`jnl`	FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2012	J	`jnl`	Faster Parameterized Algorithms using Linear Programming CoRR Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
2012	A	`conf`	Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Fixed-parameter tractability of satisfying beyond the number of variables CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. Algorithmica Venkatesh Raman, Saket Saurabh
2012	—	`conf`	Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
2012	A	`conf`	LP can be a cure for Parameterized Problems. STACS N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. Sushmita Gupta, Venkatesh Raman, Saket Saurabh
2012	J	`jnl`	On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2012	B	`conf`	Parameterized Algorithms for Even Cycle Transversal. WG Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	B	`conf`	Parameterized Complexity of MaxSat above Average. LATIN Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2012	J	`jnl`	Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2012	J	`jnl`	Succinct representations of permutations and functions. Theor. Comput. Sci. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2012	—	`conf`	Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows. The Multivariate Algorithmic Revolution and Beyond Venkatesh Raman
2011	B	`conf`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011	A*	`conf`	Bidimensionality and EPTAS. SODA Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Lower bounds on kernelization. Discret. Optim. Neeldhara Misra, Venkatesh Raman, Saket Saurabh
2011	Misc	`conf`	On Parameterized Independent Feedback Vertex Set. COCOON Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	On the directed Full Degree Spanning Tree problem. Discret. Optim. Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2011	J	`jnl`	Parameterized Complexity of MaxSat Above Average CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2011	A	`conf`	Paths, Flowers and Vertex Cover. ESA Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011	J	`jnl`	Subexponential algorithms for partial cover problems. Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Succinct Representations of Permutations and Functions CoRR J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2011	J	`jnl`	The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. Algorithmica Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2010	J	`jnl`	A Quartic Kernel for Pathwidth-One Vertex Deletion CoRR Geevarghese Philip, Venkatesh Raman, Yngve Villanger
2010	B	`conf`	A Quartic Kernel for Pathwidth-One Vertex Deletion. WG Geevarghese Philip, Venkatesh Raman, Yngve Villanger
2010	J	`jnl`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A	`conf`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Bidimensionality and EPTAS CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	B	`conf`	FPT Algorithms for Connected Feedback Vertex Set. WALCOM Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2010	A*	`conf`	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	—	`conf`	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	B	`ed.`	Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings IPEC Venkatesh Raman, Saket Saurabh
2010	B	`conf`	Solving minones-2-sat as Fast as vertex cover. MFCS Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2010	—	`conf`	The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2009	J	`jnl`	FPT Algorithms for Connected Feedback Vertex Set CoRR Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	J	`jnl`	Faster Algorithms for Finding and Counting Subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh
2009	—	`conf`	On the Directed Degree-Preserving Spanning Tree Problem. IWPEC Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	J	`jnl`	Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. Meena Mahajan, Venkatesh Raman, Somnath Sikdar
2009	J	`jnl`	Polynomial Kernels for Dominating Set in K CoRR Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2009	A	`conf`	Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2009	—	`conf`	Subexponential Algorithms for Partial Cover Problems. FSTTCS Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2009	Misc	`conf`	The Budgeted Unique Coverage Problem and Color-Coding. CSR Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2008	B	`conf`	König Deletion Sets and Vertex Covers above the Matching Size. ISAAC Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2008	C	`conf`	Parameterized Algorithms for Generalized Domination. COCOA Venkatesh Raman, Saket Saurabh, Sriganesh Srihari
2008	J	`jnl`	Short Cycles Make Algorithmica Venkatesh Raman, Saket Saurabh
2007	J	`jnl`	Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2007	J	`jnl`	Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. Venkatesh Raman, Saket Saurabh
2007	J	`jnl`	Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. Venkatesh Raman, Somnath Sikdar
2007	J	`jnl`	Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets CoRR Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2007	J	`jnl`	Succinct indexable dictionaries with applications to encoding ACM Trans. Algorithms Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2007	B	`conf`	The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2007	B	`conf`	The Parameterized Complexity of the Unique Coverage Problem. ISAAC Hannes Moser, Venkatesh Raman, Somnath Sikdar
2006	J	`jnl`	A simple optimal representation for balanced parentheses. Theor. Comput. Sci. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
2006	J	`jnl`	Approximate Block Sorting. Int. J. Found. Comput. Sci. Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijaykumar
2006	—	`conf`	Fast Exponential Algorithms for Maximum FSTTCS Sushmita Gupta, Venkatesh Raman, Saket Saurabh
2006	J	`jnl`	Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2006	J	`jnl`	Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. Venkatesh Raman, Saket Saurabh
2006	—	`conf`	Parameterizing MAX SNP Problems Above Guaranteed Values. IWPEC Meena Mahajan, Venkatesh Raman, Somnath Sikdar
2006	J	`jnl`	Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms Richard F. Geary, Rajeev Raman, Venkatesh Raman
2006	—	`conf`	Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT Venkatesh Raman, Saket Saurabh
2005	J	`jnl`	Faster algorithms for feedback vertex set. Electron. Notes Discret. Math. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2005	—	`conf`	Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2005	J	`jnl`	Representing Trees of Higher Degree. Algorithmica David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2004	B	`conf`	A Simple Optimal Representation for Balanced Parentheses. CPM Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
2004	—	`conf`	Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC Venkatesh Raman, Saket Saurabh
2004	A*	`conf`	Succinct ordinal trees with level-ancestor queries. SODA Richard F. Geary, Rajeev Raman, Venkatesh Raman
2003	—	`conf`	Merging and Sorting By Strip Moves. FSTTCS Meena Mahajan, Raghavan Rama, Venkatesh Raman, Vijayakumar Sundarrajan
2003	J	`jnl`	On the pseudoachromatic number of join of graphs. Int. J. Comput. Math. R. Balasubramanian, Venkatesh Raman, Venkataraman Yegnanarayanan
2003	B	`conf`	Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS Venkatesh Raman, Saket Saurabh
2003	A*	`conf`	Succinct Representations of Permutations. ICALP J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2002	J	`jnl`	Approximate Counting small subgraphs of bounded treewidth and related problems Electron. Colloquium Comput. Complex. Vikraman Arvind, Venkatesh Raman
2002	B	`conf`	Approximation Algorithms for Some Parameterized Counting Problems. ISAAC Vikraman Arvind, Venkatesh Raman
2002	B	`conf`	Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2002	J	`jnl`	Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. Subhash Khot, Venkatesh Raman
2002	A*	`conf`	Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2001	J	`jnl`	A tradeoff between search and update in dictionaries. Inf. Process. Lett. Jaikumar Radhakrishnan, Venkatesh Raman
2001	A	`conf`	Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
2001	A*	`conf`	Representing dynamic binary trees succinctly. SODA J. Ian Munro, Venkatesh Raman, Adam J. Storm
2001	J	`jnl`	Space Efficient Suffix Trees. J. Algorithms J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
2001	B	`conf`	Succinct Dynamic Data Structures. WADS Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2001	J	`jnl`	Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. J. Ian Munro, Venkatesh Raman
2000	Misc	`conf`	Parameterized Complexity of Finding Subgraphs with Hereditary Properties. COCOON Subhash Khot, Venkatesh Raman
2000	J	`jnl`	The complexity of irredundant sets parameterized by size. Discret. Appl. Math. Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
1999	—	`ed.`	Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings FSTTCS C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam
1999	J	`jnl`	Improved Upper Bounds for Time-Space Trade-offs for Selection. Nord. J. Comput. Venkatesh Raman, Sarnath Ramnath
1999	J	`jnl`	Parameterizing above Guaranteed Values: MaxSat and MaxCut. J. Algorithms Meena Mahajan, Venkatesh Raman
1999	B	`conf`	Representing Trees of Higer Degree. WADS David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
1999	J	`jnl`	Selecting Small Ranks in EREW PRAM. Inf. Process. Lett. Sarnath Ramnath, Venkatesh Raman
1999	B	`conf`	Static Dictionaries Supporting Rank. ISAAC Venkatesh Raman, S. Srinivasa Rao
1999	B	`conf`	Upper Bounds for MaxSat: Further Improved. ISAAC Nikhil Bansal, Venkatesh Raman
1998	J	`jnl`	A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
1998	J	`jnl`	An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. R. Balasubramanian, Michael R. Fellows, Venkatesh Raman
1998	—	`conf`	Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. SWAT Venkatesh Raman, Sarnath Ramnath
1998	—	`conf`	Space Efficient Suffix Trees. FSTTCS J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
1997	J	`jnl`	Finding Scores in Tournaments. J. Algorithms R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan
1997	J	`jnl`	Parametrizing Above Guaranteed Values: MaxSat and MaxCut Electron. Colloquium Comput. Complex. Meena Mahajan, Venkatesh Raman
1997	A*	`conf`	Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. FOCS J. Ian Munro, Venkatesh Raman
1996	J	`jnl`	Fast Stable In-Place Sorting with Algorithmica J. Ian Munro, Venkatesh Raman
1996	J	`jnl`	Selection from Read-Only Memory and Sorting with Minimum Data Movement. Theor. Comput. Sci. J. Ian Munro, Venkatesh Raman
1995	—	`conf`	Path Balance Heuristic for Self-Adjusting Binary Search Trees. FSTTCS R. Balasubramanian, Venkatesh Raman
1995	B	`conf`	Tight Bounds for Finding Degrees from the Adjacency Matrix. LATIN R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
1993	B	`conf`	The Complexity of Finding Certain Trees in Tournaments. WADS R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
1992	—	`conf`	Selection from Read-Only Memory and Sorting with Optimum Data Movement. FSTTCS J. Ian Munro, Venkatesh Raman
1992	J	`jnl`	Sorting with Minimum Data Movement. J. Algorithms J. Ian Munro, Venkatesh Raman
1991	—	`conf`	Fast Sorting In-Place Sorting with O(n) Data. FSTTCS J. Ian Munro, Venkatesh Raman
1991	B	`conf`	Sorting Multisets and Vectors In-Place. WADS J. Ian Munro, Venkatesh Raman
1990	J	`jnl`	Stable in Situ Sorting and Minimum Data Movement. BIT J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
1989	B	`conf`	Sorting with Minimum Data Movement (Preliminary Draft). WADS J. Ian Munro, Venkatesh Raman