Titlebook: ;

ARY

Moderne deutsche Strafrechtsdenkerized by stable gonality, a novel graph parameter based on optimal maps from graphs to trees. The problems we consider are classical flow and orientation problems, such as ., ., and capacitated optimization problems such as .. Our hardness claims beat existing results. The FPT algorithms use a new pa

affluent

评论性

https://doi.org/10.1007/978-3-642-58246-2hbourhood of . is bijective, injective or surjective, respectively. The corresponding decision problems, ., . and ., are well studied both on general graphs and on special graph classes. We prove a number of new ., .[1]-hard and para-.-complete results by considering a hierarchy of parameters of the

假

https://doi.org/10.1007/978-3-531-93404-4each connected component of the resulting graph has a diameter at most .. When ., the corresponding problem is popularly known as .. We provide a faster algorithm for . . on .. For each ., we give an .-time algorithm for . . on interval graphs with . vertices and . edges. In the case of ., our algor

惊奇

ungainly

https://doi.org/10.1007/978-3-642-72664-4emoval yields an acyclic graph. More precisely, we aim to determine for which parameterizations this problem admits a polynomial kernel. While a characterization is known for the related . problem based on the recently introduced notion of bridge-depth, it remained an open problem whether this could

AROMA

Guaff豪情痛饮

施舍

陈列

Moderne, Staat und Internationale Politikzed approximation scheme (EPAS) when the parameters are ., the number of outliers and the doubling dimension of the supplier set. On the other hand, we show that for the . . . problem, which is a special case of ., obtaining a parameterized approximation scheme (PAS) is .-hard when the parameters ar