Sunday, October 26, 2025

[DMANET] postdoc positions in Algorithms and Complexity IRIF Paris France

The algorithms and Complexity group ( https://www.irif.fr/en/equipes/algocomp/index ) of IRIF (CNRS and Université de Paris), Paris, France, ( https://www.irif.fr/en/index ) is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, distributed algorithms, communication complexity, query complexity, cryptography (including post-quantum cryptography), computational game theory, quantum computing, quantum algorithms, quantum communication, computational applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (French National Center for Scientific Research) and Universite Paris Cite. For more information about IRIF, please see https://www.irif.fr/en/index , and for more information about the Algorithms and Complexity group please see https://www.irif.fr/en/equipes/algocomp/index . Further information may be obtained from any of the permanent members of the group.

The starting date of the position(s) will usually be in September-October 2026 but may be negotiated.

The position(s) will be financed either by the group's own resources, or via joint applications of the candidate and the group to external funding sources. Applications should consist of a CV including list of publications, a summary of research, and names and emails of at least three references. Please see more details about the application process at https://www.irif.fr/en/postes/postdoc .

Applications should be received by November 2, 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/
*
**********************************************************

Saturday, October 25, 2025

[DMANET] AIces 2026: early registration November 8

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

1st INTERNATIONAL SCHOOL ON THE COGNITIVE, ETHICAL AND SOCIETAL DIMENSIONS OF ARTIFICIAL INTELLIGENCE

AIces 2026

Porto – Maia, Portugal

March 30 – April 3, 2026

https://aices.irdta.eu/2026/

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

Co-organized by:

University of Maia

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

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

Early registration: November 8, 2025

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

SCOPE:

AIces 2026 will be the first in a series of research training events aiming at updating participants on the most recent multidisciplinary discussions about the foundations, meaning, challenges and risks of AI.

The event will have a global scope along 3 thematic lines: cognition, ethics, and society. It will cover current debates about: AI and philosophy of mind; cognitive architectures; machine learning and cognitive development; large language models and visual information; robotics and embodied cognition; neuroscience-inspired AI; algorithmic bias and fairness; transparency and explainability; accountability and responsibility; privacy and surveillance; autonomy and control; AI impact on human values and social inequalities; the future of work and automation; governance, regulation and public policies; AI, human rights and democracy; AI and global development; information and AI education.

The event will consist of 12 courses, 2 keynote lectures, 1 round table, 1 symposium collecting short contributions from participants, and 3 open thematic debate sessions. 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:

Graduate students, postgraduate students and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees, so 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, AIces 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:

AIces 2026 will take place in Porto, the second largest city in Portugal, recognized by UNESCO in 1996 as a World Heritage Site. The venue will be:

University of Maia
Avenida Carlos de Oliveira Campos - Castêlo da Maia
4475-690 Maia
Porto, Portugal

https://www.umaia.pt/en

STRUCTURE:

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

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.

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

KEYNOTE SPEAKERS:

David Danks (University of Virginia), Trustworthy AI in an Untrustworthy World

Ming Lin (University of Maryland), Socially Responsible and Trustworthy AI

PROFESSORS AND COURSES: (to be completed)

Ricardo Baeza-Yates (Barcelona Supercomputing Center), [introductory] Introduction to Responsible AI

Thomas Breuel (Nvidia Research), [introductory] Facts and Rules in LLMs

Carlos Castillo (Pompeu Fabra University), [introductory] Algorithmic Fairness in High-Risk AI Applications

Alan Dix (Cardiff Metropolitan University), [introductory] AI for Social Justice

Elia Formisano (Maastricht University), [introductory/intermediate] Auditory Cognition in Humans and Machines

Marijn Janssen (Delft University of Technology), [introductory/advanced] Data and AI Governance - From Control to Trust

Christian Lebiere (Carnegie Mellon University), [intermediate] Computational Cognitive Models of Human-AI Teaming

Paul Smolensky (Johns Hopkins University), [intermediate/advanced] Symbol Processing in Transformers and Other Neural Networks

Savannah Thais (City University of New York), [intermediate/advanced] Measurement for Safer AI

SYMPOSIUM:

A half-day symposium will collect 10-minute voluntary presentations by participants on any of the 3 thematic areas of the event. A 1-page abstract containing the title, authors, and summary of the presentation must be sent to david@irdta.eu by February 28, 2026.

OPEN DEBATES:

A 3-hour open debate session will be organized for each of the 3 thematic areas of the school: cognition, ethics and society. Expressions of interest to lead the respective sessions will be accepted until December 30, 2025 at david@irdta.eu . A 2-page description must be sent including the topics to be debated as well as the structure, call for contributions and dynamics of the session.

SPONSORS:

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

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

ORGANIZING COMMITTEE:

Samuel Anjos (Maia, social networks)
Osheen Jain (London, communications)
José Paulo Marques dos Santos (Maia, local chair)
Carlos Martín-Vide (Tarragona, program chair)
Santiago Montes (Tarragona, webpage)
Sara Morales (Luxembourg)
José Luís Reis (Maia)
Luís Paulo Reis (Porto)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://aices.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://aices.irdta.eu/2026/accommodation/

CERTIFICATE:

A certificate of successful participation in the event will be delivered indicating the number of hours of academic activities. 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:

Universidade da Maia

Universidade do Porto

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, October 24, 2025

[DMANET] SAND 2026 - First Call for Papers

======================================
SAND 2026: First Call for Papers
======================================

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

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

Submission deadline: February 24, 2026, 23:59 AoE
Notification: mid-April 2026
Camera-ready: May 2026
Conference: July 1-3, 2026

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

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

Topics of interest include, but are not limited to:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Organizing Committee:

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

Steering Committee:

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

Advisory Board:

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

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

[DMANET] Tenure-track position - Assistant Professor Data Science, UBC Okanagan

The University of British Columbia Okanagan is hiring an Assistant
Professor in the Computer Science, Mathematics, Physics and Statistics
Department.

Candidates are expected to have expertise in an area related to the theory
or applications of data science. Such areas include applied optimization,
Bayesian inference, big data analysis (especially as applied within
astronomy or medical physics), computational statistics, data
visualization, deep learning or statistical learning, nonparametric
modelling, sampling and data collection, spatial and temporal data
analysis, statistical finance, or unsupervised/semi-supervised machine
learning.

Full details of the call can be found at:
https://ubc.wd10.myworkdayjobs.com/en-US/ubcfacultyjobs/job/Assistant-Professor---Data-Science_JR22381

The application deadline is *November 30, 2025*.

The intended start date is July 1, 2026 or shortly thereafter.

We look forward to your applications,

--

*Amy Wiebe, PhD (she/her)*

Assistant Professor, Mathematics
The University of British Columbia | Okanagan Campus | Syilx Okanagan
Nation Territory

www.amywiebe.ca

ph. 250 807 8806

--

**********************************************************
*
* 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 in Brno, Czechia

Dear all, 


I am pleased to announce that I am recruiting a postdoctoral researcher in
Mathematics/CS on my MASH project "Topological Methods in Discrete
Mathematics".

Overview of the project can be found on my website
(https://sites.google.com/view/marek-filakovsky). Applicants should have
some background in areas related but not restricted to Algebraic Topology
and Discrete Mathematics (CSP, Graph Theory and Combinatorics). Programming
skills are welcome.

The successful applicant will further be able to pursue their independent
research and collaborate with math and cs groups in Brno, Czechia. 
Additionally, a broader networking connection is available with groups in
the Central European region - Budapest, Dresden, Leipzig, Prague, Vienna and
beyond.

The application deadline for this position is 30 November 2025, with a
flexible start date in 2026. All terms, funding information, and additional
details are available on the application site https://www.muni.cz/en/about-
us/careers/vacancies/79917
 
(https://www.muni.cz/en/about-us/careers/vacancies/79917)as well as at
researchjobs and euraxess.

Informal inquiries about the position can be sent to marekf(at)mail(dot)muni
(dot)cz, subject = "Job call 2026".


Please circulate this to anyone in your network who may be interested.

Best Wishes, 


Marek Filakovský

**********************************************************
*
* 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] [EvoCOP 2026] Call for Papers

(Apologies for cross-posting)

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

Last Call for Papers:
EvoCOP 2026 -- The 26th European Conference on
Evolutionary Computation in Combinatorial Optimisation

https://www.evostar.org/2026/evocop/

April 8--10, 2026
held as part of EvoStar (https://www.evostar.org)

Venue: Toulouse, France

** EvoCOP is CORE Rank B **

Submission deadline: November 1, 2025
*************************************************************************************


The 26th European Conference on Evolutionary Computation in
Combinatorial Optimisation
is a multidisciplinary conference that brings together researchers
working on applications
and theory of evolutionary computation methods and other metaheuristics
for solving
difficult combinatorial optimisation problems appearing in various
industrial, economic,
and scientific domains.

Successfully solved problems include, but are not limited to,
multi-objective, uncertain,
dynamic and stochastic problems in the context of scheduling,
timetabling, network design,
transportation and distribution, vehicle routing, stringology, graphs,
satisfiability,
energy optimisation, cutting, packing, planning, and search-based
software engineering.

Successfully addressed theoretical and translational challenges
encompass, but are not
limited to, the development and analysis of novel (components of)
evolutionary and other
metaheuristic algorithms, work on neighbourhood and landscape
structures, problem-agnostic
and problem-specific variation operators, parallelisation strategies,
and hybridizations. ⁠

The EvoCOP 2026 conference will be held together with EuroGP (the 29th
European Conference
on Genetic Programming), EvoMUSART (the 15th European conference on
evolutionary and
biologically inspired music, sound, art and design) and EvoApplications
(the 29th European
Conference on the Applications of Evolutionary Computation), in a joint
event collectively
known as EvoStar (Evo*).

Accepted papers will be published by Springer Nature in the Lecture
Notes in Computer
Science series. Previous proceedings can be found in the EvoCOP
Conference Proceedings in
SpringerLink.

The best regular paper presented at EvoCOP 2026 will be distinguished
with a Best Paper
Award.

EvoCOP conference is ranked B in the CORE 2021 ranking:
http://portal.core.edu.au/conf-ranks/2195/

**** Areas of Interest and Contributions ****

EvoCOP welcomes submissions in all experimental and theoretical aspects
of evolutionary
computation and other metaheuristics to combinatorial optimisation
problems, including
(but not limited to) the following areas:
* Applications of metaheuristics to combinatorial optimization problems
* Theoretical developments
* Neighborhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Constraint-handling techniques
* Parallelization and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Automatic algorithm configuration and design

Prominent examples of metaheuristics include (but are not limited to):
* Evolutionary algorithms
* Estimation of distribution algorithms
* Swarm intelligence methods such as ant colony and particle swarm
optimisation
* Artificial immune systems
* Local search methods such as simulated annealing, tabu search,
variable neighborhood
  search, iterated local search, scatter search and path relinking
* Hybrid methods such as memetic algorithms
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Surrogate-model-based methods

Notice that, by tradition, continuous/numerical optimisation is *not*
part of the topics
of interest of EvoCOP. Interested authors might consider submitting to
other EvoStar
conferences such as EvoApplications.


**** Submission Details ****

Paper submissions must be original and not published elsewhere. The
submissions
will be peer-reviewed by members of the program committee. The reviewing
process will be double-blind, please omit information about the authors
in the
submitted paper.

Page limit: 14 + unlimited pages for references and acknowledgments

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

The authors of accepted papers will have to improve their paper on the
basis of
the reviewers' comments and will be asked to send a camera-ready version of
their manuscripts. At least one author of each accepted work has to
register
for the conference, attend the conference and present the work.

**** Important Dates ****

Submission deadline: November 1, 2025
EvoStar: April 8--10, 2026

**** EvoCOP Programme Chairs ****

Martin Krejca
Ecole Polytechnique, IP Paris, France
martin.krejca@polytechnique.edu

Nelishia Pillay
University of Pretoria, South Africa
nelishia.pillay@up.ac.za

Please check the website for more information: http://www.evostar.org/
And follow us at: X -- https://x.com/EvostarConf and Instagram --
https://www.instagram.com/evostarconference/
Follow SPECIES at: https://www.linkedin.com/company/species-society/
**********************************************************
*
* 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, October 23, 2025

[DMANET] Post-FOCS Workshop on Trends in Approximation and Online Algorithms

December 18-19, 2025
University of Sydney, Australia
https://sites.google.com/view/tao25workshop/home

Registration deadline: December 1, 2025 (AOE)

This is a free 2-day workshop, right after FOCS 2025, to discuss recent advances in approximation and online algorithms for
network design and related areas. This is the 10th iteration of the Flexible Network Design workshop series (see
https://www.cs.umd.edu/fnd2018 for the previous iteration).

The workshop will have a mix of talks---including two plenary talks by MohammadTaghi Hajiaghayi on beating 2-approximation for Steiner forest, and Jarek
Byrka on recent advances on bidirected cut relaxations---as well as a Wiki Edit-A-Thon and an Open Problem Session.

Students, faculty, and researchers of all seniority levels are welcome.

Organizers:
Julian Mestre, University of Sydney
R. Ravi, CMU
William Umboh, University of Melbourne


**********************************************************
*
* 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] 1st Announcement of the Fifth edition of the Workshop Metabolism and mathematical models: Two for a tango

Dear all,

This is the first announcement for the 5th Edition of the workshop "Metabolism and
mathematical models: Two for a tango" that will take place on November 20-21, 2025.
The workshop will be virtual as was the case for the 1st, 2nd, 3rd, and 4th Editions.

The topic of the workshop is metabolism in general. Besides an exploration of the
biological, biochemical and biomedical aspects of metabolism, the workshop will also aim
at presenting some of the mathematical modelling, algorithmic theory and software
development that have become crucial to explore such aspects.

More details will be provided soon but initial information may be already found on
this page:
https://team.inria.fr/erable/en/events/workshop-metabolism-and-mathematical-models-two-for-a-tango-5th-edition/

As you can see, we'll be very happy to have six Keynote speakers:

Kai Blin, Novo Nordisk Foundation Center for Biosustainability, Denmark
Tobias Engl, Max Planck Institute for Chemical Ecology, Germany
Ronan Fleming, University of Galway, Ireland
Alicia Kowaltowski, University of São Paulo, Brazil
Alejandra Pietro Davó, National Autonomous University of Mexico, Mexico
Jean-Marc Schwartz, University of Manchester, UK

Besides the talks given by the above Keynote speakers, there will be two sessions,
one per day, of 30 minutes each, dedicated to a discussion of some specific open
questions. More details on these will be provided very soon.

The workshop will take place in the afternoons, from 2pm to 5:30pm CET time.

Registration is free but is required. To register, go to this link:
https://grist.numerique.gouv.fr/o/docs/forms/bkmfah9zzTaVGxevqpJRAJ/55.

If you are interested, keep tuned, both to your mails for the second announcement
with all information, and to the web page of the workshop.

Do not hesitate to spread the news widely among your colleagues and to post the
announcement in lists you may know.

Cheers from the organisers,

Mariana Galvão Ferrarini (Max-Planck Institute for Chemical Ecology, Germany)
Sabine Peres (Univ. of Lyon 1, CNRS and Inria, France)
Marie-France Sagot (Inria, CNRS and Univ. of Lyon 1, France)
Ariel Silber (Dept. of Parasitology, Institute of Biomedical Sciences, Univ. of São Paulo, Brazil)
Susana Vinga (Instituto Superior Técnico and INESC-ID, Lisbon, Portugal)
**********************************************************
*
* 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 in Cryptography - University of Primorska, Slovenia

The Departments of Mathematics at the University of Primorska (FAMNIT and
IAM) invite applications for a *postdoctoral researcher position in
Cryptography* under the supervision of Prof. Enes Pasalic.

The project aims to explore and strengthen the theoretical and practical
relationships between special classes of functions — such as bent,
plateaued, and almost perfect nonlinear (APN) functions — and the design of
linear codes with prescribed properties useful for cryptography, including
minimal, self-orthogonal, LCD and optimal codes.

*The research focuses on:*
Studying algebraic and combinatorial links between Boolean/vectorial
functions and linear codes;
Constructing new families of linear codes derived from known or newly
designed functions;
Analysing code parameters, weight distributions, and dual structures;

*Conditions*

*Duration: 1 yearStarting date: by April 2026 at the latest*
Host: UP FAMNIT, University of Primorska, Slovenia
Supervisor: Prof. Enes Pasalic
*Deadline for application: November 10th 2025*

*Requirements*
PhD in Mathematics or a related field (obtained or expected before the
start date);
Research experience or strong interest in coding theory, Boolean and
vectorial functions, finite fields, or computational algebra;
Proficiency in computer algebra systems (Magma, SageMath, GAP) is highly
desirable;
Excellent written and spoken English.

To apply, please email the following documents to razpisi.famnitiam@upr.si
with the subject line "University of Primorska Postdoc 2025 - Enes Pasalic":

Curriculum Vitae,
Publication List,
Research Statement,
Copies of at most three recent papers or preprints,
Names and e-mail addresses of two or three persons who can be contacted for
reference (and who have agreed to be contacted).

More details:
https://www.famnit.upr.si/en/news/postdoctoral-positio-4

**********************************************************
*
* 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] IPDPS 2026: Call for Tutorials

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

 Call for Tutorials — IPDPS 202640th IEEE International Parallel &
Distributed Processing SymposiumMay 25–29, 2026 • New Orleans,
USA www.ipdps.org

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


IPDPS 2026 Call for Tutorials


The 40th IEEE International Parallel and Distributed Processing
Symposium (IPDPS 2026), which will be held in New Orleans, USA from May
25 to 29, 2026 invites proposals for half-day and full-day tutorials.


Important Dates


Submission Deadline:November 27, 2025

Notification:January 22, 2026

Handout/Slides (available):May 4, 2026

Handouts/slides will be made available to registered attendees on the
conference website.


Topics


Topics of interest follow those in the IPDPS 2026 - Call for Papers
(https://www.ipdps.org/ipdps2026/2026-call-for-papers.html), i.e., all
aspects of parallel and distributed computing, including but not limited
to: algorithms, applications, architectures, machine learning and
artificial intelligence, measurements and experiments, programming
models, and system software.


Tutorials on best practices, tools, and techniques for conducting
research in parallel and distributed computing are particularly
encouraged, including topics such as the reproducibility and
replicability of research results, open science, open-source software,
and open data.


Format


A tutorial can be either a half-day (3 hours) or a full-day (6 hours)
session.


Submission Guidelines


A LaTeX template for the tutorial proposal can be accessed through the
IPDPS 2026 Tutorial Page. The tutorial proposal should be submitted as a
single PDF file via the IPDPS 2026 Tutorial Submission Site provided in
the Call for Tutorials page. Further information can be found at
https://www.ipdps.org/ipdps2026/2026-call-for-tutorials.html.

--
Clément Foyer
Maître de conférence / Associate Professor
Dpt Informatique / Computer Science Dpt
Université de Reims Champagne-Ardenne - LICIIS

**********************************************************
*
* 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, October 22, 2025

[DMANET] PhD position -- Chair of Algorithmics, TU Dresden

PHD POSITION IN ALGORITHMS AND DATA STRUCTURES

A PhD position is open at the Chair of Algorithmics, at Technische
Universität Dresden, Germany, with a planned starting date of Jan 1st,
2026 (or flexibly a bit later).

The position is full-time (100%, E13 TV-L), offered for three years,
with possible extension.

We are looking for a motivated PhD student with a good knowledge of
algorithms and theoretical computer science, to take part in the
research and teaching activities at the Chair of Algorithms within the
Institute of Theoretical Computer Science at TU Dresden.

The main research area is the design and analysis of algorithms and data
structures, with possible focus topics including randomized-, online-,
approximation-, or streaming algorithms, adaptive data structures, or
algorithmic geometry.

The application deadline is Nov 13th, 2025. For informal inquiries,
contact László Kozma (lkozma@gmail.com).

For more information on the position, and to apply, see the official job
opening:
https://tu-dresden.de/vacancy/12449
**********************************************************
*
* 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] Registration Now Open - The 21st Conference on Web and Internet Economics

[cid:image002.png@01DC433B.C5D64E40]WINE 2025: The 21st Conference on Web and Internet Economics
December 8 - 11, 2025
Rutgers University Inn and Conference Center, Rutgers University, New Brunswick, NJ
General Chairs:
Arpita Biswas, Rutgers University
Kangning Wang, Rutgers University

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

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

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

Registration for the conference is now open and early registration deadline is November 7, 2025.

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

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


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

[DMANET] PhD scholarship in Operations Research and Data Science: Optimizing Water Networks - Technical university of Denmark - deadline for application coming up soon

DTU Management would like to invite applications for a 3-year PhD position starting no later than February 1st, 2026. You will work under the supervision of Professor Stefan Røpke, Professor Bissan Ghaddar (DTU/Ivey/IE) and Professor Claudia D'Ambrosio (LIX Ecole Polytechnique/CNRS). You will be enrolled at DTU and you will be part of a vibrant international network with research visits at LIX Ecole Polytechnique in Paris (France) and potentially also at the IE University in Madrid (Spain) and/or at Ivey Business School (Canada).

You will work on developing mathematical optimization methodologies at the intersection of machine learning and operations research to design and operate the water networks of future sustainable societies. Water networks are characterized by their complex topologies and highly non-linear hydraulic behaviours, which pose significant computational challenges for large-scale planning and operational optimization. By leveraging the inherent network structure, the project aims to develop scalable optimization models that capture the sparse structure of water networks. The proposed research will develop methodologies and advanced solutions that will help societies improve energy efficiency, cut emissions, and save water waste.

We are a supportive team that will welcome you in a vibrant, interdisciplinary environment at one of Europe's top technical universities - a university that values innovation, societal impact, and diversity.  At DTU you will benefit from supportive policies for professional development, entrepreneurship, and work-life balance. We are located in Copenhagen, one of the world's most liveable cities. The university offers an excellent quality of life, a safe and sustainable urban environment, and a vibrant cultural scene.

--- Responsibilities and qualifications ---
In this project you will develop the next generation of tools for advanced optimisation models for water networks. We are looking for a candidate who is motivated by both technical curiosity and making a real-world impact. Your primary responsibilities are: 
. Become familiar with existing literature on water networks optimization.
. Are eager to learn and explore the use of large-scale non-linear and polynomial optimization techniques.
. Implement computationally efficient optimization methods to solve the developed models for realistic problems from practice.
. Conduct experiments and benchmarks and report results.
. Write publishable papers documenting the research results.
. Provide support in writing and developing research grants.
We would also look for a candidate interested in taking the project further by collaborating on writing and developing research applications.

You must have a two-year master's degree (120 ECTS points) or a similar degree with an academic level equivalent to a two-year master's degree. 

You should have an MSc background in Industrial Engineering, Management Science/Operations Research, Computer Science, Mathematics, or a similar degree.

Additional qualifications include:
. Good Experience with programming languages such as C/C++, Python, Julia or similar.
. Experience with mathematical optimization software.
. Experience with machine learning packages.
. Excellent communication in English and interpersonal skills for working in a multi-disciplinary team environment.
. Able to work independently.
Approval and Enrolment 
The scholarship for the PhD degree is subject to academic approval, and the candidate will be enrolled in one of the general degree programmes at DTU. For information about our enrolment requirements and the general planning of the PhD study programme, please see https://www.dtu.dk/english/Education/PhD/Rules

Assessment
The assessment will be made through an interview over zoom/teams and will be led by the project partners.

We offer
DTU is a leading technical university globally recognized for the excellence of its research, education, innovation and scientific advice. We offer a rewarding and challenging job in an international environment. We strive for academic excellence in an environment characterized by collegial respect and academic freedom tempered by responsibility.

Salary and appointment terms
The appointment will be based on the collective agreement with the Danish Confederation of Professional Associations. The allowance will be agreed upon with the relevant union. 

The period of employment is 3 years.

You can read more about http://www.dtu.dk/english/about/job-and-career/working-at-dtu/career-paths.

Further information 
Further information may be obtained from Professor Stefan Røpke (mailto:ropke@dtu.dk) or Professor Bissan Ghaddar (mailto:ghaddar@dtu.dk).

You can read more about DTU Management at http://www.man.dtu.dk/

If you are applying from abroad, you may find useful information on working in Denmark and at DTU at https://www.dtu.dk/english/about/job-and-career/moving-to-denmark. Furthermore, you have the option of joining our monthly free seminar "https://www.dtu.dk/english/about/job-and-career/moving-to-denmark/before-arrival/phd-relocation-to-denmark" for all questions regarding the practical matters of moving to Denmark and working as a PhD at DTU. 

--- Application procedure  ---
Your complete online application must be submitted no later than 30 October 2025 (23:59 Danish time). Applications must be submitted as one PDF file containing all materials to be given consideration. To apply, please go to https://efzu.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_2001/jobs/preview/6052/?lastSelectedFacet=ORGANIZATIONS&selectedOrganizationsFacet=300000003724317 and open the link "Apply now", fill out the online application form, and attach all your materials in English in one PDF file. The file must include:
. A letter motivating the application (cover letter)
. Curriculum vitae 
. Grade transcripts and BSc/MSc diploma (in English) including official description of grading scale
. A research statement (1-2 pages) explaining your ideas and relevant litterature
You may apply prior to obtaining your master's degree but cannot begin before having received it. 

Applications received after the deadline will not be considered.

All interested candidates irrespective of age, gender, disability, race, religion or ethnic background are encouraged to apply. As DTU works with research in critical technology, which is subject to special rules for security and export control, open-source background checks may be conducted on qualified candidates for the position.

DTU Management conducts excellent research in the intersection between management, technology and economics. We develop solutions in close cooperation with companies and public authorities. Our research aims at strengthening welfare, productivity, and sustainability within society. A key element is the role of technology and its interaction with industry and individuals. The department is divided into four divisions: Technology & Business Studies, Management Science, Climate & Energy Policy and Transportation Science. The department offers a wide range of courses and programs at bachelor, master and PhD level across DTU's study pro-grams. The department has around 200 employees, with around half coming from abroad.

Technology for people
DTU develops technology for people. With our international elite research and study programmes, we are helping to create a better world and to solve the global challenges formulated in the UN's 17 Sustainable Development Goals. Hans Christian Ørsted founded DTU in 1829 with a clear mission to develop and create value using science and engineering to benefit society. That mission lives on today. DTU has 13,500 students and 6,000 employees. We work in an international atmosphere and have an inclusive, evolving, and informal working environment. DTU has campuses in all parts of Denmark and in Greenland, and we collaborate with the best universities around the world.

**********************************************************
*
* 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] Save the date: Highlights of Logic, Games and Automata, 7 - 11 September 2026 in Vienna

Dear colleagues,

The next edition of the *Highlights of Logic, Games and Automata*
conference will be held at the* TU Vienna, Austria*, from the *7th to the
11th of September 2026*.

Highlights's *Collaborative Research Week (CReW)* will happen the week
after the Highlights conference: from *14th to 18th September, in Vienna*.
This week offers Highlights' participants the opportunity to extend their
stay to collaborate with fellow researchers from the community. It aims to
foster meaningful research activities and provide an engaging environment
for interactions.

Highlights is an annual conference with the goal of integrating the
community of researchers working on logic, games and automata. Papers from
these areas are dispersed across many conferences, which makes them
difficult to follow. A visit to the Highlights conference should offer a
wide picture of the latest research in the field and a chance to meet
everybody in the community, not just those who happen to publish in one
particular proceedings volume. There are no publications.

Further information will be posted on the webpage:
https://highlights-conference.org.

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

[DMANET] Algorithmic Learning in Games Seminar – join us

Dear Colleagues,

Our apologies for bothering you with an email, but as many of the people attending our online seminar are research students,
a population that is dynamic, we thought we should email an invitation to join. Please forward the following email to anyone that might be interested.

The online Algorithmic Learning in Games Seminar takes place every two weeks at 16:00 (UK time).
We meet once every fortnight to discuss problems and research in a range of topics related to:


* Game Theory
* Multi-Agent Reinforcement Learning
* Learning in Games
*
Multi-Agent Systems


The link to join the mailing list can be found at the bottom of our webpage: https://sites.google.com/view/aligs.
Recordings of our past sessions can be found: here<https://www.youtube.com/@gamenet4373/videos>.

Looking forward to meeting you there,

The organizers
Yufei, Stefanos, Clemens and Galit


**********************************************************
*
* 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, October 21, 2025

[DMANET] PODC 2026 First Call for Papers

Apologies for duplicate emails!
----

Call for papers
The 45th ACM Symposium on Principles of Distributed Computing
July 6-10, 2026, Royal Holloway, University of London
Dates
All deadlines are at 23:59 AoE.

*
Abstract submission: February 11, 2026
*
Full paper submission: February 16, 2026
*
Notification: April 29, 2026


Submission page
To be announced.
Scope
The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to the following (in alphabetical order).

*
biological distributed algorithms and systems
*
coding and reliable communication
*
combinatorics and topology of distributed computing
*
communication networks
*
concurrency, synchronization, and persistence
*
design and analysis of concurrent and distributed algorithms and data structures
*
distributed and cloud storage, replication and consistency
*
distributed computing for machine learning, artificial intelligence and big data
*
distributed graph algorithms
*
distributed ledgers and decentralized finance protocols
*
distributed operating systems, middleware, and databases
*
distributed resource management and scheduling
*
fault-tolerance, reliability, self-organization, and self-stabilization
*
game-theoretic approaches to distributed computing
*
high-performance, cluster, cloud and grid computing
*
internet applications
*
lower bounds and impossibility results for distributed computing
*
mobile computing, population protocols and autonomous agents
*
models and languages for distributed computing
*
multiprocessor and multi-core architectures and algorithms
*
peer-to-peer systems, overlay networks, and social networks
*
quantum and optics based distributed computing
*
security and cryptography in distributed computing
*
specifications, semantics, verification, and formal methods for distributed systems
*
system-on-chip and network-on-chip architectures
*
transactional memory
*
wireless, sensor, mesh, and ad hoc networks


Paper submission
A submission should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the submitted work, explicitly and precisely state the submission's main contributions, and discuss the key ideas and methods used to support the main claims. Authors should strive to ensure submissions are accessible to a broad audience, while also having sufficient details for experts in the area.
Regular Papers: A regular paper must report on original research that has not been previously published. It is not permitted to submit the same material concurrently to journals or conferences with proceedings. Format and length requirements for submissions are stated below.
Brief Announcements: A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also report on original research results that can be fully presented in the limited space available. The title of a brief announcement must begin with "Brief Announcement: ".
Use of AI tools: If any AI tools were used in preparing a submission (beyond copyediting or use of internet search tools), the nature of the usage should be disclosed in the submission for the sake of transparency. If AI tools are used, authors remain accountable for the content of the paper, including avoiding plagiarism and providing appropriate citations of sources.
Submission format: All submissions should be typeset using 11-point or larger fonts, in a single-column, single-spaced format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1/2 x 11 inch) paper.
Alternatively, submissions can be prepared using the official ACM Master article LaTeX template acmart.cls, version 1.80 or greater, using the following documentclass instruction:

\documentclass[acmsmall,nonacm,anonymous]{acmart}
The template is available at https://www.acm.org/publications/proceedings-template.
The following instructions equally apply in both cases.

Regular submissions should start with a title page consisting of the title of the submission, no author information (see paragraph on double-blind reviewing below), and a brief abstract summarizing the submission's contributions. There is no page limit and authors are encouraged to use the "full version" of their paper as the submission. Each submission should contain within the initial 10 pages following the title page a clear presentation of the merits of the submission, including a discussion of the submission's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. A submission should include all information necessary for an expert to fully evaluate the paper's central claims, including full proofs and experimental results, where applicable. Although there is no bound on the length of a submission, material other than the abstract and the first 10 pages will be read at the committee's discretion. Authors are encouraged to put the references at the very end of the submission.

Brief announcement submissions must have a length of at most 5 pages including title, abstract, and references.
Submissions not conforming to the rules stated in this call and submissions outside the scope of the conference may be rejected without consideration.

Best practices for citations: Alphabetical orderings of authors can lead to biases. Therefore, authors are encouraged to avoid "et al." in citations, and instead mention all author names.
Awards
All regular papers are eligible for the best paper award. A regular paper is eligible for the best student paper award if the author(s) principally responsible for the paper's contributions are full-time students at the time of submission. The program committee may decline to make these awards or may split them.
Double-blind reviewing
The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear anywhere in the submission. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the submission more difficult. In particular, important references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their submission as they normally would. For example, authors may post drafts of their submissions on the web, submit them to arXiv, and give talks on their research ideas. Authors with further questions on double-blind reviewing are encouraged to contact the PC chair by email.
Conflict of interest
Indications of conflicts of interest will be required in the submission form.
A conflict of interest is limited to the following:

*
A family member or close friend.
*
A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years.
*
A person with the same affiliation.
*
A person involved in an alleged incident of harassment. (It is not required that the incident be reported.)
*
Frequent collaborators, or collaborators who have jointly published papers within the last two years.

If you feel that you have a valid reason for a conflict of interest not listed above, contact the PC chair or one of the Theory of Computing Advocates affiliated with this conference (Faith Ellen and Idit Keidar). The PC chair may request that a ToC advocate confidentially verify the reason for a conflict of interest.
Publication
Accepted regular papers of up to 10 pages and brief announcements of up to 3 pages in two-column ACM proceedings format will be included in the conference proceedings. They must be formatted with the ACM Master templates using
\documentclass[sigconf]{acmart}.

If more space is needed for an accepted paper than is available in the proceedings, a full version must be made available publicly, e.g. on arXiv, by the due date for the proceedings version, and the proceedings version must refer to the full version.
The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.
It is expected that papers that are published at PODC 2025 will be presented by one of the authors in person at the conference. In exceptional circumstances (e.g., because of visa issues), a limited number of exceptions can be approved by the PC chair. A paid conference registration by one of the authors of each accepted paper will be required in any case.
Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. Up to two selected papers will be considered for publication in the Journal of the ACM.

**********************************************************
*
* 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: Leverhulme Early Career Fellowship hosted by LSE Mathematics

The Department of Mathematics at LSE invites applicants who would like to apply for a Leverhulme Early Career Fellowship hosted in the Department. This fellowship is a prestigious post-doctoral award for early-career researchers. Applicants to this fellowship must have the support of the potential host institution, as the Leverhulme Trust provides only partial funding for the position. The Department is in the position to support one candidate for the fellowship.

Potential applicants should first confirm their eligibility, by consulting the information on the Leverhulme Trust website: https://www.leverhulme.ac.uk/early-career-fellowships. In particular, please note the requirement that the doctoral thesis be submitted by 19 February 2026; and the requirement that the applicant either have a UK degree (any degree), or hold an academic position at a UK institution starting no later than October 2025.

Salary is dependent on experience, but not higher than Band 6 Spine 27 on the LSE salary scale (available at https://info.lse.ac.uk/staff/divisions/Human-Resources/Assets/Documents/Salary-Scales/SALARY-BANDS-1-10-August-2025.pdf).

The deadline for applications is *5pm (UK time), 24 November 2025*. To apply, send an email with subject 'Leverhulme ECF application' toj.begic@lse.ac.uk<mailto:j.begic@lse.ac.uk> with the following:

- A short statement in the body of the email indicating their interest in the Department and identifying potential mentors. Please also confirm you satisfy (or expect to satisfy) the eligibility requirements as listed on the Leverhulme Trust website.
- A CV, including publication list.
- A research statement of up to 2 pages, discussing briefly your current/past research, and (in more detail) your proposed research.

Two letters of reference should also be sent, directly by the referees, to j.begic@lse.ac.uk<mailto:j.begic@lse.ac.uk>. These should be received by the application deadline.

All applications will be considered, and the selected candidate will be informed in good time to apply for the Leverhulme Early Career Fellowship, which has a deadline of 19 February 2026. We will assist the candidate in the preparation of their final application.

Questions concerning eligibility should be addressed to the Leverhulme Trust. Questions that relate to the departmental selection should be address to Dr Neil Olver, n.olver@lse.ac.uk<mailto:n.olver@lse.ac.uk>.

**********************************************************
*
* 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] SIAM Conference on Discrete Mathematics (DM26) - Call for Contributed Minisymposiums and Contributed Lectures

The 2026 SIAM Conference on Discrete Mathematics (DM26) will be held
June 22-25, 2026, at the University of California, San Diego, San
Diego, California, U.S.

Submissions for contributed minisymposia and talks are open and available here.
https://www.siam.org/conferences-events/siam-conferences/dm26/

Submission Deadlines:
November 24, 2025 - Minisymposium Proposal Submissions (11:59 p.m. Eastern Time)
December 22, 2025 - Contributed Lecture and Minisymposium Presentation
Abstracts (11:59 p.m. Eastern Time)

Detailed submission information is available here.
https://www.siam.org/conferences-events/siam-conferences/dm26/submissions/

Invited speakers:
Fan Chung - University of California San Diego
James Davies - Cambridge University
Michelle Delcourt - Toronto Metropolitan University
Penny Haxell - University of Waterloo
Richard Montgomery - University of Warwick
Janos Pach - Alfréd Rényi Institute of Mathematics
Mehtaab Sawhney - Columbia University
Caroline Terry - University of Illinois Chicago

Organizing Committee Co-Chairs:
Vida Dujmovic, University of Ottawa, Canada
Jacques Verstraete, University of California, San Diego, U.S.

Organizing Committee:
Anton Bernshteyn, University of California, Los Angeles, U.S.
Édouard Bonnet, CNRS at ENS Lyon, France
Mihyun Kang, TU Graz, Austria
Allan Lo, University of Birmingham, United Kingdom
Greta Panova, University of Southern California, U.S.
Cosmin Pohoata, Emory University, U.S.
Pawel Pralat, Toronto Metropolitan University, Canada
Sophie Spirkl, University of Waterloo, Canada
Andrew Suk, University of California, San Diego, U.S.
Julia Wolf, University of Cambridge, United Kingdom

Please share this announcement with any interested colleagues or students.

**********************************************************
*
* 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] Ph.D. Student in (Random) Algorithms

The Algorithm Engineering group at the Hasso Plattner Institute (HPI)
currently hosts about twenty researchers and invites applications for one
new

Ph.D. Student in (Random) Algorithms.

The research group uses methods from mathematics and computer science to
approach a range of algorithmic areas including artificial intelligence,
network theory and random structures. As part of the privately funded
Faculty of Digital Engineering of the University of Potsdam, we engage both
in the teaching of outstanding and highly selected students as well as in
internationally renowned research. The group and the institute are located
at the beautiful Campus Griebnitzsee, at the border to Berlin, offering a
vibrant scientific environment.

What we offer:
- Inspiring research environment;
- Close collaboration with other scientists;
- Generous travel allowance and latest computing facilities;
- Modern work space in Potsdam-Babelsberg;
- Integration into an international group of researchers;
- Exceptional students to work with;
- A generous tax-free stipend.

What we expect:
- An excellent degree in Computer Science, Mathematics or a related
discipline;
- Enthusiasm for mathematical problems and scientific work;
- Enjoying teamwork and collaboration;
- PhD student applicants should have a desire to obtain a PhD within 3-4
years.

Application process:
- All applications should include a detailed CV, a copy of the Master
thesis and a list of courses and grades.
- Name one of Timo Kötzing, Andreas Göbel, George Skretas and Marcus Pappik
from our group and discuss (briefly) why you find their work interesting.
- Please also mention the names and contact details of one or two
references -- preferably one from your thesis adviser.
- The starting date and particular research topic are flexible.
- Interested candidates should direct their questions to Timo Kötzing.
- Applications must be sent via email, preferably as a single PDF, to Timo
Kötzing via jobs-friedrich(at)hpi.de by November 15, 2023.
- Promising PhD-student applicants will be asked to work out a small
algorithmic open-book test within a 24-hour window (chosen by themselves).
- After successfully completing that stage, applicants will be interviewed
(via video call) and at the same time get the chance to direct further
questions to the chair.

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

[DMANET] PhD position open at University of Vienna

Hi everyone,

If you or someone you know is looking for a PhD position in the interdisciplinary area of deep reinforcement learning and optimization, please check out this open position with my group at the University of Vienna:

https://jobs.univie.ac.at/job/University-assistant-predoctoral/1252973701/

The position involves using DRL to make algorithm configuration faster and better. it is the perfect position for anyone who likes machine learning, optimization and chocolate.

Looking forward to your application!

Kevin TIerney

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