Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao Finding kings in tournaments. (English) Zbl 1498.05111 Discrete Appl. Math. 322, 240-252 (2022). MSC: 05C20 05C69 05C85 68W40 68P10 PDFBibTeX XMLCite \textit{A. Biswas} et al., Discrete Appl. Math. 322, 240--252 (2022; Zbl 1498.05111) Full Text: DOI
Chakraborty, Sankardeep; Mukherjee, Anish; Raman, Venkatesh; Satti, Srinivasa Rao Frameworks for designing in-place graph algorithms. (English) Zbl 1485.68303 J. Comput. Syst. Sci. 123, 1-19 (2022). Reviewer: Ali Shakiba (Rafsanǧān) MSC: 68W05 05C85 68P05 68P10 68R10 68W40 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., J. Comput. Syst. Sci. 123, 1--19 (2022; Zbl 1485.68303) Full Text: DOI
Pandey, Sukanya; Raman, Venkatesh; Sahlot, Vibha Parameterizing role coloring on forests. (English) Zbl 1490.68163 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 308-321 (2021). MSC: 68R10 05C05 05C15 68Q27 68W40 PDFBibTeX XMLCite \textit{S. Pandey} et al., Lect. Notes Comput. Sci. 12607, 308--321 (2021; Zbl 1490.68163) Full Text: DOI
Francis, Mathew; Neogi, Rian; Raman, Venkatesh Recognizing \(k\)-clique extendible orderings. (English) Zbl 1522.68402 Algorithmica 83, No. 11, 3338-3362 (2021). MSC: 68R10 05C69 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{M. Francis} et al., Algorithmica 83, No. 11, 3338--3362 (2021; Zbl 1522.68402) Full Text: DOI arXiv
Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket Approximation in (poly-) logarithmic space. (English) Zbl 1515.68379 Algorithmica 83, No. 7, 2303-2331 (2021). MSC: 68W25 68R10 68W20 68W40 PDFBibTeX XMLCite \textit{A. Biswas} et al., Algorithmica 83, No. 7, 2303--2331 (2021; Zbl 1515.68379) Full Text: DOI arXiv Link
Jacob, Ashwin; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha Structural parameterizations with modulator oblivion. (English) Zbl 07764110 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 19, 18 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{A. Jacob} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 19, 18 p. (2020; Zbl 07764110) Full Text: DOI
Francis, Mathew; Neogi, Rian; Raman, Venkatesh Recognizing \(k\)-clique extendible orderings. (English) Zbl 1524.68229 Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 274-285 (2020). MSC: 68R10 05C69 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{M. Francis} et al., Lect. Notes Comput. Sci. 12301, 274--285 (2020; Zbl 1524.68229) Full Text: DOI
Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket Fully dynamic arboricity maintenance. (English) Zbl 1452.68130 Theor. Comput. Sci. 822, 1-14 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Theor. Comput. Sci. 822, 1--14 (2020; Zbl 1452.68130) Full Text: DOI
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket A polynomial sized kernel for tracking paths problem. (English) Zbl 1436.68142 Algorithmica 82, No. 1, 41-63 (2020). MSC: 68Q27 05C38 68Q17 68R10 68W40 PDFBibTeX XMLCite \textit{A. Banik} et al., Algorithmica 82, No. 1, 41--63 (2020; Zbl 1436.68142) Full Text: DOI
Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket Fully dynamic arboricity maintenance. (English) Zbl 1441.68160 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11653, 1-12 (2019). MSC: 68R10 05C05 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 11653, 1--12 (2019; Zbl 1441.68160) Full Text: DOI
Kolay, Sudeshna; Pandurangan, Ragukumar; Panolan, Fahad; Raman, Venkatesh; Tale, Prafullkumar Harmonious coloring: parameterized algorithms and upper bounds. (English) Zbl 1421.68136 Theor. Comput. Sci. 772, 132-142 (2019). MSC: 68R10 05C15 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Kolay} et al., Theor. Comput. Sci. 772, 132--142 (2019; Zbl 1421.68136) Full Text: DOI
Chakraborty, Sankardeep; Mukherjee, Anish; Raman, Venkatesh; Satti, Srinivasa Rao A framework for in-place graph algorithms. (English) Zbl 1522.68389 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 13, 16 p. (2018). MSC: 68R10 05C85 68Q04 68Q25 68W40 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 13, 16 p. (2018; Zbl 1522.68389) Full Text: DOI arXiv
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket A polynomial sized kernel for tracking paths problem. (English) Zbl 1436.68143 Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 94-107 (2018). MSC: 68Q27 05C38 68Q17 68R10 68W40 PDFBibTeX XMLCite \textit{A. Banik} et al., Lect. Notes Comput. Sci. 10807, 94--107 (2018; Zbl 1436.68143) Full Text: DOI
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket Polynomial kernels for vertex cover parameterized by small degree modulators. (English) Zbl 1419.05179 Theory Comput. Syst. 62, No. 8, 1910-1951 (2018). MSC: 05C70 68Q17 68Q25 05C85 PDFBibTeX XMLCite \textit{D. Majumdar} et al., Theory Comput. Syst. 62, No. 8, 1910--1951 (2018; Zbl 1419.05179) Full Text: DOI
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao Space efficient linear time algorithms for BFS, DFS and applications. (English) Zbl 1430.68173 Theory Comput. Syst. 62, No. 8, 1736-1762 (2018). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Theory Comput. Syst. 62, No. 8, 1736--1762 (2018; Zbl 1430.68173) Full Text: DOI
Banerjee, Niranka; Raman, Venkatesh; Satti, Srinivasa Rao Maintaining chordal graphs dynamically: improved upper and lower bounds. (English) Zbl 1484.68148 Fomin, Fedor V. (ed.) et al., Computer science – theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10846, 29-40 (2018). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 10846, 29--40 (2018; Zbl 1484.68148) Full Text: DOI
Majumdar, Diptapriyo; Raman, Venkatesh Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization. (English) Zbl 1397.68106 Algorithmica 80, No. 9, 2683-2724 (2018). MSC: 68Q25 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{D. Majumdar} and \textit{V. Raman}, Algorithmica 80, No. 9, 2683--2724 (2018; Zbl 1397.68106) Full Text: DOI
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha Fréchet distance between a line and avatar point set. (English) Zbl 1391.68105 Algorithmica 80, No. 9, 2616-2636 (2018). MSC: 68U05 68Q25 68W20 68W25 PDFBibTeX XMLCite \textit{A. Banik} et al., Algorithmica 80, No. 9, 2616--2636 (2018; Zbl 1391.68105) Full Text: DOI Link
Fiorini, Samuel; Krithika, R.; Narayanaswamy, N. S.; Raman, Venkatesh Approximability of clique transversal in perfect graphs. (English) Zbl 1392.68201 Algorithmica 80, No. 8, 2221-2239 (2018). MSC: 68Q25 05C17 05C85 68Q17 90C05 PDFBibTeX XMLCite \textit{S. Fiorini} et al., Algorithmica 80, No. 8, 2221--2239 (2018; Zbl 1392.68201) Full Text: DOI
Majumdar, Diptapriyo; Raman, Venkatesh FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters. (English) Zbl 1489.68197 Xiao, Mingyu (ed.) et al., Frontiers in algorithmics. 11th international workshop, FAW 2017, Chengdu, China, June 23–25, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10336, 209-220 (2017). MSC: 68R10 05C69 05C70 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{D. Majumdar} and \textit{V. Raman}, Lect. Notes Comput. Sci. 10336, 209--220 (2017; Zbl 1489.68197) Full Text: DOI
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments. (English) Zbl 1494.68189 Xiao, Mingyu (ed.) et al., Frontiers in algorithmics. 11th international workshop, FAW 2017, Chengdu, China, June 23–25, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10336, 22-33 (2017). MSC: 68R10 05C20 05C69 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Biswas} et al., Lect. Notes Comput. Sci. 10336, 22--33 (2017; Zbl 1494.68189) Full Text: DOI
Jayapaul, Varukumar; Ian Munro, J.; Raman, Venkatesh; Satti, Srinivas Rao Finding modes with equality comparisons. (English) Zbl 1382.68057 Theor. Comput. Sci. 704, 28-41 (2017). MSC: 68P10 68R05 68W40 PDFBibTeX XMLCite \textit{V. Jayapaul} et al., Theor. Comput. Sci. 704, 28--41 (2017; Zbl 1382.68057) Full Text: DOI
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh Shortest reconfiguration paths in the solution space of Boolean formulas. (English) Zbl 1374.68247 SIAM J. Discrete Math. 31, No. 3, 2185-2200 (2017). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., SIAM J. Discrete Math. 31, No. 3, 2185--2200 (2017; Zbl 1374.68247) Full Text: DOI
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits. (English) Zbl 1375.68089 J. Comput. Syst. Sci. 90, 63-79 (2017). MSC: 68R10 05C40 05C85 68P05 68P10 68W40 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., J. Comput. Syst. Sci. 90, 63--79 (2017; Zbl 1375.68089) Full Text: DOI arXiv
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira On the parameterized complexity of reconfiguration problems. (English) Zbl 1360.68516 Algorithmica 78, No. 1, 274-297 (2017). MSC: 68Q25 68Q17 90C35 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., Algorithmica 78, No. 1, 274--297 (2017; Zbl 1360.68516) Full Text: DOI arXiv
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh Improved bounds for poset sorting in the forbidden-comparison regime. (English) Zbl 1485.68087 Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 50-59 (2017). MSC: 68P10 06A06 68R10 68W05 68W40 PDFBibTeX XMLCite \textit{A. Biswas} et al., Lect. Notes Comput. Sci. 10156, 50--59 (2017; Zbl 1485.68087) Full Text: DOI
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha Fréchet distance between a line and avatar point set. (English) Zbl 1390.68705 Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 32, 14 p. (2016). MSC: 68U05 68Q25 68W20 68W25 PDFBibTeX XMLCite \textit{A. Banik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 65, Article 32, 14~p. (2016; Zbl 1390.68705) Full Text: DOI
Chakraborty, Sankardeep; Raman, Venkatesh; Satti, Srinivasa Rao Biconnectivity, chain decomposition and \(st\)-numbering using \(O(n)\) bits. (English) Zbl 1398.05193 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 22, 13 p. (2016). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 22, 13 p. (2016; Zbl 1398.05193) Full Text: DOI
Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs. (English) Zbl 1398.68248 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 75, 13 p. (2016). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{S. Kolay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 75, 13 p. (2016; Zbl 1398.68248) Full Text: DOI arXiv
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh Improved space efficient algorithms for BFS, DFS and applications. (English) Zbl 1477.68197 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 119-130 (2016). MSC: 68R10 68P05 68W40 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 9797, 119--130 (2016; Zbl 1477.68197) Full Text: DOI arXiv
Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao Finding mode using equality comparisons. (English) Zbl 1475.68216 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 351-360 (2016). MSC: 68R05 68W40 PDFBibTeX XMLCite \textit{V. Jayapaul} et al., Lect. Notes Comput. Sci. 9627, 351--360 (2016; Zbl 1475.68216) Full Text: DOI
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket Kernels for structural parameterizations of vertex cover – case of small degree modulators. (English) Zbl 1378.68089 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 331-342 (2015). MSC: 68Q25 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{D. Majumdar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 331--342 (2015; Zbl 1378.68089) Full Text: DOI
Jayapaul, Varunkumar; Munro, J. Ian; Raman, Venkatesh; Satti, Srinivasa Rao Sorting and selection with equality comparisons. (English) Zbl 1451.68085 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 434-445 (2015). MSC: 68P10 68P05 68Q25 PDFBibTeX XMLCite \textit{V. Jayapaul} et al., Lect. Notes Comput. Sci. 9214, 434--445 (2015; Zbl 1451.68085) Full Text: DOI
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh; Roy, Sasanka; Saurabh, Saket Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs. (English) Zbl 1465.68203 Xu, Dachuan (ed.) et al., Computing and combinatorics. 21st international conference, COCOON 2015, Beijing, China, August 4–6, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9198, 349-360 (2015). MSC: 68R10 05C85 68Q25 90C39 PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 9198, 349--360 (2015; Zbl 1465.68203) Full Text: DOI
Mouawad, Amer E.; Nishimura, Naomi; Pathak, Vinayak; Raman, Venkatesh Shortest reconfiguration paths in the solution space of Boolean formulas. (English) Zbl 1374.68246 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 985-996 (2015). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., Lect. Notes Comput. Sci. 9134, 985--996 (2015; Zbl 1374.68246) Full Text: DOI arXiv
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh Finding median in read-only memory on integer input. (English) Zbl 1310.68219 Theor. Comput. Sci. 583, 51-56 (2015). MSC: 68W05 68P10 68Q05 68Q25 PDFBibTeX XMLCite \textit{T. M. Chan} et al., Theor. Comput. Sci. 583, 51--56 (2015; Zbl 1310.68219) Full Text: DOI
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket Faster parameterized algorithms using linear programming. (English) Zbl 1398.68254 ACM Trans. Algorithms 11, No. 2, Article No. 15, 31 p. (2014). MSC: 68Q25 05C70 05C85 90C35 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., ACM Trans. Algorithms 11, No. 2, Article No. 15, 31 p. (2014; Zbl 1398.68254) Full Text: DOI arXiv
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket; Yeo, Anders Fixed-parameter tractability of satisfying beyond the number of variables. (English) Zbl 1360.68502 Algorithmica 68, No. 3, 739-757 (2014). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Crowston} et al., Algorithmica 68, No. 3, 739--757 (2014; Zbl 1360.68502) Full Text: DOI arXiv
Kratsch, Stefan; Pilipczuk, Marcin; Rai, Ashutosh; Raman, Venkatesh Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. (English) Zbl 1347.68171 ACM Trans. Comput. Theory 7, No. 1, Article No. 4, 18 p. (2014). MSC: 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Kratsch} et al., ACM Trans. Comput. Theory 7, No. 1, Article No. 4, 18 p. (2014; Zbl 1347.68171) Full Text: DOI
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Wrochna, Marcin Reconfiguration over tree decompositions. (English) Zbl 1456.68132 Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 246-257 (2014). MSC: 68R10 03B70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., Lect. Notes Comput. Sci. 8894, 246--257 (2014; Zbl 1456.68132) Full Text: DOI arXiv
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket The kernelization complexity of connected domination in graphs with (no) small cycles. (English) Zbl 1318.68096 Algorithmica 68, No. 2, 504-530 (2014). MSC: 68Q25 05C12 05C69 PDFBibTeX XMLCite \textit{N. Misra} et al., Algorithmica 68, No. 2, 504--530 (2014; Zbl 1318.68096) Full Text: DOI
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri Solving min ones 2-SAT as fast as vertex cover. (English) Zbl 1301.68163 Theor. Comput. Sci. 506, 115-121 (2013). MSC: 68Q25 68W25 PDFBibTeX XMLCite \textit{N. Misra} et al., Theor. Comput. Sci. 506, 115--121 (2013; Zbl 1301.68163) Full Text: DOI
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. (English) Zbl 1358.68313 Inf. Comput. 231, 109-116 (2013). MSC: 68W05 05A05 05C15 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Inf. Comput. 231, 109--116 (2013; Zbl 1358.68313) Full Text: DOI
Chan, Timothy M.; Munro, J. Ian; Raman, Venkatesh Faster, space-efficient selection algorithms in read-only memory for integers. (English) Zbl 1310.68218 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 405-412 (2013). MSC: 68W05 68P10 68Q05 68Q25 PDFBibTeX XMLCite \textit{T. M. Chan} et al., Lect. Notes Comput. Sci. 8283, 405--412 (2013; Zbl 1310.68218) Full Text: DOI
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket Parameterized complexity of MaxSat above average. (English) Zbl 1358.68126 Theor. Comput. Sci. 511, 77-84 (2013). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Crowston} et al., Theor. Comput. Sci. 511, 77--84 (2013; Zbl 1358.68126) Full Text: DOI arXiv
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. (English) Zbl 1433.68290 Inf. Comput. 233, 60-70 (2013). MSC: 68R10 05C20 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{F. Dorn} et al., Inf. Comput. 233, 60--70 (2013; Zbl 1433.68290) Full Text: DOI
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh; Simjour, Narges; Suzuki, Akira On the parameterized complexity of reconfiguration problems. (English) Zbl 1350.68155 Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03897-1/pbk). Lecture Notes in Computer Science 8246, 281-294 (2013). MSC: 68Q25 68Q17 90C35 PDFBibTeX XMLCite \textit{A. E. Mouawad} et al., Lect. Notes Comput. Sci. 8246, 281--294 (2013; Zbl 1350.68155) Full Text: DOI arXiv
Brodnik, Andrej (ed.); López-Ortiz, Alejandro (ed.); Raman, Venkatesh (ed.); Viola, Alfredo (ed.) Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. (English) Zbl 1270.68019 Lecture Notes in Computer Science 8066. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). xxviii, 363 p. (2013). MSC: 68-06 68P05 68W40 00B30 PDFBibTeX XMLCite \textit{A. Brodnik} (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (2013; Zbl 1270.68019) Full Text: DOI
Misra, Neeldhara; Ordyniak, Sebastian; Raman, Venkatesh; Szeider, Stefan Upper and lower bounds for weak backdoor set detection. (English) Zbl 1390.68353 Järvisalo, Matti (ed.) et al., Theory and applications of satisfiability testing – SAT 2013. 16th international conference, Helsinki, Finland, July 8–12, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39070-8/pbk). Lecture Notes in Computer Science 7962, 394-402 (2013). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{N. Misra} et al., Lect. Notes Comput. Sci. 7962, 394--402 (2013; Zbl 1390.68353) Full Text: DOI arXiv
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath The parameterized complexity of unique coverage and its variants. (English) Zbl 1290.68059 Algorithmica 65, No. 3, 517-544 (2013). MSC: 68Q25 68W40 PDFBibTeX XMLCite \textit{N. Misra} et al., Algorithmica 65, No. 3, 517--544 (2013; Zbl 1290.68059) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej An FPT algorithm for tree deletion set. (English) Zbl 1379.68176 Ghosh, Subir Kumar (ed.) et al., WALCOM: algorithms and computation. 7th international workshop, WALCOM 2013, Kharagpur, India, February 14–16, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36064-0/pbk). Lecture Notes in Computer Science 7748, 286-297 (2013). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{V. Raman} et al., Lect. Notes Comput. Sci. 7748, 286--297 (2013; Zbl 1379.68176) Full Text: DOI
Raman, Venkatesh; Shankar, Bal Sri Improved fixed-parameter algorithm for the minimum weight 3-SAT problem. (English) Zbl 1379.68177 Ghosh, Subir Kumar (ed.) et al., WALCOM: algorithms and computation. 7th international workshop, WALCOM 2013, Kharagpur, India, February 14–16, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36064-0/pbk). Lecture Notes in Computer Science 7748, 265-273 (2013). MSC: 68Q25 PDFBibTeX XMLCite \textit{V. Raman} and \textit{B. S. Shankar}, Lect. Notes Comput. Sci. 7748, 265--273 (2013; Zbl 1379.68177) Full Text: DOI
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath Polynomial kernels for Dominating Set in graphs of bounded degeneracy and beyond. (English) Zbl 1301.68164 ACM Trans. Algorithms 9, No. 1, Article No. 11, 23 p. (2012). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{G. Philip} et al., ACM Trans. Algorithms 9, No. 1, Article No. 11, 23 p. (2012; Zbl 1301.68164) Full Text: DOI
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket; Yeo, Anders Fixed-parameter tractability of satisfying beyond the number of variables. (English) Zbl 1273.68161 Cimatti, Alessandro (ed.) et al., Theory and applications of satisfiability testing – SAT 2012. 15th international conference, Trento, Italy, June 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31611-1/pbk). Lecture Notes in Computer Science 7317, 355-368 (2012). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Crowston} et al., Lect. Notes Comput. Sci. 7317, 355--368 (2012; Zbl 1273.68161) Full Text: DOI
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket On parameterized independent feedback vertex set. (English) Zbl 1253.68181 Theor. Comput. Sci. 461, 65-75 (2012). MSC: 68Q25 68Q17 05C69 05C85 PDFBibTeX XMLCite \textit{N. Misra} et al., Theor. Comput. Sci. 461, 65--75 (2012; Zbl 1253.68181) Full Text: DOI
Raman, Venkatesh Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows. (English) Zbl 1358.68146 Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 69-73 (2012). MSC: 68Q25 68-03 05C69 05C70 PDFBibTeX XMLCite \textit{V. Raman}, Lect. Notes Comput. Sci. 7370, 69--73 (2012; Zbl 1358.68146) Full Text: DOI
Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket LP can be a cure for parameterized problems. (English) Zbl 1245.68111 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 338-349, electronic only (2012). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{N. S. Narayanaswamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 14, 338--349 (2012; Zbl 1245.68111) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V. Faster algorithms for finding and counting subgraphs. (English) Zbl 1246.05149 J. Comput. Syst. Sci. 78, No. 3, 698-706 (2012). MSC: 05C85 68Q25 05C60 05C30 05C05 68R10 68W20 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 78, No. 3, 698--706 (2012; Zbl 1246.05149) Full Text: DOI
Kratsch, Stefan; Pilipczuk, Marcin; Rai, Ashutosh; Raman, Venkatesh Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. (English) Zbl 1357.68073 Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 364-375 (2012). MSC: 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Kratsch} et al., Lect. Notes Comput. Sci. 7357, 364--375 (2012; Zbl 1357.68073) Full Text: DOI
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket Parameterized complexity of MaxSat above average. (English) Zbl 1353.68116 Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 184-194 (2012). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Crowston} et al., Lect. Notes Comput. Sci. 7256, 184--194 (2012; Zbl 1353.68116) Full Text: DOI arXiv
Raman, Venkatesh (ed.); Saurabh, Saket (ed.) Special issue: Parametrized and exact computation. Part I. Selected papers based on the presentations at the international symposium (IPEC 2010), Chennai, India, December 13–15, 2010. (English) Zbl 1254.68040 Algorithmica 64, No. 1, 212 p. (2012). MSC: 68-06 68Q17 68Q25 68W40 05C85 00B25 PDFBibTeX XML
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Bidimensionality and EPTAS. (English) Zbl 1377.68324 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 748-759 (2011). MSC: 68W25 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 748--759 (2011; Zbl 1377.68324) Full Text: Link
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Subexponential algorithms for partial cover problems. (English) Zbl 1260.05159 Inf. Process. Lett. 111, No. 16, 814-818 (2011). MSC: 05C85 68W40 05C69 05C70 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 111, No. 16, 814--818 (2011; Zbl 1260.05159) Full Text: DOI Link
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket A polynomial kernel for Feedback Arc Set on bipartite tournaments. (English) Zbl 1350.68154 Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 333-343 (2011). MSC: 68Q25 05C20 PDFBibTeX XMLCite \textit{P. Misra} et al., Lect. Notes Comput. Sci. 7074, 333--343 (2011; Zbl 1350.68154) Full Text: DOI
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R. The complexity of König subgraph problems and above-guarantee vertex cover. (English) Zbl 1243.05203 Algorithmica 61, No. 4, 857-881 (2011). Reviewer: Arnfried Kemnitz (Braunschweig) MSC: 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Mishra} et al., Algorithmica 61, No. 4, 857--881 (2011; Zbl 1243.05203) Full Text: DOI Link
Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket Paths, flowers and vertex cover. (English) Zbl 1346.05287 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 382-393 (2011). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{V. Raman} et al., Lect. Notes Comput. Sci. 6942, 382--393 (2011; Zbl 1346.05287) Full Text: DOI
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket On parameterized independent feedback vertex set. (English) Zbl 1353.68135 Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 98-109 (2011). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{N. Misra} et al., Lect. Notes Comput. Sci. 6842, 98--109 (2011; Zbl 1353.68135) Full Text: DOI
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. (English) Zbl 1230.68104 Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 251-262, electronic only (2010). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{F. Dorn} et al., LIPIcs -- Leibniz Int. Proc. Inform. 5, 251--262 (2010; Zbl 1230.68104) Full Text: DOI Link
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve A quartic kernel for pathwidth-one vertex deletion. (English) Zbl 1309.68100 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 196-207 (2010). MSC: 68Q25 05C38 05C85 PDFBibTeX XMLCite \textit{G. Philip} et al., Lect. Notes Comput. Sci. 6410, 196--207 (2010; Zbl 1309.68100) Full Text: DOI arXiv
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri Solving minones-2-sat as fast as vertex cover. (English) Zbl 1287.68079 Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23–27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 549-555 (2010). MSC: 68Q25 68W25 PDFBibTeX XMLCite \textit{N. Misra} et al., Lect. Notes Comput. Sci. 6281, 549--555 (2010; Zbl 1287.68079) Full Text: DOI
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. (English) Zbl 1285.68207 Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 334-345 (2010). MSC: 68W05 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Lect. Notes Comput. Sci. 6139, 334--345 (2010; Zbl 1285.68207) Full Text: DOI
Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath On the directed degree-preserving spanning tree problem. (English) Zbl 1273.68182 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 276-287 (2009). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Lect. Notes Comput. Sci. 5917, 276--287 (2009; Zbl 1273.68182) Full Text: DOI
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. (English) Zbl 1256.68084 Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 694-705 (2009). MSC: 68Q25 05C69 05C85 68W05 PDFBibTeX XMLCite \textit{G. Philip} et al., Lect. Notes Comput. Sci. 5757, 694--705 (2009; Zbl 1256.68084) Full Text: DOI
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath The budgeted unique coverage problem and color-coding (extended abstract). (English) Zbl 1248.68257 Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 310-321 (2009). MSC: 68Q25 68R05 68W20 PDFBibTeX XMLCite \textit{N. Misra} et al., Lect. Notes Comput. Sci. 5675, 310--321 (2009; Zbl 1248.68257) Full Text: DOI
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath Parameterizing above or below guaranteed values. (English) Zbl 1155.68400 J. Comput. Syst. Sci. 75, No. 2, 137-153 (2009). MSC: 68Q17 68R10 68Q25 03D15 PDFBibTeX XMLCite \textit{M. Mahajan} et al., J. Comput. Syst. Sci. 75, No. 2, 137--153 (2009; Zbl 1155.68400) Full Text: DOI
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath König deletion sets and vertex covers above the matching size. (English) Zbl 1183.68313 Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 836-847 (2008). MSC: 68Q25 05C35 05C70 05C85 PDFBibTeX XMLCite \textit{S. Mishra} et al., Lect. Notes Comput. Sci. 5369, 836--847 (2008; Zbl 1183.68313) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Srihari, Sriganesh Parameterized algorithms for generalized domination. (English) Zbl 1168.05354 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 116-126 (2008). MSC: 05C69 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. Raman} et al., Lect. Notes Comput. Sci. 5165, 116--126 (2008; Zbl 1168.05354) Full Text: DOI
Raman, Venkatesh; Sikdar, Somnath Parameterized complexity of the induced subgraph problem in directed graphs. (English) Zbl 1185.05076 Inf. Process. Lett. 104, No. 3, 79-85 (2007). MSC: 05C20 68Q25 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Sikdar}, Inf. Process. Lett. 104, No. 3, 79--85 (2007; Zbl 1185.05076) Full Text: DOI
Moser, Hannes; Raman, Venkatesh; Sikdar, Somnath The parameterized complexity of the unique coverage problem. (English) Zbl 1193.68139 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 621-631 (2007). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{H. Moser} et al., Lect. Notes Comput. Sci. 4835, 621--631 (2007; Zbl 1193.68139) Full Text: DOI
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R. The complexity of finding subgraphs whose matching number equals the vertex cover number. (English) Zbl 1193.05133 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 268-279 (2007). MSC: 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Mishra} et al., Lect. Notes Comput. Sci. 4835, 268--279 (2007; Zbl 1193.05133) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath Efficient exact algorithms through enumerating maximal independent sets and other techniques. (English) Zbl 1148.68054 Theory Comput. Syst. 41, No. 3, 563-587 (2007). MSC: 68W40 PDFBibTeX XMLCite \textit{V. Raman} et al., Theory Comput. Syst. 41, No. 3, 563--587 (2007; Zbl 1148.68054) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R. Faster fixed parameter tractable algorithms for finding feedback vertex sets. (English) Zbl 1321.05275 ACM Trans. Algorithms 2, No. 3, 403-415 (2006). MSC: 05C85 05C38 68Q25 PDFBibTeX XMLCite \textit{V. Raman} et al., ACM Trans. Algorithms 2, No. 3, 403--415 (2006; Zbl 1321.05275) Full Text: DOI
Mahajan, Meena; Raman, Venkatesh; Sikdar, Somnath Parameterizing MAX SNP problems above guaranteed values. (English) Zbl 1154.68430 Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 38-49 (2006). MSC: 68Q25 PDFBibTeX XMLCite \textit{M. Mahajan} et al., Lect. Notes Comput. Sci. 4169, 38--49 (2006; Zbl 1154.68430) Full Text: DOI
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket Fast exponential algorithms for maximum \(r\)-regular induced subgraph problems. (English) Zbl 1177.68154 Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 139-151 (2006). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Gupta} et al., Lect. Notes Comput. Sci. 4337, 139--151 (2006; Zbl 1177.68154) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket Triangles, 4-cycles and parameterized (in-)tractability. (English) Zbl 1142.68374 Arge, Lars (ed.) et al., Algorithm theory – SWAT 2006. 10th Scandinavian workshop on algorithm theory, Riga, Latvia, July 6–8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35753-7/pbk). Lecture Notes in Computer Science 4059, 304-315 (2006). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 4059, 304--315 (2006; Zbl 1142.68374) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket Parameterized algorithms for feedback set problems and their duals in tournaments. (English) Zbl 1086.68105 Theor. Comput. Sci. 351, No. 3, 446-458 (2006). MSC: 68R10 05C20 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Theor. Comput. Sci. 351, No. 3, 446--458 (2006; Zbl 1086.68105) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R. Faster algorithms for feedback vertex set. (English) Zbl 1203.05155 Feofiloff, Paulo (ed.) et al., Proceedings of GRACO2005. Papers from the 2nd Brazilian symposium on graphs, algorithms, and combinatorics, Angra dos Reis, Brazil, April 27–29, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 19, 273-279 (2005). MSC: 05C85 05C38 68W40 PDFBibTeX XMLCite \textit{V. Raman} et al., Electron. Notes Discrete Math. 19, 273--279 (2005; Zbl 1203.05155)
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath Improved exact exponential algorithms for vertex bipartization and other problems. (English) Zbl 1171.68646 Coppo, Mario (ed.) et al., Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12–14, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29106-7/pbk). Lecture Notes in Computer Science 3701, 375-389 (2005). MSC: 68R10 05C85 68Q25 90C35 90C57 PDFBibTeX XMLCite \textit{V. Raman} et al., Lect. Notes Comput. Sci. 3701, 375--389 (2005; Zbl 1171.68646) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket Improved parameterized algorithms for feedback set problems in weighted tournaments. (English) Zbl 1104.68547 Downey, Rod (ed.) et al., Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23071-8/pbk). Lecture Notes in Computer Science 3162, 260-270 (2004). MSC: 68R10 05C20 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 3162, 260--270 (2004; Zbl 1104.68547) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket Parameterized complexity of directed feedback set problems in tournaments. (English) Zbl 1278.68110 Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 484-492 (2003). MSC: 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 2748, 484--492 (2003; Zbl 1278.68110) Full Text: DOI
Bansal, Nikhil; Raman, Venkatesh Upper bounds for MaxSat: Further improved. (English) Zbl 0971.68069 Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 247-258 (1999). MSC: 68Q25 PDFBibTeX XMLCite \textit{N. Bansal} and \textit{V. Raman}, Lect. Notes Comput. Sci. 1741, 247--258 (1999; Zbl 0971.68069)
Mahajan, Meena; Raman, Venkatesh Parameterizing above guaranteed values: MaxSat and MaxCut. (English) Zbl 0921.68052 J. Algorithms 31, No. 2, 335-354 (1999). MSC: 68Q25 68W10 PDFBibTeX XMLCite \textit{M. Mahajan} and \textit{V. Raman}, J. Algorithms 31, No. 2, 335--354 (1999; Zbl 0921.68052) Full Text: DOI
Balasubramanian, R.; Fellows, Michael R.; Raman, Venkatesh An improved fixed-parameter algorithm for vertex cover. (English) Zbl 1337.05095 Inf. Process. Lett. 65, No. 3, 163-168 (1998). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{R. Balasubramanian} et al., Inf. Process. Lett. 65, No. 3, 163--168 (1998; Zbl 1337.05095) Full Text: DOI Link
Raman, Venkatesh; Ravikumar, B.; Srinivasa Rao, S. A simplified NP-complete MAXSAT problem. (English) Zbl 1339.68122 Inf. Process. Lett. 65, No. 1, 1-6 (1998). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{V. Raman} et al., Inf. Process. Lett. 65, No. 1, 1--6 (1998; Zbl 1339.68122) Full Text: DOI Link
Balasubramanian, R.; Raman, Venkatesh; Srinivasaraghavan, G. Tight bounds for finding degrees from the adjacency matrix. (English) Zbl 1495.68161 Baeza-Yates, Ricardo (ed.) et al., LATIN ’95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 911, 49-59 (1995). MSC: 68R10 05C20 05C50 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Balasubramanian} et al., Lect. Notes Comput. Sci. 911, 49--59 (1995; Zbl 1495.68161) Full Text: DOI
Balasubramanian, R.; Raman, Venkatesh Path balance heuristic for self-adjusting binary search trees. (English) Zbl 1354.68235 Thiagarajan, P.S. (ed.), Foundations of software technology and theoretical computer science. 15th conference, Bangalore, India, December 18–20, 1995. Proceedings. Berlin: Springer-Verlag (ISBN 3-540-60692-0). Lect. Notes Comput. Sci. 1026, 338-348 (1995). MSC: 68T20 68P05 68Q25 PDFBibTeX XMLCite \textit{R. Balasubramanian} and \textit{V. Raman}, Lect. Notes Comput. Sci. 1026, 338--348 (1995; Zbl 1354.68235) Full Text: DOI
Balasubramanian, R.; Raman, Venkatesh; Srinivasaraghavan, G. The complexity of finding certain trees in tournaments. (English) Zbl 1504.68153 Dehne, Frank (ed.) et al., Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 709, 142-150 (1993). MSC: 68R10 05C05 05C20 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Balasubramanian} et al., Lect. Notes Comput. Sci. 709, 142--150 (1993; Zbl 1504.68153) Full Text: DOI
Munro, J. Ian; Raman, Venkatesh Sorting multisets and vectors in-place. (English) Zbl 0765.68027 Algorithms and data structures, Proc. 2nd Workshop, WADS ’91, Ottawa/Can. 1991, Lect. Notes Comput. Sci. 519, 473-480 (1991). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{J. I. Munro} and \textit{V. Raman}, Lect. Notes Comput. Sci. 519, 473--480 (1991; Zbl 0765.68027)
Munro, J. Ian; Raman, Venkatesh; Salowe, Jeffrey S. Stable in situ sorting and minimum data movement. (English) Zbl 0696.68086 BIT 30, No. 2, 220-234 (1990). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{J. I. Munro} et al., BIT 30, No. 2, 220--234 (1990; Zbl 0696.68086) Full Text: DOI