Folgen
Rémy Belmonte
Rémy Belmonte
Kyoto University
Keine bestätigte E-Mail-Adresse - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Graph classes with structured neighborhoods and algorithmic applications
R Belmonte, M Vatshelle
Theoretical Computer Science 511, 54-65, 2013
902013
Edge contractions in subclasses of chordal graphs
R Belmonte, P Heggernes, P van’t Hof
Discrete Applied Mathematics 160 (7-8), 999-1010, 2012
312012
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65, 662-686, 2021
282021
Finding contractions and induced minors in chordal graphs via disjoint paths
R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ...
Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011
272011
Metric dimension of bounded tree-length graphs
R Belmonte, FV Fomin, PA Golovach, MS Ramanujan
SIAM Journal on Discrete Mathematics 31 (2), 1217-1243, 2017
252017
Detecting fixed patterns in chordal graphs in polynomial time
R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ...
Algorithmica 69, 501-521, 2014
252014
Graph classes and Ramsey numbers
R Belmonte, P Heggernes, P van’t Hof, A Rafiey, R Saei
Discrete applied mathematics 173, 16-27, 2014
202014
The price of connectivity for feedback vertex set
R Belmonte, P van't Hof, M Kamiński, D Paulusma
Discrete Applied Mathematics 217, 132-143, 2017
19*2017
Metric dimension of bounded width graphs
R Belmonte, FV Fomin, PA Golovach, MS Ramanujan
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
182015
Parameterized complexity of three edge contraction problems with degree constraints
R Belmonte, PA Golovach, P van’t Hof, D Paulusma
Acta Informatica 51 (7), 473-497, 2014
182014
Parameterized (approximate) defective coloring
R Belmonte, M Lampis, V Mitsou
SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020
142020
Grundy distinguishes treewidth from pathwidth
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi
SIAM Journal on Discrete Mathematics 36 (3), 1761-1787, 2022
132022
Independent set reconfiguration parameterized by modular-width
R Belmonte, T Hanaka, M Lampis, H Ono, Y Otachi
Algorithmica 82 (9), 2586-2605, 2020
92020
Parameterized complexity of safe set
R Belmonte, T Hanaka, I Katsikarelis, M Lampis, H Ono, Y Otachi
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019
92019
Characterizing graphs of small carving-width
R Belmonte, P van’t Hof, M Kamiński, D Paulusma, DM Thilikos
Discrete applied mathematics 161 (13-14), 1888-1893, 2013
92013
Induced minor free graphs: Isomorphism and clique-width
R Belmonte, Y Otachi, P Schweitzer
Algorithmica 80, 29-47, 2018
82018
The Structure of -Immersion-Free Graphs
R Belmonte, A Giannopoulou, D Lokshtanov, DM Thilikos
arXiv preprint arXiv:1602.02002, 2016
82016
Defective coloring on classes of perfect graphs
R Belmonte, M Lampis, V Mitsou
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
72017
Parameterized complexity of two edge contraction problems with degree constraints
R Belmonte, PA Golovach, P van’t Hof, D Paulusma
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
72013
On the complexity of finding large odd induced subgraphs and odd colorings
R Belmonte, I Sau
Algorithmica 83 (8), 2351-2373, 2021
62021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20