Conferences and Meetings on Algorithms and Data Structues

Indian Institute of Technology Ropar | Association for Computer Science and Discrete Mathematics (ACSDM)

The seventh CALDAM (CALDAM 2021) will be organized by the Department of Computer Science & Engineering, IIT Ropar from 11th to 13th of February 2021. The International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), held under aegis of the Association for Computer Science and Discrete Mathematics (ACSDM), is intended to bring together researchers working in the areas of algorithms and applied discrete mathematics and provide a high-quality forum for the dissemination and discussion of research results in these broad areas. CALDAM has originated from the ongoing efforts for promoting research in Algorithms and Discrete Mathematics.

Due to the COVID-19 situation, all authors at CALDAM 2021 now have the option of giving an online talk at the conference, if they cannot attend the conference physically at IIT Ropar during February 11-13, 2021.

Approximation Algorithms, Combinatorial Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Data Structures, Experimental Algorithm Methodologies, Graph Algorithms, Graph Drawing, Parallel and Distributed Algorithms, Parameterized Complexity, Network Optimization, Online Algorithms, Randomized Algorithms, Graph Theory, Combinatorics, Discrete Geometry

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

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

Software & Support Media GmbH

Im Extreme Java Camp vermittelt der renommierte Experte Heinz Kabutz seine Praxiserfahrungen und umfassendes Wissen zu den unterschiedlichsten Java Themen. Selbst der erfahrenste Java-Programmierer wird hier intensiv angeregt und herausgefordert. Das hands-on-Trainings unterteilt sich in zwei Module (Refactoring & Design Patterns) von 21. bis 25. Juni 2021 online, die separat oder gemeinsam gebucht werden können.

Entwickler Akademie;     Phone: [+49(0)30-2148066-51];     Email: ssorger@sandsmedia.com

Java, Programmierung

Training in Computer Science, Courses,    Software Engineering

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.

This workshop will be held in a digital format via Zoom (live). Registration is free.

The goal of this workshop is to bring together researchers from various fields that intersect with nonlocal spacial modeling and thereby generate fruitful synergistic effects among the participants. The workshop will be focused on models which are nonlocal in space; including fractional equations as well as nonlocal models with a finite range of interactions.

Optimization (optimal distributed control, interface and parameter identification, etc.) Analysis and Stochastics (numerical analysis, jump processes, etc.) Implementation (finite element and mesh-free methods, Monte-Carlo type methods, low-rank approaches, spectral methods, etc.) Applications (finance, peridynamics, economic models, etc.)

The inaugural SIAM Conference on Applied & Computational Discrete Algorithms (ACDA) is sponsored by the new SIAM Activity Group on Applied & Computational Discrete Algorithms and is co-located with the 2021 SIAM Annual Meeting (AN21) in Spokane, Washington on July 19-21, 2021.

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 following meetings will be held jointly: SIAM Conference on Control and Its Applications (CT21) SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)

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.

COnfiguration and SElection of ALgorithms (COSEAL) group

The eighth COSEAL Workshop is a forum for discussing the most recent advances in the automated configuration and selection of algorithms. It will take place on 21-23th of August 2021 in Bruges, Belgium, and is organized by Patrick De Causmeacker, Greet Vanden Berghe, Pieter Leyman from KU Leuven (KULAK) and Julie Jacques, Laetitia Jourdan, Marie-Eléonore Kessaci and Nadarajen Veerapen from CRIStAL (ORKAD).

Algorithm selection Algorithm configuration Algorithm portfolios Performance predictions and empirical performance models Bayesian optimization Hyperparameter optimization Automated machine learning (AutoML) Neural architecture search Meta-learning Algorithm and parameter control Explorative landscape analysis Programming by optimization Hyper-heuristics

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

The Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems is an international forum for researchers in the area of algorithms and optimization methods to facilitate planning and operational management of freight and passenger transportation and traffic. ATMOS brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transport optimization. The symposium provides a forum for the exchange and dissemination of new ideas and techniques. The aim of making transportation better gives rise to very complex and large-scale optimization problems requiring innovative solution techniques and ideas from algorithms, mathematical optimization, theoretical computer science, and operations research.

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

University of Tübingen

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering. GD has been the main annual event in this area for more than 20 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute papers and posters and to participate in the symposium and the graph drawing contest.

graph drawing, network visualization, combinatorics, experiments

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

PAAP 2021 will be organized by Xidian University.

Following the successful PAAP’08 in Hefei, PAAP’09 in Nanning, PAAP’10 in Dalian, and PAAP’11 in Tianjin, PAAP’12 in Taipei, PAAP’14 in Beijing, PAAP’15 in Nanjing, PAAP’17 in Haikou, PAAP’18 in Taiwan, PAAP’19 in Shenzhen, the 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP’21) will be held in Xi'an, China, December 10-12, 2021.

Phone: [+86-28-87555888];     Email: contactpco@qq.com

Architectures; Algorithms; Parallel Programming; High Performance Systems; Privacy and Security; Big Data Processing and Deep Learning;

High Performance Computing, Supercomputing, Parallel Computing,    Software Engineering

SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.

The following meetings will be held jointly: ACM-SIAM Symposium on Discrete Algorithms SIAM Symposium on Algorithm Engineering and Experiments SIAM Symposium on Simplicity in Algorithms SIAM Symposium on Algorithmic Principles of Computer Systems

APOCS is sponsored by the SIAM Activity Group on Applied and Computational Discrete Algorithms.

We invite submissions for the 41st Symposium on Principles of Database Systems, PODS'22. For over 40 years, PODS has been the leading conference in the theoretical aspects of data management, bringing together different communities such as logic and languages, knowledge representation, data mining, algorithms, web science, and privacy, with the aim of advancing the fundamentals of the tools we use to store, integrate, query, and analyze data in different contexts. The PODS community aims to provide a solid scientific basis for methods, techniques and solutions for the data management problems that continually arise in our data-driven society. Our goal is to develop solutions that ensure a high level of efficiency, scalability, expressiveness, robustness, flexibility, security, and privacy, among others.