Theory Announcements

Friday, March 27, 2026

[DMANET] CFP [Extended Deadline]: REX-IO Workshop at ACM HPDC 2026 - Submissions due April 13, 2026

**[Apologies if you receive multiple copies of this email]**

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

Call for Papers

REX-IO 2026: 6th Workshop on Re-envisioning Extreme-Scale I/O for
Emerging Hybrid HPC Workloads

Held in conjunction with ACM HPDC 2026, Cleveland, OH, USA

Workshop Date: July 13, 2026

(https://sites.google.com/view/rexio/)

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

================================
Scope, Aims, and Topics
================================
REX-IO focuses on extreme-scale I/O and storage challenges driven by emerging hybrid HPC workloads, from traditional simulation to AI/ML, data analytics, and complex workflows, that combine scale-up and scale-out components. As exascale systems and multi-tier storage hierarchies become more common, the gap between compute and storage performance and the growing complexity of parallel file/storage systems demand new approaches. We invite submissions on I/O characterization, data/storage management challenges, and novel optimization and management techniques (including ML/AI-enabled methods) that improve performance and usability. Starting from its origins at IEEE Cluster 2021, REX-IO will be held at ACM HPDC 2026, continuing its tradition and forum for researchers and practitioners across I/O, storage, facilities, and applications.

Topics of interest include, but are not limited to:
- Understanding I/O inefficiencies in emerging workloads such as complex multi-step workflows, in-situ analysis, AI, and data analytics methods
- New I/O optimization techniques, including how ML and AI algorithms might be adapted for intelligent load balancing and I/O pattern prediction of complex application workloads
- Performance benchmarking and modeling, and I/O behavior studies of emerging workloads
- New possibilities for the I/O optimization of emerging application workloads and their I/O subsystems
- Efficient monitoring tools for metadata and storage hardware statistics at runtime, dynamic storage resource management, and I/O load balancing
- Parallel file systems, metadata management, and complex data management
- Understanding and efficiently utilizing complex storage hierarchies beyond the traditional two-tiered file system and archive model
- User-friendly tools and techniques for managing data movement among compute and storage nodes
- Use of staging areas, such as burst buffers or other private or shared acceleration tiers for managing intermediate data between computation tasks
- Application of emerging big data frameworks towards scientific computing and analysis
- Alternative data storage models, including object and key-value stores, and scalable software architectures for data storage and archive
- Position papers on related topics

================================
Submission Guidelines
================================
All submitted papers should be formatted using the ACM Proceedings Style with sigconf format (please be sure to use the current version). The necessary document can be found here: https://www.acm.org/publications/proceedings-template

Page limit: 5 to 8 pages (excluding references)

All papers must be original and should not have appeared in or be simultaneously under consideration for a different workshop, conference or journal. Indicate all authors and affiliations.

All papers will be peer-reviewed using a single-blind peer-review process by at least three members of the program committee.

Submissions must be in English and PDF format.

Papers must be submitted via the REX-IO 2026 submission site: https://easychair.org/conferences/?conf=rexio26

================================
Important Dates
================================
Please note: All deadlines and dates are Anywhere on Earth
- Submissions open: February 2, 2026
- Submission deadline: April 13, 2026 (final extension)
- Notification to authors: May 4, 2026
- Camera-ready papers due: May 16, 2026
- Workshop date: July 13, 2026

================================
Workshop Co-Chairs
================================
- Sarah M. Neuwirth (Johannes Gutenberg University Mainz, Germany)
- Arnab K. Paul (BITS Pilani, K K Birla Goa Campus, India)
- Jay Lofstead (Sandia National Laboratories, USA)

--------------------------------------------------------------------------------
Univ.-Prof. Dr. Sarah M. Neuwirth
Co-Director, NHR South-West HPC Center
Research Group Head, High Performance Computing and its Applications

Johannes Gutenberg University Mainz
Anselm-Franz-von-Bentzelweg 12
55099 Mainz | Germany

Office: ZDV, Room 01-339
Phone: +49 6131 39 23643
Email: neuwirth@uni-mainz.de<mailto:neuwirth@uni-mainz.de>
Website: https://www.hpca-group.de/
NHR@SW Website: https://nhrsw.de/
--------------------------------------------------------------------------------

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

[DMANET] RASACC 2026 (co-located with DSN) - Extendend Deadline - Workshop on Resiliency for Autonomous Systems Across the Computing Continuum - June 22 - Charlotte

*The 1st International Workshop on Resiliency for Autonomous Systems
Across the Computing Continuum (RASACC 2026)*

*CALL FOR PAPER*

/June 22, 2026/

/Charlotte, USA/

Co-located withthe 56th Annual IEEE/IFIP International Conference on
Dependable Systems and Networks (DSN 2026) <https://dsn2026.github.io/>

https://rasacc-dsn.github.io/rasacc26

Paper submission deadline: *(EXTENDED)March 26, 2026 (AoE)→ April 6,
2026 (AoE)*

The RASACC workshop aims to connect researchers and practitioners to
explore resiliency in autonomous systems across computing continuum
ecosystems. Emphasis is on system-level dependability, resilience, and
intrusion tolerance amid intrinsic autonomy, distribution,
heterogeneity, and collaboration. Cross-disciplinary contributions from
dependability engineering, distributed systems, security, and AI-enabled
systems are encouraged, including real-world case studies.

*Topics of Interest*

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

Cross-Layer Resilience

* Dependability challenges in cloud-edge-fog-IoT environments
* Emergent failures due to resource contention, interference, and overload
* Effects of mobility, heterogeneity, and partial connectivity on
system behavior
* Cross-layer failure across hardware, network, middleware, and
applications
* Orchestration and adaptation mechanisms influencing emergent behavior

Security and Intrusion Tolerance

* Cyber attacks, intrusions, and coordinated adversarial behavior
* Byzantine faults and malicious behavior in autonomous and
collaborative ecosystems
* Intrusion-tolerant architectures, protocols, and coordination mechanisms
* Trust management, fault attribution, and accountability under
partial compromise
* Security failures and resilience strategies
* Risk Assessment of DLT Solutions

Runtime and Adaptive Resilience

* Runtime monitoring and detection of failures in autonomous systems
* Online risk assessment and mitigation techniques
* Self-adaptive, self-healing, and self-protecting systems
* Runtime verification and assurance for autonomous and distributed
environments
* Dependability-aware learning and adaptation mechanisms

Collaborative systems

* Dependability of multi-agent systems and autonomous entities
* Coordination, consensus, and agreement under faults, uncertainty,
and partial observability
* Human-autonomy interaction and emergent behaviors in mixed
human-machine teams
* Shared autonomy and collaborative decision-making in dynamic
environments
* Fault containment and isolation in collaborative and distributed
autonomous systems

*Submission Guidelines*

Paper types

* *Regular Papers*present original, unpublished research with
substantial new results and must be 8 pages total (including references)

* *Extended Abstracts*foster discussion on recent or ongoing work,
summarizing novel insights from a published paper or presenting
preliminary results from ongoing research and must be 2 pages total
(including references)

General Information

*Review Process:*

All submissions will undergo a double-blind peer review by the Technical
Program Committee.

*Formatting:*

All submissions must follow the IEEE Computer Society 8.5″×11″
two-column camera-ready format, using 10-point font on 12-point
single-spaced leading.

*Presentation and Publication:*

Accepted papers will be published in the supplement to the DSN
Proceedings (DSN-W volume) and made available on IEEE Xplore. At least
one author of each accepted paper must register for the workshop and
present their work.

*Submission site: *

https://easychair.org/conferences/?conf=dsn_2026

Track:/International Workshop on Resiliency for Autonomous Systems
Across the Computing Continuum/

*Important Dates:*

* Paper submission deadline:* (EXTENDED) April 6, 2026 (AoE)*
* Notification of Acceptance: *April 21, 2026 (AoE)*
* Camera-ready deadline: *April 27, 2026 (AoE)*
* Workshop: *June 22, 2026*

*General Chairs:*

* Alessandro Palma (Sapienza University of Rome)
* Georgios Bouloukakis (University of Patras)
* Giovanni Farina (Niccolò Cusano University)

If you have any questions, please do not hesitate to contact the RASACC
Workshop General Chairs.

For further information:

https://rasacc-dsn.github.io/rasacc26

/Looking forward to your submissions!/

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

[DMANET] IWOCA 2026 in Clermont-Ferrand, France - Call for participation

The 37th International Workshop on Combinatorial Algorithms (IWOCA 2026) will be held in Clermont-Ferrand, France, on June 8-12, 2026.

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business. In the tradition of past editions, the conference will be followed by a collaborative workshop.
The topics of interest include combinatorial algorithms and related areas, including (but not limited to) graphs, words, games, geometry, combinatorial optimization, complexity theory and models of algorithms such as exact, parameterized, distributed, online, approximation and probabilistic.

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

***List of accepted papers***
https://iwoca2026.limos.fr/accepted.php

*** Invited speakers***
Sergio Cabello (University of Ljubljana, Slovenia)
Pierre Fraigniaud (CNRS, Université Paris Cité, France)
Neeldhara Misra (Indian Institute of Technology Ghandinagar, India)
See https://iwoca2026.limos.fr/invited_speakers.php

***Registration***
IWOCA 2026 will consist of a conference, held on June 8-11, followed by a collaborative workshop, held on June 11-12. Thanks to our sponsors, the registration fee covers the whole event (and thus we encourage all participants to stay for the collaborative workshop), and entitle you to lunches, coffee breaks, social event and conference dinner.

Early registration is available until May 11, 2026, with fees of 275€ for student participants and 385€ for other participants.
Late registration will be available from May 12 to May 24, 2026, with an additional 110€ cost.

To register, please fill up and submit the registration form:
https://api.dsi.uca.fr/paybag/registration/form/event/IWOCA2026
Full information about registration can be found here:
https://iwoca2026.limos.fr/registration.php

***Extended Stay Support Scheme (ESSS)***
We encourage IWOCA 2026 participants to use the opportunity of traveling to France to plan a research visit to a French institution reachable without plane, before or after IWOCA 2026. The partner institutions will partially cover accomodation, living expenses and non-plane travel fees for selected participants. Research units from Clermont-Ferrand, Lyon, Marseille, Montpellier, Nice, Orléans and Paris are participating in the scheme.
All information about the scheme and the application process can be found here:
https://iwoca2026.limos.fr/extended_stay.php

For any issue or question during the registration process, about the conference, or about the ESSS, please contact us at iwoca2026@limos.fr

We hope to see you soon in Clermont-Ferrand!

--
Antoine Dailly and Florent Foucaud
Organisation chairs of IWOCA 2026

[DMANET] CFP Computational Optimization

Call for Papers

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

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

IEEE CS is a technical co-sponsor of FedCSIS 2026

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

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

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

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

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

Best paper award

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

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

Submission and Publication

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

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

Important dates:

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

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

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

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

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

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

Thursday, March 26, 2026

[DMANET] [SPAA 2026] Call for Workshops and Tutorials

Dear all,

We welcome proposals for workshops and tutorials that fall within the scope of the SPAA community <https://spaa.acm.org/> or address research challenges in related areas/problems that have potential impact on the SPAA community. Proposals will be evaluated on a rolling basis, so early submissions are encouraged and will be reviewed promptly.

Please submit proposals to the SPAA 2026 Workshops and Tutorials Chair, Quanquan Liu (quanquan.liu@yale.edu). Proposals should be submitted by April 25, 2026.

Proposals should be brief (at most 3 single-column pages).

Workshop Proposals: The following information should be included in a workshop proposal:

1.
Title
2.
Name and email address of the organizer(s)
3.
A description of the proposed format and agenda
4.
Procedures for selecting participants and presenters

Here is a sample template<https://docs.google.com/document/d/15A8DNiWd-qBJsm4GnP1BlUFnXtCZfRaIxjYXm279IQY/edit?usp=sharing> that you may use, although other formats are also acceptable. We welcome workshops that are either invitation-based (example: Workshop on Recent Advances in Parallel and Concurrent Data Structures<https://sites.gatech.edu/spaa24datastr/> in SPAA 2024) or submission-based (example: Highlights of Parallel Computing <https://ucrparlay.github.io/hopc24/> (HOPC) 2024).

Tutorial Proposals: Tutorials will be 1 or 1.5 hours long, depending on the number of accepted tutorials and local arrangements. A tutorial proposal should include:

1.
Title and abstract
2.
An outline of the tutorial content and objectives, with sufficient detail to convey both scope and depth
3.
Prerequisite knowledge
4.
A very brief biography of the tutorial organizers and relevant information

Evaluation Committee: All workshop and tutorial proposals will be evaluated by a committee comprising the following members of the SPAA 2026 organizing committee.

*
Rezaul Chowdhury (Program Chair)
*
Quanquan Liu (Workshops and Tutorials Chair)

Important Dates:

*
April 25, 2026: Proposals due
*
May 10, 2026: Notification of acceptance
*
July 6, 2026: SPAA workshops/tutorials in London (July 7-10, 2026, SPAA conference)

Thank you!

Cheers,
Quanquan

[DMANET] International Conference on Bilevel Optimization, Pittsburgh, August 2-5, 2026

ICBO 2026 – Abstract submission deadline approaching
The deadline for abstract submission for the International Conference on Bilevel Optimization (ICBO) 2026 is fast approaching, and we warmly invite you to be part of this flagship event on bilevel optimization.
The abstract submission deadline: 1 April 2026
This is the key date to keep in mind as we prepare an exciting scientific programme bringing together researchers and practitioners from across optimization, machine learning, energy, economics, and beyond.
The conference will feature:

* A tutorial and summer school (2 August 2026)
* Three days of high-quality scientific sessions
*
A vibrant and international research community around bilevel optimization

🔗 Submit your abstract and find full details here:
https://bileveloptimization.org/icbo/2026

[DMANET] SMARTCOMP 2026 Call for Posters, Demos, and Work-in-Progress -- Deadline Extended

Apologies if you receive multiple copies of the same email.

**** Deadline extended to 17th April, 2026 ****
======================================================================
SMARTCOMP 2026
Call for Posters, Demos, and Work-in-Progress (WIP) Contributions
https://portale2.unime.it/smartcomp2026/call-for-posters/
======================================================================

Please consider submitting your work to the Posters, Demos, and
Work-in-Progress (WIP) track of SMARTCOMP 2026.

This track offers an excellent opportunity to present early-stage
research, novel ideas, and innovative applications to an international
audience of researchers and practitioners in Smart Computing.

*** Accepted Posters, Demos, and WIP papers will be published in IEEE
Xplore. ***

For details, topics of interest, and submission guidelines, please refer
to the full CFP below.

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

Paper submission: 17 April 2026 [extended]
Acceptance notification: 1st May 2026
Camera-ready deadline: 8th May 2026

----------------------------------------------------------------------
SMARTCOMP 2026 - Call for Posters / Demos / WIP
----------------------------------------------------------------------

SMARTCOMP 2026 is the 12th edition of the premier conference on Smart
Computing.

Smart Computing is a multidisciplinary domain shaped by the synergistic
advances in sensor-based technologies, the Internet of Things (IoT),
cyber-physical systems (CPS), edge computing, big data analytics,
machine learning, cognitive computing, and artificial intelligence.

Applications of Smart Computing span many societal domains, including
transportation, energy, environmental protection, smart and connected
communities, healthcare, banking, industrial systems, entertainment,
and social media.

Algorithmic and system advances in cloud computing, mobile and pervasive
computing, cyber-physical systems, sensor networking, and social
computing are taking Smart Computing to a new dimension and improving
our ways of living.

Submit your Demo here.
Submit your Poster/WIP here.

*** Accepted Posters, Demos, and WIP papers will be published in IEEE
Xplore. ***

----------------------------------------------------------------------
Posters / Demos / WIP Co-Chairs
----------------------------------------------------------------------

Brent Lagesse
University of Washington Bothell, USA

Mario Molinara
University of Cassino and Southern Lazio, Italy
======================================================================

Thanks & Regards,
Debasree Das

----

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

[DMANET] BOCCONI THEORY DAY -- Call for participation

********************************************
BOCCONI THEORY DAY -- Call for participation
********************************************

Bocconi Theory Day is a 1-day event that brings together researchers in theoretical computer science, algorithms and optimization for a day of talks and discussions about recent trends in our fields.
https://cs.unibocconi.eu/research/theory/theoryday26

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

DATE and VENUE:
April16th 2026, Bocconi University (Building in Via Roentgen 1, room AS01)

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

SPEAKERS:
Yossi Azar (Tel-Aviv University)
Jan van den Brand (Georgia Tech)
Elisabetta Cornacchia (Bocconi)
Marco Di Summa (University of Padua)
Yuri Faenza (Columbia University)
Andrés Cristi (EPFL)

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

LINK and REGISTRATION:
The event is free of charge for participants, but we ask all the participants to make sure to fill in the attendance questionnaire to help us with the organization:
<https://forms.office.com/e/2Zu3JejHjS>

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

The organizers,
Jarosław Błasiok
Andrea Celli
Marek Eliáš
Adam Polak
Laura Sanità

[DMANET] PhD position in Karlsruhe: Estimation of short-term extremes in air pollution and their drivers (DAAD scholarship)

We are currently looking for a PhD candidate for a research project on "Estimation of short‑term extremes in air pollution and their drivers" supervised by Hendrik Andersen, Jan Cermak and Vicky Fasen-Hartmann at KIT Graduate School Computational and Data Science (KCDS), Karlsruhe Institute of Technology (KIT).

The research focus is on developing a new data-driven approach to accurately predict extremes in urban air pollution from observation data, and to quantify the contributions of the various factors driving these extremes. Therefore, methods from extreme value statistics will be implemented in a machine-learning framework to estimate and predict air pollution extremes. As a starting point, we use Paris as a baseline city, where ML methods were successfully implemented to reproduce specified PM1 concentrations.This model architecture will be adapted and retrained on multi-city data from global air pollution hotspots, enabling generalization beyond the urban area of Paris.

The project lies at the intersection of innovation in mathematics and meteorology. By combining extreme value theory with machine learning, it aims to advance the current state of the art in predicting air pollution extremes.

The doctoral degree will be awarded in either Mathematics or Meteorology, depending on the candidate's academic background.

The successful candidate will receive a DAAD Graduate School Scholarship funded by the German Academic Exchange Service (DAAD).

Further information: https://www.kcds.kit.edu/72.php

Application deadline: April 30, 2026

Karlsruhe Institute of Technology (KIT)

- KIT Center MathSEE -

Angela Hühnerfuß

KIT Graduate School Computational and Data Science

Coordination Office

<http://www.kcds.kit.edu/> www.kcds.kit.edu

Kaiserstr. 12

D-76131 Karlsruhe

Tel.: +49 721-608 47748

<mailto:angela.huehnerfuss@kit.edu> angela.huehnerfuss@kit.edu

KIT – The University in the Helmholtz Association

<http://www.kit.edu/> www.kit.edu

[DMANET] MAPSP 2026 Call for Participation

MAPSP 2026 - Call for Participation

17h Workshop on Models and Algorithms for Planning and Scheduling Problems

June 21-26, 2026

Redworth Hall Hotel, Newton Aycliffe, County Durham, UK

Website: https://mapsp2026.webspace.durham.ac.uk/

Contact: mapsp2026@gmail.com

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

MAPSP is a biennial workshop dedicated to building a community of
researchers interested in theoretical and practical aspects of scheduling,
planning, and timetabling. The 17th Workshop on Models and Algorithms for
Planning and Scheduling Problems (MAPSP 2026) will be organized at
Redworth Hall Hotel near Durham, UK. It will take place in the week
of June 21–26, 2026.

Set amidst 26 acres of tranquil grounds, Redworth Hall combines historic
Jacobean charm with luxury. Amenities include a spa, a gym, and an indoor
swimming pool. Scientific sessions will take place in the Prince Bishop
Suite and in the magnificent Great Hall, where dinners will also be served.
The closest relevant airport is Newcastle International Airport (NCL)
and the nearest train station is Darlington. From there, the hotel can
be reached by bus or taxi.

The program will consist of invited plenary lectures by Andreas Wiese
(TU Munich), Franziska Eberle (TU Berlin) and Jannik Matuschke (KU Leuven)
as well as over 60 contributed talks (a list of accepted abstracts can be
found on the website). In addition, there will be a session of short talks
later in the week that will be organized on Monday for those who don't have
another talk in the schedule but are interested in giving a presentation.

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

Early registration until April 8, 2026, 23:59 BST. Accommodation at
Redworth Hall Hotel cannot be guaranteed for late registrations.

[DMANET] HALG 2026 – Finale Call for Short Presentations (April 3)

The 11th IGAFIT Highlights of Algorithms Conference (HALG 2026)
Stockholm, June 8–10, 2026
https://2026.highlightsofalgorithms.org/index.html

The IGAFIT Highlights of Algorithms (HALG) conference is a forum for presenting highlights of recent developments in algorithms and for discussing potential further advances in the area. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks, as well as opportunities for researchers and students to present their recent results through short talks and poster presentations.

Attending HALG 2026 will also provide opportunities for networking and meeting leading researchers in algorithms. We have an amazing list of invited survey and paper speakers (see homepage).

*** Call for Submissions of Short Contributed Presentations ***

HALG 2026 invites submissions for short contributed presentations.
Each accepted contribution will consist of a poster and a short talk (serving as an introduction to the poster).

There will be no conference proceedings. Work that has already been published at another venue or journal (or is intended for submission elsewhere) is welcome.

If you would like to present your results at HALG 2026, please submit the details of your contribution via EasyChair, including the abstract of the talk or poster.
https://easychair.org/conferences/?conf=halg2026

The abstract should include (when relevant) information about where the results have been published or accepted (e.g., conference or journal), and where they are publicly available (e.g., arXiv).

All submissions will be reviewed by the Program Committee (PC), with priority given to papers published in 2025 or later.

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

Wednesday, March 25, 2026

[DMANET] The 9th DIS Conference – May 31–June 4, 2026, Czech Republic

Dear Colleague,

The *9th International Conference on the Dynamics of Information Systems
(DIS 2026)* will take place *May 31 – June 4, 2026* at *Jan Evangelista
Purkyně University, Ústí nad Labem, Czech Republic*—just 80 km from Prague
and accessible via a direct train (one stop).

*Conference Focus:*
DIS 2026 explores cutting-edge topics in information science, AI, machine
learning, optimization, operations research, and data-driven
applications across diverse domains.

*Topics Include (but are not limited to):*

- Information science & uncertainty modeling
- Optimization & operations research
- Machine learning & AI
- Data science & computational medical analysis
- Quantum information, dynamical systems, and robotics
- Applications in economics, energy, environment, and more

*Important Dates:*

- Submission Deadline: April 5, 2026
- Author Notification: April 20, 2026
- Camera-ready Submissions for LNCS: July 1, 2026

*Plenary Speakers:*

- Panos M. Pardalos,
<https://scholar.google.com/citations?user=4e_KEdUAAAAJ&hl=en> University
of Florida, USA
- Peter Richtárik
<https://scholar.google.com/citations?user=pGh242UAAAAJ&hl=en>, KAUST,
Saudi Arabia
- Roman Belavkin,
<https://www.mdx.ac.uk/about-us/our-people/staff-directory/dr-roman-belavkin/>
Middlesex
University, UK
- Zbyšek Posel <https://ki.ujep.cz/cs/personalni-slozeni/zbysek-posel/>,
UJEP, Czech Republic

All accepted papers will be published in *Springer LNCS proceedings*.

*Learn More & Contact:*
https://dis2026.ujep.cz/
hossein.moosaei@gmail.com

Best Regards,

Hossein Moosaei

[DMANET] Call for sessions in the stream HPC/GPU Optimization at the 24th IFORS conference (July 12-17 2026, Vienna, Austria)

Dear colleagues,

We welcome you to the 24th Conference of the International Federation of Operational Research Societies,
12-17 July 2026, in Vienna, Austria: https://ifors2026.at/

This is an open invitation for session proposals in the HPC/GPU Optimization stream.

This stream is focusing on the use of HPC systems, HPC hardware, GPU and
non-conventional accelerators for optimization, in particular for
solving practically relevant and/or large-scale problems. Use of OR
techniques for efficient resource use and design of heterogeneous HPC
systems are in scope too. Sessions on algorithm modifications,
implementation aspects, and numerical aspects, in particular in view of
low precision hardware units are particularly encouraged.

There is still room to propose sessions - please send a your proposal to me to be invited on the Euro-Online session management tool. Sessions normally last for 90 minutes and should include 4 talks.

Important dates for participants:
————————

April 25, 2026 — Early bird registration deadline

May 1, 2026 — Final registration deadline for authors

Yours,
Utz-Uwe Haus

--
Dr. Utz-Uwe Haus, Sr. Distinguished Technologist uhaus@hpe.com
Head of HPE EMEA Research Lab, part of HPE Labs
https://hpe.com/emea_europe/en/compute/hpc/emea-research-lab.html

[DMANET] PhD position in Data Analytics and Operations Research at the University of Duisburg-Essen (Rossana Cavagnini)

The Chair of Business Administration with a focus on Data Analytics at the Mercator School of Management (MSM), University of Duisburg-Essen (Campus Duisburg), invites applications for a Research Associate (Wissenschaftliche:r Mitarbeiter:in) position. Our chair specializes in innovative techniques at the interface of Data Analytics and Operations Research, particularly with applications in Supply Chain Management and Logistics. You will engage in exciting research projects, contribute to international publications, support teaching in Bachelor's and Master's programs, and participate in interdisciplinary faculty activities.

Your Profile:
- Completed Master's or equivalent degree in Business Administration, Industrial Engineering, Operations Research, Data Science, Mathematics, or a related quantitative field (minimum regular study period of 8 semesters)
- Strong background in quantitative methods, operations research, optimization, statistics, or data analytics
- Proficiency in programming languages such as Python and C++ is required
- Knowledge of LaTeX is a plus
- Interest in Supply Chain Management and Logistics applications
- Ability to work independently and collaboratively in a research team
- Very good English skills; German skills are advantageous but not mandatory

We Offer:
- A fixed-term contract for 36-months in salary group EG 13 TV-L, approximately 26 hours/week (65% position), starting as soon as possible
- Participation in national and international workshops and conferences
- Comprehensive support to foster your research career
- A stimulating and diverse research and teaching environment
- Family-friendly policies, including childcare support and advice for family care tasks
- Possibility to pursue a PhD with strong institutional support
- Excellent public transport connections and free parking
- Attractive sports and health programs (e.g., university sports)
- Flexible working, including home office options

How to Apply:
Please send your application (cover letter, CV, academic transcripts, all in one PDF file) with the reference number 128-26 via email to J. Prof. Dr. Rossana Cavagnini, Faculty of Business Administration, University of Duisburg-Essen, 47048 Duisburg, Germany. Email: rossana.cavagnini@uni-due.de. The deadline is on April 21st, 2026. The University of Duisburg-Essen welcomes applications from candidates of all backgrounds and strictly endorses equal opportunities and diversity.
For further information, please contact J. Prof. Dr. Rossana Cavagnini via email or visit the following website: https://www.uni-due.de/karriere/stelle.php?kennziffer=128-26

[DMANET] British Early Career Mathematicians' Colloquium: Registration Open and Call for Abstracts

Dear all,

Registration for the British Early Career Mathematicians' Colloquium (BECMC) is now open until May 15th 2026. The BECMC is a three day colloquium for early career mathematicians held at the University of Birmingham Edgbaston Campus from 24th to 26th June 2026.

Our aim is to consolidate the network among early career researchers and postgraduate students from across the country, particularly those studying branches of mathematics prominent at our university - Algebra, Analysis, Combinatorics, Mathematical Biology and Modelling, and Statistics.

This three-day event will be divided into two parallel sessions (pure mathematics and applied mathematics), each with plenary speakers as well as contributed postgraduate talks. There will be an included poster session to accompany rapid fire talks given by attendees. Any UK based PhD mathematics student is welcome to submit an abstract for either a talk or a poster. The £20 admission fee will cover attendance at the conference, refreshments, lunch all days as well as a conference dinner on 25th June. For further details please see our website.

https://web.mat.bham.ac.uk/BYMC/

Best wishes,
Adele Maltempo (she/her) and Matthew Jenkins (they/them)
On behalf of the BECMC 2026 committee

[DMANET] Call for bids to host COMSOC 2027

[Apologies for cross posting]

# Call for Bids to Host COMSOC 2027

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

It is my pleasure to open the call for bids to host **COMSOC 2027**, the
11th International Workshop on Computational Social Choice.

In previous years, COMSOC has been held as a 3- to 4-day meeting
attracting around 100 participants. The workshop usually has 3-5 invited
talks and 40-60 contributed papers (oral and poster). In 2008 and 2010
the workshop was preceded by an extra day of introductory tutorials, and
in 2016 by an industry day. These additional events were attended by
more than half of the workshop participants.

## How to Submit a Bid

If you would like to host COMSOC 2027, please email your bid to:

- **Jiehua Chen** (primary contact): jiehua.chen@ac.tuwien.ac.at

or to one or more other members of the COMSOC steering committee:

- **Omer Lev**: omerlev@bgu.ac.il
- **Marcus Pivato**: marcuspivato@gmail.com
- **Péter Biró**: biro.peter@krtk.elte.hu

**Deadline: 15 June 2026.**

We encourage everyone to apply. However, please bear in mind that we aim
for COMSOC to balance between locations that are geographically
convenient for large segments of the community (mainly Europe and North
America) and locations with potential for growth.

## What to Include in Your Bid

**(1) Location and Facilities.** Where do you propose to hold COMSOC
2027? Please state both the city and the exact venue, and comment on the
suitability of the available facilities for the scientific program as
well as for lunches and coffee breaks. Please also comment on the
accessibility and attractiveness of the location, and on the
availability of suitable accommodation (including low-budget options)
and transport.

**(2) Organization.** Who would be the main local organizer? Which
institution (e.g., university) would host the workshop? Please also
comment on local research groups that would benefit from attracting COMSOC.

**(3) Schedule.** What dates do you suggest? The workshop should take
place in or around May-September 2027. Are there any local constraints?
Are you aware of any other international events that may affect the
choice of dates (see partial list below)? What schedule do you suggest
for the paper reviewing procedure?

**(4) Budget.** How do you intend to finance the workshop? Please
provide a preliminary budget. Expenses to keep in mind include: invited
speakers, coffee breaks, lunches, a social dinner, and possibly room and
equipment hire, secretarial and administrative support, and a half-day
excursion. What level of registration (regular and student) fees do you
anticipate, and what would they cover? Please ensure that fees are as
low as possible.

Finally, please include any other issues you consider important.

All potential proposers are encouraged to contact us informally before
submitting a bid. Please do not hesitate to get in touch with any
questions, e.g., additional funding opportunities etc.

## Potentially Conflicting Events

- **IJCAI 2027** (typically July/August)
- **AAMAS 2027** (typically May/June)
- **EC 2027** (typically June/July)
- **SAGT 2027** (typically September)

[DMANET] Call for Attendees: 4th CINI HPC Summer School 2026

** Call for Attendees **

We are pleased to announce the 4th CINI HPC Summer School 2026, which will take place from 15–19 June 2026 at the University of Salento, Lecce, Italy. Organized by the CINI HPC National Laboratory jointly with the HPC Laboratory at the University of Salento, the Summer School will address the design of scalable parallel algorithms and the use of standard "de facto" programming models and tools crucial for enhancing HPC application performance, including practical hands-on sessions focusing on MPI, OpenMP, GPU programming, and performance monitoring. The curriculum aims to boost participants' capabilities in utilizing HPC for complex scientific and industrial tasks, bringing together theoretical and technical viewpoints. Over the course of five days, participants will gain insights into the design and analysis of parallel algorithms and related, current technologies.

Dr. Alberto Baiardi, Staff Research Scientist at IBM Zurich, will open the Summer School with a keynote address titled "Quantum Computing for Natural Science Simulations".

We are seeking highly motivated students, for a learning experience focused on leading-edge subjects. You will be taught by University of Salento faculty members jointly with CINECA leading experts, and attend classes with top students that share your interests. The Summer School represents a unique opportunity to participate in an exciting laboratory of teaching and active learning.

Target audience

The target audience includes Master's graduates, Ph.D students, early-stage Postdoc, and engineers.
The school welcomes everyone regardless of gender, age, sexual orientation, disability, physical appearance, race, or religion. Applicants will be evaluated on their CV.

Requirements

Applicants are expected to:

- Posses working knowledge of C/C++, Unix (Linux etc), terminal, editor and compilers;
- Bring their laptop to write, compile and execute parallel code.

School Fees

- Ph.D. students, post-docs and Master's graduates: 350 euro
- Faculties/Researchers: 400 euro
- Professionals: 500 euro

The fee provides access to all of the lectures, teaching materials and social event/dinner.
PLEASE NOTE: The electronic payment also includes, additionally, 2 euro, which represent the payment of stamp duty, a mandatory tax obligation under Italian law.

Deadlines

Applications (available shortly): until April 18, 2026
Notification of acceptance: April 27, 2026
Fee payment for enrolment: no late than May 4, 2026
Summer School: June 15-19, 2026

Submitting your application is a two-step process. Both steps are MANDATORY.

1) for the initial online registration, please use this link: https://conference.unisalento.it/event/19/

You are required to register, but please don't pay in advance the registration fee. The Summer School Committee will evaluate the requests, and admit the applicants. Only admitted applicants - up to 50 - must, upon receiving confirmation of admission, proceed with the fee payment.

2) The application form and the required documentation must be sent to the Summer School Committee using the documents available at this link: https://trasparenza.unisalento.it/page/5/details/18396/dii-avviso-di-apertura-delle-candidature-hpc-summer-school-aa-20252026.html

NOTE: the website provides the call and application form both in English (Avviso_EN_signed.pdf and Form_EN.docx) and Italian (Avviso Summer School_signed.pdf and Fac simile.docx).

Further information about the CINI HPC Summer School can be found at:
https://hpcsummerschool.massimocafaro.it

[DMANET] MFCS 2026 - Second Call for Papers

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

MFCS 2026 - Second Call for Papers

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

The 51th conference on Mathematical Foundations of Computer Science (MFCS) will take place in:

Paris, France August 24th-28th, 2026

MFCS is among the conferences with the longest history in the field — the first conference in the series was held already in 1972. Traditionally, the conference moved between the Czech Republic, Poland, and Slovakia; since 2013, the conference has traveled around Europe.

The conference will be preceded, on August 23, by the Young Research Forum Workshop intended for students and postdocs.

NEW: Up to 10 papers will be accepted by the program committee, for which no presence onsite is required.

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

Important dates and information

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

Submissions: April 24th, 2026

Author notification: June 19th, 2026

Camera-ready version: June 26th, 2026

Conference: August 24th-28th, 2026 (YRF Workshop on August 23rd, afternoon)

Deadlines are firm; late submissions will not be considered. All dates are AoE.

Conference website: https://mfcs2026.irif.fr/

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

Invited Speakers

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

Jakub Orpšal (University of Birmingham, UK)
Damien Pous (CNRS, ENS Lyon, France)
Noga Ron-Zewi (University of Haifa, Israel)
Tatiana Starikovskaya (ENS Paris, France)
Ryan Williams (MIT, USA)

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

Submission guidelines

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

1) Papers must present original research on the theory of computer science. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as arXiv.

2) Submissions take the form of an extended abstract of up-to 12 pages (LIPIcs document class), excluding title page, references and a clearly labelled appendix. The appendix may consist either of omitted proofs or of a full version of the submission, and it will be read at the discretion of program committee members. The extended abstract has to present the merits of the paper and its main contributions clearly, and describe the key concepts and technical ideas used to obtain the results. Submissions must provide the proofs which can enable the main mathematical claims of the paper to be verified.

3) Submissions authored or co-authored by members of the program committee are allowed.

4) At the time of submission, authors may declare that they are unable to attend the conference in Paris and therefore cannot give an in-person presentation. This choice will not influence the evaluation of submissions by the Program Committee. The Program Committee will rank all papers irrespective of their presentation status. Approximately 80 papers will be selected for in-person presentation, and up to 10 papers will be accepted without presentation. All accepted papers will be published in the same proceedings. This option is intended for authors who wish to publish their results at the conference but, for various reasons (e.g., family or financial constraints), are unable to attend the conference in person.

5) At least one author of each accepted paper with presentation is expected to register for the conference, and give the talk in-person. At least one author of each accepted paper without in-person presentation is expected to register for the conference for a reduced fee, and for each such paper the authors are expected to provide a pre-recorded video of the paper presentation that will be made available on-line during the conference. (Pre-recorded videos of the other papers are optional.)

6) Papers authored only by students should be marked as such at the time of submission in order to be eligible for the best student paper award.

7) MFCS proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. The camera-ready version of accepted papers will need to comply with the LIPIcs style.

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

MFCS 2025 Programme Committee

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

Michal Koucký (Charles University, Czech Republic) - chair
Daniela Petrișan (Université Paris Cité, IRIF, France) - co-chair

C. Aiswarya (Chennai Mathematical Institute, India)
Christel Baier (Technische Universität Dresden, Germany)
Ivona Bezáková (Rochester Institute of Technology, USA)
Markus Bläser (Saarland University, Germany)
Achim Blumensath (Masaryk University, Czech Republic)
Martin Böhm (University of Wrocław, Poland)
Édouard Bonnet (CNRS, ENS de Lyon, France)
Joshua Brakensiek (University of California, Berkeley, USA)
André Chailloux (Inria de Paris, France)
Panagiotis Charalampopoulos (King's College London, UK)
Lorenzo Clemente (University of Warsaw, Poland)
Ugo Dal Lago (University of Bologna, Italy)
Debarati Das (Pennsylvania State University, USA)
Samir Datta (Chennai Mathematical Institute, India)
Jakub Gajarský (Masaryk University and University of Warsaw, Czech Republic/Poland)
Anna Gál (University of Texas at Austin, USA)
Sumegha Garg (Rutgers University, USA)
Mayank Goswami (City University of New York, USA)
Florian Horn (Université Paris Cité, IRIF, CNRS, France)
Dušan Knop (Czech Technical University, Czech Republic)
Hanna Komlos (Max Planck Institute for Informatics, Germany)
Stephan Kreutzer (TU Berlin, Germany)
Bruno Loff (University of Lisbon, Portugal)
Wolfgang Merkle (Heidelberg University, Germany)
Igor Carboni Oliveira (University of Warwick, UK)
Kristýna Pekárková (AGH University of Krakow, Poland)
Thomas Place (University of Bordeaux, LABRI, France)
Cécilia Pradic (Swansea University, UK)
Jakub Przybyło (AGH University of Krakow, Poland)
Colin Riba (ENS de Lyon, LIP, France)
Kilian Risse (Lund University, Sweden)
Robert Robere (McGill University, Canada)
Michał Skrzypczak (University of Warsaw, Poland)
Paweł Sobociński (TalTech, Estonia)
Henning Urbat (FAU Erlangen-Nürnberg, Germany)
Pavel Veselý (Charles University, Czech Republic)
Philip Wellnitz (National Institute of Informatics, Japan)
Sarah Winter (Université Paris Cite, IRIF, CNRS, France)
James Worrell (University of Oxford, UK)
Standa Živný (University of Oxford, UK)

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

Tuesday, March 24, 2026

[DMANET] 3rd Call for Papers of QEST+FORMAT 2026

=======================================
3rd Call for Papers QEST+FORMATS 2026

September 2-4, 2026, Liverpool, UK

https://www.qest-formats.org/
https://confest-2026.github.io/

=======================================
Dates:

Abstract submission: April 3, 2026
Paper submission: April 10, 2026
Artifact submission: April 17, 2026
Author notification: May 24, 2026
Camera-ready submission: June 14, 2026

=======================================
Scope and Topics

The two flagship conferences QEST (International Conference on
Quantitative Evaluation of SysTems) and FORMATS (International
Conference on Formal Modeling and Analysis of Timed Systems) are
pursuing a strategic process of joining forces and sparking a new
joint conference for quantitative modeling, analysis, and
verification. This culminated in 2024 in the first QEST+FORMATS joint
conference. In 2026, the two conferences will form the third
QEST+FORMATS joint conference, which will be held on 2-4 September
2026 in Liverpool, UK, as part of the CONFEST 2026 umbrella
conference.

The joint conference is the leading forum for the quantitative
evaluation and verification of systems. QEST+FORMATS aims to promote
the study of fundamental and practical aspects of systems with
quantitative nature (such as probability, timing, and cost). It aims
to bring together researchers from different disciplines who share
interests in the modelling, design, and analysis of computational
systems. Systems of interest include biological and chemical systems;
computer networks; critical infrastructures; cyber-physical systems;
data-driven AI systems; energy systems; hardware and software systems;
industrial systems; mobility networks; and quantum systems. The
QEST+FORMATS joint conference also aims to attract researchers
interested in real-time issues in hardware design, performance
analysis, real-time software, scheduling, semantics and verification
of timed, hybrid, and probabilistic systems. In general, the
conference aims to attract experts in quantitative and timed systems
from any domain.

Topics and scientific areas of interest include:

--- Models and metrics for the correctness, performance, reliability,
safety, and security of systems (stochastic, probabilistic, quantum,
and non-deterministic models including Markov chains, automata, Petri
nets, process algebra, and their variations);

--- Languages and methods for the specification of quantitative
properties of systems;

--- Techniques, algorithms, and data structures for the analysis,
evaluation, and verification of the above models, e.g., for model
checking, testing, constraint solving, scheduling, optimization, and
worst-case execution time analysis;

--- Quantitative and probabilistic aspects of programming;

--- Data-driven and machine-learning techniques for the analysis,
prediction, and verification of quantitative properties of systems;

--- Case studies that highlight the role of quantitative
specification, modeling, and evaluation in the design and analysis of
systems, with emphasis on emerging problems and technologies, or novel
domains;

--- Software tools to support the practical application of research
results in all of the above areas.

=======================================
Confirmed Invited Speakers

Ezio Bartocci, TU Wien, Austria
Jane Hillston, University of Edinburgh, UK
Kim Guldstrand Larsen, Aalborg University, Denmark

=======================================
Submissions

QEST+FORMATS 2026 considers three types of submissions (authors will
be able to specify the type of contribution upon submission):

--- Research papers: Theoretical and methodological contributions that
advance the understanding of a topic or issue, or describe the
development of new analysis processes and techniques.

--- Case study papers: Contributions that present practical
applications of quantitative methods to challenging real-world case
studies. Case study papers shall provide detailed evaluation and
insights, and highlight the value added to the domain experts.

--- Tool papers: Contributions introducing new tools or significant
improvements of existing ones, and the formalisms they support. These
papers shall focus on the software architecture, practical
implementation, and evaluation (e.g., usability, scalability, and
effectiveness). Tool papers must be accompanied by an artifact in the
Artifact Evaluation as detailed below.

All three types of papers can be regular or short:
--- Regular papers must not exceed 16 pages, excluding references.
--- Short papers should be limited to 7 pages, also excluding references.
--- All papers can have an appendix containing supporting material. Note
that reviewers are not required to read the appendix to fully assess the
merits of the paper.

All papers must be submitted in Springer's LNCS format and will
undergo a rigorous single-blind review process. All submitted papers
must be unpublished and not be submitted for publication elsewhere.
Papers should be submitted electronically using EasyChair (Track:
QEST+FORMATS 2026).

Springer encourages authors to include their ORCIDs in their papers.
Authors should consult Springer's authors' guidelines and use
Springer's LaTeX templates for the preparation of their papers.
Submitted papers not complying with the above guidelines may be
rejected without undergoing review.

We are considering awards for best papers and best artifacts.

=======================================
Publications

All accepted papers need to be presented and discussed at the
conference by one of the authors. Similarly to last year, the
QEST+FORMATS 2026 proceedings will be published in the Springer LNCS
series indexed by ISI Web of Science, Scopus, ACM Digital Library,
DBLP, Google Scholar. All submitted papers will be evaluated by at
least three reviewers on the basis of their originality, technical
quality, scientific or practical contribution to the state of the art,
methodology, clarity, and adequacy of references.

=======================================
Special Issue

We are working on a special issue in a Q1 journal. A selection of the
best papers will be invited to submit an extended version of their
work to a special issue in an internationally recognized journal.

=======================================
Artifact Evaluation

Reproducibility of experimental results is crucial to foster an
atmosphere of trustworthy, open, and reusable research. To improve and
reward reproducibility, QEST+FORMATS 2026 will include a dedicated
Artifact Evaluation (AE). Submission of an artifact is mandatory for
tool papers (both regular and short), and optional but encouraged for
research and case study papers where it can support the results
presented in the paper.

[DMANET] SC-Square 2026: Second Call for Papers

SC-Square 2026: 11th International Workshop on Satisfiability Checking and Symbolic Computation

July 13, 2026, Oldenburg Germany

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

The 11th SC-Square Workshop is a satellite event of ISSAC, held at the University of Oldenburg in Germany, from July 13 to 17, 2026.

SC-Square Workshop website:
https://www.sc-square.org/CSA/workshop11.html

ISSAC conference website:
https://www.issac-conference.org/2026/

Key Dates
Abstract submission: April 10, 2026
Submission deadline: April 17, 2026
Notification: May 22, 2026
Final version: June 1, 2026
Workshop date: July 13, 2026

Scope
Symbolic Computation is concerned with the efficient algorithmic determination of exact solutions to complicated mathematical problems. Satisfiability Checking has recently started to tackle similar problems but with different algorithmic and technological solutions.

The two communities share many central interests, but researchers from these two communities rarely interact. Also, the lack of common or compatible interfaces for tools is an obstacle to their fruitful combination. Bridges between the communities in the form of common platforms and road-maps are necessary to initiate an exchange, and to support and direct their interaction. The aim of this workshop is to provide an opportunity to discuss, share knowledge and experience across both communities.

Invited Speakers
Anna Maria Bigatti<https://scholar.google.com/citations?user=iRTyqncAAAAJ&hl=it> (Università degli Studi di Genova, Italy)
Mahsa Shirmohammadi<https://www.irif.fr/~mahsa/> (CNRS, Université Paris Cité, France)

Submitting to the Workshop
The workshop series has emerged from an H2020 FETOPEN CSA project "SC-Square", which ran from 2016 to 2018. It has been continued aiming at building bridges between Satisfiability Checking and Symbolic Computation. It is open for submission and participation to everyone interested in the topics, whether or not they were members or associates of the original project.

The topics of interest include but are not limited to:

*
Computer Algebra and Symbolic Computation (CA)
*
Satisfiability Checking (SAT/SMT)
*
Algorithms for logical theories of arithmetics, including quantifier elimination and decision procedures
*
Computational Geometry
*
Algorithmic Group Theory
*
Formalized mathematics, especially in interactive theorem provers
*
Tools in SAT/SMT/CA, including tools that combine Symbolic Computation and Satisfiability Checking
*
Applications relying on Symbolic Computation or on Satisfiability Checking, including hybrid systems and controls

Submission guidelines
Submissions should be in English, formatted in Springer LNCS style and submitted via
https://hotcrp.software.imdea.org/scsquare/

We invite four types of submissions:

(1) FULL PAPERS on research, case studies or tool development should present unpublished work not submitted elsewhere (with a limit of 16 pages, not counting references)
(2) EXTENDED ABSTRACTS on research, case studies or tool development should present unpublished (potentially ongoing) work not submitted elsewhere (3–5 pages, not counting references)
(3) SHORT SURVEYS that describe/explain an existing body of work in an original way (5–8 pages, not counting references)
(4) PRESENTATION-ONLY submissions on already published work, work to be published elsewhere, or work in progress on SC-Square related open problems or future challenges. Please submit an abstract for approval by the PC (with a limit of 2 pages).

To receive the appropriate level of peer review, please select the relevant category for your paper on the submission site.

For consistency, all submissions must use the LNCS style. Current lncs latex files are available from "LaTeX2e Proceedings Templates download" at:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines

We plan to publish the proceedings of the workshop in digital form, hosted with CEUR-WS (see http://ceur-ws.org/).
People from industry and business are warmly invited to submit papers to describe their problems, challenges, goals, and expectations for the SC-Square community.

Workshop Co-Chairs
Katherine Kosaian<https://sites.google.com/view/katherinekosaian> (University of Iowa, USA)
Alessio Mansutti<https://alessiomansutti.github.io/> (Imdea Software Institute, Spain)

Program Committee
Kyungmin Bae<http://sv.postech.ac.kr/kmbae/> (Pohang University of Science and Technology, South Korea)
Rizeng Chen<https://xiaxueqaq.github.io/> (Peking University, China)
Xin Chen<https://shinchern.github.io/> (University of New Mexico, US)
Ruiwen Dong<https://sites.google.com/view/ruiwen-dong/> (University of Oxford, UK)
Matthew England<https://matthewengland.coventry.domains/index.html> (Coventry University, UK)
Stéphane Graham-Lengrand<https://www.csl.sri.com/~sgl/> (SRI, US)
Alberto Griggio<https://es-static.fbk.eu/people/griggio/> (Fondazione Bruno Kessler, Italy)
Hoon Hong<https://hong.math.ncsu.edu/> (North Carolina State University, US)
Dejan Jovanovic<https://dddejan.github.io/> (AWS, US)
Ariel Kellison<https://ak-2485.github.io/> (Code Metal, US)
George Kenison<https://georgekenison.github.io/> (KU Leuven, Belgium)
Hanna Lachnitt<https://lachnitt.github.io/> (Stanford University, US)
Pierre Mathonet<https://scholar.google.com/citations?user=KSD99-cAAAAJ&hl=en> (Université de Liège, Belgium)
Guillaume Melquiond<https://guillaume.melquiond.fr/> (Inria and ENS Lyon, France)
Marc Moreno Maza<https://www.csd.uwo.ca/~mmorenom/homepage-moreno.html> (University of Western Ontario, Canada)
Mathias Preiner<https://cs.stanford.edu/~preiner/> (Stanford University, US)
Philipp Rümmer<http://www.philipp.ruemmer.org/> (University of Regensburg, Germany)
Mohab Safey El Din<https://perso.lip6.fr/Mohab.Safey/> (Sorbonne Université, France)
Žaneta Semanišinová<https://tu-dresden.de/mn/math/algebra/das-institut/beschaeftigte/zaneta-semanisinova> (TU Dresden, Germany)
Zhikun She<https://scholar.google.com/citations?user=J8viQpMAAAAJ&hl=en> (Beihang University, China)

[DMANET] Launch of the BOS Webinar Series

The BOS Webinar Series is a new initiative of the Bilevel Optimization Society (BOS), which is part of the Mathematical Optimization Society (MOS). This online seminar series is open to anyone interested in bilevel optimization and provides a platform to present new ideas, share results, and discuss open questions in theoretical, computational, and applied bilevel optimization. Each season, the series features talks by internationally recognized experts alongside emerging researchers, highlighting recent and impactful advances in bilevel optimization.

Details: Seminars are scheduled bi-weekly on Tuesdays at 4:00 pm CET via Microsoft Teams. Each session is approximately 50 minutes long and may consist of either one 40-minute talk or two 20-minute talks, followed by discussion. For more information, please visit https://bileveloptimization.org/bos_webinar. Updates and Teams links will be shared via the BOS mailing list. To join the BOS mailing list, please use the membership form at https://bileveloptimization.org/membership.

Schedule:
April 14: Opening address by Alain Zemkoho (BOS President, University of Southampton), followed by Stephan Dempe (TU Bergakademie Freiberg)
April 28: Martina Cerulli (University of Salerno) and Kübra Tanınmış (Koç University)
May 12: Miguel F. Anjos (University of Edinburgh)
May 26: Bo Lin (University of Toronto) and Mohammad Sadegh Salehi (Independent Scholar)
June 9: Didier Aussel (University of Perpignan)
June 23: Sebastian Vasquez (Carnegie Mellon University) and Noah Weninger (University of Waterloo)

We look forward to seeing you online!
Yasmine Beck, Kuang Bai, and Nagisa Sugishita
**********************************************************
*
* 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 Prague: Solving Large-Scale Scheduling Problems: Hybridization, Parallelism, and Model Diversity in Constraint Programming

Offer Description:

Scheduling problems such as the Resource-Constrained Project Scheduling
Problem (RCPSP) remains one of the central challenges in combinatorial
optimization, particularly in large-scale industrial settings. As
instance sizes grow and objective functions become more sophisticated,
classical exact or single-strategy heuristic approaches are no longer
sufficient. Future progress requires carefully designed hybrid and
parallel solution frameworks.
Today, Large Neighborhood Search (LNS) is the dominant heuristic
paradigm in modern constraint programming (CP) scheduling solvers such
as IBM ILOG CP Optimizer, Google OR-Tools, and OptalCP. Compared to
traditional local search, LNS offers improved diversification and a
stronger ability to escape local optima by iteratively destroying and
repairing large fragments of a schedule. In parallel, Failure-Directed
Search (FDS) provides a systematic mechanism for exploring the entire
search space using a fail-first principle to prove infeasibility or
optimality.
While this combination is highly effective for classical objectives such
as makespan minimization, CP solvers become less efficient when handling
more complex criteria, such as cost-aware scheduling, or specific
constraints, such as sequence dependent setup times. In such cases,
purely generic search strategies may struggle to quickly produce
high-quality incumbents, which are crucial for pruning the search space.
A promising research direction is the integration of problem-oriented
heuristics within the CP solving process. Fast constructive or
improvement heuristics tailored to specific RCPSP structures can
generate strong feasible solutions early in the search. These solutions
provide tight upper bounds that can be injected into the CP model as
hard objective constraints, significantly reducing the search space
explored by FDS. The stronger the incumbent, the more aggressively the
complete search can prune suboptimal regions.
Beyond hybridization, large-scale RCPSP strongly benefits from parallel
search architecture. Modern CP solvers, such as OptaCP, support multiple
solver workers running concurrently. Instead of replicating identical
models across workers, we propose exploiting model diversity: each
worker can employ a different CP model formulation, search strategy, or
propagation emphasis. For example, one worker may use a time-indexed
formulation, another a start-time interval-based model, and another a
precedence- or flow-oriented reformulation. Similarly, workers can
differ in symmetry braking, variable ordering, restart policies, or LNS
neighborhood design.
Such heterogeneous parallelism increases robustness and coverage of the
search space. Workers can share global incumbents, objective bounds, and
nogoods during execution. When one worker discovers a high-quality
solution, all others immediately benefit through tighter pruning.
Conversely, proofs of infeasibility or bound improvements obtained by
one model can accelerate convergence across the entire portfolio. This
cooperative, portfolio-based architecture combines intensification
within each worker with diversification across workers.
The proposed research aims to design and analyze these hybrid and
parallel CP frameworks namely for large-scale RCPSP. Emphasis will be
placed on principled model reformulation, effective bound sharing, and
scalable synchronization mechanisms that preserve solver efficiency
while maximizing information exchange.

[PER] L. Perron, P. Shaw, V. Furnon, Propagation guided large
neighborhood search, in: M. Wallace (Ed.), Principles and Practice of
Constraint Programming – CP 2004, Springer Berlin Heidelberg, Berlin,
Heidelberg, 2004, pp. 468–481.
[OPT] ScheduleOpt: OptalCP's solver landing page (2023). URL
https://scheduleopt.com/
[VIL ]P. Vilím, P. Laborie, P. Shaw, Failure-directed search for
constraint-based scheduling, in: International Conference on Integration
of Constraint Programming, Artificial Intelligence, and Operations
Research, Springer, 2015, pp. 437–453.

Contract details and dates
Hours Per Week: 40
Offer Starting Date: April 1, 2026

Application Deadline
Date and Time: March 31, 2026 - 23:45 (Europe/Prague)

Company/Institute:
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
City: Prague
Postal Code: 160 00
Street: Jugoslávských partyzánů 1580/3

Skills/Qualifications:
Motivation to perform excellent research, become part of the world's
research communities in your field, and publish in first-tier scientific
conferences and journals,
Ph.D. degree or equivalent (awarded or to be completed soon),
Co-author of at least 3 papers published in impact factor journals or
prestigious conferences,
Professional proficiency in spoken/written English (knowledge of the
Czech language is not required).

Specific Requirements: good background in scheduling, combinatorial
optimization and algorithm design/implementation.

Benefits:
An initial appointment for 1 year (with an extension of up to 2 years)
Salary around 70000 CZK gross monthly; check the Numbeo database for
the cost of living in Prague
Full social and health insurance
30 days of paid annual leave
Children's corner, kindergarten, and elementary school operated by the
Czech Technical University in Prague
Additional benefits such as subsidized meals, yearly benefits
supporting recreational and sports activities, as well as health care
programs
An informal and inclusive international working environment at the
Industrial Informatics Department, CIIRC, CTU in Prague.

Selection process:
Interested candidates are invited to submit their applications at:
https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID:
03-Postdoc-Hanzalek]

The application package should contain:
Motivation letter (up to two pages), stating personal goals and
research interests
Academic curriculum vitae, including a list of publications
highlighting the three most important ones
Contact details for two to three referees who could support your
application,
A copy or a link to your Ph.D. thesis,
Date of your Ph.D. award or the expected date of your Ph.D. thesis
defense.

Euraxess code:
https://www.euraxess.cz/jobs/415419

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

[DMANET] Postdoc position in Prague: Learning-Augmented Combinatorial Optimization Algorithms for Scheduling and Packing

Offer Description:

The project addresses difficult scheduling and packing problems in the
sense of computational complexity, for which classical exact approaches
are often impractical at realistic scales. The goal is to design new
algorithmic frameworks that combine established tools from Operations
Research with modern Machine Learning methods to produce high-quality
solutions within acceptable computational times. While rooted in OR, the
project requires and will further develop strong competencies in Machine
Learning.

Over the past decade, learning-augmented optimization has emerged as a
promising paradigm. In exact methods, machine learning has been used to
tune solver parameters or guide search in tree-based algorithms for
mathematical programming. In heuristic optimization, learning has
supported diversification strategies, automated selection of algorithms
for specific instances, and even direct construction of solutions. More
recently, reinforcement learning and deep learning techniques have been
used to guide local search procedures, particularly for transportation
and routing problems, demonstrating substantial performance improvements.

This project will focus on scheduling and packing settings, developing
general methodologies rather than problem-specific tricks. Two
complementary research directions will be pursued.

First, machine learning will be used to improve the parameterization of
heuristic algorithms.

Second, learning methods—especially reinforcement learning—will be
employed to guide the exploration of solution spaces. This includes
selecting promising neighborhoods, prioritizing moves in local search,
or constructing solutions incrementally.

The research will build on several successful applications of ML in
combinatorial optimization. These include reinforcement learning–guided
greedy procedures for graph optimization problems, predictive models for
deciding when decomposition techniques should be applied, and
classifiers that identify structural characteristics of high-quality
solutions. Additional directions involve predicting optimal objective
values for complex engineering design problems and developing
reinforcement learning–enhanced metaheuristics, such as iterated local
search for makespan minimization in advanced manufacturing scheduling.

The developed methods will be evaluated on challenging NP-hard
scheduling and packing problems, including both well-studied benchmark
problems with strong existing heuristics and more applied, real-world
problems where current methods remain insufficient. The objective is to
demonstrate that the integration of ML and OR techniques can yield
robust improvements across different problem types.

About the group: The Optimization Group, led by Zdenek Hanzalek, focuses
on scheduling and combinatorial optimization. The group collaborates
strongly with high-tech companies (CEZ – Czech Energy Group, Porsche
Engineering Services, EATON, Skoda Auto, ST Microelectronics,
Volkswagen, DHL, …). Zdenek is the principal investigator of the
Roboprox project and organizer of SchedulingSeminar.com.

[1] Bengio, Y., Lodi, A. Prouvost, A. (2021). Machine Learning for
Combinatorial Optimization: a Methodological Tour d'Horizon, European
Journal of Operational Research, 290:405-421.
[2] Nina Mazyavkina, Sergey Sviridov, Sergei Ivanov, Evgeny Burnaev,
Reinforcement learning for combinatorial optimization: A survey,
Computers & Operations Research, Volume 134, 2021.
[3] Heinz, V.; Hanzálek, Z.; Vilím, P.: Reinforcement Learning for
Search Tree Size Minimization in Constraint Programming: New Results on
Scheduling Benchmarks, Computers & Industrial Engineering, Volume 209,
November 2025, 111413.
[4] Roman Václavík, Antonín Novák, Přemysl Šůcha, Zdeněk Hanzálek,
Accelerating the Branch-and-Price Algorithm Using Machine Learning,
European Journal of Operational Research, Volume 271, Issue 3, 2018,
Pages 1055-1069.
[5] Grus, J.; Hanzalek, Z.: Automated placement of analog integrated
circuits using priority-based constructive heuristic, Computers &
Operations Research, Volume 167, 106643, July 2024.

Contract details and dates
Hours Per Week: 40
Offer Starting Date: April 1, 2026

Application Deadline
Date and Time: March 31, 2026 - 23:45 (Europe/Prague)

Company/Institute:
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
City: Prague
Postal Code: 160 00
Street: Jugoslávských partyzánů 1580/3

Skills/Qualifications:
Motivation to perform excellent research, become part of the
world's research communities in your field, and publish in first-tier
scientific conferences and journals,
Ph.D. degree or equivalent (awarded or to be completed soon),
Co-author of at least 3 papers published in impact factor journals
or prestigious conferences,
Professional proficiency in spoken/written English (knowledge of
the Czech language is not required).

Specific Requirements: good background in scheduling, combinatorial
optimization and algorithm design/implementation.

Benefits:
An initial appointment for 1 year (with an extension of up to
2 years)
Salary around 70000 CZK gross monthly; check the Numbeo
database for the cost of living in Prague
Full social and health insurance
30 days of paid annual leave
Children's corner, kindergarten, and elementary school
operated by the Czech Technical University in Prague
Additional benefits such as subsidized meals, yearly benefits
supporting recreational and sports activities, as well as health care
programs
An informal and inclusive international working environment at
the Industrial Informatics Department, CIIRC, CTU in Prague.

Selection process:
Interested candidates are invited to submit their applications at:
https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID:
04-Postdoc-Hanzalek]

Euraxess code:
https://www.euraxess.cz/jobs/415421

Theory Announcements

Friday, March 27, 2026

[DMANET] CFP [Extended Deadline]: REX-IO Workshop at ACM HPDC 2026 - Submissions due April 13, 2026

[DMANET] RASACC 2026 (co-located with DSN) - Extendend Deadline - Workshop on Resiliency for Autonomous Systems Across the Computing Continuum - June 22 - Charlotte

[DMANET] IWOCA 2026 in Clermont-Ferrand, France - Call for participation

[DMANET] CFP Computational Optimization

Thursday, March 26, 2026

[DMANET] [SPAA 2026] Call for Workshops and Tutorials

[DMANET] International Conference on Bilevel Optimization, Pittsburgh, August 2-5, 2026

[DMANET] SMARTCOMP 2026 Call for Posters, Demos, and Work-in-Progress -- Deadline Extended

[DMANET] BOCCONI THEORY DAY -- Call for participation

[DMANET] PhD position in Karlsruhe: Estimation of short-term extremes in air pollution and their drivers (DAAD scholarship)

[DMANET] MAPSP 2026 Call for Participation

[DMANET] HALG 2026 – Finale Call for Short Presentations (April 3)

Wednesday, March 25, 2026

[DMANET] The 9th DIS Conference – May 31–June 4, 2026, Czech Republic

[DMANET] Call for sessions in the stream HPC/GPU Optimization at the 24th IFORS conference (July 12-17 2026, Vienna, Austria)

[DMANET] PhD position in Data Analytics and Operations Research at the University of Duisburg-Essen (Rossana Cavagnini)

[DMANET] British Early Career Mathematicians' Colloquium: Registration Open and Call for Abstracts

[DMANET] Call for bids to host COMSOC 2027

[DMANET] Call for Attendees: 4th CINI HPC Summer School 2026

[DMANET] MFCS 2026 - Second Call for Papers

Tuesday, March 24, 2026

[DMANET] 3rd Call for Papers of QEST+FORMAT 2026

[DMANET] SC-Square 2026: Second Call for Papers

[DMANET] Launch of the BOS Webinar Series

[DMANET] Postdoc position in Prague: Solving Large-Scale Scheduling Problems: Hybridization, Parallelism, and Model Diversity in Constraint Programming

[DMANET] Postdoc position in Prague: Learning-Augmented Combinatorial Optimization Algorithms for Scheduling and Packing

Mailing Lists

Search This Blog

Blog Archive

Theory Announcements

Friday, March 27, 2026

Thursday, March 26, 2026

Wednesday, March 25, 2026

Tuesday, March 24, 2026

Mailing Lists

Subscribe To

Search This Blog

Blog Archive