Theory Announcements

Tuesday, February 10, 2026

[DMANET] CFP: ESA 2026.

Call for Papers: European Symposium on Algorithm (ESA) 2026.
------------------------

Part of ALGO 2026, August 31 - September 4 in L'Aquila, Italy. https://algo-conference.org/2026/

Important Dates
------------------------
Abstract submission deadline: April 21
Paper submission deadline: April 23
Notification: June 26

Call for Papers
------------------------
The symposium seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications. Papers with a strong emphasis on the theoretical analysis of algorithms should be submitted to Track A, while papers reporting the results of extensive experimental evaluations and/or providing original contributions to the engineering of algorithms for practical applications should be submitted to Track E. Submissions that prove or explain results, possibly already known, in a particularly clear, simple or elegant way should be submitted to Track S.
There will be a Best Student Paper Award as well as a Best Paper Award, both sponsored by EATCS. In order for a paper to be considered for the Best Student Paper Award, all of its authors are required to be students (including PhD candidates) at the time of submission.

Paper submission and proceedings
Papers should be submitted electronically via the EasyChair submission system. The ESA 2026 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series.

Submission Guidelines
Authors are invited to submit an extended abstract or full paper. Submissions must be formatted in accordance with the LIPIcs proceedings guidelines and may not exceed 500 lines of text. Authors must use the LaTeX class file socg-lipics-v2021.cls; for a quick start, duplicate this Overleaf project.
Proofs omitted due to the line constraint must be placed in an appendix. This appendix can even comprise an entire full version of the paper. The appendix will be read by the program committee members at their discretion. In particular, appendices of accepted papers are not going to be published in the proceedings. The main part of the submission should therefore contain a clear technical 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.
These guidelines are strict: submissions deviating significantly from these guidelines risk being rejected without consideration of their merits. Papers must be submitted electronically via the EasyChair submission system. Results previously published (or scheduled for publication) in another conference proceedings or journal should not be submitted to ESA. Simultaneous submission to other conferences with published proceedings, journals, or to multiple tracks of ESA 2026 is also not permitted. By submitting a paper the authors acknowledge that in case of acceptance, at least one of the authors must register at ALGO 2026, attend the conference on-site and present the paper. Papers with no author fulfilling this requirement may risk being removed from the final conference proceedings (unless there are extenuating circumstances).

PRECISE FORMAT DEFINITIONS
Submissions are not anonymous. The title page should contain the title, authors' names and affiliations, and a concise abstract. Submissions must not exceed 500 lines, excluding front matter (title, authors, and affiliations), references, and a clearly marked appendix (further described below), but including all other lines, even those in the abstract, algorithms, tables, captions, etc.
The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors to not exceed 500 lines even if some lines are not counted automatically. In case of doubt (such as substantial amounts of text appearing as part of a graphic), the actual text content as judged by the program committee will replace the automated line count in deciding conformity.

TEXNICAL DETAILS
Authors must use the socg-lipics-v2021.cls class, which is a lightweight wrapper for the standard LIPIcs document class lipics-v2021. The LIPIcs document class is available from the publisher here (under Author Instructions). Use socg-lipics-v2021 version 0.9 (updated in 2022) and lipics-v2021 version 3.1.3 (updated 2023-05-12).
Further instructions on how to use socg-lipics-v2021 are available here. The first page describes everything needed for the "standard use case"; the rest of the document goes into detail on how to manually correct the line counting in custom environments, should you desire to do so.
The socg-lipics-v2021 document class and its documentation have originally been developed for the International Symposium on Computational Geometry, SoCG, (hence the name of the document class), but it is a generic template for LIPIcs papers with line counts.

Conflict of Interest
------------------------

The conference will employ a single-blind reviewing process. Still, when submitting a paper, please indicate Conflict of Interest (CoI) with PC members. A CoI is limited to the following categories:
1 Family member or close friend.
2 Ph.D. advisor or advisee (no time limit), or postdoc or undergraduate mentor or mentee within the past 5 years.
3 Person with the same affiliation.
4 Involved in an alleged incident of harassment. (It is not required that the incident be reported.)
5 Reviewer owes author a favor (e.g., recently requested a reference letter).
6 Frequent or recent collaborator whom you believe cannot objectively review your work.

Topics
------------------------

Papers presenting original research in all areas of algorithmic research are sought, including but not limited to:

Algorithm engineering
Algorithmic aspects of networks
Algorithmic game theory
Algorithmic data science
Approximation algorithms
Computational biology
Computational finance
Computational geometry
Combinatorial optimization
Data compression
Data structures
Databases and information retrieval
Distributed and parallel computing
Graph algorithms
Hierarchical memories
Heuristics and meta-heuristics
Mathematical programming
Mobile computing
Online algorithms
Parameterized algorithms
Pattern matching
Quantum computing
Randomized algorithms
Scheduling and resource allocation problems
Streaming algorithms

Committees
PC CHAIRS
Seth Pettie (University of Michigan)
Sabine Storandt (University of Konstanz)
Philip Bille (Technical University of Denmark)

PC MEMBERS (TRACK A)
Deeksha Adil (ETH Zürich, Switzerland)
Kristoffer Arnsfelt-Hansen (Aarhus University, Denmark)
Lorenzo Beretta (IBM Research, USA)
Sebastian Brandt (CISPA Helmholtz Center for Information Security, Germany)
Jarosław Błasiok (Bocconi University, Italy)
Karthik C. S. (Rutgers University, USA)
Deeparnab Chakrabarty (Dartmouth College, USA)
Christian Coester (University of Oxford, UK)
Sami Davies (UC Berkeley and RelationalAI, USA)
Kunal Dutta (University of Warsaw, Poland)
Klim Efremenko (Ben Gurion University, Israel)
Robert Ganian (Vienna University of Technology, Austria)
Prantar Ghosh (Tennessee Technological University, USA)
Rohan Ghuge (University of Texas at Austin, USA)
Gramoz Goranci (University of Vienna, Austria)
Yassine Hamoudi (Université de Bordeaux, France)
David Harris (University of Maryland, USA)
Haotian Jiang (University of Chicago, USA)
John Kallaugher (National University of Singapore, Singapore)
Petteri Kaski (Aalto University, Finland)
Dominik Kempa (Stony Brook University, USA)
Sándor Kisfaludi-Bak (Aalto University, Finland)
Hanna Komlós (Max Planck Institute for Informatics, Germany)
Tsvi Kopelowitz (Bar-Ilan University, Israel)
Stefan Kratsch (Humboldt-Universität zu Berlin, Germany)
William Kuszmaul (Carnegie Mellon University, USA)
Michael Lampis (LAMSADE, Université Paris Dauphine, France)
Yi Li (Nanyang Technological University, Singapore)
Yannic Maus (TU Graz, Austria)
Sagnik Mukhopadhyay (University of Birmingham, UK)
Christopher Musco (New York University, USA)
Aleksandar Nikolov (University of Toronto, Canada)
Marcin Pilipczuk (University of Warsaw, Poland)
Adam Polak (Bocconi University, Italy)
Benjamin Raichel (UT Dallas, USA)
Peter Robinson (Augusta University, USA)
Jiří Sgall (Computer Science Institute of Charles University, Czech Republic)
Tatiana Starikovskaya (École Normale Supérieure, France)
He Sun (University of Chinese Academy of Sciences, China)
Paloma T. de Lima (Norwegian School of Economics, Norway, and IT University of Copenhagen, Denmark)
Csaba Tóth (California State University Northridge, USA)
Bartosz Walczak (Jagiellonian University, Poland)
Stefan Walzer (Karlsruhe Institute of Technology, Germany)
Haitao Wang (University of Utah, USA)
Karol Węgrzycki (Max Planck Institute for Informatics, Germany)
Nicole Wein (University of Michigan, USA)
Andreas Wiese (Technical University of Munich, Germany)
Sampson Wong (University of Copenhagen, Denmark)
Mingyu Xiao (University of Electronic Science and Technology of China, China)
Huacheng Yu (Princeton University, USA)
Meirav Zehavi (Ben-Gurion University, Israel)
Tianyi Zhang (Nanjing University, China)
Anna Zych-Pawlewicz (University of Warsaw, Poland)

PC MEMBERS (TRACK E)
Maike Buchin (Ruhr Universität Bochum)
Martin Koutecký (Charles University in Prague)
Vincent Jugé (LIGM – Université Paris-Est Marne-la-Vallée)
Laurent Viennot (INRIA)
Soeren Terziadis (TUM, Heilbronn)
Bora Ucar (CNRS and LIP ENS Lyon)
Andre Schidler (Uni Freiburg)
Dachuan Xu (Beijing University of Technology)
Gonzalo Navarro (University of Chile)
Yihan Sun (University of California, Riverside)
Thomas Bläsius (Karlsruhe Institute of Technology)
Ernestine Großmann (Universiät Heidelberg)
Valentin Polishchuk (Linkoping University)
Pierre-Louis Poirion (RIKEN-AIP)
Christina Boucher (University of Florida)
Giulio Ermanno Pibiri (Ca' Foscari University of Venice)
Kathrin Hanauer (University of Vienna)

PC MEMBERS (TRACK S)
Alexander Conway (Cornell Tech, USA)
Christian Janos Lebeda (INRIA, France)
Danny Hermelin (Ben Gurion University, Israel)
Francesco Silvestri (University of Padova, Italy)
Hideo Bannai (Institute of Science Tokyo, Japan)
Holger Dell (IT University of Copenhagen, Denmark)
Ioana O. Bercea (KTH Royal Institute of Technology, Sweden)
László Kozma (Dresden University of Technology, Germany)
Lene Monrad Favrholdt (University of Southern Denmark, Denmark)
Miguel Mosteiro (Pace University, USA)
Mikkel Abrahamsen (University of Copenhagen, Denmark)
Nick Fischer (INSAIT, Bulgaria)
Nodari Sitchinava (University of Hawaii, USA)
Oren Weimann (University of Haifa, Israel)
Panagiotis Charalampopoulos (King's College, London)
Radu Curticapean (University of Regensburg, Germany)
Shay Mozes (Reichman University, Israel)
Solon Pissis (Centrum Wiskunde & Informatica, The Netherlands)
Teresa Anna Steiner (University of Southern Denmark, Denmark)
Thore Husfeldt (IT University of Copenhagen, Denmark)

**********************************************************
*
* 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, February 9, 2026

[DMANET] AIMS 2026: The International Conference on Artificial Intelligence Models and Systems Conference, Barcelona, Spain

*The International Conference on Artificial Intelligence Models and Systems
(AIMS 2026)*

16-20 November 2026 | Barcelona, Spain

*Hybrid Conference*

https://aims-conference.ai/2026/

The Artificial Intelligence Models and Systems Conference (AIMS 2026) is a
lively and inclusive gathering where researchers, academics, and industry
professionals from across the globe come together to explore the latest
advancements in artificial intelligence and intelligent systems. As AI
continues to reshape industries and push the boundaries of what's possible,
AIMS 2026 creates a welcoming space for innovation, collaboration, and the
exchange of ideas. AIMS2026 serves as a premier platform for researchers,
academics, and industry professionals to converge and explore the latest
advancements, challenges, and applications in the dynamic fields of
rtificial Intelligence Models and Systems. The conference provides a
collaborative environment for the exchange of ideas, fostering innovation
and promoting interdisciplinary research at the intersection of these
transformative domains.

*AIMS 2026 Symposia*

Authors are encouraged to submit their work to one of the following 20
specialized symposiums, each targeting a key research frontier:

1. Advancements in Artificial Intelligence

2. Cutting-Edge Machine Learning Techniques

3. Innovations in Computer Vision

4. Breaking Barriers in Natural Language Processing

5. Exploring Generative AI Applications

*Important Dates:*

- Papers due: April 15, 2026
- Acceptance notification: June 30, 2026
- Registration: July 30, 2026
- Camera-ready paper: July 30, 2026
- Workshop/Tutorial Proposal Submission: April 15, 2026
- Workshop/Tutorial Proposal Acceptance: June 30, 2026

*Submission Guidelines:*

Papers submitted to AIMS must be the original work of the authors. They may
not be simultaneously under review elsewhere. Publications that have been
peer-reviewed and have appeared at other conferences or workshops may not
be submitted to AIMS. Authors should be aware that IEEE has a strict policy
with regard to plagiarism
https://www.ieee.org/publications/rights/plagiarism/plagiarism-faq.html The
authors' prior work must be cited appropriately.

*Submission Link: **https://conferences.sparcly.ai/SP/AIMS2026*

*Organizing Committee*
Honorary Chairs

- Jaime Lloret Mauri, Universidad Politécnica de Valencia, Spain
- Jose Luis Muñoz-Tapia, Universitat Politècnica de Catalunya, Spain

General Co-Chairs

- Christiancarmine Esposito, University of Salerno, Italy
- Attila Kertész, University of Szeged, Hungary
- Vlado Stankovski, University of Ljubljana, Slovenia

Program Co-Chairs

§ Javier Berrocal, Universidad de Extremadura, Spain

§ Safa Otoum, ZU, UAE

--Regards,

**********************************************************
*
* 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] Structured Primal Sparsity for Kernel-Based Support Vector Machines

*SPARK-SVM*
*Structured Primal Sparsity for Kernel-Based Support Vector Machines*
*(Mathematical Programming–Driven Machine Learning)*

*Basic Information*
This internship is primarily centered on *mathematical programming and
sparse optimization*, with applications to kernel-based machine learning
models. It will take place at LIPN (Laboratoire d'Informatique de
Paris-Nord), University of Paris 13. The internship duration is six months,
with flexible starting dates, and can begin immediately or as soon as the
candidate is available.

*Supervision*
The student will be supervised by Roberto Wolfre Calvo (LIPN), Diego delle
Donne (ESSEC Business School), and Emiliano Traversi (ESSEC Business
School).

*Project Overview*
Support Vector Machines (SVMs) with kernel methods are a cornerstone of
machine learning, enabling nonlinear decision boundaries through implicit
mappings to high-dimensional feature spaces. A classical example is the
polynomial kernel, which corresponds to introducing all monomials of the
input variables up to a given degree. While expressive, such models are
difficult to interpret and prone to overfitting.

>From an optimization perspective, sparsity is a natural way to control
model complexity and improve interpretability. However, in kernel-based
SVMs, sparsity has almost exclusively been studied in the *dual formulation*,
typically by limiting the number of support vectors. In contrast, enforcing
sparsity directly in the *primal feature space*—that is, selecting which
monomials or interactions are active in the model—has received very limited
attention. The main reason is that primal sparsity breaks the classical
kernel trick and leads to challenging combinatorial and continuous
optimization problems.

Recent advances in *mathematical programming for structured sparse
optimization* now make it possible to revisit this problem. The project
aims to develop *exact or provably well-founded optimization formulations
and algorithms* that combine structured sparsity constraints with SVM
training. The goal is to design kernel-based models that are interpretable,
computationally tractable, and grounded in rigorous optimization theory,
bridging machine learning and modern sparse optimization techniques.

*Candidate Profile*
We are looking for a motivated Master's student with a strong
background in *applied
mathematics, optimization, or mathematical programming*, as well as solid
programming skills (Python, C/C++, Julia, or similar). A good understanding
of optimization models and algorithms is essential. Prior exposure to
machine learning or kernel methods is a plus but not mandatory; the core
emphasis is on modeling and algorithmic aspects rather than empirical ML
alone.

*Research Environment and Perspectives*
The internship is expected to lead to a scientific publication. For a
strong and motivated candidate, the project may naturally evolve into a PhD
thesis at the interface of mathematical programming and machine learning.

*Application*
Interested candidates should send a CV and academic transcripts to:

Roberto Wolfre Calvo – wolfler@lipn.univ-paris13.fr
Diego delle Donne – delledonne@essec.edu
Emiliano Traversi – traversi@essec.edu

Please include *"SPARK-SVM"* as the subject of the email.
The internship is expected to lead to a scientific publication. For a
strong and motivated candidate, the project may naturally evolve into a PhD
thesis at the interface of mathematical programming and machine learning.

*Application*
Interested candidates should send a CV and academic transcripts to:

Roberto Wolfer Calvo – wolfler@lipn.univ-paris13.fr
Diego delle Donne – delledonne@essec.edu
Emiliano Traversi – traversi@essec.edu

Please include "SPARK-SVM" as the subject of the email.

[DMANET] WAIFI 2026 - NEW DEADLINES + CALL FOR POSTERS

Dear colleagues,

(apologies for multiple postings)

Important dates:

Before the regular paper submission deadline, authors must submit the title, abstract, and keywords of their contribution.
As abstracts will be reviewed under a double-blind process, only this information will be required.

Abstract submission deadline: March 8th, 2026
Submission deadline (EXTENDED): March 15th (23:59 AoE), 2026
Acceptance notification: April 7th, 2026
Final version due: April 16th, 2026
Poster submission deadline: April 30th, 2026

Call for Posters:

We invite participants to submit posters with recent results, work in progress, or new ideas within the scope of WAIFI 2026.
Please submit a short abstract with title, authors, affiliations, and a brief description through the submission system.
Deadline is April 30th, 2026.
We will use the number of submissions by early May to plan the session.
Authors should be present at their poster during the session.

More information (including the submission system) will be posted on the workshop website.

The "International Workshop on the Arithmetic of Finite Fields (WAIFI) 2026", to be held in Santander, Spain, June 3-5, 2026, 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
General Chair:

Domingo Gómez Pérez, University of Cantabria, Spain

Program co-Chairs:

Lejla Batina, Radboud University, The Netherlands
Ferruh Ozbudak, Sabancı University, Türkiye

Program Committee:
Herivelto Martins Borges Filho, Universidade de São Paulo, Brazil.
Claude Carlet, Universities of Paris VIII (France) and Bergen (Norway)
Maria Corte-Real Santos, ENS Lyon, France
Thomas Decru, KU Leuven, Belgium
Sylvain Duquesne, U. Rennes, France
Ana Isabel Gómez Pérez, U. Rey Juan Carlos, Spain
Sophie Huczynska, U. St. Andrews, Scotland
José Luis Imaña, U. Complutense Madrid, Spain
Jorge Jiménez Urroz, U. Politécnica Madrid, Spain
Angshuman Karmakar, IIT Kanpur, India
Gohar Kyureghyan, U. Rostock, Germany
Edgar Martínez Moro, U. Valladolid, Spain
Sihem Mesnager, U. Paris VIII, France
Alessandro Neri, U. Naples Federico II, Italy
Svetla Nikova, KU Leuven, Belgium
Daniel Panario, Carleton University, Canada
Hilder Vitor Lima Pereira, Unicamp, Brazil
Håvard Raddum, Simula UiB, Norway
Francisco Rodríguez Henríquez, TII, UAE
Ana Salagean, U. Loughborough, UK
Amin Sakzad, Monash U., Australia
David Thomson, Carleton U., Canada
Alev Topuzoğlu, Sabancı U., Türkiye
Monika Trimoska, TU/e, The Netherlands
Qiang (Steven) Wang, Carleton U., Canada
Violetta Weger, Technical U. Munich, Germany
Nusa Zidaric, U. Leiden, The Netherlands

The proceedings will be published in the Springer Lecture Notes in Computer Science (LNCS) series.

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

[DMANET] Ph.D. position in Theoretical CS

The Lane Department of Computer Science and Electrical Engineering in the Benjamin M. Statler College of Engineering and Mineral Resources at West Virginia University invites applications for a Ph.D. position in the general area of algorithmic operations research with an emphasis on computational complexity and game theory. The position is funded by NSF (Algorithmic Foundations) and is concerned with the designing efficient algorithms and establishing the computational complexity of selected quantified polyhedral programs.

Specific skills needed: Expertise in game theory and linear and integer programming.

If interested, send email with a copy of your cv to k.subramani@mail.wvu.edu.

K. Subramani

Professor

LDCSEE

West Virginia University

[DMANET] CS Teaching Fellow, Lancaster Leipzig

Hello everyone,
Vacancy as from subject, here is the advert:
https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=0976-25

Feel free to circulate; my apologies for cross/multiple posts.

Best wishes,
Marco

[DMANET] [HPDC] CALL FOR NOMINATIONS: HPDC 2026 ACHIEVEMENT AWARD

CALL FOR NOMINATIONS: HPDC 2026 ACHIEVEMENT AWARD

The HPDC Annual Achievement Award, established in 2012, is presented to an individual who has made long-lasting, influential contributions to the foundations or practice of the field of high-performance parallel and distributed computing (HPDC). These contributions may include one or more of the following:
- Conceptual advances that have influenced the design or operation of HPDC systems or applications;
- Innovative techniques or tools for the design or analysis of HPDC systems or applications;
- Design, implementation, and deployment of innovative (components of) HPDC systems or applications;
- Analysis of innovative (components of) HPDC systems or applications.

Nominations are solicited for the HPDC 2026 achievement award. Members of the community may nominate a colleague by uploading a letter of nomination as a PDF file to https://hpdc26award.hotcrp.com. The nomination package, submitted as a single PDF, should include:
1. The nominee's current professional affiliation(s).
2. A brief citation (thirty words or less) precisely stating the most salient reason(s) why the nominee is qualified for the award.
3. A description of the technical contributions of the nominee and their significance and impact.
4. CV of the nominee.

Nomination Deadline: Monday, March 02, 2026, 11:59 AOE.

Please visit https://hpdc.sci.utah.edu/2026/calls-awards.html for more details.

Award Selection Committee
- Michela Taufer
- Rosa Badia
- Alfredo Goldman
- Mehmet Koyuturk
- Kathryn Mohror
- Dimitrios S. Nikolopoulos
- Manish Parashar
- Devesh Tiwari
**********************************************************
*
* 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, February 8, 2026

[DMANET] Danish Data Science Academy postdoc and PhD positions

The Danish Data Science Academy invites applications for postdoc and PhD fellowships for visionary and ambitious young data scientists who want to pursue their own research ideas in collaboration with a Danish research environment. The postdoc call is at https://ddsa.dk/postdocfellowshipcall2026/ and the PhD call at https://ddsa.dk/phdfellowshipcall2026/, and the application deadline is March 4, 2026.

Applications can be within any field of data science aligning with the DDSA research scope (https://ddsa.dk/ddsaresearchscope/), including, but not limited to, algorithms research within data science and AI and applications of data science or computer science to other areas in natural, technical, or life sciences. The positions will be awarded to the most promising candidates according to their scientific qualifications, motivation, and engagement, as well as the quality, originality, relevance and potential impact of the proposed project. It is a requirement that the applicant has a well-defined research project proposal as well as an agreement with a principal supervisor at a Danish university.

Informal inquiries about opportunities in the Algorithms and Complexity Section at the University of Copenhagen (https://di.ku.dk/english/research/ac/) are welcome and can be directed to Jakob Nordstrom (jn@di.ku.dk) or other faculty in the section. Please contact us as soon as possible if you are interested, so that there is enough time to talk about your research ideas and provide feedback on how to turn them into a successful DDSA proposal.

Saturday, February 7, 2026

[DMANET] CFP: DIS 2026 Conference- May 31-June 4, 2026, Czech Republic

*The 9th International Conference on the Dynamics of Information Systems
(DIS 2026), *

* May 31-June 4, 2026, Czech Republic*

Website: https://dis2026.ujep.cz/

This conference, a continuation of the highly successful DIS series held
in the United States and Europe, investigates the intersections and
uncharted domains in information science, optimization, operations
research, machine learning, and artificial intelligence. The DIS 2026 includes
contributions from researchers and practitioners in information science,
AI, operations research, computer science, optimization, and electrical
engineering.

==================
Topics of Interest—but are not limited to:
==================

- Information science
- Uncertainty modeling
- Optimization (theory, methods, and applications)
- Operations research & management science
- Machine learning and AI
- Computational medical data analysis
- Data science & big data
- Quantum Information
- Dynamical systems and control
- Information geometry for machine learning
- Optimization with information constraints
- Value of information
- Entropic regularization and optimal transport
- Information and Wasserstein gradient flows
- Financial modelling
- Applications in robotics, economics, energy, environmental sciences,
and other areas

==================
Important Dates
==================
All deadlines are Anywhere on Earth (AoE = UTC-12h).

-
- Submission opens: February 5, 2026
- Submission deadline: April 5, 2026
- Author notification: April 20, 2026
- Registration opens: April 21, 2026
- Early Registration Deadline: May 15, 2026
- Late Registration Deadline: May 20, 2026
- Conference: May 31- June 5, 2026
- Camera-ready papers: TBA

==================
Publications
==================
· All accepted papers will be published by Springer-Verlag in
Lecture Notes in Computer Science (LNCS).

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

*Plenary Speakers*
==================

- - Panos M. Pardalos, University of Florida, USA
- - TBA
-
- =============

General Chairs
==================

o Hossein Moosaei, Jan Evangelista Purkyně University, Czech Republic
o Zbyšek Posel, Jan Evangelista Purkyně University, Czech Republic
o Panos M. Pardalos, University of Florida, USA

[DMANET] 3-year Postdoc Position in Symmetry Handling in Bilevel Programming at Eindhoven University of Technology

In the Combinatorial Optimization group at Eindhoven University of
Technology (The Netherlands), there is a vacancy for a 3-year postdoc
position within the NWO/DFG project "SymBi: Exploiting Symmetries for
Faster Bilevel Optimization Algorithms". This postdoc position is
supervised by Christopher Hojny.

The vacancy can be found at
https://www.tue.nl/en/working-at-tue/vacancy-overview/postdoc-in-symmetry-handling-in-bilevel-programming

The vacancy remains open until a suitable candidate has been found and
closes definitively on March 6, 2026.

Starting date: preferably June 1, 2026

PROJECT DESCRIPTION

Bilevel programming (BP) is a powerful mathematical framework for
modeling hierarchical decision-making processes involving two players: a
leader and a follower. In energy network design, for example, the leader
aims to build a robust network that mitigates failures caused by the
follower's actions. A key characteristic of such applications is the
presence of symmetries. For instance, a symmetric network naturally
leads to symmetric failure scenarios, which are reflected in BP models.
However, current BP software can neither detect nor exploit these
symmetries. As a result, despite BP's strong modeling capabilities,
existing technology can only handle relatively small-scale problems.

In the SymBi project (Exploiting Symmetries for Faster Bilevel
Optimization Algorithms), we address this limitation by developing a
general mathematical theory of symmetries in BP and efficient algorithms
for symmetry detection and exploitation. While the related field of
mixed-integer programming (MIP) primarily uses symmetries to eliminate
redundant parts of the solution space, SymBi goes further: it aims to
enhance other components of BP solvers, such as cutting planes, to
achieve a stronger coupling between leader and follower decisions.

The research activities of the postdoc will include

- defining a mathematically sound notion of symmetries for bilevel
optimization problems,
- developing a novel theory for exploiting symmetries that is tailored
for bilevel optimization problems, and
- implementing and testing the developed algorithms for solving
benchmark problems.

Next to the research tasks, the postdoc will be asked to assist, for a
small percentage of their time, with educational tasks (course support
and supervision of students).

JOB REQUIREMENTS

- You are a motivated researcher, with a PhD in integer programming,
bilevel programming, mathematical optimization, or a comparable domain.
- You have very good programming skills, preferably in C/C++.
- You are able to conduct high quality academic research, reflected in
demonstrable outputs.
- You have a proven ability to manage complex projects to completion on
schedule.
- You have excellent (written and verbal) proficiency in English, good
communication skills (knowledge of the Dutch language is not required).

CONDITIONS OF EMPLOYMENT

We offer a meaningful job in a dynamic and ambitious university, in an
interdisciplinary setting and within an international network. You will
work on a beautiful, green campus within walking distance of the central
train station. In addition, we offer you:

- Full-time employment for 3 years. Please note that for a postdoc
position, our departmental policy is that we offer a one-year contract
first, which is extended based on good performance.
- Salary in accordance with the Collective Labour Agreement for Dutch
Universities, scale 10 (min. € 4,241 max. € 5,538).
- A year-end bonus of 8.3% and annual vacation pay of 8%.
- High-quality training programs on general skills, didactics and topics
related to research and valorization.
- An excellent technical infrastructure, on-campus children's day care
and sports facilities.
- Partially paid parental leave and an allowance for commuting, working
from home and internet costs.
- A TU/e Postdoc Association that helps you to build a stronger and
broader academic and personal network, and offers tailored support,
training and workshops.
- A Staff Immigration Team is available for international candidates, as
are a tax compensation scheme (the 30% facility) and a compensation for
moving expenses.

FURTHER INFORMATION

For more information about the project or about the working conditions,
please contact Christopher Hojny (c.hojny@tue.nl).

HOW TO APPLY

Applications should be done through the following website:

https://www.tue.nl/en/working-at-tue/vacancy-overview/postdoc-in-symmetry-handling-in-bilevel-programming

Besides personal and contact information, you should upload the
following documents as PDFs:

- Cover letter in which you describe your motivation and qualifications
for the position.
- Curriculum vitae, including a list of your publications and the
contact information of three references. Kindly note that we may reach
out to references at any stage of the recruitment process. We recommend
notifying your references upon submitting your application.
- List of up to five self-selected 'best publications'.

Do not upload any other documents.
**********************************************************
*
* 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] AIces 2026: early registration February 21st

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

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

AIces 2026

Porto – Maia, Portugal

March 30 – April 2, 2026

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

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

Co-organized by:

University of Maia

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

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

Early registration: February 21st, 2026

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

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 10 courses, 2 keynote lectures, 3 symposia collecting short contributions from participants, and 2 individual presentations on debated topics. 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:

Ricardo Baeza-Yates (KTH Royal Institute of Technology & Pompeu Fabra University), [introductory] Introduction to Responsible AI

Susan Brennan (Stony Brook University), [introductory/advanced] Where Are the Humans in Human-Centered 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

SYMPOSIA:

A symposium will collect 10-minute voluntary presentations on any of the 3 thematic areas of the event: cognition, ethics, and society.

A 1-page abstract containing the title, authors, and summary of the presentation must be sent to david@irdta.eu by February 28, 2026.

Only registered participants can contribute to symposia.

INDIVIDUAL PRESENTATIONS ON DEBATED TOPICS:

50-minute individual presentations will be scheduled for any of the 3 thematic areas of the school: cognition, ethics, and society.

A 2-page expression of interest including the topic to be debated must be sent to david@irdta.eu by December 30, 2025.

Only registered participants are eligible for individual presentations.

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, February 6, 2026

[DMANET] MIC 2026 – Extension Submission Deadline: February 27

MIC 2026 - 16th Metaheuristics International Conference

8 - 11 June, 2026
Ischia Island (Napoli), Italy

www.mic2026.unina.it

*********************
Submission deadline: February 27, 2026
*********************

Aims, Themes & Scope: As per tradition, looking at the previous editions of the MIC conferences, this conference focuses on the progress of the area of Metaheuristics and their applications and provides an opportunity to the international research community to discuss recent research results, to develop new ideas and collaborations, and to meet old friends and make new ones in relaxed atmosphere. MIC 2026 strives to propose a high-quality program that will be completed by a number of invited talks, tutorials, workshops and special sessions.

Solicited contributions can cover a variety of topics including but not limited to:
- Metaheuristic techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, memory-based optimization, dynamic local search, evolutionary algorithms, memetic algorithms, ant colony optimization, particle swarm optimization, scatter search, path relinking, etc.
- Techniques that enhance the usability and increase the potential of metaheuristic algorithms such as reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, parallelization of metaheuristic algorithms, etc.
- Empirical and theoretical research in metaheuristics including large-scale experimental analyses, algorithm comparisons, new experimental methodologies, engineering methodologies for metaheuristic algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms, etc.
- High-impact applications of metaheuristics in fields such as bioinformatics, electrical and mechanical engineering, telecommunications, sustainability, business, scheduling and timetabling. Particularly welcome are innovative applications
of metaheuristic algorithms that have a potential of pushing research frontiers.
- Contributions on the combination of metaheuristic techniques with those from other areas, such as integer programming, constraint programming, machine learning, etc.
- Contributions on the use of metaheuristic techniques in machine learning and deep learning for finetuning and neural architecture search, etc.
- Challenging applications areas such as continuous, mixed discrete-continuous, multi-objective, stochastic, or dynamic problems.

MIC 2026 accepts submissions in three different formats:
1. Regular paper: novel and original research contributions of a maximum of 15 pages (LNCS format)
2. Short paper: extended abstract of novel research works of 6 pages (LNCS format)
3. Oral presentation: one page abstract describing the content of an high-quality manuscript that has recently, within the last year, been submitted or accepted for journal publication.

All submitted papers will undergo a review process. All papers must be prepared using Lecture Notes in Computer Science (LNCS) template, and must be submitted in PDF using the easychair system (https://easychair.org/conferences?conf%3Dmic2026).

Accepted papers in categories 1 and 2 will be published as post-proceedings in Lecture Notes in Computer Science series by Springer.

In addition, a post-conference special issue in Journal of Heuristics will be considered for the significantly extended and revised versions of selected accepted papers from categories 1 and 2.

IMPORTANT DATES:
All deadlines are Anywhere on Earth (AoE = UTC-12h).
- December 1, 2025, submission open/registration open
- February 27, 2026, submission deadline
- March 27, 2026, notification of acceptance
- April 10, 2026, early registration deadline
- June 8-11, 2026, conference at Ischia, Italy

CONTACT INFORMATION:
Paola Festa (E-mail: infomic2026@unina.it, paola.festa@unina.it)
Dept. of Mathematics and Applications "R. Caccioppoli", University of Napoli "Federico II"
**********************************************************
*
* 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] The 17th International Automated Negotiating Agent Competition (Submission: May 31, 2026)

==========

Call for participation: The Automated Negotiating Agents Competition 2026

Submission deadline: ~31st May, 2026

Notification of Finalists: 14th June, 2026

To be held at: IJCAI 2026, 15–21 August 2026, Bremen, Germany

Prizes: 5000+ euros for travel scholarships to IJCAI

Website: https://web.tuat.ac.jp/~katfuji/ANAC2026/

==========

Motivation, impact, and expected outcomes

==========

We invite researchers to participate in the Automated Negotiating Agent
Competition (ANAC) 2026, which brings together researchers from the
negotiation community and provides a unique benchmark for evaluating
practical negotiation strategies in multi-issue domains. ANAC has the
following aims:

* to provide an incentive for the development of effective negotiation
strategies and protocols for bidding, accepting and opponent modeling for
different negotiation scenarios;

* to collect and develop a benchmark of negotiation scenarios, protocols
and strategies;

* to develop a common set of tools and criteria for the evaluation and
exploration of new protocols and new strategies against benchmark
scenarios, protocols and strategies;

* to set the research agenda for automated negotiation.

The previous competitions have spawned novel research in AI in the field of
autonomous agent design which are available to the wider research
community. This year, we introduce a variety of negotiation research
challenges:

* Explore the strategies and difficulties in creating efficient agents
whose primary purpose is to negotiate and deceive. See:
https://scml.cs.brown.edu/anl

* Supply Chain Management League: Design and build an autonomous agent that
negotiates on behalf of a factory manager situated in a supply chain
management simulation. See: https://scml.cs.brown.edu/scml

* Human Agent Negotiation (HAN) League: Design and build a negotiation
agent that can negotiate effectively with a human partner.

We expect innovative and novel agent strategies will be developed, and the
submitted ANAC 2026 agents will serve as a negotiating agent repository to
the negotiation community.

There will be more than 5000 euros of prize money available in the form of
travel scholarships for students to attend the ANAC session to be held in
conjunction with IJCAI. For being eligible to apply for this scholarship,
you should participate in at least one of the leagues and submit your agent
on time.

==========

Website URL

==========

For more details, please visit the competition webpage:
https://web.tuat.ac.jp/~katfuji/ANAC2026/
More information will be added in the coming weeks.

ANAC Board Members

* Dr. Reyhan Aydogan, Ozyegin University & Delft University of Technology

* Prof. Dr. Tim Baarslag, Centrum Wiskunde & Informatica (CWI) & Eindhoven
University of Technology

* Prof. Dr. Katsuhide Fujita, Tokyo University of Agriculture and Technology

* Prof. Dr. Catholijn Jonker, Delft University of Technology

League Organizers

* Automated Agents League: Loes Peters (CWI/Eindhoven University) & ANAC
Board Members

* Supply Chain Management League: Dr. Yasser Mohammad and Dr. Satoshi
Morinaga (NEC, AIST); Prof.Dr. Katsuhide Fujita, (TUAT,NEC-AIST); Prof. Dr.
Amy Greenwald (Brown University); Mark Klein (MIT)

Scientific Advisory Board

* Prof. Dr. Catholijn Jonker, Delft University of Technology (Chair)

* Prof. Dr. Takayuki Ito, Nagoya Institute of Technology

* Prof. Dr. Carles Sierra, IIIA/CSIC

* Prof. Dr. Jonathan Gratch, USC

[DMANET] Postdoc position at Queen Mary, University of London as part of the project "Zeros, algorithms, and correlation for graph polynomials"

We invite applications for a postdoctoral research associate position at Queen Mary, University of London to work with Viresh Patel and Mark Jerrum as part of the EPSRC project on "Zeros, algorithms, and correlation for graph polynomials".

The successful candidate should have expertise/interest in at least one of the following: graph polynomials and partition functions, computational counting algorithms and complexity, combinatorics, models in statistical physics

The application deadline is 11 March 2026, and the starting date is negotiable, though ideally no later than 1 September 2026.

More details about the position and the application procedure can be found at:

https://qmul-jobs.tal.net/vx/mobile-0/appcentre-ext/brand-4/candidate/so/pm/1/pl/3/opp/8807-Postdoctoral-Research-Associate/en-GB

Informal enquiries can be sent to viresh.patel@qmul.ac.uk or m.jerrum@qmul.ac.uk

[DMANET] Connecting everyone for IFORS session

OR Solutions: Setbacks and Successes Stories

Every OR practitioner has a story to tell.

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

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

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

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

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

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

With the breadth of work you have undertaken, your valuable experiences need to be shared. We invite you to contribute and help enrich the collective understanding of how OR truly happens on the ground.

Elise del Rosario

elise@jgdelrosario.com

Gerhard Wilhelm Weber

gerhard.weber@put.poznan.pl

Thursday, February 5, 2026

[DMANET] Simons-Berkeley Research Fellowships for Spring 2027

The Simons Institute for the Theory of Computing invites applications for
Simons-Berkeley Research Fellowships and Long-Term Visitors for the Spring
2027 semester.

Simons-Berkeley Research Fellowships are intended for exceptional
scientists to participate in at least one of the semester-long programs at
the institute. Long-term visitors must be active researchers in the field
and must be beyond their postdoctoral years. The Institute will host a
program on "Symmetry in Efficient Computation with Local Constraints" in
Spring 2027.

The application portal will open March 1, 2026 and the deadline for receipt
of both applications is April 1, 2026. For more information, see the call
for applications
<https://simons.berkeley.edu/research-fellowship-call-applications>
and the Long-Term
Visitor Application
<https://simons.berkeley.edu/long-term-visitor-application-call-applications>
.

Thanks for helping us spread the word about these opportunities.

--
Sampath Kannan
Associate Director
Simons Institute for the Theory of Computing

[DMANET] Diagrams 2026: Call for Graduate Symposium

****Call for Graduate Symposium: Diagrams 2026* ***

15th International Conference on the Theory and Application of Diagrams

August 24–28, 2026

Tallinn University of Technology, Tallinn, Estonia

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

*** Highlights ***

- Proceedings published by Springer

- Graduate Symposium

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

- Best Paper and Best Student Paper awards

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

The Diagrams conference provides a united forum for all researchers with an
interest in the study of diagrams. The conference fosters
multi-disciplinarity and allows researchers from areas such as computer
science, mathematics, psychology, philosophy, history (of science, art,
etc.), education research, and more to meet and share their perspectives on
the theory and application of diagrams.

The goal of the Diagrams 2026 Graduate Symposium is twofold. Firstly, the
Symposium will provide senior graduate students and recent Masters and
Doctoral graduates with the opportunity to present their research.
Established researchers will provide feedback and comments on each of the
presentations. Secondly, the Symposium will provide students with an
opportunity to network with each other as future colleagues.

In previous Diagrams Graduate Symposiums, lively and useful discussions
have enabled students to receive suggestions about their on-going research
and allowed more experienced participants to hear some fresh ideas and view
some of the new trends in the field.

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

Submission Requirements

Submissions that focus on any aspect of diagram research are welcome.
Topics of interest are the same as those given in the calls for papers for
the three conference tracks: Main, Philosophy, Psychology and Eduction.

Students who wish to present their work at the symposium must submit a
3-page report describing

– their thesis topic and the approach being taken,

– the work that has been completed,

– the expected contributions of the research,

– any necessary acknowledgements (for example, supervision team and source
funding)

Students should be the sole authors of their submission, and the
supervisor's name should be included in the acknowledgements section.

*The report must be submitted in Springer LNCS format.*

*Students who submit to the graduate symposium must ask their main or lead
supervisor to submit a short supporting statement.* The supporting
statement should confirm that the supervisor supports the student's
participation in the symposium and briefly explain why the student will
benefit.It is the student's responsibility to ensure that their supervisor
submits the supporting statement.

The supervisor's report should be sent to the Graduate Symposium Chair,

*Nathan Haydon nhaydon@uwaterloo.ca <nhaydon@uwaterloo.ca>.*

Submission should be made via EasyChair:
https://easychair.org/confer-ences/?conf=diagrams2026

*Grad Symposium Due Date: May 1, 2026Supervisor Report Due Date: May 8,
2026Notifications Sent: May 15, 2026*

For questions, please contact the Graduate Symposium Chair, Nathan Haydon
nhaydon@uwaterloo.ca.

More details and important dates can be found at
https://diagrams-conference.org/2026/calls-2/tutorials-2/
<https://diagrams-conference.org/2026/calls-2/tutorials-2/>

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

[DMANET] [CFP] UCNC 2026 - 23rd International Conference on Unconventional Computation and Natural Computation

============================================================
UCNC 2026 - CALL FOR PAPERS

UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION 2026

June 22-26, 2026
Trieste, Italy

Website: https://ucnc2026.units.it

* Regular and Short Papers
Submission deadline March 13, 2026
Notification of acceptance April 30, 2026
Final version for proceedings May 8, 2026

* Posters and Late-Breaking Abstracts
Submission deadline for poster May 8, 2026
Notification of acceptance May 29, 2026

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

BACKGROUND
==========
The International Conference Series on Unconventional Computation and Natural Computation (UCNC) provides a forum bringing together scientists from many different backgrounds who are interested in novel forms of computation, human-designed computation inspired by nature, and computational aspects of natural processes.

The 23rd International Conference on Unconventional Computation and Natural Computation (UCNC 2026) will be held at the University of Trieste in Trieste, Italy, from June 22, 2026 to June 26, 2026. It will continue the tradition of focusing on current important theoretical, applied and experimental developments and their critical evaluation.

AUTHORS GUIDELINES
==================
Accepted papers will be published in the Springer Lecture Notes in Computer Science Series (LNCS) as post-proceedings.
Authors are invited to submit original research papers through the EasyChair submission system: https://ucnc2026.units.it/submissions.html .
Regular papers should not exceed 16 pages, while short papers should not exceed 8 pages.
Papers must be submitted in Portable Document Format (PDF) and must be formatted in the LNCS style: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines .

Papers must not be under simultaneous consideration by any other conference with published proceedings.
All accepted papers, late-breaking abstracts, and posters must be presented at the conference by at least one registered author.

Please note that these guidelines apply only to the main conference track; satellite workshops have their own submission procedures and publication arrangements.

Authors of selected papers will be invited to submit extended versions for publication in a special issue of "Natural Computing", an international journal by Springer-Verlag.

WORKSHOPS
=========
* Reaction Systems
* Quantum Computing
* Cellular Automata and Boolean Automata Networks

UCNC Topics of interest
=======================
The topics of interests of UCNC 2026 include (but are not restricted to):
* Molecular computing
* Quantum computing
* Neural computation
* Evolutionary computation
* Optical computing
* Chaos computing
* Collision-based computing
* Self-assembling and self-organizing systems
* Super-Turing computation
* Cellular automata
* Boolean automata networks
* Discrete dynamical systems and symbolic dynamics
* Reaction systems
* Swarm intelligence
* Ant algorithms
* Artificial immune systems
* Artificial life
* Membrane computing
* Amorphous computing
* Physarium computing
* Computational systems biology
* Computational neuroscience
* Synthetic biology
* Cellular (in-vivo) computing

===================
Luca Manzoni (co-Chair), University of Trieste, Italy
Enrico Formenti (co-Chair), Université Côte d'Azur, France

For further information contact lmanzoni@units.it
===================

[DMANET] PhD Positions (fully-funded): Machine Learning & Combinatorial Optimization (TU Dresden)

The Chair of Machine Learning for Computer Vision of TU Dresden offers
two positions as

PhD Student (m/f/x) / Research Associate (Salary Level TV-L E13, 100%)
Machine Learning & Combinatorial Optimization

starting at the earliest possible date. The positions are limited to
three years.

Tasks:
- independent, curiosity-driven basic scientific research on fundamental
mathematical optimization problems in the fields of machine learning and
image analysis
- design and analysis of algorithms for the exact or approximate
solution of these problems
- Implementation, empirical analysis, and comparison of these algorithms
using data
- publication of research results at leading conferences and in leading
journals
- tasks in teaching and academic self-administration

Requirements:
- excellent university degree in mathematics, computer science, or physics
- extensive prior knowledge in discrete mathematics and in one area of
mathematical optimization (e.g.,
discrete optimization, convex optimization)
- strong interest in basic research using rigorous mathematical methods
- very good programming skills in C/C++
- very good command of written and spoken English

We offer:
- excellent supervision in an outstanding scientific environment
- unique opportunities for collaboration with local, national, and
international partners
- IT equipment tailored to individual needs and access to excellent HPC
infrastructure
- a modern working environment in a city of science and culture,
surrounded by a unique landscape

TUD strives to employ more women in academia and research. We therefore
expressly encourage women to apply. The University is a certified
family-friendly university. We welcome applications from candidates with
disabilities. If multiple candidates prove to be equally qualified,
those with disabilities or with equivalent status pursuant to the German
Social Code IX (SGB IX) will receive priority for employment.

Call: https://mlcv.cs.tu-dresden.de/job-offer-mlcv-en.pdf
Further information: https://mlcv.cs.tu-dresden.de/
Application deadline: **February 26, 2026**
Contact: mlcv@tu-dresden.de

[DMANET] [PhD position] Mathematical Phylogenetics at TU Delft

Dear all,

A full time four year PhD position is available at the Discrete Mathematics and Optimization group (https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/applied-mathematics/discrete-mathematics-optimization) of the Applied Mathematics department (DIAM) at TU Delft. The intended starting date is September 2026.

The PhD will be supervised by Yukihiro Murakami. Applicants should hold a Master's degree (or equivalent) in Mathematics or Computer Science or a closely related subject (such as Operations Research), with a solid foundation in graphs, networks, and algorithms. Biological knowledge is a plus, but not necessary. The deadline for the application is 22nd March, 2026.

For more details, please see
https://careers.tudelft.nl/job/Delft-PhD-Position-Discrete-Mathematics-and-Optimization-Mathematical-Phylogenetics-2628-CD/1352088157/

Best wishes,
Yuki Murakami

[DMANET] Call for workshop papers: LS-NoT@DCOSS-IoT 2026

(*Sorry for multiple receptions*)

** Call for workshop papers LS-NoT 2026 **
LS-NoT 2026: Long and Short Range Wireless Technologies Applied to IoT for Networks of Tomorrow
Co-located with DCOSS-IoT 2026.
Reykjavik, Iceland, June 22-24, 2026
---------------------------------------------------------------
Conference website: https://ls-not-workshop.github.io/ls-not-2026/
Submission link
Important Dates:
Paper submission deadline: Mars 1, 2026
Acceptance notification: April 30, 2026
Camera-ready deadline: May 22, 2026
---------------------------------------------------------------

Scope:
The boundaries between the physical and digital worlds are rapidly blurring, leading to complex systems that integrate smart components. This drive towards innovative futuristic applications across many sectors, aiming to improve societal quality of life. Examples include Smart Cities, precision agriculture, and mitigation of white rural areas, among many others.
At the heart of these Smart Systems lies the Internet of Things (IoT), which enables the collection of real-world data through sensing devices. IoT relies on wireless communications to self-organize and interface with core networks, serving as a bridge between the physical and digital domains. As we look towards the future, these wireless technologies must evolve to meet the demands of increasingly complex Smart Systems. This evolution is crucial to pave the way for tomorrow's interconnected world.
For these reasons, our workshop aims to discover and promote innovative solutions for both long-range and short-range IoT applications, with a focus on next-generation networks. These technologies include the next generation of the Internet (6G), Non-terrestrial Networks (NTN), Cognitive Radio Networks (CRN), Low-Power Wide-Area Networks (LPWAN), Vehicular Communications, and more.

Topics of Interest (but not only limited to):
6G Networks (including Tactile Internet)
Low-Power Wide-Area Networks (LPWAN)
Cognitive Radio Networks (CRN)
Non-Terrestrial Networks (NTN)
Satellite IoT Communication
Space-Air-Ground-Underwater Communications
UAV-based Wireless Networks
Hybrid Networks
Integrated Terrestrial-Satellite Networks
Bluetooth Low Energy (BLE)
Digital Twins
Visible Light Communication (VLC)
ZigBee
Near-Field Communication (NFC)
LoRa (including 2.4 GHz communications)
NB-IoT and LTE-M
Edge Computing Paradigms
Mobile and Multi-Access Edge Computing
Software-Defined Networking (SDN) for IoT
Industrial IoT (IIoT) Communications and Industry 4.0

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

Submission Guidelines:
All submission guidelines for the authors can be found on the website: https://ls-not-workshop.github.io/ls-not-2026/#authors
---------------------------------------------------------------

Publication:
DCOSS-IoT 2026 is technically co-sponsored by IEEE Computer Society and IEEE Technical Committee on Parallel Processing (TCPP). The Proceedings will be included in IEEE Xplore.
---------------------------------------------------------------

Questions and further information:
All questions and further need of information are invited to be emailed to any organizing committee members directly:
Damien Wohwe Sambo (damien.sambo@imt-nord-europe.fr)
Jana Koteich (jana.koteich@inria.fr)
Nina Tamdrari (nina.tamdrari@inria.fr)
**********************************************************
*
* 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] AIS 2026 CFP: IEEE co-sponsored 2nd International Conference on Artificial Intelligence Systems , 12 - 15 May, 2026 | San Antonio, USA.

[Apologies if you got multiple copies of this invitation]

*The 2nd International Conference on Artificial Intelligence Systems (AIS
2026*)

*Hybrid Event*

*https://ais-conference.org/2026/*

*12 - 15 May, 2026 | San Antonio, USA.*
*Technically Co-Sponsored by IEEE Lone Star Section*

*AIS 2026 CFP:*
Artificial Intelligence (AI) systems are computational frameworks designed
to perform tasks that typically require human intelligence, such as
learning, reasoning, problem-solving, perception, and decision-making.
These systems integrate algorithms, data, and computing power to enable
machines to adapt and improve their performance over time. AI systems
encompass a wide range of technologies, including machine learning, natural
language processing, computer vision, and autonomous robotics, and they are
increasingly applied in domains such as healthcare, finance, cybersecurity,
transportation, and smart cities. As they continue to evolve, AI systems
are not only transforming industries and enhancing human capabilities but
also raising important considerations around ethics, transparency, and
trustworthiness. The International Conference on Artificial Intelligence
Systems (AIS 2026) aims to bring together leading researchers, academics,
and practitioners from around the world to share their latest findings,
innovations, and applications in Artificial Intelligence and intelligent
systems. AIS 2026 provides a premier interdisciplinary platform for
presenting advances and exchanging insights on the theoretical foundations,
cutting-edge technologies, and real-world implementations of AI. AIS 2026
will feature keynote talks, technical paper sessions, workshops, and
tutorials covering a wide range of AI topics. We invite submissions of
high-quality research papers describing original and unpublished results in
all areas of Artificial Intelligence Systems. addresses the use of advanced
intelligent systems in providing cybersecurity solutions in many fields,
and the challenges, approaches, and future directions. We invite the
submission of original papers on all topics related to Intelligent Systems
with special interest in but not limited to:
· Machine Learning and Data-Driven Systems
· Natural Language and Multimodal AI Systems
· Generative AI, Foundation Models, and Large Language Models
· Computer Vision, Image and Video Processing
· Artificial Intelligence Systems Applications
· Artificial Intelligence Systems Security
· Computational Language and Human-Centered Systems
· Prompt Engineering and Fine-tuning
· Multimodal LLMs Systems
· Agentic AI Systems
*Submissions Guidelines and Proceedings*
Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the AIS Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers must follow the IEEE paper format. And include up to 7 keywords.
Authors of accepted papers are expected to present their work at the
conference. Submitted papers that are deemed of good quality but that could
not be accepted as regular papers will be accepted as short papers. Length
of short papers can be up to 6 pages.
*Important Dates:*

- *Paper submission deadline: 20 February 2026*
- Notification of acceptance: 25 March 2026
- Camera-ready Submission: 10 April 2026

*Contact:*

Please send any inquiry on AIS to: info@gaclm.org

[DMANET] Postdoc position available in Computer Science

The Lane Department of Computer Science and Electrical Engineering at West Virginia University invites applications for a Postdoctoral Fellow in the general areas of theoretical computer science and algorithmic operations research, with an emphasis on computational complexity and game theory. A PhD in computer science and expertise in the areas of computational and game theory are required. The position is funded by NSF (Algorithmic Foundations) and is concerned with the designing efficient algorithms and establishing the computational complexity of selected quantified polyhedral programs.

Responsibilities will include but are not limited to the following: conducting research on quantified polyhedral programming and quantified circuits, attending research conferences, reading scientific literature to keep abreast of technological advances and current research findings and teaching one course in theoretical computer science. The position is funded for two years, starting August 15, 2026.

Applicants must submit a cover letter, curriculum vitae, and contact information for two professional references at this link: http://bit.ly/4bBAFb9. Contact K. Subramani (k.subramani@mail.wvu.edu) if you have questions.

K. Subramani

Professor

LDCSEE

West Virginia University

[DMANET] IFORS 2026 Vienna: Call for sessions and abstracts on Passenger Air Transportation

Dear colleague,

We are happy to announce that there will be a stream about Passenger Air Transportation: Airlines and Airports at the 24th IFORS in Vienna in 2026.

In this stream we focus on OR techniques for challenges in the following (or related) areas:

* Fleet assignment, routing and scheduling
* Crew scheduling and crew pairing/rostering
* Airport operations, ground handling
* Runway scheduling, air traffic management
* Disruption management and recovery
* Maintenance planning
* Network design
* Revenue management

We cordially invite you to organize a session in this stream. A session has a length of one and a half hour and typically consist of three or four talks. Could you let us know if you are interested in organizing a session?

We are also open to receiving individual talks for these streams The submission of abstracts is open and will close on March 15, 2026. If you are interested in organizing a session or in presenting a talk, please contact us. We can provide you with a submission code to make sure that the talk lands in the right place.

More information on IFORS 2026 can be found below:

* Vienna, Austria, July 12 - 17, 2026

* https://ifors2026.at/home/

Please forward this mail to any colleagues who might be interested. Feel free to reach out to us in case you have any questions.

Marjan van den Akker (Utrecht University, J.M.vandenAkker@uu.nl) and Rainer Kolisch (Technical University of Munich, rainer.kolisch@tum.de)

Wednesday, February 4, 2026

[DMANET] Epistemic Planning Competition @IPC -- Call for Planners

[Apologies for cross-posting]

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

2026 INTERNATIONAL PLANNING COMPETITION
EPISTEMIC PLANNING TRACK

CALL FOR PLANNERS

https://sites.google.com/view/epistemic-competition/
eplanning.competition@gmail.com

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

We are delighted to announce the first Epistemic Planning track of the
International Planning Competition (IPC-26), hosted at the ICAPS 2026 conference
in Dublin. We invite researchers and practitioners in automated planning,
epistemic reasoning, and multi-agent systems to participate and to share this
call to all interested parties. The goals of the track are to promote epistemic
planning research, highlight challenges in the epistemic planning community, and
provide new and interesting problems as benchmarks for future research.

We welcome all interested researchers, students, developers, and practitioners
from any research area connected to epistemic planning. Relevant research fields
include, but are not limited to:
- Automated Planning;
- (Dynamic) Epistemic Logic;
- Knowledge Representation and Reasoning;
- Neuro-symbolic Reasoning; and
- Multi-Agent Systems.

The competition will be based on a novel language called the Epistemic Planning
Domain Definition Language, or EPDDL. A complete guideline for the language is
available here: https://arxiv.org/abs/2601.20969. To facilitate the
participation to a greater number of people, we also developed a full-fledged
parser/grounder for EPDDL and a basic planner available to everyone to build on
top of. Information can be found in the competition website linked above.

The competition is expected to encourage contributions that reflect current
approaches and practices in epistemic planning. Authors of selected entries will
be invited to provide written contributions which will be collected and
published in the proceedings of the track.

Below we provide the general information to compete in the epistemic planning
track. For all details on the structure of the track and planners evaluation
policies, please consult the official website of the track:
- https://sites.google.com/view/epistemic-competition/

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

| Event/Deadline | Date (AoE) |
|--------------------------------------| ------------------ |
| Demo problems provided (smoke tests) | February, 2026 |
| Team registration | March 12, 2026 |
| Domains submission | March 19, 2026 |
| Domain submission deadline | April 23, 2026 |
| Feature stop (final submission) | April 30, 2026 |
| Planner abstract submission | May 21, 2026 |
| Contest run | May - June, 2026 |
| Results announced | During ICAPS (TBA) |

----- Registration and Submission -----

To register a team, the participants need to send an e-mail with a subject
containing "Registration" to eplanning....@gmail.com<https://groups.google.com/>. The
e-mail must contain:
1. Names of participants,
2. E-mail contacts,
3. GitHub usernames.

Based on that, we will create private repositories under the ipc2026-epistemic
organization and add all participants as users with write access and
participants can commit to the repository as they wish until the "feature stop"
deadline (April 30, 2026).

The competitors must submit the source code of their planners that will be run
by the organizers on the actual competition domains/problems.

As in the previous IPC 2023, we will use the container technology Apptainer. We
prepared a demo submission, available at
https://github.com/a-burigana/plank/blob/main/Apptainer.demo_bfs, that showcases
how to set up the repository and Apptainer scripts.

More information about the submission policy can be found in the website.

----- Planner Abstract Submission -----

All competitors must submit an abstract (max. 300 words) and an up to 8-page
paper describing their planners. After the competition we ask the participants
to analyze the results of their planner and submit a finalized version of their
paper to be published in the proceedings of the track. An important requirement
for IPC 2026 competitors is to give the organizers the right to post their paper
and the source code of their planners on the official IPC 2026 web site.

----- Contacts and Info -----

Organizers:
- Alessandro Burigana
- Francesco Fabiano

Website:
- https://sites.google.com/view/epistemic-competition/

Theory Announcements

Tuesday, February 10, 2026

[DMANET] CFP: ESA 2026.

Monday, February 9, 2026

[DMANET] AIMS 2026: The International Conference on Artificial Intelligence Models and Systems Conference, Barcelona, Spain

[DMANET] Structured Primal Sparsity for Kernel-Based Support Vector Machines

[DMANET] WAIFI 2026 - NEW DEADLINES + CALL FOR POSTERS

[DMANET] Ph.D. position in Theoretical CS

[DMANET] CS Teaching Fellow, Lancaster Leipzig

[DMANET] [HPDC] CALL FOR NOMINATIONS: HPDC 2026 ACHIEVEMENT AWARD

Sunday, February 8, 2026

[DMANET] Danish Data Science Academy postdoc and PhD positions

Saturday, February 7, 2026

[DMANET] CFP: DIS 2026 Conference- May 31-June 4, 2026, Czech Republic

[DMANET] 3-year Postdoc Position in Symmetry Handling in Bilevel Programming at Eindhoven University of Technology

[DMANET] AIces 2026: early registration February 21st

Friday, February 6, 2026

[DMANET] MIC 2026 – Extension Submission Deadline: February 27

[DMANET] The 17th International Automated Negotiating Agent Competition (Submission: May 31, 2026)

[DMANET] Postdoc position at Queen Mary, University of London as part of the project "Zeros, algorithms, and correlation for graph polynomials"

[DMANET] Connecting everyone for IFORS session

Thursday, February 5, 2026

[DMANET] Simons-Berkeley Research Fellowships for Spring 2027

[DMANET] Diagrams 2026: Call for Graduate Symposium

[DMANET] [CFP] UCNC 2026 - 23rd International Conference on Unconventional Computation and Natural Computation

[DMANET] PhD Positions (fully-funded): Machine Learning & Combinatorial Optimization (TU Dresden)

[DMANET] [PhD position] Mathematical Phylogenetics at TU Delft

[DMANET] Call for workshop papers: LS-NoT@DCOSS-IoT 2026

[DMANET] AIS 2026 CFP: IEEE co-sponsored 2nd International Conference on Artificial Intelligence Systems , 12 - 15 May, 2026 | San Antonio, USA.

[DMANET] Postdoc position available in Computer Science

[DMANET] IFORS 2026 Vienna: Call for sessions and abstracts on Passenger Air Transportation

Wednesday, February 4, 2026

[DMANET] Epistemic Planning Competition @IPC -- Call for Planners

Mailing Lists

Search This Blog

Blog Archive

Theory Announcements

Tuesday, February 10, 2026

Monday, February 9, 2026

Sunday, February 8, 2026

Saturday, February 7, 2026

Friday, February 6, 2026

Thursday, February 5, 2026

Wednesday, February 4, 2026

Mailing Lists

Subscribe To

Search This Blog

Blog Archive