Monday, February 16, 2026

[DMANET] [Scheduling seminar] Christian Blum (IIIA-CSIC) | February 18 | CMSA: A Hybrid Metaheuristic for Combinatorial Optimization

Dear scheduling researcher,

We are delighted to announce the talk given by Christian Blum
(IIIA-CSIC). The title is "CMSA: A Hybrid Metaheuristic for
Combinatorial Optimization". The seminar will take place on Zoom on
Wednesday, February 18 at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/91528778001?pwd=OD4EuDE8dPNHhXoYQqPJbamPCaEf3D.1
Meeting ID: 915 2877 8001
Passcode: 474863

You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
Construct, Merge, Solve & Adapt (CMSA) is an award-winning, hybrid
algorithm for solving hard combinatorial optimization problems. The main
idea consists in the iterated application of an exact solver - such as
an integer linear programming (ILP) solver - to sub-instances of the
original problem instance. These sub-instances are enlarged at each
iteration by adding solution components from a set of valid solutions
that are obtained either by probabilistic solution construction or by
any other means. Moreover, seemingly useless (or even harmful) solution
components are removed. In this talk, an introduction to CMSA will be
given, in addition to describing some of the most recent research lines
around this technique.

The next talk in our series will be: Helmut Simonis (Insight Centre,
UCC) | March 4 | Constraint Based Scheduling: A User Perspective.
For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek Hanzalek, Michael Pinedo and Guohua Wan

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] MIC 2026 - 11 days to submission deadline

MIC 2026 - 16th Metaheuristics International Conference

8 - 11 June, 2026
Ischia Island (Napoli), Italy

www.mic2026.unina.it

*********************
Submission deadline: February 27, 2026
Number of days to deadline: 11
*********************

Aims, Themes & Scope: As per tradition, looking at the previous editions of the MIC conferences, this conference focuses on the progress of the area of Metaheuristics and their applications and provides an opportunity to the international research community to discuss recent research results, to develop new ideas and collaborations, and to meet old friends and make new ones in relaxed atmosphere. MIC 2026 strives to propose a high-quality program that will be completed by a number of invited talks, tutorials, workshops and special sessions.

Solicited contributions can cover a variety of topics including but not limited to:
- Metaheuristic techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, memory-based optimization, dynamic local search, evolutionary algorithms, memetic algorithms, ant colony optimization, particle swarm optimization, scatter search, path relinking, etc.
- Techniques that enhance the usability and increase the potential of metaheuristic algorithms such as reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, parallelization of metaheuristic algorithms, etc.
- Empirical and theoretical research in metaheuristics including large-scale experimental analyses, algorithm comparisons, new experimental methodologies, engineering methodologies for metaheuristic algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms, etc.
- High-impact applications of metaheuristics in fields such as bioinformatics, electrical and mechanical engineering, telecommunications, sustainability, business, scheduling and timetabling. Particularly welcome are innovative applications
of metaheuristic algorithms that have a potential of pushing research frontiers.
- Contributions on the combination of metaheuristic techniques with those from other areas, such as integer programming, constraint programming, machine learning, etc.
- Contributions on the use of metaheuristic techniques in machine learning and deep learning for finetuning and neural architecture search, etc.
- Challenging applications areas such as continuous, mixed discrete-continuous, multi-objective, stochastic, or dynamic problems.

MIC 2026 accepts submissions in three different formats:
1. Regular paper: novel and original research contributions of a maximum of 15 pages (LNCS format)
2. Short paper: extended abstract of novel research works of 6 pages (LNCS format)
3. Oral presentation: one page abstract describing the content of an high-quality manuscript that has recently, within the last year, been submitted or accepted for journal publication.

All submitted papers will undergo a review process. All papers must be prepared using Lecture Notes in Computer Science (LNCS) template, and must be submitted in PDF using the easychair system (https://easychair.org/conferences?conf=mic2026).

Accepted papers in categories 1 and 2 will be published as post-proceedings in Lecture Notes in Computer Science series by Springer.

In addition, a post-conference special issue in Journal of Heuristics will be considered for the significantly extended and revised versions of selected accepted papers from categories 1 and 2.

IMPORTANT DATES:
All deadlines are Anywhere on Earth (AoE = UTC-12h).
- December 1, 2025, submission open/registration open
- February 27, 2026, submission deadline
- March 27, 2026, notification of acceptance
- April 10, 2026, early registration deadline
- June 8-11, 2026, conference at Ischia, Italy

CONTACT INFORMATION:
Paola Festa (E-mail: infomic2026@unina.it, paola.festa@unina.it)
Dept. of Mathematics and Applications "R. Caccioppoli", University of Napoli "Federico II"


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] AICrypt 2026 - Call for Abstracts

*****************************************************************************
AICrypt 2026 - Call for Abstracts

6th Workshop on Artificial Intelligence and Cryptography

May 9, 2026

Event affiliated with Eurocrypt 2026 (https://eurocrypt.iacr.org/2026/
<https://eurocrypt.iacr.org/2026/>)
Madrid, Spain

*** SUBMISSION DEADLINE: March 6, 2026 (AoE) ***

https://aicrypt2026.aisylab.com/
*****************************************************************************


SCOPE

The intersection of artificial intelligence (AI) and security has
gained significant attention, driven by the need for secure solutions
that deploy AI. Cryptography, in particular, stands as a notable
example of the benefits of AI integration. AI techniques and methods
are already being applied to address challenges in cryptography, such
as improving cryptanalysis and physical attacks and relevant
countermeasures. Additionally, the use of cryptography to address
security and privacy issues in AI systems is emerging as a crucial
area of focus. As attacks on AI systems become more powerful, there is
a growing need to explore how cryptographic strategies can mitigate
these threats. Examples include the development of cryptographic
backdoors in neural networks, the use of cryptographic techniques to
watermark the output of LLMs, or model stealing attacks based on
cryptanalysis techniques. Our goal is to bring together experts from
academia and industry, each with a unique perspective on cryptography
and AI, to foster knowledge exchange and collaborative innovation. We
are particularly interested in exploring how techniques can be
transferred across different cryptographic applications and in
enhancing AI security mechanisms. Moreover, we will review recent
advancements, including those discussed at previous AICrypt events, to
provide a comprehensive understanding of this rapidly evolving field.


TOPICS OF INTEREST

Topics of interest for this workshop include, but are not limited to:

- Machine learning-based cryptanalysis
- AI-assisted side-channel and fault attacks
- Cryptanalysis of public-key and symmetric-key crypto algorithms
- AI-driven design and evaluation of countermeasures
- Automated discovery of cryptographic weaknesses
- Privacy-preserving training and inference (e.g., MPC, HE, DP)
- Cryptographic enforcement of access control and usage policies for
models and data
- Secure model deployment and key management for AI systems
- Cryptographic primitives tailored to AI workloads
- Robust watermarking and fingerprinting of models and LLM outputs
- Model stealing and extraction attacks related to cryptanalytic
techniques
- Backdoors and trojans in neural networks with cryptographic
constructions
- Attacks on federated learning and other distributed AI settings
- Formal models and proofs for AI security and privacy
- New cryptographic assumptions motivated by AI settings
- Transfer of techniques between traditional cryptography and AI
security
- Case studies and empirical evaluations of AI-crypto systems


SUBMISSIONS

We encourage researchers working on all aspects of AI and cryptography
to take the opportunity and use AICrypt to share their work and
participate in discussions. The authors are invited to submit an
extended abstract using the EasyChair submission system:

https://easychair.org/conferences/?conf=aicrypt2026

Submitted abstracts for contributed talks will be reviewed by the
workshop organizers for suitability and interest to the AICrypt
audience. There are no formal proceedings published in this workshop,
thus authors can submit extended abstracts related to works submitted
or recently published in other venues, or work in progress that they
plan to submit elsewhere. Every accepted submission must have at
least one author registered for the workshop. All submitted abstracts
must follow the original LNCS format with a page limit of up to 2
pages (excluding references):

https://www.springer.com/gp/computer-science/lncs

The abstracts should be submitted electronically in PDF format.


IMPORTANT DATES

- Abstract submission deadline: March 6, 2026
- Notification to authors: March 20, 2026
- Workshop date: May 9, 2026


PARTICIPATION

The workshop will be held in Madrid, Spain, as an affiliated
event of Eurocrypt 2025. For further information about registering
to the event, please refer to the main Eurocrypt website:

https://eurocrypt.iacr.org/2026/


ORGANIZING COMMITTEE

- Stjepan Picek, Radboud University, Nijmegen (NL) - stjepan.picek@ru.nl
- Lejla Batina, Radboud University, Nijmegen (NL) - lejla@cs.ru.nl
- Luca Mariot, University of Twente, Enschede (NL) - l.mariot@utwente.nl


WEBSITE

https://aicrypt2026.aisylab.com/

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Saturday, February 14, 2026

[DMANET] Announce: passagemath 10.8.1, pip-installable modularized fork of SageMath

passagemath is open source mathematical software in Python, released
under the GNU General Public Licence GPLv2+.

It is a compatible fork of SageMath, which has been developed since 2005
under the motto "Creating a Viable Open Source Alternative to Magma,
Maple, Mathematica, and MATLAB".

The passagemath fork uses the motto "Creating a Free Passage Between
the Scientific Python Ecosystem and Mathematical Software
Communities." It was created in October 2024.

A major new stable release 10.8.1 is now available. It is up to date
with SageMath 10.9.beta3 (January 2026).

https://github.com/passagemath/passagemath

For Sage users/developers:
- The passagemath project maintains a stable version of the Sage
distribution, supporting system Python 3.11–3.14, and supporting the
traditional installation mode using "make configure && ./configure &&
make build".
- New packages, only in passagemath: CMR (combinatorial matrix
recognition library), highspy, Macaulay2, mpsolve, pplite/pplitepy, Py4ti2.
- Ships a full set of GAP packages and PARI/GP data packages.
- Numerous package upgrades, carried out with rigorous platform
portability testing on a wide range of platforms.

For Python users:
- Provides the full functionality of Sage, installable instantly from
binary wheels on PyPI:
https://github.com/passagemath/passagemath?tab=readme-ov-file#full-installation-of-passagemath-from-binary-wheels-on-pypi
- Binary wheels are available for Python 3.11–3.14, Linux and macOS,
for the x86_64 and ARM architectures.
- Can be run in generic cloud computing systems such as Google Colab
and the marimo.io molab.
- Binary wheels are available for a subset of the functionality for
native Windows on x86_64 and ARM.
- A subset of the functionality is also available on Windows through
the MSYS2 package manager.

For Sage package authors:
- Provides 120 modularized distributions of portions of the Sage
library including its many dependencies, as well as GAP packages.
- Each can be declared as a build-time or run-time dependency,
making your package a first-class member of the Python "ecosystem":
https://github.com/passagemath/passagemath?tab=readme-ov-file#modularized-distributions
- The passagemath project curates a library of Sage user packages
that are ready for the Python "ecosystem" via passagemath.

For downstream packagers:
- Each of the 120 modularized distribution packages is provided on PyPI
in the form of sdists that adhere to PEP 517/518.
https://pypi.org/org/passagemath/
- The modularized design makes porting and packaging a productive
incremental process, not an all-or-nothing proposition.
- Use "export SAGE_CONF_FILE=/dev/null" to disable the passagemath
confectionery (https://pypi.org/project/passagemath-conf/), or specify
a file to side-load configuration values.
- Non-Python dependencies of each distribution package are declared in
pyproject.toml in the format proposed by draft
https://peps.python.org/pep-0725

For upstream projects:
- Consider adopting the modularized passagemath distribution package
that provides an interface to your library as the official Python
interface package.

For help, inquiries, discussion, please use the passagemath forums.
https://github.com/passagemath#passagemath-community

New as of 2026: Weekly passagemath office hours on the Scientific Python
Discord server on Thursdays at 11am Pacific Time. All are welcome.

--
Matthias Koeppe -- http://www.math.ucdavis.edu/~mkoeppe

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD student position in Data Analytics / Operations Research – Ghent University

For the REINFUSE research project (Digital Tools foR onlinE valorIsatioN oF USed Equipment), we are hiring a full-time PhD researcher. This multidisciplinary project includes a consortium of researchers of Ghent University and KU Leuven, studying product identification and valorization for second-hand industrial equipment, contributing to both sustainability and competitiveness of the Flemish industry. The PhD researcher will work primarily on issues of maximizing the value recovery and reuse of used equipment, covering both product-based and market-based valorization approaches.

This is a 4-year project, and in collaboration with 10 industrial partners and Flanders Make, during which you will be supervised by prof. Dries Goossens and prof. Dries Benoit (Faculty of Economics and Business Administration, Ghent University).

More details on the project and how to apply can be found at:
https://www.ugent.be/en/work/scientific/doctoral-fellow-68

The deadline to apply is March 1, and the contract starts September 2026.

For more information please contact Prof. dr. Dries Goossens, mail: dries.goossens@ugent.be<mailto:dries.goossens@ugent.be>.

Feel free to circulate this offer to potential candidates and colleagues who are looking for PhD positions, or to contact me if you want more information.


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD student position in Operations Research – Joint Ghent University & KU Leuven

Interested in doing research on optimization/timetabling, with applications in educational planning problems? Care to find out how AI tools may impact teaching of operations research? We offer a fully funded (4 years) PhD position under the supervision of prof. Dries Goossens, Faculty of Economics and Business Administration (Ghent University) and profs. Jeroen Belien and Liesje De Boeck, Faculty of Economics and Business (KU Leuven).

More details on the project and how to apply can be found at:
https://www.kuleuven.be/personeel/jobsite/jobs/60617302

The deadline to apply is March 1, and the contract starts September 2026.
Applications should be submitted through KU Leuven's online platform, see https://webwsp.aps.kuleuven.be/esap/public/ui5_ui5/sap/zh_erc_esol_go/index.html?sap-ui-language=EN&vacaturenummer=60617302&toepassing=LGH

For more information please contact Prof. dr. Dries Goossens, mail: dries.goossens@ugent.be; Prof. dr. Jeroen Belien, mail: jeroen.belien@kuleuven.be; Prof. dr. Liesje De Boeck, mail: liesje.deboeck@kuleuven.be.

Feel free to circulate this offer to potential candidates and colleagues who are looking for PhD positions, or to contact me if you want more information.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] DeepLearn 2026: early registration March 1st

******************************************************

13th INTERNATIONAL SCHOOL ON DEEP LEARNING

DeepLearn 2026

Orléans, France

July 20-24, 2026

https://deeplearn.irdta.eu/2026/

******************************************************

Co-organized by:

University of Orléans

Centre Val de Loire Doctoral College

Institute for Research Development, Training and Advice – IRDTA
Luxembourg/London

******************************************************

Early registration: March 1st, 2026

******************************************************

SCOPE:

DeepLearn 2026 will be a research training event with a global scope aiming at updating participants on the most recent advances in the critical and fast developing area of deep learning. Previous events were held in Bilbao, Genova, Warsaw, Las Palmas de Gran Canaria, Guimarães, Luleå, Bournemouth, Bari, and Porto.

Deep learning is a branch of artificial intelligence covering a spectrum of current frontier research and industrial innovation that provides more efficient algorithms to deal with large-scale data in a huge variety of environments: computer vision, neurosciences, speech recognition, language processing, human-computer interaction, drug discovery, biomedicine and healthcare, medical image analysis, recommender systems, advertising, fraud detection, robotics, games, business and finance, biotechnology, physics and astrophysics, biometrics, communications, climate sciences, geographic information systems, signal processing, genomics, materials design, video technology, social systems, earth and sustainability, mathematical proofs, etc. etc.

The field is also raising a number of relevant questions about efficiency and robustness of the algorithms, explainability, transparency, interpretability, risks and safety, as well as important ethical concerns at the frontier of current knowledge that deserve careful multidisciplinary discussion.

Most deep learning subareas will be displayed and main challenges identified through 16 four-hour and a half courses, 2 keynote lectures, 1 round table, and a hackathon competition among participants. Renowned academics and industry pioneers will lecture and share their views with the audience. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Face to face interaction and networking will be main ingredients of the event. It will be also possible to fully participate in vivo remotely.

ADDRESSED TO:

Graduates, postgraduates and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees, hence people less or more advanced in their career will be welcome as well.

Since there will be a variety of levels, specific knowledge background may be assumed for some of the courses.

Overall, DeepLearn 2026 is addressed to students, researchers and practitioners who want to keep themselves updated about recent developments and future trends. All will surely find it fruitful to listen to and discuss with major researchers, industry leaders and innovators.

VENUE:

DeepLearn 2026 will take place in Orléans, located in the heart of the Loire Valley, which was declared by UNESCO a World Heritage Site in 2000. The venue will be:

University of Orléans
Faculty of Law, Economics and Management
11 rue de Blois
45100 Orléans, France

https://www.univ-orleans.fr/en

STRUCTURE:

3 courses will run in parallel during the whole event. Participants will be able to freely choose the courses they wish to attend as well as to move from one to another.

All lectures will be videorecorded. Participants will be able to watch them again for 45 days after the event.

An open session will give participants the opportunity to present their own work in progress in 5 minutes. Also companies will be able to present their industrial developments for 10 minutes.

The school will include a hackathon, where participants will be able to work in teams to tackle several machine learning challenges.

Full live online participation will be possible. The organizers highlight, however, the importance of face to face interaction and networking in this kind of research training event.

KEYNOTE SPEAKERS:

Yingbin Liang (Ohio State University), Convergence Theory: How Fast Do Discrete Diffusion Models Generate?

Le Song (Mohamed bin Zayed University of Artificial Intelligence), Multiscale Foundation Models for Biology

PROFESSORS AND COURSES:

Nitesh Chawla (University of Notre Dame), [intermediate] Learning from Imbalanced Data

Yuejie Chi (Yale University), [introductory/intermediate] Statistical and Algorithmic Foundations of Reinforcement Learning

Bo Han (Hong Kong Baptist University), [introductory/intermediate] Trustworthy Machine Learning from Data to Models

Jiawei Han (University of Illinois Urbana-Champaign), [intermediate] Structure-Guided, Theme-Based Knowledge Discovery with Large Language Models

Mingyi Hong (University of Minnesota), [intermediate] Modern Optimization Algorithms for Large Language Models

Cho-Jui Hsieh (University of California Los Angeles), [intermediate/advanced] Optimizers for Large Language Model Training

Furong Huang (University of Maryland), [advanced] Generative AI Agents

Tara Javidi (University of California San Diego), [intermediate] Active Physical Intelligence for Industrial Scale Monitoring

Yan Liu (University of Southern California), [intermediate] Time Series Foundation Models: From Forecasting to Reasoning

Zhijin Qin (Tsinghua University), [intermediate/advanced] Semantic Communications

Aarti Singh (Carnegie Mellon University), [intermediate] Human Centered AI: Challenges and Opportunities

Suvrit Sra (Technical University of Munich), [introductory/intermediate] Introduction to the Theory of Learning with Transformers

Ivor Tsang (A*STAR Centre for Frontier AI Research), [introductory/intermediate] Long-Horizon Agentic Intelligence

Ming-Hsuan Yang (University of California Merced), [advanced] Recent Advances in Multimodal Understanding and Generation

Tong Zhang (University of Illinois Urbana-Champaign), [introductory/intermediate] Reinforcement Learning for Large Language Models

Jun Zhu (Tsinghua University), [introductory/advanced] Generative Models: from Virtual to Physical World

OPEN SESSION:

An open session will collect 5-minute voluntary oral presentations of work in progress by participants.

They should submit a half-page abstract containing the title, authors, and summary of the research to david@irdta.eu by July 12, 2026.

INDUSTRIAL SESSION:

A session will be devoted to 10-minute demonstrations of practical applications of deep learning in industry.

Companies interested in contributing are welcome to submit a 1-page abstract containing the program of the demonstration and the logistics needed. People in charge of the demonstration must register for the event.

Abstracts have to be submitted to david@irdta.eu by July 12, 2026.

HACKATHON:

A hackathon will take place, where participants can voluntarily work in teams to tackle several machine learning challenges. They will be coordinated by Professor Sergei V. Gleyzer (University of Alabama). The challenges will be released 2 weeks before the beginning of the school. A jury will judge the submissions and the winners of each challenge will be announced by the end of August 2026. The winning teams will receive a modest monetary prize and the runners-up will get a certificate.

SPONSORS:

Companies/institutions/organizations willing to be sponsors of the event can download the sponsorship leaflet from

https://deeplearn.irdta.eu/2026/sponsors/

ORGANIZING COMMITTEE:

Karim Abed-Meraim (Orléans, local co-chair)
Sergei V. Gleyzer (Tuscaloosa, hackathon chair)
Meryem Jabloun (Orléans, local co-chair)
Carlos Martín-Vide (Tarragona, program chair)
Santiago Montes (Tarragona, webpage)
Sara Morales (Luxembourg, finances)
Florian Nowicki (Orléans, social networks)
Philippe Ravier (Orléans, local chair)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://deeplearn.irdta.eu/2026/registration/

The selection of 6 courses requested in the registration template is only tentative and non-binding. For logistical reasons, it will be helpful to have an estimation of the respective demand for each course.

Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed and the on-line registration tool disabled when the capacity of the venue will have got exhausted. It is highly recommended to register prior to the event.

FEES:

Fees comprise access to all program activities and lunches.

There are several early registration deadlines. Fees depend on the registration deadline.

The fees for on site and for online participation are the same.

ACCOMMODATION:

Accommodation suggestions are available at

https://deeplearn.irdta.eu/2026/accommodation/

CERTIFICATE:

A certificate of successful participation will be delivered indicating the number of hours of academic activities (40). This should be sufficient for those participants who plan to request ECTS recognition from their home university.

QUESTIONS AND FURTHER INFORMATION:

david@irdta.eu

ACKNOWLEDGMENTS:

Université d'Orléans

Collège Doctoral Centre-Val de Loire

Universitat Rovira i Virgili

Institute for Research Development, Training and Advice – IRDTA, Luxembourg/London
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, February 13, 2026

[DMANET] [Algorithms] (IF 2.1, CiteScore 4.5) 2nd volume of the Editor's Choice Articles

We are pleased to share with you the 2nd volume of the Editor's Choice
Articles in the open access journal /Algorithms
/(https://www.mdpi.com/journal/algorithms). These articles are free to
access and can be downloaded below:

1. Hardness and Approximability of Dimension Reduction on the
Probability Simplex

https://www.mdpi.com/1999-4893/17/7/296

2. Verifying Mutual Exclusion Algorithms with Non-Atomic Registers

https://www.mdpi.com/1999-4893/17/12/536

3. A Review on Inverse Kinematics, Control and Planning for Robotic
Manipulators With and Without Obstacles via Deep Neural Networks

https://www.mdpi.com/1999-4893/18/1/23

4. A Scalable Framework for Sensor Data Ingestion and Real-Time
Processing in Cloud Manufacturing

https://www.mdpi.com/1999-4893/18/1/22

5. DDL R-CNN: Dynamic Direction Learning R-CNN for Rotated Object Detection

https://www.mdpi.com/1999-4893/18/1/21

6. Impossibility Results for Byzantine-Tolerant State Observation,
Synchronization, and Graph Computation Problems

https://www.mdpi.com/1999-4893/18/1/26

7. Integrating Artificial Intelligence, Internet of Things, and
Sensor-Based Technologies: A Systematic Review of Methodologies in
Autism Spectrum Disorder Detection

https://www.mdpi.com/1999-4893/18/1/34

8. SMOTE vs. SMOTEENN: A Study on the Performance of Resampling
Algorithms for Addressing Class Imbalance in Regression Models

https://www.mdpi.com/1999-4893/18/1/37

9. Application Framework and Optimal Features for UAV-Based
Earthquake-Induced Structural Displacement Monitoring

https://www.mdpi.com/1999-4893/18/2/66

10. Intelligent Multi-Fault Diagnosis for a Simplified Aircraft Fuel System

https://www.mdpi.com/1999-4893/18/2/73

We also warmly welcome your submissions if you have relevant work to
contribute. Please feel free to contact our Assistant Editor, Mr. Musea
Wu (musea.wu@mdpi.com), for any questions or assistance.

--

Mr. Musea Wu

Assistant Editor

*News: *

1. /Algorithms/received an increased 2024 Impact Factor of 2.1 and
CiteScore of 4.5

2. /Algorithms/ ranks Q1 in Scopus: "Mathematics - Numerical Analysis"
(https://www.scopus.com/sourceid/21100199795)

3. Recruiting Editorial Board Members for /Algorithms/
(https://www.mdpi.com/about/announcements/14101)

**

*Highly Cited in 2025:*

1. A Review on Inverse Kinematics, Control and Planning for Robotic
Manipulators With and Without Obstacles via Deep Neural Networks

(https://www.mdpi.com/1999-4893/18/1/23)

2. A Scalable Framework for Sensor Data Ingestion and Real-Time
Processing in Cloud Manufacturing

(https://www.mdpi.com/1999-4893/18/1/22)

3. DDL R-CNN: Dynamic Direction Learning R-CNN for Rotated Object Detection

(https://www.mdpi.com/1999-4893/18/1/21)


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Cryptography] (IF 2.1, CiteScore 5.0) Top Cited Papers in Volume 9

We are sharing with you some top cited papers published in the open
access journal /Cryptography/ (https://www.mdpi.com/journal/cryptography)
Volume 9, which are free to access and can be downloaded here:

1. A Practical Performance Benchmark of Post-Quantum Cryptography Across
Heterogeneous Computing Environments
https://www.mdpi.com/2410-387X/9/2/32

2. Cryptographic Techniques in Artificial Intelligence Security:
A Bibliometric Review
https://www.mdpi.com/2410-387X/9/1/17

3. Compact 8-Bit S-Boxes Based on Multiplication in a Galois Field GF(24)
https://www.mdpi.com/2410-387X/9/2/21

4. Design and Implementation of a Quantum-Assisted Digital Signature
https://www.mdpi.com/2410-387X/9/1/11

5. A Self-Sovereign Identity Blockchain Framework for Access Control and
Transparency in Financial Institutions
https://www.mdpi.com/2410-387X/9/1/9

6. QPUF: Quantum Physical Unclonable Functions for Security-by-Design of
Industrial Internet-of-Things
https://www.mdpi.com/2410-387X/9/2/34

See this full volume via https://www.mdpi.com/2410-387X/9.

Additionally, we welcome your submissions if you have relevant papers to
be submitted. Please contact the journal editorial office
cryptography@mdpi.com.

Best regards,
Xue Cheng
Managing Editor
--
MDPI Branch Office, Wuhan
Cryptography Editorial Office
https://www.mdpi.com/journal/cryptography
MDPI, Grosspeteranlage 5, 4052 Basel, Switzerland

Twitter: @Cryptogr_MDPI https://twitter.com/Cryptogr_MDPI
LinkedIn: Cryptography-MDPI
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Fully Funded PhD Position in TCS and Machine Learning

The Department of Computer Science at the University of Alaska Fairbanks
invites applications for a fully funded PhD position in Theoretical
Computer Science and Machine Learning, beginning in the fall semester of
2026.


Research Environment


The successful candidate will join a research group active in:


• *Theoretical Computer Science, including*


– Graph Algorithms

– Computational Complexity and Fine-grained Complexity

– Computational Geometry


• *Machine Learning, with a particular focus on*


– Dataless Neural Networks

– Theory-inspired learning models


The specific PhD research project will be defined collaboratively with the
student, based on their background, interests, and strengths, and aligned
with the group's broader research directions.


The PhD position is fully funded for the first three years.


*Desired Background*


Applicants are expected to have:


• A Master's degree in Computer Science, Mathematics, or a closely related
field, with strong

preparation in algorithms, theory, or discrete mathematics

• Strong mathematical maturity and interest in foundational and algorithmic
research

• Demonstrated motivation for research at the intersection of theory and
learning

• Programming knowledge in Python is desired


Exceptional candidates with equivalent preparation may also be considered.


*How to Express Interest*


Interested candidates are encouraged to contact directly:

*Dr. Sangram K. Jena*

*Assistant Professor, Department of Computer Science*

*University of Alaska Fairbanks*

*skjena@alaska.edu <skjena@alaska.edu>*


Initial contact may include a brief description of academic background,
research interests, and

a CV. Informal inquiries are welcome.


Note: Formal application procedures and timelines will be discussed with
shortlisted candidates.

--
*~Best regards,*
*/ **Sangram K Jena**, Ph.D. ** (*he/him)

Assistant Professor

University of Alaska Fairbanks

Department of Computer Science

525 Duckering Building

Fairbanks, AK 99775

907-474-5829

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Final Call: Xpress Best Paper Award

The Xpress Best Paper Award 2026 nomination deadline is on Feb 14, 2026!
We invite you to nominate or self-nominate papers.
The Xpress Best Paper Award acknowledges outstanding papers in the named areas in which the usage of FICO Xpress Optimization products played a significant role.
Papers published in the two years between January 1, 2024, and December 31, 2025, will qualify for the fourth edition awarded in 2026.
The award includes a $1,500 cash prize.

Detailed information can be found at this blog https://community.fico.com/s/blog-post/a5Q4w000000403KEAQ/fico4407 or the award homepage https://www.i2damo.de/de/xpress-best-paper-award .
Also, see these blogs about the winners of the past three years:
- https://community.fico.com/s/blog-post/a5QQi0000067HNFMA2/fico6140
- https://community.fico.com/s/blog-post/a5QQi000002rzAfMAI/fico5205
- https://community.fico.com/s/blog-post/a5Q4w000001UfWLEA0/fico4101
Please feel free to contact me with any questions.


Timo Berthold, on behalf of the award committee (Layla Martin, Ivana Ljubic, Stefano Gualandi, Ambros Gleixner)
This email and any files transmitted with it are confidential, proprietary and intended solely for the individual or entity to whom they are addressed. If you have received this email in error please delete it immediately.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Final CfPart: AQUARIUM 2026 - Workshop on Automated QUAntification of Risk In Uncertain Models

# CALL FOR PRESENTATION / PARTICIPATION

1st Workshop on Automated QUAntification of Risk In Uncertain Models
(AQUARIUM)
Lancaster University Leipzig, Leipzig, Germany

- Talk Proposal Submission: 15.02.2026 (AoE) (extended)
- Notification: 17.02.2026 (AoE)
- Workshop: 24.-25.03.2026

Website with up-to-date information:
https://wp.lancs.ac.uk/aquarium-workshop/

Participation without own submission/presentation is also possible. In
that case, please contact Tobias Meggendorfer directly.

# SCOPE

While established in finance and operations research, formally
quantifying (and managing) risk is an emerging topic in various fields
connected to automated (sequential) decision making, e.g. verification
or reinforcement learning. There are numerous ways to quantify risk and
similarly many sources, e.g. probabilistic uncertainties or lack of
knowledge. AQUARIUM aims to bring together researchers investigating
different notions of risk and foster exchange between them.

Topics of interest include but are not limited to:
- Different definitions of risk and their properties
- Different sources of risk, such as stochastic or epistemic
uncertainties or varying models, such as attack-defense / fault trees
and multi-agent systems
- Complexity analysis of and algorithmic solutions for automated
risk-aware decision making
- Case-studies and real-world applications of risk
- Connections between risk and security

# SUBMISSION GUIDELINES

To give a presentation at the workshop, please submit a (non-anonymous)
abstract / talk proposal (1-2 pages, excluding references) via easychair:

http://easychair.org/conferences?conf=aquarium2026

Please use the Springer LLNCS LaTeX style to prepare your submission.
The workshop won't have formal proceedings. You are free / encouraged to
submit work for presentation that is or will be published elsewhere.

# FORMAT

The workshop is planned as a two-day event (ending around noon), with a
mixture of presentations and guided discussion sessions. To encourage
lively exchange, the workshop is planned as in-person only. Leipzig is
well connected and easily reached by car, train, or plane. There are
many hotels within walking distance, and we can offer special rates for
several of them.

We can also support travel and accommodation costs for a limited number
of participants, prioritizing early-career researchers. Please contact
Tobias Meggendorfer (see below) in case you require support.

# ORGANIZERS

- Christel Baier
- Tobias Meggendorfer
- Maximilian Weininger

Please contact Tobias Meggendorfer ( t.meggendorfer@lancaster.ac.uk )
about any arising questions.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD position in machine learning at KTH (Sweden)

We invite applications from talented and highly motivated candidates to pursue a PhD degree in machine learning. The research team focuses on developing novel methods to extract knowledge from data, modelling large-scale complex systems, and exploring new application areas in data science. Areas of interest include but are not limited to models and algorithms for knowledge discovery, novel algorithmic and statistical techniques for big data management, optimization for machine learning, analysis of information and social networks, fairness, accountability, and transparency in learning systems.

Applicants must hold a Master's degree by the time of enrollment. Successful candidates should be highly self-motivated and committed to publishing and presenting high-quality research. Solid background in algorithms design, machine learning, and optimization is essential, along with strong programming and implementation skills.

The advertised position is funded by Wallenberg AI, Autonomous Systems and Software Program (WASP), Sweden's largest individual research program ever, a major national initiative for strategically motivated basic research, education and faculty recruitment. The program addresses research on artificial intelligence and autonomous systems acting in collaboration with humans, adapting to their environment through sensors, information and knowledge, and forming intelligent systems-of-systems. The vision of WASP is excellent research and competence in artificial intelligence, autonomous systems and software for the benefit of Swedish industry.

Supervision: Aristides Gionis (KTH)

Applications must be made online through the KTH job portal. Full position details, including how to apply online can be found at:

https://www.kth.se/lediga-jobb/898611?l=en

The deadline for online applications is March 5, 2026.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD position in models, algorithms, and optimization for machine learning. Joint degree in KTH (Sweden) and NTU (Singapore)

We invite applications from talented and highly motivated candidates to pursue a PhD in machine learning at KTH, Sweden, and NTU, Singapore. This is a fully funded, joint doctoral position that will lead to a joint PhD degree awarded by KTH and NTU. The successful candidate will be supervised by professor Aristides Gionis (KTH), associate professor Kelly Ke Yiping (NTU), and assistant professor Sebastian Dalleiger (KTH). The doctoral student will be recruited and formally enrolled at KTH, and will be required to spend a minimum of 12 months at NTU in Singapore as part of the joint program. The research project is broadly situated in the field of machine learning. Potential research topics include, but are not limited to, algorithmic knowledge discovery, graph mining and social network analysis, optimization for machine learning, representation learning, and fair, accountable, and transparent machine learning.

Applicants must hold a Master's degree by the time of enrollment. Successful candidates should be highly self-motivated and committed to publishing and presenting high-quality research. Solid background in algorithms design, machine learning, and optimization is essential, along with strong programming and implementation skills.

Supervision: Aristides Gionis (KTH), Sebastian Dalleiger (KTH), Kelly Ke Yiping (NTU)

Applications must be made online through the KTH job portal. Full position details, including how to apply online can be found at:

https://www.kth.se/lediga-jobb/898105?l=en

The deadline for online applications is March 5, 2026.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD school on robust optimization in Porquerolles (France) - september 2026 - 2nd call

Dear all

This is the second call for the PhD school on robust optimization at IGESA in Porquerolles (https://maps.app.goo.gl/VismMQ5mrYzMPdDr5), on September 7-11 2026. The school will cover basics of static, adjustable, combinatorial robust optimization, as well as distributionally robust optimization, see the website https://ro2026.sciencesconf.org/?lang=en

The cost of the school will be around 800€ for 4 nights (Monday - Friday), everything included.

To apply to the school, please send a CV to poss@lirmm.fr, with topic « application to ROSCHOOL26 », no later than March 15th. Your CV should include :
a description of your thesis topic and ongoing research
a list of optimization classes that you have taken during your bachelor's, master's and/or doctoral studies

Best,

Michaël Poss


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] SISAP 2026: Call for Papers

============================================================================
====

19th International Conference on Similarity Search and Applications, SISAP
2026

October 14-16, 2026, Brno, Czech Republic

CORE Rank B conference, https://www.sisap.org/2026/

Topics in brief: Learned Similarity, Embeddings, Vector Databases, Scalable
Retrieval, Multimedia and Multimodality, Similarity Models and Theory, Demos
and Applications

============================================================================
====

**Important Dates**

Regular paper deadline: May 29, 2026 (AoE)

Demonstration and Doctoral Symposium paper deadline: June 17, 2026 (AoE)

Special Session proposals: February 27, 2026 (AoE), more info below

SISAP Indexing Challenge: June 17, 2026 (AoE), more info below

**Scope**

The International Conference on Similarity Search and Applications (SISAP)
focuses on research in similarity-based data management and retrieval, with
emphasis on embedding-based methods, vector databases, and
machine-learning-driven similarity search.

SISAP covers similarity models, indexing and query processing, scalable and
distributed similarity systems, learned and adaptive techniques, and
similarity-aware database architectures supporting high-dimensional and
multimodal data.

Originating from metric indexing research, SISAP is the only international
conference dedicated exclusively to similarity search, spanning theory,
systems, evaluation, and applications across data management, information
retrieval, and machine learning.

**Topics of Interest**

The SISAP conference solicits original research contributions on similarity
search and its applications. Topics of interest include, but are not limited
to:

Similarity Models and Theory

. Models of similarity and dissimilarity in metric and non-metric spaces

. Intrinsic dimensionality, concentration phenomena, hubness, and
discriminability

. Manifolds, embeddings, and geometric properties of similarity spaces

. Theoretical foundations and limits of similarity search and indexing

Learning and Representations

. Feature extraction and representation learning for similarity search

. Metric learning and learned similarity measures

. Embeddings from self-supervised and foundation models

. Multimodal and cross-modal similarity representations

Similarity Queries and Processing

. Similarity queries and operators (k-NN, range, reverse NN, top-k,
diversity queries)

. Exact, approximate, and probabilistic similarity search

. Similarity joins, ranking, filtering, and aggregation

. Query semantics and languages for similarity-based data

. Cross-modal similarity search

Indexing and Scalable Systems

. Indexing and access methods for similarity search

. Graph-based, tree-based, hashing, quantization, and hybrid approaches

. Learned and adaptive index structures

. Parallel, distributed, and GPU-accelerated similarity processing

. Dynamic, streaming, and update-aware similarity systems

Similarity-Aware Data Management

. Similarity search in database and data management systems

. Vector databases and similarity-native storage engines

. Query optimization and execution for similarity workloads

. Integration of similarity search with relational, graph, and hybrid
systems

. Cloud-native and large-scale similarity services

Evaluation and Benchmarks

. Evaluation methodologies and cost models for similarity processing

. Benchmark datasets, workloads, and experimental frameworks

. Accuracy-efficiency trade-offs and reproducibility

Applications

. Similarity search in multimedia, scientific, industrial, and emerging data
domains

. Similarity search in healthcare, sports, robotics, security, and other
fields

. Dense retrieval and semantic search

. Recommendation systems and personalization

. Search and question-answering within content collections

============================================================================
====

**Regular Papers**

Full papers (from 9 to 14 pages in Springer LNCS format) are expected to be
descriptions of complete technical work, whereas short papers (of up to 8
pages) can describe innovative approaches or preliminary results which may
nevertheless require more work to mature. Vision papers and other position
papers should be submitted as short research papers. Page limits include
references. Any appendices, if needed, can only be posted online, and the
reviewers are not expected to take them into account.

**Demonstration Papers**

Demonstration papers (of up to 8 pages in Springer LNCS format) should
provide the motivation for the demonstrated concepts, the information about
the technology and the system to be demonstrated, and should state the
significance of the contribution. The scenarios within which the
demonstrated system applies should also be explained. Evaluation criteria
for the demonstration proposals include: novelty, technical advances and
challenges, and the overall practical attractiveness of the demonstrated
system. A demonstration submission consists of a paper and an additional
1-page appendix (in PDF format) that illustrates how the demo will be
conducted on-site at SISAP. This additional content will not be published in
the conference proceedings, should the submission be accepted.

**Doctoral Symposium Papers**

A submission to the doctoral symposium consists of a paper and an additional
1-page appendix (both in PDF format), which must be single-author and
written by the student alone. The paper should be no longer than 6 pages in
Springer LNCS format (plus up to 2 pages of references). The paper must
describe the problem being addressed, an outline of the planned methodology,
contributions made so far, and the work lying ahead as part of the author's
PhD study. The additional 1-page appendix will not be published in the
conference proceedings, should the submission be accepted. This appendix
should describe the benefits that would be obtained by attending the
doctoral symposium, namely the student's motivation to attend SISAP, and
their advisor's word on how the student would benefit by attending the
Doctoral Symposium.

============================================================================
====

**Special Session Proposals**

We also welcome special sessions at the conference. Special sessions are
mini-venues that introduce new directions related to the SISAP topics of
interest, but not explicitly listed. Special sessions are typically
organized as a moderated panel, where the authors of special-session papers
will discuss their topic with the panelists. It is expected that special
session chairs and panelists will attend the conference. Special session
papers will supplement the regular research papers and be included in the
LNCS proceedings of SISAP 2026.

Learn more: https://www.sisap.org/2026/call4specialsession.html

============================================================================
====

**SISAP Indexing Challenge**

SISAP Indexing Challenge is an event for researchers and practitioners aimed
at advancing the state-of-the-art in large-scale similarity data management.
The challenge provides a platform to showcase innovative solutions and push
the boundaries of efficiency and effectiveness in indexing, filtering, and
searching. The results provide valuable comparisons of competing approaches
and their implementations from given viewpoints and environments. It is
expected that participants prepare a detailed report of their solution and
results in a typical SISAP's short-paper format, which will be included in
the LNCS proceedings of SISAP 2026.

Learn more: https://www.sisap.org/2026/indexingchallenge.html

============================================================================
====

Dr. Vasileios Mezaris

Research Director

Head of Intelligent Digital Transformation Laboratory

Information Technologies Institute (ITI)

Centre for Research and Technology Hellas (CERTH)

6th Km Charilaou-Thermi Road

P.O. Box 60361, 57001 Thermi-Thessaloniki, Greece

Tel: +30 2311 257770, email: bmezaris@iti.gr

web: <http://www.iti.gr/~bmezaris> http://www.iti.gr/~bmezaris

CONFIDENTIALITY NOTICE: The information in this email and any attachments
thereto are confidential, except where the e-mail specifically states that
its contents can be disclosed, and is intended solely for the use of its
intended recipient(s). It may also be subject to legal privilege or
otherwise protected from disclosure. If you are not the intended recipient
of this communication, you are hereby notified that any disclosure, copying,
distribution, or use of the information contained in or attached to this
e-mail is strictly prohibited. Please refrain from disclosing its contents
to any third party, but notify the sender immediately and make sure to
delete and permanently destroy the e-mail (including any attachments
thereto) from your filing systems. Internet communications are not secure
and therefore sender/CERTH does not accept any liability for the contents of
this message and for any damage whatsoever that may be caused by viruses.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP Computational optimization

Call for Papers

19th International Thematic Track/Workshop on Computational Optimization
(CO25)
Riga, Latvia, August 23-26, 2026

organized in the framework of CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2026


IEEE CS is a technical co-sponsor of FedCSIS 2026

https://2026.fedcsis.org/thematic/co
===============================

We invite original contributions related to both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing techniques
and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are not
limited to:

* classical operational research problems (knapsack, traveling salesman,
etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics, chemistry,
biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best CO26 paper will be awarded during the social dinner of FedCSIS2026.
The best paper will be selected by CO26 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.

===============================

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 12 pages for regular paper
and 6 pages for short papers (IEEE style). IEEE style templates are
available at http://2026.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the track.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at CO26 will be published
in edited book of the series "Studies of Computational Intelligence",
Springer with SJR 0.237.

===============================

Important dates:


+ Paper submission (strict deadline): April 15, 2026, 23:59:59 pm HST
(there will be no extension)
+ Position paper submission: May 19, 2026
+ Author notification: June 16, 2026
+ Final paper submission and registration: June 30, 2026
+ Conference date: August 23-26, 2026

===============================================================================
Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
co@fedcsis.org

===============================

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP Enviroriscs 2026

Dear Colleagues,

We are happy to inform you that the *International Conference EnviroRisks*
will be held in the period *0**1**-0**3** June 202**6**, Sofia**, Bulgaria*.
The conference will provide an excellent international forum for
dissemination of original research results, new ideas and practical
development experiences which concentrate on both theory and practices of
the academics, researchers, engineers and also industry professionals.

*All accepted and presented papers will be submitted* *for publication** to
the SPRINGER **Series* *"Lecture Notes in Networks and Systems"**.*

*Please**, **visit the conference web page for more details:
**https://envirorisks.cmdrcoe.org/*

*Topics of interest for submission include, but are not limited to:*

*1. Disaster Management, Natural Hazards, Risk reduction and Building
Resilience*

*2. **Environmental Degradation*

*3**. **Resilience and Business Continuity Management*

*4. **High Performance Computing, Modeling & Simulations, GIS for
environmental monitoring and Artificial Intelligent *

Please, save the dates and feel free to circulate this message among your
friends.

*Important dates:*


*Abstract** Submission D**ate**: **01** of **March**, 202**6*

*Notification of Abstract Acceptance: **20 March, 2026*

*Full **Paper Submission D**ate**: **01 **of **April**, 202**6*
* Notification** for Paper Acceptance**: ** 01 **of **May**, 202**6*

*Final paper submission:** 20 of May, 2026*
*Conference Dates: **0**1**-**03** of **June**, 202**6*


*Best regards, **EnviroRISKs*
* Organizing Team E-mail: **envirorisks@gmail.com*


--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, February 12, 2026

[DMANET] [CFP] The 35th International Conference on Computer Communications and Networks (ICCCN 2026), July 27 - 30, 2026, Honolulu, Hawaii USA

*(Apologies if you received duplicate copies of this ICCCN 202**6 **CFP)*:

*Conference Papers submission* – *Deadline** Extended to**: **March 13**,
202**6*

*All Workshop Papers Submission* - *Deadline** Extended to**: **March 23**,
202**6*


Call for Papers: The 35th International Conference on Computer Communications
and Networks (ICCCN 2026), *July 27 - 30, 2026, Honolulu, Hawaii USA*

*http://www.icccn.org/icccn26/*

*ICCCN 2026 is Technically Co-Sponsored by the IEEE **and **IEEE
Communication Society. *

*Paper Submission link: **https://easychair.org/conferences/?conf=icccn2026
(for all Conference, Workshop, and Poster papers). The paper submission site is open.*

*ICCCN* is one of the leading international conferences for presenting
novel ideas and fundamental advances in the fields of computer
communications and networks. *ICCCN* serves to foster communication among
researchers and practitioners with *a common interest in improving computer
communications and networking through scientific and technological
innovation*.

*ICCCN 2026 will be conducted in person (onsite in-person presentations are
required by authors of all accepted papers; no remote/online presentations
are allowed).*

*Scope**:*

The primary focus of the *ICCCN 2026* conference is on new and original
research results in the areas of design, implementation, and applications
of computer communications and networks. ICCCN 2026 covers the following
technical *Tracks* (the detailed Track scope and descriptions are posted at

*http://www.icccn.org/icccn26/committeesandtracks/technical-tracks/index.html*
*):*

*Track 1: Infrastructure Networking Technologies*

· Dimitrios Pezaros, University of Glasgow, UK

· Ananthram Swami, DEVCOM Army Research Laboratory

· Feng Wang, Arizona State University

*Track 2: Network Architecture, Algorithm, Protocol, and Evaluation*

· Berk Canberk, Edinburgh Napier University, United Kingdom

· Kanchana Thilakarathna, University of Sydney

· Murat Yuksel, University of Central Florida

*Track 3: IoT and Cyber-Physical Systems*

· Fatemeh Afghah, Clemson University, USA

· Chiu Tan, Temple University

· Lei Xie, Nanjing University, China

*Track 4: Edge and Cloud Computing*

· Oliver Bringmann, Eberhard Karls Universität Tübingen, Germany

· Virginia Pilloni, University of Cagliari, Italy

· Yifan Zhang, Binghamton University

*Track 5: Mobile/Pervasive Communications, Networking and Sensing*

· Hao Han, Nanjing University of Aeronautics and Astronautics, China

· Tamer Nadeem, Virginia Commonwealth University

· Wei Wang, San Diego State University, USA

*Track 6: Social Networks, Extended Reality, and Metaverse*

· Bin Li, Penn State University, USA

· Yao Liu, Rutgers University

· Muhammad Shahzad, North Carolina State University

*Track 7: AI/ML for Networks & Networks for AI/ML*

· Ahmed Alkhateeb, Arizona State University

· Longfei Shangguan, University of Pittsburgh

· Cheng Zhang, Texas A&M University

· Yanfu Zhang, William & Mary

*Track 8: Security, Privacy, and Trust*

· Xinwen Fu, University of Massachusetts at Lowell

· Isabel Wagner, University of Basel, Switzerland

· Shucheng Yu, Yeshiva University, USA

· Chuan Yue, Colorado School of Mines

*Track 9: Emerging Topics in Networking (e.g., Quantum Networking,
Distributed Quantum Computing, Distributed Machine Learning)*

· Trung Q. Duong, Memorial University, Canada

· Nirmalaya Roy, UMBC, USA

· Jindi Wu, DePaul University, USA

*Instructions for Authors**:*

Submitted manuscripts must be formatted in standard IEEE camera-ready
format (double-column, 10-pt font) and must be submitted via EasyChair (
*https://easychair.org/conferences/?conf=icccn2026*
*; *this site is open now
) as PDF files (formatted for 8.5×11-inch paper). The manuscripts should be
no longer than *9 pages *including all figures/tables and references.
Submitted papers should not be previously published in or be under
consideration for publication in another conference or journal. *Paper
titles and/or author names cannot be changed and/or added to the
papers after the submission deadline or in the camera-ready version if
accepted.* The Program Committee reserves the right to not review papers
that either exceed the length specification or have been submitted or
published elsewhere. Submissions must include a title, abstract, keywords,
author(s) and affiliation(s) with postal and e-mail addresses. Note:
ICCCN'26 will select Best Paper and a runner-up paper to recognize the
research quality and excellence. The Program Committee reserves the right
to recommend some borderline conference papers to be accepted as *short
papers* in the conference (the short papers should be no longer than *6
pages *including all figures/tables and references).

*Review and Publication of Manuscripts**:*

Submitted papers will be reviewed by the TPC and judged on originality,
technical correctness, relevance, and quality of presentation (the review
process is single-blind). An accepted paper *must be presented at the
conference venue* by a *registered author* at the full registration rate.
Each full registration covers up to *two conference papers* authored by the
registered author. If the originally registered author is unable to attend
the conference due to extenuating circumstances, he/she must explicitly ask
for the transfer of registration to one of the other authors of the paper.
Please note that an author's registration cannot be transferred to a *nonauthor
presenter* under any circumstances. Accepted and presented (*onsite
in-person presentations are required by authors*) papers will be published
in the conference proceedings and IEEE Xplore.

*Workshops**:*
ICCCN 2026 workshops are exciting forums to present, discuss, and formulate
specialize topics and emerging hot research topics (new areas, new problems
or new methods). The workshops offer a perspective distinct from and
complementary to the research themes of the main conference. Workshop
papers should be no longer than *6 pages*including all figures/tables and
references. The detailed info can be found in each workshop's Call for
Papers from
*http://www.icccn.org/icccn26/workshop/list-of-workshops/index.html*
For any questions or additional information, please contact the Workshop
General or Workshop Program Chairs.

*Poster Papers**:*

ICCCN 2026 provides an opportunity to present in-progress work in the
fields of computer communications and networks. Topics of interest are the
same as the research topics in the ICCCN 2026 main conference Call for
Papers. Early implementations, prototypes, work-in-progress
systems/applications as well as commercial products that are related to the
topics are welcome. Presenting a poster is an effective way to obtain early
and valuable feedback from a knowledgeable crowd at the conference. Posters
must be formatted in standard IEEE camera-ready format (double-column,
10-pt font). Each poster submission must be no longer than *2 pages* including
all figures/tables and references.

*Important Dates**:* All times below are 11:59 pm (*Honolulu, Hawaii USA*);

*Conference and Poster papers:*

· *Abstract** due: March 7, 2026 (for main conference submissions
only)*

· *Full **Paper submission due: * *March 13**, 202**6*

· *Poster Paper** submission due**: March 2**9,** 202**6*

· *Acceptance Notification**: April **24**, 202**6*

· *Conference date**: July 27 -30, 2026*

*Workshop papers:*

· *Paper submission** due**: March **23,** 202**6*

· *Acceptance **Notification: April 2**9**, 202**6*

· *Workshop date**: **July 29 - 30**, 202**6*

*All **(conference/poster/workshops)* *Camera-Ready **Papers **Due**: *
*May **11**, 202**6** (Hard deadline)*

*Please refer to "Author Information" posted at the conference website for
more info on paper submission, presentation (onsite in-person presentations
are required by authors of all accepted papers) and related rules/policies.
A paper cannot be submitted to more than one Tracks at the same time.*

*Executive Chair**:* Krishna Kant, Temple University, USA (kkant@temple.edu)
*General Chair:* Ruidong Li, Kanazawa University, Japan (liruidong@ieee.org)
*TPC Co-Chairs:*
Qun Li, William & Mary, USA (liqun@cs.wm.edu)

Danda Rawat, Howard University, USA (danda.rawat@howard.edu)
*Workshops General Chair:*
Kewei Sha, University of North Texas, USA (comersha@gmail.com)
*Poster Chair:*

Wenjia Li, New York Institute of Technology, USA (wli20@nyit.edu)
*Local Arrangement Chair:*

Prof. Yi Zhu, Hawai'i Pacific University, USA (yzhu@hpu.edu)

*Publications **Co-Chair**s:*
Wei Tong, Nanjing University,China (wtong@nju.edu.cn)

Zhengrui Qin, Northwest Missouri State University, USA (zqin@nwmissouri.edu)
*Publicity Co-Chairs:*
(America) Mostafa Fouda, Idaho State University, ID, USA (mfouda@ieee.org)
(Europe) Zhengxin Yu, Lancaster University, U.K. (z.yu8@lancaster.ac.uk)
(Asia) Qiao Xiang, Xiamen University, China (qiaoxiang@xmu.edu.cn)
(Oceania) Wei Xiang, La Trobe University, Australia (W.Xiang@latrobe.edu.au)

*Publicity Chair for Workshops**:*
Zongxin Xie from Kennesaw State University, USA (zxie1@kennesaw.edu)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for papers - The 7th International Workshop on Energy Data and Analytics (EDA)

Dear DMANET readers,

Please find below the call for papers for The 7th International Workshop on Energy Data and Analytics (EDA).

In a nutshell
All information is available here: https://nfdi4energy.uol.de/updates/the-7th-international-workshop-on-energy-data-and-analytics-eda/

Important dates

*
Paper submission deadline: March 31, 2026
*
Notification of Acceptance: April 24, 2026
*
Camera-ready: May 12, 2026
*
Workshop: June 22, 2026

About the workshop
The 7th International Workshop on Energy Data and Analytics (EDA) is part of the 17th ACM International Conference on Future and Sustainable Energy Systems (ACM e-Energy 2026), which takes place within the inaugural ACM Sustainability Week at the Banff Centre (Banff, Canada). The workshop will be held on June 22, 2026, during the conference's affiliated workshops and tutorials day. The main conference runs from June 23–25, 2026.

Scope
The design of efficient, eco-friendly, and scalable energy systems is critical to addressing the environmental impacts of current energy practices, with renewable energy offering vast untapped potential. This workshop focuses on leveraging data-driven approaches and FAIR principles to enhance energy system innovation, addressing challenges in data availability, processing, and applications such as supply-demand predictions, predictive maintenance, and privacy-conscious analysis. With a special focus on FAIR data and the challenges and opportunities of research data and software since 2025, we invite experts from academia and industry to discuss their experiences and best practices in this domain.

The workshop invites submissions on the following topics – all of them specific to energy data or energy systems and their characteristics:

*
New approaches and techniques to analyze energy data and turn it into actionable insights
*
Data science for energy data
*
Tools and techniques for management and archival of energy data
*
Measurement data from field studies and real-world systems
*
Data from simulations of energy systems
*
Synthetic data generation techniques
*
Data visualization
*
Data integration and data quality issues
*
Data privacy and anonymization techniques
*
Modeling and representation of energy‐specific knowledge
*
Reusability of research data: challenges and success stories
*
Industrial data and IP-related challenges for data exchange

We are looking forward to your submission.

On behalf of the workshop chairs Astrid Nieße, Veit Hagenmeyer and me,
___________________________________________________

[http://www.dtu.dk/-/media/DTU_Generelt/Andet/mail-signature-logo.png]
Leoni Winschermann
Postdoc
DTU Wind and Energy Systems
Department of Power and Energy Systems
Section on E-Mobility and Prosumer Integration

lewin@dtu.dk

AHEAD project: https://horizon-ahead.eu/
www.dtu.dk/english


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: The 9th International Conference on Algorithmic Decision Theory (ADT 2026)

The 9th International Conference on Algorithmic Decision Theory (ADT 2026)
will be held at University Paris Dauphine-PSL on November 16-18, 2026

Established in 2009, the ADT conferences usually take place every two years
with the aim of gathering researchers interested in the algorithmic aspects
of decision theory. ADT seeks 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.

Important Dates

- Title and Abstract Submission: May 4th, 2026
- Full Paper Submission: May 11th, 2026
- Notification of acceptance: July 13th, 2026
- Final Version of Accepted Papers: August 11th, 2026
- Conference Dates: November 16th-18th, 2026
- Conference Webpage: https://adt2026.sciencesconf.org/
- Submission Webpage: https://cmt3.research.microsoft.com/ADT2026

About ADT 2026

The 9th International Conference on Algorithmic Decision Theory (ADT 2026)
focuses 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 but not restricted to:

- Algorithms
- Argumentation Theory
- Artificial Intelligence
- Computational Social Choice
- Database Systems
- Decision Analysis
- Discrete Mathematics
- Game Theory
- Machine Learning and Adversarial Machine Learning
- Matching
- Multi-agent Systems
- Multiple Criteria Decision Aiding
- Networks
- Optimization
- Preference Elicitation
- Preference Modeling
- Risk Analysis and Adversarial Risk Analysis
- Utility Theory

Submission Site and Details

Submissions are invited on significant, original, and unpublished research
on all aspects of Algorithmic Decision Theory. Papers must be at most 15
pages long in the LNCS format (including references). The formal
proceedings of ADT 2026 will be published by Springer in the Lecture Notes
in Artificial Intelligence (LNAI) <http://www.springer.com/lncs>.

ADT 2026 will not accept any paper that, at the time of submission, has
already been published in a journal or another venue with formally
published proceedings. However, in order to accommodate the publication
norms of the many fields that work on decision theory, papers can be
submitted but not already published elsewhere (i.e., are under review)
provided the authors note they are submitting for the non-proceedings track
at the top of their submission.

All papers will be peer-reviewed by a double-blind procedure. Therefore,
papers must be submitted anonymously as pdf documents via the Microsoft CMT
<https://cmt3.research.microsoft.com/ADT2026> system.

It is important and required that authors do not reveal their identities in
submitted papers. Since the review process is double blind, authors must
take measures to ensure that their identity is not easily revealed from the
submission itself. Authors should include the submission number (as
assigned by the conference system) in the author field of the submission,
and refer to their prior work in a neutral manner (i.e., instead of saying
"We showed" say "XYZ et al. showed"). It is acceptable to submit work that
has been presented in public or has appeared on arXiv, provided the
submission itself is anonymized.

Submission Format: Authors should consult Springer's authors' guidelines
and use their proceedings templates
<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>,
either for LaTeX or for Word, for the preparation of their papers. Note
that at least one author of each accepted paper is required to attend the
conference to present the work. Authors will be required to agree to this
requirement at the time of submission. In addition, the corresponding
author of each accepted paper that will appear in the proceedings, acting
on behalf of all of the authors of that paper, will need to complete and
sign a Consent-to-Publish form, through which the copyright for their paper
is transferred to Springer.

You may submit an appendix of any length into the CMT system. There is a
separate area in CMT for this, the appendix should be formatted in the same
way as the main paper. Please note that reviewers are not required to review
the appendix so the paper should stand on its own.

To accommodate the publishing traditions of different fields, ADT 2026 will
accept two types of submissions:

Submissions with full text in the proceedings: Papers of this type will be
accepted for either oral or poster presentation, or both. Each accepted
paper of this type will be allocated at most 15 pages in the proceedings and
there will be no distinction between papers accepted for oral or poster
presentation in the conference proceedings.

Submissions with two-pages abstract in the proceeding: Papers of this type
will be accepted for either oral or poster presentation, or both. Each
accepted paper of this type will appear as a two-pages abstract in the
proceedings, along with a URL pointing to the full paper (on ArXiv or other
service). This option is available to accommodate subsequent publication in
venues that would not consider results that have been published in formal
proceedings. Specifically, the full version of the two-pages abstract at
ADT can be submitted to another archival conference or journal. Such papers
must be formatted just like papers submitted for full-text publication, at
the submission time, but authors are required to write "submission without
proceedings" into the author field of their paper (instead of author
names), if they choose this category. Otherwise, it will be assumed, by
default, that their paper is submitted in the first category (submissions
with full-text in the proceedings).

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, February 11, 2026

[DMANET] AAAC 2026 final call for papers

AAAC 2026 CALL FOR PAPERS
AAAC 2026
The 17th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2026) will take place on May 23 – 24, 2026, at Ocean University of China in Qingdao, China. We invite submissions of abstracts presenting original research or surveys of existing results in theoretical computer science. The meeting will be held in person, and at least one author of each accepted submission is required to register and present the talk on-site.
For more details about AAAC 2026, please visit the official conference website: http://math.ouc.edu.cn/aaac2026
Information about previous annual meetings can be found at http://www.asia-algo-comp.org
Invited Speakers
Donglei Du, University of New Brunswick
Ken-ichi Kawarabayashi, National Institute of Informatics
Program Committees
Hee-Kap Ahn, Pohang University of Science and Technology
Sang Won Bae, Kyonggi University
Ho-Lin Chen, National Taiwan University
Siu-Wing Cheng (Chair), The Hong Kong University of Science and Technology
Qizhi Fang, Ocean University of China
Minming Li, City University of Hong Kong
Chung-Shou Liao, National Taiwan University
Pinyan Lu, Shanghai University of Finance and Economics
Heejin Park, Hanyang University
Kunihiko Sadakane, The University of Tokyo
Xiaoming Sun, Chinese Academy of Sciences
Takehiro Ito, Tohoku University
Ryuhei Uehara, Japan Advanced Institute of Science and Technology
Guochuan Zhang, Zhejiang University
Shengyu Zhang, The Chinese University of Hong Kong
Local Organizers
Bin Liu, Ocean University of China
Wenjing Liu, Ocean University of China
Han Xiao, Ocean University of China
Yulin Chang, Ocean University of China
Kaixin Gao, Ocean University of China
Topics
All areas of theoretical computer science, especially design and analysis of algorithms and complexity theory.
Submissions
Authors are invited to submit a single-page abstract (A4 size, PDF format) that may present original research results or surveys of existing results. Informal working notes containing all accepted abstracts will be distributed to conference participants. This distribution will not constitute prior publication and does not preclude future submissions of the work to journals or conferences. Submissions must be uploaded via the EasyChair Conference System by the deadline: https://easychair.org/conferences?conf=aaac2026
Important Dates
• Submission Deadline: February 20, 2026 (Friday), AoE
• Notification: March 27, 2026 (Friday), AoE
• Camera-ready Deadline: April 10, 2026 (Friday), AoE
• Early Registration Deadline: April 17, 2026 (Friday), AoE
• Conference Dates: May 23 (Saturday) – 24 (Sunday), 2026
Best Student Presentation Award
The Best Student Presentation Award will be presented to an outstanding conference presentation. To be eligible, the presenter must be a full-time student at the time of the conference. The award will be determined by PC members.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************