Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. (English) Zbl 1390.68344 Algorithmica 80, No. 4, 1146-1169 (2018). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 80, No. 4, 1146--1169 (2018; Zbl 1390.68344) Full Text: DOI arXiv
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th. The many facets of upper domination. (English) Zbl 1388.68099 Theor. Comput. Sci. 717, 2-25 (2018). MSC: 68Q25 05C69 68W25 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Theor. Comput. Sci. 717, 2--25 (2018; Zbl 1388.68099) Full Text: DOI
Chapelle, Mathieu; Cochefert, Manfred; Kratsch, Dieter; Letourneur, Romain; Liedloff, Mathieu Exact exponential algorithms to find tropical connected sets of minimum size. (English) Zbl 1369.05190 Theor. Comput. Sci. 676, 33-41 (2017). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{M. Chapelle} et al., Theor. Comput. Sci. 676, 33--41 (2017; Zbl 1369.05190) Full Text: DOI
Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumerating minimal tropical connected sets. (English) Zbl 1450.05041 Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 217-228 (2017). MSC: 05C30 05C85 05C15 05C90 PDFBibTeX XMLCite \textit{D. Kratsch} et al., Lect. Notes Comput. Sci. 10139, 217--228 (2017; Zbl 1450.05041) Full Text: DOI
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve Treewidth and pathwidth parameterized by the vertex cover number. (English) Zbl 1350.68136 Discrete Appl. Math. 216, Part 1, 114-129 (2017). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{M. Chapelle} et al., Discrete Appl. Math. 216, Part 1, 114--129 (2017; Zbl 1350.68136) Full Text: DOI arXiv
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th. Upper domination: complexity and approximation. (English) Zbl 1478.68099 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 241-252 (2016). MSC: 68Q25 05C69 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Lect. Notes Comput. Sci. 9843, 241--252 (2016; Zbl 1478.68099) Full Text: DOI Link
Gaspers, Serge; Liedloff, Mathieu; Stein, Maya; Suchan, Karol Complexity of splits reconstruction for low-degree trees. (English) Zbl 1303.05028 Discrete Appl. Math. 180, 89-100 (2015). MSC: 05C05 05C07 05C60 05C85 05C90 92E10 68Q17 PDFBibTeX XMLCite \textit{S. Gaspers} et al., Discrete Appl. Math. 180, 89--100 (2015; Zbl 1303.05028) Full Text: DOI
Havet, Frédéric; Klazar, Martin; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Exact algorithms for \(L(2,1)\)-labeling of graphs. (English) Zbl 1213.68455 Algorithmica 59, No. 2, 169-194 (2011). MSC: 68R10 05C78 PDFBibTeX XMLCite \textit{F. Havet} et al., Algorithmica 59, No. 2, 169--194 (2011; Zbl 1213.68455) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket Iterative compression and exact algorithms. (English) Zbl 1186.68187 Theor. Comput. Sci. 411, No. 7-9, 1045-1053 (2010). MSC: 68P30 68Q17 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Theor. Comput. Sci. 411, No. 7--9, 1045--1053 (2010; Zbl 1186.68187) Full Text: DOI
Liedloff, Mathieu; Kloks, Ton; Liu, Jiping; Peng, Sheng-Lung Efficient algorithms for Roman domination on some classes of graphs. (English) Zbl 1180.05113 Discrete Appl. Math. 156, No. 18, 3400-3415 (2008). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{M. Liedloff} et al., Discrete Appl. Math. 156, No. 18, 3400--3415 (2008; Zbl 1180.05113) Full Text: DOI
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket Iterative compression and exact algorithms. (English) Zbl 1173.68537 Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 335-346 (2008). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Lect. Notes Comput. Sci. 5162, 335--346 (2008; Zbl 1173.68537) Full Text: DOI