Conferences  >  Informatics  >  Algorithms and Data Structures

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

Society for Industrial and Applied Mathematics (SIAM)

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

Semmelweis University Institute of Biostatistics and Network Science

Join us for the BIOMEDICAL DATA SCIENCE Summer School & Conference – two interconnected events where students receive intensive training in health data science (July 28 – August 5), followed by a scientific conference to share cutting-edge work in data-intensive biological and medical research (August 6 - 8).

Email: biostat@semmelweis.hu

Machine learning and AI applications in biomedical research Multi-omics data integration and analysis Medical imaging and computer vision in healthcare Natural language processing for clinical and biomedical texts Explainable AI and trustworthy machine learning in medicine Computational modeling of biological systems Wearable and sensor-based health data analytics Privacy-preserving techniques for biomedical data Digital health and personalized medicine Drug discovery and biomarker identification through data science Network science tools in biomedical research Causal inference in biomedical research Biostatistical approaches for biomedical data analysis

Scientific Computing and Data Science,    Clinical Data Management, e-Health

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.

entwickler.de Akademie | Software & Support Media GmbH

Kubernetes gilt als mächtig – und mitunter herausfordernd. In diesem Camp lernen Sie die Grundlagen verständlich und praxisnah kennen. Dank einer steilen Lernkurve bewegen Sie sich schnell sicher in der Kubernetes-Welt und sprechen bald die Sprache der Profis. Auf einem eigenen Cluster mit drei Knoten üben Sie Ressourcennutzung, Deployment und Monitoring – unterstützt durch einsteigerfreundliche Tipps, Tools und Best Practices für einen sicheren Betrieb. In drei intensiven Tagen steigen Sie zunächst mit einer verständlichen Einführung in die grundlegenden Konzepte von Kubernetes ein. Dazu gehören ein Überblick über die Plattform, zentrale Begrifflichkeiten sowie erste praktische Schritte wie das Arbeiten mit Namespaces, Deployments und Upgrades. Anschließend widmen Sie sich den essenziellen Bausteinen: Sie lernen, wie Pods – die kleinste Recheneinheit in Kubernetes – funktionieren, wie Health Checks und Scheduling durchgeführt werden und wie Deployments sowie ReplicaSets effizient genutzt werden. Auch Themen wie Volume Management, Services, DNS und Service Discovery sowie Rollout-Strategien und Ingress werden praxisnah behandelt. Im fortgeschrittenen Teil des Camps beschäftigen Sie sich mit der Anwendung komplexerer Funktionen, darunter Jobs und Cronjobs, das Monitoring mit Prometheus, Logging mit Elastic sowie Sicherheitsaspekte wie Role-Based Access Control (RBAC). So erhalten Sie einen umfassenden Einblick in die Arbeit mit Kubernetes – vom ersten Deployment bis zum sicheren Betrieb produktiver Anwendungen.

entwickler.de Akademie;     Email: info@entwickler-akademie.de

Kubernetes, Overview, Begrifflichkeiten, Namespaces, Deployments, Upgrades, Pods, Health Checks, Scheduling, ReplicaSets, DNS, ServiceDiscovery, Cronjobs, Monitoring, Logging, Security, RBAC, DevOPs

Information Security and Information Privacy,    Training in Computer Science, Courses

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