6 citations · 19 across the 12 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
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…
cs.DS2020★ 3 cited
Grundy Distinguishes Treewidth from Pathwidth
Rémy Belmonte, Eun Jung Kim, Michael Lampis +2
Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in parameterized complexity. A main aim of research in this area is to und…
cs.DS2020
On the complexity of finding large odd induced subgraphs and odd colorings
Rémy Belmonte, Ignasi Sau
We study the complexity of the problems of finding, given a graph , a largest induced subgraph of with all degrees odd (called an odd subgraph), and the smallest number of o…