Conferences and Meetings on Algorithms and Data Structues

The Data Compression Conference (DCC) is an international forum for current work on data compression and related applications.

Compression of specific types of data (text, images, video, etc.). Compression in networking, communications, and storage. Applications to bioinformatics. Applications to mobile computing. Applications to information retrieval. Computational issues for compression related applications. Inpainting-based compression, perceptual coding. Compressed data structures. Quantization theory, and vector quantization (VQ). Joint source-channel coding. Compression related standards.

Database Technology and Design, Search Engines and Data Mining,    Applied Mathematics (in general)

Konfy

Big data. Cloud data. ML, AI training data, and personally-identifying data. Data is all around you. The world is data-centric. Data Love is the conference for Data Engineers, Data Scientists, and everyone who wants to dive into the data-driven world.

event manager;     Email: ida@konfy.care

Data computational Models, Data Quality, Data Standards, Data Modelling, Data Visualization, Data Lake and Data Catalog, Low-code development, Business analytics, Business intelligence, Data Science, Analytics, Change detection, 3D Vision, Deep learning, Data governance, Data Infrastructure, Cloud services, Private cloud, BigData as a service, Data-intensive applications, Data ops (Orchestration and Tooling), ML Ops

Database Technology and Design, Search Engines and Data Mining,    Information & Knowledge Management, Big Data Computing

University of Cyprus

The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

CIRM – Centre International de Rencontres Mathématiques

Software Engineering,    Applied Mathematics (in general)

Algorithms and complexity: algorithms and computational complexity; approximation algorithms; randomized algorithms; computational geometry; parameterized complexity. Operations Research and Mathematical Programming: combinatorial optimization; integer programming; polyhedral combinatorics; operations research and management science. Graph Theory: cliques, dominating and independent sets; colorings; covering and packing, factorization, matching; digraphs, tournaments; graph algorithms; graphs and matrices; hypergraphs; perfect graphs; random graphs; structural characterization of graph classes. Applications to real-world problems: mathematical programming, combinatorial optimization, continuous optimization, heuristics, and metaheuristics.

Graph Theory and Combinatorics,    Operational research

H. Milton Stewart School of Industrial and Systems Engineering

The IPCO conference is under the auspices of the Mathematical Optimization Society and is held every year. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

The Fields Institute for Research in Mathematical Sciences

Heuristic search and other forms of combinatorial search optimization are a very active areas of research in artificial intelligence, robotics, planning and other areas of computer science. The International Symposium on Combinatorial Search (SoCS) is meant to bring researchers in such areas together to exchange their ideas and cross-fertilize the field. SoCS is targeting researchers and submissions in all fields that use combinatorial search, including artificial intelligence, planning, robotics, constraint programming, meta-reasoning, operations research, navigation and bioinformatics. We especially invite submissions presenting real-world applications of heuristic search.

Graph Theory and Combinatorics,    Database Technology and Design, Search Engines and Data Mining

Since 1969, the ARITH symposia have served as the flagship conference for presenting scientific work on the latest research in computer arithmetic. Computer arithmetic is now driving the most important innovations and product directions in our industry, such as artificial intelligence and security. The 28th edition of the symposium, ARITH 2021, originally scheduled in Turin, Italy, will be held as a virtual conference for the uncertainty of the world health situation and travels in early 2021.

Numerical Analysis and Computational Mathematics,    Scientific Computing

The Fields Institute for Research in Mathematical Sciences

Algebra,    Geometry and Topology

The Fields Institute for Research in Mathematical Sciences

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), the International Workshop on Combinatorial Algorithms (IWOCA) has provided a forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business. IWOCA's ongoing goal is to advance this area of scientific achievement by bringing together the most creative and successful practitioners in this fundamental intersection between mathematics and computer science. IWOCA's sessions provide for the dissemination of new results as well as for discussion and analysis of new problems and problem areas. Both complete papers and problem submissions are subject to a rigorous refereeing process that seeks to maintain the highest standards of academic research.

The aim of the workshop is to present recent research results on dynamic scheduling problems, in which job processing times, machine speeds or other parameters of the problems are variable and dynamically change in time.

The aim of the workshop is to present recent research results on dynamic scheduling problems, in which job processing times, machine speeds or other parameters of the problems are variable and dynamically change in time.

Society for Industrial and Applied Mathematics (SIAM)

This Conference is an outgrowth of the new SIAM Activity Group on ACDA, founded last year, which aims to create a professional home for the broad, dispersed community of researchers working on applications of discrete mathematics. In particular, we want to foster a rich interplay between concrete applications and theoretical advancement/algorithm development for combinatorial problems. As such, we would like the ACDA conference to be an attractive meeting for researchers working on applied discrete math within many communities – including combinatorial scientific computing, discrete computational biology, theoretical computer science, network science, combinatorial optimization, algorithm engineering, parallel algorithms and more.

Applied Mathematics (in general),    Numerical Analysis and Computational Mathematics

Society for Industrial and Applied Mathematics (SIAM)

The purpose of this conference is to highlight the major theoretical advances in the field, the development of new tools for discrete mathematics, and the most significant of the new applications of discrete mathematics to problems arising in industry and business. The conference also seeks to bring together participants from the many different environments where discrete mathematics is developed and applied.

This is the meeting of the SIAM Activity Group on Discrete Mathematics.

Applied Mathematics (in general),    Numerical Analysis and Computational Mathematics

The Algorithms and Data Structures Symposium, WADS, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The symposium will most likely be fully online. It may have an in-person component, which will be held at Dalhousie University, Halifax, Nova Scotia, Canada.

The conference is devoted to all numerical aspects of time-dependent differential equations and differential-algebraic equations.

Numerical Analysis and Computational Mathematics,    Calculus, Differential Equations and Integration

Universität Augsburg

Parametric optimization is a part of mathematical programming and has emerged as an exciting research area in theory, numerics and applications. It investigates the properties of solutions to optimization problems under data perturbations or uncertainty. Many relations to other disciplines of operations research, like stochastic programming, complementarity problems, mixed-integer problems, model-building, numerical methods, multi-objective optimization and optimal control, originate from these properties. paraoptXII welcomes papers as well as proposals for special sessions on any area in parametric optimization or related topics. We hope that the conference will continue to help link researchers and practitioners from different areas of mathematical programming from around the world.

Operational research,    Modeling and Simulation

CIRM – Centre International de Rencontres Mathématiques

Neural Networks and Artificial Intelligence, Machine Learning,    Probability and Statistics, Game Theory

The ADT 2021 conference focus is on algorithmic decision theory broadly defined, seeking to bring together researchers and practitioners coming from diverse areas of Computer Science, Economics and Operations Research in order to improve the theory and practice of modern decision support. The conference topics include research in Algorithms, Argumentation Theory, Artificial Intelligence, Computational Social Choice, Database Systems, Decision Analysis, Discrete Mathematics, Game Theory, Machine Learning, Matching, Multi-agent Systems, Multiple Criteria Decision Aiding, Networks, Optimization, Risk Management, and Utility Theory.

Operational research,    Information Theory, Foundations of Computer Science