On graph classes with logarithmic boolean-width - Rémy Belmonte; Martin Vatshelle (CoRR, 2010)

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. - Rémy Belmonte; Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (ISAAC, 2011)

Ramsey Numbers for Line Graphs and Perfect Graphs. - Rémy Belmonte; Pinar Heggernes; Pim van 't Hof; Reza Saei (COCOON, 2012)

Induced Immersions. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001 (ISAAC, 2012)

Edge contractions in subclasses of chordal graphs. - Rémy Belmonte; Pinar Heggernes; Pim van 't Hof (Discret. Appl. Math., 2012)

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. - Rémy Belmonte; Petr A. Golovach; Pim van 't Hof; Daniël Paulusma (IPEC, 2013)

Characterizing graphs of small carving-width. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Discret. Appl. Math., 2013)

Graph classes with structured neighborhoods and algorithmic applications. - Rémy Belmonte; Martin Vatshelle (Theor. Comput. Sci., 2013)

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. - Rémy Belmonte; Pim van 't Hof; Marcin Jakub Kaminski; Daniël Paulusma (MFCS (2), 2014)

Parameterized complexity of three edge contraction problems with degree constraints. - Rémy Belmonte; Petr A. Golovach; Pim van 't Hof; Daniël Paulusma (Acta Informatica, 2014)

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. - Rémy Belmonte; Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (Algorithmica, 2014)

Graph classes and Ramsey numbers. - Rémy Belmonte; Pinar Heggernes; Pim van 't Hof; Arash Rafiey; Reza Saei (Discret. Appl. Math., 2014)

Metric Dimension of Bounded Width Graphs. - Rémy Belmonte; Fedor V. Fomin; Petr A. Golovach; M. S. Ramanujan 001 (MFCS (2), 2015)

Polynomial-time approximability of the k-Sink Location problem. - Rémy Belmonte; Yuya Higashikawa; Naoki Katoh; Yoshio Okamoto (CoRR, 2015)

The price of connectivity for feedback vertex set. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (Discret. Appl. Math., 2017)

Metric Dimension of Bounded Tree-length Graphs. - Rémy Belmonte; Fedor V. Fomin; Petr A. Golovach; M. S. Ramanujan 001 (SIAM J. Discret. Math., 2017)

Induced Minor Free Graphs: Isomorphism and Clique-Width. - Rémy Belmonte; Yota Otachi; Pascal Schweitzer (Algorithmica, 2018)

How Bad is the Freedom to Flood-It? - Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi (J. Graph Algorithms Appl., 2019)

Independent Set Reconfiguration Parameterized by Modular-Width. - Rémy Belmonte; Tesshu Hanaka; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

K3 Edge Cover Problem in a Wide Sense. - Kyohei Chiba; Rémy Belmonte; Hiro Ito; Michael Lampis; Atsuki Nagao; Yota Otachi (J. Inf. Process., 2020)

Parameterized (Approximate) Defective Coloring. - Rémy Belmonte; Michael Lampis; Valia Mitsou (SIAM J. Discret. Math., 2020)

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. - Rémy Belmonte; Ignasi Sau (Algorithmica, 2021)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Defective Coloring on Classes of Perfect Graphs. - Rémy Belmonte; Michael Lampis; Valia Mitsou (Discret. Math. Theor. Comput. Sci., 2022)

Grundy Distinguishes Treewidth from Pathwidth. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi (SIAM J. Discret. Math., 2022)

New Results on Directed Edge Dominating Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Eun Jung Kim 002; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2023)

Odd chromatic number of graph classes. - Rémy Belmonte; Ararat Harutyunyan; Noleen Köhler; Nikolaos Melissinos (J. Graph Theory, 2025)