The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19¿21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka.

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 ofVariable-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 and Its Variants.- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach.- A Scalable Algorithm for Graph-Based Active Learning.- A Supervised Feature Extraction Algorithm for Multi-class.- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine.- A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network.