Rémy Belmonte

57 papers A 3B 10C 4Misc 2Journal 36Unranked 2

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