Graph classes with structured neighborhoods and algorithmic applications R Belmonte, M Vatshelle
Theoretical Computer Science 511, 54-65, 2013
115 2013 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
45 2017 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
40 2021 Edge contractions in subclasses of chordal graphs R Belmonte, P Heggernes, P van’t Hof
Discrete Applied Mathematics 160 (7-8), 999-1010, 2012
31 2012 Detecting fixed patterns in chordal graphs in polynomial time R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ...
Algorithmica 69 (3), 501-521, 2014
28 2014 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
26 2022 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
26 2011 Graph classes and Ramsey numbers R Belmonte, P Heggernes, P van’t Hof, A Rafiey, R Saei
Discrete applied mathematics 173, 16-27, 2014
25 2014 Metric dimension of bounded width graphs R Belmonte, FV Fomin, PA Golovach, MS Ramanujan
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
21 2015 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
21 2014 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
20 2017 Parameterized (approximate) defective coloring R Belmonte, M Lampis, V Mitsou
SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020
19 2020 Parameterized complexity of safe set R Belmonte, T Hanaka, I Katsikarelis, M Lampis, H Ono, Y Otachi
International Conference on Algorithms and Complexity, 38-49, 2019
19 2019 Characterizing graphs of small carving-width R Belmonte, P van’t Hof, M Kamiński, D Paulusma, DM Thilikos
Combinatorial Optimization and Applications: 6th International Conference …, 2012
19 2012 Independent set reconfiguration parameterized by modular-width R Belmonte, T Hanaka, M Lampis, H Ono, Y Otachi
Algorithmica 82 (9), 2586-2605, 2020
12 2020 Defective coloring on classes of perfect graphs R Belmonte, M Lampis, V Mitsou
Discrete Mathematics & Theoretical Computer Science 24 (Discrete Algorithms), 2022
11 2022 On the complexity of finding large odd induced subgraphs and odd colorings R Belmonte, I Sau
Algorithmica 83 (8), 2351-2373, 2021
10 2021 The Structure of R Belmonte, A Giannopoulou, D Lokshtanov, DM Thilikos
arXiv preprint arXiv:1602.02002, 2016
10 2016 On graph classes with logarithmic boolean-width R Belmonte, M Vatshelle
arXiv preprint arXiv:1009.0216, 2010
10 2010 Induced minor free graphs: Isomorphism and clique-width R Belmonte, Y Otachi, P Schweitzer
Algorithmica 80, 29-47, 2018
9 2018 
Pim van 't HofUniversity of TwenteBestätigte E-Mail-Adresse bei utwente.nl
