4 citations · 13 across the 11 of their papers we have counts for
3 papers · 1 filter
Fixed-Parameter Sensitivity Oracles
Davide Bilò, Katrin Casel, Keerti Choudhary +5
We combine ideas from distance sensitivity oracles (DSOs) and fixed-parameter tractability (FPT) to design sensitivity oracles for FPT graph problems. An oracle with sensitivity $f…
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…
Dense Graph Partitioning on sparse and dense graphs
Cristina Bazgan, Katrin Casel, Pierre Cazals
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of t…