WALCOM: Algorithms and Computation: 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings

Front Matter....Pages I-XXII
Front Matter....Pages 1-1
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications....Pages 3-15
Front Matter....Pages 17-17
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns....Pages 19-29
Dynamic Sum-Radii Clustering....Pages 30-41
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments....Pages 42-53
On Guarding Orthogonal Polygons with Sliding Cameras....Pages 54-65
Bundling Two Simple Polygons to Minimize Their Convex Hull....Pages 66-77
Front Matter....Pages 79-79
Tangle and Maximal Ideal....Pages 81-92
A Width Parameter Useful for Chordal and Co-comparability Graphs....Pages 93-105
Byzantine Gathering in Networks with Authenticated Whiteboards....Pages 106-118
Generating All Patterns of Graph Partitions Within a Disparity Bound....Pages 119-131
Front Matter....Pages 133-133
An Experimental Study on the Ply Number of Straight-Line Drawings....Pages 135-148
Complexity Measures for Mosaic Drawings....Pages 149-160
Fast Optimal Labelings for Rotating Maps....Pages 161-173
Front Matter....Pages 175-175
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover....Pages 177-189
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem....Pages 190-203
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs....Pages 204-216
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques....Pages 217-227
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs....Pages 228-240
Front Matter....Pages 241-241
Online Inserting Points Uniformly on the Sphere....Pages 243-253
Computing the Center Region and Its Variants....Pages 254-265
Front Matter....Pages 241-241
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas....Pages 266-278
Gathering Asynchronous Robots in the Presence of Obstacles....Pages 279-291
Front Matter....Pages 293-293
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs....Pages 295-307
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon....Pages 308-319
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals....Pages 320-332
Front Matter....Pages 333-333
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest....Pages 335-346
The Complexity of (List) Edge-Coloring Reconfiguration Problem....Pages 347-358
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances....Pages 359-369
Front Matter....Pages 371-371
Finding Triangles for Maximum Planar Subgraphs....Pages 373-384
An Approximation Algorithm for Maximum Internal Spanning Tree....Pages 385-396
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems....Pages 397-408
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width....Pages 409-420
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths....Pages 421-432
Front Matter....Pages 433-433
Sequentially Swapping Colored Tokens on Graphs....Pages 435-447
The Time Complexity of the Token Swapping Problem and Its Parallel Variants....Pages 448-459
Sliding Tokens on Block Graphs....Pages 460-471
Back Matter....Pages 473-474