Rémy Belmonte

According to our database, Rémy Belmonte authored at least 29 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Odd Chromatic Number of Graph Classes.

Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2020

<i>K</i>₃ Edge Cover Problem in a Wide Sense.

Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi

J. Inf. Process., 2020

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings.

Rémy Belmonte, Ignasi Sau

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Parameterized Complexity of (A, ℓ )-Path Packing.

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Grundy Distinguishes Treewidth from Pathwidth.

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Independent Set Reconfiguration Parameterized by Modular-Width.

Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Token Sliding on Split Graphs.

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Parameterized Complexity of Safe Set.

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Parameterized (Approximate) Defective Coloring.

Rémy Belmonte, Michael Lampis, Valia Mitsou

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

New Results on Directed Edge Dominating Set.

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

How Bad is the Freedom to Flood-It?.

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Metric Dimension of Bounded Tree-length Graphs.

Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan

SIAM J. Discret. Math., 2017

The price of connectivity for feedback vertex set.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Discret. Appl. Math., 2017

Defective Coloring on Classes of Perfect Graphs.

Rémy Belmonte, Michael Lampis, Valia Mitsou

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015

Polynomial-time approximability of the k-Sink Location problem.

Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto

CoRR, 2015

Induced Minor Free Graphs: Isomorphism and Clique-width.

Rémy Belmonte, Yota Otachi, Pascal Schweitzer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Metric Dimension of Bounded Width Graphs.

Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Graph classes and Ramsey numbers.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei

Discret. Appl. Math., 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Algorithmica, 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

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

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Induced Immersions.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Ramsey Numbers for Line Graphs and Perfect Graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Characterizing Graphs of Small Carving-Width.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Graph Classes with Structured Neighborhoods and Algorithmic Applications.

Rémy Belmonte, Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Edge Contractions in Subclasses of Chordal Graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof

Proceedings of the Theory and Applications of Models of Computation, 2011

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, Daniël Paulusma

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

On graph classes with logarithmic boolean-width

Rémy Belmonte, Martin Vatshelle

CoRR, 2010