Titlebook: ;

消息靈通

,On the Parameterized Complexity of the Connected Flow and Many Visits?TSP Problem,emand vertices . with demands ., and costs and capacities for each edge. The goal is to find a minimum cost flow that satisfies the demands, respects the capacities and induces a (strongly) connected subgraph. This generalizes previously studied problems like the ...We study the parameterized comple

厚臉皮

不舒服

Disjoint Stable Matchings in Linear Time,cal results: .Moreover, we also give an algorithm to enumerate all maximum-length chains of disjoint stable matchings in the lattice of stable matchings of a given instance. This algorithm takes time polynomial in the input size for enumerating each chain. We also derive the expected number of such

輕快走過

恭維

On Subgraph Complementation to ,-free Graphs,duced by . in . results in a graph in .. We investigate the complexity of the problem when . is .-free for . being a complete graph, a star, a path, or a cycle. We obtain the following results:.Further, we prove that these hard problems do not admit subexponential-time algorithms (algorithms running

難取悅

ANA

Preventing Small ,-Cuts by Protecting Edges,of total cost at most?. such that?. has no?(.,?.)-edge cut of capacity at most?. that is disjoint from?.. We show that . (.,?.). is NP-hard even on subcubcic graphs when all edges have capacity and cost one and provide a comprehensive study of the parameterized complexity of the problem. We show, fo

合群

Ancestor

充滿裝飾

The Perfect Matching Cut Problem Revisited,ching cut, and is known to be .-complete. We revisit the problem and show that . remains .-complete when restricted to bipartite graphs of maximum degree?3 and arbitrarily large girth. Complementing this hardness result, we give two graph classes in which . is polynomial time solvable. The first one