Friday, January 23, 2026

[DMANET] Call for Papers – AIROSpringer Series, “Optimization between determinism and uncertainty” – Deadline: February 14, 2026

Dear all,


Submissions are still open for the volume entitled "*Optimization between
determinism and uncertainty*", to be published in the AIRO Springer Series (
https://link.springer.com/series/15947).


This is a Scopus-indexed publication linked to the *10th AIROYoung Workshop
and Ph.D. School* (https://ayw2026.github.io), organized by *AIROYoung* (
https://airoyoung.airo.org), the Young Chapter of the Italian Association
of Operations Research. The volume is primarily aimed at Ph.D. students,
postdoctoral researchers, and young professionals who will participate in
the workshop, but contributions from all interested authors, regardless of
attendance, are also welcome.


Please reply to this email and let us know if you are interested in or plan
to submit a contribution, so we can also evaluate possible deadline
extensions.


*KEY INFORMATION*

Submit your contribution in the form of a short paper of 8-10 pages.

Submission platform: https://meteor.springer.com/10AYW

Submission deadline: February 14, 2026

Guidelines and templates:
https://www.springernature.com/gp/authors/publish-a-book/step-by-step-conference-proceedings


*TOPICS*

Short paper topics include, but are not limited to, the following:

- Mathematical Programming

- Multi-objective Optimization

- Stochastic Programming, Robust and Distributionally Robust Optimization

- Logistics and Supply Chain Management

- Routing and Transportation

- Scheduling and Timetabling

- Decision Support Systems

- Applications in industry and society

- OR teaching


*AWARDS*

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

- *Cargoful Best Paper Award *(https://cargoful.tech/) – Participation
is automatic and limited to authors submitting a paper to the Springer
volume; prize: €300.
- *Springer* *Best Paper Award – *Participation is automatic and limited
to authors submitting a paper to the Springer volume; prize: a €250 voucher
to spend on Springer books.

For any questions, please feel free to contact Alice Raffaele (
alice.raffaele@unipd.it).

Best regards,

The Volume Editors

Martina Doneda, University of Bergamo
Dario Palasgo, University of Padova
Alice Raffaele, University of Padova
Marta L. Tessitore, Roma Tre 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/
*
**********************************************************

Thursday, January 22, 2026

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

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

1. A Novel Higher-Order Numerical Scheme for System of Nonlinear Load
Flow Equations

https://www.mdpi.com/1999-4893/17/2/86

2. What Is a Causal Graph?

https://www.mdpi.com/1999-4893/17/3/93

3. Closest Farthest Widest

https://www.mdpi.com/1999-4893/17/3/95

4. Multi-Objective BiLevel Optimization by Bayesian Optimization

https://www.mdpi.com/1999-4893/17/4/146

5. Prime Number Sieving—A Systematic Review with Performance Analysis

https://www.mdpi.com/1999-4893/17/4/157

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

--

Mr. Musea Wu

Assistant Editor

*News: *

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

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

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

**

*Highly Cited in 2025:*

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

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

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

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

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

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

MDPI Branch Office, Wuhan

No. 688, Jinghan Avenue

Floor 54, Wuhan Hang Lung Plaza Office Tower, Hubei Province, 430030
Wuhan, China

Tel.: +86 27 8780 8658

--

MDPI Algorithms Editorial Office

E-Mail: algorithms@mdpi.com

http://www.mdpi.com/journal/algorithms

https://www.mdpi.com

Data Protection Notes: https://www.mdpi.com/about/data-protection

MDPI's headquarters are located in Basel, Switzerland. More information
is available here: https://www.mdpi.com/about/contact

Disclaimer: The information and files contained in this message are
confidential and intended solely for the use of the individual or entity
to whom they are addressed. If you have received this message in error,
please notify me and delete this message from your system. You may not
copy this message in its entirety or in part, or disclose its contents
to anyone.

**********************************************************
*
* 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] Master's and PhD in Discrete Math at the 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] IFORS 2026 Vehicle Routing Session

The 24th Conference of the International Federation of Operational Research
(IFORS) will be held in Vienna (Austria) on July 12-17, 2026.

https://ifors2026.at/home/

-----------------------------------------------------
We are organizing a session on Vehicle Routing Problems included in the
stream of Combinatorial Optimization. We welcome contributions on
exact and heuristic methods as well as on applications.

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

Abstracts must be written in English and contain no more than 600
characters (no formulas or mathematical notation are allowed). Each
attendee is allowed to present *one* paper at the conference. *Please note
that the submission MUST be done by the person who will present the paper
and will be shown as first author. No change to the first speaker will be
allowed later.*

To submit an abstract for this session please visit:

*https://www.euro-online.org/conf/ifors2026* and use the session number
*f5205fc8*.

In order to submit an abstract, you need to have a EURO account. If you do
not have one you will need to create one.

Submission deadline: March 15, 2026

--
Irene Loiseau
Facultad de Ciencias Exactas y Naturales
Universidad de Buenos Aires

--

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

Wednesday, January 21, 2026

[DMANET] Call for Contributions: [CP@PLDI 2026] 2nd Workshop on Choreographic Programming

Choreographic Programming: Call for Contributions
=================================================

Second International Workshop on Choreographic Programming co-located with PLDI 2026

One-day event, June 16th 2026, Boulder, Colorado, USA

https://pldi26.sigplan.org/home/cp-2026

Important dates
---------------
- Submission deadline: March 22nd, 2026 (AoE)
- Notification to authors: May 3rd, 2026 (AoE)
- Workshop day: June 16th, 2026

Theme and Topics
----------------
Choreographies are coordination plans for concurrent and distributed systems, which define the roles of the involved participants and how they are supposed to work together. In the paradigm of choreographic programming (CP), choreographies are programs that can be compiled to executable implementations.

CP originated primarily in the context of process calculi, with preliminary work done to establish its foundations and experiment with implementations. Recently, several proposals have shown that one can adapt CP to work in synergy with mainstream programming paradigms, such as object-oriented and functional programming. These works substantiate the interest of a growing community of researchers and practitioners in evolving CP into a mature paradigm, able to improve the productivity and reliability of programming concurrent and distributed systems.

The aim of this workshop is to catalyse the community around CP by soliciting contributions in the following topics:
- Theory and models of choreographic programming.
- Design and implementation of choreographic programming languages, encompassing both standalone and library-based implementations.
- Design and implementation of runtime systems for choreographic programming.
- Verification and testing of choreographic programs.
- Type systems for choreographic languages.
- Interactions with software engineering (e.g., software requirements, design, construction, testing, analysis, and maintenance and software development methodologies).
- Fault tolerance and reliability in the context of choreographic programming.
- Synergies and comparisons with adjacent approaches for concurrent and distributed programming (e.g., multitier programming).

Contributions and Evaluation
----------------------------
Contributions can be work in progress, scientific work published or submitted for publication, tutorials, or practical experience reports.

Submissions should be no more than 6 pages excluding bibliography, using the ACM Proceedings format. Templates for Microsoft Word and LaTeX can be found at the SIGPLAN author information page.

Submissions will be evaluated following a lightweight double-blind review process.

For further details, refer to the workshop website and for any further queries, please contact the chairs.


Program Chairs
--------------
Andrew K. Hirsch, University at Buffalo, SUNY, US (akhirsch@buffalo.edu)
Eva Graversen, Tallinn University of Technology, Estonia (eva.graversen@taltech.ee)
Dan Plyukhin, University of Southern Denmark, Denmark (dplyukhin@imada.sdu.dk)

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

[DMANET] Call for Papers: The 8th Games, Agents, and Incentives Workshop (GAIW)@AAMAS 2026

Call for Papers: The 8th Games, Agents, and Incentives Workshop
(GAIW)@AAMAS 2026

Webpage: https://gtep-workshops.github.io/gaiw2026/

-

Submission Deadline: February 4, 2026 (AoE)
-

Acceptance Notification: March 20, 2026
-

Camera Ready: TBD (AoE)
-

Workshop: May 26, 2026

Call for Papers:

We invite submissions to the 8th iteration of the Games, Agents and
Incentives Workshop, co-located with AAMAS 2026 in Paphos, Cyprus,
https://cyprusconferences.org/aamas2026/.

Games, Agents and Incentives is a confederated workshop which focuses on
agents and incentives in AI. In particular, it promotes approaches that
deal with game theory (cooperative and non-cooperative), social choice, and
agent-mediated e-commerce aspects of AI systems. The confederated workshop
merges multiple workshops that have been associated with AAMAS in the past,
which considered different aspects of the general interplay between AI and
economics including CoopMAS, AMEC, and EXPLORE.

Over the past two decades, the focus of agent incentives in decentralised
and centralised AI systems has increased dramatically. These issues come up
when designing preference aggregation mechanisms and markets; computing
equilibria and bidding strategies; facilitating cooperation among agents;
and fairly dividing resources.

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

PAPER SUBMISSION

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

Authors should submit full papers electronically in PDF format at:
https://openreview.net/group?id=ifaamas.org/AAMAS/2026/Workshop/GAIW

Formatting Guidelines: Please format papers according to the AAMAS 2026
format (https://cyprusconferences.org/aamas2026/submission-instructions/).

Paper Length: Papers can be at most 8 pages long in AAMAS format.
Additional pages may be used for references.

Supplemental material can be appended at the end of the paper. However,
reviewers are instructed to make their evaluations based on the main
submission, and are not obligated to consult the supplemental material.

Multiple Submissions: To widen participation and encourage discussion,
there will be no formal publication of workshop proceedings. We will,
however, post the accepted papers online to the benefit of the participants
to the workshop. Therefore, submission of preliminary work and papers to be
submitted or in preparation for submission to other major venues in the
field are encouraged.

Past Submissions: In order to strike a balance between new work and work
that may have been presented, but not widely seen, we ask that if authors
want to submit published work they do so non-anonymously and clearly
indicate when and where the work was published. We will only accept work
which has been published in the last calendar year (e.g., IJCAI 2025,
NeurIPS 2025, AAAI 2025, AAAI 2026 and any conference held strictly after
Jan 1, 2025).

We invite papers on topics of game theory, mechanism design, fair
allocation, computational social choice, and their applications to
multi-agent systems:

-

Agentic AI Systems
-

Algorithmic mechanism design
-

Auctions
-

Behavioral Game Theory
-

Bounded rationality
-

Cooperative Games
-

Computational advertising
-

Computational aspects of equilibria
-

Computational social choice
-

Coalitions, coordination, collective action, and cooperation
-

Economic aspects of security and privacy
-

Economic aspects of distributed and network computing
-

Equilibrium computation
-

Empirical approaches to e-markets
-

Fairness (in ML & elsewhere)
-

Fair Division
-

Incentives in machine learning
-

Information and attention economics
-

Learning in games (e.g., solution concepts and equilibria)
-

Matching and Matching Markets
-

Negotiation
-

Preference aggregation and reasoning
-

Price differentiation and price dynamics
-

Social networks
-

Trading agent design and analysis
-

Uncertainty in AI and economic

Best Presentation Award: The organizing committee of GAIW will be giving
two awards (first-place and runner up) for best paper presentations. The
award criteria include the clarity of presentation, the level of
engagement, the content, and discussion handling.

Inquiries: If you have any questions, direct them to alan.tsang@carleton.ca.

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

IMPORTANT DATES

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

-

Submission Deadline: February 4, 2026 (AoE)
-

Acceptance Notification: March 20, 2026
-

Camera Ready: TBD (AoE)
-

Workshop: May 26, 2026

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

ORGANIZATION

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

Program Chairs

Ben Armstrong, Tulane University

Michael Curry, University of Illinois Chicago

Hadi Hosseini, Penn State University

Nicholas Mattei, Tulane University

Alan Tsang, Carleton University

Tomasz Wąs, University of Oxford


--
*Nicholas Mattei*
Associate Professor, Tulane University
nsmattei@tulane.edu | www.nickmattei.net
Stanley Thomas Hall | 305B
+1 504 247 1416
Department of Computer Science
Tulane University
6823 St Charles Ave
New Orleans, LA 70118

**********************************************************
*
* 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] Young Researchers Conference on Combinatorial Synergies

Dear all,

I am writing to advertise the "Young Researchers Conference on Combinatorial Synergies" that will take place in May 4-8, 2026 at FU Berlin.

The goal of this conference is to bring together early-career researchers working in fields related to the Combinatorial Synergies programme. Mornings will be dedicated to mini-courses and afternoons to research talks contributed by the participants.
We will also have a workshop on the topic of mental well-being in the scope of PhD studies.

Researchers and students from outside the Combinatorial Synergies programme are of course also welcome to join.
The registration deadline is on February 28th, 2026. Registrations may close earlier if capacity is reached before that

The three mini-courses will be given by:

- Alheydis Geiger
- Leonid Monin
- Martin Winter

Titles and abstracts will be announced at a later date.

For more information and registration visit: https://mathconf.eu/yrccs-2026
If you have any questions, don't hesitate to contact us at: yrccs26@lists.fu-berlin.de

We are looking forward to welcoming you at FU Berlin,
The organizers (Matthew Dupraz, Anna Hofer, Leo Mathis)
**********************************************************
*
* 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] ISSAC 2026 - Final Call for Papers

--------------------------------------------------------------------------------------
FINAL CALL FOR PAPERS

ISSAC 2026
International Symposium on Symbolic and Algebraic Computation
July 13th to 17th, 2026
Carl von Ossietzky Universität of Oldenburg, Germany
https://www.issac-conference.org/2026/

--------------------------------------------------------------------------------------
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2026 will be the 51st meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communications, software demonstrations and vendor exhibits with a center-piece of contributed research papers.


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

* Abstract submission deadline: January 30, 2026, 23:59 (anywhere on Earth)
* Paper submission deadline: February 6, 2026, 23:59 (anywhere on Earth)
* First notification of acceptance/rejection: April 17, 2026
* End of rebuttal phase: April 24, 2026
* Final notification after rebuttal phase: May 1, 2026
* Camera-ready copy due: May 8, 2026


Submission Instructions
-----------------------

ISSAC 2026 invites the submission of original research contributions to be considered for publication and presentation at the conference. Papers should not duplicate work published or submitted for consideration elsewhere.

Papers must be in English and should not exceed 8 pages in the ACM two-column style, found at:
http://www.acm.org/publications/proceedings-template
which can be downloaded from:
https://portalparts.acm.org/hippo/latex_templates/acmart-primary.zip

However, two additional pages may be used for bibliographical references, and/or for experimental results (tables, figures), experimental data (e.g. input or output systems for a solver) and computer program code (library code, scripts, worksheets, Makefiles, etc.). The portion of the paper before these two additional pages must be self-contained.

Extended abstracts are not allowed. At least one author of each accepted paper must register for the conference and present the paper.

Submission is via EasyChair, at the website https://easychair.org/my/conference?conf=issac26

The paper review process is described here: https://www.issac-conference.org/2026/review_process.php


ACM Open and Article Processing Charges
---------------------------------------

The ISSAC'26 conference will be organized in cooperation with the ACM, which will publish the articles in the International Conference Proceedings Series (ICPS). Starting from 2026, and similarly to all other ACM publications, all articles will be published Open Access, following the ACM Open model. You may find all relevant information for authors, regarding affiliated institutions and article processing charges (APC) on the page:
https://www.acm.org/publications/icps/author-guidance

In addition, the conference is offering to sponsor the APCs of papers in the case where they are not covered by the institution of any of its authors, or by any existing waiver. In order to avoid any unnecessary over-expenditure for the conference, please consider choosing among the co-authors of your submission a corresponding author from an affiliated institution or benefiting from a waiver, whenever possible.


Topics
------

All areas of computer algebra and symbolic mathematical computation are of interest. These include, but are not limited to:

- Algorithmic aspects:

* Exact and symbolic linear, polynomial and differential algebra
* Symbolic-numeric, homotopy, perturbation and series methods
* Computational algebraic geometry, polynomial and semialgebraic optimization
* Computational group theory and number theory, quantifier elimination and logic
* Computer arithmetic
* Summation, recurrence equations, integration, solution of ODEs & PDEs
* Symbolic methods in other areas of pure and applied mathematics
* AI methods and symbolic computation
* Complexity of algebraic algorithms and algebraic complexity

- Software aspects:

* Design of symbolic computation packages and systems
* Language design and type systems for symbolic computation
* Data representation
* Considerations for modern hardware
* Algorithm implementation and performance tuning
* Mathematical user interfaces
* Use with systems such as digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation

- Application aspects:

* Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact.

- Satellite Workshops/Conferences:

* The organizing committee of ISSAC 2026 invites proposals for Satellite Events aimed at enriching the conference program, attracting a broader audience, and promoting new developments and original research results in all areas of symbolic mathematical computation.

Current Satellite Events:
* Satisfiability Checking and Symbolic Computation Workshop 2026: https://www.sc-square.org/CSA/workshop11.html


Invited Speakers
----------------

Saugata Basu, Purdue University, United States of America
Assia Mahboubi, Inria & Vrije Universiteit Amsterdam, France, Netherlands
Oded Schwartz, The Hebrew University of Jerusalem, Israel
Wadim Zudilin, Radboud Universiteit, Netherlands


Organizing Committee
--------------------

* General Chair: Christoph Koutschan, RICAM, Austrian Academy of Sciences, Austria
* Program Committee Chairs: Alin Bostan, Inria and Sorbonne University, France
Clément Pernet, Grenoble INP - UGA, France
* Local Arrangements Chair: Anne Frühbis-Krüger, Carl von Ossietzky Universität of Oldenburg, Germany
* Treasurer: Florian Hess, Carl von Ossietzky Universität of Oldenburg, Germany
* Publicity Chair: Ali Kemal Uncu, University of Bath, UK
* Tutorial Chair: Arne Storjohann, University of Waterloo, Canada
* Short Communications Chair: Hao Du, Beijing University of Posts and Telecommunications, China
* Software Presentations Chair: Katsusuke Nabeshima, Tokyo University of Science, Japan


Program Committee
-----------------

Alin Bostan Inria and Sorbonne University, France
Christopher Brown US Naval Academy, United States of America
Ruyong Feng Chinese Academy of Sciences, China
Claus Fieker University of Kaiserslautern, Germany
Mark Giesbrecht University of Waterloo, Canada
Martin Helmer Swansea University, United Kingdom
Mioara Joldes CNRS and LAAS, France
Irina Kogan NCSU, United States of America
Diane Maclagan University of Warwick, United Kingdom
Stephen Melczer University of Waterloo, Canada
Fatemeh Mohammadi KU Leuven, Belgium
Clément Pernet Grenoble INP - UGA, France
Veronika Pillwein RISC JKU, Austria
Adrien Poteaux University of Lille, France
Daniel Robertz RWTH Aachen University, Germany
Mahsa Shirmohammadi CNRS and IRIF, France
Gilles Villard CNRS and ENS Lyon, France
John Voight University of Sydney, Australia
Kazuhiro Yokoyama Rikkyo University, Japan
Lihong Zhi Chinese Academy of Sciences, China

---

By submitting your article to an ACM Publication, you are hereby acknowledging that you and your co-authors are subject to all ACM Publications Policies, including ACM's new Publications Policy on Research Involving Human Participants and Subjects. Alleged violations of this policy or any ACM Publications Policy will be investigated by ACM and may result in a full retraction of your paper, in addition to other potential penalties, as per ACM Publications Policy.

Please ensure that you and your co-authors obtain an ORCID ID, so you can complete the publishing process for your accepted paper. ACM has been involved in ORCID from the start and we have recently made a commitment to collect ORCID IDs from all of our published authors. We are committed to improve author discoverability, ensure proper attribution and contribute to ongoing community efforts around name normalization; your ORCID ID will help in these efforts.


**********************************************************
*
* 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] =?Windows-1252?Q?[CFP]_Deadline_Extended:_January_31, _2026_=96_The_4th_In?= ternational Workshop on TwinNetApp in conjunction with IEEE ICC 2026 | Glasgow, Scotland, UK

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 31, 2026
Notification of Acceptance: March 8, 2026
Camera Ready: March 22, 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: https://edas.info/newPaper.php?c=34796


This message and its attachment(s) are intended for the addressee(s) only and should not be read, copied, disclosed, forwarded or relied upon by any person other than the intended addressee(s) without the permission of the sender. If you are not the intended addressee you must not take any action based on this message and its attachment(s) nor must you copy or show them to anyone. Please respond to the sender and ensure that this message and its attachment(s) are deleted.

It is your responsibility to ensure that this message and its attachment(s) are scanned for viruses or other defects. Edinburgh Napier University does not accept liability for any loss or damage which may result from this message or its attachment(s), or for errors or omissions arising after it was sent. Email is not a secure medium. Emails entering Edinburgh Napier University's system are subject to routine monitoring and filtering by Edinburgh Napier University.

Edinburgh Napier University is a registered Scottish charity. Registration number SC018373

BSL users can contact us via contactSCOTLAND-BSL, the on-line British Sign Language interpreting service. Find out more on the contactSCOTLAND website.

**********************************************************
*
* 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] Tenure Track Position Applied Geometry, TU Graz

TU Graz is offering a tenure track position in the field Applied Geometry.
We are looking for highly motivated and qualified researchers in a field
of applied geometry which fits current research at the Institute of
Geometry, and which strengthens and complements this research: e.g. in
geometry processing, discrete differential geometry, geometric data
analysis, and other areas. The application deadline ist March 8, 2026.

Fore more details see application web page:
https://jobs.tugraz.at/en/jobs/796fae56-3071-dfdc-8d36-69456d494055

---------------------------------------------------------------------
Johannes Wallner Tel (+43) 316 873 8440
Institut fuer Geometrie der TU Graz,
Kopernikusgasse 24, 8010 Graz.
j.wallner@tugraz.at http://www.geometrie.tugraz.at/wallner
----------------------------------------------------------------------
**********************************************************
*
* 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 Theory of Distributed Systems, Paderborn University

The Theory of Distributed Systems group at Paderborn University (Germany) is
offering a fully funded 3-year PhD position (at the level TV-L E-13 of the
German public sector) on foundations of distributed computing. The
successful candidate joins a group whose research covers a broad spectrum of
topics including communication networks, distributed computing, and
programmable matter. Due to interactions with various international
researchers and PhD students, the working language is English, so knowledge
of German is not required.

The application deadline is February 6, 2026, and the position is expected
to start around April 2026 (though starting later would also be possible).

Applicants should have a Master's degree in computer science or mathematics
or a related discipline, and an excellent background in math and algorithms.

Please send your application (including a cover letter, CV, Bachelor and
Master certificates, and references if available) to scheideler@upb.de.

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

Prof. Dr. Christian Scheideler

Dept. of Computer Science

Paderborn University

Fürstenallee 11

33102 Paderborn, Germany

Email: scheideler@upb.de

Web: https://cs.uni-paderborn.de/en/ti

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

**********************************************************
*
* 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: Symposium on AI Verification (SAIV) 2026, co-located with FLoC

The 9th International Symposium on AI Verification—SAIV 2026
Lisbon, Portugal, July 24–25
co-located with FLoC 2026
https://aiverification.org/2026/

=== Important Dates (all dates are 11:59 AM AoE) ===

Abstract Submission: March 19, 2026
Paper Submission: March 26, 2026
Paper Notification: May 15, 2026
Poster Submission: June 11, 2026
Poster Notification: June 18, 2026

=== SAIV ===

The International Symposium on AI Verification (SAIV) aims to bring together researchers from the communities on formal methods and artificial intelligence. Formal reasoning about learning-based systems raises novel, challenging, and exciting problems, such as the verification of learning-based components, the combination of deep learning and symbolic algorithms, and the data-driven verification of systems. SAIV aims to serve as a platform for idea exchange and cross-pollination on these topics.

=== 2026 Edition ===

SAIV 2026 will feature a keynote by Armando Solar-Lezama (MIT) and four invited speakers: Lars Lindemann (ETH Zurich), Sara Magliacane (University of Amsterdam), Lenka Tětková (Technical University of Denmark), and Đorđe Žikelić (Singapore Management University).

SAIV 2026 will host the 7th International Verification of Neural Networks Competition (VNN-COMP'26) (https://vnn-comp.github.io/).

=== Submission ===

We invite three categories of submissions:

**Original papers** describe original research and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available. We welcome both short and long papers. Submissions should not exceed 18 pages (LNCS format).

**Benchmark and case-study papers** propose a challenge to the SAIV community or showcase practical evaluations, real-world applications, or lessons learned in verifying and deploying safety-critical AI systems, focusing on metrics, methodologies, and safety outcomes.

**Presentation-only papers**: SAIV aims to integrate researchers from the AI and FM communities. Papers from these areas are dispersed across many conferences. A visit to SAIV should offer a wide picture of the latest research in the field. Thus, we welcome presentations of papers that will not appear in the proceedings.

In addition, VNN-COMP will invite competition contribution papers from participants for both tools and benchmarks that will also appear in the proceedings through a separate call; see the VNN-COMP website for more details.

Papers selected for publication will appear in Springer's LNCS proceedings.

=== Topics ===

The topics covered by SAIV include, but are not limited to, the following:

Safety specifications for systems with AI components
Symbolic analysis of cyber-physical systems with AI components
Formal verification of neural networks
Neuro-symbolic reasoning for AI safety
Testing approaches for systems with AI components
Formal guarantees for interpretable AI
Machine learning for program and controller synthesis
Machine learning for automated reasoning and theorem proving
Differentiable proof certificates
Statistical approaches to falsification and verification
Data-driven verification

=== Program Chairs ===

Guy Avni (University of Haifa)
Christian Schilling (Aalborg 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] [Cryptography] (IF 2.1, CiteScore 5.0) Selected Papers in Volume 9, Issue 4

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

1. Role-Based Efficient Proactive Secret Sharing with User Revocation
https://www.mdpi.com/2410-387X/9/4/80

2. Evaluation of the Impact of AES Encryption on Query Read Performance
Across Oracle, MySQL, and SQL Server Databases
https://www.mdpi.com/2410-387X/9/4/77

3. Post-Quantum Key Exchange in TLS 1.3: Further Analysis on Performance
of New Cryptographic Standards
https://www.mdpi.com/2410-387X/9/4/73

4. A Post-Quantum Cryptography Enabled Feature-Level Fusion Framework
for Privacy-Preserving Multimodal Biometric Recognition
https://www.mdpi.com/2410-387X/9/4/72

5. Enhancing Multi-Factor Authentication with Templateless 2D/3D
Biometrics and PUF Integration for Securing Smart Devices
https://www.mdpi.com/2410-387X/9/4/68

6. Constructing 8 × 8 S-Boxes with Optimal Boolean Function Nonlinearity
https://www.mdpi.com/2410-387X/9/4/67

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

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

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

Twitter: @Cryptogr_MDPI https://twitter.com/Cryptogr_MDPI
LinkedIn: Cryptography-MDPI

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

[DMANET] Stream “The Practice of OR: Stories of Solutions, Setbacks, and Success” (Dr. Elise del Rosario) at IFORS 2026, Vienna, Austria, 12-17 July 2026

The Practice of OR: Stories of Solutions, Setbacks, and Successes


Every OR practitioner has a story to tell.

Behind every model is a real problem, real people, imperfect data, and decisions that rarely unfold as planned. This stream invites papers that bring those stories to the foreground—sharing how Operations Research is actually practiced in real-world settings.

At the IFORS conference ( https://www.ifors2026.at/home/ ), we welcome contributions that showcase applied OR projects and the practical challenges involved in carrying them out. Of particular interest are experiences that illustrate how practitioners:

* Identified and framed opportunities for OR
* Engaged stakeholders and decision-makers
* Formulated, tested, and refined models
* Dealt with data limitations, organizational constraints, or shifting objectives
* Navigated the often-difficult path from analysis to implementation

Submissions ( https://www.euro-online.org/conf/ifors2026/ ) may reflect on topics such as:

* How the project began and how the problem was ultimately framed
* Assumptions that did not hold—and how the formulation evolved as a result
* Technical, organizational, or political challenges encountered along the way
* Strategies for "selling" OR: securing buy-in, managing expectations, and communicating value
* Lessons learned from successful implementations—or from attempts that fell short

This stream ( please use session Code 70 ) aims to promote honest, experience-based insights into the practice of OR. We encourage both academics and practitioners to submit papers that reveal what happens beyond the equations—where OR meets reality.

With the breadth of work you have undertaken, we are confident you have valuable experiences to share. We invite you to contribute and help enrich the collective understanding of how OR truly happens on the ground.

Elise del Rosario (Stream and Session Chair)

elise@jgdelrosario.com

Gerhard-Wilhelm Weber (Session Co-Chair)

gerhard-wilhelm.weber@put.poznan.pl


**********************************************************
*
* 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, January 20, 2026

[DMANET] Faculty Position in Computer Science - University of Delaware

Tenure Track Assistant Professor: Theory
Department of Computer and Information Sciences
University of Delaware

The Department of Computer and Information Sciences at the University of
Delaware invites applications for a tenure-track assistant professor
position in computer science theory. Theory is broadly construed to include
the theory of computation, algorithms, complexity, quantum computing,
logic, verification, formal methods, programming languages, or any area of
computer science with a strong theoretical component. Applicants should
hold a Ph.D. or equivalent degree in relevant areas. We encourage all
ambitious, innovative individuals, who have demonstrated excellence in
research and drive to become leaders in their fields while engaging in
high-quality teaching and mentoring, to apply.

The Department is vibrant and growing, currently with 31 tenure-track, 11
teaching, and 2 research faculty members, and about 230 graduate students
(including ~130 Ph.D. students) and 580 undergraduate students. 58% of the
tenure-track faculty are NSF CAREER awardees. We have significant external
funding, including grants from the NSF, NIH, DOE, DARPA, Air Force, Army,
Navy, and industry. New faculty will have ample opportunities to
collaborate with current faculty on ongoing projects in software
verification, scientific computing, algorithms, quantum computing,
artificial intelligence, security, and networks, among other subjects.

The 7th oldest institution of higher education in the United States, the
University of Delaware (with 18,000+ undergraduate and 3,000+ full-time
graduate students) ranks among the nation's top 100 universities in federal
R&D support for science and engineering, and among the top 50 schools of
engineering nationwide. The University has a vibrant ecosystem of research
centers and institutes. Computer science faculty are leaders in the Data
Science Institute and the First State AI Institute, creating rich
opportunities for collaboration within the State of Delaware and beyond.
The 272-acre STAR (Science, Technology and Advanced Research) campus offers
even more opportunities for research, academic, and commercial development.
The University of Delaware is a Land-Grant, Sea-Grant, and Space-Grant
institution, and its beautiful 100-acre central campus is located halfway
between Washington, DC and New York City, and about one hour away from
Baltimore and Philadelphia. More information about the Department and the
University is available at www.cis.udel.edu and www.udel.edu/about/,
respectively.

Review of applications will begin January 31, 2026, and will continue until
the position is filled.

Apply at
https://careers.udel.edu/cw/en-us/job/502682/tenure-track-assistant-professor-computer-science-theory

--
Dr. Ilya Safro
Professor and Associate Chair
Department of Computer and Information Sciences
Department of Physics and Astronomy (Joint)
University of Delaware
http://www.eecis.udel.edu/~isafro

**********************************************************
*
* 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] GrAPL 2026: Workshop on Graphs: Architectures, Programming, and Learning - co-located with IPDPS 2026

[Please accept our apologies for multiple postings.]

CALL FOR PAPERS

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

GrAPL 2026: Workshop on Graphs, Architectures, Programming, and Learning
https://hpc.pnl.gov/grapl/

June 4, 2026
Co-Located with IPDPS 2026
New Orleans, LA, USA

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


Data analytics is one of the fastest growing segments of computer science. Many
real-world analytic workloads combine graph and machine learning methods. Graphs
play an important role in the synthesis and analysis of relationships and
organizational structures, furthering the ability of machine-learning methods to
identify signature features. Given the difference in the parallel execution
models of graph algorithms and machine learning methods, current tools, runtime
systems, and architectures do not deliver consistently good performance across
data analysis workflows. In this workshop we are interested in graphs, how their
synthesis (representation) and analysis is supported in hardware and software,
and the ways graph algorithms interact with machine learning. The workshop's
scope is broad and encompasses the wide range of methods used in large-scale
data analytics workflows.

This workshop seeks papers on the theory, model-based analysis, simulation, and
analysis of operational data for graph analytics and related machine learning
applications. In particular, we are interested, but not limited to the following
topics:

* Provide tractability and performance analysis in terms of complexity,
time-to-solution, problem size, and quality of solution for systems that deal
with mixed data analytics workflows;
* Investigate novel solutions for accelerating graph learning-based methods
using methodologies such as graph neural networks and knowledge graphs;
* Discuss graph programming models and associated frameworks such as GraphBLAS,
Galois, Pregel, the Boost Graph Library, GraphChi, etc., for building large
multi-attributed graphs;
* Discuss how frameworks for building graph algorithms interact with those for
building machine learning algorithms;
* Discuss the convergence of graph analytics, frameworks, and graph databases;
* Discuss hardware platforms specialized for addressing large, dynamic,
multi-attributed graphs and associated machine learning;
* Discuss the problem domains and applications of graph methods, machine
learning methods, or both.

Besides regular papers, short papers (up to four pages) describing
work-in-progress or incomplete but sound, innovative ideas related to the
workshop theme are also encouraged.

MPORTANT DATES
---------------

Position or full paper submission: February 1, 2026 AoE
Notification: February 28, 2026
Camera-ready: March 6, 2026
Workshop: May 25, 2026


PAPER SUBMISSIONS
---------------


Submission site:
https://ssl.linklings.net/conferences/ipdps/?page=Submit&id=GrAPLWorkshopFullSubmission&site=ipdps2026

Authors can submit two types of papers: Short papers (up to 4 pages) and long
papers (up to 10 pages). All submissions must be single-spaced double-column
pages using 10-point size font on 8.5x11 inch pages (IEEE conference style),
including figures, tables, and references.

The templates are available at:
http://www.ieee.org/conferences_events/conferences/publishing/templates.html.

ORGANIZATION
---------------

* General co-Chairs

Nesreen K. Ahmed (Outshift by CISCO), nesahmed@cisco.com
Manoj Kumar (IBM), manoj1@us.ibm.com

* Program co-Chairs

Kathrin Hanauer (University of Vienna), kathrin.hanauer@univie.ac.at
Marco Minutoli (AMD), marco.minutoli@amd.com

* GrAPL's Little Helpers

Tim Mattson (Intel)
Scott McMillan (CMU SEI)
Antonino Tumeo (PNNL)

* Technical Program Committee

Sameh Abdulah, KAUST, SA
Benjamin Brock, Intel, US
Umit V. Catalyurek, Georgia Institute of Technology and Amazon AWS, US
Fabio Checconi, Intel, US
S.M. Ferdous, Pacific Northwest National Laboratory, US
Md Taufique Hussain, Wake Forest University, US
Kamer Kaya, Sabancı University, TR
Jehandad Khan, AMD, US
Johannes Langguth, Simula, NO
Roger Pearce, Lawrence Livermore National Laboratory, Texas A&M University, US
Mihail Popov, French Institute for Research in Computer Science and Automation, FR
Bradley Rees, NVIDIA, US
Francesco Silvestri, University of Padova, IT
Bora Uçar, French National Center for Scientific Research, LIP, ENS de Lyon, FR
Albert-Jan Yzelman, Huawei, CH

Other Members TBD
**********************************************************
*
* 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 Second Call for Papers (submission servers now open)

Call for Papers - ICALP 2026
July 6-10 2026, Royal Holloway, University of London, UK


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] PATAT 2026 - deadline 1 April 2026

[Apologies if you have received multiple copies of this email.]


25–28 August, 2026
Nottingham, United Kingdom

https://patatconference.org/patat2026/


********************************************
Submission deadline: Wednesday, 1 April 2026
********************************************


AIM AND SCOPE

The International Series of Conferences on the Practice and Theory of Automated Timetabling (PATAT) is held biennially as the main international forum for both researchers and practitioners of timetabling to exchange ideas. PATAT 2026, which is the fifteenth in the conference series, will be held in Nottingham, United Kingdom.

Whether it is sporting events, educational institutions, transportation or employee management, the construction of efficient timetables which provide the maximum in way of flexibility for all constituent parts, including stakeholders, is as important as it is challenging. An increasingly important aspect within organisations is an automated approach which optimises all aspects of resource usage. In doing so, a number of quantitative and qualitative challenges must be dealt with from both a technical and practical perspective.

An important aim of the conference is to align the needs of practitioners and the objectives of researchers. This is achieved through the presentation and application of leading-edge research techniques. Practitioners and Researchers alike are encouraged to present their work and experiences with the overall goal of developing efficient and practical solutions. With this goal in mind, at PATAT 2026, researchers and practitioners will be brought together through a number of key presentations and contributed talks.

Topics of interest and themes of the conference include, but are not limited to:
- Educational Timetabling
- Timetabling in Transport
- Employee Rostering
- Sports Timetabling
- Timetabling in Healthcare
- Mathematical Programming
- Constraint-Based Methods
- Knowledge-Based Systems
- Heuristic Search
- Metaheuristics (e.g., Evolutionary Computation, Simulated Annealing, Tabu Search, Ant Colony Methods)
- Systems to Build Systems (e.g., Hyper-heuristics, Algorithm Portfolios)
- Algorithm Configuration
- Artificial Intelligence
- Trustworthiness, Fairness and Ethical Issues in Timetabling
- Graph Colouring
- Resource Capacity Planning
- Parallel/Distributed Computing
- Hybrid Methods (e.g., Memetic Computing, Matheuristics)
- Machine Learning (e.g., Data Mining, Classifier Systems, Neural Networks, Reinforcement Learning, Deep Learning, GFlowNets)
- Expert Systems
- Multi-objective Approaches
- Multi-criteria Decision Making
- Preference Collection and Elicitation in Timetabling
- Foundational Studies (e.g., Complexity Issues)
- Timetabling Tools and Technologies (e.g., Web Applications, Interactive and Batch Systems, Standard Data Formats, Ontologies, Experiences, Libraries)


INVITED SPEAKERS

* Jeroen Mulder, Air France-KLM, France
* David Pisinger, Technical University of Denmark, Lyngby, Denmark
* Hana Rudová, Masaryk University, Brno, Czech Republic
* Kevin Tierney, University of Vienna, Vienna, Austria


PUBLICATION

Authors are invited to submit their work in one of three categories:

1. Full papers: to describe significant, original and unpublished work (max 12 pages).

2. Abstracts: People who wish to give a talk (e.g. practitioners, researchers with preliminary or incomplete papers) but do not want to submit a full paper can submit abstracts of up to 1000 words (not exceeding 4 pages).

3. Demonstration abstracts: to showcase innovations and contributions of timetabling systems set in production by industrial researchers and practitioners (up to 1000 words, not exceeding 4 pages).


All submissions will be peer reviewed by the members of the programme committee. Accepted contributions will be invited for an oral presentation at the event and included in the PATAT 2026 proceedings after the event.

Submission details are available at: https://patatconference.org/patat2026/


JOURNAL SPECIAL ISSUE

Authors of contributions of all three categories will be invited to submit extended versions of their work as full papers to be considered for publication in a Special Issue of the Journal of Scheduling.


IMPORTANT DATES

- Paper Submission Deadline: Wednesday, 1 April 2026
- Notification of Acceptance: Friday, 15 May 2026
- Early Registration Closes: Monday, 22 June 2026
- Conference: Tuesday-Friday, 25–28 August 2026


PROGRAMME CO-CHAIRS

- Daniel Karapetyan, University of Nottingham (UK), daniel.karapetyan(ATT)nottingham.ac.uk
- John Drake, University of Leicester (UK), john.drake(ATT)leicester.ac.uk
- Edmund Burke, Bangor University (UK), ekb(ATT)bangor.ac.uk
- Barry McCollum, Queen's University Belfast (UK), barrymccollum(ATT)eventmapsolutions.com
- Ender Özcan, University of Nottingham (UK), ender.ozcan(ATT)nottingham.ac.uk


LOCAL ORGANISING COMMITTEE

- Daniel Karapetyan, University of Nottingham (UK), daniel.karapetyan(ATT)nottingham.ac.uk
- John Drake, University of Leicester (UK), john.drake(ATT)leicester.ac.uk

This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

**********************************************************
*
* 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] Second Call For Papers | DIAGRAMS 2026

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

15th International Conference on the Theory and Application of Diagrams

August 24–28, 2026

Tallinn University of Technology, Tallinn, Estonia

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

*** Highlights ***

- Proceedings published by Springer

- Graduate Symposium

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

- Best Paper and Best Student Paper awards

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

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

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

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

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

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

SUBMISSION

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

• Long Papers (16 pages)

• Short Papers (8 pages)

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

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

*Submission date: March 1, 2026.*

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

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

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

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

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

[DMANET] First call for participation: Lattice Path Conference 2026 (LPC 2026) - Vienna, Austria

Dear Colleagues,

The 10th International Conference on Lattice Path Combinatorics and
Applications will take place at TU Wien in Vienna, Austria, from July
20–24, 2026.

The conference will cover interactions of lattice paths with various
domains (probability theory, enumerative/algebraic/asymptotic
combinatorics, q-analogues, computer science, combinatorial physics,
...) and will include:
*) Invited talks by Jehanne Dousse, Christian Krattenthaler, Markus
Kuba, Marni Mishna, Igor Pak, Ecaterina Sava-Huss, Gordon Slade, Luc Vinet;
*) 22 contributed short talks;
*) An open problem session, a poster session, and a few other delights.

We invite you to propose a short talk or a poster at this event (recent
results as well as survey articles are welcome).

Please see https://lpc2026.conf.tuwien.ac.at/ for submission details.
Deadline for submissions: May 15, 2026.

Feel free to forward this email to interested PhD students/postdocs!

After the conference, there will be a special issue in the Journal
Séminaire Lotharingien de Combinatoire; see the conference website for
more information.

Hoping to meet you soon!

Best regards,
The Scientific Committee George Andrews, Cyril Banderier, Mireille
Bousquet-Mélou, Vít Jelínek, Greta Panova, Malvina Vamvakari, Michael
Wallner, Mei Yin

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

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

Dear all

We are organizing a PhD school on robust optimization at IGESA in Porquerolles (https://maps.app.goo.gl/VismMQ5mrYzMPdDr5), on September 7-11 2026. The school will cover basics of static, adjustable, combinatorial robust optimization, as well as distributionally robust optimization, in the line of the previous school hold in Montpellier: https://roschool24.sciencesconf.org/

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

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

Best,

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

Monday, January 19, 2026

[DMANET] SEA 2026: deadline extension

SEA 2026: 24th Symposium on Experimental Algorithms
Copenhagen, Denmark
June 22-24, 2026

SEA is a leading forum for research on the design, analysis, engineering,
and experimental evaluation of algorithms and data structures.

*Extended paper submission deadline: February 2, 2026 AoE*
Further information, including the call for papers and submission details,
is available at:
https://sea2026.github.io/

**********************************************************
*
* 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: 4 Special Sessions at IEEE WCCI-CEC 2026 — Maastricht, NL— Deadline: Jan 31

Dear Colleagues,

We are pleased to invite contributions to several *Special Sessions* being
organized for the upcoming *2026 IEEE World Congress on Computational
Intelligence (WCCI-CEC)*.

The congress will take place from *June 21–26, 2026*, in the historic city
of *Maastricht, the Netherlands*. These sessions cover a diverse range of
topics, from foundational optimization theory to cutting-edge applications
in Generative NLP and Sustainable Agriculture.
------------------------------
*Open Special Sessions*

*1. New Frontiers in Evolutionary Computation for Real-World Optimization*

-

*Focus:* Smart initialization and dynamic operators for complex,
high-dimensional environments.
-

*Details:* View CFP <https://diegoliva.com/cfp/sscec26_nf/>

*2. 5th Special Session on Partitioning, Clustering & Decomposition in EC*

-

*Focus:* Structural learning, decomposition strategies, and advanced
clustering.
-

*Details:* View CFP <https://diegoliva.com/cfp/sscec26_pc/>

*3. Evolutionary & Swarm-Based Optimization in Smart/Sustainable
Agriculture*

-

*Focus:* Precision farming, resource management, and
sustainability-driven decision-making.
-

*Details:* View CFP
<https://absalomezugwu.github.io/wcci2026-ss-evolutionary-agriculture/>

*4. Evolutionary Computation for Generative Natural Language Processing*

-

*Focus:* Connecting EC with Generative AI, Large Language Models (LLMs),
and language evolution.
-

*Details:* View CFP <https://evonlpieeewcci2026.vercel.app/>

------------------------------
*Key Event Information*

-

*Conference:* IEEE WCCI 2026
-

*Location:* Maastricht, the Netherlands 🇳🇱
-

*Dates:* June 21–26, 2026
-

*Official Website:* https://attend.ieee.org/wcci-2026/

We invite researchers, practitioners, and students to submit their latest
work. Your contributions will help shape the future of computational
intelligence. Please feel free to forward this invitation to colleagues or
students who may be interested.

We look forward to seeing you in Maastricht!

Best regards,
--
Dr. Diego Oliva
diegoliva.com <http://www,diegoliva.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] IWOCA 2026 - Final call for papers - paper registration deadline January 26 AoE

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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