Theory Announcements: 2025

Friday, October 31, 2025

[DMANET] PhD Position in Robust Bilevel Optimization at the University of Technology Nuremberg (UTN) (Johannes Thürauf)

The Discrete Optimization Lab (Prof. Johannes Thürauf) is currently offering a fully funded doctoral research opportunity (3 years, 100%, TV-L E13) as part of the interdisciplinary project "Strategic Resilience for Future Energy Systems".

The successful candidate will conduct research in bilevel and robust optimization, with a particular focus on the emerging area of robust bilevel optimization.

Applications will be reviewed on a rolling basis. To receive full consideration, please apply by 9.12.2025. Applications received after that date may still be considered.

For more details about the position and the application process, please see the official advertisement:

Doctoral researcher (Ph.D.) positions at UTN with the topic of Bilevel and Robust Optimization (m/f/d) under

https://www.utn.de/karriere/angebote-fuer-promovierende/

To learn more about the ongoing research in the lab, please visit my personal website https://www.johannesthuerauf.com/ and the Discrete Optimization Lab website https://www.utn.de/en/departments/department-liberal-arts-and-sciences/discrete-optimization-lab/

Please feel free to share this announcement with any student who may be interested.
If you have any questions regarding the position, please do not hesitate to contact me at johannes.thuerauf@utn.de

**********************************************************
*
* 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, October 30, 2025

[DMANET] SMiLE Feb 2026 - Extended Submission Deadline 08-11 Feb' 2026 - KFUPM, Saudi Arabia

Due to several requests, we are pleased to announce that the submission deadline for SMiLE 2026 has been extended.
The new submission deadline is Saturday 15, November 2025.

***************************************************************************
2nd International Conference on Smart Mobility and Logistics Ecosystems
KFUPM, Dhahran, Kingdom of Saudi Arabia
February, 2026
***************************************************************************

Conference Website: https://smile.kfupm.edu.sa

Important Dates
- Paper Submission Extended Deadline 15 November 2025
- Acceptance Notification 15 December 2025
- Tutorials & Workshops 8 February 2026
- Conference Dates 9,10,11 February, 2026

About SMiLE 2026
Building on the success of the inaugural 1st International Conference on Smart Mobility and Logistics Ecosystems (SMiLE) conference, the IRC Smart Mobility and Logistics at KFUPM proudly invites researchers, industry leaders, and policymakers to the SMiLE 2026. The conference serves as a premier platform for advancing sustainable, intelligent, and resilient mobility and logistics ecosystems through interdisciplinary research, innovation, and collaboration.
Smart mobility and logistics are pivotal in enhancing transportation efficiency, reducing environmental impact, and optimizing urban traffic flow. By leveraging cutting-edge technologies such as IoT, AI, data analytics, autonomous vehicles, electric mobility, and hydrogen-powered solutions, these systems enable real-time monitoring, predictive analytics, and intelligent decision-making. Additionally, advancements in cybersecurity, quantum computing, digital twins, and human-machine collaboration are revolutionizing transportation networks, ensuring resilience, efficiency, and sustainability. These innovations drive the future of connected, automated, and intelligent mobility ecosystems, reducing congestion and emissions while shaping next-generation transport solutions.
SMiLE2026 invites submissions presenting novel and cutting edge research contributing to the scope of the conference.

For paper submission, https://easychair.org/conferences/?conf=smile2026
For registration, please visit https://smile.kfupm.edu.sa/

Keynote Speakers
* Dr. Pascal van Hentenryck, Director of the NSF Artificial Intelligence Institute for Advances in Optimization (AI4OPT), and the Director of Tech-AI, the AI hub at Georgia Tech.
* Dr. Hesam Rakha, Director of Center for Sustainable Mobility, Virginia
* Dr. Ansar Yasir, Micro-Mobility and Traffic, ITS
* Dr. Aboelmagd Noureldin, Professor and Canada Research Chair, Electrical and Computer Engineering, RMC/Queen's University

Conference Highlights
* Keynote Sessions by distinguished global experts in mobility, logistics, and AI
* Panel Discussions featuring leading academics and industry leaders on critical challenges and opportunities
* Industry Showcases & Demos of cutting-edge smart mobility and logistics solutions
* Networking & Collaboration Opportunities with researchers, startups, and policymakers
* Best Paper Awards to recognize outstanding research contributions
* Competitions /hackathon/ideathon etc (school, college & university levels)
* Social Events

Publications
All accepted papers will be published in the conference proceedings and submitted for publication in Procedia Transportation Research, hosted by Elsevier on www.elsevier.com and on the Elsevier content platform ScienceDirect (www.sciencedirect.com), and will be freely available worldwide. All papers in Procedia will be indexed by Scopus (www.scopus.com).

Conference Tracks
SMiLE 2026 welcomes high-quality original research, case studies, and practical insights in the following key tracks:

* Smart and Resilient Transportation Systems
* Automation, Optimization, and Innovation in Logistics
* Cognitive Cities and Sustainable Transport Ecosystems
* Cognitive Human-Machine Teaming in Mobility and Logistics

Topics include, but not limited to:
1. Smart and Resilient Transportation Systems
* AI-powered Traffic Management and Congestion Control
* Connected, Assisted, and Autonomous Mobility Solutions
* Mobility-as-a-Service (MaaS) and Seamless Multimodal Transport
* Resilient, Secure, and Privacy-Focused Transportation Infrastructure
* AI-Driven Cybersecurity and Threat Mitigation in Transportation
* Predictive Maintenance using AI for Mobility Infrastructure
* Digital Twins and Simulation-Based Planning for Smart Mobility
* Shared Mobility, Ride-hailing, and Smart Micromobility Solutions
* Inclusive Mobility and Accessible Transport Solutions
* Public Transport Innovations and Smart Infrastructure
* AI, IoT, and Behavioral Analytics in Transportation
* Safety, Security, and Privacy in Next-Gen Mobility

2.Automation, Optimization, and Innovation in Logistics
* AI-Driven Resilient and Adaptive Logistics Networks
* Green supply chains and carbon-neutral logistics
* Automation and Robotics in Smart Warehousing and Distribution Centers
* Blockchain for Transparency and Trust in Logistics
* IoT-enabled smart logistics infrastructure
* UAVs for Logistics and Delivery Operations
* Urban Air Mobility (UAM) for Passenger and Freight Transport
* Satellite-based logistics and supply chain solutions
* Smart ports and autonomous maritime logistics
* Digital twins for supply chain efficiency
* Smart cities and intelligent transport infrastructure
* Optimization in Supply Chain Management, including AI and Quantum Computing
* Last-mile Delivery Innovations
* Real-time Freight Tracking and AI-Driven Transport Planning
* Track Platooning
* Cold Chain Logistics and Perishable Goods Transportation
* On-demand and Hyperlocal Logistics
* Cybersecurity and Risk Management in Smart Logistics

3. Cognitive Cities and Sustainable Transport Ecosystems
* Smart Road Infrastructure, Including Intelligent Intersections
* Connected and Autonomous Vehicles (CAV) Infrastructure and 5G/V2X mmunications
* Intelligent Traffic Management and Digitalized Transport Networks
* Urban Air Mobility (UAM) and Water-Based Transport Infrastructure
* Resilient and Cyber-Secure Transport Infrastructure
* Decarbonizing Transportation and Carbon-Neutral Mobility Solutions
* Electrification and Hydrogen Technology for Sustainable Mobility and Logistics
* Sustainable Supply Chain Management and Green Logistics
* Circular Economy and Climate-Resilient Transport Planning
* Smart Grid Integration for Future Transport and Logistics
* Public Policies and Innovations for Sustainable Transportation
* Smart Cities and Intelligent Transport Infrastructure
* Sustainable Multimodal Transport Strategies
* Digital Transformation and Emerging Technologies in Mobility
* Green Infrastructure and Sustainable Urban Mobility Planning
* Next-Generation Intelligent Transport Systems
* 5G & Beyond and Edge Computing for Mobility and Logistics Solutions

4. Cognitive Human-Machine Teaming in Mobility and Logistics
* AI-assisted decision-making for mobility and logistics
* Human-in-the-loop automation in transportation and logistics
* Ethics, trust, and safety in AI-human collaboration
* AI-driven predictive analytics for transport and logistics optimization
* AI-augmented cybersecurity strategies in transportation systems
* Quantum computing for AI-enhanced decision-making in mobility
* Human-centered AI for critical decision-making and operations
* Collaborative intelligence between humans and machines in logistics
* Cognitive systems and explainable AI in transport and logistics

**********************************************************************
DISCLAIMER: The information in this email and its attachments (if any) is intended for the addressee only and may contain confidential or privileged information. If you are not the intended recipient, please delete the email and its attachments from your system and notify the sender immediately. You should not retain, disclose, copy, or use this email or any of its contents for any purpose, nor disclose its contents to any other person. KFUPM is not responsible for changes made to this message after it was sent. Statements and opinions expressed in this e-mail are those of the sender, and do not necessarily reflect those of KFUPM. KFUPM is not liable for any effect or virus damage caused by this message.
إن المعلومات الواردة في هذا البريد الإلكتروني ومرفقاته إن وجدت، قد تكون خاصة أو سرية؛ فإذا لم تكن المقصود بهذه الرسالة؛ فيُرجى منك حذفها ومرفقاتها من نظامك وإخطار المرسل بخطأ وصولها إليك فورا. كما لا يجوز نسخ أي جزء منها أو مرفقاتها ، أو الإفصاح عن محتوياتها لأي شخص أو استعمالها لأي غرض آخر. إن جامعة الملك فهد للبترول والمعادن لا تتحمل مسؤولية التغييرات التي يتم إجراؤها على هذه الرسالة بعد إرسالها. وإن البيانات أو الآراء المعبر عنها في هذا البريد، هي بيانات تخص مُرسلها، ولا تعكس بالضرورة رأي وبيانات الجامعة. كما لا تتحمل الجامعة مسؤولية أي تأثير ينتج عن هذه الرسالة أوعن أي فيروس قد تحمله.

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

We welcome submissions to WG 2026 (52nd International Workshop on
Graph-Theoretic Concepts in Computer Science). The conference will take
place from Tuesday 2nd June to Thursday 4th June 2026 in Kortrijk, Belgium.
The conference website is: https://wg2026.be

The scientific program involves invited talks by:
* Rose McCarty (Georgia Institute of Technology, USA)
* Pascal Schweitzer (TU Darmstadt, Germany),
a talk by one of the recipients of WG 2026 Test of Time Award:
* Dimitrios M. Thilikos (LIRMM, Université de Montpellier, CNRS, France),
and a number of contributed talks.

AIMS AND SCOPE

WG is mainly concerned with efficient algorithms of various types (e.g.,
sequential, parallel, distributed, randomized, parameterized) for
problems on graphs and networks. The goal is to present recent results
and to identify and explore directions for future research. Submitted
papers should describe original results in any aspects of graph theory
related to computer science, including but not restricted to:
* design and analysis of sequential, parallel, randomized, parameterized
algorithms
* distributed graph and network algorithms
* structural graph theory
* computational complexity of graph and network problems
* graph drawing and layouts
* computational geometry
* computational biology
* graph mining
* random graphs and models of the web and scale-free networks
* support of the above concepts by suitable implementations and
applications.

IMPORTANT DATES (all dates in AoE time zone)

Abstract submission deadline: 1 February 2026
Paper submission deadline: 4 February 2026
Acceptance notification: 3 April 2026
Final version: 4 May 2026
Conference: 2-4 June 2026

SUBMISSION AND PROCEEDINGS

WG 2026 is the first edition to have LIPIcs proceedings. The conference
will use a lightweight double-blind model for the reviewing process. For
more details on the format, see the conference website:
https://wg2026.be/cfp.html
The Program Committee will bestow a Best Paper Award and a Best Student
Paper Award. Papers eligible for the best student paper can have
non-student co-authors, but the main work in a paper that is a candidate
for the best student paper award must be done by co-authors that were
students at the time of submission, and the award can be received only
by such co-authors.

The submission server is:
https://easychair.org/conferences/?conf=wg2026, it will be opened in
December.

PROGRAM COMMITTEE

Tara Abrishami (Stanford University, USA)
Marthe Bonamy (CNRS, Université de Bordeaux, France)
Nick Brettell (Victoria University of Wellington, New Zealand)
Linda Cook (University of Utrecht, The Netherlands)
Vida Dujmović (University of Ottawa, Canada)
David Eppstein (University of California, Irvine, USA)
Louis Esperet (CNRS, Université Grenoble Alpes, France)
Robert Ganian (TU Wien, Austria)
Serge Gaspers (University of New South Wales, Australia)
Jan Goedgebeur (co-chair) (KU Leuven, Belgium)
Shenwei Huang (Nankai University, China)
Gwenaël Joret (Université Libre de Bruxelles, Belgium)
Tereza Klimošová (Charles University, Czech Republic and Vilnius
University, Lithuania)
Dušan Knop (Czech Technical University, Czech Republic)
Tuukka Korhonen (University of Copenhagen, Denmark)
Michael Lampis (Université Paris Dauphine, France)
Neeldhara Misra (IIT Gandhinagar, India)
Irene Muzi (Universität Hamburg, Germany)
Karolina Okrasa (University of Oxford, UK)
Yota Otachi (Nagoya University, Japan)
Paweł Rzążewski (co-chair) (Warsaw University of Technology and
University of Warsaw, Poland)
Roohani Sharma (Institute for Basic Science, South Korea)
Ana Silva (Federal University of Ceará, Brazil)
Nicolas Trotignon (CNRS, ENS Lyon, France)
Kristina Vušković (University of Leeds, UK)
Alexander Wolff (Universität Würzburg, Germany)
Paul Wollan (University of Rome, Italy)

[DMANET] Heureka Student Award 2025 (2nd Call)

The Heureka Foundation for Environment and Mobility honors outstanding Diploma or Master's theses that are dedicated to issues in mobility in connection with environmental aspects or the use of optimization methods with the

*** Heureka Student Award 2025 ***

The selected work will be awarded prizes of 2.000 € (1. Prize), 1.000 € (2. Prize), and 500 € (3. Prize) and an invitation to the Forum New Forms of Mobility (FoNeMo) at TFH Wildau, presumably on March 12, 2026 (coverage of conference fee and travel expenses).

You can submit theses from all disciplines that meet the following criteria:

- The thesis investigates a mobility topic in connection with environmental aspects or the use of optimization methods.
- The work was done at a German-speaking university.
- The work was finally handed over to the respective department / institute / professorship between 01.10.2024 and 30.09.2025.

Applications for the Student Award 2025 can be submitted by the supervisor or by the author by November 30, 2025 by e-mail to

student-award@stiftung-heureka.de<mailto:student-award@stiftung-heureka.de>

Your application should contain (see http://stiftung-heureka.de/student-award/ for details):

- A 1- to 3-page summary of the work
- A CV (max one page)
- The Diploma or Master's thesis as a PDF
- The completed cover sheet (download from the website) signed by a professor supporting the application.

The thesis and all other documents can be submitted in German or English.

The winners will be notified in mid-january 2026.

--
Prof. Dr. Ralf Borndoerfer
Zuse Institute Berlin, Optimization
Freie Universität Berlin, Mathematics
Takustrasse 7, 14195 Berlin, Germany
Fon: +49.30.84185-243
Sec: -209
Fax: -269
E-mail: mailto:borndoerfer@zib.de
WWW: http://www.zib.de/borndoerfer

**********************************************************
*
* 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 Symbolic AI at TU Wien

Postdoc and PhD Positions @ TU Wien

The research groups Knowledge-Based Systems (KBS) and Database and AI
(DBAI), Institute of Logic and Computation at TU Wien, are seeking
exceptionally talented and motivated candidates for one Postdoc and two PhD
positions.

The positions are part of the LAGER project ("Learning abstractions for
generalized reasoning in AI") funded by the Vienna Science and Technology
Fund, led by Zeynep G. Saribatur, Thomas Eiter and Nysret Musliu, starting
in January 2026.

The project tackles the challenge of equipping AI systems with the
human-like ability to generalize, such as identifying common problem
structures and generating solutions that work for diverse instances, for
solving real-world problems and generalization challenges. By focusing on
Answer Set Programming (ASP), the project will establish theoretical
foundations for generalized reasoning and develop domain-independent
methods for learning useful abstractions over ASP programs.

*Postdoc Position*

Candidates for the Postdoc position should have a strong background in
logic-based AI, machine learning, answer set programming, or logic
programming at large.

The position is available from January 1st, 2026 and is for 2 years.

The application should contain a research statement, a complete CV, and two
recommendation letters, sent separately by each reference person.

*PhD Positions*

Candidates for the PhD positions should have a strong background in
symbolic AI and good programming skills.

One PhD position is available from January 1st, 2026, and the other
position is from July 1st, 2026.

The application should contain a research statement, a complete CV,
transcripts of completed studies, abstract of the applicant's MSc or BSc
thesis, and two recommendation letters, sent separately by each reference
person.

The applications should be sent to zeynep.saribatur@tuwien.ac.at. The
reference letters can be sent within two weeks from submission.

Applications will be processed on a regular basis and continue until the
positions are filled.

https://www.dbai.tuwien.ac.at/user/saribat/lager/

--
Zeynep G. Saribatur
Databases and Artificial Intelligence Group
Institute of Logic and Computation
TU Wien, Vienna, Austria

[DMANET] CPM 2026 call for papers

================================
The 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026) will
take place in Copenhagen, Denmark, from June 15 to 17, 2026.
https://cpm2026.compute.dtu.dk
================================
[Call for papers]
We seek papers on original research unpublished elsewhere in all areas
related to combinatorial pattern matching and its applications. The
proceedings will be published by LIPIcs (of Dagstuhl).

[Two submission rounds]
CPM has two rounds of submission: The first round aims to select half of
the papers, and the second round aims to select the rest. Papers rejected
from the first round can be resubmitted in the second round, competing with
solicited new submissions.

[Important dates]
- First submission round deadline: November. 12, 2025 (AoE)
- Author notification: December 23, 2025
- Second submission round deadline: February 13, 2026 (AoE)
- Author notification: April 1, 2026
- Conference: June 15-17, 2026

[Submission]
Submissions are made through the EasyChair conference system, accessible
via the link below. The submission process requires registration to create
an EasyChair account before submission.
https://easychair.org/conferences/?conf=cpm2026

[Submission format]
The authors should submit an extended abstract not exceeding 12
single-spaced pages on A4 paper, excluding the title page (containing
title, authors, affiliations, e-mail addresses, a short abstract, and
keywords) and the references. The authors are required to use the LIPIcs
LaTeX style (https://submission.dagstuhl.de/series/details/LIPIcs#author).
Papers must be submitted as a single PDF file.

Additional material intended for the referees but not for publication in
the final version - for example, details of proofs - may be placed in a
clearly marked appendix that is not included in the page limit. The program
code of experimental papers should be made public, along with reasonable
documentation, so that the PC can evaluate the replicability of
experimental results.

Papers submitted for review should represent original, previously
unpublished work and surveys of important results. At the time the extended
abstract is submitted to CPM, and for the entire review period, the paper
(or an essentially identical paper) should not be under review by any other
conference with published proceedings or by a scientific journal.
At least one full registration is required for each accepted paper, and an
author should present the accepted paper.

[Programme Committee]

Diego Arroyuelo (Pontificia Universidad Católica de Chile, Chile)
Philip Bille (Technical University of Denmark, Denmark), co-chair
Itai Boneh (Bar Ilan University)
Nicola Cotumaccio (University of Helsinki, Finland)
Patrick Dinklage (Technische Universität Dortmund, Germany)
Jonas Ellert (ENS - PSL, France)
Rolf Fagerberg (University of Southern Denmark, Denmark)
Pawel Gawrychowski (University of Wroclaw, Poland)
Samah Ghazawi (Braude College of Engineering, Israel)
Daniel Gibney (University of Texas at Dallas, USA)
Veronica Guerrini (University of Pisa, Italy)
Shunsuke Inenaga (Kyushu University, Japan)
Sung-Hwan Kim (Ca' Foscari University of Venice, Italy)
Susana Ladra (University of A Coruña, Spain)
Moshe Lewenstein (Bar-Ilan University, Israel)
Sebastian Maneth (Universität Bremen, Germany)
Veli Mäkinen (University of Helsinki, Finland)
Yakov Nekrich (Michigan Technological University, USA)
Nadia Pisanti (University of Pisa, Italy)
Nicola Prezza (Ca' Foscari University, Italy), co-chair
Jakub Radoszewski (University of Warsaw, Poland)
Leena Salmela (University of Helsinki, Finland)

Wednesday, October 29, 2025

[DMANET] [Call] 10th AIROYoung Workshop and Ph.D. School, February 9-13, 2026 @Padova, Italy – Registration opening and 1st Call for Contributions

Dear all,

After last month's preliminary message about the dates of the 10th
AIROYoung Workshop and Ph.D. School (10AYW), we are excited to announce
that the *registration and abstract submission will open on November 3rd,
at 17:00 CET*. Here is the link to the official website:
https://ayw2026.github.io, where you will find all the information about
every part of the event.

Below, we have included all details about important dates, registration,
abstract submission, accommodation grants, short paper submission, and
awards.
For any questions, please feel free to email airoyoungworkshop2026@gmail.com
.

We can't look forward to seeing you in Padova to celebrate our first ten
years!

The 10AYW organizing committee and the AIROYoung Board

--------------------------------------------------------------------------------------------------------
*Call for Registration and Contributions to the **10th AIROYoung Workshop
and Ph.D. School – **Optimization between determinism and uncertainty*

*University of Padua, February 09-13, 2026*

With this call, we invite all AIROYoung members, Ph.D. students, and
early-stage Researchers (Ph.D. degree <= 5 years) in Operations Research
and related topics, or anyone with a strong interest in OR under 35 years
old, to submit an abstract to be presented during the workshop.

*REGISTRATION – Deadline: January 28, 2026*

- One of AIROYoung's missions is to involve everyone in its events,
regardless of their funds. For this reason, our events are free for
everyone, and we work hard to secure some funding to help with
accommodation.

- Participants submitting an abstract and simple attendees are required to
fill in the *Workshop Registration Form* (link to the form will be
available here <https://ayw2026.github.io/info/> on November 3rd, at 17:00
CET).

- Please note that you can first register and later submit an abstract,
even after days or weeks. We kindly ask you to register as soon as possible
to get an estimate of the number of participants (and also, if you want to
apply for an accommodation grant, the sooner, the better – see below).

*ABSTRACT SUBMISSION – Deadline: December 10, 2025*

- Authors can submit an abstract to give a short presentation of their work
by filling out the *Abstract Registration Form* (link to the form will be
available here <https://ayw2026.github.io/info/> on November 3rd, at 17:00
CET).

- Submitted abstracts must be limited to one page (including references).
Please use the LaTeX or the Word template available here
<https://drive.google.com/file/d/1CvrwMNoGrqzNArSUvv-OT2wt7OgIZw5a/view?usp=share_link>
and upload a ZIP file containing all source files and a PDF version of
your abstract. Please name your PDF file SURNAME_NAME_10AYW and the ZIP
archive SURNAME_NAME_10AYW.zip.

- The author will be notified of the contribution's acceptance by email by
December 23, 2025.

- Please note that each author can give at most one talk during the event.

*ACCOMMODATION GRANTS*

- Thanks to the financial support offered by AIRO and our sponsors, we are
able to provide several *accommodation grants* to cover accommodation
expenses for the entire event (i.e., hotel check-in on February 8, Sunday
afternoon, and check-out on February 13, Friday morning).

- Grants will be awarded on a first-come, first-served basis to
participants who indicate their interest in applying for the grant during
the registration process and are (willing to become) AIRO members.

- Note that you are already an AIRO member if you have registered for The
International Conference on Optimization and Decision Science (ODS) 2025 or
if you have paid the AIRO registration fee for the year 2026. Otherwise, to
become an AIRO member, please follow the instructions here
<https://www.airo.org/en/become-an-airo-member/>.

- *Grants availability:* 12 grants for those who, regardless of their
career stage, submit an abstract to hold a presentation and whose abstract
is accepted, + 4 grants for those who do not submit an abstract, but must
be master's or first-year Ph.D. students (in this case, a certificate from
a supervisor is required to confirm this).

- Participants who will be awarded an accommodation grant will receive a
notification by December 23, 2025, with all the instructions to follow to
confirm the grant.

*SHORT PAPER SUBMISSION – Deadline: February 14, 2026*
- Besides abstracts, young researchers and practitioners can submit a short
paper as a book chapter of a future volume in the AIRO Springer Series
<https://link.springer.com/series/15947>.
- Attending the workshop is not mandatory for submitting a short paper.
- For guidelines and templates for submitting a short paper, please visit
the related Springer page
<https://www.springernature.com/gp/authors/publish-a-book/step-by-step-conference-proceedings>
.
- For submissions, please visit the dedicated Meteor platform
<https://meteor.springer.com/10AYW>.

*AWARDS*

Authors presenting during the workshop or submitting a short paper to our
Volume in the AIRO Springer Series will have the opportunity to get their
work recognized as outstanding. More precisely, there will be the following
two awards:

- *Optit <https://optit.net/> Best Presentation Award* – You can
indicate your interest in participating in the Abstract Submission form;
prize: €500.
- *Cargoful <https://cargoful.tech/> Best Paper Award* – Participation
is automatic and limited to authors submitting a paper to the Springer
volume; prize: €300.

More details will be available soon.

*PH.D. SCHOOL **LECTURERS** – February 9:*
- Marco Di Summa, University of Padova
- Matteo Fischetti, University of Padova
- Francesco Rinaldi, University of Padova
- Domenico Salvagnin, University of Padova

*WORKSHOP PLENARY SPEAKERS – February 10-13:*
- Martine Labbé, Université Libre de Bruxelles
- Stefan Ropke, Technical University of Denmark
- Hande Yaman Paternotte, KU Leuven
- Wolfram Wiesemann, Imperial College London

*SPECIAL ROUNDTABLE TO CELEBRATE AIROYoung 10th ANNIVERSARY – February 12:*
During the workshop, we will have a special session with AIROYoung's
founders and members of former and current boards, who will share with the
audience the origin of AIROYoung, its mission and growth through the years,
what it meant for each of them, and how it affected their career paths.

*OTHER RELEVANT INFORMATION:*
- The event is open to national and international Ph.D. students,
postdoctoral researchers, and young practitioners working mainly in
Operations Research, but also in Machine Learning and Data Science.
- As usual, no registration fees for participants, thanks to the support of
our national and international sponsors.
- There will be one plenary session only, some industrial talks, and social
events.

If you want to know more or have questions, you can write to us at
airoyoungworkshop2026@gmail.com

*The Organizing Committee*
Manuel Aprile, University of Padova
Francesco Cavaliere, FICO
Martina Galeazzo, University of Padova
Dario Palasgo, University of Padova
Anthony Palmieri, University of Padova
Lorenzo Perinello, University of Padova
Matteo Pernini, ESSEC Business School
Alice Raffaele, University of Padova (chair)
Gabriele Sanguin, University of Padova

*The AIROYoung Board*
Matteo Cosmi, University of Luxembourg
Martina Doneda, University of Bergamo
Alessandro Druetto, University of Torino
Andrea Mancuso, University of Naples Federico II
Sara Stoia, University of Calabria
Marta Leonina Tessitore, University Roma Tre

*Websites and Social Media *

10AYW official website: https://ayw2026.github.io

AIROYoung official website: https://airoyoung.airo.org

LinkedIn: AIRO Young <https://www.linkedin.com/in/airo-young-2bb84234b>

Facebook: AIROYoungResearchersChapter
<https://www.facebook.com/AIROYoungResearchersChapter/?ref=br_rs>

Instagram: airoyoung <https://www.instagram.com/airoyoung/>
X: AIROyoung <https://twitter.com/AIROyoung>

[DMANET] PhD position at TU Dortmund

Applications are invited for a PhD position (3 years) at TU Dortmund, Computer Science, Chair 2: Algorithms and Complexity.

Proficiency in GERMAN at level B2 or above is a requirement as the position comes with teach duties.

You should have a background/interest in

- combinatorics
- probability theory, and/or
- statistical/mathematical physics

and an MSc in Maths, Physics, Computer Science or a related area.

More details about our research/team can be found at

https://eac.cs.tu-dortmund.de/

The application deadline is Nov 18.

Please email your application documents (CV, transcripts, MSc thesis, list of publications and a certificate of proficiency in German if you attended school outside of Germany) to

amin.coja-oghlan@tu-dortmund.de

For the official announcement please refer to

https://service.tu-dortmund.de/documents/18/2120797/Text+Auschreibung_NEU_NEU.pdf/5328c9ee-c3a4-d528-bcfe-1a8292956cec
**********************************************************
*
* 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] EATCS Bulletin: Autumn issue available!

Dear DMANET community,

The new EATCS Bulletin #147 is available!
https://eatcs.org/images/bulletin/beatcs147.pdf

In the Computational Complexity Column, Ryan Williams provides a background
exposition of a recent theorem in computational complexity related to how
fast algorithms can be simulated with less memory.

In the TCS on the Web Column, Stefan Neumann talks to the current
maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath. The TCS Blog Aggregator is a community-maintained hub for
researchers in complexity theory and algorithms.

In the Formal Language Column, Antonio Casares studies transition-based vs
stated-based acceptance for automata over infinite words, and advocates
using the former. He presents a collection of problems where the choice of
formalism has a major impact and discuss the causes of these differences.

In the Distributed Computing Column, Amitabh Trehan provides insights into
a most simple yet surprisingly deep algorithmic problem: flooding with no
memory.

Pablo Barcelo and David Saulpic are our new editors for the new Machine
Learning column. In their first column, they present a nice and wide review
on how different areas of TCS have contributed to recent advances in ML, or
how it could contribute.

Anuj Dawar is the new editor of the Logic in Computer Science Column,
stepping into the shoes of Yuri Gurevich. Welcome aboard! And many thanks
Yuri for all your great contributions to the Bulletin over so many years –
since 1988! In his first column, he explores the question about the
smallest number of variables with which a formula can be equivalently
written, an important measure related to notions of width arising in
database theory, graph theory and permutation groups.

In the Education Column, R. Ramanujam explores whether concepts from formal
logic can meaningfully contribute to mathematics education at the school
level, reporting on an attempt to work with high school teachers of
mathematics in India.

For the jubilee year of the DISC conference, the "DISC historians" Michel
Raynal and Nicola Santoro tell us the story of WADS/DISC since 1985, a
sibling to the then 4-years old PODC conference. They also share their
thoughts of what makes a good conference in general, and share several nice
historical photos.

Furthermore, I am very happy to announce a new initiative, which aims to
accompany the Bulletin with videos. The initiative is led by Sophie
Huiberts and Ian Mertz. In his essay in the Perspective Column, Ian gives a
motivation and overview of this initiative, and also advertises a call for
videos for EATCS.

The Bulletin also contains several nice conference reports: Matthias
Bentert provides a spotlight of the ALGO conference, Florian Chudigiewitsch
of STACS, and there is also a summary of the British Colloquium for
Theoretical Computer Science.

Last but not least, in case you are in Prague soon, you are welcome to
check out the exhibition 'The Making of a New Science,' on the early
history of theoretical computer science.

Enjoy the new Bulletin!
Stefan

Prof. Dr. Stefan Schmid
Intelligent Networks (INET)
TU Berlin, Germany
Research group at TU Berlin: https://www.tu.berlin/en/eninet
Research group at Weizenbaum Institute:
https://plamadiso.weizenbaum-institut.de/
<https://plamadiso.weizenbaum-institut.de/>
Personal: *https://schmiste.github.io/ <https://schmiste.github.io/>*

[DMANET] Hiring: 2025 Call for IBS Young Scientist Fellowship (Due: December 5, 2025)

The IBS Discrete Mathematics Group has an opening for the 1 IBS Young
Scientist Fellowship.
https://dimag.ibs.re.kr/ysf2025/

If you have any questions, please feel free to contact me.

Note that there is another ongoing call for
four "IBS DISCRETE MATHEMATICS GROUP (DIMAG) RESEARCH FELLOWSHIP"
positions (DUE: DECEMBER 3, 2024).
This position is for a maximum of 5 years, and
the minimum requirement is to have an (official) Ph.D. degree by
September 1, 2026.
https://dimag.ibs.re.kr/hiring/

========================================================================
2025 CALL FOR IBS YOUNG SCIENTIST FELLOWSHIP (DUE: DECEMBER 5, 2024)
========================================================================

The IBS Discrete Mathematics Group has an opening for the 1 IBS Young
Scientist Fellowship.

1. Introduction

With the vision of "Making discoveries for humanity and society," the
Institute for Basic Science (IBS) was founded in 2011 by the Korean
government to promote basic science in Korea. To date, IBS operates 30
Research Centers which have been yielding outstanding results in
various research fields.

The IBS started to select Young Scientist Fellow (YSF) in 2016 to play
an active role in fostering the next generation of basic science
leaders. This program offers young scientists opportunities to conduct
independent research with state-of-the-art research infrastructure of
the IBS and to grow on the basis of research collaborations with
leading researchers.

We hope that the YSF program serves as a stepping stone for our
researchers to mature into leading researchers in basic science.

2. Eligibility

Within seven years of obtaining a Ph.D. (obtained no earlier than 1
January 2018) or under the age of 40 with a Ph.D. (born no earlier
than 1 January 1985)
Ph.D. candidates must be conferred with a Ph.D. degree no later than
30 June 2026.

3. Hiring Research Centers

Discrete Mathematics Group has an opening. Budget: Up to KRW 180
million per year.

For other centers and groups, please visit the IBS website
https://www.ibs.re.kr/ysf/.

4. Benefits and Conditions

Full-time work and 100% research participation in principle
– If successful candidates for the YSF are selected for other projects
(e.g., Sejong Science Fellowship and Young Researcher Program of the
National Research Foundation), their selection may be cancelled.
During the research term, participating in other projects funded by
sources outside the IBS are not allowed.
Annual fund of KRW 180–300 mil. (up to KRW 180 mil. for theoretical
fields and up to KRW 300 mil. for experimental fields), including
salary of KRW 60–70 mil.
Appointment for three years with a possible two-year extension
depending on the performance review results
* When current IBS researchers are selected as a YSF of their Center,
support will be offered for up to three years.
YSFs will work at one of the IBS Centers and conduct independent
research with research facilities and equipment of their Centers. They
may organize small research groups.
– YSFs should prioritize using the advanced research infrastructure of
their Centers in conducting research. Although they may construct
research equipment and facilities within their budget, the
construction scale and timing may be adjusted through review.
Successful candidates must be appointed and commence their research
within 1 July – 16 December 2026
– If their appointment and research commencement are not completed
within 1 July – 16 December 2026, their selection may be cancelled.
When the Center (PRC Group) to which a YSF group belongs is closed,
the YSF group will also be closed in principle.
– Please refer to the FAQ for details.

5. Selection Process (The schedule may change depending on the
circumstances of IBS.)

* First phase: Letter of intent (approx. three pages) acceptance and evaluation

Submission deadline: 5 December 2025
Review of each letter of intent by the director and the selection
and evaluation panel concerned
Invitation to submit full research proposals: January 2026
– Applicants who pass the first phase will be requested to submit an
approx. 10-page full research proposal, up to three reference letters
and presentation materials.

* Second phase: Full research proposal acceptance and in-depth
evaluation by field

Submission deadline: February 2026
Review of each full proposal and reference letter by the director concerned
Interview (on-site presentation) by the selection and evaluation
panel concerned: March 2026
– If candidates reside abroad or have difficulty attending on site,
the evaluation will be held via video conference.

* Third phase: Comprehensive evaluation and notification of the results

Comprehensive evaluation by panel chairs

* Final selection and notification of the results: ~ June 2026

6. How to Apply: IBS website by 5 December 2025, 17:59(KST)

https://www.ibs.re.kr/ysf/apply

7. Inquiries

Research Evaluation Team at ysf@ibs.re.kr
IBS website at https://www.ibs.re.kr/ysf/juniorci

--
Sang-il Oum (엄상일) dimag.ibs.re.kr/home/sangil/
CI (Chief Investigator) of the IBS Discrete Mathematics Group.
Distinguished Research Fellow (수석연구위원), Institute for Basic Science (IBS).

Tuesday, October 28, 2025

[DMANET] Event announcements: EBRAINS Summit & Camillo Golgi International school of Brain Cells & Circuits

Dear all,
I am writing to you about two important upcoming events:

EBRAINS Summit 2025 - Transforming Brain Research and Medicine taking place from 8-11 December at The Egg in Brussels!

and

Camillo Golgi International school of Brain Cells & Circuits

It is an important opportunity for us to get together. I am sharing some of the official program details for both events here below:

—————————

EBRAINS Summit 2025

The Summit will feature a rich programme including scientific talks with leading experts such as Professor Rafael Yuste from Columbia University and Professor Onur Güntürkün from Ruhr University Bochum. Executive Vice-President for Tech Sovereignty, Security and Democracy, Henna Virkkunen, European Commission, and Executive Director, Anders Dam Jensen, European High Performance Computing Joint Undertaking, will deliver welcome speeches. In addition, the programme will include a public day, a science slam, poster sessions, and a science market exhibition - all focused on advancing digital neuroscience.

The programme will showcase how EBRAINS' Research Infrastructure, digital tools and services are being actively used to advance neuroscience and drive innovation. Through real-world examples, attendees will explore how these resources support digital neuroscience research, with sessions covering topics such as AI and its connections to neuroscience, brain medicine, neuromorphic computing, and more.

The EBRAINS Summit 2025 partners with the International Neuroinformatics Coordinating Facility (INCF<https://elinkeu.clickdimensions.com/c/7/eyJhaSI6OTIwODcxNTYsImUiOiJtZy1lbmM6SURzN1VlU1FneG9VazhCcnlOMGV2Y1dSTUoyVWF3YXBmblZxQldtV3dvOD0iLCJyaSI6ImNvbnRhY3QtMTQ5MDY3MDIzNGU2ZWUxMTkwNGMwMDIyNDhhNDNmYjEtZmE0MmI5ODI1MTVhNGJjNmE2YTk1MzhkMzUzYzEwMDAiLCJycSI6InAxLWIyNTI2Ny0yYWMzNDc2YWMzMDY0MmU1YWYxMjMxYWIyMmQ5ZWQxZCIsIm0iOmZhbHNlLCJ1aSI6IjQiLCJ1biI6IiIsInUiOiJodHRwczovL3N1bW1pdDIwMjUuZWJyYWlucy5ldS9hYm91dC1pbmNmP19jbGRlZT00SFhxWG5OaGJ0NzRlTElGczVid2FmQUo0cWhuNHQ5NWN0dEJ6S1RBZG5OR3Bab0tUeUdPczY3VFNUellkdHAtJnJlY2lwaWVudGlkPWNvbnRhY3QtMTQ5MDY3MDIzNGU2ZWUxMTkwNGMwMDIyNDhhNDNmYjEtZmE0MmI5ODI1MTVhNGJjNmE2YTk1MzhkMzUzYzEwMDAmZXNpZD1lYTFjMWQ1OC0yZDk5LWYwMTEtYjRjYi03YzFlNTIyMDgyOWIifQ/6naXM6umQkhjXGfRW4IblA>) to support the shared mission of both organisations. The Joint Day with INCF on Thursday, 11 December will highlight our joint commitment to FAIR, open, and collaborative neuroscience.

More details about the event and registrations are available on the EBRAINS Summit website.<https://summit2025.ebrains.eu/>

—————————

Camillo Golgi International school of Brain Cells & Circuits

2025 marks 10 years of the School of Brain Cells and Circuits dedicated to "Camillo Golgi". The 2025 Course will consider the journey of these 10 years and look forward to where we are with modelling the brain and its dynamics, towards clinical applications.

Over the years we have formed a partnership with EBRAINS that offers an ideal ecosystem for collaborations and sharing of data and tools. Indeed, the school operates in synergy with another EBRAINS workshop (EITN https://www.eitn.org/) where the latter offers the possibility to dive deeper into the computational side of virtual brain modelling, while in Erice we will foster in depth discussions on fundamental neuroscience and clinical issues.

This year, we will continue to dig deep into the brain digital twin, which will provide a great learning opportunity. The program is here below:

[preview.png]
I hope to see you there!

Kind regards,
Viktor Jirsa

Director of the Institut de Neurosciences des Systèmes, INS UMR 1106 in Marseille, France
CSO EBRAINS
Lisa Otten
Project Manager, Institut de Neurosciences des Systèmes
AMU Inserm UMR1106
Faculté de Médecine,
27, Boulevard Jean Moulin
13005 Marseille, France
Phone: +33 (0)4 91 32 42 56

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

We welcome submissions to the 37th International Workshop on Combinatorial Algorithms (IWOCA 2026), which will be held during June 8-12, 2026, at Université Clermont Auvergne in Clermont-Ferrand, France.
Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.

***Conference website***
https://iwoca2026.limos.fr

***Topics***
The conference focuses on combinatorial algorithms and related areas. Topics of interest include (but are not limited to) the following:

Algorithmic Game Theory
Algorithmic Lower Bounds and Fine-grained Complexity
Algorithms and Data Structures
Algorithms for Big Data and Networks Analytics
Algorithms for Cryptography and Information Security
Algorithms on Graphs, Strings, and other Discrete Structures
Approximation Algorithms
Circuits and Boolean Functions
Combinatorics
Combinatorics of Words
Combinatorial Games
Combinatorial Generation, Enumeration and Counting
Combinatorial Optimization
Complexity Theory
Computational Algebra
Computational Biology
Computational Geometry
Distributed and Parallel Algorithms
Dynamic and Temporal Networks
Experimental Evaluation of Algorithms
Graph Drawing
Graph Theory
Mobile Agents
New Paradigms of Computation
Online and Streaming Algorithms
Parameterized and Exact Algorithms
Probabilistic and Randomized Algorithms
Scheduling Algorithms

***Important dates (Anywhere on Earth)***
January 26, 2026: abstract submission deadline
February 2, 2026: full paper submission deadline
March 25, 2026: notification
April 6, 2026: camera-ready deadline
May 11, 2026: early registration deadline
May 27, 2026: late registration deadline
June 8-11, 2026: IWOCA 2026
June 11-12, 2026: collaborative workshop
October 31, 2026: special issues submission deadline

***Submission instructions***
Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics of IWOCA. Papers are to be submitted electronically through Easychair at the following link: https://easychair.org/conferences/?conf=iwoca2026

Simultaneous submission to other conferences or workshops with published proceedings or to a journal is not allowed. At least one author of each accepted paper must present the paper at the conference as a registered participant. For authors who cannot present their paper in person, remote presentations are possible, but the workshop will not be held online and full registration will still be mandatory.

Each submission should be in the form of a single pdf file and consist of the main part of the paper, not exceeding 12 pages in the Springer LNCS format (including the title page and excluding the references), plus an optional, clearly marked appendix (to be read at the discretion of the committee). The main body of the paper must be self-contained, in particular, any figure pertaining to the main part of the paper should be included therein (within the 12 page limit). The LNCS style should not be modified (font size, spacing and margins should follow the default of the LNCS style). The paper should not reveal the identities of the authors (see instructions for double-blind format below). Submissions not conforming to the above rules and papers outside of the scope of the conference will be rejected without consideration. Springer encourages authors to include their ORCIDs in their papers, and requires to draw the attention of the contributing conference paper authors to the Code of Conduct. Please follow Springer's guidelines at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines

Papers eligible for the best student paper award should be identified as "Student Paper" in the submission system by ticking the appropriate checkbox.

***Double-blind reviewing***
For the first time, IWOCA 2026 will employ a lightweight double-blind reviewing process: submissions should not reveal the identity of the authors in any way. The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. Uploading the paper to one's website or to a public repository (such as the arXiv) is permitted. Conflicts of interest with members of the programme committee must be disclosed on the submission server at the time of submission. Conflicts of interest include: being a family member or close friend, advisor/advisee (no time limit), having the same affiliation, being involved in an incident of harassment or other negative interaction (it is not required that the incident be reported or known), person who owes author a favour (e.g., recently requested a reference letter), frequent or recent collaborator (within last 5 years), and any other situation where the person may not be objective in judging the authors' work.

***Proceedings***
The conference proceedings will be published in the LNCS series of Springer, within the ARCoSS subline.

***Journal special issues***
Authors of selected papers accepted to IWOCA 2026 will be invited to submit extended versions of their papers to Special Issues at the "Journal of Computer and Systems Sciences" and "Discrete Mathematics & Theoretical Computer Science".

***Awards***
Awards sponsored by Springer will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper. The programme committee may decline to make these awards or may split them.

***Open problems and collaborative workshop***
In the tradition of past IWOCAs, an open problem session will take place during the conference, and on 11-12 June 2026, a 1.5-day collaborative workshop will take place. We encourage all IWOCA participants to stay in order to engage in collaborative work in a friendly atmosphere.

***Extended Stay Support Scheme***
We encourage all IWOCA participants to use the opportunity of traveling to France to plan a visit to any French institution reachable without plane, before or after IWOCA 2026. A selected number of partner institutions will offer partial funding for such research trips.

***Registration***
The early registration fees are planned to amount to 275€ for student participants and 385€ for other participants. An extra 110€ needs to be added for the late registration fees. The registration includes lunches, coffee breaks and social programme.

***Venue***
Clermont-Ferrand lies in the heart of France and is surrounded by a beautiful (non-active) volcanic range featuring multiple hills, mountains and lakes, to which various hiking trips can be arranged. Clermont-Ferrand is accessible by train, bus or plane via Paris and Lyon international airports.

***Invited Speakers***
Sergio Cabello (University of Ljubljana, Slovenia)
Pierre Fraigniaud (CNRS, Université Paris Cité, France)
Neeldhara Misra (Indian Institute of Technology Ghandinagar, India)

***Programme Chairs***
Florent Foucaud (Université Clermont Auvergne, Clermont-Ferrand, France)
Aline Parreau (CNRS, Université Lyon 1, France)

***Programme Committee***
Cristina Bazgan (Université Paris Dauphine, France)
Petra Berenbrink (Universität Hamburg, Germany)
Davide Bilo (Università dell'Aquila, L'Aquila, Italy)
Hans-Joachim Böckenhauer (Eidgenössische Technische Hochschule Zürich, Switzerland)
Hans Bodlaender (Universiteit Utrecht, Netherlands)
Tiziana Calamoneri (Sapienza Università di Roma, Italy)
Dibyayan Chakraborty (University of Leeds, UK)
Monika Csikos (Université Paris Cité, France)
Antoine Dailly (INRAE, Université Clermont Auvergne, Clermont-Ferrand, France)
Peter Dankelmann (University of Johannesburg, South Africa)
Jessica Enright (University of Glasgow, UK)
Henning Fernau (Universität Trier, Germany)
Florent Foucaud (Université Clermont Auvergne, Clermont-Ferrand, France)
Serge Gaspers (University of New South Wales, Sydney, Australia)
Pavol Hell (Simon Fraser University, Vancouver, Canada)
Ling-Ju Hung (National Taipei University of Business, Taiwan)
Ralf Klasing (CNRS, Université de Bordeaux, France)
Thierry Lecroq (Université de Rouen Normandie, France)
Daniel Lokshtanov (University of California Santa Barbara, USA)
Arnaud Mary (Université Lyon 1, France)
Martin Milanic (Univerza na Primorskem, Koper, Slovenia)
Valia Mitsou (Université Paris Cité, France)
Pedro Montealegre (Universidad Adolfo Ibáñez, Santiago de Chile, Chile)
Amer Mouawad (American University of Beirut, Lebanon)
Lucia Moura (University of Ottawa, Canada)
Alantha Newman (CNRS, ENS Lyon, France)
Prajakta Nimbhorkar (Chennai Mathematical Institute, India)
Aline Parreau (CNRS, Université Lyon 1, France)
Rajiv Raman (Indraprastha Institute of Information Technology Delhi, India)
Adele Rescigno (Università degli studi di Salerno, Italy)
Matthieu Rosenfeld (Université de Montpellier, France)
Sagnik Sen (Indian Institute of Technology Dharwad, India)
Maria Serna (Universitat Politècnica de Catalunya, Barcelona, Spain)
Ana Silva (Universidade Federal do Ceará, Fortaleza, Brazil)
Ueverton Souza (IMPA Tech, Instituto de Matemática Pura e Aplicada, Rio de Janeiro, Brazil)
Prafullkumar Tale (Indian Institute of Science Education and Research Pune, India)
Kunihiro Wasa (Hosei University, Tokyo, Japan)
Binhai Zhu (State University of Montana, Bozeman, USA)

***Organizing Chairs***
Antoine Dailly (INRAE, Université Clermont Auvergne, Clermont-Ferrand, France)
Florent Foucaud (Université Clermont Auvergne, Clermont-Ferrand, France)

***Local Organizing Committee (Université Clermont Auvergne)***
Gaétan Berthe
Béatrice Bourdieu
Antoine Dailly
Jona Dirks
Solène Drouet
Florent Foucaud
Yan Gerard
Claire Hilaire
Sophie Huiberts
Victoria Kaial
Lucas Lorieau
Anirudh Rachuri
Alexandre Vigny
Loïc Yon

***Steering Committee***
Maria Chudnovsky (Princeton University, USA)
Henning Fernau (Universität Trier, Germany)
Ralf Klasing (CNRS, Université de Bordeaux, France)
Tomasz Radzik (King's College London, UK)
Bill Smyth (McMaster University, Hamilton, Canada)
Wing-Kin (Ken) Sung (Chinese University of Hong Kong, China)

[DMANET] postdoc opening - graph algorithms on GPUs for decision-focused learning

Dear colleagues,

I am recruiting a postdoctoral researcher to work with me on the design and implementation of massively parallel graph algorithms. This is part of a larger project on mutualisation in logistics, where the use of decision-focused learning methods will require very efficient optimization subroutines.

The position is fully funded for a duration of 2 years, its location is École des Ponts (near Paris). More details can be found here: https://acme-mobidec.github.io/jobs/.

Feel free to reach out if you have any questions, and to spread the word among your network.
Best,

Guillaume Dalle
Researcher - École des Ponts (LVMT)
https://gdalle.github.io/

I do not expect this message to be read or acted upon outside of regular working hours.

**********************************************************
*
* 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] [EvoCOP 2026] Paper Submission Deadline Extended to November 15

(Apologies for cross-posting)

*************************************************************************************
Call for Papers -- Deadline Extended:
EvoCOP 2026 - The 26th European Conference on
Evolutionary Computation in Combinatorial Optimisation

https://www.evostar.org/2026/evocop/

April 8--10, 2026
held as part of EvoStar (https://www.evostar.org)

Venue: Toulouse, France

** EvoCOP is CORE Rank B **

Submission deadline: ** November 15, 2025 **
(Originally: November 1, 2025)
*************************************************************************************

The 26th European Conference on Evolutionary Computation in
Combinatorial Optimisation
is a multidisciplinary conference that brings together researchers
working on applications
and theory of evolutionary computation methods and other metaheuristics
for solving
difficult combinatorial optimisation problems appearing in various
industrial, economic,
and scientific domains.

Successfully solved problems include, but are not limited to,
multi-objective, uncertain,
dynamic and stochastic problems in the context of scheduling,
timetabling, network design,
transportation and distribution, vehicle routing, stringology, graphs,
satisfiability,
energy optimisation, cutting, packing, planning, and search-based
software engineering.

Successfully addressed theoretical and translational challenges
encompass, but are not
limited to, the development and analysis of novel (components of)
evolutionary and other
metaheuristic algorithms, work on neighbourhood and landscape
structures, problem-agnostic
and problem-specific variation operators, parallelisation strategies,
and hybridizations. ⁠

The EvoCOP 2026 conference will be held together with EuroGP (the 29th
European Conference
on Genetic Programming), EvoMUSART (the 15th European conference on
evolutionary and
biologically inspired music, sound, art and design) and EvoApplications
(the 29th European
Conference on the Applications of Evolutionary Computation), in a joint
event collectively
known as EvoStar (Evo*).

Accepted papers will be published by Springer Nature in the Lecture
Notes in Computer
Science series. Previous proceedings can be found in the EvoCOP
Conference Proceedings in
SpringerLink.

The best regular paper presented at EvoCOP 2026 will be distinguished
with a Best Paper
Award.

EvoCOP conference is ranked B in the CORE 2021 ranking:
http://portal.core.edu.au/conf-ranks/2195/

**** Areas of Interest and Contributions ****

EvoCOP welcomes submissions in all experimental and theoretical aspects
of evolutionary
computation and other metaheuristics to combinatorial optimisation
problems, including
(but not limited to) the following areas:
* Applications of metaheuristics to combinatorial optimization problems
* Theoretical developments
* Neighborhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Constraint-handling techniques
* Parallelization and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Automatic algorithm configuration and design

Prominent examples of metaheuristics include (but are not limited to):
* Evolutionary algorithms
* Estimation of distribution algorithms
* Swarm intelligence methods such as ant colony and particle swarm
optimisation
* Artificial immune systems
* Local search methods such as simulated annealing, tabu search,
variable neighbourhood
search, iterated local search, scatter search and path relinking
* Hybrid methods such as memetic algorithms
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Surrogate-model-based methods

Notice that, by tradition, continuous/numerical optimisation is *not*
part of the topics
of interest of EvoCOP. Interested authors might consider submitting to
other EvoStar
conferences such as EvoApplications.

**** Submission Details ****

Paper submissions must be original and not published elsewhere. The
submissions
will be peer-reviewed by members of the program committee. The reviewing
process will be double-blind, please omit information about the authors
in the
submitted paper.

Page limit: 14 + unlimited pages for references and acknowledgments

Submission link: https://easychair.org/conferences/?conf=evostar2026

The authors of accepted papers will have to improve their paper on the
basis of
the reviewers' comments and will be asked to send a camera-ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference, attend the conference and present the work.

**** Important Dates ****

(New) submission deadline: ** November 15, 2025 **
EvoStar: April 8--10, 2026

**** EvoCOP Program Chairs ****

Martin Krejca
Ecole Polytechnique, IP Paris, France
martin.krejca@polytechnique.edu

Nelishia Pillay
University of Pretoria, South Africa
nelishia.pillay@up.ac.za

Please check the website for more information: http://www.evostar.org/
And follow us at: X - https://x.com/EvostarConf and Instagram -
https://www.instagram.com/evostarconference/
Follow SPECIES at: https://www.linkedin.com/company/species-society/

Monday, October 27, 2025

[DMANET] [Scheduling seminar] Zijie Zhou (IEDA, HKUST) | October 29 | Efficient and Robust Large Language Model (LLM) Inference Scheduling Optimization

Dear scheduling researcher,

We are delighted to announce the talk given by Zijie Zhou (IEDA, HKUST).
The title is "Efficient and Robust Large Language Model (LLM) Inference
Scheduling Optimization". The seminar will take place on Zoom on
Wednesday, October 29 at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/91957974467?pwd=bIbyEXuAi693d5e0YLjaxmFFYZQOpF.1
Meeting ID: 919 5797 4467
Passcode: 291598

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

The abstract follows.
We study the problem of optimizing Large Language Model (LLM) inference
scheduling to minimize total completion time. LLM inference is an online
and multi-task service process and also heavily energy consuming by
which a pre-trained LLM processes input requests and generates output
tokens sequentially. Therefore, it is vital to improve its scheduling
efficiency and reduce the power consumption while a great amount of
prompt requests are arriving. There are two key challenges: (i) each
request has heterogeneous prefill and decode lengths. In LLM serving,
the prefill length corresponds to the input prompt length, which
determines the initial memory usage in the KV cache. The decode length
refers to the number of output tokens generated sequentially, with each
additional token increasing the KV cache memory usage by one unit. We
show that minimizing total completion time is NP-hard due to the
interplay of batching, placement constraints, precedence relationships,
and linearly increasing memory usage. We then analyze commonly used
scheduling strategies in practice, such as First-Come-First-Serve (FCFS)
and Shortest-First (SF), and prove that their competitive ratios are
unbounded. To address this, we propose a novel algorithm based on a new
selection metric that efficiently forms batches over time. We prove that
this algorithm achieves a constant competitive ratio. (ii) the output
length, which critically impacts memory usage and processing time, is
unknown. We first design a conservative algorithm, Amax, which schedules
requests based on the upper bound of predicted output lengths to prevent
memory overflow. However, this approach is overly conservative: as
prediction accuracy decreases, performance degrades significantly due to
potential overestimation. To overcome this limitation, we propose Amin,
an adaptive algorithm that initially treats the predicted lower bound as
the output length and dynamically refines this estimate during
inferencing. We prove that Amin achieves a log-scale competitive ratio.

The next talk in our series will be:
Rachel R. Chen (UC Davis) | November 12 | Outpatient Appointment
Scheduling with Waiting Time Limits
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/

[DMANET] PhD Studentships at the School of Computing Science, University of Glasgow

The School of Computing Science at the University of Glasgow is offering several studentships to support PhD research for students starting in October 2026 or shortly thereafter. Funding is available to support tuition fees for both home and international students, and in most cases living expenses at the recommended UKRI rate (currently £21,383 per annum) as well:

https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/studentshipinformation/

To be considered for a studentship at this round, your application must be received by *31 January 2026*.

Whilst the above call is open to students in all areas, applications in algorithms and complexity are welcomed. Available supervisors in this area at the School include:

* Dr Jess Enright (graph algorithms, parameterised complexity, temporal graphs, infectious disease): https://www.dcs.gla.ac.uk/~jenright/
* Dr Yiannis Giannakopoulos (algorithmic game theory, combinatorial optimization, probabilistic analysis of algorithms, computational complexity): https://yiannisgiannakopoulos.com/
* Prof David Manlove (combinatorial and graph algorithms, optimisation, matching problems): https://www.dcs.gla.ac.uk/~davidm/
* Dr Ciaran McCreesh (constraint programming, proof logging, parallel combinatorial search, algorithm engineering): https://ciaranm.github.io/

Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline.

For more information about how to apply, see:

https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents

This web page includes information about the research proposal, which is required as part of your application.

The School will also be hosting an online Information Session for prospective applicants, on Wednesday, 29 October 2025, 10:00 (UK time), via Zoom. Those interested in attending can register in the following link:

https://uofglasgow.zoom.us/meeting/register/mN2xRhT8SMizXXqv3zFP0A
**********************************************************
*
* 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] First Call For Papers | DIAGRAMS 2026

*** *Call for Papers: Diagrams 2026****

15th International Conference on the Theory and Application of Diagrams

August 24–28, 2026

Tallinn University of Technology, Tallinn, Estonia

https://diagrams-conference.org/2026/

*** Highlights ***

- Proceedings published by Springer

- Graduate Symposium

- Three Tracks: Main
<https://diagrams-conference.org/2026/calls/main-track/>, Philosophy
<https://diagrams-conference.org/2026/calls/philosophy-of-diagrams/>,
and Psychology
and Education
<https://diagrams-conference.org/2026/calls/psychology-and-education/>

- Best Paper and Best Student Paper awards

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

The Diagrams conference offers a collective platform for researchers
interested in diagrams. It promotes interdisciplinary collaboration by
uniting specialists from diverse fields—such as computer science,
mathematics, psychology, philosophy, history (including the histories of
science and art), education research, and more—to share insights on both
the theory and practical uses of diagrams.

Diagrams 2026 will feature three dedicated special tracks: Main, Philosophy
and Psychology and Education. Submissions whose primary research
contribution aligns with these themes are encouraged to be directed to the
relevant track, each overseen by its own program committee. Details of the
theme and program committees will be provided in the call for each track.

The conference program will include presentations of accepted papers,
posters, and abstracts, as well as a graduate symposium, workshops, and
tutorials. At least one author of every accepted submission is expected to
attend the conference to present their work and engage with questions from
participants.

For information about the topics of interest for each track, see:
https://diagrams-conference.org/2026/calls/

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

SUBMISSION

We invite submissions for peer review that focus on any aspect of diagram
research for each track, as follows:

• Long Papers (16 pages)

• Short Papers (8 pages)

• Posters (4 pages – this is both a maximum and minimum
requirement)

• Abstracts, i.e. non-archival contributions (3 pages)

*Submission date: March 1, 2026.*

At least one author of each accepted submission is expected to attend the
conference to present their research and respond to questions presented by
delegates. Multiple submissions are accepted.

Long Papers, Short Papers, and Posters will be included in the conference
proceedings. Abstracts, however, will not appear in the published
proceedings but will be made available on the conference website. The
Abstracts category is designed for presenting research at the conference
without publishing a paper and is not intended for work-in-progress; such
work should be submitted as a Poster.

More details, including formatting instructions and all-important dates,
can be found at https://diagrams-conference.org/2026/calls/

--
Publicity Chair, Diagrams Conference 2024
Reetu Bhattacharjee, PhD
Department of Philosophy
University of Münster

[DMANET] Deadline for the PhD School on exact methods for vehicle routing + Workshop

The deadline to enrol in the event below is the 31st of October, 2025.

Please enrol using this form: https://forms.gle/jWb25saPdZYgpx9R9
Event information: https://seio-transporte.github.io/workshop-2025-en/

SEIO Transporte is the working group on transportation of SEIO, the Spanish Society of Statistics and Operational Research.

The SEIO Transporte Workshop will take place December 1-2, 2025, and the SEIO Transporte PhD School will take place December 2-3, 2025. Both events are hosted at Universitat Pompeu Fabra in Barcelona, Spain, at the Ciutadella Campus (Carrer Ramon Trias-Fargas, 5-7, 08005 Barcelona).

The PhD School theme is "Exact methods for vehicle routing and logistics optimisation". The professor is Roberto Roberti (University of Padua), one of the world's leading experts in vehicle routing and combinatorial optimisation. Roberto's work has had a tremendous impact on recent advances in exact algorithms for routing problems with fundamental contributions, such as the ng-path relaxation technique. His work has been published in Management Science, Operations Research, Transportation Science, and the European Journal of Operational Research, among other notable journals.

You can enrol for one or both events; in any case, the price is 100 Euros.

SEIO Transporte offers free accommodation to up to 12 PhD students who attend both events. The offer is for the nights 1-2 and 2-3 December, in shared rooms at a hostel. Priority is given to student members of SEIO Transporte (on a first-come, first-served basis) and then to all other students (on a first-come, first-served basis).

The enrolment fee includes coffee breaks, a social dinner on December 1, and possibly a social activity (TBD).

Best regards,
Alberto Santini
**********************************************************
*
* 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/
*
**********************************************************

Sunday, October 26, 2025

[DMANET] PhD in Continual and Open-ended Reinforcement Learning at the University of Hertfordshire, UK

[Apologies for multiple posts; please distribute to interested people!]

We are looking for applicants for a fully funded PhD (£20,700 per annum
bursary plus the payment of the student fees) in the areas of Continual and
Open-ended Reinforcement Learning at the Computer Science Department of the
University of Hertfordshire, United Kingdom (deadline 14/11/2025).

**PhD Project**

Recent advancements in Artificial Intelligence (AI) have resolved
challenges once deemed insurmountable just a decade ago, and RL is at the
core of this breakthrough. However, most RL methods still struggle to
operate effectively in truly open-ended, non-stationary environments. This
project will push the boundaries of RL by investigating how agents can
continuously learn and adapt over time; how they can autonomously develop
and flexibly apply an ever-expanding repertoire of skills across various
tasks; and what representations allow them to do this efficiently.
Addressing these questions is crucial for creating AI systems that, despite
limited computational resources, can sustain autonomous learning and
adaptation in ever-changing environments throughout their lifetime—becoming
increasingly knowledgeable and capable. The selected candidate will have
the opportunity to master and contribute to cutting- edge techniques in
deep reinforcement learning, incorporating principles from probabilistic
machine learning, information theory, intrinsic motivation, continual and
open-ended learning frameworks. The project will employ computer games as
benchmarking tools and/or apply its findings to robotic systems (in
simulations or on real-world platforms), including manipulators,
intelligent autonomous vehicles, and humanoid robots.This PhD project
offers a unique chance to explore some of the most profound and fascinating
questions in artificial intelligence today, providing the opportunity to
make a significant contribution to a field at the forefront of AI research.

**Requirements**

We are looking for a student who is motivated and passionate about
Artificial Intelligence. A background in computer science or mathematics,
together with strong programming skills, are essential requirements.
Experience in reinforcement learning or robotics are desirable and will be
considered a plus during the selection process. The applicant will be
expected to disseminate her/his work publishing scientific articles and/or
participating at international conferences. To be fluent in English is
mandatory.

**Where**

The PhD will take place in the Adaptive System research group of the
Computer Science department of the University of Hertfordshire, United
Kingdom. The group is specialised in probabilistic/information-theoretic
approaches to Artificial Intelligence, used for a wide range of
applications such as robotics, video-games and cognitive modelling.

According to the Research Excellence Framework 2021, the University of
Hertfordshire is ranked in the top 25% of all UK universities for research
impact and research in Computer Science has been recognised as excellent,
with 90% of the research submitted and all of the research impact rated as
internationally excellent or world leading. The University of Hertfordshire
has ranked second in the UK 2023 Postgraduate Taught Experience survey,
providing a very stimulating environment, offering a large number of
specialised and interdisciplinary seminars as well as general training and
researcher development opportunities. The University is situated in
Hatfield, in the green belt just 25 minutes by train to London.

**How to Apply**

The application must be done following the procedure indicated in this
website:

https://www.herts.ac.uk/study/schools-of-study/physics-engineering-and-computer-science/engineering-and-computer-science/research-in-engineering-and-computer-science/the-phd-programme-in-computer-science

Interested applicants may want to contact Dr. Nicola Catenacci Volpi (
n.catenacci-volpi@herts.ac.uk) to discuss the project, the PhD program at
the University of Hertfordshire and details about the application process.

**Deadline**

14/11/2025

*-----------------------------------*

Dr. Nicola Catenacci Volpi, PhD

Research Fellow in Information Theory for AI & Robotics

Adaptive Systems Research Group

The University of Hertfordshire

Department of Computer Science

College Lane

Hatfield, Hertfordshire AL10 9AB

United Kingdom

E-mail: n.catenacci-volpi@herts.ac.uk

[DMANET] SIROCCO 2026 - Final Call for Papers

*=====================================*

*SIROCCO 2026 Call For Papers **=====================================*

33rd International Colloquium On Structural Information and Communication
Complexity

Durham, UK, June 9–11, 2026

https://sirocco2026.webspace.durham.ac.uk/

https://easychair.org/cfp/sirocco2026

SIROCCO is devoted to the study of the interplay between structural
knowledge, communication, and computing in decentralized systems of
multiple communicating entities. Special emphasis is given to innovative
methodological and solution approaches leading to a better understanding of
the relationship between computing and communication.

SIROCCO has a tradition of interesting and productive scientific meetings
in a relaxed and pleasant atmosphere, attracting leading researchers in a
variety of fields in which communication and knowledge play a significant
role. Past SIROCCO proceedings can be found here:
https://link.springer.com/conference/sirocco.

*=====================================*

*Keynote Speakers **=====================================*

This edition of SIROCCO will feature keynote talks by *Maria Potop-Butucaru* of
Sorbonne University (https://lip6.fr/Maria.Potop-Butucaru
<https://www.lip6.fr/actualite/personnes-fiche.php?ident=P246>) and *Jukka
Suomela* of Aalto University (https://jukkasuomela.fi/). There will also be
a keynote talk by the winner of the *Prize for Innovation in Distributed
Computing 2026* (the winner will be announced at a later date).

*=====================================*

*Scope **=====================================*

Original papers are solicited from all areas of study of local structural
knowledge and global communication and computational complexities, in
particular (in alphabetical order):

* Biological and nature-inspired distributed algorithms

* Blockchains and related distributed paradigms

* Distributed algorithms and computability

* Distributed graph algorithms

* Distributed quantum computing

* Epistemic modeling and analysis of distributed systems

* Fault tolerance

* Formal verification of distributed systems

* Game theory in distributed computing

* Mobile agents and autonomous distributed systems

* Network modeling and analysis

* Security in distributed computing

* Self-stabilization

* Shared-memory algorithms

* Structural and communication complexity analysis

* Topology in distributed computing

* Wireless, ad-hoc, and peer-to-peer networks

Keeping with the tradition of SIROCCO, new areas are also welcome.

*=====================================*

*Important Dates **=====================================*

*Abstract submission:* Sunday, November 2, 2025 (AoE)

*Full paper submission:* Sunday, November 9, 2025 (AoE)

*Notification:* January 20, 2026

*=====================================*

*Venue **=====================================*

SIROCCO 2026 will take place at Durham University (England's 3rd oldest
University) in the UNESCO world heritage city of Durham, UK – the land of
the prince bishops. Located on a dramatic peninsula overlooking the River
Wear, Durham's unique 1100 yr old Norman cathedral and castle form the
designated World Heritage Site attracting tourists from all over the world
including the makers of the Harry Potter movies! Besides the beautiful
river, Durham has acres of tranquil woodland and peaceful parkland,
adjoining castles and attractions including the University's own Botanic
Garden and Oriental Museum. The university city has lovely walks, cobbled
streets, and a unique array of excellent cafes, bars, restaurants, and even
rowing and boating opportunities. Conference participants will have the
opportunity to visit Beamish Living Museum - the 2025 Museum of the
Year. Beamish is a world famous open air museum which brings the history of
North East England to life at its 1820s Pockerley, 1900s Town, 1900s Pit
Village, 1940s Farm, 1950s Town and 1950s Spain's Field Farm exhibit areas.

Durham is easily accessible - located just 30 minutes from the Newcastle
international airport, and less than 3 hours from London, Edinburgh, and
Manchester by train.

*=====================================*

*Submission Instructions **=====================================*

A submission must report on original research and contain results that have
not appeared previously in a regular conference paper and have not been
concurrently submitted to or previously appeared in a journal or a
conference with published proceedings.

The papers must be submitted in PDF format using EasyChair. Submissions
must be written in English and formatted in a single column on US
letter-size or A4 size paper, use at least 11-point font, and have at least
2.5 cm margins.

All submissions must start with a cover page, which will include the
paper's title, author names, a short abstract, and keywords. The main body
of the paper should not exceed 12 pages and should contain a concise and
clear presentation of the primary content and merits of the work. The
12-page limit excludes the cover page and bibliographic references.
Additional material can be included in a clearly marked Appendix, to be
read at the discretion of the reviewers only.

Submissions deviating from these guidelines as well as papers outside the
scope of the conference may be rejected without consideration of their
merits.

A submission that is not accepted as a full paper may be invited for a
brief announcement.

Paper submission will be handled by EasyChair, so please make sure that you
have an active account. The papers must be submitted electronically at:

https://easychair.org/conferences/?conf=sirocco2026
<https://easychair.org/my/conference?conf=sirocco2026>

*=====================================*

*Proceedings **=====================================*

The proceedings of SIROCCO 2026 will be published by Springer in the
Lecture Notes in Computer Science (LNCS) series. Note carefully that
inclusion in the proceedings requires a presentation by one of the authors
at the conference site and at least one full registration for every full
paper.

*=====================================*

*Special Issue*

*=====================================*

Selected papers from SIROCCO 2026 will be invited to a special issue of the
journal Theoretical Computer Science.

*=====================================*

*Best Paper Awards **=====================================*

All regular papers are eligible for the best paper award. Moreover, all
regular papers that have at least one student author, and these student
authors have done most of the work, are also eligible for the best student
paper award. If a submission is eligible for the best student paper award,
please state that on the cover page. The program committee may decline to
make the awards or may split them among multiple papers.

*=====================================*

*Program Committee **=====================================*

Ittai Abraham, Intel Labs

Vitaly Aksenov, Logical Intelligence

Timothé Albouy, IMDEA Software

Emmanuelle Anceaume, IRISA

Hagit Attiya, Technion

Costas Busch, Augusta University

Armando Castañeda, National Autonomous University of Mexico

Joshua Daymude, Arizona State University

Gianluca De Marco, Università di Salerno

Giuseppe Antonio Di Luna, University of Rome – Sapienza

Antonio Fernandez Anta, IMDEA Networks and IMDEA Software

Ran Gelles, Bar-Ilan University

Chryssis Georgiou, University of Cyprus (chair)

George Giakkoupis, Inria

Alexey Gotsman, IMDEA Software

Magnús M. Halldórsson, Reykjavik University

Taisuke Izumi, Osaka University

Tomasz Jurdzinski, University of Wroclaw

Mikel Larrea, University of the Basque Country

Othon Michail, University of Liverpool

Avery Miller, University of Manitoba

Miguel A. Mosteiro, Pace University

Rotem Oshman, Tel-Aviv University

Andrzej Pelc, University of Quebec

Sathya Peri, IIT Hyderabad

Maria Potop-Butucaru, Sorbonne University

Christian Scheideler, Paderborn University

Elad Michael Schiller, Chalmers University of Technology

Gokarna Sharma, Kent State University

Jukka Suomela, Aalto University

Sara Tucci-Piergiovanni, Universite Paris Saclay, CEA LIST

Jennifer Welch, Texas A&M University

Prudence Wong, University of Liverpool

*=====================================*

*Organizing Committee **=====================================*

Amitabh Trehan, Durham University (General chair)

Karl Southern, Durham University (Treasurer)

Peter Davies-Peck, Durham University (Webmaster)

William K. Moses Jr., Durham University (Publicity)

*=====================================*

*Steering Committee **=====================================*

Keren Censor-Hillel, Technion (chair)

Yuval Emek, Technion

Andrzej Pelc, University of Quebec

Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico

Ulrich Schmid, TU Wien

------
Regards,
William K. Moses Jr.
Local Organizer (Publicity), SIROCCO 2026

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