Skip to main content
SpringerLink
Log in

Frontiers in Algorithmics

Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Franco P. Preparata
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xiaodong Wu
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jianping Yin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5059)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: FAW 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (35 papers)

  1. Front Matter

    Download chapter PDF

  2. Fixed Point Computation and Equilibrium

    • Xiaotie Deng
    Pages 1-1

  3. Computer Science in the Information Age

    • John Hopcroft
    Pages 2-2

  4. Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making

    • Milan Sonka
    Pages 3-3

  5. Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy

    • Danny Z. Chen, Chao Wang
    Pages 4-15

  6. A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem

    • Minzhu Xie, Jianxin Wang, Wei Zhou, Jianer Chen
    Pages 16-27

  7. SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data

    • Kevin McCormick, Roli Shrivastava, Li Liao
    Pages 28-34

  8. A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance

    • Shuai Cheng Li, Yen Kaow Ng, Louxin Zhang
    Pages 35-44

  9. Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information

    • Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
    Pages 45-54

  10. Estimating Hybrid Frequency Moments of Data Streams

    • Sumit Ganguly, Mohit Bansal, Shruti Dube
    Pages 55-66

  11. Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

    • Guoqiang Bai, Henning Fernau
    Pages 67-78

  12. NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k )

    • Tianyan Deng, Daoyun Xu
    Pages 79-88

  13. Absorbing Random Walks and the NAE2SAT Problem

    • K. Subramani
    Pages 89-100

  14. Versioning Tree Structures by Path-Merging

    • Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann
    Pages 101-112

  15. A Linear In-situ Algorithm for the Power of Cyclic Permutation

    • Jinyun Xue, Bo Yang, Zhengkang Zuo
    Pages 113-123

  16. Multi-bidding Strategy in Sponsored Keyword Auction

    • Tian-Ming Bu, Xiaotie Deng, Qi Qi
    Pages 124-134

  17. A CSP-Based Approach for Solving Parity Game

    • Min Jiang, Changle Zhou, Guoqing Wu, Fan Zhang
    Pages 135-146

  18. Characterizing and Computing Minimal Cograph Completions

    • Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
    Pages 147-158

  19. Efficient First-Order Model-Checking Using Short Labels

    • Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
    Pages 159-170

  20. Matching for Graphs of Bounded Degree

    • Yijie Han
    Pages 171-173
Back to top

Other volumes

  1. Frontiers in Algorithmics

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation