Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings

Front Matter....Pages -
Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations....Pages 1-12
Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs....Pages 13-25
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance....Pages 26-35
Voronoi Diagram with Visual Restriction....Pages 36-46
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region....Pages 47-57
On Covering Points with Minimum Turns....Pages 58-69
On Envy-Free Pareto Efficient Pricing....Pages 70-81
Online Pricing for Multi-type of Items....Pages 82-92
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines....Pages 93-104
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs....Pages 105-116
Algorithms for Bandwidth Consecutive Multicolorings of Graphs....Pages 117-128
Independent Domination on Tree Convex Bipartite Graphs....Pages 129-138
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters....Pages 139-148
On Multiprocessor Temperature-Aware Scheduling Problems....Pages 149-160
Online Minimum Makespan Scheduling with a Buffer....Pages 161-171
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing....Pages 172-181
Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP....Pages 182-191
Some Remarks on the Incompressibility of Width-Parameterized SAT Instances....Pages 192-198
Kernels for Packing and Covering Problems....Pages 199-211
The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter....Pages 212-223
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations....Pages 224-234
On Editing Graphs into 2-Club Clusters....Pages 235-246
Solving Generalized Optimization Problems Subject to SMT Constraints....Pages 247-258
Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition....Pages 259-268
Zero-Sum Flow Numbers of Regular Graphs....Pages 269-278
More Efficient Parallel Integer Sorting....Pages 279-290
Fast Relative Lempel-Ziv Self-index for Similar Sequences....Pages 291-302
A Comparison of Performance Measures via Online Search....Pages 303-314
Online Exploration of All Vertices in a Simple Polygon....Pages 315-326
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs....Pages 327-338
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs....Pages 339-350
An Improved Approximation Algorithm for the Bandpass Problem....Pages 351-358
Partial Degree Bounded Edge Packing Problem....Pages 359-367
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem....Pages 368-368
Back Matter....Pages -