Wednesday, December 10, 2025

[DMANET] Call for Papers – IJPR Special Issue on Innovations in Production Planning

--------------------------------------------------------------------------------------------
Call for Papers – International Journal of Production Research

Special Issue on Innovations in Production Planning
--------------------------------------------------------------------------------------------

Dear Colleagues,
We are pleased to announce a Call for Papers for the International
Journal of Production Research (IJPR) Special Issue: "Innovations in
Production Planning: Emerging Problems and Modern Solution Paradigms."

This special issue, led by Chief Editor Alexandre Dolgui, invites
contributions that address the evolving challenges of production
planning in modern manufacturing contexts.

Topics of interest include, but are not limited to:

- Evolution of classical planning problems in modern manufacturing (lot
sizing, capacity planning, scheduling, assembly line balancing)
- Planning in reconfigurable, modular, and hybrid manufacturing systems
- Integration of additive manufacturing with conventional processes in
planning

- Additive manufacturing production scheduling
- Digital twin–enabled planning and real-time adaptive scheduling
- Production planning under sustainability, circular economy, emissions,
and carbon goals

- Resilience-oriented planning under uncertainty, disruptions, and
volatility
- Advanced optimization methods: decomposition, robust/stochastic
models, metaheuristics
- Machine learning, reinforcement learning, and hybrid AI–optimization
for planning
- Simulation–optimization frameworks and surrogate modeling
- Production planning in customized environments (engineering-to-order,
make-to-order, mass customization)

- Human–robot collaborative systems and operator-driven planning in
Industry 5.0
- Reinforcement learning / deep learning models for dynamic planning and
scheduling (e.g., graph neural networks, RL architectures)
- Optimization of production and inventory strategies in modern
distribution systems (e-commerce, platform-based logistics)

Submission Deadline: 30 April 2026

More Information:
https://think.taylorandfrancis.com/special_issues/ijpr-production-planning/


We encourage researchers and practitioners to submit their latest work
and contribute to advancing knowledge in this critical area.

Special Issue Editors:
- Mirco Peron, NEOMA Business School, France

- Ibrahim Kucukkoc, Balikesir University, Turkey

- Daniel Rossit, Universidad Nacional del Sur, Argentina

- Ilkyeong Moon, Seoul National University, South Korea

- Olga Battaïa, KEDGE Business School, France

- Michael Pinedo, Stern School of Business, New York University, USA

We look forward to your valuable contributions.

Best regards,
GUEST EDITORS


**********************************************************
*
* 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] Stream “Moments in the History of OR and IFORS” at the 24th Conference of the International Federation of Operational Research Societies

*** APOLOGIES FOR CROSS POSTING ***

We invite you to the Stream "Moments in the History of OR and IFORS" at the 24th Conference of the International Federation of Operational Research Societies 12-17 July 2026, Vienna, Austria (https://ifors2026.at/).

We welcome contributions related to all aspects of OR history.

In the past, this stream hosted talks such as:

* "The life and contribution of William Sealy Gosset: Student's t-test brewed at Guinness" (G. Rand);
* "Computational Science in the 18th Century Test Cases for the methods of Newton, Raphson and Halley: 1685 to 1745" (T. Steihaug).
* "The origin of the Branch-and-Bound Method" (J. Leung)
* "The life and work of Harry M Markowitz" (J. Fogg)

We also regularly host talks related to history of national and international OR Societies, e.g. "75 years of the world's first OR journal" (G. Rand).

If you intend to participate, please upload an abstract of maximum 1500 characters, including spaces, to the EURO Conference submission platform (https://www.euro-online.org/conf/ifors2026) using Session Codes:

428e924e - "Moments in the History (and Future) of OR"

If you have any other questions, please do not hesitate to get in touch.

Stream Co-Organisers: Roberto (roberto.rossi@ed.ac.uk ) and Willi (gerhard-wilhelm.weber@put.poznan.pl ).

The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.

**********************************************************
*
* 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] DSB 2026: 2nd Call for Abstracts and Participation

Dear All,

The 12th edition of the 2-days workshop "Data Structures in
Bioinformatics" (DSB) will take place in Venice (Italy) on February
18-19th, 2026: https://dsb-meeting.github.io/DSB2026/

The workshop "Data Structures in Bioinformatics" is an annual scientific
meeting at the crossroads of computer science and biology. It is
a unique forum to discuss compact data structures and algorithms in the
context of data processing for the life sciences. Topics include string
algorithms and combinatorics, data structures, algorithms for
genome/pangenome/metagenome/transcriptome/... analysis.
More details on DSB at https://dsb-meeting.github.io/

**REGISTRATION** HERE: https://forms.gle/V9yrUXYvAsTPpq6J7
Registrations will be open until January 31st, 2026.

**ABSTRACT SUBMISSION** HERE: https://forms.gle/baHkDCZW1Lvx1xZT6
Submissions of abstracts for an oral presentation are open until January
2nd, 2026.

DSB 2026 is organized by the RAVEN
<https://raven-laboratory.github.io/> (Research
on Algorithms VENice) research group at Ca' Foscari University of Venice.

Looking forward to seeing you in Venice!
The DSB 2026 organizing team

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

Tuesday, December 9, 2025

[DMANET] The IEEE co-sponsored 2nd International Conference on Emerging and Intelligent Technologies and Systems (EITS 2026), 9-12 June, 2026 | Valencia, Spain

[Apologies if you got multiple copies of this invitation]

The 2nd International Conference on Emerging and Intelligent Technologies
and Systems (EITS 2026)

Hybrid Event

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

9-12 June, 2026 | Valencia, Spain

Technically Co-Sponsored by IEEE Spain Section

*AIS 2026 CFP:*

Emerging and intelligent technologies and systems represent the forefront
of innovation in computing, communication, and automation. They combine
advances in artificial intelligence, machine learning, the Internet of
Things (IoT), cloud and edge computing, 5G/6G networks, robotics, and data
science to create adaptive, efficient, and human-centered solutions. These
technologies are transforming industries such as healthcare,
transportation, energy, and smart cities by enabling intelligent
decision-making, real-time responsiveness, and sustainable development. As
they continue to evolve, emerging and intelligent systems are shaping the
foundation of next-generation digital societies, offering both
opportunities and challenges in terms of security, ethics, and large-scale
deployment.

The International Conference on Emerging and Intelligent Technologies and
Systems (EITS 2026) will bring together leading researchers, practitioners,
and industry experts to present and discuss the latest advances,
applications, and challenges in intelligent technologies and
next-generation systems. EITS 2026 serves as a premier forum for
innovation, cross-disciplinary collaboration, and knowledge exchange across
academia and industry. We invite the submission of high-quality, original
research papers describing innovative ideas, breakthrough results, and
practical applications. with special interest in, but not limited to, the
following:

· Artificial Intelligence, Machine Learning and Generative AI

· Intelligent Communication, Networking and Computing Systems

· Generative AI, Foundation Models, and Large Language Models

· Computer Vision, Image and Video Processing

· Cybersecurity and Trustworthy Systems

· Artificial Intelligence Systems Security

· Computational Language and Human-Centered Systems

· Emerging Applications, Ethics, Society, and Governance

· Robotics, Intelligent Automation and Sustainable Systems

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the EITS Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers must follow the IEEE paper format. And include up to 7 keywords.
Authors of accepted papers are expected to present their work at the
conference. Submitted papers that are deemed of good quality but that could
not be accepted as regular papers will be accepted as short papers. Length
of short papers can be up to 6 pages.

*Important Dates:*

- *Paper submission deadline: February 20th, 2026*
- Notification of acceptance: April 15th, 2026
- Camera-ready Submission: May 5th, 2026

*Contact:*

Please send any inquiry on AIS to: info@gaclm.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/
*
**********************************************************

[DMANET] [CFW] Euro-Par 2026 - 32nd International European Conference on Parallel and Distributed Computing

--Apologies for multiple postings. Share this CFW with anyone you believe may be interested. --

____________________________________________________________________________

CALL FOR WORKSHOPS AND MINISYMPOSIA:
Euro-Par 2026
32nd International European Conference on Parallel and Distributed Computing
24-28 August, 2026, Pisa, Italy
[https://2026.euro-par.org]
____________________________________________________________________________

Euro-Par is the premier European forum for all aspects of parallel and distributed computing.
Building on more than three decades of success, the conference offers a vibrant week of
scientific exchange spanning the full spectrum of the field: from foundational algorithms to
end-to-end applications, from low-power edge devices to exascale and cloud-to-edge computing,
from architectural breakthroughs and compiler innovations to emerging programming models,
performance engineering, reproducibility, and sustainability. Its well-established topic structure
fosters deep technical dialogue while enabling cross-fertilization among researchers,
practitioners, and students across Europe and beyond.
Euro-Par 2026 will host co-located workshops and minisymposia on 24–25 August 2026,
the first two days of the conference. We invite proposals for both formats.

SUBMISSION (for workshop and minisymposium organisers)
========================================================================
Workshop and minisymposium proposals should be sent in PDF format via email
to the workshop co-chairs (contact details at the end of this call).
Workshop co-chairs will confirm receipt by email of each submission received.
If you do not receive the confirmation email, please contact the workshop
co-chairs. All details on how to prepare your workshop/minisymposium proposal
can be found at the following address [https://2026.euro-par.org/calls/workshops].

IMPORTANT DATES (for workshop and minisymposium organisers)
========================================================================
- Proposals due: 6 February 2026 (AoE)
- Notifications: 27 February 2026
- Workshop website online & Call for Workshop Papers: 13 March 2026
- Workshop & minisymposium dates: 24-25 August 2026
- Workshop & minisymposium management report due: 15 September 2026

WORKSHOP CO-CHAIRS
========================================================================
- Biagio Cosenza, University of Salerno, Italy - bcosenza-AT-unisa.it
- Demetris Zeinalipour, University of Cyprus, Cyprus - dzeina-AT-ucy.ac.cy
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD position in algorithms at SDU Odense

The Department of Mathematics and Computer Science (IMADA) at the
University of Southern Denmark (SDU), Odense, invites applications for a
PhD position in algorithms. The deadline is January 25th, 2026.

The position has a duration of 3 years. The proposed starting time is
spring 2026, with some room for flexibility. The appointment will be made
at a competitive salary and will follow the PhD study program at the
Faculty of Science.

This position is embedded in the project "PARAMLP: Parameterized Algorithms
and Polyhedra" funded by the ERC. The ERC is the premier European funding
organization dedicated to frontier research of the highest quality. The aim
of the project is to make significant advances in the theory of algorithms,
specifically on parameterized algorithms and approximation algorithms,
using linear programming methods. Over the next years, the project will
grow to a collaborative team of 4-5 PhD students and Postdocs.

A strong proficiency in mathematical formalism, demonstrated for example in
a theoretical thesis, and interest in the topics of the project is
required. Prior experience on the specific topics is not required, but a
plus. Fluency in English is required, whereas knowledge of Danish is not.

The successful candidate will work directly with the project's principal
investigator, Associate Professor Lars Rohwedder, see
https://larsrohwedder.com/ for more information. The team is part of a
larger algorithms section at IMADA, see also algorithms.sdu.dk.

For further information and questions on the positions, please contact Lars
Rohwedder (rohwedder@imada.sdu.dk).

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/3451?utm_medium=jobshare

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

Monday, December 8, 2025

[DMANET] Post-Doctoral Position at University of Konstanz

The Chair for Software and Systems Engineering (Prof. Stefan Leue) of
the University of Konstanz (Germany) has the opening of a full-time

*Post-Doctoral Position* (reference no. 2025/245).

The position is available immediately. The start date is no later than
June 1st, 2026. The position is initially available for up to two years
with the
possibility of extension. Exceptional PhD candidates may also be
considered if they are at an advanced stage of their doctoral studies.

The successful candidate is expected to contribute to the goals of the
DFG-funded research project "SCADNet". In this context, research
contributions in at least two of the areas formal verification, formal
guarantees for Deep Neural Networks, models of causality, automated
repair of real-time systems, system safety, formal techniques in legal
tech, and generally formal methods and verification are of great interest.

The working language is English. Proficiency in German is not a
prerequisite.

Renumeration is according to the TV-L labor agreement in the EG 13
payscale, amounting to at least € 57.000,00 p.a.

Application deadline: January 6, 2026.

For the official job ad and access to the online application portal (at
the bottom of the page) please see

https://stellen.uni-konstanz.de/jobposting/64107b4a4fa3e9f11fa7cf4ccb6f9e7b6086f5260
.

I will be glad to answer further questions and look forward to receiving
your application (exclusively via the online application portal) for
this exciting research opportunity!

Stefan Leue

--
Prof. Dr. Stefan Leue

Chair for Software and Systems Engineering
Department of Computer and Information Science
University of Konstanz, Box 67
D-78457 Konstanz, Germany

Office: PZ902

Phone: +49 (0)7531 88 2893, ~4631 (secretary)
Home: +49 (0)7533 949 2182
Email:Stefan.Leue@uni-konstanz.de
WWW:http://sen.uni-konstanz.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/
*
**********************************************************

[DMANET] PhD and Postdoc positions in theoretical computer science, algebra, and logic (Barto, Bodirsky, Pinsker)

The ERC Synergy Grant POCOCOP (Polynomial-time computation: opening the black boxes in constraint problems) is offering several postdoc and PhD positions at TU Wien and TU Dresden. The goal of the project is to systematically explore polynomial-time tractability in the field of constraint satisfaction and its extensions, in particular promise CSPs, valued CSPs, and CSPs over infinite domains. The project is jointly led by three principal investigators: Manuel Bodirsky (TU Dresden), Michael Pinsker (TU Vienna), and Libor Barto (Charles University, Prague). The project website is https://pococop.eu/

We are looking for highly motivated and creative candidates and in particular encourage female researchers to apply. The applicants should have a strong background in at least one of the following fields: theoretical computer science, universal algebra, or model theory. For the PhD positions the requirements are a Master's degree or equivalent in mathematics or computer science. For the Postdoc positions the requirements are a PhD or equivalent in mathematics or computer science. Successful candidates will be based at TU Wien or TU Dresden, but collaborate with the other two groups intensively.

For full consideration, we encourage applicants to express their interest by the 31st of December 2025. The duration of the positions will be up to 3 years. The positions come with a very good salary, are fully funded from the ERC grant and carry no teaching load; however, if desired participation in teaching might be arranged. There is sufficient funding for conference and research exchange trips.

Applicants should send a motivation letter, CV, a statement of research experience and interests, and a list of publications (if applicable) in a single PDF file to jobs@pococop.eu. The application may also include a short annotation of at most three of their best papers; in the case of the PhD positions, a copy of the Master's thesis should be included. Applicants should moreover arrange for at least two recommendation letters to be sent directly to the same email address. Informal inquiries are very welcome.

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

Abstract of POCOCOP:

The class P of polynomial-time computable computational problems is the most important and robust complexity class for the study of efficient computation. Answering what problems belong to P will lead to groundbreaking applications in science and modern society where computation is omnipresent. Moreover, P is a relatively recent mathematical object and radically different from classical notions studied for centuries; thus, capturing it promises the discovery of new fundamental theorems in mathematics.

Our current understanding of P is limited; for instance, the P=NP millennium problem is wide open. There neither exists a uniform reduction technique, nor a single algorithmic scheme capturing the power of P, nor a description of P in purely logical terms. We intend to provide these in a context which is so rich and vast that it requires the unification of some of the most important techniques, and will enhance our general understanding of P.

Within the microcosm of finite-domain constraint satisfaction problems (CSPs), the recent resolution of the Feder-Vardi conjecture by Bulatov and by Zhuk provides a satisfactory picture of P. Our goal is a vast and uniform generalisation of this result in three directions: towards approximation via Promise CSPs, towards optimisation via Valued CSPs, and towards infinite domains via omega-categorical CSPs and CSPs over numeric domains. In particular, our setting includes the linear programming problem as a numeric Valued CSP, the approximate graph coloring problem as a Promise CSP, and many problems from qualitative reasoning as infinite-domain CSPs. Our methods range from universal algebra, model theory, Ramsey theory, to complexity theory. Building on cross-connections between these extensions, we will provide a uniform description of P within this diverse and applicable universe, thus making a revolutionary leap in the resolution of the general problem.


**********************************************************
*
* 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] dmanet@zpr.uni-koeln.de

We apologize if you receive multiple copies of this CFPs.

We appreciate your help to contribute & forward this CFPs to your friends.

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

Call for Papers

The Fourth International Workshop on Data Driven and AI-Enabled

Digital Twin Networks and Applications (TwinNetApp)

in conjunction with IEEE ICC 2026

May 24-28, 2026 – Glasgow, Scotland, UK

Workshop Website: https://icc26-twinnetapp.bcrg.uk/

Conference Website: https://icc2026.ieee-icc.org/

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

Digital Twin (DT) technology has emerged as a critical enabler for
next-generation communication networks. Regarding this, DTs provide
real-time synchronization between physical and digital systems and support
advanced monitoring, emulation, and optimization capabilities. By bridging
the physical and virtual domains, DTs provide novel approaches to design,
analyze, and operate complex infrastructures that go far beyond traditional
simulation methods. Real-time network monitoring, predictive modelling,
proactive management, and what-if simulation are significant examples that
highlight DT's potential in the communication domain and beyond. When
combined with next-generation mobile communications (5G/6G), Artificial
Intelligence (AI), Generative AI (GenAI), Internet of Things (IoT),
Transfer Learning (TL), Augmented Reality (AR), Virtual Reality (VR),
Edge/Fog Computing, federated architectures, and microservice-based
platforms, DT becomes a foundation to guarantee latency-sensitive,
energy-efficient, and secure services. These synergies create opportunities
for sustainable and scalable solutions in diverse sectors, from smart
cities and agriculture to healthcare, manufacturing, and autonomous
systems. This workshop invites original contributions that address all
aspects of DT networks, systems, and applications, including theoretical
models, system architectures, optimization methods, security mechanisms,
and real-world testbeds. By bringing together academia, industry, and
standardization bodies, the workshop aims to establish a cross-disciplinary
forum to explore the transformative role of DT in shaping sustainable,
intelligent, and connected communication infrastructures. Topics of
interest include, but are not limited to:

• Data-driven and IoT-based DT networks for real-time communication
systems

• Real-time communication protocols for DT networks

• DT-enabled health applications

• Wireless communications for cyber-physical DT applications

• Security and privacy concepts in DT

• Quantum-enabled DT networks

• DT-assisted AI applications for smart cities

• Communication protocols for enabling DT deployment in real-world
applications

• AI applications of DT systems

• DT in Edge/Fog/Cloud Computing

• DT for enhanced Mobile Broadband (eMBB), massive Machine Type
Communications (mMTC), and Ultra Reliable Low Latency Communications
(URLLC) applications

• DT for resource management and network optimization

• Connected DT networking systems for environmental sensing

• DT for precision agriculture, and industry 4.0 applications

• Real-world DT simulations, prototypes, and testbed demonstrations

General Chairs

• Kubra Duran, Edinburgh Napier University, UK (K.Duran@napier.ac.uk)
(IEEE Member)

• Berk Canberk, Edinburgh Napier University, UK (B.Canberk@napier.ac.uk)
(IEEE Senior Member)

• Octavia Dobre, Memorial University, Canada (odobre@mun.ca) (IEEE
Fellow)

Important Dates

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

Paper Submission Deadline: January 18, 2026

Notification of Acceptance: March 8, 2026

Camera Ready: March 15, 2026

Submission

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

The page length limit for all initial submissions for review is SIX (6)
printed pages (10-point font) and must be written in English. Initial
submissions longer than SIX (6) pages will be rejected without review.

Submission Link: TBA

**********************************************************
*
* 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 – Submissions are open

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 submission website: https://fun2026-submission.limos.fr/
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] [Scheduling seminar] Laurent Houssin (ENAC, Université de Toulouse) | December 10 | Flow-shop and job-shop robust scheduling problems with budgeted uncertainty

Dear scheduling researcher,

We are delighted to announce the talk given by Laurent Houssin (ENAC,
Université de Toulouse). The title is "Flow-shop and job-shop robust
scheduling problems with budgeted uncertainty". The seminar will take
place on Zoom on Wednesday, December 10 at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/96120750687?pwd=mlAd3lUX8ZBccOYIIzHASMMHaYOkF3.1
Meeting ID: 961 2075 0687
Passcode: 793270

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 different solution methods for two two-stage robust,
multi-machine scheduling problems under uncertainty budget. Compact
formulations of the problems are proposed and two decomposition
approaches are presented: a logic Benders decomposition approach and a
column and constraint generation approach. Computational experiments
show that for small-sized instances, a compact formulation of the
problem quickly yields optimal solutions. However, for larger instances,
decomposition methods, particularly the column and constraint generation
method with a master problem solved using constraint programming,
provide better quality solutions. An acceleration method for the column
and constraint generation algorithm is proposed. This method is generic
and can be applied to any two-stage robust optimisation problem.

The next talk in our series will be in January 2026.
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/
*
**********************************************************

Sunday, December 7, 2025

[DMANET] SAND 2026 - Second Call for Papers

======================================
SAND 2026: Second Call for Papers
======================================

The 5th Symposium on Algorithmic Foundations of Dynamic Networks
July 1-3, 2026
Le Havre, France
https://litis.univ-lehavre.fr/sand2026/

======================================
Dates
======================================

Abstract registration: February 18, 2026, 23:59 AoE
Full paper submission: February 24, 2026, 23:59 AoE
Notification: April 22, 2026
Camera-ready version: May 2, 2026
Conference: July 1-3, 2026

======================================
Scope
======================================

The Symposium on Algorithmic Foundations of Dynamic Networks is a primary venue for original research on the fundamental aspects of computing in dynamic networks and dynamic computational processes. Broadly, the conference and its community aim to improve understanding of the role of dynamics in computing. We seek high-quality contributions related to this aim from all viewpoints, including theory, design, analysis, and applications, and welcome both conceptual and technical contributions, as well as novel ideas and new problems.

Topics of interest include, but are not limited to:

- Bio-inspired, physical, and chemical dynamic models
- Boolean networks
- Complex systems, financial, social, and transportation networks
- Computability and complexity within dynamic networks
- Continuous models of dynamic networks
- Distributed computation in dynamic networks
- Dynamic graph algorithms
- Dynamically reconfigurable networks and graph reconfiguration
- Dynamics of games, puzzles, and gadget systems
- Fault tolerance, network self-organization, and formation
- Geometric dynamic models
- Information spreading, gossiping, and epidemics
- IoT, cloud, edge, and fog computing
- Learning approaches for dynamic networks
- Multilayer, peer-to-peer, and overlay networks
- New models for dynamic networks
- Offline and online algorithms for dynamic networks
- Population protocols and chemical reaction networks
- Randomness in dynamic networks
- Reconfigurable and swarm robotics, programmable matter, and DNA self-assembly
- Streaming models
- Temporal data and dynamic network analysis
- Temporal graphs
- Wireless networks, mobile computing, and autonomous agents

======================================
Paper Submission
======================================

Papers should be submitted electronically through Easychair
(https://easychair.org/conferences/?conf=sand2026).

Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (https://submission.dagstuhl.de/series/details/5#author) with

\documentclass[a4paper,anonymous,USenglish]{lipics-v2021}.

Submissions must be anonymous, without any author names, affiliations, or email addresses.

SAND accepts two types of submissions: regular papers and brief announcements.

A regular paper submission must be original research and report on novel results that have not appeared or been concurrently submitted to a journal or a conference with published proceedings. Every regular paper submission must be at most *15 pages*, excluding references, plus an (optional) appendix. The main part of the submission (i.e. the *15 pages*) should contain a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. There is no guarantee that the reviewers will read the (optional) appendix; this will only be read at the discretion of the Program Committee. The appendix can contain missing proofs from the main text, or it can just be the full version of the paper, this decision is left to the authors.

A brief announcement submission may report on preliminary work or work presented elsewhere. The title of a brief announcement submission should begin with "Brief Announcement: ". Papers submitted as brief announcements should include presentation of their merits within *5 pages* plus at most 1 extra page of references, plus an (optional) appendix (as described above).

The program committee may decide that some of the regular papers not selected for publication are suitable for publication in the brief announcement format. The authors of any such paper will be asked to prepare a brief announcement final version out of their original regular submission. By default, every regular paper submission will be considered as a potential brief announcement, if it is not accepted as a regular paper. Any authors who *do not* wish their regular paper submission to be considered for the brief announcement format in case of rejection, are asked to clearly indicate this on the first page of their submission, for example by adding above or below the title "NOT eligible for brief announcement".

======================================
Instructions for Double-Blind Review
======================================

The reviewing process is double-blind, the authors' names must not be included in the paper, and the writing of the manuscript should be done in such a way to not de-anonymize authors (e.g., instead of, our result [1], they should use, the result of [1]). We assume that reviewers do not actively try to recognize the authors. Therefore, authors are allowed to publish their results on pre-print services before or at any point of the submission/reviewing process. Non-anonymous submissions will be rejected.

======================================
Publication
======================================

The conference proceedings will be published by LIPIcs. The final version of the paper must be formatted following the LIPIcs guidelines (https://submission.dagstuhl.de/documentation/authors). Papers accepted in full will have 15 pages in the final proceedings (excluding references). Any papers accepted in the brief announcement format will have 5 pages in the final proceedings plus at most 1 extra page of references.

Extended and revised versions of selected papers will be considered for a special issue of a journal.

For every accepted regular paper and brief announcement, at least one of the authors must fully register and present the paper during the conference and according to the conference program. Any paper accepted but not presented will be withdrawn from the final proceedings.

======================================
Awards
======================================

All regular papers are eligible for the best paper award. Regular papers co-authored by at least one full-time student may also be eligible for the best student paper award. For a paper to be considered for the best student paper award, at least one author who is a full-time student at the time of submission should have made a significant contribution to the paper. In case the authors think that their paper is eligible for the best student paper award, they should clearly indicate this on the first page of their submission, for example by adding above or below the title "Eligible for the best student paper award".

======================================
Organization
======================================

Program Chairs:
- George Mertzios, Durham University, UK
- Andrea Richa, Arizona State University, USA

Program Committee:
- Duncan Adamson, University of St Andrews, UK
- James Aspnes, Yale University, USA
- John Augustine, IIT Madras, India
- Luca Becchetti, Sapienza University of Rome, Italy
- Petra Berenbrink, University of Hamburg, Germany
- Arnaud Casteigts, University of Geneva, Switzerland
- Bernard Chazelle, Princeton University, USA
- Shantanu Das, LIS, Aix-Marseille University, France
- Joshua Daymude, Arizona State University, USA
- Giuseppe Antonio Di Luna, Sapienza University of Rome, Italy
- David Doty, University of California, Davis, USA
- Yuval Emek, Technion Institute of Technology, Israel
- Thomas Erlebach, Durham University, UK
- Javier Esparza, Technical University of Munich, Germany
- George Giakkoupis, INRIA, France
- Olga Goussevskaia, Federal University of Minas Gerais, Brazil
- Giuseppe Italiano, Luiss University, Rome, Italy
- Bart de Keijzer, King's College University of London, UK
- Othon Michail, University of Liverpool, UK
- Nils Morawietz, University of Bordeaux, France
- William K. Moses Jr., Durham University, UK
- Thomas Nowak, ENS Paris-Saclay, France
- Fukuhito Ooshita, Fukui University of Technology, Japan
- Matthew Patitz, University of Arkansas, USA
- Maria Potop-Butucaru, LIP6, Sorbonne University, France
- Rajmohan Rajaraman, Northeastern University, USA
- Dana Randall, Georgia Institute of Technology, USA
- Christian Scheideler, Paderborn University, Germany
- Ana Silva, Federal University of Ceará, Brazil
- Paul Spirakis, University of Liverpool, UK
- Yukiko Yamauchi, Kyushu University, Japan
- Isabella Ziccardi, IRIF, Paris Cité University, France

Organizing Committee:

- Stefan Balev, University of Le Havre Normandy, France
- Julien Baudry, University of Le Havre Normandy, France
- Antoine Dutot, University of Le Havre Normandy, France
- Frederic Guinand, University of Le Havre Normandy, France
- Antoine Huchet, University of Le Havre Normandy, France
- Théo Morel, University of Le Havre Normandy, France
- Yoann Pigné, University of Le Havre Normandy, France
- Eric Sanlaville, University of Le Havre Normandy, France (chair)
- Antoine Toullalan, University of Le Havre Normandy, France

Steering Committee:

- Othon Michail, University of Liverpool, UK (SC chair)
- Arnaud Casteigts, University of Geneva, Switzerland (SC vice chair)
- George Mertzios, Durham University, UK (PC chair 2026)
- Andrea Richa, Arizona State University, USA (PC chair 2026)
- Kitty Meeks, University of Glasgow, UK (PC chair 2025)
- Christian Scheideler, Paderborn University, Germany (PC chair 2025)
- Eric Sanlaville, University of Le Havre Normandy (General chair 2026)

Advisory Board:

- James Aspnes, Yale University, USA
- Luca Becchetti, University of Rome Sapienza, Italy
- Arnaud Casteigts, University of Geneva, Switzerland
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy
- Paola Flocchini, University of Ottawa, Canada
- George Mertzios, Durham University, UK
- Othon Michail, University of Liverpool, UK
- Rotem Oshman, Tel Aviv University, Israel
- Nicola Santoro, Carleton University, Canada
- Paul Spirakis, University of Liverpool, UK
- Viktor Zamaraev, University of Liverpool, UK

--

Andrea W. Richa

President's Professor

School of Computing and Augmented Intelligence (SCAI)

BSS@Biodesign Institute and Barrett Honors Faculty

Arizona State University

699 S Mill Ave #440, Tempe AZ 85281

https://sops.engineering.asu.edu

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

Saturday, December 6, 2025

[DMANET] Conference "MOG2026: Mathematics of Networks with Physical Transport", 20-21 May 2026 in Nuremberg

We are pleased to announce the fifth edition of the international conference

"MOG2026: Mathematics of Networks with Physical Transport"

on May 20–21, 2026, in Nuremberg, Germany.

This two-day conference will bring together experts in applied
mathematics to discuss the latest developments in mathematical modeling,
simulation, and optimization in networks involving physical transport.
We aim to foster stimulating discussions between academic researchers
and industry professionals on current challenges in energy systems,
logistics, transportation, and related fields.

In addition, all participants are invited to contribute to the
conference by presenting their work at the poster session.

For more information and registration (by March 31, 2026), please visit:
https://www.trr154.fau.de/mog2026/

Invited speakers:
- Wim van Ackooij (EDF R&D)
- Daniela Bernhard (FAU Erlangen-Nürnberg)
- Lorenz Biegler (CMU Pittsburgh)
- Christoph Buchheim (TU Dortmund)
- Line Roald (University of Wisconsin-Madison)
- Lavinia Ghilardi (Politecnico Milano)
- Nicole Marheineke (University of Trier)
- Nicola De Nitti (Università di Pisa)

The conference is organized by the German Collaborative Research Center
TRR 154 (Mathematical Modeling, Simulation, and Optimization using the
Example of Gas Networks), funded by the German Research Foundation
(DFG). For more details, please visit: https://www.trr154.fau.de/trr-154-en/

Nuremberg, a vibrant city with a rich history and culture, provides an
inspiring setting for scientific exchange. Located in the heart of
Bavaria, it combines a picturesque old town with modern infrastructure
and is easily accessible by train and air.

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

Friday, December 5, 2025

[DMANET] Master's and PhDs in Discrete Mathematics at University of Victoria

The Discrete Mathematics Group at the University of Victoria in Canada welcomes applications from candidates interested in pursuing research at the Master's or PhD level starting in September 2026. We have a weekly research seminar and offer graduate level courses on a wide range of topics in discrete math and related topics. Our research areas include a wide range of topics in combinatorics, discrete mathematics, graph theory and algorithms.

* Richard Brewster, adjunct, rbrewster@uvic.ca: graph algorithms, homomorphisms, coverings and packings
* James Currie, adjunct, j.currie@uwinnipeg.ca: combinatorics on words, formal languages
* Peter Dukes, dukes@uvic.ca: designs, codes, hypergraphs, combinatorial matrix theory
* Jing Huang, huangj@uvic.ca: structural and algorithmic aspects of graph theory
* Melissa Huggan, adjunct, Melissa.Huggan@viu.ca: combinatorial game theory, pursuit-evasion game theory
* Lucas Mol, adjunct, lmol@tru.ca: combinatorics on words, formal languages
* Natasha Morrison, nmorrison@uvic.ca: extremal and probabilistic combinatorics
* Jonathan Noel, noelj@uvic.ca: extremal combinatorics with connections to analysis, optimization, probability, statistical physics and computer science

The application deadline is February 1, 2026. Interested students are strongly encouraged to submit their application earlier and to contact potential supervisors before applying.

For more information:
* https://www.uvic.ca/science/math-statistics/future-students/graduate/index.php
* https://www.uvic.ca/graduate/admissions/how-to-apply/index.php
* https://www.uvic.ca/science/math-statistics/home/home/events/seminars/discrete-math/index.php
* https://www.uvic.ca/science/math-statistics/research/home/discrete-math/index.php
* https://www.uvic.ca/science/math-statistics/assets/docs/graduate/graduate-student-handbook-2025-26.pdf
**********************************************************
*
* 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] ICALP 2026 Call for Papers

Call for Papers - ICALP 2026
July 6-10 2026, Royal Holloway, University of London, UK
https://icalppodcspaa2026.cs.rhul.ac.uk/icalp/

ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2026 will be hosted at Royal Holloway, University of London, in co-location with PODC and SPAA conferences, along with associated workshops.

For submission Guidelines: see https://icalppodcspaa2026.cs.rhul.ac.uk/icalp/

Important Dates
Abstract registration deadline: February 3, 2026, AoE
Submission deadline: February 6, 2026, AoE
Track B rebuttal period: March 21 - 24, 2026
(For Track A, authors will be contacted only if there are correctness issues)
Author notification: April 20, 2026

Topics: ICALP 2026 will have the two traditional tracks: Track A (Algorithms, Complexity and Games) and Track B (Automata, Logic, Semantics and Theory of Programming).

Chairs

Local chair:
Matthew Hague (Royal Holloway, University of London)

PC Track A co-chairs:
Sayan Bhattacharya (University of Warwick)
Danupon Nanogkai (Max Planck Institute for Informatics)

PC Track B chair:
Michael Benedikt (University of Oxford)

**********************************************************
*
* 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 Journal of Combinatorial Optimization -SI ECCO

Call for Papers Journal of Combinatorial Optimization

Special Issue: Recent applications, models and algorithms in
Combinatorial Optimization

This special issue will present recent advances and challenges in all
areas of Combinatorial Optimization. The issue will be based on
contributions presented at the  ECCO XXXVIII Conference, May 8-10, 2025,
but invitation to submit is extended to all  ECCO and CO members.

Deadline for submission: January 15, 2026

Main areas / topics of interest are (but not restricted to):
• Graphs and networks
• Mathematical programming
• Routing and scheduling
• Facility location
• Bioinformatics
• Exact methods
• Approximation algorithms
• Heuristics
• Metaheuristics
• Matheuristics

All articles will be thoroughly refereed according to the high standard
of the Journal of Combinatorial Optimization.

Full papers must be submitted through the Springer Editorial System 
https://www.editorialmanager.com/joco/

Please see the Author Instructions on the site if you have not yet
submitted a paper through this web-based system. Be sure to note that
your work is intended for the Special Issue and to select the article
type SI: ECCO 2025.

Accepted papers will be published online individually, before print
publication.  We look forward to receiving your contribution.

The Guest Editors,

Silvano Martello
El-Ghazali Talbi

--

***********************************************************************
OLA'2026
10th International Conference on Optimization and Learning (SCOPUS, Springer)
April 28-30, 2026, Creta, Greece, https://ola2026.sciencesconf.org
***********************************************************************

Prof. El-ghazali TALBI
Polytech'Lille, University Lille - INRIA
CRISTAL - CNRS

**********************************************************
*
* 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] WINE 2025: The 21st Conference on Web and Internet Economics

[cid:image003.png@01DC65CC.70E34AB0]

WINE 2025: The 21st Conference on Web and Internet Economics
December 8 - 11, 2025
Rutgers University Inn and Conference Center, Rutgers University, New Brunswick, NJ


General Chairs:
Arpita Biswas, Rutgers University
Kangning Wang, Rutgers University

Local Organizers:
Shahrzad Haddadan, Rutgers University
David Pennock, DIMACS
Arunesh Sinha, Rutgers University
Xintong Wang, Rutgers University
Lirong Xia, DIMACS

Presented in association with the DIMACS SF on Mechanisms & Algorithms to Augment Human Decision Making<http://dimacs.rutgers.edu/programs/sf/mechanisms>.
*********************************************************************
Conference Announcement:

The Conference on Web and Internet Economics (WINE, originally known as the Workshop on Internet & Network Economics until 2013) is an interdisciplinary platform for exchanging ideas and findings on incentives and computation from these varied fields. The WINE conference has been held annually since its inception in 2005, and WINE 2025 (https://wine2025.cs.rutgers.edu/) will carry on this tradition, taking place on December 8 - 11, 2025, in New Brunswick, USA, and hosted by Rutgers University and the DIMACS Center. WINE 2025 will be an in-person event.

Reminder: The conference begins Monday, December 8, 2025.

For full details about the conference and registration, please visit the WINE 2025 primary webpage<https://wine2025.cs.rutgers.edu/>.

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


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

[DMANET] PhD position: Cryptography and privacy in Datascience at Edinburgh

Dear All,

We are looking for PhD students in security and privacy in data science and machine learning.

Students interested in Differential privacy, Zero knowledge proofs, multi party computation, private machine learning, decentralized learning etc are suitable for the position.

See more details at: https://homepages.inf.ed.ac.uk/rsarkar/positions.html

Early application deadline is on 11th December, so please get in touch soon by emailing rsarkar@inf.ed.ac.uk<mailto:rsarkar@inf.ed.ac.uk>

Rik




Rik Sarkar

Associate Professor, School of Informatics
The University of Edinburgh
10 Crichton street, IF 3.45
Edinburgh EH8 9AB
rsarkar@inf.ed.ac.uk
http://homepages.inf.ed.ac.uk/rsarkar/


The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.
**********************************************************
*
* 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] Stream “OR for Development” at IFORS 2026, Vienna, Austria, 12-17 July 2026

The 24th Conference of the International Federation of Operational Research Societies: Decision Support for a Sustainable World

12-17 July 2026, Vienna, Austria

[ https://www.euro-online.org/conf/ifors2026/streams | Stream "OR for Development" ]


Dear colleague,

We welcome you to the 24th Conference of the International Federation of Operational Research Societies, 12-17 July 2026, in Vienna, Austria.

The EURO Working Group on Operational Research for Development ( [ http://bit.ly/EWG-ORD | EWG ORD ] ) invites submissions to the IFORS 2026 stream on OR for Development. To submit to a particular session, click on the link embedded in the session name. We welcome theoretical, conceptual, and empirical contributions that apply operational research to social, economic, and environmental challenges in any region. Work that advances decision-making, governance, or resilience in developing economies and vulnerable communities is especially encouraged. More on our work in OR for Development see: https://bit.ly/EWGORD_Promo .

Session Name

Session chair(s):

Code


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=3 | Sustainable and Generative AI in SCM for Emerging Economies ]

[ https://www.euro-online.org/conf/admin/userinfo.php?username=kamdem | Bruno Kamdem ] ( kamdemb@farmingdale.edu )

[ https://www.euro-online.org/conf/admin/userinfo.php?username=Sadia | Sadia Samar Ali ] ( sadiasamarali@gmail.com )

32ad9f3a


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=4 | Advancing Online and Offline Learning in Developing Countries ]

[ mailto:Fatima%20Ezzahra%20Achamrah | Fatima Ezzahra Achamrah ] ( acha.f.ezzahra@gmail.com )

[ https://www.euro-online.org/conf/admin/userinfo.php?username=milagros_baldemor | Milagros Baldemor ] ( milagros_baldemor@yahoo.com.ph )

e1e52e43


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=5 | OR and Health Informatics for Sustainable Societal Development ]

Helper Zhou (helperzhou@gmail.com)


[ https://www.euro-online.org/conf/admin/userinfo.php?username=ghdash | Gordon Dash ] ( ghdash@uri.edu )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=gweber | Gerhard-Wilhelm Weber ] ( gerhard-wilhelm.weber@put.poznan.pl )

0354fc65


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=262 | Climate and Development Economies ]

[ https://www.euro-online.org/conf/admin/userinfo.php?username=ghdash | Gordon Dash ] ( ghdash@uri.edu )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=ninakajiji | Nina Kajiji ] ( nina@nkd-group.com )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=gweber | Gerhard-Wilhelm Weber ] ( gerhard-wilhelm.weber@put.poznan.pl )

a6871884


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=261 | Community OR ]

Helper Zhou (helperzhou@gmail.com)


[ mailto:Gordon%20Dash | Gordon Dash ] ( ghdash@uri.edu )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=gweber | Gerhard-Wilhelm Weber ] ( gerhard-wilhelm.weber@put.poznan.pl )

8ed74792


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=67 | Advancing Circular Economy and Urban Sustainability in Developing Countries: The Role of OR ]

[ https://www.euro-online.org/conf/admin/userinfo.php?username=sadiye2018 | Sadiye Eylul Sadanoglu ] ( ss3395q@gre.ac.uk )

[ https://www.euro-online.org/conf/admin/userinfo.php?username=ninakajiji | Nina Kajiji ] ( nina@nkd-group.com )

5612b6e9


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=7 | OR for Societal Development ]

[ https://www.euro-online.org/conf/admin/userinfo.php?username=eadelrosario | Elise del Rosario ] ( elise@jgdelrosario.com )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=milagros_baldemor | Milagros Baldemor ] ( milagros_baldemor@yahoo.com.ph )


[ https://www.euro-online.org/conf/admin/userinfo.php?username=Jinal_13 | Jinal Parikh ] ( jinal.parikh@ahduni.edu.in )

9b88b8ba


[ https://www.euro-online.org/conf/ifors2026/edit_session_cluster?sessid=163 | Digital twins and Industry 5.0: Building Resilience ]

[ https://www.euro-online.org/conf/admin/userinfo.php?username=Sadia | Sadia Samar Ali ] ( sadiasamarali@gmail.com )

Helper Zhou (helperzhou@gmail.com)

5c7b6005


[ https://www.euro-online.org/conf/ifors2026/streams | Stream organizer(s): ]

Gordon Dash ( ghdash@uri.edu )

Nina Kajiji ( nina@nkd-group.com )

Gerhard-Wilhelm Weber ( gerhard-wilhelm.weber@put.poznan.pl )


The link to the Abstract Submission System is https://www.ifors2026.at/home/

You may submit an abstract in one of your preferred organized sessions by inserting the corresponding Session Code and then putting in your abstract (max. 1500 characters).

[ https://www.ifors2026.at/home/ | Important dates & general information ]

1 December 2025 - Opening of abstract submissions

15 March 2026 - Deadline for abstract submissions

25 April 2026 - Early bird registration deadline

25 April 2026 - Final registration deadline for authors


**********************************************************
*
* 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, December 4, 2025

[DMANET] PhD position in Discrete Mathematics

A full time PhD position is available at the Discrete Mathematics and
Optimization group (
https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/applied-mathematics/discrete-mathematics-optimization)
of the Applied Mathematics department (DIAM) at TU Delft. The intended
starting date is September 2026.

The PhD will be supervised by Anurag Bishnoi and it is a part of the NWO
Vidi project ``Extremal Problems in Finite Geometry". There is also a
two-year postdoc position under the same project.

You should hold a master's degree (or equivalent) in Mathematics or
Computer Science, with a solid foundation in Combinatorics, especially
algebraic and probabilistic methods. Some familiarity with Finite Geometry
will be advantageous, but it is not necessary.

For more information and application link see:
https://careers.tudelft.nl/job/Delft-PhD-Position-Discrete-Mathematics-Extremal-Problems-in-Finite-Geometry-2628-CD/1333394457/

Qualified candidates are invited to apply via the application button in the
link above. Please include at least two references in your CV.

Informal enquiries related to the project and the position are encouraged
and may be directed to Anurag Bishnoi at A.Bishnoi@tudelft.nl.

The deadline for the application is *February 1, 2026*.
--
Anurag Bishnoi
http://anuragbishnoi.wordpress.com/

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

[DMANET] Postdoc in Quantum Computing at LaBRI (France)

Dear colleagues,

Several postdoctoral positions are available in the Quantum Information and
Computation group (https://quantique.labri.fr/members/) at the CS
department of the University of Bordeaux (France). Applications should be
submitted by **January 23** for full consideration.

We are seeking candidates with an interest in research on quantum
information, quantum algorithms, and quantum simulations, complexity
theory. Specific topics they can expect to work on include:
* Quantum Algorithms and Computational Speedups (optimization and Monte
Carlo methods, combinatorial algorithms, distributed algorithms, quantum
walks, quantum simulation)
* Information and Complexity Theory (query complexity, entanglement
measures, simulation of quantum circuits, quantum graphs)
* Error-Correction and Mitigation (properties of QECC, theoretically and
practically good quantum codes, error mitigation strategies)
* Quantum Computing and Fundamental Physics (simulation of fermionic
systems, quantum field theory, holographic complexity, Krylov complexity)

Candidates should have training or experience in at least one of the
following areas: quantum information and computation, algorithmic theory,
or complexity theory.

The recruited candidates are expected to start in Fall 2026 (or earlier).
The positions are for a duration of 24 months, with a net income ranging
between 2100€ and 2500€, depending on the candidate's experience. The
position includes French social security coverage and employee benefits
(health insurance, public transport expenses, paid leave, etc.). We welcome
applicants from all backgrounds and promote a friendly, safe, and
supportive team environment.

Interested applicants should contact Yassine Hamoudi (
yassine.hamoudi@labri.fr) with the following materials: a CV (including a
list of publications), a brief cover letter or research statement, and the
names and email addresses of one or two referees.

**********************************************************
*
* 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 special issue in Journal of Combinatorial Optimization

Dear colleagues,

Please find enclosed a special issue in the journal of Combinatorial
Optimization related to "Recent applications, models and algorithms in
Combinatorial Optimization"

Regards

--

***********************************************************************
OLA'2026
10th International Conference on Optimization and Learning (SCOPUS, Springer)
April 28-30, 2026, Creta, Greece, https://ola2026.sciencesconf.org
***********************************************************************

Prof. El-ghazali TALBI
Polytech'Lille, University Lille - INRIA
CRISTAL - CNRS

**********************************************************
*
* 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] Job: Researcher Position (3 years) at Ruhr University Bochum - Collective Algorithmic Recourse

The research group Lernende technische Systeme (LTS) at the Faculty of
Electrical
Engineering and Information Technology, Ruhr University Bochum, is seeking a

Research Associate (postdoc or PhD student)

for a three-year full-time position (TV-L 13 Germany Pay Grade) starting at
the earliest possible date.

The successful candidate will work on robust and efficient collective
algorithmic
recourse methods to enhance the resilience of mission-critical networked
systems.

The position is part of the DFG Priority Programme (SPP), which offers
excellent
opportunities for scientific exchange and collaboration.

Application deadline: 15 December 2025

To apply, please send your application materials to: setareh.maghsudi@rub.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/
*
**********************************************************

[DMANET] SMARTCOMP 2026: Call for Research Papers

Call for Research Papers

SMARTCOMP 2026, the 12th edition of the premier conference on smart computing, will be held in Messina, Italy from 22nd to 25th June 2026.

Smart computing is a multidisciplinary domain enabled by advances in sensor-based technologies, Internet of Things, cyber-physical systems, edge computing, big data analytics, machine learning, cognitive computing, ambient intelligence, and artificial intelligence.

Applications of smart computing can be found in diverse societal domains, including transportation, energy, environmental protection, smart and connected communities, healthcare, industrial systems, precision farming, and entertainment. Algorithmic and systems advancements in edge, fog, or cloud computing, mobile and pervasive computing, sensor networking, and social computing are accelerating such innovation while expanding its influence in everyday ways of living.

SMARTCOMP 2026 welcomes novel, cutting-edge and creative research contributions. Authors should discuss the importance, timeliness, and significance of their work as well as limitations, implications, future opportunities and open research directions.

Main Research Track

SMARTCOMP 2026 solicits papers that address the core challenges of smart computing, focusing on the design and development of scalable, dependable systems, and on leveraging computing technologies to enhance resource sustainability and enhance sustainable quality of human life.

Topics of interest include - but are not limited- to the following:

* Emerging Smart Computing Paradigms
* Algorithms for Smart Computing
* AI and Machine Learning in Smart Computing
* Mobile and Ubiquitous Smart Systems, Wearable Computing and IoT
* Intelligent Cyber-Physical Systems
* Cloud, Edge, and Fog based Smart Computing Platforms
* Data Engineering and Analytics for Smart Computing
* Distributed Sensing, AI, and Computation
* Middleware for Smart Systems
* Novel Communication Paradigms in Smart Computing
* Low Power Communication and Computing for Smart Systems
* Social Computing and Smart Systems
* Quantum Computing in Smart Systems
* Security, Privacy, and Trust in Smart Computing
* Fairness and Socio-technical Aspects of Smart Computing
* Interdisciplinary Approaches to Smart Computing
* Novel applications of Smart Computing in emerging and high potential fields (e.g. Smart Communities, Health, Industry, Transport, Energy, Space, Agrifood, ...)

Important Dates

Paper Submission: 1st February 2026

Acceptance Notification: 15th April 2026

Camera Ready (tentative): 22th April 2026

Conference: 22 to 25 June 2026

All deadlines are Anywhere on Earth.

Submission Guidelines

Paper submissions must be no longer than 8 pages including references and formatted using the two-column IEEE proceedings template. All submitted papers following these requirements will be peer reviewed by the Technical Program Committee. All presented papers will be published in the conference proceedings and submitted to the IEEEXplore Digital Library.

The conference will be in-person and no virtual or remote presentations will be permitted.

Accepted papers must be presented in person by one of the authors under full registration. Failure to meet this requirement will result in the exclusion of the paper from the final proceedings, the conference program, and the IEEE Digital Library.

Authors of accepted papers are responsible to obtain an Italian visa, if required, in a timely manner so as to meet the above expectations.

The conference applies a single-blind review process.

Submit your paper here<https://smartcomp2026research.edas.info/newPaper.php?c=34461>.

https://smartcomp2026research.edas.info/newPaper.php?c=34461

Paper registration opens on November 1st, 2025

One additional page for the camera-ready version can be purchased after the paper review and selection.

________________________________

BEST PAPER AWARD and Editorial Follow-Ups

The authors of the best paper will receive an award in recognition to their contribution to the field.

Extended versions of selected high-quality papers accepted to the main conference will be considered for publication in Elsevier's Pervasive and Mobile Computing journal (IF: 3.5)<https://www.sciencedirect.com/journal/pervasive-and-mobile-computing>

Technical Program Committee Co-Chairs

Daniela Nicklas

George Roussos

Contact Information

For any questions about the conference, please contact the TPC Co-Chairs at: smartcomp26-tpc-chairs.mobi@uni-bamberg.de<mailto:smartcomp26-tpc-chairs.mobi@uni-bamberg.de>


Thanks & Regards,
Debasree Das

----

Debasree Das
Research Assistant
Chair of Mobile Systems
University of Bamberg
Webpage: https://debasree08.github.io/debasree/
An der Webrei 5
96047 Bamberg
Room: WE5/05.131


**********************************************************
*
* 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 Workshop Proposals: IEEE SMARTCOMP 2026

==============================================================
Call for Workshop Proposals: IEEE SMARTCOMP 2026
==============================================================
**** Proposal Submission Deadline: Wednesday, 10 December 2025 ****


The organising committee of the IEEE International Conference on Smart Computing (SMARTCOMP) 2026 invites proposals for workshops to be held in conjunction with the main conference in Messina, Italy, on June 22nd, 2026. IEEE SMARTCOMP is the premier forum for exploring cutting-edge research, innovation, and applications in the rapidly evolving domain of smart computing, encompassing advancements in sensor-based technologies, IoT, cyber-physical systems, edge and cloud computing, big data, machine learning, and AI.

The workshops at IEEE SMARTCOMP 2026 aim to encourage researchers, practitioners, and industry experts to exchange ideas, discuss emerging trends, and explore novel approaches within the field of smart computing.

The Workshops co-chairs of IEEE SMARTCOMP 2026 invite proposals for half or full day (22nd June 2026) workshops affiliated with the conference. Workshops should provide opportunities for deep dives into focused areas, promote lively interactions, and stimulate collaborative research in both emerging and established topics.

Submission Guidelines

Each workshop proposal must include the following:

1. Workshop Title and Acronym, where applicable.
2. Organisers (Workshops may have up to three organisers. It is strongly recommended that organisers belong to at least two different institutions):
1. Names
2. Affiliations
3. Short bios of up to 200 words for each organizer
3. A brief description (up to 2 pages) including:
1. Research and technological issues to be covered in the workshop;
2. Justification for organising the workshop in SMARTCOMP 2026;
3. A short discussion on the distinguishing features of this workshop compared to other available workshops and conferences;
4. A description of the research groups the workshop aims to attract;
5. Names of potential Program Committee members;
6. A tentative format of the workshop (e.g., keynotes, paper presentations) and duration (e.g., one-day, half-day), and a strategy to facilitate lively discussions and involvement of the attendees;
7. If applicable, a description of past versions of the workshop, including dates, organisers, number of submitted and accepted papers, and number of attendees;
8. An estimate of the expected number of submissions and likely attendees if this is the first time such a workshop proposal is submitted to IEEE SMARTCOMP.
9. A tentative Call for Papers (as complete as possible);
10. A description of the plans for publicity and workshop Website.

Submission Method

Workshop proposals should be submitted in PDF format by email with the subject line ÒIEEE SMARTCOMP 2026 Workshop ProposalÓ to the Workshop Co-Chairs: Dirk Pesch (dirk.pesch@ucc.ie<mailto:dirk.pesch@ucc.ie>) and Francesca Righetti (francesca.righetti@unipi.it<mailto:francesca.righetti@unipi.it>), no later than Wednesday, 10 December 2025. More details on IEEE SMARTCOMP 2026 can be found at our home page here.
Important Dates

Workshop Proposal Submission Deadline: Wednesday, 10 December 2025

Notification of Acceptance: Wednesday, 17 December 2025

Workshop Paper Submission Deadline: likely towards the end of March 2026

Workshop Date: Monday, 22nd June 2026

Publication

Each accepted paper will require a full SMARTCOMP registration (workshops only registrations will not be available) and in-person presentation. All accepted papers presented in the workshop will be published in the proceedings of the conference and published in the IEEE Xplore Digital Library and Scopus indexed. Papers that are not presented at the workshop will not be published in the proceedings.


Thanks & Regards,
Debasree Das

----

Debasree Das
Research Assistant
Chair of Mobile Systems
University of Bamberg
Webpage: https://debasree08.github.io/debasree/
An der Webrei 5
96047 Bamberg
Room: WE5/05.131


**********************************************************
*
* 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 Submissions, special session: Matheuristics at LION20

LION20, https://www.lion20.org/, the 20th Learning and Intelligent OptimizatioN Conference, welcomes submissions to the special session on matheuristics.
Matheuristics — methods that leverage mathematical programming in heuristic contexts — have emerged as a powerful approach for solving complex optimization problems across a broad range of domains. As learning techniques and optimization models converge, new opportunities arise for approaches that combine solution quality, robustness, and scalability.
This special session brings together researchers and practitioners from operations research, machine learning, and artificial intelligence to discuss advancements, challenges, and applications of matheuristics in the era of data-driven decision-making. We invite contributions that either advance matheuristic methodologies or demonstrate their impact in practical settings, with the aim of bridging mathematical rigor and heuristic flexibility.
Topics of interest include novel hybrid designs, learning-enhanced matheuristics, decomposition and surrogate-based strategies, benchmarking studies and applications in logistics, energy, finance, and other domains.

Types of Submissions
When submitting a paper to LION 20, authors are required to select one of the following three types of papers:
Long paper: original novel and unpublished work (12- 15 pages in LNCS format);
Short paper: an extended abstract of novel work (6-11 pages in LNCS format);
Abstract: for oral presentation only (maximum 1000 words in LNCS format).
You can submit original and unpublished work either as a long paper (12-15 pages, including references) or short paper (6-11 pages, including references). You can choose to add an appendix.

Paper Format
Please prepare your paper in English using the Lecture Notes in Computer Science (LNCS) template, which is available [ Here ]. Papers must be submitted in PDF.

Submission System
All papers must be submitted using OpenReview (link coming soon)
All abstracts (for presentation only) must be submitted using OpenReview (link coming soon)

Review Process
Please note that the review process for LION 20 is single blind. The special session will be part of the regular conference and submissions are subject to the same peer review as all others.

Important dates
Full (long and short) paper: Feb 1, 2026
Author notification: April 1, 2026
Abstract submission (for presentation only): March 1 - April 8, 2026
Abstract notification: April 15, 2026
Registration opens: March 31, 2026
Early registration deadline: April 23, 2026
Late registration deadline: May 20, 2026
Camera-ready papers: May 15, 2026
Conference at Milan, Italy, June 15–19, 2026

--

________________________________________________________________
Vittorio Maniezzo, prof.
Department of Computer Science University of Bologna
vittorio.maniezzo@unibo.it<mailto:vittorio.maniezzo@unibo.it> || via dell'Università n. 50
orcid: 0000-0002-1220-1235 || 47521 Cesena, Italy
https://www.unibo.it/sitoweb/vittorio.maniezzo/en

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