Rémy Belmonte

Publications

Article dans une revue (11)

Grundy Distinguishes Treewidth from Pathwidth Rémy Belmonte,Eun Jung Kim,Michael Lampis,Valia Mitsou,Yota Otachi SIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1761-1787. ⟨10.1137/20M1385779⟩ Article dans une revue hal-03956253v1
Parameterized Complexity of $$(A,\ell )$$-Path Packing Rémy Belmonte,Tesshu Hanaka,Masaaki Kanzaki,Masashi Kiyomi,Yasuaki Kobayashiet al. Algorithmica, 2022, 84 (4), pp.871-895. ⟨10.1007/s00453-021-00875-y⟩ Article dans une revue hal-03848529v1
Defective Coloring on Classes of Perfect Graphs Rémy Belmonte,Michael Lampis,Valia Mitsou Discrete Mathematics and Theoretical Computer Science, 2022, 24 (1), pp.4926. ⟨10.46298/dmtcs.4926⟩ Article dans une revue hal-03848558v1
On the complexity of finding large odd induced subgraphs and odd colorings Rémy Belmonte,Ignasi Sau Algorithmica, 2021, 83 (8), pp.2351-2373. ⟨10.1007/s00453-021-00830-x⟩ Article dans une revue lirmm-03374591v1
Token Sliding on Split Graphs Rémy Belmonte,Eun Jung Kim,Michael Lampis,Valia Mitsou,Yota Otachiet al. Theory of Computing Systems, 2021, 65 (4), pp.662-686. ⟨10.1007/s00224-020-09967-8⟩ Article dans une revue hal-03457137v1
Parameterized (Approximate) Defective Coloring Rémy Belmonte,Michael Lampis,Valia Mitsou SIAM Journal on Discrete Mathematics, 2020, 34 (2), pp.1084-1106. ⟨10.1137/18M1223666⟩ Article dans une revue hal-03107738v1
&lt;i&gt;K&lt;/i&gt;&lt;sub&gt;3&lt;/sub&gt; Edge Cover Problem in a Wide Sense Kyohei Chiba,Rémy Belmonte,Hiro Ito,Michael Lampis,Atsuki Nagaoet al. Journal of Information Processing, 2020, 28, pp.849-858. ⟨10.2197/ipsjjip.28.849⟩ Article dans une revue hal-03107744v1
Parameterized Complexity of Safe Set Rémy Belmonte,Tesshu Hanaka,Ioannis Katsikarelis,Michael Lampis,Hirotaka Onoet al. Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.215-245. ⟨10.7155/jgaa.00528⟩ Article dans une revue hal-03107732v1
Independent Set Reconfiguration Parameterized by Modular-Width Rémy Belmonte,Tesshu Hanaka,Michael Lampis,Hirotaka Ono,Yota Otachi Algorithmica, 2020, 82 (9), pp.2586-2605. ⟨10.1007/s00453-020-00700-y⟩ Article dans une revue hal-03107726v1
How Bad is the Freedom to Flood-It? Rémy Belmonte,Mehdi Khosravian Ghadikolaei,Masashi Kiyomi,Michael Lampis,Yota Otachi Journal of Graph Algorithms and Applications, 2019, 23 (2), pp.111-134. ⟨10.7155/jgaa.00486⟩ Article dans une revue hal-02310396v1
Characterizing Graphs of Small Carving-Width Rémy Belmonte,Pim van 'T Hof,Marcin Kamiński,Daniël Paulusma,Dimitrios M. Thilikos Discrete Applied Mathematics, 2013, pp.Electronic Edition. ⟨10.1016/j.dam.2013.02.036⟩ Article dans une revue lirmm-00804730v1

Communication dans un congrès (12)

Odd Chromatic Number of Graph Classes Rémy Belmonte,Ararat Harutyunyan,Noleen Köhler,Nikolaos Melissinos 49th International Workshop Graph-Theoretic Concepts in Computer Science, Jun 2023, Fribourg, Switzerland. pp.44-58, ⟨10.1007/978-3-031-43380-1_4⟩ Communication dans un congrès hal-04324286v1
Parameterized Complexity of $$(A,\ell )$$-Path Packing Rémy Belmonte,Tesshu Hanaka,Masaaki Kanzaki,Masashi Kiyomi,Yasuaki Kobayashiet al. Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Jun 2020, Bordeaux, France. pp.43-55, ⟨10.1007/978-3-030-48966-3_4⟩ Communication dans un congrès hal-03966714v1
On the complexity of finding large odd induced subgraphs and odd colorings Rémy Belmonte,Ignasi Sau WG 2020 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2020, Leeds, United Kingdom. pp.67-79, ⟨10.1007/978-3-030-60440-0_6⟩ Communication dans un congrès lirmm-02991977v1
Grundy Distinguishes Treewidth from Pathwidth Rémy Belmonte,Eun Jung Kim,Michael Lampis,Valia Mitsou,Yota Otachi ESA 2020, Sep 2020, pisa, Italy. ⟨10.4230/LIPIcs.ESA.2020.38⟩ Communication dans un congrès hal-03107591v1
Parameterized Complexity of Safe Set Rémy Belmonte,Tesshu Hanaka,Ioannis Katsikarelis,Michael Lampis,Hirotaka Onoet al. 11th International Conference on Algorithms and Complexity (CIAC 2019), May 2019, Rome, Italy. pp.38-49, ⟨10.1007/978-3-030-17402-6_4⟩ Communication dans un congrès hal-02414438v1
Independent Set Reconfiguration Parameterized by Modular-Width Rémy Belmonte,Tesshu Hanaka,Michael Lampis,Hirotaka Ono,Yota Otachi 45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.285-297, ⟨10.1007/978-3-030-30786-8_22⟩ Communication dans un congrès hal-02414613v1
Token Sliding on Split Graphs Rémy Belmonte,Eun Jung Kim,Michael Lampis,Valia Mitsou,Yota Otachiet al. STACS 2019, Mar 2019, Berlin, Germany Communication dans un congrès hal-03107597v1
Parameterized (Approximate) Defective Coloring Rémy Belmonte,Michael Lampis,Valia Mitsou 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Feb 2018, Caen, France Communication dans un congrès hal-03966731v1
How Bad is the Freedom to Flood-It? Rémy Belmonte,Mehdi Khosravian Ghadikolaei,Masashi Kiyomi,Michael Lampis,Yota Otachi 9th International Conference on Fun with Algorithms, FUN 2018, Jun 2018, La Maddalena, Italy Communication dans un congrès hal-03966725v1
New Results on Directed Edge Dominating Set Rémy Belmonte,Tesshu Hanaka,Ioannis Katsikarelis,Eun Jung Kim,Michael Lampis 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.67⟩ Communication dans un congrès hal-03956298v1
Defective Coloring on Classes of Perfect Graphs Rémy Belmonte,Michael Lampis,Valia Mitsou 43rd International Workshop (WG 2017), Jul 2017, Eindhoven, Netherlands. pp.113-126, ⟨10.1007/978-3-319-68705-6_9⟩ Communication dans un congrès hal-02165868v1
Structure of W_4 -immersion free graphs Rémy Belmonte,Archontia C. Giannopoulou,Daniel Lokshtanov,Dimitrios M. Thilikos ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès hal-01084005v1