1 citations · 2 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
Cédric Bentz
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-co…
cs.DS2017
An FPT algorithm for planar multicuts with sources and sinks on the outer face
Cédric Bentz
Given a list of k source-sink pairs in an edge-weighted graph G, the minimum multicut problem consists in selecting a set of edges of minimum total weight in G, such that removing…