Titlebook: WALCOM: Algorithms and Computation; 16th International C Petra Mutzel,Md. Saidur Rahman,Slamin Conference proceedings 2022 Springer Nature

Neuralgia

StreamTable: An Area Proportional Visualization for Tables with Flowing Streamsoverlapping vertical streams and the rows as horizontal stripes such that the intersection between a stream and a stripe is a rectangle with area equal to the weight of the corresponding cell. To avoid large wiggle of the streams, it is desirable to keep the consecutive cells in a stream to be adjac

沉默

Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hardoblem, where each guard is assigned one of . distinct colors. A chromatic guarding is said to be . if at least one of the colors seen by every point in . is unique (i.e., each point in . is seen by some guard whose color appears exactly once among the guards visible to that point). In this paper, we

牛马之尿

cloture

The Polygon Burning Problem set . of . vertices of . that minimizes the maximum geodesic distance from any point in . to its nearest vertex in .. Alternatively, viewing each vertex in . as a site to start a fire, the goal is to select . such that fires burning simultaneously and uniformly from ., restricted to ., consume . en

消灭

STYX

Reverse Shortest Path Problem in Weighted Unit-Disk Graphsge connects two points . if the (Euclidean) distance between . and . is at most . (the weight of the edge is 1 in the unweighted case and is the distance between . and . in the weighted case). Given a value . and two points . and . of ., we consider the following .: Compute the smallest . such that

ALIAS

憎恶

提升

FLAX