Frontiers of Algorithmics Workshop
The Second International Frontiers of Algorithmics Workshop (FAW 2008) will be held from June 19 - 21, 2008 in Changsha, China, in close proximity to the famous and beautiful Zhangjiajie National Forest Park, which is a World Natural Heritage Site.
The Workshop will provide a focused forum on current trends in research on algorithms, discrete structures, and their applications, and will bring together international experts at the research frontiers in those areas to exchange ideas and to present significant new results.
The mission of the workshop is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. While interesting results in all areas of algorithmics are welcome, different topics may be emphasized each year to reflect contemporary trends and developments. In addition, each year there will be a few special focused themes to ensure a critical mass of participants in the selected areas and an intense exchange of ideas and experiences in those areas.
For more information and pictures of Changsha and Zhangjiajie, please go to Local Information and Scenery.
Program Topics
Contributions solicited for FAW 2008 cover the topics including, but not limited to:
- Algorithms in medical research
- Geometric information processing and communication
- Approximation and online algorithms
- Graph algorithms
- Bioinformatics
- Internet algorithms and protocols
- Computational statistics
- Multicore parallel algorithms
- Discrete structures
- Parameterized algorithms, heuristics and analysis
- Games and incentive analysis
The special focused themes for 2008 are algorithms in biomedical research, games and incentive analysis, and multicore parallel algorithms. The proceedings of the Workshop will be published by Springer-Verlag in the Lecture Notes in Computer Science. High quality papers will be invited to a special issue of International Journal on Computational Geometry and Applications or Journal of Combinatorial Optimization.
