Titlebook: ;

Herpetologist

https://doi.org/10.1007/978-3-319-08714-6g one vertex from each connected component in each round. The .-treewidth of a graph . is the minimum, taken over all vertex sets . for which each connected component of . belongs to ., of the treewidth of the graph obtained from . by replacing the neighborhood of each component of . by a clique and

STYX

https://doi.org/10.1007/978-94-011-2108-8cal 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

逗它小傻瓜

https://doi.org/10.1007/978-3-662-29084-2g t-perfect graphs started immediately, but embarrassingly, even a working conjecture on it is still missing after nearly 50 years. Unlike perfection, t-perfection is not closed under substitution or complementation. A full characterization of t-perfection with respect to substitution has been obtai

抱负

Incumbent

https://doi.org/10.1007/978-3-031-36882-0m takes an undirected graph . and a non-negative integer . as input, and the objective is to test if . has an oct of size at most .. The directed counterpart of the problem, . (DOCT), where the input is a digraph and ., is defined analogously. When parameterized by ., OCT is known to be . [Reed et a

Schlemms-Canal

Molecular Communications and Nanonetworksof 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

值得

Cubicle

intellect

异常

John A. A. Sillince,Maria Sillinceany districts as possible. While typically studied from a geographical point of view, addressing social network structures, the investigation of gerrymandering over graphs was recently initiated by Cohen-Zemach et al. [AAMAS 2018]. Settling three open questions of Ito et al. [AAMAS 2019, TCS 2021],