Titlebook: ;

mortgage

,Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts,-hard parameterized by treewidth, a natural alternative would be to use a suitable analogue of treewidth that is based on edge cuts instead of vertex separators. While tree-cut width has been coined as such an analogue of treewidth for edge cuts, its algorithmic applications have often led to disapp

磨坊

,An Algorithmic Framework for Locally Constrained Homomorphisms,hbourhood 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

malign

,s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs,each 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

DRILL

,Polychromatic Colorings of Unions of Geometric Hypergraphs,capturing hypergraph is an .-uniform hypergraph whose vertices are points in the plane and whose hyperedges are those .-subsets of points that can be separated by some geometric object of a particular type, such as axis-aligned rectangles, from the remaining points. Polychromatic .-colorings of .-un

ODIUM

被告

名词

,On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy,rameter . of ., especially for sparse graph parameters such as treewidth. In 2021, Duarte, Oliveira, and Souza [MFCS 2021] showed some problems that are FPT when parameterized by the treewidth of the complement graph (called co-treewidth). Since the degeneracy of a graph is at most its treewidth, th

温室

Horizon

Generalized ,-Center: Distinguishing Doubling and Highway Dimension,zed 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

生命层

,Extending Partial Representations of Circular-Arc Graphs,We consider this problem for circular-arc graphs, where several arcs are predrawn and we ask whether this partial representation can be completed. We show that this problem is .-complete for circular-arc graphs, answering a question of Klavík et al. (2014)..We complement this hardness with tractabil