Thursday, November 20, 2025

[DMANET] Academic positions in Mathematical, Statistical, and Computational aspects of AI and ML

The Faculty of Mathematics and the Institute for Mathematical and Computational Engineering (IMC) from the Pontificia Universidad Católica de Chile (PUC Chile) are offering up to two full-time professor positions at the assistant or associate level. The successful candidate will have a joint appointment between the Faculty of Mathematics and the IMC.

We welcome applications from highly qualified candidates with a track record of excellent research and a solid commitment to excellence in teaching and supervision.

This position is intended for those researchers interested in advancing the mathematical, statistical, and computational aspects of modern artificial intelligence, machine learning, and its applications. Candidates conducting research in areas including pure and computational mathematics, mathematical modelling, statistics, optimization, and theoretical computer science, that exhibit a convincing path towards AI research are also encouraged to apply.

The successful candidate will contribute to teaching courses at the Institute for Mathematical and Computational Engineering and the Faculty of Mathematics.

The typical teaching load is three semester-long courses a year, at the graduate or undergraduate level, split between the two academic units. Command of Spanish is not required for applying. The applicant's position and salary will be adjusted according to the policies and regulations at PUC, on the applicant's starting date. These will be determined according to the previous experience of the candidate.

PUC is committed to the values of diversity regarding origin, gender, and ethnicity to build a more diverse and inclusive community. For the current call, women are especially encouraged to apply.

The deadline for the applications is December 16th, 2025.

More information about the application process can be found in the following links:

IMC: https://imc.uc.cl/open-positions-in-mathematical-statistical-and-computational-aspects-of-artificial-intelligence-and-machine-learning/
MathJobs: https://www.mathjobs.org/jobs/list/27675

**********************************************************
*
* 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 Nominations: Autonomous Agents Award 2026

Nominations are solicited for the 2026 ACM SIGAI Autonomous Agents Research Award. This award is made for excellence in research in the area of autonomous agents. It is intended to recognize researchers in autonomous agents whose current work is an important influence on the field. The award is an official ACM award, funded by an endowment created by ACM SIGAI from the proceeds of previous Autonomous Agents conferences. The recipient of the award will receive a monetary prize and a certificate, and will be invited to present a plenary talk at the AAMAS 2026 conference.

***************
How to Nominate
***************

Anyone can make a nomination. Nominations should be made by filling out the below google form, and should consist of a short (< 1 page) statement that emphasizes not only the research contributions that the individual has made that merit the award but also how the individual's current work is an important influence on the field.

NOTE: a candidate can only be considered for the award if they are explicitly nominated. If you believe that someone deserves the award, then NOMINATE THEM -- don't assume that somebody else will!

Nomination Link: https://urldefense.com/v3/__https://forms.gle/RNLZgbbaPQe6TDsb6__;!!PDiH4ENfjr2_Jw!CZcCd9LkjolHdOAXUViCJD-YawpimHnI-gzctltSFrZ24vuBLrFhRxhjZM5d-zHliizVkc3ahODwXNWSY7l9mlaxB5BZaQbd9SqWuCObClA$ [forms[.]gle] [forms.gle]

***************
Important Dates
***************

15 December 2025 -- Deadline for nominations
1 February 2026 -- Announcement of winner
25-29 May 2026 -- AAMAS-2026 conference in Paphos, Cyprus


For any questions please contact Edith Elkind (Award Chair, edith.elkind@northwestern.edu) or Louise Dennis (SIGAI Vice Chair, louise.dennis@manchester.ac.uk).


--
Dr. Louise Dennis (She/Her). Room LF21 Kilburn, Department of Computer Science, University of Manchester, UK.

While I may send emails outside of office hours, I do not expect replies except within office hours.

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

[DMANET] Postdoc Position at LiU and SU in Sweden

We are seeking an outstanding postdoc to lead a project at the interface of computational mathematics, data science, and materials science. You will develop methods and software to enable new quantitative characterization of nanoscale materials, with a focus on the spatial arrangement of nanoparticles on porous materials. This work is a collaboration between the Hellmuth group (computational mathematics, Stockholm University) and the CATSA group (materials science, Linköping University).

Details can be found here:
https://liu.se/en/work-at-liu/vacancies/27747

Contact persons
*Marc Hellmuth, Associate Professor (Stockholm University)
<marc.hellmuth@math.su.se>

*Alexander Holm
Biträdande universitetslektor
<alexander.holm@liu.se>

Deadline for Application: December 1, 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] [CFP] The 35th International Conference on Computer Communications and Networks (ICCCN 2026) July 27 - 30, 2026, Honolulu, Hawaii USA

*** Please accept our apologies if you receive multiple copies of this CFP
***

CALL FOR PAPERS (ICCCN 2026)

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

The 35th International Conference on Computer Communications and Networks
(ICCCN 2026)
July 27 - 30, 2026, Honolulu, Hawaii USA
http://www.icccn.org/icccn26/
****************************************************************************************

ICCCN 2026 is Technically Co-Sponsored by the IEEE and IEEE Communication
Society.

The paper submission site will be opened in December 2025.

IMPORTANT DATES: Paper submission due: February 13, 2026

ICCCN is one of the leading international conferences for presenting novel
ideas and fundamental advances in the fields of computer communications and
networks. ICCCN serves to foster communication among researchers and
practitioners with a common interest in improving computer communications
and networking through scientific and technological innovation.

ICCCN 2026 will be conducted in person.

Scope:

The primary focus of the ICCCN 2026 conference is on new and original
research results in the areas of design, implementation, and applications
of computer communications and networks. ICCCN 2026 covers the following
technical Tracks (the detailed Track scope and descriptions are posted at
http://www.icccn.org/icccn26/committeesandtracks/technical-tracks/index.html
):

Track 1: Infrastructure Networking Technologies
• Dimitrios Pezaros, University of Glasgow, UK
• Ananthram Swami, DEVCOM Army Research Laboratory
• Feng Wang, Arizona State University

Track 2: Network Architecture, Algorithm, Protocol, and Evaluation
• Berk Canberk, Edinburgh Napier University, United Kingdom
• Kanchana Thilakarathna, University of Sydney
• Murat Yuksel, University of Central Florida

Track 3: IoT and Cyber-Physical Systems
• Fatemeh Afghah, Clemson University, USA
• Chiu Tan, Temple University
• Lei Xie, Nanjing University, China

Track 4: Edge and Cloud Computing
• Oliver Bringmann, Eberhard Karls Universität Tübingen, Germany
• Virginia Pilloni, University of Cagliari, Italy
• Yifan Zhang, Binghamton University

Track 5: Mobile/Pervasive Communications, Networking and Sensing
• Hao Han, Nanjing University of Aeronautics and Astronautics, China
• Tamer Nadeem, Virginia Commonwealth University
• Wei Wang, San Diego State University, USA

Track 6: Social Networks, Extended Reality, and Metaverse
• Bin Li, Penn State University, USA
• Yao Liu, Rutgers University
• Muhammad Shahzad, North Carolina State University

Track 7: AI/ML for Networks & Networks for AI/ML
• Ahmed Alkhateeb, Arizona State University
• Longfei Shangguan, University of Pittsburgh
• Cheng Zhang, Texas A&M University
• Yanfu Zhang, William & Mary

Track 8: Security, Privacy, and Trust
• Xinwen Fu, University of Massachusetts at Lowell
• Isabel Wagner, University of Basel, Switzerland
• Shucheng Yu, Yeshiva University, USA
• Chuan Yue, Colorado School of Mines

Track 9: Emerging Topics in Networking (e.g., Quantum Networking,
Distributed Quantum Computing, Distributed Machine Learning)
• Trung Q. Duong, Memorial University, Canada
• Nirmalaya Roy, UMBC, USA
• Jindi Wu, DePaul University, USA

PAPER SUBMISSION:

MAIN CONFERENCE:

Submitted manuscripts must be formatted in standard IEEE camera-ready
format (double-column, 10-pt font) and must be submitted via EasyChair (
https://easychair.org/conferences/?conf=icccn2026; this site will accept
paper submissions soon in due time) as PDF files (formatted for 8.5×11-inch
paper). The manuscripts should be no longer than 8 pages including all
figures/tables and references. Submitted papers should not be previously
published in or be under consideration for publication in another
conference or journal. Paper titles and/or author names cannot be changed
and/or added to the papers after the submission deadline or in the
camera-ready version if accepted. The Program Committee reserves the right
to not review papers that either exceed the length specification or have
been submitted or published elsewhere. Submissions must include a title,
abstract, keywords, author(s) and affiliation(s) with postal and e-mail
addresses. Note: ICCCN'26 will select Best Paper and a runner-up paper to
recognize the research quality and excellence. The Program Committee
reserves the right to recommend some borderline conference papers to be
accepted as short papers in the conference (the short papers should be no
longer than 6 pages including all figures/tables and references).

REVIEW and PUBLICATION of MANUSCRIPTS:

Submitted papers will be reviewed by the TPC and judged on originality,
technical correctness, relevance, and quality of presentation (the review
process is single-blind). An accepted paper must be presented at the
conference venue by a registered author at the full registration rate. Each
full registration covers up to two conference papers authored by the
registered author. If the originally registered author is unable to attend
the conference due to extenuating circumstances, he/she must explicitly ask
for the transfer of registration to one of the other authors of the paper.
Please note that an author's registration cannot be transferred to a
nonauthor presenter under any circumstances. Accepted and presented
(onsite) papers will be published in the conference proceedings and IEEE
Xplore.

WORKSHOPS:

ICCCN 2026 workshops are exciting forums to present, discuss, and formulate
specialize topics and emerging hot research topics (new areas, new problems
or new methods). The workshops offer a perspective distinct from and
complementary to the research themes of the main conference. Workshop
papers should be no longer than 6 pages including all figures/tables and
references. The detailed info can be found in each workshop's Call for
Papers from (http://www.icccn.org/icccn26/workshop/list-of-workshops/). For
any questions or additional information, please contact the Workshop
General or Workshop Program Chairs.

POSTER PAPERS:

ICCCN 2026 provides an opportunity to present in-progress work in the
fields of computer communications and networks. Topics of interest are the
same as the research topics in the ICCCN 2026 main conference Call for
Papers. Early implementations, prototypes, work-in-progress
systems/applications as well as commercial products that are related to the
topics are welcome. Presenting a poster is an effective way to obtain early
and valuable feedback from a knowledgeable crowd at the conference. Posters
must be formatted in standard IEEE camera-ready format (double-column,
10-pt font). Each poster submission must be no longer than 2 pages
including all figures/tables and references.

IMPORTANT DATES: All times below are 11:59 pm (Hawaii, USA);

Conference and Poster papers:
• Paper submission due: February 13, 2026
• Poster Paper submission due: March 29, 2026
• Acceptance Notification: April 24, 2026
• Conference date: July 27 -30, 2026

Workshop papers:
• Paper submission due: March 1, 2026
• Acceptance Notification: April 29, 2026
• Workshop date: July 29 - 30, 2026

All (conference/poster/workshops) Camera-Ready Papers Due: May 11, 2026
(Hard deadline)

Please refer to "Author Information" posted at the conference website for
more info on paper submission, presentation and related rules/policies.

Submission Link: https://easychair.org/conferences/?conf=icccn2026

CONFERENCE ORGANIZING COMMITTEE

Executive Chair: Krishna Kant, Temple University, USA (kkant@temple.edu)

General Chair: Ruidong Li, Kanazawa University, Japan (liruidong@ieee.org)

TPC Co-Chairs:
Qun Li, William & Mary, USA (liqun@cs.wm.edu)
Danda Rawat, Howard University, USA (danda.rawat@howard.edu)

Workshops General Chair:
Kewei Sha, University of North Texas, USA (comersha@gmail.com)

Poster Chair:
Wenjia Li, New York Institute of Technology, USA (wli20@nyit.edu)

Local Arrangement Chair:
Prof. Yi Zhu, Hawai'i Pacific University, USA (yzhu@hpu.edu)

Publications Co-Chairs:
Wei Tong, Nanjing University,China (wtong@nju.edu.cn)
Zhengrui Qin, Northwest Missouri State University, USA (zqin@nwmissouri.edu)

Publicity Co-Chairs:
(America) Mostafa Fouda, Idaho State University, ID, USA (mfouda@ieee.org)
(Europe) Zhengxin Yu, Lancaster University, U.K. (z.yu8@lancaster.ac.uk)
(Asia) Qiao Xiang, Xiamen University, China (qiaoxiang@xmu.edu.cn)
(Oceania) Wei Xiang, La Trobe University, Australia (W.Xiang@latrobe.edu.au)

Publicity Chair for Workshops:
Zongxin Xie from Kennesaw State University, USA (zxie1@kennesaw.edu)

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

[DMANET] Full Professor (W2) in Industrial Mathematics

RWTH Aachen University is inviting applications for the position of full
professor (W2) in the area of

    Industrial Mathematics

to be filled as soon as possible. Candidates are expected to have
distinguished expertise and a visible research agenda in the field of
applied mathematics with implementation-oriented industrial relevance.
Relevant research topics include data-integrated simulation methods,
methods for artificial intelligence, modeling, optimization, optimal
control, inverse problems or imaging.

More details of the position and how to apply can be found at RWTH
appointment portal:

https://berufungsportal.rwth-aachen.de/

Deadline for application is December 22, 2025.

Kind regards,

Arie Koster

--
Prof. Dr. Arie M.C.A. Koster
Professor for Discrete Optimization
RWTH Aachen University
Pontdriesch 10-12, room 306 (2.0G), D-52062 Aachen
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct) - F: +49 (0)241 80-92136
email <mailto:koster@math2.rwth-aachen.de> | www
<http://www.math2.rwth-aachen.de/koster/> | Google scholar
<https://scholar.google.com/citations?user=AAsK4wwAAAAJ&hl=en> | X
<https://x.com/ArieMCAKoster> | LinkedIn
<https://www.linkedin.com/in/ariekoster/>
**********************************************************
*
* 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] Applications Open — International Summer School on Generative AI (June 22–26, 2026)

Dear colleagues,

We are pleased to announce that applications are now open for *the
International Summer School on Generative AI: From NLP to LLMs to Agentic
AI — Theory, Applications, and Practice*, taking place June 22–26, 2026 at
Sapienza Università di Roma (Rome, Italy) in a hybrid format (in-person &
online).

The school offers an intensive program covering foundational concepts and
the state of the art in Natural Language Processing, Large Language Models,
and Agentic AI. Sessions include lectures, keynotes, and hands-on labs led
by experts from academia and industry, including the University of
Cambridge, Trent University, Napoli University, Malaga University, IBM,
Microsoft, Google, Red Hat, Inria, and others.

Why This Summer School is a Career Investment:

Learn from the Pioneers: Move beyond theory. Our curriculum is taught by
the very researchers and engineers driving innovation at the world's most
influential tech giants and academic institutions.

Network with the Best: Connect with a global cohort of high-caliber peers
and faculty, building professional relationships that will propel your
career forward.

Master the Cutting Edge: Dive deep into the architectures and methodologies
powering the next generation of AI.

*Highlights*

-

Trace the evolution from NLP → LLMs → Agentic AI
-

Join practice-oriented sessions and group projects
-

Connect with a diverse, international community of researchers and
innovators

*Capacity & admissions*

-

*Limited in-person seats: 50*
- *The** school is equevilant to **5 ECTS credits (**University
certificate**)*
-

*Rolling admissions* (applications reviewed as received) — early
applications are encouraged


Don't just keep up with the AI revolution—lead it.
👉 Learn more and apply now, visit the official page here:
https://intelligent-systems.net/school/index.php

We would be grateful if you could share this announcement with interested
students, researchers, and professionals in your network.

Regards,
Jamal Toutouh
On behalf of the summer school Organizing Committee
International Summer School on Generative AI
https://intelligent-systems.net/school/
----

*Prof. Jamal Toutouh*Vice Dean & Tenured Professor
- University of Málaga – jamal@uma.eshttps://neo.lcc.uma.es/new/
Research Affiliate
- Massachusetts Institute of Technology – toutouh@mit.edu
http://alfagroup.csail.mit.edu/

🌐 website: jamal.es
🐦 twitter: @jamtou

---

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

[DMANET] SOFSEM 2026 -- Call for Posters

51st International Conference on Current Trends in Theory and Practice
of Computer Science

February 9–13, 2026, Kraków, Poland

https://sofsem.uj.edu.pl

Poster Deadline: December 1, 2025 AoE
Poster Notification: December 8, 2025
Poster Camery-Ready: December 15, 2025

If you have some late-breaking or preliminary results, or want to give
your Ph.D. students a first chance to participate in a conference,
consider submitting (via Easychair) a 2-page abstract (LNCS style,
including references). Additionally, you can (but you don't have to)
upload a draft of the poster itself, in order to get feedback from
members of the program committee.

Poster abstracts will appear in the conference proceedings (LNCS) but
will not be considered properly reviewed publications, so full papers
can later be submitted to other conferences.

Posters must be presented in the poster session of the conference.

Early registration fees will be ~500 EUR (full) and ~400 EUR (student),
including lunches. Affordable accommodation (~55 EUR single, ~66 EUR
double room per night) in the immediate vicinity of the conference
location is available.

Submission page: https://easychair.org/conferences/?conf=sofsem2026

--

Invited Speakers

* Jarosław Błasiok, ETH Zurich, CH
* Jarosław Byrka, University of Wrocław, PL
* Sandra Kiefer, University of Oxford, UK
* Linda Kleist, Potsdam University, DE
* Jukka Suomela, Aalto University, FI
* Philip Wadler, University of Edinburgh, UK

Tradition

SOFSEM is an annual winter conference devoted to the theory and
practice of computer science. The conference traditionally focuses on
the latest results and developments of fundamental research in
computer science (informatics), inspired by the algorithmic challenges
of our time. SOFSEM has a long tradition as a high-quality research
conference, and a venue where researchers from academia and industry
in all stages of their career can share their insights.

Topics

The program committee encourages submission of original research
papers in all areas of foundations of computer science and artificial
intelligence, including e.g.

– algorithm engineering,
– algorithms and data structures,
– theory of machine learning and data science,
– automata, languages, rewriting systems,
– combinatorial optimization,
– combinatorics on words,
– computability, decidability, models of computation,
– computational complexity,
– computational geometry,
– cryptography and security,
– logic in computer science,
– games and online algorithms,
– graph drawing,
– graph algorithms,
– mathematical programming,
– network science,
– parallel and distributed computing,
– parameterized complexity,
– probabilistic and analytic methods in computer science,
– quantum computing,
– robotics,

and other relevant theory topics in computing and AI.

**********************************************************
*
* 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 - First Call for Papers

--------------------------------------------------------------------------------------
FIRST 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 23, 2026, 23:59 (anywhere on Earth)
* Paper submission deadline: January 30, 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 instructions will be published soon on the conference website.

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


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
* 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
Claus Fieker           University of Kaiserslautern, Germany
Ruyong Feng           Chinese Academy of Sciences, China
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] SMARTCOMP 2026: Call for Research Papers

Call for Research Papers

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

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

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

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

Main Research Track

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

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

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

Important Dates

Paper Submission: 1st February 2026

Acceptance Notification: 15th April 2026

Camera Ready (tentative): 22th April 2026

Conference: 22 to 25 June 2026

All deadlines are Anywhere on Earth.

Submission Guidelines

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

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

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

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

The conference applies a single-blind review process.

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

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

Paper registration opens on November 1st, 2025

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

________________________________

BEST PAPER AWARD and Editorial Follow-Ups

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

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

Technical Program Committee Co-Chairs

Daniela Nicklas

George Roussos

Contact Information

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


Thanks & Regards,
Debasree Das

----

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


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

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

CORRECTED DEADLINE below (apologies to everybody)
--------------------------------------------------

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 19, 2025 (late applications sent before
January 5, 2026 might be also taken into account). 

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 [kam.mff.cuni.cz]>.
Maria Saumell, email <maria.saumell at fit.cvut.cz [fit.cvut.cz]>

Information about the project:
https://kam.mff.cuni.cz/digeo/ [kam.mff.cuni.cz]
**********************************************************
*
* 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 Nominations for Invited Talks at HALG 2026

The IGAFIT Highlights of Algorithms (HALG) 2026 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks:

A. survey (50 minutes): a survey of an algorithmic topic that has seen exciting developments in last couple of years.

B. paper (30 minutes): a significant algorithmic result appearing in a paper in 2025 or later.

To nominate, please fill in the form at https://go.epfl.ch/halg2026

All nominations will be reviewed by the Program Committee (PC) to select speakers that will be invited to the conference.

Nominations deadline: 19th December 2025.

Please keep in mind that the conference does not provide financial support for the speakers.
**********************************************************
*
* 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 Research Opportunity: Invitation for CSC Scholarship Applications in Computer Science

I am inviting exceptional candidates to submit research proposals for a
competitive PhD position at Department of Computer Science, Loughborough
University, with the intent of supporting a joint application to the *China
Scholarship Council (CSC) Joint Scholarship Scheme.*

The successful candidate will be nominated to receive a *full tuition fee
waiver* from Loughborough University, enabling them to apply for the living
stipend through the CSC.

The project is focused on fundamental questions in *Artificial Intelligence*
relating to *autonomous and adaptive systems*. We seek highly motivated
candidates interested in submitting a research proposal aligned with one or
more of the following core areas:

1. *Embodied Intelligence* and *Evolutionary Robotics*: Designing AI
control algorithms for flexible and compliant systems that learn through
physical interaction.

2. *Bio-inspired optimization/intelligence*: Developing decentralized,
multi-agent AI for collaborative tasks and complex system control.

3. *Evolutionary Computation:* Utilizing advanced algorithms to
autonomously design and optimize robot morphology and control architectures.
-

Applicants must hold a *First-Class Honours degree* or a *Distinction at
Master's level* (or equivalent) in Computer Science, AI, Robotics, Control
Engineering, or a closely related discipline.
-

The applicant must be a Chinese national and meet all requirements for the
CSC scholarship application.
-

Please send your application (ideally as a single PDF file) by email to Dr.
Yue Xie (Y.Xie4@lboro.ac.uk) including: *A cover letter with a brief
research proposal* outlining your specific research interest within the
topics listed above. *A detailed CV (2-3 pages). Please send the email
before the end of November to show your interest.*

**********************************************************
*
* 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] StringMasters @ Yamanashi December 4

Dear friends and colleagues,

I am pleased to announce a StringMasters workshop taking place on
Thursday, December 4, 2025, in Yamanashi, Japan.
Registration is free, but seats are limited.

Details: https://cowasp.github.io/

We hope to see you in Yamanashi in December.


Best,

Dominik and Francesco
**********************************************************
*
* 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] 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/
*
**********************************************************