Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601 SIAM J. Discrete Math. 36, No. 3, 1761-1787 (2022). MSC: 68Q27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 36, No. 3, 1761--1787 (2022; Zbl 07572601) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian Token sliding on split graphs. (English) Zbl 1517.68273 Theory Comput. Syst. 65, No. 4, 662-686 (2021). MSC: 68R10 05C69 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Theory Comput. Syst. 65, No. 4, 662--686 (2021; Zbl 1517.68273) Full Text: DOI arXiv
Belmonte, Rémy; Sau, Ignasi On the complexity of finding large odd induced subgraphs and odd colorings. (English) Zbl 1515.68224 Algorithmica 83, No. 8, 2351-2373 (2021). MSC: 68R10 05C15 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{I. Sau}, Algorithmica 83, No. 8, 2351--2373 (2021; Zbl 1515.68224) Full Text: DOI arXiv
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153 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 14, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020; Zbl 07651153) Full Text: DOI
Belmonte, Rémy; Sau, Ignasi On the complexity of finding large odd induced subgraphs and odd colorings. (English) Zbl 07636196 Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 67-79 (2020). MSC: 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{I. Sau}, Lect. Notes Comput. Sci. 12301, 67--79 (2020; Zbl 07636196) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07600997 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 43-55 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 12126, 43--55 (2020; Zbl 07600997) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Independent set reconfiguration parameterized by modular-width. (English) Zbl 1453.68124 Algorithmica 82, No. 9, 2586-2605 (2020). MSC: 68R10 05C69 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 82, No. 9, 2586--2605 (2020; Zbl 1453.68124) Full Text: DOI arXiv
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Parameterized (approximate) defective coloring. (English) Zbl 1433.68178 SIAM J. Discrete Math. 34, No. 2, 1084-1106 (2020). MSC: 68Q27 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 34, No. 2, 1084--1106 (2020; Zbl 1433.68178) Full Text: DOI
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian Token sliding on split graphs. (English) Zbl 1517.68274 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 13, 17 p. (2019). MSC: 68R10 05C69 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 13, 17 p. (2019; Zbl 1517.68274) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Independent set reconfiguration parameterized by modular-width. (English) Zbl 1453.68123 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 285-297 (2019). MSC: 68R10 05C69 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 11789, 285--297 (2019; Zbl 1453.68123) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1525.68090 Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11485, 38-49 (2019). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 11485, 38--49 (2019; Zbl 1525.68090) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Kim, Eun Jung; Lampis, Michael New results on directed edge dominating set. (English) Zbl 1512.68191 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018). MSC: 68R10 05C20 05C69 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 67, 16 p. (2018; Zbl 1512.68191) Full Text: DOI arXiv
Belmonte, Rémy; Khosravian Ghadikolaei, Mehdi; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota How bad is the freedom to Flood-It? (English) Zbl 1489.05102 Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 100, Article 5, 13 p. (2018). MSC: 05C57 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 100, Article 5, 13 p. (2018; Zbl 1489.05102) Full Text: DOI
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Parameterized (approximate) defective coloring. (English) Zbl 1487.68134 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 10, 15 p. (2018). MSC: 68Q27 05C15 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 10, 15 p. (2018; Zbl 1487.68134) Full Text: DOI arXiv
Belmonte, Rémy; Lampis, Michael; Mitsou, Valia Defective coloring on classes of perfect graphs. (English) Zbl 1483.05172 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, 113-126 (2017). MSC: 05C85 05C15 05C17 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 10520, 113--126 (2017; Zbl 1483.05172) Full Text: DOI arXiv
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
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
Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël Parameterized complexity of three edge contraction problems with degree constraints. (English) Zbl 1360.68489 Acta Inf. 51, No. 7, 473-497 (2014). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Acta Inf. 51, No. 7, 473--497 (2014; Zbl 1360.68489) Full Text: DOI Link
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël Detecting fixed patterns in chordal graphs in polynomial time. (English) Zbl 1291.68173 Algorithmica 69, No. 3, 501-521 (2014). MSC: 68Q17 68Q25 68R10 05C83 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 69, No. 3, 501--521 (2014; Zbl 1291.68173) Full Text: DOI Link
Belmonte, Rémy; Vatshelle, Martin Graph classes with structured neighborhoods and algorithmic applications. (English) Zbl 1408.68109 Theor. Comput. Sci. 511, 54-65 (2013). MSC: 68R10 05C70 05C75 05C85 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{M. Vatshelle}, Theor. Comput. Sci. 511, 54--65 (2013; Zbl 1408.68109) Full Text: DOI Backlinks: MO
Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël Parameterized complexity of two edge contraction problems with degree constraints. (English) Zbl 1360.68488 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, 16-27 (2013). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 8246, 16--27 (2013; Zbl 1360.68488) Full Text: DOI Link
Belmonte, Rémy; van ’t Hof, Pim; Kamiński, Marcin Induced immersions. (English) Zbl 1260.05154 Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 299-308 (2012). MSC: 05C85 05C76 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 7676, 299--308 (2012; Zbl 1260.05154) Full Text: DOI
Belmonte, Rémy; Vatshelle, Martin Graph classes with structured neighborhoods and algorithmic applications. (English) Zbl 1341.05218 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 47-58 (2011). MSC: 05C75 05C69 05C15 05C22 05C35 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{M. Vatshelle}, Lect. Notes Comput. Sci. 6986, 47--58 (2011; Zbl 1341.05218) Full Text: DOI
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël Finding contractions and induced minors in chordal graphs via disjoint paths. (English) Zbl 1350.68129 Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 110-119 (2011). MSC: 68Q25 05C38 05C62 05C83 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 7074, 110--119 (2011; Zbl 1350.68129) Full Text: DOI
Belmonte, Rémy; Heggernes, Pinar; van ’t Hof, Pim Edge contractions in subclasses of chordal graphs. (English) Zbl 1331.68097 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 528-539 (2011). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 6648, 528--539 (2011; Zbl 1331.68097) Full Text: DOI