1 citations · 2 across the 16 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud +2
We study the fixed-parameter tractability of the \textsc{Isometric Path Cover} problem where, given an integer and a simple, undirected, and unweighted graph , the objective…
math.CO2026
Generating minimal redundant and maximal irredundant sets in incidence graphs
Emanuel Castelo, Jérémie Chalopin, Oscar Defrain +1
It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unl…