[DMANET] FCT 2025 - Final Call for Papers

FCT 2025 Final Call for Papers

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

OVERVIEW

The International Symposium on Fundamentals of Computation Theory (FCT),
has been established in 1977 as a forum for researchers interested in
all aspects of theoretical computer science. It is a biennial series of
conferences, recently held in Copenhagen (Denmark, 2019) Athens,
(Greece, 2021) and Trier (Germany, 2023).

The 25th International Symposium on Fundamentals of Computation Theory
(FCT 2025) will be held on September 15th-17th at the Institute of
Computer Science, University of Wrocław, Poland.

https://fct2025.cs.uni.wroc.pl

fct2025@cs.uni.wroc.pl

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

IMPORTANT DATES

* May 6th, 2025: Paper submission deadline
* June 30th, 2025: Author notifications
* July 14th, 2025: Final papers due (changed)
* September 15th-17th, 2025: FCT conference dates

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

VENUE

* University of Wrocław, Institute of Computer Science, Poland

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

SUBMISSIONS

We invite submissions on all topics in broadly understood theoretical
computer science.

Papers are to be submitted electronically through EquinOCS submission
server operated by Springer, the publisher of the proceedings.
Submission page: https://equinocs.springernature.com/service/fct2025

The accepted papers will be published in ARCoSS subseries of Lecture
Notes in Computer Science (LNCS) series.

The submissions should be at most 12 pages long, including the
references and excluding a clearly marked appendix,
which can be read by the reviewers and can be consulted by the program
committee.

Submissions should use the LNCS style (LaTeX
<https://resource-cms.springernature.com/springer-cms/rest/v1/content/19238648/data/v8>,
Word
<https://resource-cms.springernature.com/springer-cms/rest/v1/content/19238706/data/v5>).

No prior publication or simultaneous submission to other conferences nor
journals are allowed;
this does not include publication in preprint repositories, e.g. arXiv,
or venues without published proceedings.

A Best Paper and Best Student Paper will be awarded.
To qualify for considerations for Best Student Paper, all authors must
be students at the moment of submission.

At least one author of accepted paper should register and present the
paper in person during the conference.

Submissions of papers authored (or co-authored) by PC members are allowed.

FCT 2025 will use a single-blind reviewing process.

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

LIST OF TOPICS:
(Not Exclusive)

* Algorithmic Game Theory
* Algorithmic Learning Theory
* Algorithmic Randomness
* Algorithms and Data Structures
* Algorithms for Big Data
* Approximation Algorithms
* Automata Theory
* Average-Case Analysis
* Combinatorics and Graph Theory
* Combinatorial Generation, Enumeration and Counting
* Combinatorial Optimization
* Combinatorics on Words
* Complexity Theory
* Computational Biology
* Computational Geometry
* Computational Learning Theory
* Computational Social Choice
* Computability, Recursion Theory
* Concurrency
* Data Compression
* Database Theory
* Descriptional Complexity
* Discrete Event Systems
* Discrete Optimization
* Distributed, Parallel and Network Algorithms
* Energy-Aware Algorithms
* Error-Correcting Codes
* Fine-grained Complexity
* Formal Languages
* Formal Specification and Verification
* Foundations of Artificial Intelligence and Machine Learning
* Graph Algorithms and Modelling with Graphs
* Graph Drawing and Graph Labeling
* Grammatical Inference
* Integer and Linear Programming
* Logic in Computer Science
* Model-Checking
* Models of Computation
* Network Theory and Temporal Graphs
* Online Algorithms
* Parameterized Algorithms and Complexity
* Probabilistic and Randomized Algorithms
* Program Semantics
* Quantum Algorithms
* String Algorithms
* Sublinear Time and Streaming Algorithms
* Telecommunication Algorithms
* Theorem Provers and Automated Reasoning
* Voting Theory

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

INVITED SPEAKERS

* Bernhard Haeupler (ETH & INSAIT Sofia University)
* Sławomir Lasota (University  of Warsaw)
* Inbal Talgam-Cohen (Technion)

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

PROGRAM COMMITTEE

* Alexander Belov (University of Latvia)
* Kristóf Bérczi (Eötvös Loránd University)
* Johanna Björklund (Umeå University)
* Hubie Chen (King's College London)
* Wojciech Czerwiński (University of Warsaw)
* Christoph Dürr (CNRS & Sorbonne University)
* Piotr Faliszewski (AGH University)
* Maribel Fernández (King's College London)
* Gabriele Fici (University of Palermo)
* Celina Figueiredo (UFRJ)
* Joanna Fijalkow (CNRS & LaBRI)
* Moses Ganardi (MPI SWS)
* Leszek Gąsieniec (University of Liverpool)
* Petr Golovach (University of Bergen)
* Meng He (Dalhousie University)
* Mika Hirvensalo (University of Turku)
* Petr Hliněný (Masaryk University)
* Tomohiro I (Kyutech)
* Rasmus Ibsen-Jensen (University of Liverpool)
* Artur Jeż (University of Wrocław) co-chair
* Marek Klonowski (Wrocław University of Science and Technology­)
* Anish Mukherjee (University of Liverpool)
* Jan Otop (University of Wrocław) co-chair
* Tatjana Petrov (University of Trieste)
* Vladimir Podolskii (Tufts University)
* Mahsa Shirmohammadi (CNRS & IRIF)
* Oskar Skibski (University of Warsaw)
* Krzysztof Sornat (AGH University)
* Ugo Vaccaro (UNISA)
* Armin Weiß (University of Stuttgart)
* Andreas Wiese (TU Munich)
* Dominik Wojtczak (University of Liverpool)

We hope to see you all in Wrocław!

Artur Jeż
Jan Otop
(Institute of Computer Science, University of Wrocław, Poland)
fct2025@cs.uni.wroc.pl

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

[DMANET] CFP: 23rd IEEE International Conference on Smart City (SmartCity-2025), UK, 13-15 August 2025

[Please accept our apologies if you receive multiple copies of this message]
************************* SmartCity-2025 Call for paper **********************
https://hpcn.exeter.ac.uk/smartcity2025/

Exeter, UK, 13-15 August 2025
INTRODUCTION
=============
Smart cities (also smarter cities) use digital technologies to enhance performance and wellbeing, to reduce costs and resource consumption, and to engage more effectively and actively with its citizens. Developing a smart city to better support growing urban population is a global and complex challenge and involves interdisciplinary fields. Key 'smart' sectors include transportation, smart building, energy, health care, and water systems. SmartCity-2025 is aiming to be a premier international conference in smart city. This conference is to bring together computer scientists, industrial engineers and researchers to discuss and exchange experimental or theoretical results, novel designs, work-in-progress, experience, case studies, and trend-setting ideas in the area of smart city.
SmartCity-2025 will be hosted in Exeter, the capital city of Devon and provides the county with a central base for education, medicine, religion, commerce and culture. Prospective authors are invited to submit their papers to SmartCity-2025. All accepted papers are expected to be included in IEEE Xplore and will be indexed by Engineering Index (EI). The authors of selected best papers will be invited post conference to extend their contributions for special issues of prestigious journals to be planned in conjunction with the conference.

SCOPE AND TOPICS
================
Topics of interest include, but are not limited to:
Track 1: Smart City Systems
Track 2: Data Processing Technology
Track 3: Data Systems
Track 4: Data Applications

PAPER SUBMISSION GUIDELINE
==========================
All papers need to be submitted electronically through the conference submission website (https://hpcn.exeter.ac.uk/smartcity/) with PDF format. The materials presented in the papers should not be published or under submission elsewhere. Each paper is limited to 8 pages (or 12 pages with over length charge) including figures and references using IEEE Computer Society Proceedings Manuscripts style (two columns, single-spaced, 10 fonts).
Once accepted, the paper will be included into the IEEE conference proceedings published by IEEE Computer Society Press (indexed by EI). At least one of the authors of any accepted paper is requested to register the paper at the conference.

IMPORTANT DATES
=================

* Workshop Proposal: 1 March 2025
* Submission Deadline: 30 April 2025
* Authors Notification: 15 June 2025
* Final Manuscript Due: 15 July 2025
* Registration Due: 15 July 2025
* Conference Date: 13-15 August 2025

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

[DMANET] Second Call for Papers for Workshop on Social Choice and Learning Algorithms @ IJCAI 2025

We are delighted to announce that the 2nd Workshop on Social Choice and Learning Algorithms (SCaLA-25) will take place at IJCAI in August of 2025 in Montreal, Canada. It will feature technical sessions, a keynote speaker, and opportunities to develop collaborations between researchers working in social choice and those working in machine learning.

The website and submission instructions can be found at the following link: https://sites.google.com/view/scala25

The submission deadline is May 9, 2025. We encourage submissions of fully developed research projects as well as preliminary explorations of novel ideas. Submissions should include components from both fields of social choice and machine learning (or closely related topics).

Topics of interest include:

-

Computational social choice

-

Fair Division

-

Matching

-

Voting theory

-

Sortition

-

Clustering

-

Ensemble learning

-

Explainable ML

-

Language models

-

Preference learning

-

PAC learning

Examples of interesting connections between these topics include, but are not at all limited to:

-

Using machine learning to learn new mechanisms for matching

-

Novel uses of social choice for ensemble learning

-

Exploring the application of fair division concepts to clustering problems, or vice-versa

-

Applying multi-winner voting concepts to multi-class classification tasks

Please feel free to contact any member of the organizing committee with questions!

Organizing Committee

Ben Armstrong

Roy Fairstein

Nick Mattei

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

[DMANET] First Call for Papers - ACG 2025

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

First Call for Papers - ACG 2025

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

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

19th International Conference, Advances in Computer Games 2025

Virtual Event, October 21–23, 2025

https://icga.org/?page_id=4052

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

The Advances in Computer Games conference (ACG 2025) will be held online this year October 21-23, 2025. ACG is an internationally renowned conference that publishes computer-based studies of games. Its history goes back to the inaugural event held in Edinburgh in 1975, making this the longest ongoing game AI conference.

Topics of interest include, but are not limited to:

- The current state of game-playing programs for classic and modern board games, card games, puzzles, virtual/casual/video games, etc.

- General game playing

- Artificial intelligence and machine learning for games

- Mathematical insights into games

- The history of computers in game-based research

- New theoretical developments in game-related research

- New and enhanced algorithms for search and knowledge acquisition

- Automated game design and evaluation

- Social aspects of computer games

- Scientific contributions produced by the study of games

- Cognitive research of how (and why) humans play games and puzzles

- Capture and analysis of game data

Submission

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

Papers must be written in English and can be up to 10 pages in length (including references). Further information can be found at https://icga.org/?page_id=4052 and https://easychair.org/cfp/ACG_2025.

Dates

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

- Submission due: August 1, 2025

- Notification due: September 15, 2025

- Final version due: October 7, 2025

- Conference: October 21-23, 2025

Program Co-Chairs

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

- Michael Hartisch, University of Passau, Germany

- Chu-Hsuan Hsueh, Japan Advanced Institute of Science and Technology, Japan

Advisory Committee

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

- Jaap van den Herik, University of Leiden, The Netherlands

Contact

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

You can contact us via acg2025@easychair.org

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

[DMANET] 5th SYSORM: Call for papers. Deadline: June 1st, 2025

Call for papers for the 5th Spanish Young Statisticians and Operational
Researchers Meeting (SYSORM) that will be held on November 5, 6, and 7,
2025, at the Instituto de Matemáticas de la Universidad de Sevilla.

All updated information is available on the conference website:
https://www.imus.us.es/congresos/5SYSORM/

The deadline for submitting abstracts is June 1, 2025.

This scientific meeting of the Spanish Society of Statistics and Operations
Research (SEIO) is organized by and for young researchers. Similar to
previous editions in Santiago de Compostela (2024)
<http://eamo.usc.es/pub/sysorm4/index.html>, Elche (2022)
<https://sysorm.umh.es/>, El Escorial (2019)
<https://eventos.ucm.es/17713/detail/2nd-spanish-young-statisticians-and-operational-researchers-meeting.html>,
and Granada (2017) <https://congresos.ugr.es/sysorm17/>, the goal of the
meeting is to represent and give visibility to the new generations of
excellent researchers in the fields of Statistics and Operations Research,
addressing topics ranging from methodological to applied research and
fostering communication among participants.

As in previous occasions, there will be no parallel sessions, and we will
have four plenary sessions, two international and two national: Christian
P. Robert, Francisco Saldanha, Rosa E. Lillo and María Merino.

With the aim of enhancing the participation of doctoral students and young
doctors, the registration fee includes accommodation, full board, and
various social activities.

If you are a young researcher in Statistics or Operations Research, you
must be at the 5th SYSORM!

We look forward to seeing you in Seville!

Best regards,
The Organizing Committee of the 5th SYSORM

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

[DMANET] CFP: LCN Special Track on Large Language Models and Networking (LLMNet)

** Apologies if you receive multiple copies of this message **

CFP: LCN Special Track on Large Language Models and Networking (LLMNet)

===================================================================================
SUBMISSION DEADLINE: June 1, 2025 (AoE)
===================================================================================
CALL FOR PAPERS
The 1st LCN Special Track on on Large Language Models and Networking (LLMNet 2025)
in conjunction with the
50th Annual IEEE Conference on Local Computer Networks (IEEE LCN 2025)
====================================================================================

Sydney, Australia, 14 – 16 October 2025
Website - https://llmnet.nss-research.io

## Scope and Topics

Large Language Models (LLMs) and Generative AI (GenAI) have rapidly advanced in language modelling and related tasks, with their applications now expanding into various other domains. In networking, LLMs and their variants have the potential to address key challenges such as traffic management and classification, configuration management, network migration, and scheduling. However, their full potential in networking remains largely underexplored. This special track aims to foster research in this emerging area and bring together the international networking research community working on LLM-driven solutions.

## Topics

The topics of interest include, but are not limited to:

* LLM Applications in Network Operations
* LLMs for traffic prediction and management
* LLM-driven anomaly and fault detection in networks
* LLMs for Network Security and Privacy
* LLMs for detecting malware in network traffic
* LLMs in Networked System Optimization
* LLM-guided routing and congestion control
* Machine-to-machine LLM
* Network configuration and optimization through Large GenAI models
* Benchmarking reasoning and planning capabilities for Networks
* Network configuration and optimization through Large GenAI models
* Large GenAI models for resource allocation and quality of service optimization
* Large GenAI models for network fault diagnosis and troubleshooting
* LLMs for network performance prediction
* LLMs for network protocol design
* Scheduling and load balancing with LLMs
* QoS/QoE prediction and optimization using LLMs
* Natural Language Interfaces for Network Management
* Using LLMs to generate network configurations from natural language
* Troubleshooting and diagnostics through conversational interfaces
* LLMs in Mobile and Wireless Networking
* Adaptive LLMs for edge and mobile scenarios
* LLMs for device mobility prediction and handover optimization
* Federated learning with LLMs in wireless networks
* LLMs and Network Data Analytics
* Summarization of network incidents and logs via LLMs
* Automated documentation and change logs using LLMs
* Efficient fine-tuning and inference of LLMs in network environments
* Deployment of LLMs at the edge, in routers, or programmable switches
* LLMs for Emerging Network Architectures
* Use of LLMs in Software-Defined Networking (SDN) and Network Function Virtualization (NFV)
* LLMs for programmable networks and intent-based networking
* LLM Applications in 6G, IoT, and space-terrestrial integrated networks
* Datasets and benchmarks for evaluating LLMs in networking
* Explainability and interpretability of LLMs in networking tasks
* Human-in-the-loop evaluation frameworks
* Multi-modal models for networking (e.g., combining text, telemetry, and packet traces)
* Ethical considerations, fairness, and bias in LLM-driven network operations
* LLMs for cybersecurity education and training in networked environments

## Submission guidelines
* via EDAS: https://lcn2025-llmn.edas.info/
* Paper submissions may be up to six (6) pages (excl. references)
* in two-column IEEE style
* Detailed instructions can be found on the LCN webpage.

## Important dates
* Paper Registration: May 25, 2025
* Paper Submission Deadline: Jun 1, 2025
* Paper Acceptance Notification: July 1, 2025
* Camera-ready Papers Due: August 1, 2025

## Special Track Organizers
* Suranga Seneviratne - The University of Sydney
* Madhusanka Liyanage - University College Dublin

## Technical Program Chair
TBD

We look 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] 1st CFP due July 15: CAIS 2025 Automated and Intelligent Systems, Oct 1-2, Online & OKCity, USA

[Apologies for cross-posting]

--- 1st Call for Abstracts and Papers -------------
2025 OkIP International Conference on Automated and Intelligent Systems
(CAIS)
Online & Oklahoma City, OK, USA
October 1-2, 2025
https://eventutor.com/e/CAIS005
Submission Deadline: July 15, 2025
OkIP Published & Submission for Indexation
Extended versions of the best papers will be considered for publication
in the inaugural volume of the International Journal of Automated and
Intelligent Systems.

>> Contribution Types (Two-Column Format Style):
- Full Paper: Accomplished research results (6 pages)
- Short Paper: Work in progress/fresh developments (3 pages)
- Extended Abstract/Poster/Journal First: Displayed/Oral presented (1
page)

>> Areas:

- AI, Machine Learning (ML), and Applications
- Agent-based, Automated, and Distributed Supports
- Natural Language Processing (NLP)
- Intelligent Systems and Applications
- Knowledge-based and Control Supports
- Automation, Robotics and Vehicles
- Global AI
- Generative AI Tools and Models
- AI in Computing and Society
- AI in Education
- AI Engineering
- Software Engineering for AI
- Circuit, Design, and Hardware for AI
- ...
More details are here:
https://eventutor.com/event/64/program

>> Important Dates:
- Abstract or Paper Submission: July 15, 2025
- Author Notification: August 1-15, 2025
- Camera Ready Paper Submission, Registration: August 7-22, 2025
- Conference Date: October 1-2, 2025

>> Technical Program Committee
https://eventutor.com/event/64/page/172-committee

Please feel free to contact us for any inquiries at:
Kris Zeuti
OkIP Secretariat
info@okipublishing.com

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

[DMANET] HALG 2025 - early registration by April 28 (and list of talks)

The 10th IGAFIT Highlights of Algorithms conference (HALG 2025)
Zurich, June 4-6, 2025.
https://2025.highlightsofalgorithms.org/index.html

Early registration (by April 28th, 2025)

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

Here is the list of the invited talks/surveys:

Shay Solomon - Survey on spanners
Sergei Vassilvitskii - Survey on learning-augmented algorithms
Mohsen Ghaffari - Survey on deterministic distributed algorithms
Sebastian Forster - Survey on dynamic algorithms
Yael Kalai - Survey on verifying quantum computation
Matus Telgarsky - Survey on Mathematical Questions in LLMs and Deep Learning

Mihir Singhal - Optimal quantile estimation: beyond the comparison model
Louis Golowich - New Explicit Constant-Degree Lossless Expanders
Yasamin Nazari - On Dynamic Graph Algorithms with Predictions
Shuyi Yan - Edge-Weighted Online Stochastic Matching: Beating 1−1/e
Xi Chen - Computing a Fixed Point of Contraction Maps in Polynomial Queries
Ewin Tang - High-Temperature Gibbs States are Unentangled and Efficiently Preparable
Greg Bodwin - An Alternate Proof of Near-Optimal Light Spanners
Michal Feldman - Fair Division via Quantile Shares
Jeremy Fineman - Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛^8/9) Time
Richard Hladik - Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
Christoph Grunau - Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
Max Probst Gutenberg - Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Soheil Behnezhad - Fully Dynamic Matching and Ordered Ruzsa-Szemer´edi Graphs
Oliver Hinder - The Price of Adaptivity in Stochastic Convex Optimization
Prasanna Ramakrishnan - Breaking the Metric Voting Distortion Barrier
Mohammad Taghi Hajiaghayi - Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?

**********************************************************
*
* 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] journal OJMO now ranked Q1 at Scimago

Dear colleagues

Some of you may have heard of the « Open Journal of Mathematical Optimization », which we created 5 years ago to offer our fellow mathematical optimizers a high-quality Diamond Open Access journal in mathematical optimization, meaning a journal where there is neither publication fee nor subscription fee. We are happy to share with you the good news that the journal has been ranked Q1 at Scimago both in « Control and Optimization » and « « Management Science and Operations Research », see https://www.scimagojr.com/journalsearch.php?q=21101123946&tip=sid&exact=no.

With best regards,

The board of OJMO
**********************************************************
*
* 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] [JOB] Postdoc in Computational Social Choice for Digital Democracy (Amsterdam)

I have an opening for a Postdoc in Computational Social Choice (2 years)
at the University of Amsterdam. The position is part of our ERC Synergy
project ADDI on digital democracy, which will eventually employ some 20
researchers, developers, and support staff.

Apply here:
https://werkenbij.uva.nl/en/vacancies/postdoc-in-computational-social-choice-for-digital-democracy-netherlands-14010

Deadline: 22 May 2025

Please share with potential candidates!

Questions from interested candidates are always welcome.

FYI, Umberto Grandi currently has an opening for a very similar position
in Toulouse, and there will be more such vacancies in the foreseeable
future (see https://advancingdemocracy.eu/jobs/).

All the best,
Ulle

--
Ulle Endriss
ILLC, University of Amsterdam
http://www.illc.uva.nl/~ulle/

**********************************************************
*
* 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] CIAA 2025 - Deadline extended

[Apologies for multiple copies]

Due to numerous requests, we are extending the submission deadline to may
16th AoE

Last Call for Papers

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

The 29th International Conference on Implementation and Application of
Automata (CIAA 2025) will be held in Palermo, Italy, September 22 – 25,
2025.

CIAA 2025 website:

https://ciaa2025.unipa.it/

The International Conference on Implementation and Application of Automata
(CIAA) is an annual conference in the field of theoretical computer
science. The website of the conference series is:

https://www.informatik.uni-giessen.de/ciaa/

The purpose of CIAA is to bring together members of the academic, research,
and industrial community who have an interest in the theory,
implementation, and application of automata and related structures. The
conference concerns research on all aspects of implementation and
application of automata and related structures, including theoretical
aspects.

The "Sheng Yu Award", will be presented to the author(s) of the paper
judged to be the best on the basis of the referee reports.

List of Topics

¯¯¯¯¯¯¯¯¯¯¯¯¯¯

We solicit papers on all aspects of implementation and application of
automata and related structures, including theoretical aspects, including
but not limited to:

-

Algorithms on automata
-

Automata and logic
-

Bioinformatics
-

Complexity of automata operations
-

Compilers
-

Computer-aided verification
-

Concurrency
-

Data structure design for automata
-

Data and image compression
-

Design and architecture of automata software
-

Digital libraries
-

DNA/molecular/membrane computing
-

Document engineering
-

Editors, environments
-

Experimental studies and practical experiences
-

Industrial applications
-

Natural language processing
-

Networking
-

New algorithms for manipulating automata
-

Object-oriented modeling
-

Pattern-matching
-

Quantum computing
-

Speech and speaker recognition
-

Structured and semi-structured documents
-

Symbolic manipulation environments for automata
-

Teaching
-

Text processing
-

Techniques for graphical display of automata
-

VLSI
-

Viruses, related phenomena
-

World-wide web

Important Dates

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

-

Submission deadline: May 3rd May 16th (AoE)
-

Notification deadline: June 20th June 23th
-

Final version deadline: June 30th
-

Early registration: July 18th

Invited Speakers

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

-

Marie-Pierre Béal, Université Paris-Est Marne-la-Vallée, France
-

Dirk Nowotka, University of Kiel, Germany
-

Alberto Policriti, University of Udine, Italy

Submission Guidelines

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

Submissions must be written in LaTeX using the LNCS LaTeX2e style and must
not exceed 12 single-spaced pages, excluding the title page and the
references. If the authors believe that more details are essential to
substantiate the main claims, they may include a clearly marked appendix
that will be read at the discretion of the program committee. Simultaneous
submissions of papers to journals or any other conference with published
proceedings or submitting previously published papers is not allowed. Only
electronic submission of PDF documents is possible.

Authors should submit their contributions through Easychair:

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

Publication

¯¯¯¯¯¯¯¯¯¯¯

CIAA 2025 proceedings will be published in the Springer Lecture Notes in
Computer Science (LNCS).

Special Issue

¯¯¯¯¯¯¯¯¯¯¯¯¯

Extended versions of selected papers from the conference will be invited
for consideration in a special issue of International Journal of
Foundations of Computer Science (IJFCS).

Program Committee

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

-

Marcella Anselmo, Università di Salerno, Italy
-

Frédérique Bassino, Université Sorbonne Paris Nord, France
-

Luca Breveglieri, Politecnico di Milano, Italy
-

Martin Berger, University of Sussex
<https://scholar.google.co.uk/citations?view_op=view_org&hl=it&org=15379174826387696676>,
UK
-

Pascal Caron, Université de Rouen, France
-

Giuseppa Castiglione, Università di Palermo, Italy (co-chair)
-

Erzsébet Csuhaj-Varjú, Eötvös Loránd University, Hungary
-

Frank Drewes, Umeå University, Sweden
-

Szilárd Zsolt Fazekas, Akita University, Japan
-

Dora Giammarresi, Università di Roma Tor Vergata, Italy
-

Yo-Sub Han, Yonsei University, South Korea
-

Markus Holzer, University of Giessen, Germany
-

Galina Jirásková, Slovak Academy of Sciences, Košice, Slovakia
-

Nataša Jonoska, University of South Florida, USA
-

Jarkko Kari, University of Turku, Finland
-

Ondřej Klíma, Masaryk University, Czech Republic
-

Martin Kutrib, University of Giessen, Germany
-

Julien Leroy, Université de Liège, Belgium
-

Andreas Malcher, University of Giessen, Germany
-

Andreas Maletti, University of Leipzig, Germany
-

Florin Manea, University of Göttingen, Germany
-

Sebastian Maneth, University of Bremen, Germany
-

Sabrina Mantaci, Università di Palermo, Italy (co-chair)
-

Victor Mitrana, Polytechnic University of Madrid, Spain
-

Nelma Moreira, University of Porto, Portugal
-

Cyril Nicaud, Université Gustave Eiffel, France
-

Giovanni Pighizzini, Università di Milano Statale, Italy
-

Luca Prigioniero, University of Loughborough, UK
-

Rogerio Reis, Universidade do Porto, Portugal
-

Michel Rigo, University of Liège, Belgium
-

Giuseppe Romana, Università di Palermo, Italy
-

Kai Salomaa, Queen's University, Canada
-

Shinnosuke Seki, The University of Electro-Communications, Tokyo, Japan
-

Mikhail Volkov, Ural Federal University, Russia
-

Bruce Watson, Stellenbosch University, South Africa
-

Hsu-Chun Yen, National Taiwan University, Taiwan

Organizing Committee

¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

-

Giuseppa Castiglione (University of Palermo)
-

Chiara Epifanio (University of Palermo)
-

Gabriele Fici (University of Palermo)
-

Estéban Gabory (University of Palermo)
-

Dora Giammarresi (University of Roma Tor Vergata)
-

Sabrina Mantaci (University of Palermo)
-

Giuseppe Romana (University of Palermo)
-

Marinella Sciortino (University of Palermo)

Venue

¯¯¯¯¯

The conference will be held in the Sala Lanza of the University of
Palermo's Botanical Garden. Address: Via Lincoln 2, 90123, Palermo, Italy.

Contact

¯¯¯¯¯¯¯

All questions should be addressed to:

ciaa2025@unipa.it

Giuseppa Castiglione and Sabrina Mantaci, University of Palermo.

Giuseppa Castiglione
Ricercatrice INF/01
Dipartimento di Matematica e Informatica
Via Archirafi 34, 90123 Palermo

**********************************************************
*
* 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] School on Graph Theory 2025: June 30-July 4 near Orléans, France

Dear all,

The summer school on graph theory SGT 2025 will take place from Monday 30 June to Friday 4 July in Nouan-le-Fuzelier (near Orléans), France. The lectures, in English, will start on Monday afternoon and finish on Friday at noon, on three topics:

- Parameterised complexity and kernels, by Eunjung Kim (KAIST, South Korea) and Stefan Kratsch (Humbold Universität, Berlin, Germany)
- Quantum algorithms for graphs, by Frédéric Magniez (CNRS/Paris Cité, France)
- Graphs and polynomials, by Stéphan Thomassé (ENS Lyon, France)

Registration will soon be open on our website, https://sgt2025.sciencesconf.org/.

SGT 2025 is the fifth edition of the school organised by the French network of researchers in graphs. It is open to all young and not-so-young researchers interested in or wishing to become involved in these subjects. We look forward to seeing many of you there!

Ioan for the organising committee

**********************************************************
*
* 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] LICS 2025 Call for Participation

LICS 2025: Fortieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS)
23–26 June 2025
https://lics.siglog.org/lics25/
NB Early registration ends 1 May 2025 23:59 Singapore Time (UTC+8).

* Registration: https://register.comp.nus.edu.sg/LICS2025/
* Local information: https://lics.siglog.org/lics25/local.php
* Invited talks and tutorials from Anuj Dawar, Rustan Leino, Christine Tasson, Hongseok Yang
* List of accepted papers: https://lics.siglog.org/lics25/accepted.php

**********************************************************
*
* 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] OCT-Cyst Challenge Invitation

Dear Esteemed Colleagues and Researchers,
We are pleased to announce and cordially invite you to participate in the ICIAP 2025 OCT Cyst Challenge, a satellite event of the 23rd International Conference on Image Analysis and Processing (ICIAP 2025). This exciting competition, further detailed on our dedicated website: https://sites.google.com/community.unipa.it/iciap2025-oct-cystchallenge?usp=sharing, aims to foster innovation and advance the state-of-the-art in medical image analysis.
Our primary objectives for this challenge are to:

* Benchmark and compare novel algorithms for the automated segmentation of cysts in Optical Coherence Tomography (OCT) images.
* Promote the development of robust and accurate methodologies capable of handling the inherent variability and complexities present in OCT data.
* Establish a publicly available resource of annotated OCT images and evaluation metrics to facilitate future research in this critical area.
* Encourage collaboration and knowledge sharing within the medical imaging and computer vision communities.

The task of accurate cyst segmentation in OCT images holds significant importance for several reasons:
OCT provides high-resolution, cross-sectional visualizations of retinal structures, making it indispensable for the diagnosis and management of numerous ocular diseases. Precise and reliable cyst segmentation is crucial for:

* Improving diagnostic accuracy and prognostic assessment in conditions such as diabetic macular edema and age-related macular degeneration.
* Facilitating quantitative analysis of cyst volume, morphology, and spatial distribution, enabling objective disease monitoring and treatment response evaluation.
* Potentially reducing the burden on clinicians by providing automated tools for time-consuming manual segmentation tasks.
* Advancing research into the pathogenesis and progression of cyst-related ocular pathologies.

We believe that this challenge presents a unique opportunity for researchers to contribute meaningfully to a clinically relevant problem with the potential for significant impact on patient care. By participating, you will have the chance to test your algorithms on a challenging dataset, compare your results with leading international teams, and contribute to the advancement of this vital field.
Key Important Dates:

*
19/04: Dataset Release
*
15/06: Submission Deadline for Algorithms and papers
*
01/07: Notification of Results
*
15-19/09: Workshop and Results Presentation at ICIAP 2025

We strongly encourage you to visit the competition website for comprehensive details regarding the dataset, evaluation metrics, submission guidelines, and participation instructions.
We look forward to your active participation in the ICIAP 2025 OCT Cyst Challenge and to witnessing the innovative solutions that will emerge from this collaborative effort.
Sincerely,
The Organizing Committee of the ICIAP 2025 - OCT-Cyst Challenge

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

[DMANET] [IEEE SMARTCOMP 2025] NSF Student Travel Grant, US-based Students ONLY

*NSF Student Travel Grant for IEEE SMARTCOMP 2025 (US-based Students ONLY)*

*Please check details for this opportunity at:
**https://www.cs.ucc.ie/smartcomp2025/#/nsfgrant*

The 11th IEEE Conference on Smart Computing (SMARTCOMP 2024), to be held
in-person in Cork, Ireland from June 16 to June 19, 2025, is expected to
offer NSF-sponsored competitive student travel grants to support attendance
at SMARTCOMP 2025 <https://www.cs.ucc.ie/smartcomp2025/> and co-located
events such as Workshops, the Ph.D. Forum, Work-in-Progress, Posters, and
Demo sessions.

These travel grants are intended for full-time students enrolled at
colleges and universities in the United States. We particularly encourage
applications from underrepresented minority and women students from diverse
US institutions. Both student authors and non-author students—including
exceptional undergraduate, MS, and PhD students engaged in smart computing
research—are eligible to apply. Acceptance of a paper is not required to be
considered for the travel grant.

Ph.D. students applying for the travel grant are strongly encouraged to
also apply to the Ph.D. Forum.

To be eligible, US-based students (referred to as "you") must submit an
application via the Google Form link <https://forms.gle/hSNB3jyqfDB8GmZx7>
byApril 30th, 2025.

Application Requirements To apply for NSF travel support, please upload the
following documents:

1. One-page Cover Letter that includes:
- Confirmation that you are a full-time student (B.S., M.S., or Ph.D.)
- A statement that you will attend the entire SMARTCOMP 2025
conference and associated events
- A brief summary of your research interests and accomplishments in
smart computing
- A description of how attending SMARTCOMP 2025 would benefit your
research and academic goals
- How you plan to contribute to and benefit from the conference
experience
2. Two-page CV
3. Letter of Recommendation from your academic mentor confirming:
- Your full-time student status and good academic standing
- Your engagement in smart computing research and potential for
contributions
- The benefits you would gain from attending the conference
- Your commitment to attend the entire conference and associated
events

Reimbursable expenses include the advance registration fee (for student
authors and non-authors), airfare, and hotel accommodations. Expenses not
eligible for reimbursement include regular/on-site registration, internet
fees, etc. Reimbursements will be processed after the conference, upon
submission of the required receipts. The reimbursement amount will depend
on the total number of awardees and available funding.

For questions regarding the travel award, please contact: Dr. Laura Barnes
(University of Virginia, lb3dp@virginia.edu)

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

[DMANET] CG:SHOP Challenge 2026: Call for Problems

Since 2019, the CG Challenge has been part of CG Week.
The objective is to compute good solutions for instances of
a challenging geometric optimization problem. The contributors
with the most outstanding solutions are recognized at CG Week
and invited to present their results, both at the event and in the
proceedings.

Previous problems were as follows:
- Finding a simple polygon with minimum area (Challenge 2019)
- Finding a subdivision with few convex pieces (Challenge 2020)
- Coordinating the motion of a large set of objects (Challenge 2021)
- Partitioning a set of edges into few plane subgraphs (Challenge 2022)
- Minimum coverage by convex polygons (Challenge 2023)
- Maximum polygon packing (Challenge 2024)
- Minimum Non-Obtuse Triangulations (Challenge 2025)

See https://cgshop.ibr.cs.tu-bs.de for details.

To broaden the scope of Challenge problems and ensure
sufficient diversity, we are soliciting suitable problems for
the Eigth CG Challenge, to be part of CG Week 2026.
Desirable properties are as follows.

- The problem is of geometric nature.
- The problem is of general scientific interest and has
received previous attention.
- Optimization problems tend to be more suitable than
feasibility problems; suggestions for feasibility problems
are also possible, provided they come with sufficiently
fine-grained scoring.
- Computing optimal solutions is difficult for instances of
reasonable size.
- This difficulty is of a fundamental algorithmic nature,
and not only due to issues of encoding or access to
sophisticated software or hardware.
- Verifying feasibility of provided solutions is relatively easy.

To nominate a problem, please send the following by
May 20 by email:

- An informal description of the problem
- A pointer to previous work, if any
- Further useful information on the state of practical solutions, if any
- Contact information of the nominator

Nominators may be contacted for further details; they may
also be invited to participate in running the challenge.

The selected problem will be announced in June, 2025.

We are looking forward to your contributions and welcome
questions and comments!

Challenge Team and Advisory Board:
--------------------------------------------------
Bill Cook, Andreas Fabri, Sándor Fekete, Dan Halperin,
Phillip Keldenich, Michael Kerber, Philipp Kindermann,
Dominik Krupke, Joe Mitchell, Stefan Schirra, Kevin Verbeek

**********************************************************
*
* 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] VCLA International Student Awards - Deadline Extension and Last Call for Nominations

The deadline for the submission of self-nominations for the VCLA International Student Awards has been extended to the 30th of April 2025! Please find the revised call for nominations below.

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

The Vienna Center for Logic and Algorithms of TU Wien calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the following two categories:

- Outstanding Master Thesis Award*
- Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st cycle of the Bologna process)*

*The degree must have been awarded between January 1st, 2024 and December 31st, 2024 (inclusive).

----------------------------------
The main areas of interest are:
----------------------------------
- Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics).
- Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, graph drawing algorithms, and distributed algorithms.
- Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning).
- Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems.

----------------------------------
Awards
----------------------------------
- The Outstanding Master Thesis Award: 1200 EUR.
- The Outstanding Undergraduate Thesis Award: 800 EUR.
- The winners will be invited to present their work at an award ceremony in Vienna, if the situation allows.

----------------------------------
Eligibility
----------------------------------
- The degree must have been awarded between January 1st, 2024 and December 31st, 2024 (inclusive).
- Students who obtained their degree at TU Wien are not eligible.

----------------------------------
Nomination Requirements
----------------------------------
Nominations must include:
- A cover page that contains the name and contact details of the nominated person, the title of the work for which the person is being nominated, award category, the date on which the degree was awarded, and the name of the university.
- An English summary of the thesis of maximum 3 pages, excluding references (A4 or letter page size, 11pt font min). The summary must clearly state the main contribution of the work, its novelty, and its relevance to some of the aforementioned areas of interest.
- The CV of the nominated person, including publication list (if applicable).
- An endorsement letter from a supervisor or another proposing person. The letter must clearly state the independent and novel contribution of the student, and why the proposer believes the student deserves the award. The endorsement letter may be provided after the submission deadline, and emailed directly to vcla_awards (AT) tuwien.ac.at.
- The full thesis.

All documents should be in English, with the exception of the thesis. In case the thesis is in a different language, it must be accompanied by a research report in English of at least 10 pages that should be sufficient for the committee to evaluate the merit and quality of the submitted work.

----------------------------------
Instructions for submitting self-nominations
----------------------------------
- Nominations should be submitted electronically by the applicants using the following link to EasyChair: https://easychair.org/conferences/?conf=vclaawards2025.
- Submissions consist of two pdf files. The first is a single pdf file containing all documents for the nomination except the full thesis; the documents should appear in the order they are listed above. The second pdf file is the full thesis.
- The endorsement letter may optionally be sent by email by the endorser and omitted from the Easychair submission. In this case, please email the letter as a pdf file, including the name of the nominated person in the subject, to vcla_awards (AT) tuwien DOT ac DOT at.
- The submission must be accompanied by a plain text electronic abstract of the thesis of at most 400 words, and three keywords.
- The nominated student must be listed as the only author in the submission form.

----------------------------------
Important dates
----------------------------------
- Submission deadline: April 30, 2025 (anywhere on Earth)
- Notification of decision: Beginning of July, 2025

----------------------------------
Contact
----------------------------------
Please send all inquiries to vcla_awards@tuwien.ac.at<mailto:vcla_awards@tuwien.ac.at>.
----------------------------------
VCLA Award Committee 2025
----------------------------------
Shqiponja Ahmetaj (chair)
Alexis de Colnet
Katalin Fazekas
Simon Dominik Fink
Phuc Hung Hoang
Daniela Kaufmann
Matthias Lanzinger
Xinghan Liu
Anela Lolic (chair)
Sanja Lukumbuzya
Xavier Parent
Adrian Rebola Pardo
Martin Riener
Zeynep Saribatur
Sebastian Skritek
Martin Tappler
----------------------------------
Website with information on the award and the previous awardees
----------------------------------

https://www.vcla.at/vcla-awards/

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

[DMANET] Save the date: Workshop "Recent Advances in Multi-Objective Optimization" (RAMOO) on 11 and 12 September 2025

Dear colleagues,

the next edition of the workshop "Recent Advances in Multi-Objective Optimization" (RAMOO) will take place at the Straubing Campus of the Technical University of Munich on 11 and 12 September 2025. The Campus is located in the beautiful city of Straubing in Lower Bavaria directly at the Danube River (i.e., not in Munich).

The workshop will start in the morning of Thursday, 11 September, and end around lunchtime on Friday, 12 September. For those traveling from further away, it is thus advisable to arrive already on Wednesday, 10 September. The two keynote talks will be given by Sophie Parragh (Johannes Kepler University Linz) and Oliver Stein (Karlsruhe Institute of Technology). The full program and the registration will be available on the workshop website (https://moo.univie.ac.at/) in early July.

We are looking forward to welcoming you in Straubing in September!

Best regards,
Clemens Thielen
--
Prof. Dr. Clemens Thielen
Professorship of Optimization and Sustainable Decision Making
TUM Campus Straubing for Biotechnology and Sustainability
Technical University of Munich (TUM)

Am Essigberg 3 | 94315 Straubing | Germany
Phone: +49 9421 187 175
Web: http://odm.cs.tum.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] PhD position at Inria Lille, team LINKS (extended deadline)

Dear all,

The LINKS team at Inria Lille is currently seeking PhD candidates to work on
the topic of "Efficient enumeration via edits". More information on the PhD
subject and the context follows. The deadline to apply is April 30.

Please circulate this offer to potential candidates and colleagues who are
looking for PhD positions (and don't hesitate to contact us to inquire
more).

PhD topic.

We are interested in designing efficient *enumeration algorithms*, i.e.,
algorithms that outputs the solutions to a problem one after another. Such
algorithms are typically used when the number of solutions is large. For this
thesis, we will focus on contexts in which the objects themselves to be
enumerated have a large size, and to tackle this we propose a new enumeration
model that we call "by edits", where the next item to be enumerated is not
written from scratch, but instead one wants to output the description of how to
obtain this item from the previous one. The topic is about designing
efficient algorithms for problems arising from automata theory, graph
theory, and databases. More details can be found here:
<https://a3nm.net/work/research/offers/phd_enumeration_changes.pdf>

Advisors and context.

The PhD will be carried out in LINKS, which is a joint research team
between Inria Lille, the University of Lille, and the CRIStAL
laboratory. The LINKS team offers a dynamic environment for research in
this area and a friendly atmosphere. The PhD will be co-supervised by
Antoine Amarilli (https://a3nm.net/) and Mikaël Monet
(https://mikael-monet.net/). Applications are open until April 30, and
the contract would start in fall 2025.

Candidates.

Candidates to this PhD proposal should have a good background in the
following areas of computer science: discrete mathematics, complexity
theory, formal languages, logic, and databases.

To apply, simply email us at mikael.monet@inria.fr and a3nm@a3nm.net !

Best regards,
Antoine Amarilli and Mikaël Monet

**********************************************************
*
* 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] Post-doctoral Position in Operations Research and Transportation

Kindly find below a post-doctoral position at Université Gustave Eiffel

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

*The Project*

The OπTIME project (Predictive optimization for transport planning of
multi-energy heavy goods vehicles) at Université Gustave Eiffel (UGE) is
seeking an innovative post-doctoral researcher for a one-year appointment
to drive forward sustainable transportation solutions.

*Your Role*

You will be at the forefront of developing pioneering solutions for
optimizing transport operations using mixed-energy vehicle fleets (diesel,
CNG, hybrid, electric). In an era of energy transition, you will tackle the
complex challenge of optimal vehicle-to-mission assignment, integrating:

- Advanced predictive models for energy consumption

- Cutting-edge optimization algorithms

- Innovative transport planning solutions

Your work will directly impact the reduction of both operational costs and
carbon footprint in the transportation sector.

*Research Environment*

- *Host Institution*: eMob Lab (Energy & Mobility Lab) at UGE's Lyon
Campus (Lyon, France)

- *S**upervision*: Joint supervision by Prof. Nour-Eddin El Faouzi (UGE)
and Prof. David Rey (SKEMA Business School)

- *Start Date*: Fall 2025 (flexible based on candidate availability)

- *Duration*: 12 months

- *S**alary*: [2824, 3073] Euros gross per month ([2259, 2458] Euros net
per month) depending on experience

*Your Profile:*

*Required Qualifications:*

- PhD in Operations Research, Engineering, Computer Science, or
Mathematics

- Strong programming skills and data science expertise

- Excellent communication skills in English (both written and oral)

*Desired Qualifications:*

- Experience in transportation and logistics (advantageous but not
mandatory)

- Working knowledge of French (appreciated)

- Publication record in relevant fields

*How to Apply*

Submit your application package as a single ZIP file containing:

1. A cover letter

2. Your detailed CV

3. Contact information for at least two academic referees

4. Your 1-2 most significant publications

*Application Process*

- Deadline: until the position is filled

- Submit to:

- Prof. Nour-Eddin El Faouzi (nour-eddin.elfaouzi@univ-eiffel.fr)

- Prof. David Rey (david.rey@skema.edu)
-----------------------------------------------------------------------------------------------------------------------------

Nour-Eddin & David

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

[DMANET] [Cryptography] (IF 1.8, CiteScore 3.8) Selected Papers in Volume 8, Issue 4

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

1. Partial Exposure Attacks on a New RSA Variant
https://www.mdpi.com/2410-387X/8/4/44

2. On the Proof of Ownership of Digital Wallets
https://www.mdpi.com/2410-387X/8/4/57

3. Implantable Medical Device Security
https://www.mdpi.com/2410-387X/8/4/53

4. A Secure Approach Out-of-Band for e-Bank with Visual Two-Factor
Authorization Protocol
https://www.mdpi.com/2410-387X/8/4/51

5. Post-Quantum Secure ID-Based (Threshold) Linkable Dual-Ring Signature
and Its Application in Blockchain Transactions
https://www.mdpi.com/2410-387X/8/4/48

See this full volume via https://www.mdpi.com/2410-387X/8.

Additionally, we welcome your submissions if you have relevant papers to
be submitted. Please contact the journal editorial office
cryptography@mdpi.com.

Best regards,
Xue Cheng
Managing Editor
--
MDPI Branch Office, Wuhan
Cryptography Editorial Office
https://www.mdpi.com/journal/cryptography
MDPI, Grosspeteranlage 5, 4052 Basel, Switzerland

News: Cryptography Receives an Updated Impact Factor of 1.8
https://www.mdpi.com/journal/cryptography/announcements/8769

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

[DMANET] CESArtIn 2026: early registration May 11

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

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

CESArtIn 2026

Porto – Maia, Portugal

January 19-23, 2026

https://cesartin.irdta.eu/2026/

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

Co-organized by:

University of Maia

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

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

Early registration: May 11, 2025

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

SCOPE:

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

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

The event will consist of 12 courses, 2 keynote lectures, 1 round table, 1 symposium collecting short contributions from participants, and 3 open thematic debate sessions. Renowned academics and industry pioneers will lecture and share their views with the audience. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Face to face interaction and networking will be main ingredients of the event. It will be also possible to fully participate in vivo remotely.

ADDRESSED TO:

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

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

Overall, CESArtIn 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:

CESArtIn 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:

Georgios Giannakis (University of Minnesota), Kernel-driven and Learnable Self Supervision over Graphs

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

PROFESSORS AND COURSES: (to be completed)

Ricardo Baeza-Yates (Northeastern University), [introductory] Responsible AI

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

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

Rachel Cummings (Columbia University), [introductory/intermediate] Differential Privacy beyond Algorithms

Brian D. Earp (National University of Singapore), [introductory] Credit, Blame, and Personalisation in Human-AI Cooperation

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

Catherine Pelachaud (Sorbonne University), [introductory/intermediate] Interacting with Socially Interactive Agents

Linda Smith (Indiana University Bloomington), [intermediate] Lessons from Infants: Efficient Learning from Learner-generated Training Sets (A more transformative idea than might first appear)

SYMPOSIUM:

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

OPEN DEBATES:

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

SPONSORS:

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

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

ORGANIZING COMMITTEE:

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

REGISTRATION:

It has to be done at

https://cesartin.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://cesartin.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, Brussels/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/
*
**********************************************************

[DMANET] Contribute to a Groundbreaking Book on DNA Data Storage!

Dear Colleagues:

We are excited to invite contributions for book chapters in the
upcoming Springer Nature publication: Book Title: "DNA Data Storage –
Current Approaches and Emerging Trends"

DNA is emerging as the next frontier for ultra-dense, long-term, and
sustainable data storage. This book will explore the latest encoding
techniques, storage architectures, error correction, AI-driven
optimizations, and emerging industry applications.

Key Topics:
· Introduction to DNA Storage Technology
· Cost-Effective Writing & Rapid Reading of DNA Data
· DNA-Based Error Correction Codes (CRC, BCH, Hybrid Approaches)
· Deep Learning & AI for DNA Encoding/Decoding
· Long-Term DNA Storage & Archival Standards
· Security, Biosecurity, and Ethical Considerations
· Rewritable DNA Storage and Novel Applications

📅 Important Dates:
· Abstract Submission: 30 April 2025
· Abstract Acceptance: 15 May 2025
· Full Chapter Submission: 31 July 2025
· Chapter Acceptance: 30 September 2025
· Submission to Publisher: 31 October 2025
· Expected Publication: December 2025

Editorial Team:
Manish K. Gupta <https://www.linkedin.com/in/mankg/> – Kaushalya The Skill
University, India
Zhi Ping – The Chinese University of Hong Kong
<https://www.linkedin.com/company/the-chinese-university-of-hong-kong/>,
Shenzhen
Abdur Rasool <https://www.linkedin.com/in/abdur-rasool-phd/> – University
of Hawaii at Manoa <https://www.linkedin.com/company/uhmanoa/>, USA
Ben Cao – Dalian University of Technology / A*STAR, Singapore
Pierre-Yves Burgi <https://www.linkedin.com/in/pierre-yves-burgi-63571110/>
– University of Geneva
<https://www.linkedin.com/company/universite-de-geneve/>, Switzerland
Join us in shaping the future of data storage!
🔗 More Details on Submissions:
https://sites.google.com/view/call-forbookchapter-dnastorage
Inquiry for Submission: dnastoragein@gmail.com

--
Manish K Gupta, PhD (IIT Kanpur)
Director (Academics) and Senior Professor
Kaushalya: The Skill University
Government of Gujarat
Director Academics Office
Block 3, VGEC Campus
Chandkheda, Ahmedabad 382424
Gujarat, India
Assistant (Nehal Bhavsar) Email: pa2director@kaushalyaskilluniversity.ac.in
.
email: mankg@kaushalyaskilluniversity.ac.in mankg@computer.org
Web: https://www.mankg.com Lab: https://www.guptalab.org
Linkedin: https://www.linkedin.com/in/mankg
YouTube: https://www.youtube.com/@guptalab

**********************************************************
*
* 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] [Extended Deadline] iMETA 2025: The 3rd International Conference on Intelligent Metaverse Technologies & Applications, Dubrovnik, Croatia [Hybrid Conference]

*The 3rd International Conference on Intelligent Metaverse Technologies &
Applications (iMETA 2025)*

14-17 October 2025 | Dubrovnik, Croatia

*Hybrid Conference*

*Technically sponsored by IEEE Croatia section*

https://imeta-conference.org/

Over the years, technology has advanced significantly, and the creation of
virtual environments (i.e., metaverse) is one of the latest innovations to
revolutionize how we interact, process, and connect our real lives to other
lives. With the metaverse, we are presented with a new realm that blurs the
lines between the physical and digital world, providing a new space for
communication, commerce, services, and entertainment.

The International Conference on Intelligent Metaverse Technologies &
Applications (iMETA) is to bring together leading researchers, academics,
and industry experts to explore the various aspects of the distributive
metaverse, including its technologies, applications, and implications for
various industries. Attendees can expect to participate in exciting keynote
speeches, panel discussions, and presentations on cutting-edge research
field.

Throughout the conference, there will be ample opportunities for attendees
to network, share their knowledge, and collaborate on future initiatives
that will drive the development of the metaverse forward. We are confident
that iMETA conference will inspire new ideas, foster innovation, and spark
collaborations that will push the boundaries of the metaverse and its
potential to change the world as we know it.

The metaverse is a complex system that requires careful planning, design,
and implementation to function correctly. The iMETA conference will delve
into several key areas related to communication, computing, and systems
within the metaverse. Communication is a fundamental aspect of the
metaverse, allowing users to interact with one another, share information,
and collaborate on tasks. Computing is also essential for the metaverse
advancements and to function effectively. Topics such as distributed
computing, cloud computing, and edge computing are to be revisited within
the metaverse realm.

Overall, the iMETA conference aims to provide attendees with a
comprehensive understanding of the communication, computing, and system
requirements of the metaverse. Through keynote speeches, panel discussions,
and presentations, attendees will have the opportunity to engage with
leading experts and learn about the latest developments and future trends
in the field. The conference will also provide ample opportunities for
networking, sharing knowledge, and collaborating with others in the
metaverse community.
List of Tracks:

- Track 1: Large Language Models (LLMs) in the Metaverse
- Track 2: Native AI for Metaverse Technologies
- Track 3: Security and Privacy
- Track 4: Networking and Communications
- Track 5: Systems and Computing
- Track 6: Multimedia and Computer Vision
- Track 7: Immersive Technologies and Services
- Track 8: Storage and Processing

*Publication*

*IEEE is a technical sponsor of iMETA 2025*. All accepted papers in iMETA
2025 and the workshops co-located with it will be submitted to IEEEXplore,
dblp and Scopus for inclusion.

*Important Dates:*

- Papers due: *June 15, 2025 (Extended)*
- Acceptance notification: July 10, 2025
- Registration due: July 26, 2025
- Camera-ready paper due: July 26, 2025

*Submission Guidelines:*

Manuscripts must be original, not previously published, or under review by
another conference or journal. Submissions should adhere to the IEEE
Conference Proceedings Format, using a double-column layout, 10-point font,
and letter-sized paper. Manuscripts must be submitted in PDF format and
should not exceed 6 pages for the review process. Accepted papers may
extend to a maximum of 8 pages for the camera-ready version, subject to an
overlength page fee.

*Submission Link: **https://easychair.org/my/conference?conf=imeta2025*

*Organizing Committee*
Steering Committee

- Albert Zomaya, University of Sydney, Australia
- Giancarlo Fortino, University of Calabria, Italy
- Ian F. Akyildiz, Truva Inc., USA
- Merouane Debbah, TII, UAE
- Nirwan Ansari, New Jersey Institute of Technology, USA
- Salil Kanhere, UNSW Sydney, Australia
- Walid Saad, Virginia Tech, USA
- Moayad Aloqaily, MBZUAI, UAE

General Co-chairs

- Adriana Lipovac, University of Dubrovnik, Croatia
- Yulei Wu, University of Bristol, <https://www.essex.ac.uk/>UK

Program Co-chairs

- Ouns Bouachir, Zayed University, UAE
- Elif Bozkaya, National Defence University Turkish Naval Academy, Turkey
- Marwan Omar, Illinois Institute of Technology, USA

--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] [Extended Deadline] BCCA 2025: The 7th International Conference on Blockchain Computing and Applications, Dubrovnik, Croatia [Hybrid Conference]

*The 7th International Conference on Blockchain Computing and Applications
(BCCA 2025)*

14-17 October 2025 | Dubrovnik, Croatia

*Hybrid Conference*

*https://bcca-conference.org/*

*Sponsored by IEEE Croatia Section*

Blockchain is a revolutionary technology in decentralized systems that
enables secure decentralized transaction processing while ensuring data
privacy and authenticity. It plays a significant role in several areas,
such as the Internet of Things, supply-chain management, manufacturing,
cyber-physical systems, healthcare systems, etc. Unlike centralized
transaction processing solutions, blockchain uses a distributed ledger
mechanism to record data transactions on multiple devices; this will
prevent data breaches, identity theft, and a plethora of cyber-related
attacks, leading to sustainability in data privacy and security. This
conference aims to attract the work of both researchers and practitioners
in the area of cyber-security to share and exchange their experiences and
research studies in both academia and industry in the field of blockchain.

Researchers are encouraged to submit original research contributions in all
major areas, which include, but are not limited to:

- Track 01: Large Language Models (LLMs) and Blockchain
- Track 02: Artificial Intelligence and Machine Learning
- Track 03: IoT and Cyber-Physical Systems
- Track 04: Big Data and Analytics
- Track 05: Security and Privacy on the Blockchain
- Track 06: Metaverse and Digital Twin
- Track 07: IoT Network Security
- Track 08: Blockchain Research & Applications for Innovative Networks
and Services
- Track 09: Quantum Computing and Blockchain

*Publication*

*IEEE is a technical sponsor of BCCA 2025*. All accepted papers in BCCA
2025 and the workshops co-located with it will be submitted to IEEEXplore,
dblp and Scopus for inclusion.

*Important Dates:*

- Papers due: *May 15, 2025 (Extended)*
- Acceptance notification: June 26, 2025
- Registration due: July 26, 2025
- Camera-ready paper due: July 26, 2025

*Main track Submission Guidelines:*

There are three categories of submission (Overlength charges will be
applied!):

- *Long papers:* (7-8 pages).
- *Short papers:* (5-6 pages).
- *Poster papers:* (2 pages)

*Submission Link: *https://edas.info/N33458

*Organizing Committee*
*Honorary Chair*

- Vlatko Lipovac, University of Dubrovnik, Croatia
- Flavia Delicato, Fluminense Federal University, Brazil

*General Chair*

- Adriana Lipovac, University of Dubrovnik, Croatia

*Program Co-Chairs*

- Safa Otoum, Zayed University, UAE
- Müge Özçevik , Istanbul Technical University, Turkey
- Dusan Ramljak, Penn State Great Valley, USA

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