Wednesday, November 19, 2025

[DMANET] internship Physics-Informed AI for cancer histopathology (project PIA4HIST)

Dear All,

We offer an internship  at the University of Montpellier combining PDEs
and physics-informed AI for cancer histopathology. We are looking for
outstanding _second-year _Master's students. The internship may be
continued as a PhD thesis (funding secured). Interested students should
apply immediately, as we will begin interviewing in the coming days.

https://systems-biology-lphi.cnrs.fr/wp-content/uploads/2025/10/Internship_physics_informed.pdf

Best regards,

Ovidiu Radulescu

--
Prof. Ovidiu Radulescu
University of Montpellier
Laboratory of Pathogens and Host Immunity
Leader, Computational Systems Biology team
------------------------------------------------------------------------
LPHI - UMR 5294 CNRS/UM/INSERM Phone: +33-(0)4-6714-9221
Pl. E. Bataillon - Bat. 24 Fax: +33-(0)4-6714-4286
Université de Montpellier email:ovidiu.radulescu@umontpellier.fr
CP 107
34095 Montpellier Cedex 5
FRANCE

**********************************************************
*
* 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, November 18, 2025

[DMANET] [NCMA 26] NCMA-2026 Rouen, France — First Call for Papers

------ First Call for Papers NCMA 2026 ------

16th International Workshop on
"Non-Classical Models of Automata and Applications"
(NCMA 2026)

June 29-30, 2026, Rouen, France

https://dlt-ncma-2026.sciencesconf.org/

NCMA (since 2009) is a workshop series devoted to research on non-classical models of automata and grammar-like devices, covering both theoretical foundations (descriptional complexity, decidability, complexity) and applications (bio-computing, document processing, self-assembly, etc.). NCMA aims to bring together researchers studying novel or extended computational models, their properties and applications.

Topics for NCMA 2026 include (but are not limited) to :

- Formal models inspired by linguistics, bio-computing, text processing, document engineering, self-assembly, etc.,
- Bio-inspired models of automata and generative devices,
- Cellular automata,
- Forgetting automata and restarting automata,
- Automata with additional resources,
- Regulated rewriting/automata,
- Networks of automata or generative devices,
- Models of cooperation and communication,
- Quantum automata,
- Automata in the framework of membrane computing,
- Complexity aspects for formal systems.


Important dates (all dates are to be understood AoE)
----------------------------------------------------------------------

* Deadline for submissions: April 6, 2026
* Notification of acceptance: May 18, 2026
* Deadline for all final papers: June 8, 2026
* Conference: June 29-30, 2026


Submissions and Proceedings
---------------------------

Authors are invited to submit full papers of up to 16 pages in electronic form (PDF).
About the used style and submission procedure detailed information will be put on the website on due time. The proceedings for full papers is planned to appear in an EPTCS volume.

Proofs omitted due to space constraints may be put into an appendix that will be read by the reviewers at their discretion. All papers will be reviewed by at least three referees, and simultaneous submissions to other conferences or workshops with published proceedings are not allowed.


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

To be announced

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

Martin Berglund (Umeå, Sweden)
Cezar Campeanu (Charlottetown, Canada) (co-chair)
Giuseppa Castiglione (Palermo, Italy)
Pamela Fleischmann (Kiel, Germany)
Zsolt Gazdag (Szeged, Hungary)
Yo-Sub Han (Seoul, South-Korea)
Zbyněk Křivka (Brno, Czech Republic)
Martin Kutrib (Giessen, Germany) (co-chair)
Sylvan Lombardy (Bordeaux, France) (co-chair)
Ian McQuillan (Saskatoon, Canada)
František Mráz (Prague, Czech Republic)
Benedek Nagy (Famagusta, Cyprus)
Beatrice Palano (Milano, Italy)
Luca Prigioniero (Loughborough, UK)
Rogério Reis (Porto, Portugal) and
Agustín Riscos-Núñez (Sevilla, Spain)
Hellis Tamm (Tallinn, Estonia)
Brink van der Merwe (Stellenbosch, South Africa)

(more names to be added)

Local Information:
------------------------

The workshop will take place in Rouen (France).

NCMA 2026 will be co-located with DLT 2026: 30th International Conference on Developments in Language Theory (June 30 - July 3, 2026).


Contact:
---------

email: comite.organisation.dlt.ncma.2026@listes.univ-rouen.fr
web : https://dlt-ncma-2026.sciencesconf.org/

------------------------------------------------------------
Apologize if you have received multiple copies of this message.
------------------------------------------------------------    


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

[DMANET] 1-2 postdoc positions in discrete geometry and related areas, two universities in Prague

1-2 postdoc positions in discrete geometry and related areas are available
within the project "DiGeo: Fundamental Questions in Discrete Geometry"
funded by the Science Foundation of the Czech Republic. Each of the
positions also comes with travel funding.

The project is focused on problems in various areas of and related to
discrete geometry, including convexity questions for point sets,
visibility, graph drawing, crossing numbers of graphs, semialgebraic
hypergraphs, and Delaunay graphs.

The project involves Martin Balko, Vit Jelinek, Jan Kratochvil, Jan Kyncl,
Maria Saumell, Pavel Valtr, and a group of PhD students. The project is
co-hosted by Charles University in Prague and by the Czech Technical
University in Prague.

Starting date: in the first half of 2026 (negotiable) 

Duration: one year with a possibility of extension until the end of 2027.

Salary: 56 000-65 000 CZK/month + health insurance covered.

Qualification requirements: Ph.D. degree obtained before the starting date
and no more than 6 years ago.

Please send applications (ideally as a single PDF file) by email
to digeo@kam.mff.cuni.cz (with Cc. to valtr@kam.mff.cuni.cz), including:

   - a cover letter with a research proposal (2-3 pages),
   - a detailed CV (2-3 pages),
   - a list of publications,
   - a list of citations preferably by WoS, an additional list of citations not included in WoS may be added, but is not mandatory.

The applicant must also arrange for 2-3 letters of recommendation to be
sent as well to digeo@kam.mff.cuni.cz (with Cc. to valtr@kam.mff.cuni.cz).

Application deadline: December 8, 2025. 

When filling the positions, the gender balance in the team shall also be
taken into account.

Informal inquiries:
Pavel Valtr, email <valtr at kam.mff.cuni.cz>.
Maria Saumell, email <maria.saumell at fit.cvut.cz>

Information about the project:
https://kam.mff.cuni.cz/digeo/

**********************************************************
*
* 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] EURO Support for NATCOR Bursaries. Deadline for applications: January 31, 2026.

Apologies for cross-posting.

https://www.euro-online.org/web/pages/1568/natcor-bursaries

NATCOR (http://www.natcor.ac.uk/), a National Taught Course Centre in
Operational Research, delivers taught courses to PhD students, from across
Europe, on a number of different topics in OR.

EURO is advertising a competition for bursaries for courses run in 2026.

*BRAND NEW* Optimization Under Uncertainty. The University of Edinburgh 15
- 19 June 2026
Multiple Criteria Decision Making (MCDM). University of Portsmouth 9-7
September 2026
System Dynamics. Online, via Teams Commencing 6 July 2026
Heuristic Optimisation and Learning. University of Nottingham 13-17 April
2026
Convex Optimizaton. The University of Edinburgh 8 - 12 June 2026

The NATCOR course fees and on-site accommodation (if applicable) will be
funded by EURO for successful candidates. Typically, accommodation for any
residential courses will be four nights bed and breakfast. If additional or
alternative accommodation is required, candidates will need to arrange and
pay for this. Also any extra costs incurred will need to be settled
personally. Please also be reminded that successful candidates requiring
visas will need to apply for these in good time. Also please note the
recent changes to travel requirements for European nationals visiting the
United Kingdom. Eligible Europeans will need an ETA to travel from 2 April
2025. Further guidelines can be found here:
https://www.gov.uk/guidance/apply-for-an-electronic-travel-authorisation-eta

Eligibility

Applicants must be PhD students, from one of the EURO member countries or
studying in one of the EURO member countries (see
https://www.euro-online.org/web/pages/1457/current-member-societies). UK
applicants may also be eligible for one of the NATCOR bursaries (see
https://www.natcor.ac.uk/bursaries/). Applicants must have good English
Language skills as all NATCOR courses will be in English. Preference will
be given to students in their first or second years but all are welcome to
apply. Preference will also be given to applicants who have not previously
received support from EURO for NATCOR or other PhD schools.

Application

To apply for a bursary, candidates from a EURO member society country, or
studying in a EURO member society country, should submit a zip file
containing the application form (downloadable from the web page), their
curriculum vitae (including their academic track record), and a letter of
recommendation from their supervisor. Applicants should declare if they are
receiving any additional support from their PhD funding body or other
sponsor.

Current Call - Important Dates

Submit documents (see above) to
https://www.euro-online.org/awards/natcor2026/registration.php.

Deadline for applications: January 31, 2026

Notification of acceptance: February 28, 2026

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

[DMANET] Final Call for Papers: Tests and Proofs (TAP) -- Now a Track at FM 2026

**CALL FOR PAPERS**

**Special Track on Tests and Proofs (TAP 2026)**

*at the*

**27th International Symposium on Formal Methods (FM 2026)**

**May 18-22, 2026 --- Tokyo, Japan**

**Website:** <https://conf.researchr.org/track/fm-2026/>

**Abstract Submission**: Tuesday, 25 November 2025
**Full Paper Submission:** Tuesday, 2 December 2025

### **New TAP Track at FM 2026: A Premier Venue for Tests and Proofs**

Since 2007, the [Test and Proof (TAP)
conference](https://tapconference.github.io/2024/) has long been a
leading venue for research on the intersection of software testing and
formal verification. Now, TAP is joining the 27th International
Symposium on Formal Methods (FM 2026) as a new special track. This
integration places the ground-breaking work of the Test and Proofs
community at the heart of the world's premier conference on formal
methods.

This new track provides a dedicated forum for researchers,
practitioners, and tool developers to present and discuss the latest
advances in the synergistic combination of traditionally distinct areas
of dynamic analysis, e.g., testing, and static analysis, e.g., proving.
By joining FM, the TAP track offers authors a wider, more diverse
audience and the prestige of publication in the main, open-access FM
2026 proceedings, published by Springer in the LNCS series. We invite
you to be part of this exciting new chapter for the tests and proofs
community!

**Track Highlight: FM 2026 Keynote by Professor Cristian Cadar**

We are thrilled to announce that TAP Track at FM 2026 will feature a
keynote address by **Professor Cristian Cadar** of Imperial College
London. Professor Cadar is a world-renowned authority on software
reliability, security, and verification, and is particularly celebrated
for his pioneering contributions to symbolic and dynamic execution
(e.g., KLEE). His selection as a main symposium keynote speaker is a
powerful testament to the increasing importance of the core topics of
the TAP track to the broader computer science community.

### **Scope and Topics of Interest**

The TAP track solicits high-quality, original research on the interplay
between dynamic techniques such as testing, runtime verification
etc.testing and formal verification such as proving, model checking,
abstract interpretation, etc. . The track aims to foster new
collaborations and advance the state of the art in creating reliable and
secure software and systems. Topics of interest include, but are not
limited to, the following areas:

**Foundations for Combining Testing and Verification**

- Formalisms and theories that unify testing and proof\
- Semantic foundations for combined static and dynamic analysis\
- Proof theory for test-case generation and specification conformance\
- Type systems with a testing and proving focus\
- Formal models of test-based and proof-based development

**Synergistic Techniques and Tools**

- Combination of model checking, theorem proving, and runtime
verification
- Synergies between symbolic execution, fuzzing, and formal analysis
- Test-case generation from formal specifications (e.g., using B, Z,
TLA+, VDM)
- Using test execution results to guide or automate proof discovery
- Static analysis for test-suite reduction, prioritization, and
optimization
- Verification-based and property-based testing
- Formal methods for testing AI/ML-based systems
- AI/ML techniques for enhancing formal verification and testing
- Derivation of specifications and contracts from tests
- Combination of static and dynamic analysis for security
vulnerability detection

**Applications and Empirical Evaluation**

- Case studies and experience reports applying combined test-and-proof
techniques to industrial systems (e.g., in security, cyber-physical
systems, autonomous systems, blockchain, or IoT)
- Empirical comparisons of different verification, testing, and
combined techniques
- Tool demonstration papers for new and innovative tools that support
tests and proofs
- Application of TAP techniques to challenge problems and benchmarks

### **Submission Categories and Guidelines**

The TAP track papers can be submitted in all paper categories supported
by the FM 2026 Research Track and submissions to the TAP track will be
reviewed following the policies and quality criteria of the FM Research
Track.

The TAP track solicits papers in the following categories:

- **Regular Papers (max 15 pages, excluding references and
appendices):** For mature, original research contributions.
- **Long Tool Papers (max 15 pages, excluding references and
appendices):** For presenting mature tools, their theoretical
foundations, and empirical evaluations.
- **Case Study Papers (max 15 pages, excluding references and
appendices):** For in-depth reports on the application of TAP
techniques to significant, real-world problems.
- **Short Papers (max 6 pages, excluding references and appendices):**
For presenting novel but not yet fully mature ideas, or for tool
demonstration papers that focus on a tool's features and usage.

Papers should be original work, not published or submitted elsewhere, in
Springer [LNCS format](https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines),
and written in English.

Submit your papers at https://easychair.org/conferences/?conf=fm2026

Reviewing is single-blind. Each paper will be evaluated by at least
three members of the Program Committee. Papers will be accepted or
rejected in the category in which they were submitted and will not be
moved between categories

Authors of accepted papers are strongly encouraged to submit their
supporting artifacts to the FM 2026 Artifact Evaluation track.

### **Important Dates**

All deadlines are **Anywhere on Earth (AoE, UTC-12h)**. The deadlines
for the TAP track are aligned with the FM 2026 Research Track.

Milestone Date
--------------------------- -------------------------------
**Abstract Submission** **Tuesday, 25 November 2025**
**Full Paper Submission** **Tuesday, 2 December 2025**
**Author Notification** **Friday, 6 February 2026**
**Camera-Ready Version** **Monday, 2 March 2026**
**FM 2026 Conference** **May 18-22, 2026**

### **Publication**

All accepted papers for the TAP track will be published as part of the
main FM 2026 conference proceedings. The proceedings will be published
by Springer in their **open-access Lecture Notes in Computer Science
(LNCS)** series. At least one author of an accepted paper must register
for the conference and present the work.

### **Track Organization**

**Track Chairs:**

- Marie-Christine Jakobs, Ludwig-Maximilan University, Munich, Germany
- Achim D. Brucker, University of Exeter, UK

For inquiries, please contact the track chairs.

--
Prof. Achim Brucker | Chair in Cybersecurity & Head of Group | University of Exeter
https://www.brucker.ch | https://logicalhacking.com/blog
@adbrucker | @logicalhacking
**********************************************************
*
* 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/PhD scholarships in Berlin

The Berlin Mathematical School (www.berlin-math.de) advertises
scholarships for Master and PhD studies in Mathematics, including Discrete
Mathematics. The starting date of the Master scholarship is October 2025.

The Berlin Mathematical School (BMS) is the joint graduate school of the
mathematics departments of the three research universities in Berlin, the
Freie Universität (FU), the Humboldt-Universität (HU), and the Technische
Universität (TU). It offers a comprehensive, coordinated study program in
English, an active, international research environment, as well as
mentoring programs, language courses, soft-skills seminars, funding for
summer schools and conferences, a buddy program and funding for students
with children. The BMS is committed to equality and diversity.

For information on how to apply, go to:
http://www.math-berlin.de/application

The deadline is December 1.
**********************************************************
*
* 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, November 17, 2025

[DMANET] AAA108, Vienna, February 6–8, 2026: Third Announcement (Registration & Abstracts)

@@@@@@@@@@@@@@@@@@@@@@@@

108. Arbeitstagung Allgemeine Algebra (AAA)
108th Workshop on General Algebra

February 6–8, 2026
Technische Universität Wien, Vienna, Austria

Website: https://www.aaa108.org/
Contact: aaa108@dmg.tuwien.ac.at
Registration: https://www.conftool.org/aaa108/register.php?quick=true
Organizers: Mike Behrisch, Paolo Marimon, and Michael Pinsker

@@@@@@@@@@@@@@@@@@@@@@@@

Dear colleagues,

This is an announcement that registration and abstract submission for
AAA108 is now open. The conference will be taking place between the 6th
and 8th of February 2026 at TU Wien, Vienna, with arrival day being the
5th of February.


REGISTRATION:

Participants may register as of now via
https://www.conftool.org/aaa108/register.php?quick=true

Note, upon registration you will be able to pay the conference fee by
credit card.

The timeline for registration is as follows:

• Early bird registration: 100 EUR (until 19th of December 2025);
• Standard registration: 110 EUR (20th of December—18th of January 2026);
• Late registration: 130 EUR (after the 19th of January 2026).

If, due to exceptional circumstances, you would like to request your
conference fee to be waived, please contact the organising committee.


ABSTRACT SUBMISSION:

Participants may submit abstracts for contributed talks (of
approximately 15—20 minutes) via the following link:
https://docs.google.com/forms/d/e/1FAIpQLSdBBxREqUx1LycTQT79-OPrDWLPVeDnQwuCMjn0_RQ2iGGnIw/viewform?usp=header

Speakers may modify abstracts in the form after submission.

Deadline for abstract submission: 18th of January 2026
Modification deadline: 25th of January 2026 (inclusively)


VISA LETTERS:

If you request a letter of invitation for visa purposes please contact
the organizing committee at your earliest convenience.


SPEAKERS:

As previously announced, the conference will consist of five invited
talks of 50 minutes and contributed talks of 15-20 minutes. Our speakers
will be:

• Peter Cameron (University of St. Andrews, Queen Mary University of
London)
• Michael Kompatscher (Charles University in Prague)
• James Mitchell (University of St. Andrews)
• Gianluca Paolini (University of Torino)
• Ross Willard (University of Waterloo)

Please feel free to forward this announcement to your colleagues and
students who may not be on our mailing list. We apologize for multiple
copies.

We look forward to welcoming you at the conference!

Mike Behrisch, Paolo Marimon and Michael Pinsker
Institut für Diskrete Mathematik und Geometrie
Technische Universität Wien
**********************************************************
*
* 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] 2 PhD positions@KTH Sweden in Theoretical Computer Science

KTH Royal Institute of Technology in Stockholm, Sweden is advertising two
Ph.D. student positions in theoretical foundations of data storage and
analysis. The students will work in the group of assistant professor
Ioana-Oriana Bercea (https://www.kth.se/profile/bercea).

The research team develops algorithms and data structures with provable
guarantees, by leveraging theoretical insights to obtain state-of-the-art
practical algorithms. Currently, we have a focus on randomized algorithms
and probabilistic data structures such as data sketches, Bloom filters, and
hash functions. We are also interested in implementing and developing
efficient data structures for subroutines that appear in data science
algorithms. The positions have a strong mathematical flavor, and the
students will spend a big part of their work analyzing algorithms
theoretically. Several directions of the project are possible and will be
determined in collaboration with the Ph.D. candidate.

The application deadline for these positions is November 27th, 2025. If you
have any questions do not hesitate to contact me at bercea@kth.se.

For more information on this position, see the official job opening:
https://www.kth.se/lediga-jobb/869297?l=en

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

[DMANET] Announcement: PACE Challenge 2026

Dear colleagues,

We are happy to announce the 11th iteration of PACE, the Parameterized
Algorithms and Computational Experiments Challenge. The goals of PACE,
as well as official reports for past challenges, can be found on our
website: https://pacechallenge.org/.

** Challenge Problem
------------------------------------------------------------

This year, the challenge is about rooted maximum-agreement forests,
arising in phylogenetics, i.e. the study of evolutionary histories.
Consider a set of rooted trees T1, T2, ..., Tt with the same set X of
leaves (leaf-labels).

A forest of rooted trees is called a *rooted agreement forest* if
(i) the leaves of F are labelled with X, and
(ii) each Ti can be translated into F by first removing directed edges
and then contracting vertices with out-degree at most one.

Input: A list of phylogenetic trees on the same leaf-set X.
Output: A smallest agreement forest of all input trees.

** Tracks
------------------------------------------------------------
Three tracks are planned:

Exact: Given t≥2 rooted trees on the same leaf-set, compute a smallest
agreement forest in a given timeframe. Contestants are ranked by number
of instances solved and time required.
NOTE: In this track, the instances will be augmented with information
about various parameters (such as their value and a proof thereof). To
this end, we would like to encourage participants to suggest parameters
that can be computed/estimated for the instances.

Heuristic: Given t=2 rooted trees on the same leaf-se, compute an
agreement forest with as few trees as possible in a given timeframe.
Contestants are ranked by the sizes of the forests and the times
required to optain them.

Lower Bound: Given t=2 rooted trees on the same leaf-set, compute an
agreement forest whose size must fall within a certain radius around the
smallest (known) agreement forest. Valid solutions are ranked by the
time it took to compute them.

Detailed instructions, details about the ranking methods and public
instances will be published online at a later point.

** Timeline
------------------------------------------------------------

October'25: Announcement of the challenge (Problem) and tracks
November'25: Release of tiny instances and test-environment
TBA / January'26: Release of public instances
TBA / April'26: Submissions via Optil.io open
TBA / July'26: Submission of final version, announcement of results
TBA / September'26: Award ceremony at the International Symposium on
Parameterized and Exact Computation (IPEC 2026).

** Zulip
------------------------------------------------------------
Join us on Zulip for discussions and updates:
https://pacechallenge.zulipchat.com/join/l3eavdfbytkcjiypecpzetuw/

** Program Committee
------------------------------------------------------------

Alexander Leonhardt (Goethe University, Frankfurt)
Manuel Penschuck (University of Southern Denmark, Odense)
Mathias Weller (CNRS, Université Gustave Eiffel, Paris)

** Steering Committee
------------------------------------------------------------

Max Bannach (European Space Agency)
Sebastian Berndt (Universität zu Lübeck)
Holger Dell (Goethe University Frankfurt, IT University of Copenhagen)
Bart M. P. Jansen (chair) (Eindhoven University of Technology)
Philipp Kindermann (Universität Trier)
André Nichterlein (Technical University of Berlin)
Christian Schulz (Universität Heidelberg)
Soeren Terziadis (TU Eindhoven)

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

[DMANET] Postdoc position (3 years) in optimization / discrete math at University of Cologne

At the Department of Mathematics and Computer Science at the University of Cologne, there is an open postdoctoral position (3 years) in Mathematical Optimization / Discrete Mathematics.

For more information, see the official job posting (Reference: Wiss2511-09) on the University of Cologne's job portal, or please feel free to contact me at frank.vallentin@uni-koeln.de.


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

[DMANET] Postdoc Position at ETH Zurich

ETH Zurich

POSTDOC POSITION IN FINE-GRAINED ALGORITHMS AND COMPLEXITY

A full-time postdoc position is available in the research group
Fine-Grained Algorithms & Complexity, led by Professor Karl Bringmann,
which will be established at ETH Zurich in January 2026. The group
develops fine-grained complexity theory, the area of theoretical
computer science that proves conditional lower bounds based on
conjectures such as the Strong Exponential Time Hypothesis, and designs
efficient algorithms matching these lower bounds. With this combination
of algorithm design and conditional lower bounds we aim to achieve
(near-)optimal algorithms for problems from various application areas
such as: discrete optimization, computational geometry, sublinear
algorithms, graph algorithms, database theory, and string algorithms.
More recently, the group is also exploring algorithm design for novel
realistic machine models. The group is part of the Institute for
Theoretical Computer Science at ETH Zurich, a vibrant research
environment hosting several leading algorithms researchers, including
Rasmus Kyng, David Steurer, and Vera Traub.

We invite applications for postdoctoral positions from candidates who
either have experience in fine-grained complexity theory, or have
expertise in any of the application areas listed above and are
interested in exploring fine-grained approaches within their domain. We
also welcome applicants with a strong background in designing and
implementing algorithms for realistic machine models.

The 1-year position has a flexible starting date in 2026, and can
potentially be extended. For full consideration, please send your
application by December 7 to <myfirstname>.<mylastname>@inf.ethz.ch Late
applications may also be considered. Your application should include a
CV with a list of publications, a paragraph describing possible
connections to the research group, names of potential recommendation
letter writers, and if possible a research statement. See also
https://people.mpi-inf.mpg.de/~kbringma/jobopenings.html

Karl Bringmann

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

Sunday, November 16, 2025

[DMANET] WAIFI 2026: CFP - International Workshop on the Arithmetic of Finite Fields

Dear colleagues,

(apologies for multiple postings)

This is the announcement of the "International Workshop on the Arithmetic of Finite Fields (WAIFI) 2026", to be held in Santander, Spain, June 3-5, 2026.

This workshop is a forum of mathematicians, computer scientists, engineers and physicists performing research on finite field arithmetic, interested in communicating the advances in the theory, applications, and implementations of finite fields. The workshop helps to bridge the gap between the mathematical theory of finite fields and their hardware/software implementations and technical applications, especially in cryptography and coding theory.

The topics of WAIFI 2026 include but are not limited to:

Theory of finite field arithmetic including:
Bases (canonical; normal; dual; etc.)
Polynomials (irreducible; primitive; permutation)
Boolean functions and special functions over finite fields
Algebraic curves over finite fields
Dynamical systems over finite fields
Hardware & Software implementations:
Design & implementation of finite field processors
Design & implementation of arithmetic for crypto algorithms and protocols
Pseudorandom number generators
Hardware/Software co-design in crypto and coding theory applications
Applications of finite fields in:
Cryptography such as Post Quantum Crypto and other algorithms and protocols
Coding theory (AG codes; LDPC codes; etc.)
Combinatorics (designs; arrays; etc.)
Finite geometry

Important dates:
Submission deadline: March 1st (23:59h AoE), 2026
Acceptance notification: April 30th, 2026
Final version: May 5th, 2026
Workshop: June 3-5, 2026
Final post-proceedings version due: July 20th, 2026

The proceedings will be published in the Springer Lecture Notes in Computer Science (LNCS) series after the workshop as post-proceedings.

The workshop website http://www.waifi.org <http://www.waifi.org/>, will be updated regularly with more information.

Kind regards,

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

Saturday, November 15, 2025

[DMANET] Ph.D. position in Extremal and Probabilistic Combinatorics

In the framework of the Vienna School of Mathematics, there is a call
for condidates for a

Ph.D. position in Extremal and Probabilistic Combinatorics

in the research group of Matija Bucic (University of Vienna), see

https://www.vsmath.at//media/vsm_open_position_Bucic_2025.pdf

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

[DMANET] DeepLearn 2026: early registration December 8

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

13th INTERNATIONAL SCHOOL ON DEEP LEARNING

DeepLearn 2026

Orléans, France

July 20-24, 2026

https://deeplearn.irdta.eu/2026/

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

Co-organized by:

University of Orléans

Centre Val de Loire Doctoral College

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

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

Early registration: December 8, 2025

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

SCOPE:

DeepLearn 2026 will be a research training event with a global scope aiming at updating participants on the most recent advances in the critical and fast developing area of deep learning. Previous events were held in Bilbao, Genova, Warsaw, Las Palmas de Gran Canaria, Guimarães, Luleå, Bournemouth, Bari, and Porto.

Deep learning is a branch of artificial intelligence covering a spectrum of current frontier research and industrial innovation that provides more efficient algorithms to deal with large-scale data in a huge variety of environments: computer vision, neurosciences, speech recognition, language processing, human-computer interaction, drug discovery, biomedicine and healthcare, medical image analysis, recommender systems, advertising, fraud detection, robotics, games, business and finance, biotechnology, physics and astrophysics, biometrics, communications, climate sciences, geographic information systems, signal processing, genomics, materials design, video technology, social systems, earth and sustainability, mathematical proofs, etc. etc.

The field is also raising a number of relevant questions about efficiency and robustness of the algorithms, explainability, transparency, interpretability, risks and safety, as well as important ethical concerns at the frontier of current knowledge that deserve careful multidisciplinary discussion.

Most deep learning subareas will be displayed and main challenges identified through 18 four-hour and a half courses, 2 keynote lectures, 1 round table, and a hackathon competition among participants. Renowned academics and industry pioneers will lecture and share their views with the audience. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Face to face interaction and networking will be main ingredients of the event. It will be also possible to fully participate in vivo remotely.

ADDRESSED TO:

Graduates, postgraduates and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees, hence people less or more advanced in their career will be welcome as well.

Since there will be a variety of levels, specific knowledge background may be assumed for some of the courses.

Overall, DeepLearn 2026 is addressed to students, researchers and practitioners who want to keep themselves updated about recent developments and future trends. All will surely find it fruitful to listen to and discuss with major researchers, industry leaders and innovators.

VENUE:

DeepLearn 2026 will take place in Orléans, located in the heart of the Loire Valley, which was declared by UNESCO a World Heritage Site in 2000. The venue will be:

University of Orléans
Faculty of Law, Economics and Management
11 rue de Blois
45100 Orléans, France

https://www.univ-orleans.fr/en

STRUCTURE:

3 courses will run in parallel during the whole event. Participants will be able to freely choose the courses they wish to attend as well as to move from one to another.

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

An open session will give participants the opportunity to present their own work in progress in 5 minutes. Also companies will be able to present their industrial developments for 10 minutes.

The school will include a hackathon, where participants will be able to work in teams to tackle several machine learning challenges.

Full live online participation will be possible. The organizers highlight, however, the importance of face to face interaction and networking in this kind of research training event.

KEYNOTE SPEAKERS:

Yingbin Liang (Ohio State University), Theoretical Characterization of Training Transformers for Chain-of-Thought Reasoning

Le Song (Mohamed bin Zayed University of Artificial Intelligence), Multiscale Foundation Models for Biology

PROFESSORS AND COURSES: (to be completed)

Yuejie Chi (Yale University), [introductory/intermediate] Statistical and Algorithmic Foundations of Reinforcement Learning

Bo Han (Hong Kong Baptist University), [introductory/intermediate] Trustworthy Machine Learning from Data to Models

Jiawei Han (University of Illinois Urbana-Champaign), [intermediate] Structure-Guided, Theme-Based Knowledge Discovery with Large Language Models

Mingyi Hong (University of Minnesota), [intermediate] Bilevel Optimization: Theory, Algorithms and Application in AI

Cho-Jui Hsieh (University of California Los Angeles), [intermediate/advanced] Optimizers for Large Language Model Training

Furong Huang (University of Maryland), [advanced] Generative AI Agents

Tara Javidi (University of California San Diego), [intermediate] Active Physical Intelligence for Industrial Scale Monitoring

Zhijin Qin (Tsinghua University), [intermediate/advanced] Semantic Communications

Aarti Singh (Carnegie Mellon University), [intermediate] Human Centered AI: Challenges and Opportunities

Masashi Sugiyama (University of Tokyo), [intermediate] Learning from Imperfect Supervision

Zhangyang (Atlas) Wang (University of Texas Austin), [intermediate/advanced] Beyond Sparsity or Low Rank: In-Between Neural and Symbolic Learning

Ming-Hsuan Yang (University of California Merced), [advanced] Recent Advances in Multimodal Understanding and Generation

Tong Zhang (University of Illinois Urbana-Champaign), [introductory/intermediate] Reinforcement Learning for Foundation Models

Jun Zhu (Tsinghua University), [introductory/advanced] Generative Models: from Virtual to Physical World

OPEN SESSION:

An open session will collect 5-minute voluntary oral presentations of work in progress by participants.

They should submit a half-page abstract containing the title, authors, and summary of the research to david@irdta.eu by July 12, 2026.

INDUSTRIAL SESSION:

A session will be devoted to 10-minute demonstrations of practical applications of deep learning in industry.

Companies interested in contributing are welcome to submit a 1-page abstract containing the program of the demonstration and the logistics needed. People in charge of the demonstration must register for the event.

Abstracts have to be submitted to david@irdta.eu by July 12, 2026.

HACKATHON:

A hackathon will take place, where participants can voluntarily work in teams to tackle several machine learning challenges. They will be coordinated by Professor Sergei V. Gleyzer (University of Alabama). The challenges will be released 2 weeks before the beginning of the school. A jury will judge the submissions and the winners of each challenge will be announced by the end of August 2026. The winning teams will receive a modest monetary prize and the runners-up will get a certificate.

SPONSORS:

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

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

ORGANIZING COMMITTEE:

Karim Abed-Meraim (Orléans, local co-chair)
Sergei V. Gleyzer (Tuscaloosa, hackathon chair)
Meryem Jabloun (Orléans, local co-chair)
Carlos Martín-Vide (Tarragona, program chair)
Santiago Montes (Tarragona, webpage)
Sara Morales (Luxembourg, finances)
Philippe Ravier (Orléans, local chair)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://deeplearn.irdta.eu/2026/registration/

The selection of 6 courses requested in the registration template is only tentative and non-binding. For logistical reasons, it will be helpful to have an estimation of the respective demand for each course.

Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed and the on-line registration tool disabled when the capacity of the venue will have got exhausted. It is highly recommended to register prior to the event.

FEES:

Fees comprise access to all program activities and lunches.

There are several early registration deadlines. Fees depend on the registration deadline.

The fees for on site and for online participation are the same.

ACCOMMODATION:

Accommodation suggestions will be available in due time at

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

CERTIFICATE:

A certificate of successful participation will be delivered indicating the number of hours of academic activities (40). This should be sufficient for those participants who plan to request ECTS recognition from their home university.

QUESTIONS AND FURTHER INFORMATION:

david@irdta.eu

ACKNOWLEDGMENTS:

Université d'Orléans

Collège Doctoral Centre-Val de Loire

Universitat Rovira i Virgili

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

Friday, November 14, 2025

[DMANET] Call for Postdoc and Group Leader Positions at the Max Planck Institute for Informatics

M A X P L A N C K I N S T I T U T E

for

I N F O R M A T I C S

seeks several

POSTDOCS and GROUP LEADERS

for the Algorithms and Complexity Department [
https://www.mpi-inf.mpg.de/departments/algorithms-complexity/]

directed by Danupon Nanongkai.

We are looking for applicants from all areas of algorithms and complexity
as well as related areas (such as algorithm engineering, high-performance
computing, theory of computation, and quantum computing). Researchers of
several nationalities work in the Algorithms and Complexity Department, and
our working language is English. The department is a part of the Max Planck
Institute for Informatics, located on the campus of Saarland University in
Saarbruecken, Germany. We maintain close collaborations with algorithms and
complexity researchers in other institutes on the campus, including the
Department of Computer Science, CISPA Helmholtz Center for Information
Security, and Max Planck Institute for Software Systems. The group has high
international visibility, and its members collaborate with multiple leading
research institutions in Europe and the U.S. There is generous travel
support available for all group members. Postdocs are free in their choice
of research topics and collaborators. Group leaders are expected to
independently build and lead research groups with internal and external
funding. The initial contract is for two years for postdocs and up to five
years for group leaders. There are possibilities for extensions,
promotions, and in exceptional cases, permanent employment. The starting
dates for the positions are flexible.

The Max Planck Society is committed to employing more individuals with
disabilities and expressly welcomes these to apply. The Max Planck Society
seeks to increase the percentage of women in the areas where they are
underrepresented and expressly encourages these to apply.

Applications should be submitted via our web form available at

https://www.mpi-inf.mpg.de/d1/offers/postdoc

by uploading a single PDF file containing

* a curriculum vitae,

* a complete list of publications, and

* a research plan (1 page suffices).

Moreover, we ask for the names and email addresses of three references we
may contact.

The submission server is online now. All applications submitted by 15
December 2025 will receive full consideration. Simultaneous applications
for a Lise Meitner Award Fellowship and for a joint fellowship with the
Simons Institute for the Theory of Computing, the Weizmann Institute, and
partner research groups at ISTA, ETH Zurich and IISc are possible.

**********************************************************
*
* 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 Workshops - ICALP 2026

First Call for Workshops - ICALP 2026 -
July 6 - July 10, 2026
Egham, UK
https://icalppodcspaa2026.cs.rhul.ac.uk/
The International Colloquium on Automata, Languages and Programming (ICALP) is the main conference and annual meeting of the EATCS (European Association for Theoretical Computer Science). This is a call for workshops to be affiliated with ICALP 2026, to be held in Egham, UK. We invite researchers to organize workshops on topics of interest to the ICALP community.

------
Format
------

In-person. (In exceptional cases, there may be support for remotely presenting a talk.)
At least one organizer of each workshop is expected to attend in person.

---------------
Important Dates
---------------
Workshop proposal deadline: 2 February 2026, 23:59 AoE

Workshop notification: 16 February 2026

Workshops: Monday 6 July 2026.

We recommend that prospective workshop organizers contact the workshop chair before submitting a proposal, though this is not strictly required.
---------------------
Submission Guidelines
---------------------
Proposals must be limited to three pages and should be submitted via email to icalpworkshops2026@rhul.ac.uk

Each submission should consist of the following:
1) A short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community.

2) An organizational part including:

    a. Workshop's name and URL if already available or from previous years;

    b. contact information for the workshop organizers (including their webpages);

    c. expected number of participants (if available. Please include the data of previous years, if applicable);
    
d. proposed format and agenda (e.g. paper presentations, tutorials, see below for more details);

    e. potential invited speakers (please specify their expected number and, if possible, tentative names);
    
    f. Procedures for selecting presentations (if you plan a call for contributed talks or papers followed by a selection procedure, the submission date should be scheduled after the affiliated conference's notification date, while the notification should take place before the early registration deadline)
    g. plans for dissemination, if any (e.g. a journal special issue);

    h. planned format of the event (see below for more details);

As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organizers or selected among presentation submissions. Deviations from this standard are also welcome, including half-day workshops, open problem sessions, discussion panels, or working sessions.

Note that ICALP 2026 is not able to provide financial support for the organization of workshops. The conference can however provide a room, internet connection and help with some local organization. Refreshments will be served.

----------
Committees
----------
Workshop Chair: Argyrios Deligkas <argyrios.deligkas@rhul.ac.uk>
Workshop Selection Committee:
Argyrios Deligkas
Matthew Hague

**********************************************************
*
* 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] SoCG 2026 Final Call for Papers

Dear colleagues,

the submission server at socg26.hotcrp.com is open. This the second and final call for papers.
Below is the short version. The full version can be found on the conference webpage at
cgweek26.computational-geometry.org/contribute/.

Kind regards,
Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri

===============================================================================
New! To strengthen and promote research on practical aspects of computational
geometry and topology, as well as connections to other fields, SoCG 2026
introduces a new track that specifically focuses on these aspects, such as
implementation, engineering, experimentation, and applications.
===============================================================================

CALL FOR PAPERS — 42nd International Symposium of Computational Geometry (SoCG'26)

The 42nd International Symposium on Computational Geometry (SoCG 2026) is planned
to be held in New Brunswick, NJ, USA, June 2–5, 2026, as part of the Computational
Geometry (CG) Week.

We invite high quality submissions that describe original research on the theory
and practice of computational problems in a geometric and/or topological setting.
Topics of interest include, but are not limited to:

* Design, analysis, and implementation of geometric algorithms and data structures;
* Computational complexity of geometric problems;
* Implementation and experimental evaluation of geometric algorithms and heuristics,
including mathematical, numerical, and algebraic aspects;
* Discrete and combinatorial geometry;
* Computational topology, topological data analysis, and topological combinatorics;
* Applications of computational geometry or topology in any field.

TWO TRACKS: To help ensure that each contribution is evaluated according to its
merits, the submission and review process is organized in two tracks:
Track T (Theory) and Track P (Practice).

IMPORTANT DATES:
* November 25, 2025 (Tuesday): Abstracts and paper registration due (23:59 aoE)
* December 2, 2025 (Tuesday): Papers due (23:59 aoE)
* February 5, 2026 (Thursday): Notification of acceptance/rejection
* March 24, 2026 (Tuesday): Final versions of accepted papers due
* June 2–5, 2026: Symposium

USEFUL LINKS:
* SoCG 2026 Conference Webpage: https://cgweek26.computational-geometry.org/
* SoCG 2026 HotCRP Submission Webpage: https://socg26.hotcrp.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] [Cryptography] (IF 2.1, CiteScore 5.0) Selected Papers in Volume 9, Issue 2

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

1. Compact 8-Bit S-Boxes Based on Multiplication in a Galois Field GF(24)
https://www.mdpi.com/2410-387X/9/2/21

2. Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives
https://www.mdpi.com/2410-387X/9/2/31

3. A Practical Performance Benchmark of Post-Quantum Cryptography Across
Heterogeneous Computing Environments
https://www.mdpi.com/2410-387X/9/2/32

4. QPUF: Quantum Physical Unclonable Functions for Security-by-Design of
Industrial Internet-of-Things
https://www.mdpi.com/2410-387X/9/2/34

5. Security and Performance Analyses of Post-Quantum Digital Signature
Algorithms and Their TLS and PKI Integrations
https://www.mdpi.com/2410-387X/9/2/38

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] [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] Academic position (E13) at KIT in group "Exascale Algorithm Engineering"

You like discrete algorithms (for graphs and related structures) and the
whole algorithm engineering cycle of design, analysis, implementation,
and experimental evaluation? And running your code on large-scale machines?

The computer science research group "Exascale Algorithm Engineering"
headed by Henning Meyerhenke at Karlsruhe Institute of Technology (KIT)
advertises a fixed-term PhD student position:

Starting date: Feb 1st, 2026 (or later)
Duration: 3 years
Applic. deadline: Nov 28th, 2025
Pay grade: TV-L 13, 100%
Vacancy number: 457/2025

Topic area: Development of novel algorithmic methods at the interface of
discrete algorithms and high-performance computing.

Within pay grade 13, the concrete gross salary depends on experience and
personal circumstances [1]. (A PhD student base salary usually starts in
column 1 and moves to column 2 after one year.)

We are located on "Campus South", close to Karlsruhe's city center.
There are ample opportunities to collaborate within the KIT Department
of Informatics and beyond. More details, including the submission link
for applications, can be found on KIT's job website [2].

Informal inquiries can be directed to me via email.

Henning Meyerhenke


[1]
https://oeffentlicher-dienst.info/c/t/rechner/tv-l/allg?id=tv-l-2025&matrix=1

[2] https://www.pse.kit.edu/english/karriere/joboffer.php?id=165533

**********************************************************
*
* 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 Computational optimization

Call for Papers

19th International Thematic Track/Workshop on Computational Optimization
(CO25)
Riga, Latvia, August 23-26, 2026

organized in the framework of CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2026


IEEE CS is a technical co-sponsor of FedCSIS 2026

https://2026.fedcsis.org/thematic/co
===============================

We invite original contributions related to both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing techniques
and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are not
limited to:

* classical operational research problems (knapsack, traveling salesman,
etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics, chemistry,
biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best CO26 paper will be awarded during the social dinner of FedCSIS2026.
The best paper will be selected by CO26 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 12 pages for regular paper
and 6 pages for short papers (IEEE style). IEEE style templates are
available at http://2026.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the track.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at CO26 will be published
in edited book of the series "Studies of Computational Intelligence",
Springer with SJR 0.237.

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

Important dates:


+ Paper submission (strict deadline): April 15, 2026, 23:59:59 pm HST
(there will be no extension)
+ Position paper submission: May 19, 2026
+ Author notification: June 16, 2026
+ Final paper submission and registration: June 30, 2026
+ Conference date: August 23-26, 2026

===============================================================================
Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
co@fedcsis.org

=======

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

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

Dear Colleagues,

We are happy to inform you that the *International Conference EnviroRisks*
will be held in the period *0**1**-0**3** June 202**6**, Sofia**, Bulgaria*.
The conference will provide an excellent international forum for
dissemination of original research results, new ideas and practical
development experiences which concentrate on both theory and practices of
the academics, researchers, engineers and also industry professionals.

*All accepted and presented papers will be submitted* *for publication** to
the SPRINGER **Series* *"Lecture Notes in Networks and Systems"**.*

*Please**, **visit the conference web page for more details:
**https://envirorisks.cmdrcoe.org/*

*Topics of interest for submission include, but are not limited to:*

*1. Disaster Management, Natural Hazards, Risk reduction and Building
Resilience*

*2. **Environmental Degradation*

*3**. **Resilience and Business Continuity Management*

*4. **High Performance Computing, Modeling & Simulations, GIS for
environmental monitoring and Artificial Intelligent *

Please, save the dates and feel free to circulate this message among your
friends.

*Important dates:*


*Abstract** Submission D**ate**: **01** of **March**, 202**6*

*Notification of Abstract Acceptance: **20 March, 2026*

*Full **Paper Submission D**ate**: **01 **of **April**, 202**6*
* Notification** for Paper Acceptance**: ** 01 **of **May**, 202**6*

*Final paper submission:** 20 of May, 2026*
*Conference Dates: **0**1**-**03** of **June**, 202**6*


*Best regards, **EnviroRISKs*
* Organizing Team E-mail: **envirorisks@gmail.com*


--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* 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] Computability in Europe - CiE 2026, July 27-31. First Call for Papers

Computability in Europe - CiE 2026, July 27-31

Computability in Europe [1] (CiE) is an interdisciplinary series of
international conferences organized by the Association Computability in
Europe [2] (ACiE).

CiE brings together both basic and application-oriented research in
computability-related areas of science. The conference welcomes research
contributions on computability-related fields of science, including
mathematics, theoretical computer science, logic, quantum computability,
cryptography, information theory, computational biology, computational
linguistics, history and philosophy of computability, and many other
related subjects.

After having taken place in Amsterdam (NL) and Lisbon (P) in 2024 and
2025, CiE will move to Trier (D) in 2026 with its 21st edition. Special
features include:

* Colocation with MCU and CCA.

* Accepted contributed papers will be published in an LNCS volume in
the ARCoSS subline.
* Six Special Sessions dedicated to certain aspects of computability.
* Six invited speakers, two tutorial speakers

So, get your papers ready for submission. What to put into your
calendar:

* Abstract deadline: January 29th, 2026
* Full Paper deadline: February 3rd, 2026
* Notification: April 27th, 2026
* Deadline for final papers: May 4th, 2026

Program Committee of CiE 2026:

* Nate Ackerman, Harvard University, USA
* Verónica Becher, Universidad de Buenos Aires, Argentina
* Paola Bonizzoni, Università di Milano-Bicocca, Italy
* Olivier Bournez, Institut Polytechnique de Paris, Ècole
Polytechnique, Palaiseau, France
* Vasco Brattka (PC co-chair), Universität der Bundeswehr Munich,
Germany
* Rod Downey, Victoria University of Wellington, New Zealand
* Damir D. Dzhafarov, University of Connecticut, USA
* Henning Fernau (PC co-chair), Trier University, Germany
* Gilda Ferreira, Universidade Aberta, Portugal
* Lorenzo Galeotti (SC chair), University of Amsterdam, The
Netherlands
* Daniel Graça, University of Algarve, Portugal
* Gabriel Istrate, University of Bucharest, Romania
* Jarkko Kari, University of Turku, Finland
* Lila Kari, University of Waterloo, Canada
* Akitoshi Kawamura, Kyoto University, Japan
* Takayuki Kihara, Nagoya University, Japan
* Florin Manea, University of Göttingen, Germany
* Alberto Marcone, Università di Udine, Italy
* Elvira Mayordomo, Universidad de Zaragoza, Spain
* Wolfgang Merkle, Universität Heidelberg, Germany
* Cécilia Pradic, Swansea University, UK
* Giuseppe Primero, University of Milan, Italy
* Paul Shafer, University of Leeds, UK
* Tomasz Steifer, Polish Academy of Sciences
* Frank Stephan, National University of Singapore
* Manlio Valenti, Swansea University, UK
* Serghei Verlan, University Paris Est Créteil, LACL, France
* Andreas Weiermann, Ghent University, Belgium
* Tomoyuki Yamakami, Fukui University, Japan

Links:
------
[1] https://www.acie.eu/cie-conference-series/
[2] https://www.acie.eu/
**********************************************************
*
* 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, November 13, 2025

[DMANET] Register until Nov 30: Workshop on "Polyhedral Geometry for Neural Networks", March 16-20, 2026, in Nuremberg, Germany

We are organizing a week-long workshop on "Polyhedral Geometry for
Neural Networks" from March 16 to March 20, 2026, in Nuremberg, Germany:
https://neuralpolytopes.gitlab.io/workshop2026/. We welcome your
participation and applications for contributed talks and pitches /
posters. To help us with room planning, please register until November
30, 2025. Limited travel funds are available for young researchers.

List of keynote speakers:

Gennadiy Averkov, BTU Cottbus-Senftenberg
Amitabh Basu, Johns Hopkins University
Christian Haase, Freie Universität Berlin
Katharina Jochemko, KTH Stockholm
Marissa Masden, University of Puget Sound
Anthea Monod, Imperial College London
Daniel Reichman, Worcester Polytechnic Institute
Ngoc Tran, Jump Trading (formerly professor at UT Austin)
Amir Yehudayoff, University of Copenhagen & Technion-IIT

Best regards,
the organizers:

Marie-Charlotte Brandenburg, Ruhr-Universität Bochum
Christoph Hertrich, University of Technology Nuremberg
Georg Loho, Freie Universität Berlin & University of Twente
Moritz Stargalla, University of Technology Nuremberg


**********************************************************
*
* 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 Posters – FoIKS 2026 (Hannover, Germany, March 23–26, 2026)

**


*CALL FOR POSTERS14th International Symposium on Foundations of
Information and Knowledge Systems (FoIKS 2026) Hannover, Germany,
March 23–26, 2026 https://foiks2026.github.io/**.*


https://foiks2026.github.io/


*Apologies if you receive multiple copies of this call.*


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


*FoIKS 2026 invites poster contributions presenting fresh research
ideas in the broad area of information and knowledge systems. Poster
papers need not report mature scientific results; they can also
describe early-stage work, starting points for discussions, or novel
perspectives on known problems.*


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


*IMPORTANT DATES*

*

*


Submission deadline: December 19, 2025

*


Notification: January 19, 2026

*


Final version due: January 26, 2026

*


Conference: March 23–26, 2026


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


SCOPE


Suggested topics include, but are not limited to:

*


Mathematical Foundations of Information and Knowledge Systems:
discrete structures, algorithms, graphs, formal languages

*


Database Design and Management: formal models, dependencies,
transactions, concurrency control

*


Logics in Databases and AI: classical and non-classical logics,
logic programming, description logics, spatial/temporal logics,
argumentation, probability and fuzzy logic

*


Knowledge Representation and Reasoning: logical and non-monotonic
reasoning, reasoning under inconsistency, vagueness, or uncertainty

*


Foundations of Neuro-symbolic Reasoning: embeddings for structured
information (knowledge graphs, logical theories, etc.)

*


Intelligent Agents: multi-agent systems, formal models of
interaction, coalition formation, epistemic reasoning

*


Knowledge Discovery and Information Retrieval: machine learning,
data mining, formal concept analysis, association rules,
information extraction

*


Security in Information and Knowledge Systems: privacy, trust,
access control, secure services, inference control, risk management

*


Integrity and Constraint Management: verification, validation,
consistent query answering, information cleaning

*


Knowledge Graphs and Semi-structured Data: data modelling,
processing, compression, and exchange


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


SUBMISSION GUIDELINES


Poster papers must use the Springer LNCS LaTeX style
(see https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines).
Submissions that deviate substantially from the guidelines may be
rejected without review.

*


Review process: single-blind (submissions are not anonymous).

*


Length: up to 5 pages including all material, i.e. including
references and no additional resources.

*


Submissions: PDF format only (final versions require LaTeX sources).

*


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


Poster papers will undergo a rather lightweight review process. A good
poster paper should include motivation, a clear problem statement, and
initial results or report on work in progress. Preliminary ideas and
modest extensions of previous work are welcome.


At least one author of each accepted poster paper must register for
the conference. Each accepted poster will be presented in a lightning
talk and a poster session at FoIKS 2026.


For inquiries, contact: foiks2026@easychair.org


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


PUBLICATION


Accepted poster papers will appear in the FoIKS 2026 proceedings,
published by Springer in the Lecture Notes in Computer Science (LNCS)
series.


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


INVITED SPEAKERS

*


Giuseppe De Giacomo (University of Oxford)

*


Floris Geerts (University of Antwerp)

*


Wolfgang Nejdl (Leibniz Universität Hannover)

*


Ana Ozaki (University of Oslo)


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


ORGANIZATION


Program Committee Chairs:Anni-Yasmin Turhan (Paderborn University,
Germany)Jonni Virtema (University of Glasgow, UK)


Local Chair:Arne Meier (Leibniz Universität Hannover, Germany)


Publicity Chair:Yasir Mahmood (Paderborn University, Germany)


Local Organizers:Timon Barlag, Nicolas Fröhlich, Vivian Holzapfel,
Rahel Kluge,Laura Strieker, Heribert Vollmer (all Leibniz Universität
Hannover)


Program Committee:Ringo Baumann, Meghyn Bienvenu, Thomas Bolander,
Stefan Borgwardt,Elena Botoeva, Willem Conradie, Fabio Cozman, Thomas
Eiter,Flavio Ferrarotti, Johannes K. Fichte, Valentin Goranko,Guido
Governatori, Marc Gyssens, Miika Hannula, Jelle Hellings,Andreas
Herzig, Martin Homola, Tomi Janhunen, Matti Järvisalo,Gabriele
Kern-Isberner, Sébastien Konieczny, Juha Kontinen,Mena Leemhuis, Joao
Leite, Sebastian Link, Maria Vanina Martinez,Arne Meier, Thomas Meyer,
Daniel Neider, Magdalena Ortiz,Nina Pardal, Elena Ravve, Sebastian
Rudolph, Katsuhiko Sano,Konstantin Schekotihin, Klaus-Dieter Schewe,
Guillermo R. Simari,Jan Van den Bussche, Stefan Woltran, Thomas
Ågotnes, Mantas Šimkus

*

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

[DMANET] IEEE SMARTCOMP 2026: Call for Workshop Proposals

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

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

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

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

Submission Guidelines

Each workshop proposal must include the following:

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

Submission Method

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

Workshop Proposal Submission Deadline: Wednesday, 10 December 2025

Notification of Acceptance: Wednesday, 17 December 2025

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

Workshop Date: Monday, 22nd June 2026

Publication

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

--

Thanks & Regards,
Debasree Das

----

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


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

[DMANET] Dirichlet Postdoctoral Fellowship of the Berlin Mathematical School

The following is a call for applications for a Dirichlet Postdoctoral
Fellowship of the Berlin Mathematical School. Discrete Mathematics is
one of the main research areas of BMS and is well-represented at the
three research universities of Berlin (Freie Universität,
Humboldt-Universität, Technische Universität). Candidates who completed
their PhD recently or will do so by next September are encouraged to apply.

The deadline is the 1st of December.

For more information please visit:
https://www.math-berlin.de/bms-faculty/dirichlet-postdoctoral-program

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