Rémy Belmonte

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 42

Top Topics

Subgraph Isomorphism

Independent Set

Parameterized Complexity

Maximal Clique Enumeration

Top Venues

SIAM J. Discret. Math.

Publications

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023)
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
Odd Chromatic Number of Graph Classes. CoRR (2023)
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
Odd Chromatic Number of Graph Classes. WG (2023)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24 (2022)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36 (3) (2022)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. Theory Comput. Syst. 65 (4) (2021)
Rémy Belmonte, Ignasi Sau
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica 83 (8) (2021)
Rémy Belmonte, Ignasi Sau
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Rémy Belmonte, Ignasi Sau
On the complexity of finding large odd induced subgraphs and odd colorings. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24 (3) (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82 (9) (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. ESA (2020)
Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi
Edge Cover Problem in a Wide Sense. J. Inf. Process. 28 (2020)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34 (2) (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR (2019)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. STACS (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. CoRR (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CIAC (2019)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. WG (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. 23 (2) (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CoRR (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? CoRR (2018)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. CoRR (2018)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica 80 (1) (2018)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. MFCS (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. STACS (2018)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It?. FUN (2018)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Parameterized (Approximate) Defective Coloring. CoRR (2018)
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. WG (2017)
Rémy Belmonte, Michael Lampis, Valia Mitsou
Defective Coloring on Classes of Perfect Graphs. CoRR (2017)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217 (2017)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR (2016)
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Metric Dimension of Bounded Tree-length Graphs. CoRR (2016)
Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto
Polynomial-time approximability of the k-Sink Location problem. CoRR (2015)
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Metric Dimension of Bounded Width Graphs. MFCS (2) (2015)
Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
The Price of Connectivity for Feedback Vertex Set. CoRR (2015)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-width. WG (2015)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei
Graph classes and Ramsey numbers. Discret. Appl. Math. 173 (2014)
Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51 (7) (2014)
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69 (3) (2014)
Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) (2014)
Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC (2013)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
Characterizing graphs of small carving-width. Discret. Appl. Math. 161 (13-14) (2013)
Rémy Belmonte, Martin Vatshelle
Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511 (2013)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON (2012)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160 (7-8) (2012)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski
Induced Immersions. ISAAC (2012)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
Characterizing Graphs of Small Carving-Width. COCOA (2012)
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC (2011)
Rémy Belmonte, Martin Vatshelle
Graph Classes with Structured Neighborhoods and Algorithmic Applications. WG (2011)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
Edge Contractions in Subclasses of Chordal Graphs. TAMC (2011)
Rémy Belmonte, Martin Vatshelle
On graph classes with logarithmic boolean-width CoRR (2010)