Titlebook: Algorithms and Complexity; 11th International C Pinar Heggernes Conference proceedings 2019 Springer Nature Switzerland AG 2019 approximati

FLING

感情脆弱

https://doi.org/10.1007/978-3-662-37023-0micro-pipes (edges). We address the following . problem: given a collection . of droplets, is there a mixing graph that mixes . perfectly, producing only droplets whose concentration is the average concentration of .? We provide a complete characterization of such perfectly mixable sets and an effic

河流

Indebted

receptors

游行

Quadratic Vertex Kernel for Split Vertex Deletion,re and interesting algorithmic properties making it one of the most well-studied special graph classes. In the .(.) problem, given a graph and a positive integer ., the objective is to test whether there exists a subset of at most . vertices whose deletion results in a split graph. In this paper, we

转折点

The Temporal Explorer Who Returns to the Base,tatic graph is a star on . vertices. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leaves, and eventually returns back to the center. We present here a systematic study of the computational complexity of this probl

淡紫色花

Minimum Convex Partition of Point Sets, such that all internal faces are empty convex polygons. In the Minimum Convex Partition Problem (.) one seeks to find a convex partition with the least number of faces. The complexity of the problem is still open and so far no computational tests have been reported. In this paper, we formulate the

无王时期,

Parameterized Complexity of Safe Set,.] is adjacent to a larger component in .. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth . and cannot be solved in time . unless the ETH is false, (2) it admits no polynomial

Tortuous

Parameterized Complexity of Diameter, no .-time algorithm even in sparse graphs [Roditty and Williams, 2013]. To circumvent this lower bound we aim for algorithms with running time . where . is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematica