[DMANET] Frontiers of Algorithmics Workshop First Call for Papers -- deadline Feb. 1, 2015

The 9th International Frontiers of Algorithmics Workshop
Guilin, China, July 3-5, 2015

Important Dates
Submission deadline: February 1, 2015
Notification of acceptance: March 10, 2015
Final version due: April 10, 2015

The 9th International Frontiers of Algorithmics Workshop (FAW 2015)
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.

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, 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.

Submission Guidelines and Publication Information
The submission deadline is February 1, 2015 (anywhere on Earth). FAW
2015 will only accept electronic (PS or PDF) submissions. The
submission webpage for FAW 2015 is:
https://easychair.org/conferences/?conf=faw2015

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.

General Conference Chairs
John Hopcroft (Cornell University, USA)
Shichao Zhang (Guangxi Normal University, China)

Program Chairs
Chee Yap (New York University, USA)
Jianxin Wang (Central South University, China)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************