Stop the war!Остановите войну!
for scientists:
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
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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]