Jana, Satyabrata; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Verma, Shaily Partitioning subclasses of chordal graphs with few deletions. (English) Zbl 07784205 Theor. Comput. Sci. 983, Article ID 114288, 10 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Jana} et al., Theor. Comput. Sci. 983, Article ID 114288, 10 p. (2024; Zbl 07784205) Full Text: DOI
Abhinav, Ankit; Bandopadhyay, Susobhan; Banik, Aritra; Saurabh, Saket Parameterized algorithms for finding highly connected solution. (English) Zbl 07635993 Theor. Comput. Sci. 942, 47-56 (2023). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Abhinav} et al., Theor. Comput. Sci. 942, 47--56 (2023; Zbl 07635993) Full Text: DOI
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket On the complexity of singly connected vertex deletion. (English) Zbl 07597110 Theor. Comput. Sci. 934, 47-64 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Das} et al., Theor. Comput. Sci. 934, 47--64 (2022; Zbl 07597110) Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Resolute control: forbidding candidates from winning an election is hard. (English) Zbl 07533865 Theor. Comput. Sci. 915, 74-89 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Gupta} et al., Theor. Comput. Sci. 915, 74--89 (2022; Zbl 07533865) Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Balanced stable marriage: how close is close enough? (English) Zbl 1517.68144 Theor. Comput. Sci. 883, 19-43 (2021). MSC: 68Q27 91B68 PDFBibTeX XMLCite \textit{S. Gupta} et al., Theor. Comput. Sci. 883, 19--43 (2021; Zbl 1517.68144) Full Text: DOI arXiv
Kanesh, Lawqueen; Maity, Soumen; Muluk, Komal; Saurabh, Saket Parameterized complexity of fair feedback vertex set problem. (English) Zbl 1474.68227 Theor. Comput. Sci. 867, 1-12 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{L. Kanesh} et al., Theor. Comput. Sci. 867, 1--12 (2021; Zbl 1474.68227) Full Text: DOI
Agrawal, Akanksha; Kanesh, Lawqueen; Saurabh, Saket; Tale, Prafullkumar Paths to trees and cacti. (English) Zbl 1486.68121 Theor. Comput. Sci. 860, 98-116 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theor. Comput. Sci. 860, 98--116 (2021; Zbl 1486.68121) 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
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
Misra, Pranabendu; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket Linear representation of transversal matroids and gammoids parameterized by rank. (English) Zbl 1433.68181 Theor. Comput. Sci. 818, 51-59 (2020). MSC: 68Q27 05B35 68W40 PDFBibTeX XMLCite \textit{P. Misra} et al., Theor. Comput. Sci. 818, 51--59 (2020; Zbl 1433.68181) Full Text: DOI
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav The parameterized complexity landscape of finding 2-partitions of digraphs. (English) Zbl 1434.68205 Theor. Comput. Sci. 795, 108-114 (2019). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 795, 108--114 (2019; Zbl 1434.68205) Full Text: DOI
Basavaraju, Manu; Panolan, Fahad; Rai, Ashutosh; Ramanujan, M. S.; Saurabh, Saket On the kernelization complexity of string problems. (English) Zbl 1390.68330 Theor. Comput. Sci. 730, 21-31 (2018). MSC: 68Q25 68W32 PDFBibTeX XMLCite \textit{M. Basavaraju} et al., Theor. Comput. Sci. 730, 21--31 (2018; Zbl 1390.68330) Full Text: DOI
Adil, Deeksha; Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Parameterized algorithms for stable matching with ties and incomplete lists. (English) Zbl 1392.68196 Theor. Comput. Sci. 723, 1-10 (2018). MSC: 68Q25 91B68 PDFBibTeX XMLCite \textit{D. Adil} et al., Theor. Comput. Sci. 723, 1--10 (2018; Zbl 1392.68196) Full Text: DOI
Rai, Ashutosh; Saurabh, Saket Bivariate complexity analysis of Almost Forest Deletion. (English) Zbl 1382.68122 Theor. Comput. Sci. 708, 18-33 (2018). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Rai} and \textit{S. Saurabh}, Theor. Comput. Sci. 708, 18--33 (2018; Zbl 1382.68122) Full Text: DOI
Mishra, Sounaka; Rajakrishnan, Shijin; Saurabh, Saket On approximability of optimization problems related to red/blue-split graphs. (English) Zbl 1372.68141 Theor. Comput. Sci. 690, 104-113 (2017). MSC: 68Q25 05C15 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{S. Mishra} et al., Theor. Comput. Sci. 690, 104--113 (2017; Zbl 1372.68141) Full Text: DOI
Ashok, Pradeesha; Kolay, Sudeshna; Meesum, S. M.; Saurabh, Saket Parameterized complexity of strip packing and minimum volume packing. (English) Zbl 1356.68091 Theor. Comput. Sci. 661, 56-64 (2017). MSC: 68Q25 90C27 PDFBibTeX XMLCite \textit{P. Ashok} et al., Theor. Comput. Sci. 661, 56--64 (2017; Zbl 1356.68091) Full Text: DOI
Meesum, S. M.; Misra, Pranabendu; Saurabh, Saket Reducing rank of the adjacency matrix by graph modification. (English) Zbl 1353.05117 Theor. Comput. Sci. 654, 70-79 (2016). MSC: 05C85 05C50 68Q25 PDFBibTeX XMLCite \textit{S. M. Meesum} et al., Theor. Comput. Sci. 654, 70--79 (2016; Zbl 1353.05117) Full Text: DOI
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (English) Zbl 1315.68150 Theor. Comput. Sci. 565, 1-15 (2015). MSC: 68Q25 05C40 05C70 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 565, 1--15 (2015; Zbl 1315.68150) Full Text: DOI
Kumar, Mrinal; Mishra, Sounaka; Safina Devi, N.; Saurabh, Saket Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. (English) Zbl 1418.68245 Theor. Comput. Sci. 526, 90-96 (2014). MSC: 68W25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Kumar} et al., Theor. Comput. Sci. 526, 90--96 (2014; Zbl 1418.68245) 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
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
Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Meister, Daniel; Saurabh, Saket Bandwidth on AT-free graphs. (English) Zbl 1228.68036 Theor. Comput. Sci. 412, No. 50, 7001-7008 (2011). MSC: 68Q25 68Q17 05C78 05C85 PDFBibTeX XMLCite \textit{P. Golovach} et al., Theor. Comput. Sci. 412, No. 50, 7001--7008 (2011; Zbl 1228.68036) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket An exact algorithm for minimum distortion embedding. (English) Zbl 1257.68080 Theor. Comput. Sci. 412, No. 29, 3530-3536 (2011). MSC: 68Q25 05C10 05C85 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 412, No. 29, 3530--3536 (2011; Zbl 1257.68080) Full Text: DOI
Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket A linear kernel for a planar connected dominating set. (English) Zbl 1216.68131 Theor. Comput. Sci. 412, No. 23, 2536-2543 (2011). MSC: 68Q25 05C40 05C69 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Theor. Comput. Sci. 412, No. 23, 2536--2543 (2011; Zbl 1216.68131) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket Iterative compression and exact algorithms. (English) Zbl 1186.68187 Theor. Comput. Sci. 411, No. 7-9, 1045-1053 (2010). MSC: 68P30 68Q17 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 411, No. 7--9, 1045--1053 (2010; Zbl 1186.68187) 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