Gunda, Spoorthy; Jain, Pallavi; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar On the parameterized approximability of contraction to classes of chordal graphs. (English) Zbl 07758353 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 51, 19 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{S. Gunda} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 51, 19 p. (2020; Zbl 07758353) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav Kernelization. Theory of parameterized preprocessing. (English) Zbl 1426.68003 Cambridge: Cambridge University Press (ISBN 978-1-107-05776-0/hbk; 978-1-107-41515-7/ebook). xiv, 515 p. (2019). Reviewer: Efstratios Rappos (Aubonne) MSC: 68-02 68P01 68Q17 68Q25 68R10 68W01 90C27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Kernelization. Theory of parameterized preprocessing. Cambridge: Cambridge University Press (2019; Zbl 1426.68003) Full Text: DOI
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket Parameterized algorithms. (English) Zbl 1334.90001 Cham: Springer (ISBN 978-3-319-21274-6/hbk; 978-3-319-21275-3/ebook). xvii, 613 p. (2015). Reviewer: Paulo Mbunga (Kiel) MSC: 90-01 68-01 00A69 00-01 00A05 00A06 05-01 65K05 68Q25 90C60 90C39 PDFBibTeX XMLCite \textit{M. Cygan} et al., Parameterized algorithms. Cham: Springer (2015; Zbl 1334.90001) 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
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket On cutwidth parameterized by vertex cover. (English) Zbl 1303.05185 Algorithmica 68, No. 4, 940-953 (2014). MSC: 05C85 05C70 05C35 68Q25 90C35 PDFBibTeX XMLCite \textit{M. Cygan} et al., Algorithmica 68, No. 4, 940--953 (2014; Zbl 1303.05185) Full Text: DOI
Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel The fine details of fast dynamic programming over tree decompositions. (English) Zbl 1406.68067 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, 41-53 (2013). MSC: 68R10 05C05 05C70 05C85 68Q25 90C39 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 8246, 41--53 (2013; Zbl 1406.68067) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049 Algorithmica 65, No. 3, 584-604 (2013). MSC: 05C22 05C35 05C05 05C85 90C39 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 65, No. 3, 584--604 (2013; Zbl 1269.05049) Full Text: DOI
Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath On the directed full degree spanning tree problem. (English) Zbl 1248.90074 Discrete Optim. 8, No. 1, 97-109 (2011). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Discrete Optim. 8, No. 1, 97--109 (2011; Zbl 1248.90074) Full Text: DOI
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan Treewidth governs the complexity of target set selection. (English) Zbl 1248.90068 Discrete Optim. 8, No. 1, 87-96 (2011). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{O. Ben-Zwi} et al., Discrete Optim. 8, No. 1, 87--96 (2011; Zbl 1248.90068) Full Text: DOI
Lokshtanov, Daniel; Nederlof, Jesper Saving space by algebraization. (English) Zbl 1293.68148 Proceedings of the 42nd annual ACM symposium on theory of computing, STOC ’10. Cambridge, MA, USA, June 5–8, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-817-9). 321-330 (2010). MSC: 68Q17 68W05 68W40 90C27 90C39 PDFBibTeX XMLCite \textit{D. Lokshtanov} and \textit{J. Nederlof}, in: Proceedings of the 42nd annual ACM symposium on theory of computing, STOC '10. Cambridge, MA, USA, June 5--8, 2010. New York, NY: Association for Computing Machinery (ACM). 321--330 (2010; Zbl 1293.68148) Full Text: DOI
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket Graph layout problems parameterized by vertex cover. (English) Zbl 1183.68424 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, 294-305 (2008). MSC: 68R10 68Q25 90C35 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5369, 294--305 (2008; Zbl 1183.68424) Full Text: DOI Link