FAW2019: The 13th International Frontiers of Algorithmics Workshop Tsinghua Sanya International Mathematics Forum (TSIMF) Sanya, China, April 29-May 3, 2019 |
Conference website | http://iiis.tsinghua.edu.cn/~jianli/FAW2019/FAW2019.html |
Submission link | https://easychair.org/conferences/?conf=faw2019 |
Titles and short abstracts due (optional) | December 28, 2018 |
Submission deadline | January 7, 2019 |
Author notification | February 18, 2019 |
Final versions due for proceedings | February 25, 2019 |
The 13th International Frontiers of Algorithmics Workshop (FAW 2019) will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.
Interesting new results in all areas of algorithmics, operation research and combinatorial optimization and their applications are welcome. In addition to theoretical work, we are also interested in results that report on experimental and applied research of general algorithmic interest. Special considerations will be given to algorithmic research that is motivated by real-world applications.
Submission Guidelines
The submission deadline is January 7 (23:59, anywhere on earth (AoE)), 2019. All submissions are electronic via EasyChair, and the submission server is now available at https://easychair.org/conferences/?conf=faw2019. Submissions must adhere to the following guidelines: Papers must be formatted using the LNCS style file without altering margins or the font point. A submission should not exceed 12 pages, including references, but excluding the optional appendix. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Papers that deviate from these guidelines risk being rejected without consideration of their merits. The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS), and will be available for distribution at the conference.
List of Topics
- Algorithms and data structures
- Algorithmic game theory and incentive analysis
- Approximation algorithms and online algorithms
- Automata, languages, logic, and computability
- Bioinformatics, computational biology and medicine, and biomedical applications
- Biomedical imaging algorithms
- Combinatorial optimization
- Combinatorics and discrete structures related to algorithms and complexity
- Communication networks and optimization
- Complexity theory
- Computational algebra, geometry, number theory, and statistics
- Computational learning theory, knowledge discovery, and data mining
- Cryptography, reliability, and security
- Database theory, large databases, and natural language processing
- Experimental algorithmic methodologies
- Geometric information processing and communication
- Graph algorithms and theory
- Graph drawing and information visualization
- Internet algorithms and protocols
- Large graph algorithms and social network analysis
- Optimization algorithms in economic and operations research
- Parallel and distributed computing and multicore algorithms
- Parameterized algorithms, heuristics, and analysis
- Pattern recognition algorithms
- Trustworthy algorithms and trustworthy software
Committees
Program Committee
- Jin-Yi Cai (Wisconsin)
- Yixin Cao (HKPolyU)
- Xujin Chen (AMSS)
- Yijia Chen (Fudan) co-chair
- Yukun Cheng (USTS)
- Xiaotie Deng (Peking) co-chair
- Hu Ding (USTC)
- Ran Duan (Tsinghua)
- Modecai Golin (HKUST)
- Heng Guo (Edinburgh)
- Zhiyi Huang (HKU)
- Kazuo Iwama (Kyoto)
- Jian Li (Tsinghua)
- Minming Li (HKCityU)
- Shimin Li (Winona)
- Bingkai Lin (NII)
- Tian Liu (Peking)
- Pinyan Lu (SUFE)
- Mei Lu (Tsinghua) co-chair
- Pan Peng (Sheffield)
- Richard Peng (Gatech)
- Qi Qi (HKUST)
- Dominik Scheder (SJTU)
- Haitao Wang (Utah)
- Mingji Xia (ISCAS)
- Deshi Ye (Zhejiang)
- Yang Yuan (MIT)
- Binhai Zhu (Montana)