This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.
The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
One-Dimensional r -Gathering under Uncertainty.- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees.- A Probabilistic Algorithm for Verication of Geometric Theorems.- Approximating Closest Vector Problem in innte Norm Revisited.- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable.- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs.- Updating Matrix Polynomials.- On the Structure of Discrete Metric Spaces Isometric to Circles.- A 2.57-Approximation Algorithm for Contig-based Genomic Sca
![Algorithmic Aspects in Information and Management: 13th International Conference, AAIM 2019, Beijing, China, August 68, 2019, Proceedings [Paperback]](/itemImage/2/3/1/9/2_5256919.jpg "Algorithmic Aspects in Information and Management: 13th International Conference, AAIM 2019, Beijing, China, August 68, 2019, Proceedings [Paperback]")