Agrawal, Akanksha; Knudsen, Kristine V. K.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav The parameterized complexity of guarding almost convex polygons. (English) Zbl 07802594 Discrete Comput. Geom. 71, No. 2, 358-398 (2024). MSC: 68-XX 65L10 65L12 65L20 65L70 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Discrete Comput. Geom. 71, No. 2, 358--398 (2024; Zbl 07802594) Full Text: DOI
Agrawal, Akanksha; Knudsen, Kristine V. K.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav The parameterized complexity of guarding almost convex polygons. (English) Zbl 07760132 Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 3, 16 p. (2020). MSC: 68U05 68Q25 68-06 68W25 PDFBibTeX XMLCite \textit{A. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 164, Article 3, 16 p. (2020; Zbl 07760132) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Going far from degeneracy. (English) Zbl 1451.05229 SIAM J. Discrete Math. 34, No. 3, 1587-1601 (2020). MSC: 05C85 05C12 05C38 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 34, No. 3, 1587--1601 (2020; Zbl 1451.05229) Full Text: DOI arXiv
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. (English) Zbl 1434.68748 Theory Comput. Syst. 64, No. 1, 62-100 (2020). MSC: 68W40 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Madathil} et al., Theory Comput. Syst. 64, No. 1, 62--100 (2020; Zbl 1434.68748) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Going far from degeneracy. (English) Zbl 07525484 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 47, 14 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 47, 14 p. (2019; Zbl 07525484) Full Text: DOI
Krithika, R.; Sahu, Abhishek; Saurabh, Saket; Zehavi, Meirav The parameterized complexity of cycle packing: indifference is not an issue. (English) Zbl 1429.68195 Algorithmica 81, No. 9, 3803-3841 (2019). MSC: 68R10 05C38 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Krithika} et al., Algorithmica 81, No. 9, 3803--3841 (2019; Zbl 1429.68195) Full Text: DOI
Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. (English) Zbl 1528.68311 Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 35, 19 p. (2018). MSC: 68R10 05C20 68Q27 PDFBibTeX XMLCite \textit{P. Misra} et al., LIPIcs -- Leibniz Int. Proc. Inform. 122, Article 35, 19 p. (2018; Zbl 1528.68311) Full Text: DOI
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; 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