Titlebook: SOFSEM 2024: Theory and Practice of Computer Science; 49th International C Henning Fernau,Serge Gaspers,Ralf Klasing Conference proceedings

嘲笑

Row-Column Combination of Dyck Wordscolumn combination of Dyck word languages, which prescribes that each column and row is a Dyck word over an alphabet of size 4.. The standard relation between matching parentheses is represented in . by an edge of the matching graph situated on the picture array. Such edges form a circuit, of path l

Urea508

Foregery

On the Parameterized Complexity of the Perfect Phylogeny Problemvely. We show that they are complete for the parameterized complexity class XALP using a reduction from . and a proof of membership. We introduce the problem . as a stepping stone and prove XALP-completeness for this problem as well. We also show that, assuming the Exponential Time Hypothesis, there

foodstuff

deriver

Visualization of Bipartite Graphs in Limited Window Sizemon feature. The standard visualization of bipartite graphs, with objects and features on two (say horizontal) parallel lines at integer coordinates and edges drawn as line segments, can often be difficult to work with. A common task in visualization of such graphs is to consider one object and all

expansive

Outerplanar and Forest Storyplansence of drawings is called ., and each drawing in the sequence is called a .. In an outerplanar storyplan, every frame is outerplanar; in a forest storyplan, every frame is acyclic..We identify graph families that admit such storyplans and families for which such storyplans do not always exist. In t

头盔

Atmosphere

Morphing Graph Drawings in the Presence of Point Obstacleslications in 3D morphing problems, we initiate the study of morphing graph drawings in the plane in the presence of stationary point obstacles, which need to be avoided throughout the deformation. As our main result, we prove that it is NP-hard to decide whether such an obstacle-avoiding 2D morph be

恭维

On the Parameterized Complexity of the Perfect Phylogeny Problemproblem . as a stepping stone and prove XALP-completeness for this problem as well. We also show that, assuming the Exponential Time Hypothesis, there exists no algorithm that solves any of these problems in time ., where . is the input size, . the parameter, and . any computable function.

Cerebrovascular

Outerplanar and Forest Storyplansryplan, every frame is acyclic..We identify graph families that admit such storyplans and families for which such storyplans do not always exist. In the affirmative case, we present efficient algorithms that produce straight-line storyplans.