Titlebook: LATIN 2020: Theoretical Informatics; 14th Latin American Yoshiharu Kohayakawa,Flávio Keidi Miyazawa Conference proceedings 2020 Springer N

AMITY

親密

cardiac-arrest

Rotator-Cuff

Graph Hamiltonicity Parameterized by Proper Interval Deletion Settive integer . and the task is to check if there are . vertex-disjoint paths (cycles) that together visit all the vertices of the graph exactly once. . and . remain .-hard even when restricted to chordal graphs (Information Processing Letters 1986) but are polynomial-time solvable on proper interval

Interdict

THE

Structural Parameterizations for Equitable Coloringic . is fixed parameter tractable under well established parameters such as pathwidth and feedback vertex set, equitable coloring is W[1]-hard. We prove that . is fixed parameter tractable when parameterized by distance to cluster or co-cluster graphs, improving on the FPT algorithm of Fiala et al.

雕鏤

拍翅

榨取

syring

Query Minimization Under Stochastic Uncertaintyadaptive decision tree to find a correct solution to the problem in consideration while minimizing the expected total query cost. We show that sorting in this scenario can be performed in polynomial time, while finding the data item with minimum value seems to be hard. This contradicts intuition, si