Banik, Aritra; Kasthurirangan, Prahlad Narasimhan; Raman, Venkatesh Dominator coloring and CD coloring in almost cluster graphs. (English) Zbl 07789699 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 106-119 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{A. Banik} et al., Lect. Notes Comput. Sci. 14079, 106--119 (2023; Zbl 07789699) Full Text: DOI arXiv
Jacob, Ashwin; de Kroon, Jari J. H.; Majumdar, Diptapriyo; Raman, Venkatesh Deletion to scattered graph classes. I: Case of finite number of graph classes. (English) Zbl 07730239 J. Comput. Syst. Sci. 138, Article ID 103460, 21 p. (2023). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{A. Jacob} et al., J. Comput. Syst. Sci. 138, Article ID 103460, 21 p. (2023; Zbl 07730239) Full Text: DOI arXiv
Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes. (English) Zbl 07695019 J. Comput. Syst. Sci. 136, 280-301 (2023). MSC: 68R10 68Q27 68W25 PDFBibTeX XMLCite \textit{A. Jacob} et al., J. Comput. Syst. Sci. 136, 280--301 (2023; Zbl 07695019) Full Text: DOI arXiv
Bandopadhyay, Susobhan; Banerjee, Suman; Banik, Aritra; Raman, Venkatesh Structural parameterizations of budgeted graph coloring. (English) Zbl 07676482 Theor. Comput. Sci. 940, 209-221 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Bandopadhyay} et al., Theor. Comput. Sci. 940, 209--221 (2023; Zbl 07676482) Full Text: DOI
Choudhary, Pratibha; Goodrich, Michael T.; Gupta, Siddharth; Khodabandeh, Hadi; Matias, Pedro; Raman, Venkatesh Improved kernels for tracking paths. (English) Zbl 07649515 Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} et al., Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023; Zbl 07649515) Full Text: DOI
Banerjee, Niranka; Gupta, Manoj; Raman, Venkatesh; Saurabh, Saket Output sensitive fault tolerant maximum matching. (English) Zbl 07615734 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 115-132 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Banerjee} et al., Lect. Notes Comput. Sci. 13296, 115--132 (2022; Zbl 07615734) Full Text: DOI
Choudhary, Pratibha; Raman, Venkatesh Structural parameterizations of Tracking Paths problem. (English) Zbl 07597113 Theor. Comput. Sci. 934, 91-102 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} and \textit{V. Raman}, Theor. Comput. Sci. 934, 91--102 (2022; Zbl 07597113) Full Text: DOI arXiv
Jacob, Ashwin; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha Structural parameterizations with modulator oblivion. (English) Zbl 07567466 Algorithmica 84, No. 8, 2335-2357 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{A. Jacob} et al., Algorithmica 84, No. 8, 2335--2357 (2022; Zbl 07567466) Full Text: DOI arXiv
Bandopadhyay, Susobhan; Banerjee, Suman; Banik, Aritra; Raman, Venkatesh Structural parameterizations of budgeted graph coloring. (English) Zbl 07556583 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 340-351 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{S. Bandopadhyay} et al., Lect. Notes Comput. Sci. 13174, 340--351 (2022; Zbl 07556583) Full Text: DOI arXiv
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
Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh Parameterized complexity of conflict-free set cover. (English) Zbl 1517.68146 Theory Comput. Syst. 65, No. 3, 515-540 (2021). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{A. Jacob} et al., Theory Comput. Syst. 65, No. 3, 515--540 (2021; Zbl 1517.68146) Full Text: DOI
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
Jacob, Ashwin; Majumdar, Diptapriyo; Raman, Venkatesh Parameterized complexity of deletion to scattered graph classes. (English) Zbl 07764109 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 18, 17 p. (2020). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{A. Jacob} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 18, 17 p. (2020; Zbl 07764109) Full Text: DOI
Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket Approximation in (poly-) logarithmic space. (English) Zbl 07559387 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 16, 15 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Biswas} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 16, 15 p. (2020; Zbl 07559387) Full Text: DOI
Banik, Aritra; Jacob, Ashwin; Paliwal, Vijay Kumar; Raman, Venkatesh Fixed-parameter tractability of \((n-k)\) list coloring. (English) Zbl 1465.05058 Theory Comput. Syst. 64, No. 7, 1307-1316 (2020). MSC: 05C15 68Q27 PDFBibTeX XMLCite \textit{A. Banik} et al., Theory Comput. Syst. 64, No. 7, 1307--1316 (2020; Zbl 1465.05058) Full Text: DOI
Banik, Aritra; Choudhary, Pratibha; Raman, Venkatesh; Saurabh, Saket Fixed-parameter tractable algorithms for tracking shortest paths. (English) Zbl 1464.68274 Theor. Comput. Sci. 846, 1-13 (2020). MSC: 68R10 05C38 68Q27 PDFBibTeX XMLCite \textit{A. Banik} et al., Theor. Comput. Sci. 846, 1--13 (2020; Zbl 1464.68274) Full Text: DOI arXiv
Arora, Pranav; Banik, Aritra; Paliwal, Vijay Kumar; Raman, Venkatesh List-coloring – parameterizing from triviality. (English) Zbl 1437.68069 Theor. Comput. Sci. 821, 102-110 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68Q27 05C15 PDFBibTeX XMLCite \textit{P. Arora} et al., Theor. Comput. Sci. 821, 102--110 (2020; Zbl 1437.68069) 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
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket Parameterized complexity of geometric covering problems having conflicts. (English) Zbl 1436.68145 Algorithmica 82, No. 1, 1-19 (2020). MSC: 68Q27 68Q17 68R10 68U05 68W25 PDFBibTeX XMLCite \textit{A. Banik} et al., Algorithmica 82, No. 1, 1--19 (2020; Zbl 1436.68145) Full Text: DOI
Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Vaishali, S. Tractability of König edge deletion problems. (English) Zbl 1435.68125 Theor. Comput. Sci. 796, 207-215 (2019). MSC: 68Q27 05C70 68Q17 PDFBibTeX XMLCite \textit{D. Majumdar} et al., Theor. Comput. Sci. 796, 207--215 (2019; Zbl 1435.68125) Full Text: DOI arXiv
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
Krithika, R.; Majumdar, Diptapriyo; Raman, Venkatesh Revisiting connected vertex cover: FPT algorithms and lossy kernels. (English) Zbl 1430.68225 Theory Comput. Syst. 62, No. 8, 1690-1714 (2018). MSC: 68R10 05C70 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Krithika} et al., Theory Comput. Syst. 62, No. 8, 1690--1714 (2018; Zbl 1430.68225) Full Text: DOI arXiv
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
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
Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Tale, Prafullkumar Exact and parameterized algorithms for \((k,i)\)-coloring. (English) Zbl 1485.68304 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, 281-293 (2017). MSC: 68W05 05C15 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{D. Majumdar} et al., Lect. Notes Comput. Sci. 10156, 281--293 (2017; Zbl 1485.68304) Full Text: DOI
Kolay, Sudeshna; Pandurangan, Ragukumar; Panolan, Fahad; Raman, Venkatesh; Tale, Prafullkumar Harmonious coloring: parameterized algorithms and upper bounds. (English) Zbl 1417.05220 Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 245-256 (2016). MSC: 05C85 05C15 68Q17 PDFBibTeX XMLCite \textit{S. Kolay} et al., Lect. Notes Comput. Sci. 9941, 245--256 (2016; Zbl 1417.05220) Full Text: DOI
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
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
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
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