the 13th International Conference on Algorithmic Aspects in Information and Management
Beijing, China, August 6-8, 2019
http://theory.ict.ac.cn/aaim2019/index.html
Important Dates
=============
Submission due: May 10, 2019
Accept/reject announcement: June 10, 2019
Final version due: June 20, 2019
It will provide a forum on current trends of research on algorithms, data structures, and their applications. Interesting new results in all areas of algorithm design, operation research and combinatorial optimization and their applications are welcome. Both theoretical and experimental/applied works of general algorithmic interest are sought. Special considerations will be given to algorithmic research that is motivated by real-world applications. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the target algorithms in practical settings.
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.
Program Chairs
==========
Ding-Zhu Du (University of Texas at Dallas)
Lian Li (Hefei University of Technology)
Xiaoming Sun (Institute of Computing Technology, CAS)
Program Committee
=============
Ding-Zhu Du (University of Texas at Dallas)
Lian Li (Hefei University of Technology)
Xiaoming Sun (Institute of Computing Technology, Chinese Academy of Sciences)
Zhipeng Cai (Georgia State University)
Yongxi Cheng (Xi'an Jiaotong University)
Andras Farago (University of Texas at Dallas)
Xiaofeng Gao (Shanghai Jiaotong University)
Donghyun Kim (Kennesaw State University)
Minming Li (City University of Hong Kong)
Cong Tian (Xi'an University of Electronic Technology)
Guochuan Zhang (Zhejiang University)
Jialin Zhang (Institute of Computing Technology, Chinese Academy of Sciences)
Peng Zhang (Shandong University)
Zhao Zhang (Zhejiang Normal University)
--
Best Wishes,
Jialin Zhang, zhangjialin@ict.ac.cn
Institute of Computing Technology, Chinese Academy of Sciences
**********************************************************
*
* 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/
*
**********************************************************
Posts
