Conferences  >  Informatics  >  Algorithms and Data Structures

The International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), held under the aegis of the Association of 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.

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

Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

ICERM Program Staff;     Phone: [+1 (401) 863-5030];     Email: info@icerm.brown.edu

graph algorithms, data science, networks

Graph Theory and Combinatorics,    Scientific Computing and Data Science

Algorithms and Logic Group @ University of Electronic Science and Technology of China , Theoretical Computer Science Committee of China Computer Federation (CCF)

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

USENIX Association

SREcon is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. Our purpose is to be inclusive as we bring together ideas representative of our diverse community, whether its members are focusing on a global scale, launching new products and ideas for a small business, or pivoting their approach to unite software and systems engineering. SREcon challenges both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    High Performance Computing, Supercomputing, Parallel Computing

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

A long-standing question in theoretical computer science is to offer analysis tools for improving performance on typical everyday, non-worst-case instances. A recent model addressing this goal is the algorithms-with-predictions model: each problem instance comes with a possibly error-prone prediction, and the worst-case running time is given as a function of the error in that prediction. This model reflects how recent advances in machine learning are able to make reasonably good predictions on practical ‒ even very complex ‒ datasets. The algorithms-with-predictions model has been used to give strong approximation-ratio guarantees for fundamental online algorithms like scheduling and caching. How to leverage predictions to speed up running time of offline algorithms and data structures has received less attention. This Dagstuhl Seminar aims to bring together researchers from the data structures, combinatorial optimization and learned predictions communities to address the challenges of adopting learned predictions for improving running time guarantees.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric and topological problems, which arise naturally in a wide range of areas, including computer graphics, CAD, robotics, computer vision, image processing, spatial databases, GIS, molecular biology, sensor networks, machine learning, data mining, scientific computing, theoretical computer science, and pure mathematics. Computational geometry is a vibrant and mature field of research, with several dedicated international conferences and journals and strong intellectual connections with other computing and mathematics disciplines. The emphasis of the Dagstuhl Seminar is on presenting recent developments in computational geometry, as well as identifying new challenges, opportunities, and connections to other fields of computing.

The general topic of the conference is the theory and application of discrete ​structures. Its goal is to highlight the most salient trends in the field, which has ​close links to diverse areas such as cryptography, computer science, large-scale ​networks and biology. Particular areas of interest include: graphs and digraphs, ​hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, ​combinatorics of words, discrete optimization, discrete and computational ​geometry, lattice point enumeration, combinatorial algorithms, computational ​complexity, and applications of discrete and algorithmic mathematics, including ​(but not limited to) web graphs, computational biology, telecommunication ​networks, and information processing.

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

MIP 2025 is supported by the Mixed Integer Programming Society (MIPS), which is a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. The 2025 edition of the workshop will be the twenty-second in the MIP series.

Optimization Theory, Operational Research,    Courses and Events for Math Students and Early Career Researchers

The IGAFIT Highlights of Algorithms (HALG) conference is designed to be a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area.

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.

Trier University, Computer Science Department

WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.

PC Chairs;     Phone: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.

Trier University, Computer Science Department

WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.

PC Chairs;     Phone: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.

IPCO (Integer Programming and Combinatorial Optimization) is a conference that is sponsored by the Mathematical Programming Society. IPCO 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 of integer programming and combinatorial optimization. The conference and summer school will take place at Johns Hopkins University in Baltimore, Maryland, USA.

Graph Theory and Combinatorics,    Courses and Events for Math Students and Early Career Researchers

Virtually every human-technology interaction, or sensor network, generates observations that are in some relation with each other. As a result, many data science problems can be viewed as a study of some properties of complex networks in which nodes represent the entities that are being studied and edges represent relations between these entities. Such networks are often large-scale, decentralized, and evolve dynamically over time. Modeling and mining complex networks in order to understand the principles governing the organization and the behaviour of such networks is crucial for a broad range of fields of study, including information and social sciences, economics, biology, and neuroscience. The aim of the 20th Workshop on Modelling and Mining Networks (WAW 2025) is to further the understanding of networks that arise in theoretical as well as applied domains. The goal is also to stimulate the development of high-performance and scalable algorithms that exploit these networks. The workshop welcomes the researchers who are working on graph-theoretic and algorithmic aspects of networks represented as graphs or hypergraphs and other higher order structures.

Modeling and Simulation,    Complex Networks

The MIP European Workshop 2025 is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

The MIP European Workshop is part of the MIP International Workshop series, held in addition to the classical MIP Workshop.

Optimization Theory, Operational Research,    Courses and Events for Math Students and Early Career Researchers

International Association of Computer Science and Information Technology

The 8th International Conference on Machine Learning and Machine Intelligence (MLMI 2025) will be held in Kyoto, Japan during July 25-27, 2025. MLMI 2025 is organized by Ritsumeikan University, Japan.

Email: aimee@iacsit.net

Artificial Neural Networks; Genetic Algorithms; Machine Learning; Automata, Logic and Games; Intelligent Systems; Bayesian Networks; Logic and Proof; Commercial Software;

Neural Networks and Artificial Intelligence, Machine Learning,    Database Technology and Design, Search Engines and Data Mining

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Constraint optimization is today a de facto practical approach to efficiently solving various types of NP-hard optimization problems arising from real-world settings. This is primarily due to significant advances in practical algorithms and implementation-level techniques, which have resulted in increasingly efficient and robust constraint optimization solvers for a range of NP-hard declarative languages. However, the need for even more efficient and robust constraint optimization solvers continues to grow, as in several contexts more and more complex optimization problems need to be solved.

The Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS) is a biennial event that brings together researchers and practitioners from around the world. Since 2001, LAGOS has served as a key forum for the exchange of ideas and collaboration. It is the merger of two Latin American conferences: the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO) and the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA).

Graph Theory and Combinatorics,    Optimization Theory, Operational Research

MIP South America is supported by the Mixed Integer Programming Society (MIPS), a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. It brings together researchers, students, and industry actors from around the globe, fostering collaboration and providing a showcase for students, early career academics, and developments in industry and novel applications. In this edition, we are putting a special focus on bringing a considerable number of speakers based in different countries of South America.

Optimization Theory, Operational Research,    Courses and Events for Math Students and Early Career Researchers