Fomin, Fedor V.; Golovach, Petr A.; Inamdar, Tanmay; Koana, Tomohiro FPT approximation and subexponential algorithms for covering few or many edges. (English) Zbl 07817066 Inf. Process. Lett. 185, Article ID 106471, 6 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 185, Article ID 106471, 6 p. (2024; Zbl 07817066) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket Diverse collections in matroids and graphs. (English) Zbl 07807814 Math. Program. 204, No. 1-2 (A), 415-447 (2024). MSC: 68Q27 05B35 05C70 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Math. Program. 204, No. 1--2 (A), 415--447 (2024; Zbl 07807814) Full Text: DOI arXiv OA License
Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Purohit, Nidhi; Simonov, Kirill How to find a good explanation for clustering? (English) Zbl 07732223 Artif. Intell. 322, Article ID 103948, 20 p. (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Artif. Intell. 322, Article ID 103948, 20 p. (2023; Zbl 07732223) Full Text: DOI arXiv
Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi; Simonov, Kirill Lossy kernelization of same-size clustering. (English) Zbl 07729118 Theory Comput. Syst. 67, No. 4, 785-824 (2023). MSC: 68Wxx 68Qxx 05Cxx PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Theory Comput. Syst. 67, No. 4, 785--824 (2023; Zbl 07729118) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (English) Zbl 07713421 Inf. Comput. 293, Article ID 105049, 21 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Comput. 293, Article ID 105049, 21 p. (2023; Zbl 07713421) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill Detours in directed graphs. (English) Zbl 07709776 J. Comput. Syst. Sci. 137, 66-86 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 137, 66--86 (2023; Zbl 07709776) Full Text: DOI arXiv
Crespelle, Christophe; Drange, Pål Grønås; Fomin, Fedor V.; Golovach, Petr A survey of parameterized algorithms and the complexity of edge modification. (English) Zbl 07698754 Comput. Sci. Rev. 48, Article ID 100556, 31 p. (2023). MSC: 68-02 68-XX PDFBibTeX XMLCite \textit{C. Crespelle} et al., Comput. Sci. Rev. 48, Article ID 100556, 31 p. (2023; Zbl 07698754) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi Parameterized complexity of categorical clustering with size constraints. (English) Zbl 07695015 J. Comput. Syst. Sci. 136, 171-194 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 136, 171--194 (2023; Zbl 07695015) Full Text: DOI
Fomin, Fedor V.; Sagunov, Danil; Simonov, Kirill Building large \(k\)-cores from sparse graphs. (English) Zbl 07639678 J. Comput. Syst. Sci. 132, 68-88 (2023). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 132, 68--88 (2023; Zbl 07639678) Full Text: DOI
Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi; Siminov, Kirill Lossy kernelization of same-size clustering. (English) Zbl 07615733 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, 96-114 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Lect. Notes Comput. Sci. 13296, 96--114 (2022; Zbl 07615733) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani Parameterized complexity of directed spanner problems. (English) Zbl 07567464 Algorithmica 84, No. 8, 2292-2308 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 84, No. 8, 2292--2308 (2022; Zbl 07567464) Full Text: DOI
Fomin, Fedor V.; Ramamoorthi, Vijayaragunathan On the parameterized complexity of the expected coverage problem. (English) Zbl 07523541 Theory Comput. Syst. 66, No. 2, 432-453 (2022). MSC: 68Qxx 05Cxx 90Bxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{V. Ramamoorthi}, Theory Comput. Syst. 66, No. 2, 432--453 (2022; Zbl 07523541) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (English) Zbl 07538586 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 308-320 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 12911, 308--320 (2021; Zbl 07538586) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A. Kernelization of Whitney switches. (English) Zbl 1467.05253 SIAM J. Discrete Math. 35, No. 2, 1298-1336 (2021). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, SIAM J. Discrete Math. 35, No. 2, 1298--1336 (2021; Zbl 1467.05253) Full Text: DOI arXiv
Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter Kernelization of graph Hamiltonicity: proper \(H\)-graphs. (English) Zbl 1476.68198 SIAM J. Discrete Math. 35, No. 2, 840-892 (2021). MSC: 68R10 05C45 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{S. Chaplick} et al., SIAM J. Discrete Math. 35, No. 2, 840--892 (2021; Zbl 1476.68198) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill Parameterized \(k\)-clustering: tractability island. (English) Zbl 1477.68132 J. Comput. Syst. Sci. 117, 50-74 (2021). MSC: 68Q27 62H30 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 117, 50--74 (2021; Zbl 1477.68132) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Jaffke, Lars; Philip, Geevarghese; Sagunov, Danil Diverse pairs of matchings. (English) Zbl 07765384 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 26, 12 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 26, 12 p. (2020; Zbl 07765384) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani Parameterized complexity of directed spanner problems. (English) Zbl 07764103 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 12, 11 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 12, 11 p. (2020; Zbl 07764103) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 07651188 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 49, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 49, 17 p. (2020; Zbl 07651188) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A. Kernelization of Whitney switches. (English) Zbl 07651187 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 48, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 48, 19 p. (2020; Zbl 07651187) Full Text: DOI
Fomin, Fedor V.; Ramamoorthi, Vijayaragunathan On the parameterized complexity of the expected coverage problem. (English) Zbl 07603924 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, 224-236 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{V. Ramamoorthi}, Lect. Notes Comput. Sci. 12159, 224--236 (2020; Zbl 07603924) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad Parameterized low-rank binary matrix approximation. (English) Zbl 1458.68075 Data Min. Knowl. Discov. 34, No. 2, 478-532 (2020). MSC: 68Q27 15A60 15B34 62H30 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Data Min. Knowl. Discov. 34, No. 2, 478--532 (2020; Zbl 1458.68075) Full Text: DOI arXiv Link
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.; Golovach, Petr A.; Raymond, Jean-Florent On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 1447.05142 Algorithmica 82, No. 9, 2432-2473 (2020). MSC: 05C62 05C85 05C69 68Q17 90C27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 9, 2432--2473 (2020; Zbl 1447.05142) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. On the parameterized complexity of graph modification to first-order logic properties. (English) Zbl 1434.68208 Theory Comput. Syst. 64, No. 2, 251-271 (2020). MSC: 68Q27 68Q19 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theory Comput. Syst. 64, No. 2, 251--271 (2020; Zbl 1434.68208) Full Text: DOI arXiv
Meybodi, Mohsen Alambardar; Fomin, Fedor V.; Mouawad, Amer E.; Panolan, Fahad On the parameterized complexity of \([1,j]\)-domination problems. (English) Zbl 1436.68147 Theor. Comput. Sci. 804, 207-218 (2020). MSC: 68Q27 05C69 68Q17 68R10 PDFBibTeX XMLCite \textit{M. A. Meybodi} et al., Theor. Comput. Sci. 804, 207--218 (2020; Zbl 1436.68147) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav Covering vectors by spaces in perturbed graphic matroids and their duals. (English) Zbl 07561552 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 59, 13 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 59, 13 p. (2019; Zbl 07561552) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Finding, hitting and packing cycles in subexponential time on unit disk graphs. (English) Zbl 1441.68178 Discrete Comput. Geom. 62, No. 4, 879-911 (2019). MSC: 68R10 05C62 68Q27 68U05 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Comput. Geom. 62, No. 4, 879--911 (2019; Zbl 1441.68178) Full Text: DOI Link
Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John A fixed-parameter perspective on #BIS. (English) Zbl 1430.68185 Algorithmica 81, No. 10, 3844-3864 (2019). MSC: 68R10 05C69 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Curticapean} et al., Algorithmica 81, No. 10, 3844--3864 (2019; Zbl 1430.68185) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket Editing to connected \(f\)-degree graph. (English) Zbl 1429.68189 SIAM J. Discrete Math. 33, No. 2, 795-836 (2019). MSC: 68R10 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 33, No. 2, 795--836 (2019; Zbl 1429.68189) Full Text: DOI
Fomin, Fedor V.; Pilipczuk, Michał On width measures and topological problems on semi-complete digraphs. (English) Zbl 1415.05063 J. Comb. Theory, Ser. B 138, 78-165 (2019). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{M. Pilipczuk}, J. Comb. Theory, Ser. B 138, 78--165 (2019; Zbl 1415.05063) Full Text: DOI Link
Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1404.05208 SIAM J. Discrete Math. 33, No. 1, 327-345 (2019). MSC: 05C85 05C22 05C40 68Q25 68W05 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 33, No. 1, 327--345 (2019; Zbl 1404.05208) Full Text: DOI
Alambardar, Meybodi Mohsen; Fomin, Fedor; Mouawad, Amer E.; Panolan, Fahad On the parameterized complexity of \([1,j]\)-domination problems. (English) Zbl 1528.68264 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 34, 14 p. (2018). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{M. M. Alambardar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 122, Article 34, 14 p. (2018; Zbl 1528.68264) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 1524.68228 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 30, 14 p. (2018). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 30, 14 p. (2018; Zbl 1524.68228) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad Parameterized low-rank binary matrix approximation. (English) Zbl 1499.68151 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 53, 16 p. (2018). MSC: 68Q27 15A60 15B34 62H30 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 53, 16 p. (2018; Zbl 1499.68151) Full Text: DOI
Curticapean, Radu; Dell, Holger; Fomin, Fedor V.; Goldberg, Leslie Ann; Lapinskas, John A fixed-parameter perspective on #BIS. (English) Zbl 1443.68125 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 13, 13 p. (2018). MSC: 68R10 05C69 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Curticapean} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 13, 13 p. (2018; Zbl 1443.68125) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Structured connectivity augmentation. (English) Zbl 1400.05134 SIAM J. Discrete Math. 32, No. 4, 2612-2635 (2018). MSC: 05C40 05C85 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 32, No. 4, 2612--2635 (2018; Zbl 1400.05134) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Covering vectors by spaces: regular matroids. (English) Zbl 1400.05045 SIAM J. Discrete Math. 32, No. 4, 2512-2565 (2018). MSC: 05B35 68R05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 32, No. 4, 2512--2565 (2018; Zbl 1400.05045) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Meesum, S. M.; Saurabh, Saket; Zehavi, Meirav Matrix rigidity from the viewpoint of parameterized complexity. (English) Zbl 1394.68177 SIAM J. Discrete Math. 32, No. 2, 966-985 (2018). Reviewer: Gema Maria Diaz Toca (Murcia) MSC: 68Q25 05C50 15A03 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 32, No. 2, 966--985 (2018; Zbl 1394.68177) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Structured connectivity augmentation. (English) Zbl 1441.05125 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 29, 13 p. (2017). MSC: 05C40 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 29, 13 p. (2017; Zbl 1441.05125) Full Text: DOI
Bliznets, Ivan; Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S.; Saurabh, Saket Parameterized complexity of superstring problems. (English) Zbl 1380.68217 Algorithmica 79, No. 3, 798-813 (2017). MSC: 68Q25 68W32 PDFBibTeX XMLCite \textit{I. Bliznets} et al., Algorithmica 79, No. 3, 798--813 (2017; Zbl 1380.68217) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S. Parameterized complexity of secluded connectivity problems. (English) Zbl 1378.68075 Theory Comput. Syst. 61, No. 3, 795-819 (2017). MSC: 68Q25 05C40 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theory Comput. Syst. 61, No. 3, 795--819 (2017; Zbl 1378.68075) Full Text: DOI arXiv Link
Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. Metric dimension of bounded tree-length graphs. (English) Zbl 1371.68103 SIAM J. Discrete Math. 31, No. 2, 1217-1243 (2017). MSC: 68Q25 05C12 05C85 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 31, No. 2, 1217--1243 (2017; Zbl 1371.68103) Full Text: DOI arXiv
Chitnis, Rajesh; Fomin, Fedor V.; Golovach, Petr A. Parameterized complexity of the anchored \(k\)-core problem for directed graphs. (English) Zbl 1336.68119 Inf. Comput. 247, 11-22 (2016). MSC: 68Q25 05C20 PDFBibTeX XMLCite \textit{R. Chitnis} et al., Inf. Comput. 247, 11--22 (2016; Zbl 1336.68119) Full Text: DOI arXiv
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
Fomin, Fedor V.; Heggernes, Pinar; van Leeuwen, Erik Jan The firefighter problem on graph classes. (English) Zbl 1333.05290 Theor. Comput. Sci. 613, 38-50 (2016). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 613, 38--50 (2016; Zbl 1333.05290) Full Text: DOI
Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1433.05299 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 494-505 (2015). MSC: 05C85 05C22 05C40 68Q25 68W05 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 9134, 494--505 (2015; Zbl 1433.05299) Full Text: DOI Link
Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. Metric dimension of bounded width graphs. (English) Zbl 1466.68054 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 115-126 (2015). MSC: 68R10 05C12 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 9235, 115--126 (2015; Zbl 1466.68054) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Nederlof, Jesper; Pilipczuk, Michał Minimizing Rosenthal potential in multicast games. (English) Zbl 1329.68041 Theory Comput. Syst. 57, No. 1, 81-96 (2015). MSC: 68M10 68M12 91A10 91A43 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theory Comput. Syst. 57, No. 1, 81--96 (2015; Zbl 1329.68041) Full Text: DOI
Bliznets, Ivan; Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S.; Saurabh, Saket Parameterized complexity of superstring problems. (English) Zbl 1380.68216 Cicalese, Ferdinando (ed.) et al., Combinatorial pattern matching. 26th annual symposium, CPM 2015, Ischia Island, Italy, June 29 – July 1, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19928-3/pbk; 978-3-319-19929-0/ebook). Lecture Notes in Computer Science 9133, 89-99 (2015). MSC: 68Q25 68W32 PDFBibTeX XMLCite \textit{I. Bliznets} et al., Lect. Notes Comput. Sci. 9133, 89--99 (2015; Zbl 1380.68216) Full Text: DOI arXiv
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve Minimum fill-in of sparse graphs: kernelization and approximation. (English) Zbl 1310.68106 Algorithmica 71, No. 1, 1-20 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 68Q25 05C10 05C85 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 71, No. 1, 1--20 (2015; Zbl 1310.68106) Full Text: DOI Link
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
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve Tight bounds for parameterized complexity of cluster editing with a small number of clusters. (English) Zbl 1311.68076 J. Comput. Syst. Sci. 80, No. 7, 1430-1447 (2014). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 80, No. 7, 1430--1447 (2014; Zbl 1311.68076) Full Text: DOI
Fomin, Fedor V.; Villanger, Yngve Searching for better fill-in. (English) Zbl 1311.68077 J. Comput. Syst. Sci. 80, No. 7, 1374-1383 (2014). MSC: 68Q25 05C62 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, J. Comput. Syst. Sci. 80, No. 7, 1374--1383 (2014; Zbl 1311.68077) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor V.; van Leeuwen, Erik Jan Parameterized complexity of firefighting. (English) Zbl 1411.68046 J. Comput. Syst. Sci. 80, No. 7, 1285-1297 (2014). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Comput. Syst. Sci. 80, No. 7, 1285--1297 (2014; Zbl 1411.68046) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A. Parameterized complexity of connected even/odd subgraph problems. (English) Zbl 1311.68075 J. Comput. Syst. Sci. 80, No. 1, 157-179 (2014). MSC: 68Q25 05C45 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, J. Comput. Syst. Sci. 80, No. 1, 157--179 (2014; Zbl 1311.68075) Full Text: DOI Link
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał Preprocessing subgraph and minor problems: when does a small vertex cover help? (English) Zbl 1277.68095 J. Comput. Syst. Sci. 80, No. 2, 468-495 (2014). MSC: 68Q25 05C85 05C70 05C15 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 80, No. 2, 468--495 (2014; Zbl 1277.68095) Full Text: DOI arXiv
Fomin, Fedor V.; Villanger, Yngve Subexponential parameterized algorithm for minimum fill-in. (English) Zbl 1421.68061 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). 1737-1746 (2012). MSC: 68Q17 05C85 68Q25 68R10 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, 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). 1737--1746 (2012; Zbl 1421.68061) 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.; Marx, Dániel FPT suspects and tough customers: open problems of Downey and Fellows. (English) Zbl 1358.68132 Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 457-468 (2012). MSC: 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{D. Marx}, Lect. Notes Comput. Sci. 7370, 457--468 (2012; Zbl 1358.68132) Full Text: DOI
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Catalan structures and dynamic programming in \(H\)-minor-free graphs. (English) Zbl 1244.05215 J. Comput. Syst. Sci. 78, No. 5, 1606-1622 (2012). MSC: 05C85 05C83 90C39 68Q25 PDFBibTeX XMLCite \textit{F. Dorn} et al., J. Comput. Syst. Sci. 78, No. 5, 1606--1622 (2012; Zbl 1244.05215) Full Text: DOI
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve Local search: is brute-force avoidable? (English) Zbl 1244.68070 J. Comput. Syst. Sci. 78, No. 3, 707-719 (2012). MSC: 68T20 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 78, No. 3, 707--719 (2012; Zbl 1244.68070) Full Text: DOI
Cygan, Marek; Fomin, Fedor V.; van Leeuwen, Erik Jan Parameterized complexity of firefighting revisited. (English) Zbl 1352.68098 Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 13-26 (2012). MSC: 68Q25 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Cygan} et al., Lect. Notes Comput. Sci. 7112, 13--26 (2012; Zbl 1352.68098) Full Text: DOI arXiv
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
Dragan, Feodor F.; Fomin, Fedor V.; Golovach, Petr A. Spanners in sparse graphs. (English) Zbl 1234.68149 J. Comput. Syst. Sci. 77, No. 6, 1108-1119 (2011). MSC: 68Q25 05C12 05C85 PDFBibTeX XMLCite \textit{F. F. Dragan} et al., J. Comput. Syst. Sci. 77, No. 6, 1108--1119 (2011; Zbl 1234.68149) Full Text: DOI
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan Kernels for feedback arc set in tournaments. (English) Zbl 1235.05134 J. Comput. Syst. Sci. 77, No. 6, 1071-1078 (2011). Reviewer: Iain Moffatt (Mobile, AL) MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{S. Bessy} et al., J. Comput. Syst. Sci. 77, No. 6, 1071--1078 (2011; Zbl 1235.05134) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel Guard games on graphs: keep the intruder out! (English) Zbl 1227.68031 Theor. Comput. Sci. 412, No. 46, 6484-6497 (2011). MSC: 68Q17 91A24 91A43 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 412, No. 46, 6484--6497 (2011; Zbl 1227.68031) Full Text: DOI
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten On the complexity of some colorful problems parameterized by treewidth. (English) Zbl 1223.05070 Inf. Comput. 209, No. 2, 143-153 (2011). MSC: 05C15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Inf. Comput. 209, No. 2, 143--153 (2011; Zbl 1223.05070) Full Text: DOI Link
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket Parameterized algorithm for eternal vertex cover. (English) Zbl 1234.68150 Inf. Process. Lett. 110, No. 16, 702-706 (2010). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 110, No. 16, 702--706 (2010; Zbl 1234.68150) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Nisse, Nicolas; Suchan, Karol Pursuing a fast robber on a graph. (English) Zbl 1192.91027 Theor. Comput. Sci. 411, No. 7-9, 1167-1181 (2010). Reviewer: Giacomo Bonanno (Davis) MSC: 91A24 91A43 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 411, No. 7--9, 1167--1181 (2010; Zbl 1192.91027) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Sort and Search: exact algorithms for generalized domination. (English) Zbl 1197.05104 Inf. Process. Lett. 109, No. 14, 795-798 (2009). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 109, No. 14, 795--798 (2009; Zbl 1197.05104) Full Text: DOI
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M. Subexponential parameterized algorithms. (English) Zbl 1302.68340 Comput. Sci. Rev. 2, No. 1, 29-39 (2008). MSC: 68W40 68Q25 68R10 05C85 68-02 PDFBibTeX XMLCite \textit{F. Dorn} et al., Comput. Sci. Rev. 2, No. 1, 29--39 (2008; Zbl 1302.68340) Full Text: DOI
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429 Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 430-441 (2008). MSC: 68R10 68Q25 90C35 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 5193, 430--441 (2008; Zbl 1158.68429) Full Text: DOI
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve Improved algorithms for feedback vertex set problems. (English) Zbl 1152.68055 J. Comput. Syst. Sci. 74, No. 7, 1188-1198 (2008). MSC: 68W05 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{J. Chen} et al., J. Comput. Syst. Sci. 74, No. 7, 1188--1198 (2008; Zbl 1152.68055) 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
Fomin, Fedor V.; Kratsch, Dieter; Müller, Haiko Algorithms for graphs with small octopus. (English) Zbl 1032.05123 Discrete Appl. Math. 134, No. 1-3, 105-128 (2004). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Discrete Appl. Math. 134, No. 1--3, 105--128 (2004; Zbl 1032.05123) Full Text: DOI