WALCOM: Algorithms and Computation
Description
This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.
More details
Other editions
Additional editions
Content
Invited Talks.- Some Problems Related to the Space of Optimal Tree Reconciliations.- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability.- Invitation to Combinatorial Reconfiguration.- Combinatorial Reconfiguration.- Reconfiguration of Regular Induced Subgraphs.- Traversability, Reconfiguration, and Reachability in the Gadget Framework.- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.- Graph Drawing and Visualization.- Aspect Ratio Universal Rectangular Layouts.- Morphing tree drawings in a small 3D grid.- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams.- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard.- The Polygon Burning Problem.- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs.- Computational Complexity.- Happy Set Problem on Subclasses of Co-comparability Graphs.- Finding Geometric Representations of Apex Graphs is NP-Hard.- The Complexity of L(p,q)-Edge-Labelling.- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets.- Online and Property Testing.- An Optimal Tester for k-Linear.- Machine Learning Advised Ski Rental Problem with a Discount.- Parameterized Complexity .- On the Harmless Set Problem Parameterized by Treewidth.- Isomorphism Testing for T -graphs in FPT.- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage.- Parameterized complexity of reconfiguration of atoms.- Parameterized Complexity of Immunization in the Threshold Model.- Parameterized Complexity of Minimum Membership Dominating Set.- G raph Algorithms .- Finding popular branchings in vertex-weighted digraphs.- Vertex-Weighted Graphs: Realizable and Unrealizable Domains.- Hypergraph Representation via Axis-Aligned Point-Subspace Cover.- Structural Parameterizations of Budgeted Graph Coloring.- Counting and Sampling Orientations on Chordal Graphs.- Minimum t-spanners on subcubic graphs.- Approximation Algorithms.- Approximating the Bundled Crossing Number.- Path Cover Problems with Length Cost.- On approximating shortest paths in weighted triangular tessellations.
