Frontiers in Algorithmics

<p>A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange.- &nbsp;A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem.- Efficient Guarding of Polygons and Terrains.- &nbsp;Graph Orientation with Edge Modifications.- Local Coloring: New Observations and New Reductions.- Secure Computation of Any Boolean Function Based on Any Deck of Cards.- &nbsp;A Novel Business Model for Electric Car Sharing.- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- &nbsp;Read-Once Resolutions in Horn Formulas.- Vertex-Critical (P5 ,banner)-Free Graphs.- An FPTAS for Stochastic Unbounded Min-Knapsack Problem.- &nbsp;The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits.- &nbsp;Mutual Visibility by Robots with Persistent Memory.- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases.- An Improved Approximation Algorithm for the k-Means Problem with Penalties. &nbsp;</p>