The Complexity of Finding Tangles -- A spectral algorithm for finding maximum cliques in dense random intersection graphs -- Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth -- More Effort Towards Multiagent Knapsack -- Dominance Drawings for DAGs with Bounded Modular Width -- Morphing Planar Graph Drawings Through 3D -- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees -- Parameterized Approaches to Orthogonal Compaction -- Hardness of bounding influence via graph modification -- On the Parameterized Complexity of $s$-club Cluster Deletion Problems -- Balanced Substructures in Bicolored Graphs -- On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines -- On the 2-Layer Window Width Minimization Problem -- Sequentially Swapping Tokens: Further on Graph Classes -- On the Preservation of Properties when Changing Communication Models -- Introduction to Routing Problems with Mandatory Transitions -- Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs -- Lower Bounds for Monotone $q$-Multilinear Boolean Circuits -- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints -- Quantum complexity for vector domination problem -- Learning through Imitation by using Formal Verification -- Delivery to Safety with Two Cooperating Robots -- Space-Efficient STR-IC-LCS Computation -- The k-center Problem for Classes of Cyclic Words.