Frontiers in Algorithmics

Fixed Point Computation and Equilibrium.- Computer Science in the Information Age.- Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making.- Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy.- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem.- SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data.- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance.- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information.- Estimating Hybrid Frequency Moments of Data Streams.- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations.- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT???k ,r-UNLSAT???k ).- Absorbing Random Walks and the NAE2SAT Problem.- Versioning Tree Structures by Path-Merging.- A Linear In-situ Algorithm for the Power of Cyclic Permutation.- Multi-bidding Strategy in Sponsored Keyword Auction.- A CSP-Based Approach for Solving Parity Game.- Characterizing and Computing Minimal Cograph Completions.- Efficient First-Order Model-Checking Using Short Labels.- Matching for Graphs of Bounded Degree.- Searching Trees with Sources and Targets.- Ranking of Closeness Centrality for Large-Scale Social Networks.- Mixed Search Number of Permutation Graphs.- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.- A Distributed Algorithm to Approximate Node-Weighted Minimum ?-Connected (?,k)-Coverage in Dense Sensor Networks.- Optimal Surface Flattening.- Visiting a Polygon on the Optimal Way to a Query Point.- Constraint Abstraction in Verification of Security Protocols.- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback.- Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms.- The Parameterized Complexity of the Rectangle Stabbing Problem