6 citations · 6 across the 1 of their papers we have counts for
6 papers
Parameterized Complexity of -Path Packing
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6
Given a graph , , and integers and , the \textsc{-Path Packing} problem asks to find vertex-disjoint paths of length that h…
Independent Set Reconfiguration Parameterized by Modular-Width
Rémy Belmonte, Tesshu Hanaka, Michael Lampis +2
Independent Set Reconfiguration is one of the most well-studied problems in the setting of combinatorial reconfiguration. It is known that the problem is PSPACE-complete even for g…
Parameterized Complexity of Safe Set
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis +3
In this paper we study the problem of finding a small safe set in a graph , i.e. a non-empty set of vertices such that no connected component of is adjacent to a larg…
Parameterized (Approximate) Defective Coloring
Rémy Belmonte, Michael Lampis, Valia Mitsou
In Defective Coloring we are given a graph and two integers and are asked if we can partition into color classes, so that each class induces a gra…
Induced Minor Free Graphs: Isomorphism and Clique-width
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Given two graphs and , we say that contains as an induced minor if a graph isomorphic to can be obtained from by a sequence of vertex deletions and edge cont…
Polynomial-time approximability of the k-Sink Location problem
Rémy Belmonte, Yuya Higashikawa, Naoki Katoh +1
A dynamic network where is a graph, integers and represent, for each edge , the time required to traverse edge and its no…