Graph classes with structured neighborhoods and algorithmic applications R Belmonte, M Vatshelle Theoretical Computer Science 511, 54-65, 2013 | 66 | 2013 |

Finding contractions and induced minors in chordal graphs via disjoint paths R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ... International Symposium on Algorithms and Computation, 110-119, 2011 | 27 | 2011 |

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 | 21 | 2014 |

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 | 18 | 2017 |

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 | 16* | 2017 |

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 | 16 | 2014 |

Edge contractions in subclasses of chordal graphs R Belmonte, P Heggernes, P van’t Hof International Conference on Theory and Applications of Models of Computation …, 2011 | 16 | 2011 |

Metric dimension of bounded width graphs R Belmonte, FV Fomin, PA Golovach, MS Ramanujan International Symposium on Mathematical Foundations of Computer Science, 115-126, 2015 | 15 | 2015 |

Graph classes and Ramsey numbers R Belmonte, P Heggernes, P van’t Hof, A Rafiey, R Saei Discrete applied mathematics 173, 16-27, 2014 | 15 | 2014 |

Edge contractions in subclasses of chordal graphs R Belmonte, P Heggernes, P van’t Hof Discrete Applied Mathematics 160 (7-8), 999-1010, 2012 | 15 | 2012 |

Token sliding on split graphs R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora Theory of Computing Systems, 1-25, 2020 | 8 | 2020 |

The Structure of -Immersion-Free Graphs R Belmonte, A Giannopoulou, D Lokshtanov, DM Thilikos arXiv preprint arXiv:1602.02002, 2016 | 8 | 2016 |

Parameterized (approximate) defective coloring R Belmonte, M Lampis, V Mitsou SIAM Journal on Discrete Mathematics 34 (2), 1084-1106, 2020 | 7 | 2020 |

Parameterized complexity of two edge contraction problems with degree constraints R Belmonte, PA Golovach, P van’t Hof, D Paulusma International Symposium on Parameterized and Exact Computation, 16-27, 2013 | 7 | 2013 |

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 | 7 | 2013 |

Induced minor free graphs: Isomorphism and clique-width R Belmonte, Y Otachi, P Schweitzer International Workshop on Graph-Theoretic Concepts in Computer Science, 299-311, 2015 | 6 | 2015 |

Forbidden induced subgraphs and the price of connectivity for feedback vertex set R Belmonte, P van’t Hof, M Kamiński, D Paulusma International Symposium on Mathematical Foundations of Computer Science, 57-68, 2014 | 6 | 2014 |

Characterizing graphs of small carving-width R Belmonte, P van’t Hof, M Kamiński, D Paulusma, DM Thilikos International Conference on Combinatorial Optimization and Applications, 360-370, 2012 | 5 | 2012 |

On graph classes with logarithmic boolean-width R Belmonte, M Vatshelle arXiv preprint arXiv:1009.0216, 2010 | 5 | 2010 |

Grundy distinguishes treewidth from pathwidth R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi arXiv preprint arXiv:2008.07425, 2020 | 4 | 2020 |