Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav Erdős-Pósa property of obstructions to interval graphs. (English) Zbl 1522.05359 J. Graph Theory 102, No. 4, 702-727 (2023). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{A. Agrawal} et al., J. Graph Theory 102, No. 4, 702--727 (2023; Zbl 1522.05359) Full Text: DOI
Sahu, Abhishek; Saurabh, Saket Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs. (English) Zbl 07681305 Theory Comput. Syst. 67, No. 2, 221-233 (2023). MSC: 68Qxx 03Dxx 68-XX PDFBibTeX XMLCite \textit{A. Sahu} and \textit{S. Saurabh}, Theory Comput. Syst. 67, No. 2, 221--233 (2023; Zbl 07681305) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. (English) Zbl 1511.05222 SIAM J. Comput. 51, No. 6, 1866-1930 (2022). MSC: 05C85 05C10 05C75 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 51, No. 6, 1866--1930 (2022; Zbl 1511.05222) Full Text: DOI arXiv
Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav Efficient graph minors theory and parameterized algorithms for (planar) disjoint paths. (English) Zbl 07604208 Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 112-128 (2020). MSC: 68-XX PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Lect. Notes Comput. Sci. 12160, 112--128 (2020; Zbl 07604208) Full Text: DOI arXiv
Sahu, Abhishek; Saurabh, Saket Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs. (English) Zbl 07603935 Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 367-378 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Sahu} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 12159, 367--378 (2020; Zbl 07603935) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1475.05161 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). Reviewer: Steve Noble (London) MSC: 05C85 05C10 68R10 05C83 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 1475.05161) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Decomposition of map graphs with applications. (English) Zbl 07561553 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 60, 15 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 60, 15 p. (2019; Zbl 07561553) Full Text: DOI arXiv
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket Minimum bisection is fixed-parameter tractable. (English) Zbl 1421.68069 SIAM J. Comput. 48, No. 2, 417-450 (2019). MSC: 68Q25 68R10 68W05 PDFBibTeX XMLCite \textit{M. Cygan} et al., SIAM J. Comput. 48, No. 2, 417--450 (2019; Zbl 1421.68069) Full Text: DOI Link
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav Reducing CMSO model checking to highly connected graphs. (English) Zbl 1499.68203 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018). MSC: 68Q60 03B70 68Q27 68R10 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018; Zbl 1499.68203) Full Text: DOI arXiv
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav Erdős-Pósa property of obstructions to interval graphs. (English) Zbl 1490.05205 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 7, 15 p. (2018). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{A. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 7, 15 p. (2018; Zbl 1490.05205) Full Text: DOI
Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Parameterised algorithms for deletion to classes of DAGs. (English) Zbl 1430.68170 Theory Comput. Syst. 62, No. 8, 1880-1909 (2018). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Theory Comput. Syst. 62, No. 8, 1880--1909 (2018; Zbl 1430.68170) 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
Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Kernels for deletion to classes of acyclic digraphs. (English) Zbl 1380.68207 J. Comput. Syst. Sci. 92, 9-21 (2018). MSC: 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{A. Agrawal} et al., J. Comput. Syst. Sci. 92, 9--21 (2018; Zbl 1380.68207) Full Text: DOI Link
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket Hitting forbidden minors: approximation and kernelization. (English) Zbl 1336.68123 SIAM J. Discrete Math. 30, No. 1, 383-410 (2016). MSC: 68Q25 05C83 05C85 68R10 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 30, No. 1, 383--410 (2016; Zbl 1336.68123) Full Text: DOI Link
Rai, Ashutosh; Saurabh, Saket Bivariate complexity analysis of Almost Forest Deletion. (English) Zbl 1465.68109 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, 133-144 (2015). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Rai} and \textit{S. Saurabh}, Lect. Notes Comput. Sci. 9198, 133--144 (2015; Zbl 1465.68109) 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
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
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. (English) Zbl 1276.05091 J. Graph Theory 74, No. 3-4, 417-424 (2013). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Graph Theory 74, No. 3--4, 417--424 (2013; Zbl 1276.05091) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket Bidimensionality and geometric graphs. (English) Zbl 1421.68126 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1563-1575 (2012). MSC: 68R10 05C62 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1563--1575 (2012; Zbl 1421.68126) Full Text: Link
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Linear kernels for (connected) dominating set on \(H\)-minor-free graphs. (English) Zbl 1421.68078 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82-93 (2012). MSC: 68Q25 05C69 05C83 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82--93 (2012; Zbl 1421.68078) Full Text: Link
Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket Sharp separation and applications to exact and parameterized algorithms. (English) Zbl 1236.68090 Algorithmica 63, No. 3, 692-706 (2012). MSC: 68Q17 05C85 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 63, No. 3, 692--706 (2012; Zbl 1236.68090) Full Text: DOI
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
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket Implicit branching and parameterized partial cover problems. (English) Zbl 1245.05124 J. Comput. Syst. Sci. 77, No. 6, 1159-1171 (2011). MSC: 05C85 90C27 PDFBibTeX XMLCite \textit{O. Amini} et al., J. Comput. Syst. Sci. 77, No. 6, 1159--1171 (2011; Zbl 1245.05124) Full Text: DOI
Fomin, Fedor V.; Saurabh, Saket; Thilikos, Dimitrios M. Strengthening Erdős – Pósa property for minor-closed graph classes. (English) Zbl 1216.05148 J. Graph Theory 66, No. 3, 235-240 (2011). MSC: 05C83 05C75 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Graph Theory 66, No. 3, 235--240 (2011; Zbl 1216.05148) Full Text: DOI
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket The complexity ecology of parameters: An illustration using bounded max leaf number. (English) Zbl 1184.05123 Theory Comput. Syst. 45, No. 4, 822-848 (2009). MSC: 05C85 68Q10 68Q25 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theory Comput. Syst. 45, No. 4, 822--848 (2009; Zbl 1184.05123) Full Text: DOI
Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket Better algorithms and bounds for directed maximum leaf problems. (English) Zbl 1135.90416 Arvind, V. (ed.) et al., FSTTCS 2007: Foundations of software technology and theoretical computer science. 27th international conference, New Delhi, India, December 12–14, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77049-7/pbk). Lecture Notes in Computer Science 4855, 316-327 (2007). MSC: 90C35 68Q25 05C85 PDFBibTeX XMLCite \textit{N. Alon} et al., Lect. Notes Comput. Sci. 4855, 316--327 (2007; Zbl 1135.90416) Full Text: DOI