E-raamat: WALCOM: Algorithms and Computation: 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings

.- Graph drawings and embeddings.


.- Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns.


.- Minimum-Weight Outerplane Laman Graphs.


.- Minimizing Vertical Length in Linked Bar Charts.


.- On Compaction and Realizability of Almost Convex Octilinear
Representations.


.- Hardness and Parameterized Tractability of the Weak Graph Distance.


 


.- Approximation.


.- Hardness and Approximation Results for Extending Unique Neighborhood
Networks.


.- Approximating the Average-case Graph Search Problem with Non-uniform
Costs.


.- Linear time small coresets for k-mean clustering of segments with
applications.


.- Cartesian Forest Matching.


.- Streaming algorithms for products of probabilities.


 


.- Induced subgraphs and dominating sets.


.- Finding Order-Preserving Subgraphs.


.- Finding a Maximum Common (Induced) Subgraph: Structural Parameters
Revisited.


.- Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar
Graphs.


.- Complexity of perfect (1,2)-dominating sets in low-degree graphs.


.- Complexity.


.- A Complexity Analysis of the c-Closed Vertex Deletion Problem.


.- On the Computational Complexity of Covering Multi-Interface Networks.


.- Generalizing Brooks Theorem via Partial Coloring is Hard Classically and
Locally.


.- Space Efficient Algorithms for Parameterised Problems.


.- Subexponential and Parameterized Mixing Times of Glauber Dynamics on
Independent Sets.


 


.- Games and graph reconfiguration


 


.- Complexity and algorithms for Arc-Kayles and Non-Disconnecting
Arc-Kayles.


.- Can One Flip Spoil It All?.


.- Computing Power Indices in Weighted Majority Games with Formal Power
Series.


.- How to Reconfigure Your Alliances.


.- Graph Irregularity via Edge Deletions.


.- Shortest paths and minimum spanning trees.


.- Forcing a unique minimum spanning tree and a unique shortest path.


.- On the MST-ratio: Theoretical Bounds and Complexity of Finding the
Maximum.


.- Disjoint Tours and the Price of Diversity.


.- Shortcutting the diameter of a polygon.


.- Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths.


 


.- Geometric problems


 


.- Further Results on Rendering Geometric Intersection Graphs Sparse by
Dispersion.


.- Fundamentals of Computing Continuous Dynamic Time Warping in 2D under
Different Norms.


.- The Gate-Cover Problem.


.- Trajectory Visibility at First Sight.


.- Tile Reconfiguration by a Finite Automaton.


 


.- Enumeration problems


.- Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision
Diagrams.


.- Engineering Algorithms for L-Isolated Maximal Clique Enumeration.


.- On the Complexity of Hyperpath and Minimal Separator Enumeration in
Directed Hypergraphs.


.- Enumeration of Bases in Matroid with Exponentially Large Ground Set.