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
Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. Combing a linkage in an annulus. (English) Zbl 1525.05029 SIAM J. Discrete Math. 37, No. 4, 2332-2364 (2023). MSC: 05C10 05C83 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 37, No. 4, 2332--2364 (2023; Zbl 1525.05029) Full Text: DOI arXiv
Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. Hitting topological minor models in planar graphs is fixed parameter tractable. (English) Zbl 07753174 ACM Trans. Algorithms 19, No. 3, Paper No. 23, 29 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{P. A. Golovach} et al., ACM Trans. Algorithms 19, No. 3, Paper No. 23, 29 p. (2023; Zbl 07753174) Full Text: DOI
Sam, Emmanuel; Fellows, Michael; Rosamond, Frances; Golovach, Petr A. On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves. (English) Zbl 07745718 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 353-367 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{E. Sam} et al., Lect. Notes Comput. Sci. 13898, 353--367 (2023; Zbl 07745718) Full Text: DOI
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
Golovach, Petr A.; Panolan, Fahad; Rai, Ashutosh; Saurabh, Saket Parameterized complexity of set-restricted disjoint paths on chordal graphs. (English) Zbl 07615736 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, 152-169 (2022). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 13296, 152--169 (2022; Zbl 07615736) 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
Golovach, Petr A. (ed.); Zehavi, Meirav (ed.) Special issue dedicated to the 16th international symposium on parameterized and exact computation. (English) Zbl 07608285 Algorithmica 84, No. 11, 3107-3109 (2022). MSC: 68Wxx 05Cxx 00Bxx PDFBibTeX XMLCite \textit{P. A. Golovach} (ed.) and \textit{M. Zehavi} (ed.), Algorithmica 84, No. 11, 3107--3109 (2022; Zbl 07608285) Full Text: DOI
Fomin, Fedor V.; Fraigniaud, Pierre; Golovach, Petr A. Present-biased optimization. (English) Zbl 1497.91088 Math. Soc. Sci. 119, 56-67 (2022). MSC: 91B06 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Math. Soc. Sci. 119, 56--67 (2022; Zbl 1497.91088) Full Text: DOI arXiv
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07575095 Theor. Comput. Sci. 930, 37-52 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Brause} et al., Theor. Comput. Sci. 930, 37--52 (2022; Zbl 07575095) 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
Golovach, Petr A.; Lima, Paloma T.; Papadopoulos, Charis Graph square roots of small distance from degree one graphs. (English) Zbl 1493.05082 Theory Comput. Syst. 66, No. 4, 821-846 (2022). MSC: 05C12 68Q27 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theory Comput. Syst. 66, No. 4, 821--846 (2022; Zbl 1493.05082) Full Text: DOI
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 1491.05074 Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022). MSC: 05C15 05C78 05C85 05C12 05C45 PDFBibTeX XMLCite \textit{C. Brause} et al., Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022; Zbl 1491.05074) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. Parameterized complexity of elimination distance to first-order logic properties. (English) Zbl 1505.03075 ACM Trans. Comput. Log. 23, No. 3, Article No. 17, 35 p. (2022). MSC: 03B70 03B10 68Q19 68Q27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Comput. Log. 23, No. 3, Article No. 17, 35 p. (2022; Zbl 1505.03075) Full Text: DOI arXiv
Crespelle, Christophe; Golovach, Petr A. Cyclability in graph classes. (English) Zbl 1485.05156 Discrete Appl. Math. 313, 147-178 (2022). MSC: 05C75 05C45 05C38 05C85 05A05 PDFBibTeX XMLCite \textit{C. Crespelle} and \textit{P. A. Golovach}, Discrete Appl. Math. 313, 147--178 (2022; Zbl 1485.05156) Full Text: DOI
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI arXiv
Golovach, Petr A.; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. (English) Zbl 1479.68002 J. Comput. Syst. Sci. 123, 76-102 (2022). Reviewer: Arne Meier (Hannover) MSC: 68Q27 05C70 05C85 68R05 68R10 68W05 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 123, 76--102 (2022; Zbl 1479.68002) Full Text: DOI arXiv
Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. arXiv:2211.01723 Preprint, arXiv:2211.01723 [cs.LO] (2022). MSC: 05C83 05C85 68R10 68W01 68Q19 03C13 68Q25 68Q27 BibTeX Cite \textit{P. A. Golovach} et al., ``Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes'', Preprint, arXiv:2211.01723 [cs.LO] (2022) Full Text: arXiv OA License
Dallard, Clément; Fomin, Fedor V.; Golovach, Petr A.; Korhonen, Tuukka; Milanič, Martin Computing Tree Decompositions with Small Independence Number. arXiv:2207.09993 Preprint, arXiv:2207.09993 [cs.DS] (2022). BibTeX Cite \textit{C. Dallard} et al., ``Computing Tree Decompositions with Small Independence Number'', Preprint, arXiv:2207.09993 [cs.DS] (2022) Full Text: arXiv OA License
Fomin, Fedor V.; Golovach, Petr A.; Sagunov, Danil; Simonov, Kirill Longest Cycle above Erdős-Gallai Bound. arXiv:2202.03061 Preprint, arXiv:2202.03061 [cs.DS] (2022). BibTeX Cite \textit{F. V. Fomin} et al., ``Longest Cycle above Erd\H{o}s-Gallai Bound'', Preprint, arXiv:2202.03061 [cs.DS] (2022) Full Text: arXiv OA License
Fomin, Fedor V.; Golovach, Petr A.; Inamdar, Tanmay; Saurabh, Saket ETH tight algorithms for geometric intersection graphs: now in polynomial space. (English) Zbl 07799599 Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 21, 16 p. (2021). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 213, Article 21, 16 p. (2021; Zbl 07799599) Full Text: DOI arXiv
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07788594 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 21, 14 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{C. Brause} et al., LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 21, 14 p. (2021; Zbl 07788594) Full Text: DOI
Eiben, Eduard; Fomin, Fedor V.; Golovach, Petr A.; Lochet, Willian; Panolan, Fahad; Simonov, Kirill EPTAS for k-means clustering of affine subspaces. (English) Zbl 07788495 Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2649-2659 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{E. Eiben} et al., in: Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10--13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2649--2659 (2021; Zbl 07788495) Full Text: DOI arXiv
Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill Parameterized complexity of feature selection for categorical data clustering. (English) Zbl 07724187 Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 14, 14 p. (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 202, Article 14, 14 p. (2021; Zbl 07724187) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Multiplicative parameterization above a guarantee. (English) Zbl 1495.68103 ACM Trans. Comput. Theory 13, No. 3, Paper No. 18, 16 p. (2021). MSC: 68Q27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Comput. Theory 13, No. 3, Paper No. 18, 16 p. (2021; Zbl 1495.68103) Full Text: DOI
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 07538588 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, 336-348 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Brause} et al., Lect. Notes Comput. Sci. 12911, 336--348 (2021; Zbl 07538588) Full Text: DOI arXiv
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.; Purohit, Nidhi Parameterized complexity of categorical clustering with size constraints. (English) Zbl 07498691 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 385-398 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 12808, 385--398 (2021; Zbl 07498691) Full Text: DOI arXiv
Golovach, Petr A. (ed.); Zehavi, Meirav (ed.) 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. (English) Zbl 1482.68023 LIPIcs – Leibniz International Proceedings in Informatics 214. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-216-7). xvii, 35 articles, not consecutively paged, electronic only, open access (2021). MSC: 68-06 68Q25 68Q27 68Wxx 00B25 PDFBibTeX XMLCite \textit{P. A. Golovach} (ed.) and \textit{M. Zehavi} (ed.), 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8--10, 2021. Wadern: Schloss Dagstuhl -- Leibniz Zentrum für Informatik (2021; Zbl 1482.68023) Full Text: DOI Link
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.; Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M. Compound Logics for Modification Problems. arXiv:2111.02755 Preprint, arXiv:2111.02755 [cs.DS] (2021). MSC: 05C83 05C85 68R10 68Q19 68Q27 68Q25 BibTeX Cite \textit{F. V. Fomin} et al., ``Compound Logics for Modification Problems'', Preprint, arXiv:2111.02755 [cs.DS] (2021) Full Text: arXiv OA License
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
Chaplick, Steven; Golovach, Petr A.; Hartmann, Tim A.; Knop, Dušan Recognizing proper tree-graphs. (English) Zbl 07764099 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 8, 15 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{S. Chaplick} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 8, 15 p. (2020; Zbl 07764099) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill Parameterized complexity of PCA (Invited talk). (English) Zbl 07759269 Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 1, 5 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 162, Article 1, 5 p. (2020; Zbl 07759269) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad; Simonov, Kirill Low-rank binary matrix approximation in column-sum norm. (English) Zbl 07758334 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 32, 18 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 32, 18 p. (2020; Zbl 07758334) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. An algorithmic meta-theorem for graph modification to planarity and FOL. (English) Zbl 07651190 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 51, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 51, 17 p. (2020; Zbl 07651190) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S. On the complexity of recovering incidence matrices. (English) Zbl 07651189 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 50, 13 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 50, 13 p. (2020; Zbl 07651189) 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.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Parameterization above a multiplicative guarantee. (English) Zbl 07650387 Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 39, 13 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 151, Article 39, 13 p. (2020; Zbl 07650387) Full Text: DOI
Golovach, Petr A.; Lima, Paloma T.; Papadopoulos, Charis Graph square roots of small distance from degree one graphs. (English) Zbl 07600769 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 116-128 (2020). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 12118, 116--128 (2020; Zbl 07600769) Full Text: DOI arXiv
Golovach, Petr A.; Krithika, R.; Sahu, Abhishek; Saurabh, Saket; Zehavi, Meirav Graph Hamiltonicity parameterized by proper interval deletion set. (English) Zbl 07600768 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 104-115 (2020). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 12118, 104--115 (2020; Zbl 07600768) Full Text: DOI
Golovach, Petr A.; Stamoulis, Giannos; Thilikos, Dimitrios M. Hitting topological minor models in planar graphs is fixed parameter tractable. (English) Zbl 07304079 Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 931-950 (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. A. Golovach} et al., in: Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5--8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 931--950 (2020; Zbl 07304079) Full Text: DOI arXiv
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.; 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
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
Golovach, Petr A.; Heggernes, Pinar; Lima, Paloma T.; Montealegre, Pedro Finding connected secluded subgraphs. (English) Zbl 1443.68130 J. Comput. Syst. Sci. 113, 101-124 (2020). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 113, 101--124 (2020; Zbl 1443.68130) Full Text: DOI Link
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis Parameterized aspects of strong subgraph closure. (English) Zbl 1442.68168 Algorithmica 82, No. 7, 2006-2038 (2020). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 82, No. 7, 2006--2038 (2020; Zbl 1442.68168) Full Text: DOI arXiv Link
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza Enumeration of minimal connected dominating sets for chordal graphs. (English) Zbl 1437.05104 Discrete Appl. Math. 278, 3-11 (2020). MSC: 05C30 05C69 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Discrete Appl. Math. 278, 3--11 (2020; Zbl 1437.05104) 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
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Approximation schemes for low-rank binary matrix approximation problems. (English) Zbl 1454.68180 ACM Trans. Algorithms 16, No. 1, Article No. 12, 39 p. (2020). MSC: 68W25 15A23 15B33 68W20 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 16, No. 1, Article No. 12, 39 p. (2020; Zbl 1454.68180) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill Parameterized \(k\)-clustering: tractability island. (English) Zbl 07650311 Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 14, 15 p. (2019). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 150, Article 14, 15 p. (2019; Zbl 07650311) Full Text: DOI
Crespelle, Christophe; Feghali, Carl; Golovach, Petr A. Cyclability in graph classes. (English) Zbl 07650249 Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 16, 13 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{C. Crespelle} et al., LIPIcs -- Leibniz Int. Proc. Inform. 149, Article 16, 13 p. (2019; Zbl 07650249) Full Text: DOI
Golovach, Petr A.; Thilikos, Dimitrios M. Clustering to given connectivities. (English) Zbl 07650226 Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 18, 17 p. (2019). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{P. A. Golovach} and \textit{D. M. Thilikos}, LIPIcs -- Leibniz Int. Proc. Inform. 148, Article 18, 17 p. (2019; Zbl 07650226) Full Text: DOI arXiv
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.; Golovach, Petr A.; Thilikos, Dimitrios M. Modification to planarity is fixed parameter tractable. (English) Zbl 07559137 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 28, 17 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 28, 17 p. (2019; Zbl 07559137) 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
Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter Kernelization of graph Hamiltonicity: proper \(H\)-graphs. (English) Zbl 1476.68197 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 296-310 (2019). MSC: 68R10 05C45 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 11646, 296--310 (2019; Zbl 1476.68197) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Spanning circuits in regular matroids. (English) Zbl 1454.68057 ACM Trans. Algorithms 15, No. 4, Article No. 52, 38 p. (2019). MSC: 68Q27 05B35 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 15, No. 4, Article No. 52, 38 p. (2019; Zbl 1454.68057) Full Text: DOI arXiv
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony Surjective \(H\)-colouring: new hardness results. (English) Zbl 1425.05055 Computability 8, No. 1, 27-42 (2019). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Computability 8, No. 1, 27--42 (2019; Zbl 1425.05055) Full Text: DOI
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
Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumeration and maximum number of minimal dominating sets for chordal graphs. (English) Zbl 1428.05139 Theor. Comput. Sci. 783, 41-52 (2019). MSC: 05C30 05C69 05C35 05C85 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 783, 41--52 (2019; Zbl 1428.05139) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumeration and maximum number of maximal irredundant sets for chordal graphs. (English) Zbl 1416.05267 Discrete Appl. Math. 265, 69-85 (2019). MSC: 05C85 05C30 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Discrete Appl. Math. 265, 69--85 (2019; Zbl 1416.05267) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. (English) Zbl 1421.68082 Algorithmica 81, No. 7, 2795-2828 (2019). MSC: 68Q25 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 81, No. 7, 2795--2828 (2019; Zbl 1421.68082) Full Text: DOI arXiv Link
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav Clique-width. III: Hamiltonian cycle and the odd case of graph coloring. (English) Zbl 1458.05245 ACM Trans. Algorithms 15, No. 1, Article No. 9, 27 p. (2019). MSC: 05C85 05C15 05C45 05C69 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 15, No. 1, Article No. 9, 27 p. (2019; Zbl 1458.05245) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Sayadi, Mohamed Yosri Enumeration of maximal irredundant sets for claw-free graphs. (English) Zbl 1409.05109 Theor. Comput. Sci. 754, 3-15 (2019). MSC: 05C30 05C85 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 754, 3--15 (2019; Zbl 1409.05109) Full Text: DOI
Golovach, Petr A.; Kolliopoulos, Stavros G.; Stamoulis, Giannos; Thilikos, Dimitrios M. WITHDRAWN: Planar Disjoint Paths in Linear Time. arXiv:1907.05940 Preprint, arXiv:1907.05940 [cs.DS] (2019); retraction notice ibid. MSC: 05C85 BibTeX Cite \textit{P. A. Golovach} et al., ``WITHDRAWN: Planar Disjoint Paths in Linear Time'', Preprint, arXiv:1907.05940 [cs.DS] (2019); retraction notice ibid. Full Text: arXiv OA License
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
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis Parameterized aspects of strong subgraph closure. (English) Zbl 1442.68169 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 23, 13 p. (2018). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 23, 13 p. (2018; Zbl 1442.68169) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Partial complementation of graphs. (English) Zbl 1477.68225 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 21, 13 p. (2018). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 21, 13 p. (2018; Zbl 1477.68225) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Lima, Paloma T.; Montealegre, Pedro Finding connected secluded subgraphs. (English) Zbl 1443.68129 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 18, 13 p. (2018). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 18, 13 p. (2018; Zbl 1443.68129) Full Text: DOI arXiv
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
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Computing square roots of graphs with low maximum degree. (English) Zbl 1395.05083 Discrete Appl. Math. 248, 93-101 (2018). MSC: 05C31 05C07 05C35 PDFBibTeX XMLCite \textit{M. Cochefert} et al., Discrete Appl. Math. 248, 93--101 (2018; Zbl 1395.05083) Full Text: DOI arXiv Link
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Finding cactus roots in polynomial time. (English) Zbl 1391.68052 Theory Comput. Syst. 62, No. 6, 1409-1426 (2018). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theory Comput. Syst. 62, No. 6, 1409--1426 (2018; Zbl 1391.68052) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. (English) Zbl 1383.05162 Algorithmica 80, No. 2, 714-741 (2018). MSC: 05C30 05C69 05C85 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 80, No. 2, 714--741 (2018; Zbl 1383.05162) Full Text: DOI arXiv
Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. (English) Zbl 1403.68164 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 262-273 (2018). MSC: 68R10 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 262--273 (2018; Zbl 1403.68164) Full Text: Link
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter Enumeration and maximum number of minimal connected vertex covers in graphs. (English) Zbl 1373.05008 Eur. J. Comb. 68, 132-147 (2018). MSC: 05A15 05C70 05C40 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Eur. J. Comb. 68, 132--147 (2018; Zbl 1373.05008) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Covering vectors by spaces: regular matroids. (English) Zbl 1441.68106 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 56, 15 p. (2017). MSC: 68Q27 05B35 68Q17 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 56, 15 p. (2017; Zbl 1441.68106) 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
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Spanning circuits in regular matroids. (English) Zbl 1410.68164 Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1433-1441 (2017). MSC: 68Q25 05B35 68Q17 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1433--1441 (2017; Zbl 1410.68164) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumeration and maximum number of maximal irredundant sets for chordal graphs. (English) Zbl 1483.05180 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 289-302 (2017). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10520, 289--302 (2017; Zbl 1483.05180) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. (English) Zbl 1421.68081 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 275-288 (2017). MSC: 68Q25 05C85 05C10 68R10 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10520, 275--288 (2017; Zbl 1421.68081) Full Text: DOI Link
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
Golovach, Petr A. Editing to a connected graph of given degrees. (English) Zbl 1376.68066 Inf. Comput. 256, 131-147 (2017). MSC: 68Q25 05C07 05C40 PDFBibTeX XMLCite \textit{P. A. Golovach}, Inf. Comput. 256, 131--147 (2017; Zbl 1376.68066) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony A linear kernel for finding square roots of almost planar graphs. (English) Zbl 1372.05052 Theor. Comput. Sci. 689, 36-47 (2017). MSC: 05C10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 689, 36--47 (2017; Zbl 1372.05052) Full Text: DOI arXiv Link
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony Surjective \(H\)-colouring: new hardness results. (English) Zbl 1489.68192 Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 270-281 (2017). MSC: 68R10 05C15 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10307, 270--281 (2017; Zbl 1489.68192) Full Text: DOI arXiv Link