The 10th InternationaFrontiers of Algorithmics Workshop (FAW 2016 http://faw2016.sdu.edu.cn/index.html) wilbe held on June 30 - July 2, 2016 at Qingdao, China.

The 10th InternationaFrontiers of Algorithmics Workshop (FAW 2016) wilprovide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatoriaoptimization and their applications, and wilbring together internationaexperts at the research frontiers in these areas to exchange ideas and to present significant new results.Interesting new results in alareas of algorithmics, operations research and combinatoriaoptimization and their applications are welcome. In addition to theoreticawork, we are also interested in results that report on experimentaand applied research of generaalgorithmic interest. Speciaconsiderations

wilbe given to algorithmic research that is motivated by real-world applications.

Typical, but not exclusive, topics of interest include:

• Algorithms and data structures;

• Algorithmic game theory and incentive analysis;

• Approximation algorithms and online algorithms;

• Automata, languages, logic, and computability;

• Bioinformatics, computationabiology and medicine, and biomedicaapplications;

• Biomedicaimaging algorithms;

• Combinatoriaoptimization;

• Combinatorics and discrete structures related to algorithms and complexity;

• Communication networks and optimization;

• Complexity theory;

• Computationaalgebra, geometry, number theory, and statistics;

• Computationalearning theory, knowledge discovery, and data mining;

• Cryptography, reliability, and security;

• Database theory, large databases, and naturalanguage processing;

• Experimentaalgorithmic methodologies;

• Geometric information processing and communication;

• Graph algorithms and theory;

• Graph drawing and information visualization;

• Internet algorithms and protocols;

• Large graph algorithms and socianetwork analysis;

• Optimization algorithms in economic and operations research;

• Paralleand distributed computing and multicore algorithms;

• Parameterized algorithms, heuristics, and analysis;

• Pattern recognition algorithms;

• Trustworthy algorithms and trustworthy software.

Submission Guidelines and Publication Information

The submission deadline is February 1, 2016 (GMT(Greenwich mean time)). FAW 2016 will only accept electronic (PS or PDF) submissions. The submission webpage for FAW 2016 is: https://easychair.org/conferences/?conf=faw2016

Only previously unpublished new results will be considered for publication. Papers that have already been published at another journal or conference with proceedings, or simultaneously submitted or accepted to another conference with proceedings will not be considered. A submission should not exceed 10 pages, excluding bibliography and appendices, formatted for letter-size paper using 11 point or larger font.

The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.

Selected high quality papers will be invited to a special issue in the journal of Theoretical Computer Science and in the Journal of Combinatorial Optimization,

respectively. The invited papers will go through the normal reviewing process.

Important Dates         

Submission deadline:        February 1, 2016 

Notification of acceptance:   March 7, 2016 

Final version due:           April 7, 2016 

General Conference Chairs

Program Chairs

Publication Chair

Organizaiton Chair