![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Rémy Belmonte
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]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) - [c21]Rémy Belmonte
, Ararat Harutyunyan, Noleen Köhler
, Nikolaos Melissinos
:
Odd Chromatic Number of Graph Classes. WG 2023: 44-58 - [i16]Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. CoRR abs/2303.03225 (2023) - 2022
- [j19]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): 871-895 (2022) - [j18]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j17]Rémy Belmonte, Eun Jung Kim
, Michael Lampis
, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36(3): 1761-1787 (2022) - 2021
- [j16]Rémy Belmonte, Ignasi Sau
:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica 83(8): 2351-2373 (2021) - [j15]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - 2020
- [j14]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono
, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82(9): 2586-2605 (2020) - [j13]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono
, Yota Otachi:
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24(3): 215-245 (2020) - [j12]Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao
, Yota Otachi:
K3 Edge Cover Problem in a Wide Sense. J. Inf. Process. 28: 849-858 (2020) - [j11]Rémy Belmonte, Michael Lampis
, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. SIAM J. Discret. Math. 34(2): 1084-1106 (2020) - [c20]Rémy Belmonte, Eun Jung Kim, Michael Lampis
, Valia Mitsou, Yota Otachi
:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - [c19]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: 43-55 - [c18]Rémy Belmonte, Ignasi Sau
:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG 2020: 67-79 - [i15]Rémy Belmonte, Ignasi Sau
:
On the complexity of finding large odd induced subgraphs and odd colorings. CoRR abs/2002.06078 (2020) - [i14]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 abs/2008.03448 (2020) - [i13]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. CoRR abs/2008.07425 (2020)
2010 – 2019
- 2019
- [j10]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): 111-134 (2019) - [c17]Rémy Belmonte
, Tesshu Hanaka
, Ioannis Katsikarelis
, Michael Lampis
, Hirotaka Ono
, Yota Otachi
:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c16]Rémy Belmonte, Eun Jung Kim, Michael Lampis
, Valia Mitsou, Yota Otachi
, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [c15]Rémy Belmonte
, Tesshu Hanaka
, Michael Lampis
, Hirotaka Ono
, Yota Otachi
:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - [i12]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i11]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019) - [i10]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - 2018
- [j9]Rémy Belmonte, Yota Otachi
, Pascal Schweitzer
:
Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica 80(1): 29-47 (2018) - [c14]Rémy Belmonte, Mehdi Khosravian Ghadikolaei
, Masashi Kiyomi
, Michael Lampis, Yota Otachi
:
How Bad is the Freedom to Flood-It?. FUN 2018: 5:1-5:13 - [c13]Rémy Belmonte, Tesshu Hanaka
, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16 - [c12]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. STACS 2018: 10:1-10:15 - [i9]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. CoRR abs/1801.03879 (2018) - [i8]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? CoRR abs/1804.08236 (2018) - [i7]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - 2017
- [j8]Rémy Belmonte, Pim van 't Hof
, Marcin Kaminski, Daniël Paulusma
:
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217: 132-143 (2017) - [j7]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): 1217-1243 (2017) - [c11]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. WG 2017: 113-126 - [i6]Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. CoRR abs/1702.08903 (2017) - 2016
- [i5]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. CoRR abs/1602.02610 (2016) - [i4]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR abs/1605.08540 (2016) - 2015
- [c10]Rémy Belmonte, Fedor V. Fomin
, Petr A. Golovach
, M. S. Ramanujan:
Metric Dimension of Bounded Width Graphs. MFCS (2) 2015: 115-126 - [c9]Rémy Belmonte, Yota Otachi
, Pascal Schweitzer
:
Induced Minor Free Graphs: Isomorphism and Clique-width. WG 2015: 299-311 - [i3]Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto:
Polynomial-time approximability of the k-Sink Location problem. CoRR abs/1503.02835 (2015) - [i2]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
The Price of Connectivity for Feedback Vertex Set. CoRR abs/1510.02639 (2015) - 2014
- [j6]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): 473-497 (2014) - [j5]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): 501-521 (2014) - [j4]Rémy Belmonte
, Pinar Heggernes
, Pim van 't Hof
, Arash Rafiey, Reza Saei
:
Graph classes and Ramsey numbers. Discret. Appl. Math. 173: 16-27 (2014) - [c8]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: 57-68 - 2013
- [j3]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): 1888-1893 (2013) - [j2]Rémy Belmonte, Martin Vatshelle:
Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511: 54-65 (2013) - [c7]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: 16-27 - 2012
- [j1]Rémy Belmonte, Pinar Heggernes
, Pim van 't Hof
:
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160(7-8): 999-1010 (2012) - [c6]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 - [c5]Rémy Belmonte, Pinar Heggernes
, Pim van 't Hof
, Reza Saei:
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON 2012: 204-215 - [c4]Rémy Belmonte, Pim van 't Hof
, Marcin Kaminski:
Induced Immersions. ISAAC 2012: 299-308 - 2011
- [c3]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: 110-119 - [c2]Rémy Belmonte, Pinar Heggernes
, Pim van 't Hof
:
Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539 - [c1]Rémy Belmonte, Martin Vatshelle:
Graph Classes with Structured Neighborhoods and Algorithmic Applications. WG 2011: 47-58 - 2010
- [i1]Rémy Belmonte, Martin Vatshelle:
On graph classes with logarithmic boolean-width. CoRR abs/1009.0216 (2010)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint