Collection
AAIM 2022
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.
The topics include, but are not limited to:
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
Blockchain
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
Articles (17 in this collection)
-
-
Maximizing the amount of data collected from WSN based on solar-powered UAV in urban environment
Authors (first, second and last of 6)
-
-
Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
Authors (first, second and last of 4)
-
-
Algorithms for single machine scheduling problem with release dates and submodular penalties
Authors (first, second and last of 5)
-
An approximation algorithm for the clustered path travelling salesman problem
Authors (first, second and last of 4)
-
-
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
Authors (first, second and last of 6)
-
Algorithms for maximizing monotone submodular function minus modular function under noise
Authors (first, second and last of 4)
-
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
Authors (first, second and last of 4)
-
-
-
A complete algebraic solution to the optimal dynamic rationing policy in the stock-rationing queue with two demand classes
Authors (first, second and last of 4)
-
-
-
