Theory Announcements: 2025

Friday, December 12, 2025

[DMANET] 1st Call for Papers of QEST+FORMAT 2026

=======================================
1st Call for Papers of QEST+FORMAT 2026
September 2-4, 2026, Liverpool, UK
https://www.qest-formats.org/
https://confest-2026.github.io/

=======================================
Tentative Dates:

Abstract submission: April 3, 2026
Paper submission: April 10, 2026
Artifact submission: April 17, 2026
Author notification: May 24, 2026
Camera-ready submission: June 14, 2026

=======================================
Scope and Topics

The two flagship conferences QEST (International Conference on Quantitative
Evaluation of SysTems) and FORMATS (International Conference on Formal
Modeling and Analysis of Timed Systems) are pursuing a strategic process of
joining forces and sparking a new joint conference for quantitative
modelling, analysis, and verification. This culminated in 2024 in the first
QEST+FORMATS joint conference. In 2026, the two conferences will form the
third QEST+FORMATS joint conference, which will be held on 2-4 September
2026 in Liverpool, UK, as part of the CONFEST 2026 umbrella conference.

The joint conference is the leading forum for the quantitative evaluation
and verification of systems. QEST+FORMATS aims to promote the study of
fundamental and practical aspects of systems with quantitative nature (such
as probability, timing, and cost). It aims to bring together researchers
from different disciplines who share interests in the modelling, design,
and analysis of computational systems. Systems of interest include
biological and chemical systems; computer networks; critical
infrastructures; cyber-physical systems; data-driven AI systems; energy
systems; hardware and software systems; industrial systems; mobility
networks; and quantum systems. The QEST+FORMATS joint conference also aims
to attract researchers interested in real-time issues in hardware design,
performance analysis, real-time software, scheduling, semantics and
verification of timed, hybrid, and probabilistic systems. In general, the
conference aims to attract experts in quantitative and timed systems from
any domain.

Topics and scientific areas of interest include:

--- Models and metrics for the correctness, performance, reliability,
safety, and security of systems (stochastic, probabilistic, quantum, and
non-deterministic models including Markov chains, automata, Petri nets,
process algebra, and their variations);
--- Languages and methods for the specification of quantitative properties
of systems;
--- Techniques, algorithms, and data structures for the analysis,
evaluation, and verification of the above models, e.g., for model checking,
testing, constraint solving, scheduling, optimization, and worst-case
execution time analysis;
--- Quantitative and probabilistic aspects of programming;
--- Data-driven and machine-learning techniques for the analysis,
prediction, and verification of quantitative properties of systems;
--- Case studies that highlight the role of quantitative specification,
modelling, and evaluation in the design and analysis of systems, with
emphasis on emerging problems and technologies, or novel domains;
--- Software tools to support the practical application of research results
in all of the above areas.

=======================================
Confirmed Invited Speakers

Ezio Bartocci, TU Wien, Austria
Kim Guldstrand Larsen, Aalborg University, Denmark

=======================================
Submissions

QEST+FORMATS 2026 considers three types of submissions (authors will be
able to specify the type of contribution upon submission):

--- Research papers: Theoretical and methodological contributions that
advance the understanding of a topic or issue, or describe the development
of new analysis processes and techniques.
--- Case study papers: Contributions that present practical applications of
quantitative methods to challenging real-world case studies. Case study
papers shall provide detailed evaluation and insights, and highlight the
value added to the domain experts.
--- Tool papers: Contributions introducing new tools or significant
improvements of existing ones, and the formalisms they support. These
papers shall focus on the software architecture, practical implementation,
and evaluation (e.g., usability, scalability, and effectiveness). Tool
papers must be accompanied by an artifact in the Artifact Evaluation as
detailed below.

All three types of papers can be regular or short:
--- Regular papers must not exceed 16 pages, excluding references.
--- Short papers should be limited to 7 pages, also excluding references.
--- All papers can have an appendix containing supporting material. Note
that reviewers are not required to read the appendix to fully assess the
merits of the paper.

We are considering additional presentation-only submission types; details
will be provided in the later CfPs.

All papers must be submitted in Springer's LNCS format and will undergo a
rigorous single-blind review process. All submitted papers must be
unpublished and not be submitted for publication elsewhere. Papers should
be submitted electronically using EasyChair (Track: QEST+FORMATS 2026).

Springer encourages authors to include their ORCIDs in their papers.
Authors should consult Springer's authors' guidelines and use Springer's
LaTeX templates for the preparation of their papers. Submitted papers not
complying with the above guidelines may be rejected without undergoing
review.

We are considering awards for best papers and best artifacts.

=======================================
Publications

All accepted papers need to be presented and discussed at the conference by
one of the authors. Similarly to last year, the QEST+FORMATS 2026
proceedings will be published in the Springer LNCS series indexed by ISI
Web of Science, Scopus, ACM Digital Library, DBLP, Google Scholar. All
submitted papers will be evaluated by at least three reviewers on the basis
of their originality, technical quality, scientific or practical
contribution to the state of the art, methodology, clarity, and adequacy of
references.

=======================================
Special Issue

We are working on a special issue in a Q1 journal. A selection of the best
papers will be invited to submit an extended version of their work to a
special issue in an internationally recognized journal.

=======================================
Artifact Evaluation

Reproducibility of experimental results is crucial to foster an atmosphere
of trustworthy, open, and reusable research. To improve and reward
reproducibility, QEST+FORMATS 2026 will include a dedicated Artifact
Evaluation (AE). Submission of an artifact is mandatory for tool papers
(both regular and short), and optional but encouraged for research and case
study papers where it can support the results presented in the paper. More
details will follow.

**********************************************************
*
* 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 11, 2025

[DMANET] SAT 2026 Call for Papers.

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

FINAL CALL FOR PAPERS

Twenty-Ningth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2026 ---

Lisbon, Portugal, 20 - 23 July 2026

https://satisfiability.org/SAT26/

Abstract submission deadline: 20 February 2026, 23:59 AoE
Paper submission deadline: 27 February 2026, 23:59 AoE

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

SAT 2026 will take place 20-23 July, 2026 in Lisbon, Portugal at ISCTE, as part of FLoC 2026 <https://www.floc2026.org/>.

Scope

SAT is the premier annual meeting for researchers focusing on the theory and applications of propositional satisfiability, broadly construed. That includes Boolean optimization, such as MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), model counting, and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Topics of interest include (but are not limited to):
- Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues)
- Practical search algorithms
- Knowledge compilation
- Implementation-level details of SAT solving tools and SAT-based systems
- Problem encodings and reformulations
- Applications (including both novel applications domains and improvements to existing approaches)
- Case studies and reports on insightful findings based on rigorous experimentation

Out of Scope

Papers claiming to resolve a major long-standing open theoretical question in Mathematics or Computer Science (such as those for which a Millennium Prize is offered), are outside the scope of the conference because there is insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal.

Paper Categories

Submissions to SAT 2026 are invited in the following three categories:

- Long papers (9 to 15 pages, excluding references and appendices)
- Short papers (up to 8 pages, excluding references and appendices)
- Tool papers (up to 8 pages, excluding references and appendices)

Long and short papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementation available with the submission. Submissions on applications and case studies are encouraged. Such papers should describe details, weaknesses and strengths of the proposed approaches in sufficient depth, but they are not expected to introduce novel solving methods.

Long and short papers will be evaluated with the same quality standards, and are expected to contain a similar contribution per page ratio. The authors should choose between a long or a short paper depending on the space they need to fully describe their contribution. The classification between long and short papers impacts the duration of the presentation of the work during the conference. It is the responsibility of the authors to make sure that their paper is self-contained in the chosen limit of pages. Reviewers are not required to read appendices. There will be no re-classification of the submissions by the PC.

Tool papers are expected to report on the design and implementation of a tool and its novel features. Here "tool" is interpreted in a broad sense, including descriptions of solvers, preprocessors, etc., as well as systems that exploit SAT solvers or their extensions for use in a relevant problem domain. It is expected that a tool paper is accompanied by a publicly available artifact with a usage description or manual. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool.

Submission

Submissions should not be under review elsewhere nor be submitted elsewhere while under review for SAT 2026, and should not consist of previously published material. Submissions not consistent with these guidelines may be returned without review.

Papers must be formatted in the LIPIcs LaTeX style available here <https://www.dagstuhl.de/en/publishing/series/details/LIPIcs%23author>. Submissions must be made electronically <https://submissions.floc26.org/sat/> in PDF format. The reviewing process for SAT 2026 is single-blind.

Authors may submit a supplement containing detailed proofs, examples, software, detailed experimental data, or other material related to the submission, to be consulted at the discretion of the reviewers. Supplements will be treated with the same degree of confidentiality as the paper itself. The supplement must consist of a single file in one of the following formats: zipped tarball (.tar.gz or .tgz), gzipped file (.gz), or zip archive (.zip).

One author of each accepted paper is expected to present it at the conference.

Deadlines

- Abstract Submission: 20 February, 2026 (AoE)
- Paper Submission: 27 February, 2026 (AoE)
- Rebuttal: 13-17 April, 2026
- Author Notification: 30 April, 2026
- Camera-ready Version: 14 May, 2026
- Conference: 20-23 July, 2026

Best Paper Awards

Long and short papers may be considered for a Best Paper Award. If the main author is a student, both in terms of work and writing, the paper may be considered for a Best Student Paper Award.

Proceedings

Accepted papers will be published as proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) <https://www.dagstuhl.de/en/publications/lipics/> as a free, open, electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be published under a CC-BY license <https://creativecommons.org/licenses/by/3.0>.

Contact

For questions, please contact the PC Chairs at sat2026@ac.tuwien.ac.at <mailto:sat2026@ac.tuwien.ac.at>.

[DMANET] Save the Date - CGT2026

Dear colleagues,

I am happy to announce that the

16th Day on Computational Game Theory (CGT)

will take place on

March 5 - 6, 2026 at Heinrich-Heine University in Düsseldorf,
Germany.

CGT is a yearly event for researchers in algorithmic game theory, social
choice and mechanism design to connect, share their work and ideas. The
location of this even alternates between Germany and the Netherlands.
Especially young researchers are encouraged to present their work.

Invited Speakers are Thomas Kesselheim and Rebecca Reifenhäuser.

More details will be announced shortly. If you have any questions about
the event, feel free to contact Andreas Abels at andreas.abels@hhu.de.

I hope to see you at CGT 2026!

Best regards,

Andreas Abels

[DMANET] WG 2026: Second 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
. We welcome your submissions.

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] EURO Doctoral Dissertation Award 2026

Apologies for cross-posting.

EURO Doctoral Dissertation Award 2026

The purpose of the prize is to distinguish an outstanding doctoral
dissertation in OR defended in the countries having an OR society that is a
member of EURO.
We invite you to widely disseminate this announcement.

THE PRIZE

The prize consists of a certificate and reward of €1,000

CALL FOR APPLICATIONS

The EDDA jury will only consider dissertations in Operational Research
defended between 1 January 2025 and 31 December 2025. The dissertation must
have been defended in a University located in a member country of EURO. The
author of the dissertation must be a member of a member society of EURO.

To be considered, a dissertation should be nominated by the supervisor of
the thesis (one of them in case of multiple supervisors). The supervisor of
the dissertation is asked to provide the jury with the following
information:

*The text of the dissertation;
*An extended abstract (3 to 5 pages) of the dissertation; this abstract
should be written in English and should include precise keywords;
*An itemization of the candidate's contribution to each co-authored article
if the dissertation contains co-authored articles (i.e., published papers
or unpublished manuscripts);
*If the dissertation is not in English, a paper in English which has been
authored or co-authored by the candidate and which describes the core ideas
of the dissertation. This paper should preferably have been published in or
submitted to an international journal;
*Nomination letters (or reports) from two referees selected by the
dissertation supervisor, supporting the submission and stating their
assessment of why the dissertation should win the award;
*An up-to-date CV of the candidate, including a list of publications.

No nomination will be considered without these items. Please also check the
guidelines (https://www.euro-online.org/web/pages/242/guidelines).

Since many doctoral dissertations in OR are defended each year only
outstanding pieces of work are expected to be submitted. The jury would
like to remind supervisors that only high-quality theses might have a
chance of winning the award.

Evaluation Criteria. Submissions will be evaluated based on the originality
and significance of the scientific contribution to Operational Research,
methodological soundness and rigor, relevance and potential impact, clarity
and coherence of presentation, and the extent and independence of the
candidate's individual contribution.

The jury selects a shortlist of finalists who will present their work in a
special session at the IFORS Conference in Vienna. There is no registration
fee for each finalist. EURO will also contribute to the travel and
accommodation expenses. The winner will be determined by the jury at the
end of the special session(s) and will be announced by the chair of the
jury during the closing session of the IFORS 2026 Conference.

Applications should be submitted (as a zip file or equivalent single
submission) online
https://www.euro-online.org/awards/edda2026/registration.php by the
deadline of January 31, 2026.
--
Dr Sarah Fores, FORS
Manager of EURO

<http://goog_1482421387/>
[image: IFORS 2026] <https://ifors2026.at/home/>

Wednesday, December 10, 2025

[DMANET] DCFS 2026: First Call for Papers (Aug. 9-11, Kingston, Canada)

---
DCFS 2026: 27th International Conference on Descriptional Complexity of Formal Systems
Queen's University
Kingston, Ontario, Canada, August 9-11, 2026
---

DCFS 2026 will be held in Kingston, Ontario, Canada, on August 9-11, 2026. The conference is organized jointly by the School of Computing at Queen's University and by the IFIP Working Group 1.02 "Descriptional Complexity".

The conference will be co-located with CIAA 2026 (August 5-8, 2026).

The International Conference on Descriptional Complexity of Formal Systems (DCFS) is an annual international working conference concerning the descriptional complexity of formal systems and structures (and its applications). The website of the conference series is:
https://www.informatik.uni-giessen.de/dcfs/

SUBMISSION GUIDELINES

Submissions to DCFS must not exceed 12 pages (in Springer-Verlag's Lecture Notes style, excluding the bibliography). If the authors believe that more details are essential to substantiate the main claims, they may include a clearly marked appendix, which will be read at the discretion of the program committee. However, if slightly longer submissions are deemed necessary, authors must contact the program committee chairs in advance for approval.

Simultaneous submissions of papers to any other conference with published proceedings or submitting previously published papers is not allowed. Only electronic submissions in the PDF format are accepted. Papers should be submitted electronically through the EasyChair system at this link:

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

The proceedings will be published by Springer-Verlag in the series Lecture Notes in Computer Science.

SPECIAL ISSUE

Extended versions of selected papers from the conference will be invited for consideration in a special issue of International Journal of Foundations of Computer Science (IJFCS).

PRINCIPAL TOPICS

Submissions concerning the descriptional complexity of formal systems and structures (and its applications) are invited for DCFS 2026. Original papers are sought in all aspects of descriptional complexity. Topics include, but are not limited to:

- Automata, grammars, languages and other formal systems; various modes of operations and complexity measures.
- Succinctness of description of objects, state-explosion-like phenomena.
- Circuit complexity of Boolean functions and related measures.
- Size complexity of formal systems.
- Structural complexity of formal systems.
- Trade-offs between computational models and mode of operation.
- Applications of formal systems-- for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages-- and their complexity constraints.
- Co-operating formal systems.
- Size or structural complexity of formal systems for modeling natural languages.
- Complexity aspects related to the combinatorics of words.
- Descriptional complexity in resource-bounded or structure-bounded environments.
- Structural complexity as related to descriptional complexity.
- Frontiers between decidability and undecidability.
- Universality and reversibility.
- Nature-motivated (bio-inspired) architectures and unconventional models of computing.
- Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.

INVITED SPEAKERS

[ To be announced ]

PROGRAM COMMITTEE

- Marie-Pierre Béal (Université Gustave Eiffel, France)
- Cezar Câmpeanu (University of Prince Edward Island, Canada, co-chair)
- Pamela Fleischmann (Christian-Albrechts-Universität zu Kiel, Germany)
- Dora Giammarresi (Università di Roma Tor Vergata, Italy)
- Yo-Sub Han (Yonsei University, South Korea)
- Markus Holzer (Justus-Liebig-Universität Gießen, Germany)
- Galina Jirásková (Slovak Academy of Sciences, Slovakia)
- Stavros Konstantinidis (Saint Mary's University, Canada)
- Martin Kutrib (Justus-Liebig-Universität Gießen, Germany)
- Andreas Malcher (Justus-Liebig-Universität Gießen, Germany)
- Ian McQuillan (University of Saskatchewan, Canada)
- Nelma Moreira (Universidade do Porto, Portugal)
- Luca Prigioniero (Loughborough University, UK, co-chair)
- Rogério Reis (Universidade do Porto, Portugal)
- Kai Salomaa (Queen's University, Canada)
- Shinnosuke Seki (University of Electro-Communications, Japan)
- Taylor J. Smith (St. Francis Xavier University, Canada, co-chair)
- Gyorgy Vaszil (Debreceni Egyetem, Hungary)

ORGANIZING COMMITTEE

- Salimur Choudhury (Queen's University, Canada, chair)

IMPORTANT DATES

- Paper submission deadline: March 13, 2026
- Author notification: April 17, 2026
- Camera-ready deadline: May 1, 2026
- Conference: August 9-11, 2026

CONTACT

- Email: dcfs2026@cs.queensu.ca
- Website: https://research.cs.queensu.ca/dcfs2026/

--
Taylor J. Smith
Assistant Professor
Department of Computer Science
St. Francis Xavier University

**********************************************************
*
* 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] CIAA 2026: First Call for Papers (Aug. 5-8, Kingston, Canada)

---
CIAA 2026: 30th International Conference on Implementation and Application of Automata
Queen's University
Kingston, Ontario, Canada, August 5-8, 2026
---

CIAA 2026 will be held in Kingston, Ontario, Canada, on August 5-8, 2026. The conference is organized by the School of Computing at Queen's University.

The conference will be co-located with DCFS 2026 (August 9-11, 2026).

The International Conference on Implementation and Application of Automata (CIAA) is an annual conference in the field of theoretical computer science. The website of the conference series is:
https://www.informatik.uni-giessen.de/ciaa/

The purpose of CIAA is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures. The conference concerns research on all aspects of implementation and application of automata and related structures, including theoretical aspects.

SUBMISSION GUIDELINES

Submissions to CIAA must not exceed 12 pages (in Springer-Verlag's Lecture Notes style, excluding the bibliography). If the authors believe that more details are essential to substantiate the main claims, they may include a clearly marked appendix, which will be read at the discretion of the program committee. However, if slightly longer submissions are deemed necessary, authors must contact the program committee chairs in advance for approval.

Simultaneous submissions of papers to any other conference with published proceedings or submitting previously published papers is not allowed. Only electronic submissions in the PDF format are accepted. Papers should be submitted electronically through the EasyChair system at this link:

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

The proceedings will be published by Springer-Verlag in the series Lecture Notes in Computer Science.

BEST PAPER AWARD

The Sheng Yu Award will be presented to the author(s) of the paper judged to be the best on the basis of the referee reports.

SPECIAL ISSUE

Extended versions of selected papers from the conference will be invited for consideration in a special issue of Theoretical Computer Science (TCS).

PRINCIPAL TOPICS

We solicit papers on all aspects of implementation and application of automata and related structures, including theoretical aspects, including but not limited to:

- Algorithms on automata
- Automata and logic
- Bioinformatics
- Complexity of automata operations
- Compilers
- Computer-aided verification
- Concurrency
- Data structure design for automata
- Data and image compression
- Design and architecture of automata software
- Digital libraries
- DNA/molecular/membrane computing
- Document engineering
- Editors, environments
- Experimental studies and practical experiences
- Industrial applications
- Natural language processing
- Networking
- New algorithms for manipulating automata
- Object-oriented modeling
- Pattern-matching
- Quantum computing
- Speech and speaker recognition
- Structured and semi-structured documents
- Symbolic manipulation environments for automata
- Teaching
- Text processing
- Techniques for graphical display of automata
- VLSI
- Viruses, related phenomena
- World-wide web

INVITED SPEAKERS

[ To be announced ]

PROGRAM COMMITTEE

- Frédérique Bassino (Université Sorbonne Paris Nord, France)
- Cezar Câmpeanu (University of Prince Edward Island, Canada)
- Pascal Caron (Université de Rouen, France)
- Giuseppa Castiglione (Università di Palermo, Italy)
- Szilárd Fazekas (Akita University, Japan)
- Yo-Sub Han (Yonsei University, South Korea)
- Markus Holzer (Justus-Liebig-Universität Gießen, Germany)
- Galina Jirásková (Slovak Academy of Sciences, Slovakia)
- Jarkko Kari (Turun yliopisto, Finland)
- Stavros Konstantinidis (Saint Mary's University, Canada)
- Martin Kutrib (Justus-Liebig-Universität Gießen, Germany)
- Andreas Malcher (Justus-Liebig-Universität Gießen, Germany)
- Florin Manea (Georg-August-Universität Göttingen, Germany)
- Sabrina Mantaci (Università di Palermo, Italy)
- Brink van der Merwe (Stellenbosch University, South Africa)
- Nelma Moreira (Universidade do Porto, Portugal)
- Cyril Nicaud (Université Gustave Eiffel, France)
- Giovanni Pighizzini (Università di Milano Statale, Italy)
- Luca Prigionero (Loughborough University, UK)
- Rogério Reis (Universidade do Porto, Portugal)
- Kai Salomaa (Queen's University, Canada)
- Shinnosuke Seki (University of Electro-Communications, Japan)
- Taylor J. Smith (St. Francis Xavier University, Canada, chair)
- Mikhail Volkov (Ural Federal University, Russia)
- Hsu-Chun Yen (National Taiwan University, Taiwan)

ORGANIZING COMMITTEE

- Salimur Choudhury (Queen's University, Canada, chair)

IMPORTANT DATES

- Paper submission deadline: March 20, 2026
- Author notification: April 24, 2026
- Camera-ready deadline: May 8, 2026
- Conference: August 5-8, 2026

CONTACT

- Email: ciaa2026@cs.queensu.ca
- Website: https://research.cs.queensu.ca/ciaa2026/

--
Taylor J. Smith
Assistant Professor
Department of Computer Science
St. Francis Xavier University

**********************************************************
*
* 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 Opportunity] Optimization for Sustainable Remanufacturing Supply Chains – LIMOS, UCA

Dear all,

We are pleased to announce a fully funded PhD position at the LIMOS
Laboratory, University of Clermont Auvergne (France), starting around
September 2026, on the topic of Optimization for Sustainable
Remanufacturing Supply Chains.

Project Overview
Remanufacturing plays a crucial role in the circular economy by extending
product lifecycles, reducing waste, and improving resource efficiency. This
PhD position is part of a broader research initiative aimed at optimizing
remanufacturing-oriented reverse supply chains, integrating production
scheduling and inventory-routing decisions in complex, uncertain
environments involving multiple stakeholders (3PLs, retailers,
remanufacturers, etc.).
The PhD will focus on the Remanufacturing and Inventory Routing Problem
with Pickup and Delivery (RIRP-PD), incorporating Corporate Sustainability
Rules (CSR) with a special emphasis on human factors (stress and fatigue at
the plant level) and environmental indicators (CO2 emissions from
transportation).
A key challenge is to balance economic performance, workload, time, and
environmental impact while solving interconnected subproblems, inventory
routing, pickup and delivery, and job shop scheduling.
The project includes:
- Modeling a multi-stage problem involving pickup, job shop scheduling
with resource constraints, and delivery with time windows.
- Developing mathematical models and metaheuristics for sequential and
integrated problem solving.
- Studying multi-period variants, inventory strategies, labor workload
constraints, and CO2 emissions.
- Each major research step is expected to lead to publications in
international conferences and journals.

Candidate Profile
We are looking for a highly motivated PhD candidate with strong analytical
and programming skills.
Required:
- Master's degree in Operations Research, Applied Mathematics, Industrial
Engineering, Computer Science, or related fields;
- Strong programming skills (C++, Python, or Java);
- Knowledge of: Mathematical modeling, especially Mixed Integer
Programming (MIP); Solvers such as CPLEX or Gurobi; Heuristics and
metaheuristics;
Appreciated (not mandatory):
- Experience with exact methods (Branch-and-Bound, Branch-and-Price,
decomposition approaches);
- Interest in sustainability, circular economy, or human-centered systems;
- Familiarity with machine learning for optimization.

Application Documents
- Detailed CV
- Motivation letter
- Academic transcripts (Master's degree or equivalent)
- Optional: recommendation letters

For applications and inquiries, please contact:
- Prof. Philippe Lacomme (philippe.lacomme@uca.fr)
- Prof. Katyanne Farias (katyanne.farias_de_araujo@uca.fr)
- Prof. Flavien Lucas (flavien.lucas@imt-nord-europe.fr)

Best regards,

Katyanne FARIAS
----------------------------------------------
Assistant Professor
Brazil and Portugal Area Coordinator
LIMOS – UMR 6158 CNRS | UCA

[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

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

[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

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

[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

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

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

[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

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

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

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

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.

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

Theory Announcements

Friday, December 12, 2025

[DMANET] 1st Call for Papers of QEST+FORMAT 2026

Thursday, December 11, 2025

[DMANET] SAT 2026 Call for Papers.

[DMANET] Save the Date - CGT2026

[DMANET] WG 2026: Second Call for Papers

[DMANET] EURO Doctoral Dissertation Award 2026

Wednesday, December 10, 2025

[DMANET] DCFS 2026: First Call for Papers (Aug. 9-11, Kingston, Canada)

[DMANET] CIAA 2026: First Call for Papers (Aug. 5-8, Kingston, Canada)

[DMANET] [PhD Opportunity] Optimization for Sustainable Remanufacturing Supply Chains – LIMOS, UCA

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

[DMANET] Stream “Moments in the History of OR and IFORS” at the 24th Conference of the International Federation of Operational Research Societies

[DMANET] DSB 2026: 2nd Call for Abstracts and Participation

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

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

[DMANET] PhD position in algorithms at SDU Odense

Monday, December 8, 2025

[DMANET] Post-Doctoral Position at University of Konstanz

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

[DMANET] dmanet@zpr.uni-koeln.de

[DMANET] FUN 2026 – Submissions are open

[DMANET] [Scheduling seminar] Laurent Houssin (ENAC, Université de Toulouse) | December 10 | Flow-shop and job-shop robust scheduling problems with budgeted uncertainty

Sunday, December 7, 2025

[DMANET] SAND 2026 - Second Call for Papers

Saturday, December 6, 2025

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

Friday, December 5, 2025

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

Mailing Lists

Search This Blog

Blog Archive

Friday, December 12, 2025

Thursday, December 11, 2025

Wednesday, December 10, 2025

Tuesday, December 9, 2025

Monday, December 8, 2025

Sunday, December 7, 2025

Saturday, December 6, 2025

Friday, December 5, 2025

Mailing Lists

Subscribe To

Search This Blog

Blog Archive