[DMANET] PODS 2026 Call for Papers (second cycle)

PODS 2026: ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
May 31 - June 05, 2026, Bengaluru, India
https://2026.sigmod.org/index.shtml
CALL FOR PAPERS
* The PODS symposium series, held in conjunction with the SIGMOD
conference series, provides a premier annual forum for the
communication of new advances in the theoretical foundation of
database systems. Original research papers
providing new insights in the specification, design, or implementation
of data management tools are called for.
* Topics that fit the interests of the symposium include the following
(but not limited to) as pertaining to databases: algorithms; complexity;
computational model theory; concurrency; constraints; data exchange;
data integration; data mining; data modeling; data on the Web; data
streams; data warehouses; distributed databases; information
retrieval; knowledge bases; logic; multimedia; physical design;
privacy; quantitative approaches; query languages; query optimization;
real-time data; recovery; scientific data; security; semantic Web;
semi-structured data; spatial data; temporal data; transactions;
updates; views.
* Important dates:
- Abstract deadline: December 3, 2025
- Full paper submission deadline: December 10, 2025
- Rebuttal: Jan 26 - 29, 2026
- Initial notification: February 8, 2026
- Revision submission: February 22, 2026
- Final notification: March 1, 2026
* Submission Site and Format
All submissions must be made to https://www.easychair.org/my/conference?conf=pods2026.
LaTex users must format their submission using the standard ACM "acmsmall" proceedings stylesheet: https://www.acm.org/publications/proceedings-template. A submission can be up to 15 pages, not including references, plus unlimited space for references. PODS 2026 will use a lightweight double-anonymous reviewing process. For more precise instructions, please see https://2026.sigmod.org/calls_papers_pods_research.shtml

**********************************************************
*
* 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] World Wide Women (W^5) in OR

World Wide Women (W^5) in OR
Friday 12th Dec 2025, 16:00 - 17:00 (Central European Time)

WISDOM, WORAN, Women in OR/MS, Women in Latin American, Africa and Asia OR Societies invite you to a Winter Webinar. This is an opportunity to build connections across women in operations research societies, identify common goals and grow together. To receive the Zoom link in the week leading up to the webinar, follow the link below. https://docs.google.com/forms/d/e/1FAIpQLScQNH5FnrfphZPqzE1u-pgBN_aJCKnRe8UNSpvaQ5Ps_0quYg/viewform

Looking forward to seeing you at W^5 in OR!

WISDOM (https://www.euro-online.org/web/pages/1654/wisdom) is a forum to support, empower, and encourage the participation of all genders in Operational Research and Management Science. It is an initiative supported by EURO, the Association of European Operational Research Societies.

WORAN (https://www.theorsociety.com/get-involved/society-groups/special-interest-groups-and-networks/women-in-or-analytics-network/) is a forum to advance knowledge, interest and education in operational research, in as far as this concerns women. It is an initiative supported by the Operational Research Society of the UK.

WORMS (https://connect.informs.org/worms/home) is a forum to encourage interest in and discussion amongst individuals regarding issues facing women in the field of operational research and the management sciences, and to advise the INFORMS board accordingly. It is an initiative supported by INFORMS, the Institute for Operations Research and the Management Sciences.

GLOW is an IFORS initiative to connect, empower and promote women in Operations Research (OR) from around the globe.
**********************************************************
*
* 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] AIces 2026: early registration December 13

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

1st INTERNATIONAL SCHOOL ON THE COGNITIVE, ETHICAL AND SOCIETAL DIMENSIONS OF ARTIFICIAL INTELLIGENCE

AIces 2026

Porto – Maia, Portugal

March 30 – April 2, 2026

https://aices.irdta.eu/2026/

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

Co-organized by:

University of Maia

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

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

Early registration: December 13, 2025

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

SCOPE:

AIces 2026 will be the first in a series of research training events aiming at updating participants on the most recent multidisciplinary discussions about the foundations, meaning, challenges and risks of AI.

The event will have a global scope along 3 thematic lines: cognition, ethics, and society. It will cover current debates about: AI and philosophy of mind; cognitive architectures; machine learning and cognitive development; large language models and visual information; robotics and embodied cognition; neuroscience-inspired AI; algorithmic bias and fairness; transparency and explainability; accountability and responsibility; privacy and surveillance; autonomy and control; AI impact on human values and social inequalities; the future of work and automation; governance, regulation and public policies; AI, human rights and democracy; AI and global development; information and AI education.

The event will consist of 10 courses, 2 keynote lectures, 3 symposia collecting short contributions from participants, and 3 open thematic debate sessions. 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:

Graduate students, postgraduate students and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees, so 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, AIces 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:

AIces 2026 will take place in Porto, the second largest city in Portugal, recognized by UNESCO in 1996 as a World Heritage Site. The venue will be:

University of Maia
Avenida Carlos de Oliveira Campos - Castêlo da Maia
4475-690 Maia
Porto, Portugal

https://www.umaia.pt/en

STRUCTURE:

2 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.

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.

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

KEYNOTE SPEAKERS:

David Danks (University of Virginia), Trustworthy AI in an Untrustworthy World

Ming Lin (University of Maryland), Socially Responsible and Trustworthy AI

PROFESSORS AND COURSES:

Ricardo Baeza-Yates (Barcelona Supercomputing Center), [introductory] Introduction to Responsible AI

Susan Brennan (Stony Brook University), [introductory/advanced] Where Are the Humans in Human-Centered AI?

Thomas Breuel (Nvidia Research), [introductory] Facts and Rules in LLMs

Carlos Castillo (Pompeu Fabra University), [introductory] Algorithmic Fairness in High-Risk AI Applications

Alan Dix (Cardiff Metropolitan University), [introductory] AI for Social Justice

Elia Formisano (Maastricht University), [introductory/intermediate] Auditory Cognition in Humans and Machines

Marijn Janssen (Delft University of Technology), [introductory/advanced] Data and AI Governance - From Control to Trust

Christian Lebiere (Carnegie Mellon University), [intermediate] Computational Cognitive Models of Human-AI Teaming

Paul Smolensky (Johns Hopkins University), [intermediate/advanced] Symbol Processing in Transformers and Other Neural Networks

Savannah Thais (City University of New York), [intermediate/advanced] Measurement for Safer AI

SYMPOSIA:

A symposium will collect 10-minute voluntary presentations by participants on any of the 3 thematic areas of the event: cognition, ethics, and society. A 1-page abstract containing the title, authors, and summary of the presentation must be sent to david@irdta.eu by February 28, 2026.

OPEN DEBATES:

An open debate session will be organized for each of the 3 thematic areas of the school: cognition, ethics, and society. A 2-page expression of interest to lead the respective session including the topics to be debated, the structure, call for contributions, and dynamics of the session must be sent to david@irdta.eu by December 30, 2025.

SPONSORS:

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

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

ORGANIZING COMMITTEE:

Samuel Anjos (Maia, social networks)
Osheen Jain (London, communications)
José Paulo Marques dos Santos (Maia, local chair)
Carlos Martín-Vide (Tarragona, program chair)
Santiago Montes (Tarragona, webpage)
Sara Morales (Luxembourg)
José Luís Reis (Maia)
Luís Paulo Reis (Porto)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://aices.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 will be available in due time at

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

CERTIFICATE:

A certificate of successful participation in the event will be delivered indicating the number of hours of academic activities. 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:

Universidade da Maia

Universidade do Porto

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/
*
**********************************************************

[DMANET] Postdoc and PhD positions in combinatorial optimization and/or TCS in Lund

The Department of Computer Science at Lund University invites applications for postdoc and PhD positions in combinatorial optimization and/or theoretical computer science.

The researchers will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Groebner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.

Our most recent new line of research is on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our work on designing a new generation of certifying combinatorial solvers, which output not only an answer but also a machine-verifiable mathematical proof that this answer is correct, has already received several international awards, but many more exciting problems are still waiting to be solved!

The postdoc position is a full-time research positions for an intended duration of 2 years. The PhD position is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting dates are negotiable, but should ideally be in August-September 2026 or earlier. All positions in the research group are fully funded, employed positions (including travel money) that come with internationally competitive salaries.

The application deadline for both positions is January 16, 2026. For more information about the postdoc position see https://jakobnordstrom.se/openings/Postdoc-Lund-260116.html and for the PhD position see https://jakobnordstrom.se/openings/PhD-Lund-260116.html. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.
**********************************************************
*
* 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] 2nd Call for papers and deadline extension (Dec 15, 2025): 20th International Workshop on Project Management and Scheduling – PMS 2026 - 14-16 april 2026, LAAS-CNRS, Toulouse, France

(sorry for multiple copies)

Dear colleagues

PMS is an international workshop series initiated by the EURO Working Group on Project Management and Scheduling. The workshop is held every two years in different locations in Europe and brings together researchers and practitioners from Computer Science, Operations Research, Optimization Engineering, Mathematical Programming, and Industrial Engineering. The scientific program covers a broad range of topics related to Project Management and Scheduling, including both theoretical and applied research.

The 20th International Workshop on Project Management and Scheduling – PMS 2026 – takes place from April 14 to 16, 2026, at LAAS-CNRS in Toulouse, France.

Please visit https://pms2026.sciencesconf.org/.

For guidelines and templates, please visit the Extended Abstract Submission page.

LATEST NEWS

— Extended (final) deadline for paper submission is December 15, 2025.

— Prof. Norbert Trautmann (Universität Bern) will give a plenary talk on "Mathematical Programming in Project Scheduling". More Plenary speakers will be announced soon.

— A Master Class for young researchers on Constraint Programming and Scheduling, including tutorials and practice sessions, will be organized the day before the workshop, on April 13, 2026. The following lectures will be given:
- Cédric Pralet "Basics of CP based scheduling and applications to Space"
- Margaux Nattaf "Global scheduling constraints »
- Emmanuel Hebrard, a tutorial on Tempo, a CP/SAT hybrid solver + hackathon !

— Registration is now open. Master class registration is also open (for phD students attending the workshop only).

— A special issue of the Journal of Scheduling will be devoted to PMS 2026

SPONSORS

We warmly thank the sponsors: EURO, Hexaly, Labex CIMI and OptalCP.

WORKSHOP TOPICS and SUBMISSION DETAILS

The workshop covers the following (non-exhaustive) list of topics:
• Project Management: network modeling, project scheduling, project scheduling under uncertainty, project risk management and control, multi-project scheduling, resource management, due-date management, applications and software
• Machine Scheduling: shop scheduling, parallel machine scheduling, scheduling with additional constraints, machine assignment and scheduling, flexible/robust scheduling, grid scheduling, multicriteria scheduling, applications and software

Methodological and theoretical papers related to Operations Research, Artificial Intelligence/Machine Learning models and exact and heuristic algorithms for scheduling problems are welcome. Submissions of papers on data-driven approaches, practical applications, and industrial case-studies are also encouraged.

All researchers, academics, PhD students, and practitioners working on these themes are invited to join PMS 2026 by submitting an extended abstract (max. 4 pages). All submissions will undergo a standard reviewing process of international workshops, and a selection of submissions will be presented during the workshop. After the workshop, authors will have the opportunity to submit full papers to a special issue of an international journal.

We are looking forward to your submission and your participation in the workshop!

Best regards

The PMS2026 organizing team

Please contact pms2026@sciencesconf.org for any question

**********************************************************
*
* 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] Extended Submission Deadline – ITOR Special Issue “Cutting and Packing”

Dear colleagues,

We are pleased to announce that the submission deadline for the International Transactions in Operational Research (ITOR) Special Issue "Cutting and Packing" has been extended to 31 January.

This Special Issue welcomes recent advances in C&P problems—both methodological and application-driven. Topics include (but are not limited to):
• 1D, 2D, and 3D cutting and packing
• Bin packing, knapsack, strip packing, nesting, container loading
• Irregular shapes, industrial applications, and benchmark problems
• Integration with sequencing, lot sizing, etc.
Submission site: https://wiley.atyponrex.com/journal/ITOR

When submitting your manuscript, please select the Special Issue "Cutting and Packing" from the list of available special issues on the submission platform and indicate in the cover letter that your paper is intended for this issue.

For questions, feel free to reach out to any of the Guest Editors below.

Best regards,
Ana Moura — ana.moura@ua.pt
António Galrão Ramos — agr@isep.ipp.pt
Elsa Silva — elsa@dps.uminho.pt
José Fernando Oliveira — jfo@fe.up.pt
Guest Editors, ITOR Special Issue on "Cutting and Packing"

**********************************************************
*
* 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] [HPDC] CFP: 35th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)

CALL FOR PAPERS

35th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)
July 13-16, 2026
Case Western Reserve University, Cleveland, USA
https://hpdc.sci.utah.edu/2026/

The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier annual conference for presenting the latest research on the design, implementation, evaluation, and use of parallel and distributed systems for high-end computing. The 35th HPDC will take place at Case Western Reserve University in Cleveland, Ohio, United States, from July 13 to 16, 2026.

We welcome submissions on high-performance parallel and distributed computing (HPDC) topics, including but not limited to: clouds, clusters, grids, big data, massively multicore, and extreme-scale computing systems. Experience reports of operational deployments that provide significantly novel insights for future research on HPDC applications and systems are also welcome.

Important Dates
January 29, 2026. Abstract Registration (Technical Papers)
February 5, 2026. (Firm) Paper Submission Deadline (Technical Papers)
March 31, 2026. Notification of Acceptance (Technical Papers)

Please visit https://hpdc.sci.utah.edu/2026/calls-cfp.html for more details.

Best Regards,
Publicity Chairs of HPDC'26

===================================
Best Regards,
Amir Raoofy
Future Computing Group
Leibniz Supercomputing Centre
Boltzmannstr. 1, 85748 Garching b. München



**********************************************************
*
* 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] Post-doc position in Geometric Graph Theory in Grenoble (France)

The Combinatorial Optimization group of Laboratoire G-SCOP in Grenoble, France https://g-scop.grenoble-inp.fr/en/research/combinatorial-optimisation is advertizing a 12 month postdoctoral position on the topic of geometric graph theory (including coarse equivalents of classical graph theorems and parameters, asymptotic minors, coarse embeddings).

Candidates with a background on algorithmic, structural, and/or metric graph theory are welcome to apply. Please don't hesitate to contact louis.esperet@grenoble-inp.fr if you have any question.

The starting date of the position is planned to be in September or October 2026 but can be negotiated. The gross salary will be between 2900 and 3300 euros per months, depending on the candidate's experience (this corresponds to a net pay of approximately 2150-2400 euros per month).

The position is funded by the French ANR project Mimétique on coarse graph theory and the successful candidate will have the opportunity to work with colleagues from LaBRI (Bordeaux), LIRIS (Lyon), IMAG (Montpellier), and LIS (Marseille) on topics of the project. The website of the project is not up yet, but the candidates can either refer to the list of topics included above or ask me by email for the 20p pdf of the whole proposal.

Applications consisting of
* a CV (containing background education and employment, complete list of publications available online, selected list of talks and attended events, supervision experience if any, community service if any)
* a Research statement, 1 or 2 pages (discussing strategy for choosing research projects, interest in one or more topics of the Mimétique project, adequation with current expertise, possibly ongoing projects that are relevant to the application)
* the names, affiliations and emails of two references

should be submitted either on https://grenoble-inp.nous-recrutons.fr/poste/qp68masdlb-chercheur-en-theorie-geometrique-des-graphes-fh/ or https://euraxess.ec.europa.eu/jobs/390525
before December 16, 2025.

**********************************************************
*
* 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] Two 4-year PhD student positions in algorithms and complexity at Humboldt-Universität zu Berlin (application deadline is December 5)

Department of Computer Science
Humboldt-Universität zu Berlin

2 PhD student positions in algorithms and complexity
Research Assistant (100% TV-L E 13), 4 years

Two 4-year PhD student positions in algorithms and complexity are
available in the research group of Prof. Stefan Kratsch at the
Department of Computer Science at Humboldt-Universität zu Berlin.
Preferably, the positions start no later than March 1, 2026.

https://haushalt-und-personal.hu-berlin.de/de/personal/stellenausschreibungen/an40625

The positions are full-time for four years and paid according to TV-L E
13. (Salary depends on experience and amounts to at least 4600 Euros per
month before taxes and insurance.)

There is a teaching requirement of 4 hours per week, which will usually
be fulfilled by giving two exercises (tutorials) for lectures such as
"Introduction to TCS" and "Algorithms and Data Structures". These
exercises must be given in German, so at least B2 level in German is a
mandatory requirement.

The PhD students will do research under the guidance of Stefan Kratsch
on topics from algorithms and complexity, especially parameterized
algorithms and kernelization. There will be opportunity for attending
international conferences and having external collaborations. The aim is
to complete and defend a doctoral thesis within the 4 years of contract.

Requirements
• very good Master degree in computer science or mathematics (latest by
end of 2025)
• very good knowledge in algorithms and complexity, exhibited by
completed lectures and the master thesis
• very good language skills in German and English (at least B2 or
equivalent)
• prior experience in teaching, e.g., as a student assistant, is welcome

Duties
• teaching obligation of 4 hours per week during lecture periods
(especially exercises in German)
• research in algorithms and complexity, especially parameterized
algorithms and kernelization

Interested applicants should send their application containing
• a cover letter describing the interest in the position
• a CV
• a copy of the Master thesis
• a copy of your Master certificate and grades
• and optionally names and contact information of two references

in pdf format
by December 5, 2025
to Prof. Stefan Kratsch
stefan.kratsch@hu-berlin.de


Prof. Stefan Kratsch
Department of Computer Science
Humboldt-Universität zu Berlin
Unter den Linden 6
D-10099 Berlin
Germany
**********************************************************
*
* 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 : International Network Optimization Conference 2026 (INOC2026)

INOC 2026 - Call for Papers
===========================

INOC 2026, the International Network Optimization Conference, provides a
forum for researchers in the broad field of network optimization to
present and publish their latest results and ongoing research. INOC is
the conference of the European Network Optimization Group (ENOG), a
working group of EURO, the Association of European Operational Research
Societies. The aim of this conference is to provide conference of the
European Network Optimization Group (ENOG), a working group of EURO. The
conference has been held biennially since 2003, the latest in 2024 at
the University College Dublin (Dublin, Ireland).

INOC 2026 is the 12th conference of this group and will take place at
HEC Liège, the Management School of Liège University, Liège, Belgium,
April 22-24, 2026.

Topics of Interest
------------------

INOC solicits contributions in the broad field of Network Optimization,
from the areas of Mathematical Optimization, Operations Research,
Artificial Intelligence and Graph Theory. Application-oriented network
optimization from areas like Telecommunications, Routing, Smart Grids,
and Logistics are most welcome. Topics include but are not restricted
to:

- AI and Machine Learning for Network Optimization
- Algorithmic Game Theory on Networks
- Approximation Algorithms
- Combinatorial Optimization
- Connectivity Problems
- Graph Algorithms
- Graph Theory
- Heuristics and Meta-heuristics
- Mixed Integer Linear Programming
- Mixed Integer Nonlinear Optimization
- Multi-objective Optimization
- Multicommodity Flows
- Network Design
- Network Flows
- Network Interdiction
- Network Optimization
- Network Reliability
- Path and Tree Problems
- Robust Optimization
- Routing Algorithms
- Smart Grids
- Stochastic Networks
- Supply Chain Network Optimization
- Sustainable Mobility and Transportation
- Telecommunication Networks
- Transportation Networks
- Vehicle Routing

Submission Guidelines
---------------------

INOC accepts both short papers to be published in the proceedings and
extended abstracts to be published at the conference only:

- Short papers describing original work, not yet published or
submitted elsewhere. Short papers can be up to 6 pages (with two
columns) long.
- Extended abstracts describing recent results and ongoing research
can be up to 2 pages long.

All submissions must be formatted with the Latex templates provided and
submitted to https://easychair.org/conferences/?conf=inoc2026.

For short papers, please use the template and style files in
https://www.euro-online.org/inoc2026/cfp/INOC_short_paper_template.zip.

For extended abstracts, use the simple template in
https://www.euro-online.org/inoc2026/cfp/INOC-ext-abstract-template.zip.

Contributions will be peer-reviewed by the Programme Committee. The
proceedings will be published at OpenProceedings. After the conference,
extended papers can be submitted to a special issue of the journal
Networks.

Important Dates
---------------

Short papers submission deadline January 16
Extended abstracts submission deadline January 30
Notification of acceptance - Short papers January 30
Notification of acceptance - Extended abstracts February 13
Registration deadline March 6
Final version of short papers deadline March 6
Conference April 22-24
Full paper for the special issue of Networks deadline July 31

Contact
-------

You will find information about the conference and venue on the INOC
2026 webpage (https://www.euro-online.org/inoc2026/). If you don't find
the answer there, you can email your questions about INOC 2026 to
inoc2026@euro-online.org.

We look forward to seeing you in Liège!
**********************************************************
*
* 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] Jobs - Now Hiring: Research Positions in AI & Medical Robotics at TU Hamburg

*Now Hiring: Research Positions in AI & Medical Robotics at TU Hamburg*

Our institute, with a long-standing expertise in AI methods for
medicine, is seeking motivated researchers to develop and evaluate deep
learning methods.

Currently, we are looking for three Research Associates for the
following positions:

*Join our team* to develop AI methods for

1) guiding robotic surgery, focusing on prostate tumor localization,
including image processing and robotic instrument localization
https://stellenportal.tuhh.de/fgh8r <https://stellenportal.tuhh.de/fgh8r>

2) guiding the treatment during ear, nose, throat (ENT) surgery,
including image processing to identify tissue types and motion
https://stellenportal.tuhh.de/1tzyr <https://stellenportal.tuhh.de/1tzyr>

3) a mobile robotic setup for autonomous medical examinations, using
point cloud data and ultrasound imaging for navigation
https://stellenportal.tuhh.de/1r1v1 <https://stellenportal.tuhh.de/1r1v1>

*Your profile:*

* Master's degree with excellent grades in computer science or related
fields (e.g., engineering, robotics, applied mathematics),
* Very good programming skills (Python, C++),
* Excellent knowledge of machine learning methods and frameworks,
* Very good understanding of medical image processing,
* Excellent English language and scientific writing skills are
required (at least C1), German is a plus

You will work on an interdisciplinary research project, develop
clinically applicable software to support physicians, and contribute to
clinical studies.

For additional questions, please contact Prof. Alexander Schlaefer
(schlaefer@tuhh.de)

Prof. Dr.-Ing. Alexander Schlaefer

Institute of Medical Technology and Intelligent Systems
Hamburg University of Technology
+49 (0) 40 30601-3050
www.tuhh.de/mtec

**********************************************************
*
* 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 Sponsorship: CALDAM 2026

Call for Sponsorship: CALDAM 2026

Sponsors: We invite you to consider partnering with CALDAM 2026 (
https://caldam2026.iitdh.ac.in/home). Your support will help us in
organizing a successful conference like the previous years, and will also
help us in providing financial support to the eleven invited speakers,
student participants, and researchers from under-represented groups.
We look forward to your support this year, and welcoming you to IIT Dharwad
for the event!

Partnership Levels:

1. Platinum Partner: INR 4,00,000

All Diamond privileges and: stickers of the company logo in the
registration kit, a talk slot with participants; assured participation for
a total of 7 members of the company.

2. Diamond Partner: INR 2,50,000

All Gold privileges and: flyer or booklet in the registration kit and up to
3 company slides/posters on displays in the venue; assured participation
for a total of 4 members of the company.

3. Gold Partner: INR 1,50,000

All Silver privileges and: Logo and acknowledgements in the conference
proceedings; assured participation for a total of 2 members of the company.

4. Silver Partner: INR 50,000

Logo on website, physical banners and social media mentions.

Note: We are also open to custom partnership packages and partnership
towards specific kinds of support (e.g, registration kits, travel
scholarships, etc.). Please contact us at caldam2026@iitdh.ac.in

CALDAM 2026 · IIT Dharwad:
The International Conference on Algorithms and Discrete Applied Mathematics
(CALDAM), held under the aegis of the Association for Computer Science and
Discrete Mathematics (ACSDM), brings together researchers working in
algorithms and applied discrete mathematics to provide a high-quality forum
for dissemination and discussion of research results.

Indo-Polish pre-conference school of CALDAM 2026:
It is preceded by an international Indo-Polish pre-conference school where
eight internationally renowned researchers (four from Poland and four from
India) will deliver lectures and interact with students attending the
school. More than 50 students (mostly Masters and PhD students) will be
fully sponsored for attending the school. Relevant participants from local
colleges and institutes will be invited to attend the school free of cost.
This is an excellent opportunity for local students to attend an
international standard school within their geographical area.

The list of speakers for the Indo-Polish pre-conference school of CALDAM
2026 is listed below:

Prof. Andrzej Grzesik, Faculty of Mathematics and Computer Science,
Jagiellonian University, Krakow, Poland.
Prof. Prof. Aniket Basu Roy, Department of Computer Science & Information
Systems, BITS Pilani Goa, India.
Prof. Prof. Monika Pilśniak, Faculty of Applied Mathematics, Department of
Discrete Mathematics, AGH University, Poland.
Prof. Paweł Rzążewski, Faculty of Mathematics and Information Science,
Warsaw University of Technology.
Prof. Prafullkumar Tale, Department of Mathematics, IISER Pune, India.
Prof. Rafał Kalinowski, Faculty of Applied Mathematics, Department of
Discrete Mathematics, AGH University, Krakow, Poland.
Prof. Sasmita Barik, Department of Mathematics, IIT Bhubaneswar, India.
Prof. Sudeshna Kolay, Department of Computer Science and Engineering, IIT
Kharagpur, India.

CALDAM 2026:
The twelfth CALDAM (CALDAM 2026) will be organized by the Department of
Mathematics, Indian Institute of Technology Dharwad (IIT Dharwad) from
09–14 February 2026 (including the pre-conference school).

As in earlier CALDAMs, the proceedings of accepted papers will be published
in the Lecture Notes in Computer Science (LNCS) by Springer. Selected
papers may be invited to a special issue of Theoretical Computer Science
(TCS). As before, Springer is expected to sponsor awards for the best
student presentations. The invited speakers this year include Prof. Andrzej
Dudek, Prof. Sandip Das and Prof. Géza Tóth.

CALDAM 2026 Topics:
Approximation Algorithms; Combinatorial Algorithms; Combinatorial
Optimization; Combinatorics; Combinatorial Geometry; Computational
Complexity; Computational Geometry; Computational Learning Theory; Data
Structures; Discrete Geometry; Experimental Algorithm Methodologies; Graph
Algorithms; Graph Drawing; Graph Theory; Network Optimization; Online
Algorithms; Parallel and Distributed Algorithms; Parameterized Complexity;
Randomized Algorithms; Theoretical Aspects of Machine Learning.

Past Editions:
CALDAM 2025, PSG College of Technology, Coimbatore
CALDAM 2024, Indian Institute of Technology Bhilai
CALDAM 2023, Dhirubhai Ambani Institute of Information and Communication
Technology
CALDAM 2022, Department of Mathematics, Pondicherry University
CALDAM 2021, Department of Computer Science and Engineering, Indian
Institute of Technology Ropar
CALDAM 2020, Department of Computer Science and Engineering, Indian
Institute of Technology Hyderabad
CALDAM 2019, Department of Computer Science Engineering, Indian Institute
of Technology Kharagpur
CALDAM 2018, Department of Computer Science Engineering, Indian Institute
of Technology Guwahati
CALDAM 2017, Department of Mathematics, Birla Institute of Technology and
Science, Pilani, K K Birla Goa Campus
CALDAM 2016, Department of Futures Studies, University of Kerala
CALDAM 2015, Department of Computer Science, Indian Institute of Technology
Kanpur

The proceedings of accepted papers are published in the Lecture Notes in
Computer Science (LNCS) by Springer. Selected papers are typically invited
to a special issue of Theoretical Computer Science (TCS).

Payment Methods
Kindly pay through the secure SBI connect portal after selecting "IIT
Dharwad" in the following link:
https://www.onlinesbi.sbi/sbicollect/icollecthome.htm?corpID=3407756

You may fill in the following details:
- Payment Category: Course/Workshop/Seminar Fee
- Purpose of Payment: CALDAM 2026

Note that the amount paid shall be inclusive of GST at 18% as per GoI rules.

Important: Please send the acknowledge receipt to caldam2026@iitdh.ac.in for
tracking purpose.

Your acknowledgement receipt will be auto generated and sent to you. If
you require any additional document, kindly contact us at
caldam2026@iitdh.ac.in

**********************************************************
*
* 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] Registration open: Indo-Polish pre-conference school of CALDAM 2026

Dear all,

We are glad to share that the registration for the Indo-Polish
pre-conference school of CALDAM 2026 is open now.

The registration link is:
https://docs.google.com/forms/d/e/1FAIpQLSfPu5seXJr-P4mnBigon_aWhJ55TZ7VQkG26eDHf9oHNNU2HQ/viewform
Deadline (Phase 1): 5 December 2025
Deadline (final): 31 December 2025

The school will take place at IIT Dharwad during 9-10 February 2026. There
will be 4 Indian and 4 Polish invited speakers. The school will have
lectures, tutorials, a presentation session by Young Researchers, an
interaction session, and more. The broad topic of the school is Discrete
Mathematics and Algorithms. For further details, please check our website:
https://caldam2026.iitdh.ac.in/pre-conference-school

A total of 50 students will be provided full funding (except international
travel, if applicable) to attend the school. We will send the acceptance
notification in phases. Especially, if you want to book a train ticket for
attending the school, please register on or before 5th December 2025. This
will allow you to buy your train ticket 2 months before, which is the train
reservation starting date for you. The hard deadline is 31st December 2025.

Thanks and regards,
Sagnik Sen
Conference Chair,
CALDAM 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] GameNets 2026 -- Call for Papers

==============================================================
14th EAI International Conference on Game Theory for Networks
(GameNets 2026) -- Call for Papers

Website: https://gamenets.eai-conferences.org/2026/
Submission Deadline: 7th January, 2026
Notification: 11th February, 2026
Conference Dates: 26 - 27, March 2026, Evanston, IL, USA
===============================================================

Scope and Topics:

Papers presenting new and original research on game theory as applied
broadly to networks are sought. Theoretical research papers as well as
research in game theory motivated by network applications are
encouraged. Typical, but not exclusive, topics of interest include:

    - Game theory for networks, including wireless and vehicular networks.
    - Congestion analysis and network design
    - Traffic networks and equilibria
    - Mechanism Design for Networks
    - Game theory for social networks
    - Game theory for  biological networks
    - Network pricing and resource allocation
    - Game theory as applied to e-commerce and economic networks
    - Game theory for emerging technologies
    - Multi-Agent Reinforcement Learning
    - Fairness in Resource Allocation
    - Cooperative and Coalition games
    - Collusion detection approaches
    - Game theory for network security/resilience
    - Approaches for Multi-agent games (e.g., Diplomacy)
    - Computational Social Choice

Publication:

All registered and presented papers will be submitted for publication in
the Springer – LNICST series and made available through SpringerLink
Digital Library: GameNets proceedings. This series is indexed in leading
indexing services, such as Web of Science, Compendex, Scopus, DBLP, EU
Digital Library, Inspec, SCImago and Zentralblatt MATH.
For more details, see
https://gamenets.eai-conferences.org/2026/call-for-papers/

Paper Submission:

Papers should be submitted through EAI 'Confy+' system, and have to
comply with the Springer format (see Author's kit section on
https://gamenets.eai-conferences.org/2026/call-for-papers/).

    Regular papers should be up to 12-15+ pages in length.
    Short papers should be 6-11 pages in length.

All conference papers undergo a thorough peer review process prior to
the final decision and publication. This process is facilitated by
experts in the Technical Program Committee during a dedicated conference
period. Standard peer review is enhanced by EAI Community Review which
allows EAI members to bid to review specific papers. All review
assignments are ultimately decided by the responsible Technical Program
Committee Members while the Technical Program Committee Chair is
responsible for the final acceptance selection. You can learn more about
Community Review here.

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

--
Prof. Dr. Pascal Lenzner
Theoretical Computer Science
University of Augsburg

email: pascal.lenzner@uni-a.de
phone: +49 821 598 2413

**********************************************************
*
* 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] last call - Assistant Professor at LSE (Mathematical Optimisation), deadline 3 December 2025

The Department of Mathematics at The London School of Economics and Political Science (LSE) seeks to appoint an Assistant Professor to join the Optimisation and Algorithms group. The post holder will contribute to the intellectual life of the School through conducting and publishing outstanding quality research, engaging in high quality teaching, and participating in School and Department activities.

Salary is no less than GBP 68,087 per annum. The current salary scales can be found on the LSE website at
https://info.lse.ac.uk/staff/divisions/Human-Resources/Assets/Documents/Salary-Scales/NAC-Scales-August-2025.pdf

Applicants should have a completed PhD, or be close to obtaining a PhD in a discipline related to mathematical optimisation by the intended start date of 1 September 2026. Expertise and research interests related to mathematical optimisation are essential. In addition to applicants furthering the Department's current areas of specialisation, we welcome those with complementary expertise, notably in continuous optimisation and/or machine learning. The other criteria that will be used when shortlisting for this post can be found on the person specification, which is attached to this vacancy on LSE's online recruitment system.

In addition to a competitive salary, the benefits that come with this job include generous family friendly benefits, an occupational pension scheme, research grants policy with personal reward options, generous research leave (sabbatical) entitlement, a collegial faculty environment, and excellent support, training and development opportunities.

For further information about the post, please see the how to apply document, job description and the person specification via the in-text links at
https://jobs.lse.ac.uk/Vacancies/W/1349/0/457569/15539/assistant-professor-in-mathematics

To apply for this post, please go to https://jobs.lse.ac.uk/. If you have any technical queries with applying on the online system, please use the "contact us" links at the bottom of the LSE Jobs page. Should you have any queries about the role, please do not hesitate to email the Head of Department, Prof Bernhard von Stengel, b.von-stengel@lse.ac.uk.

The closing date for receipt of applications is 3 December 2025 (23.59 UK time). We are unable to accept any late applications.

LSE is committed to building a diverse, equitable and truly inclusive university.
As an equal opportunities employer strongly committed to diversity and inclusion, we encourage applications from women and those of Minority Ethnic backgrounds as they are currently under-represented at this level in this area. All appointments will be made on merit or skill and experience relative to the role.

**********************************************************
*
* 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] Multiple Assistant Professor positions at Bocconi University in Milan

Bocconi University is recruiting tenure-track assistant professors in computer
science. Candidates must apply online by December 16th 2025, for the application
to be considered.

The university pays internationally competitive salary. The language of instructions of all computer science courses at both undergraduate and graduate levels is English.

Description

Bocconi University is an amazingly vibrant academic community with leading
professors. It is located in central Milan, Italy, offering undergraduate,
graduate, PhD, MBA and Executive programs. A new Computing Sciences department
has been established three years ago and has already built a strong presence
in various branches on Computer Science, see the website of the department
https://cs.unibocconi.eu/
the webpage of the theory group
https://cs.unibocconi.eu/research/theory
and the webpage of the crypto group
https://rosenalon.github.io/cifra/

We are looking to hire tenure track Assistant Professors. All areas of research
in computing, mathematical and information sciences will be considered.
In terms of teaching, the department has recently
opened a bachelor in AI, a master in AI, and is strongly involved in the PhD
program in Statistics and Computer Science. It has a strong core in theory and
applied CS, and aims at broadening its portfolio, in particular towards
applications of machine learning not yet currently represented. We are looking for
outstanding candidates, curious and open to collaborations with colleagues from
other fields.
In principle the position is to be filled by 1st September 2026, but if necessary, the
starting date could be delayed to 1st February 2027.

The details of the call and instructions for submitting applications can be found here:
https://jobmarket.unibocconi.eu/?id=870

You may address your informal inquiries to any faculty member at our department, see
https://cs.unibocconi.eu/research/theory
for the contact details of researchers in theoretical CS.

**********************************************************
*
* 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] Multiple PhD positions at Bocconi University in Milan

There are multiple PhD positions at Department of Computing
Sciences at Bocconi University in Milan.

PhD program "Statistics and Computer Science" is a 4-year program consisting of two
tracks: Statistics and Computer Science. Students are expected to choose one of
these tracks, but they have opportunity of learning knowledge from both of these
areas.

Potential supervisors from the Department of Computing Sciences include
Andrea Celli andrea.celli2@unibocconi.it https://andcelli.github.io
Tommaso d'Orsi tommaso.dorsi@unibocconi.it https://tommasodorsi.github.io/
Marek Eliáš marek.elias@unibocconi.it https://elias.id
Adam Polak adam.polak@unibocconi.it https://adampolak.github.io
Laura Sanità laura.sanita@unibocconi.it https://laurasanita.github.io
See the webpage of our theory group for details:
https://cs.unibocconi.eu/research/theory

We encourage applications especially from students interested in
Algorithms, Computational Game Theory, Combinatorial Optimization, Online
Algorithms, Learning Theory, Computational Complexity, and related topics.

Application deadline: 5 February 2026

Useful links:
Online application portal: https://www.unibocconi.eu/admissionphd (see FAQ on how to apply)
Information about the PhD school: https://www.unibocconi.eu/phds
Information about the PhD program:
https://www.unibocconi.it/en/programs/phd/phd-statistics-and-computer-science

If you have further questions, feel free to contact marek.elias@unibocconi.it

**********************************************************
*
* 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] IEEE WCCI / IJCNN 2026 Special Session on Artificial Intelligence and Complex Systems

Dear Colleagues,

We are inviting you to submit your research work to *WCCI 2026
<https://attend.ieee.org/wcci-2026/>* Special Session *Artificial Intelligence
and Complex Systems* <https://sites.google.com/uniroma1.it/wcci-ijcnn-aics2026>

We would appreciate if you forward this CfP to friends and colleagues that might be interested.

*******************************************************************************
*Special Session on Artificial Intelligence and Complex Systems*

*IEEE International Joint Conference on Neural Networks (IEEE IJCNN)*
as part of
*IEEE World Congress on Computational Intelligence (IEEE WCCI)*
<https://attend.ieee.org/wcci-2026/>

*June 21st-26th, 2026. Venue - Maastricht, The Netherlands.*
*******************************************************************************
SCOPE and TOPICS
The special session aims to explore the intricate relationship between Artificial Intelligence (AI) and complex systems through Complexity Theory, delving into the understanding of modern AI systems such as deep learning architectures and large language models (e.g., GPT/ChatGPT, BARD, Llama, Anthropic, etc.) as complex dynamic systems. With a focus on stochastic processes, explainable AI, cognitive approaches, multimodal learning, AI and security, and AI and bias, the session will serve as a multidisciplinary platform that extends beyond engineering to include cognitive science, linguistics, philosophy, and other relevant fields. Specifically, we welcome researchers and engineers in AI and complex systems theory, cognitive scientists, linguists, and philosophers as well as industry professionals seeking to apply complexity theory in AI solutions to submit their works to this special session to investigate on the following four objectives:
- To investigate how Complexity Theory can offer invaluable tools for analyzing AI systems, particularly in the context of dynamic behavior, emergent properties, and stochastic processes.
- To explore how AI can be employed to study and understand complex systems, including information granulation (Granular Computing) and multi-agent environments.
- To establish new methodologies for measuring the intelligence and linguistic understanding of AI systems through the lens of Complexity Theory.
- To discuss the future directions and next steps in the intersection of AI and Complexity Theory in reaching artificial general intelligence (AGI).


Topics of interest include (but are not limited to):
- Emergent Behavior and Stochastic Processes in AI Systems: Understanding how complex systems theory can explain the adaptive, emergent characteristics and stochastic outputs of AI.
- Multifractal and Stochastic Analysis of AI: Utilizing complexity theory for the multifractal and stochastic analysis of AI systems.
- Dynamic Systems Theory in AI: How dynamic systems theory can be applied to AI for better system analysis and prediction.
- Explainable AI: Investigating methods for making complex AI systems understandable and interpretable.
- Cognitive Approach in AI: Exploring how cognitive science can inform and improve AI systems.
- Multimodal Learning: The role of multimodal learning in enhancing the capabilities of AI systems.
- AI in Multi-Agent Complex Systems: Exploring the role of AI in the study and understanding of multi-agent complex systems.
- AI and Security: Discussing the implications of complexity theory for AI in cybersecurity.
- AI and Bias: Addressing the challenges and solutions for bias in AI systems.
- Linguistic and Philosophical Aspects: Investigating the implications of complexity in AI for language models, meaning, and other linguistic aspects, as well as philosophical considerations.
*******************************************************************************
IMPORTANT DATES
* Paper Submission Deadline: January 31st, 2026
* Paper Acceptance Notification: March 15th, 2026
* Final Paper Submission & Early Registration: April 15th, 2026
*******************************************************************************
ORGANIZERS and CONTACT
- *Prof. Alessio Martino* – LUISS University, Rome, Italy
Email: amartino@luiss.it
- *Prof. Enrico De Santis* – Sapienza University of Rome, Italy
Email: enrico.desantis@uniroma1.it
- *Prof. Antonello Rizzi* – Sapienza University of Rome, Italy
Email: antonello.rizzi@uniroma1.it

Official Special Session Website: <https://sites.google.com/uniroma1.it/wcci-ijcnn-aics2026>
________________________________________
Alessio Martino, PhD
Assistant Professor of Computer Science
LUISS Guido Carli University
Department of AI, Data and Decision Sciences
Viale Romania 32, 00197 Rome, Italy<https://www.google.com/maps/place/Viale+Romania,+32,+00197+Roma+RM/@41.9250084,12.491102,17z/data=!3m1!4b1!4m5!3m4!1s0x132f61185c88b765:0xc1b3fadadd3515ae!8m2!3d41.9250044!4d12.4932907> (Room 508)
Phone: (+39) 06-85225957
E-mail: amartino@luiss.it<mailto:amartino@luiss.it>





La presente e-mail proviene da Luiss Guido Carli e s'intende inviata per scopi lavorativi. Tutte le informazioni ivi contenute, compresi eventuali allegati, sono da ritenersi esclusivamente confidenziali e riservati secondo i termini del vigente D.Lgs. 196/2003 in materia di privacy e del Regolamento europeo 679/2016 - GDPR. È vietato qualsiasi ulteriore utilizzo non autorizzato. Qualora la stessa Le fosse pervenuta per errore, La preghiamo di eliminarla immediatamente e di darcene tempestiva comunicazione. Grazie.

This e-mail message is sent by Luiss Guido Carli for business purposes. All informations contained therein, including any attachments, are for the sole use of the intended recipient and may contain confidential and privileged information pursuant to Legislative Decree 196/2003 and the European General Data Protection Regulation 679/2016 - GDPR -. Any unauthorized review, use, disclosure or distribution is prohibited. If you are not the intended recipient, please contact the sender by soon reply this e-mail and destroy all copies of the original message. Thanks
**********************************************************
*
* 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] Internship Offers: "quantum computing for combinatorial optimization" and "assortment optimization"

Dear colleagues,

We offer 2 internship positions, one about "assortment optimization", and
the other one about "quantum computing for combinatorial optimization".
Please see the attached files for the detailed description of each
position, the requirements, the application guidelines, and the deadlines.

The internships will be at the ensIIE (a public engineering school
specialized in computer science) and the Université Evry Paris-Saclay,
which are both located in Evry, a nice city in the parisian region with
just 20km distance from Paris (reachable by regional express metro lines
(RER), etc.).

Depending on the scientific quality of the selected applicants as well as
the successful accomplishment of the projects, the internships can be
followed by a PhD thesis (of course, if the selected applicants are
interested).

The final selections (for the internship offers) will be made either in
December 2025, or in January 2026.

Please feel free to share the information with the students who could be
interested in these offers. Thank you in advance.

If you require any further information, please do not hesitate to contact
me.

Best regards,
Mahdi Moeini.
--
Mahdi MOEINI
Associate Professor in Computer Science (Operations Research)
ensIIE (École Nationale Supérieure d'Informatique pour l'Industrie et
l'Entreprise), Paris | Evry
https://sites.google.com/view/mahdi-moeini

**********************************************************
*
* 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: WiL 2026 – 10th Women in Logic Workshop, 24–25 July 2026, Lisbon (Portugal)

---------------------------------------------

Call for Contributions

WiL 2026: 10th Women in Logic Workshop

July 24-25, 2026

Affiliated with FLOC 2026

https://sites.google.com/view/wil2026

---------------------------------------------

We are pleased to call for submissions to WiL 2026, the "10th International
Workshop for Women in Logic", which will take place in Lisbon on 24–25 July
2026, as a satellite event of FLoC 2026.

The Women in Logic workshop (WiL) provides an opportunity to highlight and
increase awareness of the valuable contributions made by women in the field
of logic and computer science. Its main goal is to promote and showcase
excellent research led by women, ultimately fostering greater visibility
and representation within the community.

Previous editions of Women in Logic have taken place in Reykjavík (2017),
Oxford (2018), Vancouver (2019), Paris (2020), Rome (2021), Haifa (2022),
Rome (2023), Tallinn (2024), and Birmingham (2025).

* Submissions *

Abstracts should be written in English (max 2 pages excluding references),
and prepared using the Easychair style (
https://easychair.org/publications/for_authors). The abstracts should be
uploaded to the WiL 2026 Easychair page

https://easychair.org/my/conference?conf=wil2026

as a PDF file before the submission deadline on May 5, 2026, anywhere on
Earth.

Topics of interest include but are not limited to: automata theory,
automated deduction, categorical models and logics, concurrency and
distributed computation, constraint programming, constructive mathematics,
database theory, decision procedures, description logics, domain theory,
finite model theory, formal aspects of program analysis, formal methods,
foundations of computability, games and logic, higher-order logic, lambda
and combinatory calculi, linear logic, logic in artificial intelligence,
logic programming, logical aspects of bioinformatics, logical aspects of
computational complexity, logical aspects of quantum computation, logical
frameworks, logics of programs, modal and temporal logics, model checking,
probabilistic systems, process calculi, programming language semantics,
proof theory, real-time systems, reasoning about security and privacy,
rewriting, type systems and type theory, and verification.

* Important Dates *

Abstract Submission: May 5, 2026

Paper Notification: May 15, 2026

Grant Application: May 17 2026

Grant Notification: May 19, 2026

Early Registration: TBA

Contribution for Informal Proceedings: June 25, 2026

Workshop: July 24-25, 2026

* Invited Speakers *

Valeria de Paiva (Topos Institute)

Raheleh Jalali (University of Bath)

More TBA

* Program Committee *

Sandra Alves (Porto University)

Huimin Dong (Co-chair, TU Wien)

Amy Felty (University of Ottawa)

Nina Gierasimczuk (Technical University of Denmark)

Lourdes Del Carmen González Huesca (Universidad Nacional Autónoma de México)

Delia Kesner (Université Paris Cité)

Fenrong Liu (Tsinghua University)

Anela Lolic (Co-chair, TU Wien)

Daniele Nantes-Sobrinho (UNB, Brazil)

Aybüke Özgün (University of Amsterdam)

Anja Petkovic Komel (Ethereum Foundation / TU Wien)

Elaine Pimentel (Co-chair, UCL)

Tephilla Prince (IIT Dharwad)

Sara Uckelman (Durhan University)

More TBA

* Grants *

A limited number of travel grants is available for students/young
researchers who would not otherwise have resources to attend WiL, and whose
attendance would benefit both the applicant and the event.

* Special Issue – 10 Years of the Women in Logic Workshop *

We are delighted to pre-announce a special 10th Anniversary Edition of
Women in Logic, which will be published in the Journal of Logic and
Computation. This celebratory issue will highlight a decade of
contributions by women to the development of logic and its applications,
showcasing both established and emerging voices in the community.

The call for papers will be launched soon, and we warmly encourage
submissions from researchers working across all areas of logic. This
special edition represents an important milestone in the ongoing effort to
increase visibility, representation, and opportunities for women within the
field.

More details: https://sites.google.com/view/wil2026/call-for-papers

**********************************************************
*
* 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] Assistant/Associate Professor positions in Algorithms at University of Southern Denmark

The Department of Mathematics and Computer Science (https://www.sdu.dk/en/om_sdu/institutter_centre/imada_matematik_og_datalogi) (IMADA), SDU, Odense/Vejle, Denmark, invites applications for positions in Algorithms at the levels of assistant and associate professor. Applicants are asked to state in their letter of application on which level and to which campus they wish to apply. The intended starting date is 1 August 2026 with room for flexibility. The application deadline is 10 January 2026.

The current focus areas of the Algorithms research conducted at IMADA include combinatorial optimization, online algorithms, graph theory, data structures, complexity theory, cryptology, and algorithmic cheminformatics. We are interested in strong applicants who can contribute to these topics or complement them with new and promising directions, including applications of algorithms. (Read about the algorithms group: https://algorithms.sdu.dk/.)

We are looking for candidates

* with a PhD and research background in Computer Science with a focus on Algorithms.

* with a strong track record of publications in top-level conferences and journals, relative to academic age.

* who can contribute to teaching and advising in the department's Bachelor, Master's, and PhD programs in Computer Science.

For applicants for a position of tenure-track assistant professor, we expect a research track record that shows considerable potential. Such an appointment as assistant professor leads to an assessment for a position as tenured associate professor before the end of the sixth year of employment. Contingent on a positive academic assessment, the assistant professor will transit into a tenured position as associate professor. A tenure-track assistant professor can request assessment for tenure earlier.

For applicants for a position of associate professor, we expect a recognized research track record of more than four years after the PhD and demonstrated ability to direct independent research projects and obtain external funding. In addition, applicants are expected to have substantial experience in teaching and supervision. The associate professorship position is a tenured position.

Fluency in English is required, whereas knowledge of Danish is not a prerequisite for application. More than half of the research staff members in computer science have international backgrounds. Successful applicants will be offered Danish courses by the university.

For further information and questions on the positions, please contact Head of Section, Professor Kim Skak Larsen (kslarsen@imada.sdu.dk).

Odense and Vejle provide family-friendly living conditions with the perfect combination of a historic city centers with an urban feel and yet a close proximity to beaches and recreational areas. The beautiful locations come with easy access by train or highway to the bigger cities of Aarhus and Copenhagen.

More information and directions for applying can be found at:
https://fa-eosd-saasfaprod1.fa.ocs.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/3319?lastSelectedFacet=CATEGORIES&selectedCategoriesFacet=300000002425904

**********************************************************
*
* 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] FUN 2026: First Call for Papers

The 13th International Conference on Fun with Algorithms (FUN 2026) will be held in Island of Porquerolles, France, on May 18-22 2026, at Hôtel Club Igesa Porquerolles.

FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.
Fun is a notion that can be judged from different perspectives, and be defined in many different manners. The conference defines fun in a broad sense, including aspects such as elegance, simplicity, amusement, surprise, originality, etc.
The topics of interest include all aspects of algorithm design and analysis, and of computational complexity, under all types of models.

Conference website:
https://fun2026.limos.fr/

Important dates:
Submission deadline: January 6, 2026 (End of Day, Anywhere on Earth (AoE))
Notification date: February 17, 2026
Final version due: March 3, 2026
Conference date: May 18 - May 22, 2026

Submission instructions

Submissions should be made via the FUN2026 Easychair submission server. (TBA)
Submissions can have unlimited length, and authors are encouraged to submit complete papers, in A4 or letter format, 11pt, single column, with reasonable margins. The first ten pages of the submitted papers must include a self-contained description of the results, of their motivations and impact. Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the conference, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal.
At least one author of each accepted paper is expected to physically attend the conference and present the paper.
Conference proceedings will be published by LIPIcs, Schloss Dagstuhl – Leibniz Center for Informatics, Volume TBA. Authors of accepted papers will be asked to submit the final, camera-ready version of their paper in LIPIcs style not later than March 3, 2026. The page limit is 20 pages maximum, in total, i.e., including title, authors, affiliation, figures, bibliography, etc.

PROGRAM COMMITTEE

* Aaron Williams, Williams College, USA.
* Bernardo Subercaseaux, Carnegie Mellon University, USA.
* Danny Krizanc, Wesleyan University, USA.
* Della H. Hendrickson, Massachusetts Institute of Technology, USA.
* Emily Fox, University of Illinois Urbana-Champaign, USA.
* Flaminia L. Luccio, Università Ca' Foscari Venezia, Italy.
* Florian Galliot, Université d'Aix-Marseille, France.
* Greg Aloupis, Northestern University, USA.
* John Iacono (chair), Université libre de Bruxelles, Belgium.
* Kévin Perrot, Université d'Aix-Marseille, France.
* Luciano Gualà, Università degli Studi di Roma Tor Vergata, Italy.
* Luisa Gargano, Università degli Studi di Salerno, Italy.
* Maarten Löffler, Utrecht University, Netherlands.
* Markus Holzer, Justus-Liebig-Universität Gießen, Germany.
* Martin Seybold, Université libre de Bruxelles, Belgium.
* Mirela Damian, Villanova University, USA.
* Shantanu Das, Université d'Aix-Marseille, France.
* Shikha Singh, Williams College, USA.
* Valentin Polishchuk, Linköpings universitet, Sweden.
* Yuichi Sudo, Hosei University, Japan.

STEERING COMMITTEE

* Flavio Chierichetti, Università di Roma, Italy.
* Irene Finocchi, Luiss Guido Carli, Italy.
* Pierre Fraigniaud, Institut de Recherche en Informatique Fondamentale, France.
* Linda Pagli, Università di Pisa, Italy.
* Giuseppe Prencipe, Università di Pisa, Italy.
* Paolo Boldi, Università di Milano, Italy.
* Nicola Santoro, Carleton University, Canada.
* Tami Tamir, Reichman University, Israel.
* Yushi Uno, Osaka Metropolitan University, Japan.

**********************************************************
*
* 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] Full-time academic position in Algebra and Combinatorics at ULB (Brussels, Belgium)

The Department of Mathematics at Université libre de Bruxelles (ULB) is seeking to hire a new faculty member within the Algebra and Combinatorics research group. The Algebra and Combinatorics group currently has 4 permanent members (Samuel Fiorini, Dimitri Leemans, Špela Špenko and Joost Vercruysse), as well as a number of postdocs and PhD students.

Application deadline: 31 January 2026
Start date: 01 October 2026

More details about the opening can be found at the following URL:

https://cwfront.ulb.ac.be/vacacad/vacancies/download/10158

**********************************************************
*
* 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] [Scheduling seminar] Hoogeveen, J.A. (Utrecht University) | November 26 | Planning shunting operations at railway hubs

Dear scheduling researcher,

We are delighted to announce the talk given by Han Hoogeveen (Utrecht
University). The title is "Planning shunting operations at railway
hubs". The seminar will take place on Zoom on Wednesday, November 26 at
14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/97711129359?pwd=8bUbSE56gVa8UilLUasEbVT8QX2HnU.1
Meeting ID: 977 1112 9359
Passcode: 599095

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

The abstract follows.
At night, trains are parked on shunting yards. Here cleaning and small
maintenance takes place, after which the trains have to leave in the
morning at the planned departure time and in the desired composition,
which may require splitting and coupling during their stay at the yard.
As NS (Dutch Railways) continues to expand its fleet while the available
yard space remains fixed, the shunting yards are becoming increasingly
congested, with occupation rates reaching up to 90%. Consequently,
planning all train movements and related activities has become a complex
challenge. In this talk, I will discuss the main challenges encountered
in planning the shunting yards and the algorithms that we have designed
to tackle these problems. First, I want to discuss the shunting problem
on a single yard. We solve this problem using local search; our
algorithm is the first one that is capable of solving real-world problem
instances of the complete shunting and scheduling problem. Next, I want
to extend the problem to the entire station area, which requires that we
distribute the trains over two (or more) shunting yards, while avoiding
interference with through traffic and respecting the capacity of the
separate shunting yards. The main difficulty here is that the capacity
of the shunting yard is not known; we use data analysis to estimate it.
Finally, I want to discuss the problem of assigning shunting tasks to
train drivers. This is a variant of the technician routing problem
without skills, but with synchronization. We have developed an algorithm
for this that is based on a novel decomposition approach.

The next talk in our series will be:
Laurent Houssin (ENAC, Université de Toulouse) | December 10 | Flow-shop
and job-shop robust scheduling problems with budgeted uncertainty
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] Probability and Analysis 2026 — Registration and Call for Talks

Dear Colleagues,

We would be grateful if you could consider or forward the following
information to your collaborators or students.

The conference Probability and Analysis 2026 will be held on 11–15 May 2026
in Będlewo, Poland. We accept talks and posters.

The conference highlights recent developments at the intersection of
probability and analysis, with sessions devoted to Markov processes,
complex stochastic systems, PDEs and stochastic PDEs, harmonic analysis and
martingales, and integrable probability.

Further information and the registration form are available at:
https://panda2026.pwr.edu.pl/

We look forward to seeing you in Będlewo.

With best regards,
Krzysztof Bogdan
on behalf of the Organizers

**********************************************************
*
* 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] Neel Nanda's MATS Summer 2026 Applications Open!

Applications are now open for Neel Nanda's ML Alignment & Theory Scholars
(MATS) Summer 2026 Stream!

MATS is an independent research and educational seminar program that
connects talented scholars with leading mentors in AI alignment, security,
and governance. Neel Nanda's stream applications open earlier than the
others to accommodate a unique, intensive training phase.

Accepted applicants will first participate in a five-week exploration
program, after which a subset will be selected to continue into the full
MATS program.

Timeline:

-

Applications due December 23
-

Decisions released ~January 12
-

Exploration phase February 2 - March 6 (5 week online program for top ~32
candidates)
-

Research phase decisions mid-March
-

Research phase June 1 - August 21 (12 week in-person program for top ~8
candidates)

Applications for all other streams will open in late December, and you can
fill out this form
<https://forms.matsprogram.org/summer2026eoi?utm_source=apply_page&utm_medium=website>
to hear about the full application launch. For full details on the program
and how to apply, visit our website <http://matsprogram.org/apply>.

--
*Vivian Ha *
*Operations Generalist *
ML Alignment and Theory Scholars (MATS) <https://www.matsprogram.org/>
vivian@matsprogram.org
*[image: https://www.matsprogram.org/] <https://www.matsprogram.org/>*

**********************************************************
*
* 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/
*
**********************************************************