[DMANET] [ICLP 2025 - Deadline Approaching] 41st International Conference on Logic Programming (ICLP’25) University of Calabria, Rende, Italy | September 12-19, 2025

*[apologize for multiple postings]*

*Second Call for Papers*

41st International Conference on Logic Programming (ICLP'25)

University of Calabria, Rende, Italy | September 12-19, 2025

https://iclp25.demacs.unical.it/

*SCOPE*

Since the first conference In Marseille in 1982, ICLP has been the premier
international event for presenting research in logic programming.
Contributions are sought in all areas of logic programming, including but
not restricted to:

*Theoretical Foundations:*

Formal and operational semantics, Non-monotonic reasoning, Reasoning under
uncertainty, Knowledge representation, Semantic issues of combining logic
and neural models, Complexity results.

*Language Design and Programming Methodologies:*

Concurrency and parallelism, Mobility, Interacting wit h ML, Logic-based
domain-specific languages, Hybrid logical and imperative/functional
languages, Programming techniques, Theory reasoning, Answer set
programming, Inductive logic programming, Coinductive logic programming.

*Program Analysis and Optimization:*

Analysis, Transformation, Verification, Debugging, Profiling,
Visualization, Logic-based validation of generated programs.

*Implementation Methodologies and Applications:*

Compilation, Constraint implementation, Ethics and trustworthiness,
Explainability, Parallel/distributed execution, Search and optimization
problems, Heuristic methods, Logic-based prompt engineering, Tabling, User
interfaces.

*IMPORTANT DATES*

- Paper registration (regular papers): April 13, 2025

- Paper submission (regular papers): April 18, 2025

- Notification (regular papers): May 25, 2025

- Paper submission (TC papers, IJCAI Fast Track papers): June 15, 2025

- Revision submission (TPLP papers): June 15, 2025

- Final notification: July 6, 2025

- Final version: July 27, 2025

- Main conference: September 15-19, 2025

*TRACKS AND SPECIAL SESSIONS*

In addition to the main track, ICLP'25 will host:

- IJCAI Fast Track: The notification date for IJCAI'25 does not allow
authors of rejected papers to submit to ICLP'25. In coordination with the
IJCAI'25 program chairs, we have therefore instituted a process by which
authors can submit revised versions of such rejected papers directly to
ICLP'25. Authors must submit a cover letter explaining how they have
addressed the critical issues raised by IJCAI'25 reviewers before
submitting their revised paper to the IJCAI Fast Track of ICLP'25. The
submission will then enter the "revision" phase and be considered for
publication in TPLP.

- Recently Published Research Track: Detailed information will be announced
separately.

*AFFILIATED EVENTS*

- Workshops: September 12-14, 2025

- Autumn School in Computational Logic: September 12-14, 2025

- Doctoral Consortium: September 12-14, 2025

- Logic Programming Contest: September 16 or 17, 2025

- International Symposium on Principles and Practice of Declarative
Programming (PPDP 2025)

- International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2025)

*SUBMISSION DETAILS*

All submissions must be written in English. Papers accepted at ICLP may
appear either in

- The journal Theory and Practice of Logic Programming (TPLP) published
by Cambridge University Press. TPLP format is described at:
https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/information/author-instructions/preparing-your-materials

- The ICLP 2025 Technical Communication Proceedings published by
Electronic Proceedings in Theoretical Computer Science (EPTCS). EPTCS
format is described at: http://style.eptcs.org

Submissions may have one of two forms:

1) Regular papers and IJCAI Fast Track papers are at most 14 pages in TPLP
format, including references. Accepted regular and IJCAI Fast Track papers
will be published in a special issue of TPLP. IJCAI Fast Track papers must
be accompanied by a PDF cover letter detailing:

- The improvements made to the paper compared to the previous
(IJCAI'25) submission, including clarifications on any perceived errors in
the reviewers' assessments, if applicable

- The paper ID of the IJCAI'25 submission

- The authors listed on the IJCAI'25 submission

- The title of the IJCAI'25 submission

- The original PDF submitted to IJCAI'25

- The IJCAI'25 reviews, including scores and text evaluations

The authors of IJCAI Fast Track papers must explicitly give consent for
IJCAI'25 to share all submitted information with ICLP'25 to verify its
accuracy. ICLP'25 may summarily reject papers for several reasons,
including submissions that (a) are outside the thematic scope of ICLP, (b)
inaccurately disclosed required information, or (c) omitted original
authors without justification.

Regular papers that are not (provisionally) accepted for TPLP may be
invited to the Technical Communication Proceedings of ICLP'25. The authors
can choose to convert a regular paper accepted for the Technical
Communication Proceedings into an extended abstract (2 or 3 pages in EPTCS
format), which should allow for submitting a long paper version elsewhere.

2) Technical Communication (TC) papers are at most 12 pages in EPTCS
format, excluding references. Accepted TC papers will be published in the
Technical Communication Proceedings.

Submissions will be made via EasyChair, following the link
https://easychair.org/conferences/?conf=iclp25

All papers must describe original, previously unpublished research, and
must not simultaneously be submitted for publication elsewhere. These
restrictions do not apply to Recently Published Research Track submissions
as well as previously accepted workshop papers with a limited audience
and/or without archival proceedings.

All accepted papers will be presented during the conference. Authors of
accepted papers will be automatically included in the list of ALP members,
who will receive quarterly updates from the Logic Programming Newsletter at
no cost.

*VENUE*

ICLP'25 will be held on the campus of the University of Calabria in Rende,
Italy, during 12-19 September 2025. The University of Calabria is one of
Italy's leading academic institutions, renowned for its innovative research
and vibrant campus life. Located in the scenic city of Rende, it offers a
modern learning environment surrounded by natural beauty and cultural
richness. Calabria is a region rich in culture, offering a blend of
historical heritage and stunning natural beauty. From its breathtaking
coastal spots to its easily accessible mountains, the region provides an
unforgettable cultural and culinary experience, savoring authentic dishes
made from fresh, local ingredients, such as spicy 'nduja, pasta, potatoes
and exquisite desserts.

*ORGANIZATION*

General Chair: Francesco Ricca

Program Co-chairs: Martin Gebser and Daniela Inclezan

Publicity Chairs: Manuel Borroto and Francesco Calimeri

Local Chairs: Antonio Ielo and Giuseppe Mazzotta

*PROGRAM COMMITTEE*

TBA

**********************************************************
*
* 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] Coming soon: Golumbic and Shamir talks -- 30th Anniversary of Graph Sandwich Problems:

Dear colleagues,

We are pleased to invite you to celebrate the 30th anniversary of the
publication of the seminal paper:

*M.C. Golumbic, H. Kaplan, R. Shamir, "Graph Sandwich Problems", Journal of
Algorithms 19 (1995) 449--473.*

with talks by Professors Martin Golumbic and Ron Shamir.

*Event information:*
Date: March 27, 2025
Time: 2:00 PM (GMT -3), São Paulo, Brazil

Link: https://meet.google.com/sur-pmun-evy

*Program Schedule*

*2:00 PM – Opening*

Prof. Simone Dantas (UFF)

*2:05 PM – Session Chair: *Prof. Celina de Figueiredo (COPPE-UFRJ)

*Talk:* *2025 Graph Sandwiches: A Test of Time Celebration*
*Speaker:* Prof. Martin Golumbic (University of Haifa)

*2:45 PM – Session Chair: *Prof. Telma Pará (FAETEC-RJ)

*Talk:* *Computational Biology and Graph Sandwich Problems*
*Speaker:* Prof. Ron Shamir (Tel Aviv University)

*3:15 PM – Closing*

Please share and participate!

Kind regards,

*Simone Dantas*
*Full Professor *
*Institute of Mathematics and Statistics*
*Fluminense Federal University*
http://lattes.cnpq.br/3864440795364252

**********************************************************
*
* 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] Vita Kreps International Student Prize in Game Theory

Dear Colleagues,

We're excited to announce the Vita Kreps International Prize in Game
Theory, recognizing outstanding student contributions to the field. If you
know talented undergraduate or graduate students who've made significant
mathematical or conceptual advances in game theory, encourage them to apply
or nominate them yourselves.

Key details:

---Submission Deadline: April 30

---Eligibility: Current undergraduate and graduate students worldwide

---Award Ceremony: June 24 at the Israeli Game Theory Conference in
Jerusalem

---More info & guidelines:
https://sites.google.com/view/themichaelbmaschlerprize/the-kreps-prize

Please help us spread the word within your networks!

Anna Bogomolnaia, Igal Milchtaich, Hervé Moulin, Fedor Sandomirskiy, Marco
Scarsini, Omer Tamuz, Nicolas Vieille

**********************************************************
*
* 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] LAST Call for Papers - Computational Methods for Business Analytics (CMBA 2025)

**apologies for cross and multiple postings**

LAST Call for Papers

*Computational Methods for Business Analytics
<https://telmoppinto.wixsite.com/cmba>**(**CMBA 2025**)*

http://cmba2025.dps.uminho.pt/

CMBA 2025 International Workshop will be held in the 25th International
Conference on Computational Science and its Applications (ICCSA 2025)
http://www.iccsa.org/

Galatasaray University, Istanbul, Türkiye, June 30- July 3, 2025

*TOPICS*

A non-exhaustive list of topics for the CMBA 2025 is as follows:

· Integer linear programming and combinatorial optimization
approaches

· Exact optimization algorithms: branch-and-bound, polyhedral
approaches, decomposition-based methods, reformulations

· Heuristics, meta-heuristics, matheuristics and model-based
metaheuristics for integer linear programming and combinatorial optimization

· Real-world applications in industry and services: operations
management, supply chain management, logistics and transportation,
scheduling, production management and distribution, warehousing, location,
energy, telecommunications, project management, healthcare

· Optimization software and decision support systems

*IMPORTANT DATES*

· March 7, 2025: Deadline for abstract and paper submission to the
General Tracks

· April 15, 2025: Deadline for reviewers

· April 20, 2025: Notification of Acceptance

· May 8, 2025: Submission deadline for the final version of the
Proceeding Paper (hard deadline)

· May 8, 2025: Registration and payment ends

· June 30 - July 3, 2025: ICCSA 2025 Conference

*SUBMISSION DETAILS*

All accepted papers will be included in the Springer Lecture Notes in
Computer Science (LNCS)
<http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0> series which is
indexed by Scopus, EI Engineering Index, Thomson Reuters Conference
Proceedings Citation Index (included in ISI Web of Science), and several
other indexing services. The papers will contain linked references, XML
versions and citable DOI numbers.
To submit a paper, please connect to the Submission site from the link
available at the ICCSA 2025 website: https://ess.iccsa.org .
Only papers submitted through the electronic system and strictly adhering
to the relevant format will be considered for reviewing and publication.

The submission may fall into the following categories: *General Tracks
and Workshops' Full Papers, General Tracks and Workshops' Short Papers, and
PHD Showcase Papers*.

*CONTACTS*

· TELMO PINTO (CMBA 2025 co-chair), University of Coimbra, Portugal (
telmo.pinto@uc.pt )

· CLÁUDIO ALVES (CMBA 2025 co-chair), University of Minho, Portugal (
claudio@dps.uminho.pt)

**********************************************************
*
* 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: COMPETITION ON EVOLUTIONARY SUBMODULAR OPTIMISATION

CALL FOR PARTICIPATION

COMPETITION ON EVOLUTIONARY SUBMODULAR OPTIMISATION

to be held as part of the 2025 Genetic and Evolutionary Computation Conference (GECCO 2025, hybrid)
organised by ACM SIGEVO (https://gecco-2025.sigevo.org).

Submodular functions play a key role in the area of optimisation as they allow to model many real-world optimisation problems. Submodular functions model a wide range of problems where the benefit of adding solution components diminishes with the addition of elements. They form an important class of optimization problems and are extensively studied in the literature. Problems that may be formulated in terms of submodular functions include influence maximization in social networks, maximum coverage, maximum cut in graphs, sensor placement problems, and sparse regression. In recent years, the design and analysis of evolutionary algorithms for submodular optimisation problems have gained increasing attention in the evolutionary computation and artificial intelligence community.

The aim of the competition is to provide a platform for researchers working on evolutionary computing methods and interested in benchmarking them on a wide class of combinatorial optimization problems. The competition will benchmark evolutionary computing techniques for submodular optimisation problems and enable performance comparison for this type of problems. It provides an ideal vehicle for researchers and students to design new algorithms and/or benchmark their existing approaches on a wide class of combinatorial optimization problems captured by submodular functions.

Competition webpage: https://cs.adelaide.edu.au/~optlog/CompetitionESO2025.php

The submission deadline: 30 June 2025, AoE

Organisers:
Aneta Neumann, University of Adelaide, Australia <https://researchers.adelaide.edu.au/profile/aneta.neumann>
Saba Sadeghi Ahouei, University of Adelaide, Australia <https://cs.adelaide.edu.au/~optlog/staff.php>
Jacob de Nobel, Leiden University, The Netherlands <https://www.universiteitleiden.nl/en/staffmembers/jacob-de-nobel#tab-1>
Diederick Vermetten, Leiden University, The Netherlands<https://orcid.org/0000-0003-3040-7162>
Thomas Bäck, Leiden University, The Netherlands<https://www.universiteitleiden.nl/en/staffmembers/thomas-back#tab-1>
Frank Neumann, University of Adelaide, Australia<https://cs.adelaide.edu.au/~frank/>

Please feel free to forward this call to any colleagues who may be interested in the competition on Evolutionary Submodular Optimisation.

We are looking forward to your submission.

Dr Aneta Neumann
Researcher, Optimisation and Logistics
Director of Real Word Applications
School of Computer and Mathematical Sciences
Faculty of Sciences, Engineering and Technology
The University of Adelaide, Australia
[image001.jpg]

http://researchers.adelaide.edu.au/profile/aneta.neumann
https://www.linkedin.com/in/anetaneumann
CRICOS Provider Number 00123M
**********************************************************
*
* 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] [Scheduling seminar] Premysl Sucha (CTU in Prague) | April 9 | Machine Learning Inside Decomposition of Scheduling Problems

Dear scheduling researcher,

We are delighted to announce the talk given by Premysl Sucha (CTU in
Prague).
The title is "Machine Learning Inside Decomposition of Scheduling
Problems". The seminar will take place on Zoom on Wednesday, April 9 at
13:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/93077786062?pwd=Cj5lSGL0PI5el3qj3nBkbTXMh3ZTKc.1
Meeting ID: 930 7778 6062
Passcode: 851384
You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
Problem decomposition refers to general techniques for efficiently
solving large instances. The fact that decomposition splits the problem
into smaller subproblems and then combines their solutions into a
solution to the original problem opens up many possibilities for
applying machine learning. There are two main advantages why it is
suitable. The first is that the subproblems are solved
repeatedly/recursively, so similar instances are solved multiple times.
The second is that the subproblems are smaller and thus easier to
combine with machine learning. In this talk, we show two successful
applications of machine learning to speed up scheduling algorithms based
on decomposition techniques, namely branch and price and Lawler's
decomposition.

The talk by Christian Blum (IIIA-CSIC) planed on March 26 is cancelled
due to personal reasons of the speaker. Nevertheless, the next talk in
our series will be:
Christian Blum (IIIA-CSIC) | April 23 | CMSA: A Hybrid Metaheuristic for
Combinatorial Optimization
For more details, please visit https://schedulingseminar.com/
With kind regards

Zdenek Hanzalek, Michael Pinedo and Guohua Wan

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

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

[DMANET] Postdoc position at University of Warsaw - Structural and algorithmic graph theory

We announce a two-year postdoc position in a project "Structural and
algorithmic properties of hereditary graph classes", led by Marcin
Pilipczuk at University of Warsaw.

Application deadline 2024-04-10, ideal starting date 2025-10-01.

Official call: https://euraxess.ec.europa.eu/jobs/321760
More information about the project:
https://www.mimuw.edu.pl/~malcin/sonata-bis/

Best regards,
Marcin Pilipczuk

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

[DMANET] The Automated Negotiating Agents Competition at IJCAI 2025: Sequential Multi-deal Agent Negotiation

=================================================================================
The Automated Negotiation League: Sequential Multi-deal Agent Negotiation

Challenge: Developing a negotiating agent for sequential multi-deal
negotiation

Submission deadline: June 1st, 2025

Event: The Automated Negotiating Agents Competition (ANAC) 2025 as part of
IJCAI 2025 in Montreal, Canada

Call for participation details: https://tinyurl.com/ANLdocs

The Automated Negotiation League website:
https://autoneg.github.io/anl2025/
=================================================================================

====== Challenge ======

We invite everyone to submit a negotiation agent to The Automated
Negotiation League, held at IJCAI 2025. This year, the challenge is to
design a negotiation agent for sequential multi-deal negotiation. Your
agent will encounter multiple opponents in sequence and is rewarded for the
specific combination of the deals made in each negotiation. Therefore, the
agent needs to take into account possible future deals, survey the
available options, and beat other contestants by conceding efficiently and
obtaining the best deals.

====== Event ======

The competition takes place during IJCAI 2025 in Montreal, Canada, from
16th to 22nd August, 2025. The winners can acquire travel grants to attend
the competition at the IJCAI conference, and possibly give a brief
presentation there.

====== Entrants ======

Entrants to the competition have to develop and submit an autonomous
negotiating agent that runs on NegMAS: a Python-based negotiation platform
in which you can develop general negotiating agents. The NegMAS based
anl2025 module provides a method to run tournaments in the same settings as
this year's ANL competition. For more information, follow this link:
https://autoneg.github.io/anl2025/
The performance of the agents will be evaluated in a tournament between all
participants, where each agent is matched with other submitted agents.

====== Submission (Deadline: June 1, 2025) ======

The competition rules allow multiple entries from a single institution, but
require each agent to be developed independently. Participants submit their
agent source code through the following link: https://scml.cs.brown.edu/anl

====== Important Dates ======

Submission deadline: June 1, 2025
Notification to finalists: June 15, 2025
Event: August 16th to 22rd, 2025

====== Questions and Answers ======

Participation details: https://tinyurl.com/ANLdocs
ANAC website: https://web.tuat.ac.jp/~katfuji/ANAC2025/
Get started on the ANL website: https://autoneg.github.io/anl2025/
Look at the FAQ https://autoneg.github.io/anl2025/faq/ and feel free to ask
further questions to us.

Send your questions to:
tamara.florijn@cwi.nl (main contact)
T.Baarslag@cwi.nl
reyhan.aydogan@ozyegin.edu.tr
katfuji@cc.tuat.ac.jp

**********************************************************
*
* 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] [Deadline Extended] IEEE Intelligent Metaverse Conference (iMETA 2025), Dubrovnik, Croatia [Hybrid Conference]

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

*14-17 October 2025 | Dubrovnik, Croatia*

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

*Hybrid Conference*

*Sponsored by IEEE Croatia Section*

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 Submission: *April 15, 2025*

· Acceptance Notification: May 26, 2025

· Registration Due: June 26, 2025

· Camera-ready paper due: July 26, 2025

· Workshop/Tutorial Proposal Submission: April 15, 2025

· Workshop/Tutorial Proposal Acceptance: May 1, 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, 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] MIP 2025 Summer School Announcement and Contributed Flash Talk Submission

Dear all,

The 2025 Mixed Integer Programming (MIP) Workshop<https://mixedinteger.org/2025> will be held in June at the University of Minnesota in Minneapolis, MN. Stay tuned for an announcement about early registration opening (tentatively, on March 31) and local accommodation options.

Our regular workshop program, which will run June 3–6, 2025, includes a single track of invited expert speakers, student poster presentations jointly with a welcome reception, and special events related to the MIP computational competition.

Furthermore, this year we have two additional features:

(1) MIP 2025 will host the second MIP summer school<https://www.mixedinteger.org/2025/summerschool> on Monday, June 2, 2025 (the day immediately preceding the start of the regular workshop). This year's summer school speakers and their talk titles are listed below.

Philipp Christophel (SAS), Implementing Numerical Optimization Algorithms
Ricardo Fukasawa (Waterloo), Column generation and IP (from textbook to practice)
Andrés Gómez (USC), Methodologies and Algorithms for Structured Mixed-Integer Nonlinear Optimization.

(2) MIP 2025 is opening up limited slots for submissions of contributed "flash" talks by "nonstudents" (those who were not eligible for the poster session, such as postdocs, faculty, national lab members, and industry researchers). If you are interested, please submit your title/abstract by April 7, 2025 via the form linked below. We intend to communicate decisions by April 18, 2025.

https://forms.gle/EpRu4DfgZR2waLqb9

If you have any questions, please email me (akazachkov@ufl.edu<mailto:akazachkov@ufl.edu>).

We hope to see you in Minnesota in June,
Aleks

on behalf of the MIP 2025 program committee:

Sophie Huiberts
Aleksandr Kazachkov (chair)
Sebastian Perez-Salazar
Christian Tjandraatmadja
Yiling Zhang
___
Aleksandr Kazachkov<https://akazachk.github.io>
Assistant Director, Center for Applied Optimization
Assistant Professor, Department of Industrial and Systems Engineering
University of Florida

**********************************************************
*
* 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] 2025 IET UK - Spain Smart Cities Forum (free online event)

Dear colleagues,

We are happy to announce the 2025 IET UK - Spain Smart Cities Forum, an
event supported by the Institution of Engineering & Technology (IET), UK.

The event is to be held ONLINE and is FREE for all to attend, being
promoted by the IET SMART CITIES JOURNAL and IET Spain Local Networks.

This programme will be delivered virtually. The live online sessions will
be delivered via Zoom.

IET members can receive up to 6 hours of CPD by attending this event.

Event Web site: https://grc.webs.upv.es/events/ukspainscf2025/

Context:

Smart cities will evolve globally as the next big development that will
change and improve the lives of billions. Smart cities will involve
multiple disciplines, such as electrical engineering, computer science,
civil engineering, environmental science, urban science, sustainable
science, transportation engineering, sociology and living habitat. Smart
cities have evolved to solve some of the world's most pressing life issues,
such as: traffic congestion, air pollution, health hazards, natural
disasters, crimes, public safety, decarbonization, sustainability, etc. Why
Spain? According to FiberRoad Market Research, between 2023 and 2028, the
Smart Cities market in Spain is projected to maintain an impressive
compound annual growth rate (CAGR) of around 11.77%. This steady and
sustained growth indicates that Spain is not just embracing smart
technologies but is also actively working towards their integration into
the fabric of its urban environments. Looking further ahead, it is
anticipated that by 2028, the Spanish Smart Cities market will have
expanded significantly, reaching an estimated market volume of
approximately US$1.64 billion. This projection reflects a commitment to the
long-term development of smart city infrastructure and solutions.

Why the UK?

According to Statista, revenue in the UK Smart Cities market is projected
to reach US$1.52bn in 2024. It is anticipated that the revenue will display
an annual growth rate (CAGR 2024-2029) of 11.59%, leading to a market
volume of US$2.63bn by 2029. Five of the promising projects include: (a)
Manchester's Triangulum project, (b) Hull's Smart City OS, (c) Smarter
London Together, (d) Bristol Is Open and (e) Future City Glasgow. Smart
London is the technological capital of EUROPE. The London city
administration has decided to transform City of London into a
carbon-neutral city by 2050.

Speakers

Leaders and researchers from both industries and universities will present
at this forum. Please join us to learn the latest state of the art of Smart
Cities. Q&A will be provided after each speaker to enhance understanding
and interactions.

Organizing committee William Webb, FREng PhD, General Co-Chair Chai K Toh
FREng PhD, General Co-Chair Juan Carlos Cano, General Co-Chair Carlos T.
Calafate, TPC Chair Kun Yang, TPC Chair Francisco Martínez, TPC Co-Chair Jeff
Yan, International cooperation chair Wanqing Tu, International cooperation
chair Gianni Cessel, IET Spain liaison Event date: April 7, 2025

Event link: https://essex-university.zoom.us/j/92664021042

-------------------------------------------------
Francisco J. Martinez
Computer Architecture
University of Zaragoza

http://init.unizar.es/paco/
http://init.unizar.es/
http://www.grc.upv.es/

**********************************************************
*
* 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] DNA31 - Fifth Call For Papers

Dear all,

DNA31 will be in Lyon, call info is below. Note that Track A accepts
typical theory-style papers, published by LIPIcs.

Regards,
Damien Woods

CALL FOR PAPERS
DNA31 - 31st International Conference on DNA Computing and Molecular
Programming
École Normale Supérieure de Lyon, France
August 25–28, 2025
https://dna31.sciencesconf.org

THE MEETING
Research in DNA computing and molecular programming draws together
mathematics, computer science, physics, chemistry, biology, and
nanotechnology to address the analysis, design, and synthesis of
information-based molecular systems. This annual meeting is the premier
forum where scientists with diverse backgrounds come together with the
common purpose of applying principles and tools of computer science,
physics, chemistry, and mathematics to advance molecular-scale
engineering and biology. The 31st International Conference on DNA
Computing and Molecular Programming (DNA31), organized under the
auspices of the International Society for Nanoscale Science, Computation
and Engineering (ISNSCE), will focus on the most important recent
experimental and theoretical results.

SOLICITATION FOR PAPERS
Papers and presentations are sought in all areas that relate to
biomolecular computing, including, but not restricted to: algorithms and
models for computation on biomolecular systems; computational processes
in vitro and in vivo; molecular switches, gates, devices, and circuits;
molecular folding and self-assembly of nanostructures; analysis and
theoretical models of laboratory techniques; molecular motors and
molecular robotics; studies of fault-tolerance and error correction;
software tools for analysis, simulation, and design; synthetic biology
and in vitro evolution; applications in engineering, physics, chemistry,
biology, and medicine.

IMPORTANT DATES (FIRM DEADLINES)
Full paper (track A) and extended abstract (track B) submission: April
22, 2025 (11:59 PM AoE)
Please note we are on a tighter than normal schedule and there can be no
further extension; we have already compressed the reviewing, revision
and publication timeline.
Notification of paper acceptance: June 9, 2025
Revised manuscripts due: June 23, 2025
Poster (track C) submission: June 15, 2025 (11:59 PM AoE)
Notification of poster acceptance: June 30, 2025
Early registration deadline: July 10, 2025
Registration ends: August 14, 2025
Conference: August 25-28, 2025
NOTE: ALL DEADLINES ARE FIRM, THERE WILL BE NO EXTENSIONS!

INSTRUCTIONS FOR AUTHORS
Please see the detailed instructions ion the conference website.

Sent by Damien Woods on behalf of:
Josie Schaeffer and Fei Zhang
DNA31 Program Co-Chairs

If you have any questions, please contact dna31@sciencesconf.org
============================================================
This is the mailing list for ISNSCE (International Society for Nanoscale
Science, Computation, and Engineering).
To unsubscribe, please visit https://utlists.utexas.edu/sympa/signoff/isnsce

**********************************************************
*
* 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] GACLM 2025: Generative AI and Computational Language Modelling Conference, 18-21 August, 2025 | Valencia, Spain

[Apologies if you got multiple copies of this invitation]

The 2nd International Generative AI and Computational Language Modelling
Conference (GACLM 2025)

https://gaclm.org/2025/

18-21 August, 2025 | Valencia, Spain

Hybrid Event

Technically Co-Sponsored by IEEE Spain Section

*GACLM 2025 CFP:*

With the emergence of Generative AI (GenAI), the world is experiencing a
new era of generative models producing various types of data, including
textual and visual data. This is accompanied by the unprecedented
advancement of Computational Language Modeling (CLM) techniques that are
supporting a wide range of downstream applications. Both Generative AI and
Computational Language Modeling are leading the paradigm shift we are
witnessing in Artificial Intelligence.

The International Generative AI and Computational Language Modeling
Conference (GACLM 2025) addresses the architectures, applications,
challenges, approaches, and future directions of this new era of Artificial
Intelligence systems based on GenAI and CLM. We invite the submission of
original papers on all topics related to GACLM, with special interest in,
but not limited to, the following:

- Human-Centered Generative AI
- Natural Language Processing (NLP)
- Large Language Models (LLMs)
- Text generation, summarization, and question answering
- Sentiment analysis, misinformation detection, and emotion detection
- Machine translation and multilingual models
- Language comprehension, grammar and style checking, and complex
reasoning
- Document processing and information retrieval
- Computer-Assisted Language Learning
- Adversarial machine learning and applications
- Generative adversarial networks (GANs)
- GenAI and diffusion models
- Federated and distributed learning for GenAI
- Fine-tuning and retrieval-augmented generation (RAG)
- Synthetic data generation and data augmentation
- Explainable AI (XAI) and trustworthy AI systems
- GenAI in healthcare, education, robotics, and smart cities
- GenAI for cybersecurity and Internet of Things (IoT) systems
- GenAI for sustainability and human good
- Computer vision, creative applications, and video generation
- GenAI ethics and governance

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the GACLM Proceeding, and
be published by the IEEE Computer Society Conference Publishing Services
and be submitted to IEEE Xplore for inclusion.

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

*Important Dates:*

- *Paper submission deadline: May 20th 2025*
- Notification of acceptance: July 15th, 2025
- Camera-ready Submission: July 31th, 2025

*Contact:*

Please send any inquiry on GACLM to: info@gaclm.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] Call for Participation: Maritime Shipping Competition (MSC) at the 24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2025)

Call for Participation: Maritime Shipping Competition (MSC) at the 24th
International Conference on Autonomous Agents and Multiagent Systems (AAMAS
2025)
<https://jbuerman.github.io/Maritime-Shipping-Competition-AAMAS2025/call/update/2025/02/10/call-for-contribution.html#call-for-participation-maritime-shipping-competition-msc-at-the-24th-international-conference-on-autonomous-agents-and-multiagent-systems-aamas-2025>

We invite researchers and practitioners to participate in the Maritime
Shipping Competition (MSC), hosted as part of the 24th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS 2025), with
final presentations taking place on the 20th of May 2025 in Detroit,
Michigan, USA. This competition provides an opportunity to showcase and
compare innovative approaches in auction bidding and transportation
scheduling.

To participate, please visit:

https://jbuerman.github.io/Maritime-Shipping-Competition-AAMAS2025/
About the Competition

Maritime transportation is one of the backbones of international trade and
supply chains. While the sector has shown growth in recent years, maritime
transportation is also facing critical challenges around geopolitical
tensions, climate change and disruptions at key chokepoints, e.g. the
Panama and the Suez Canals. Shipping companies are investigating digital
solutions, including digital twin and multi-agent technologies, to improve
fleet utilisation, e.g. via transportation scheduling, to reduce costs but
also greenhouse gas emissions. Many of these digital solutions are in their
infancy and could benefit from innovative applications of approaches from
multiagent system, artificial intelligence, scheduling, auction bidding and
related technologies.

The competition will require to develop a software agent in Python that
operates the trade auctions and fleet transmutation scheduling for a
maritime shipping company. Participating will allow you to compete for
prizes.

We will run a warm-up competition to get early feedback and a final
competition with results being presented at AAMAS.
Participation and Timeline

We welcome contributions from teams up to five people across academia,
industry, and independent research communities. Participants are required
to submit an agent implemented in Python and a short 2-4 page report.

- Warm-up Competition Submission Deadline: 24/03/2025
- Warm-up Competition Results Release: 07/04/2025
- Competition Submission Deadline: 28/04/2025
- Announcement of Presentation Slots: 05/05/2025
- Competition Results Presentation and Winner Announcement: 20/05/2025

Submissions should be made via msc.aamas2025@soton.ac.uk, following the
instructions provided at
https://jbuerman.github.io/Maritime-Shipping-Competition-AAMAS2025/.

All submission dates are 23:59h AoE (Anywhere on Earth).
Competition Session at AAMAS

All teams will have the opportunity to present their agent and strategy at
the session at AAMAS 2025. A presentation will be necessary to compete for
the innovative ideas prize.
Awards & Recognition

The competition will feature certificates and performance based prizes and
a prize for an innovative ideas.

The first three teams according to the average tournament ranking will
receive a certificate and a cash prize. The overall winner will receive
£500, the runner-up will receive £300 and the team placing third will
receive £100.

Additionally, the team with the most interesting strategy agent prize will
receive £100. This prize will be judged on the day of the competition at
AAMAS after the presentations.
How to Get Involved

To participate, please visit
https://jbuerman.github.io/Maritime-Shipping-Competition-AAMAS2025/ for
detailed guidelines. For any inquiries, contact us at
msc.aamas2025@soton.ac.uk.
Organising Committee
<https://jbuerman.github.io/Maritime-Shipping-Competition-AAMAS2025/organisingcommittee>

- Enrico Gerding, University of Southampton, UK
- Enrico Marchioni, University of Southampton, UK
- Baharak Rastegari, University of Southampton, UK
- Jan Buermann, University of Southampton, UK

The competition and prizes are made possible thanks to the Centre for
Maritime Futures at the University of Southampton with support from Shell
plc.

**********************************************************
*
* 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] Stockholm Global Optimization Workshop

Dear Optimization Friends,

Stockholm Global Optimization Workshop 2025 (STOGO) is held in Stockholm from September 2 - 5. https://sites.google.com/view/stogo25/

Please submit an abstract if you want to give a talk. Abstract submission is open! The workshop covers all aspects of global optimization, and all presenters will be invited to submit full papers in special issues in top journals (Journal of Global Optimization is confirmed, and we hope to have a special issue also in Mathematical Programming).

Anyone who is planning to attend, please submit the survey of interest form: https://forms.gle/ZhbtvatcBYCpuDrZ7 (this helps us estimate the number of participants and makes planning easier).

Best regards,
Jan



**********************************************************
*
* 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/Postdoc position in discrete mathematics and algorithms

One PhD or Postdoc position at the interface of discrete mathematics and
algorithms is available at the University of Kassel (Institute of
Mathematics). Applicants with a strong background in combinatorics (graph
theory, order theory, discrete geometry), algorithms, discrete optimization
and/or algebra are encouraged to apply. The position is advertised openly,
as we seek either one PhD student or one Postdoc (depending on the strength
of the applicants), to complement our existing research group, which
currently consists of 1 PhD student and 2 Postdocs (
https://www.uni-kassel.de/fb10/institute/mathematik/arbeitsgruppen/algorithmische-algebra-und-diskrete-mathematik/prof-dr-torsten-muetze/team
).

The starting date is August 01, 2025, but somewhat flexible, and the
position is for 3 years, with the possibility of extension by 1 additional
year.
Please reach out informally to Torsten Mütze (
tmuetze@mathematik.uni-kassel.de) to learn more about this opportunity.

The official application links, where all documents have to be submitted,
are:
-
https://stellen.uni-kassel.de/jobposting/fc138a0c362581a12b9a2e897aa8d18b8356db590
-
https://stellen.uni-kassel.de/jobposting/c464616a75ca54fb71803a893d2ee4f8786d40250
The first link is in English, and the second one in German, but both are
for the same position, and you can apply through either channel (one is
enough).

**********************************************************
*
* 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] ALGOWIN 2025 - 1st Call for Papers

ALGOWIN 2025

21st International Symposium on Algorithmics of Wireless Networks

September 18-19, 2025

Faculty of Physics, University of Warsaw, Poland (as part of ALGO 2025)

Conference webpage: *https://algo-conference.org/2025/algowin/*

EasyChair link: *https://easychair.org/conferences/?conf=algowin2025*

==============
Important Dates
==============
Submission deadline: June 6, 2025 (AoE)
Notification: August 1, 2025
Camera-ready due: August 29, 2025
Conference: September 18-19, 2025

===== Scope =====

The International Symposium on Algorithmics of Wireless Networks (ALGOWIN),
previously known as ALGOSENSORS, is an international forum dedicated to the
algorithmic aspects of wireless networks. It covers algorithmic issues
arising in wireless networks of all types of computational entities, static
or mobile, including sensor networks, sensor-actuator networks, autonomous
robots, and drones. The focus is on the design and analysis of algorithms,
models of computation, graph and network algorithms, and experimental
analysis.

ALGOWIN 2025 will be held at the Faculty of Physics, University of Warsaw,
Poland. It will be part of ALGO 2025, which also hosts ESA, IPEC, ATMOS,
ALGOCLOUD, WABI, and WAOA.

=============
Call for Papers
=============
Original research contributions are solicited related to diverse
algorithmic aspects of sensor networks, wireless networks, broadly
construed, as well as distributed robotics, including the theoretical,
experimental and application perspectives.

Topics of interest include, but are not limited to:

- Ad Hoc Networks
- Autonomous Mobile Robots
- Communication Protocols
- Complexity and Computability
- Computational Models
- Data Aggregation and Fusion
- Distributed Aspects of Group Search
- Dynamic Networks
- Temporal Graphs
- Energy Management, Power Saving Schemes
- Fault Tolerance and Dependability
- Game Theoretic Aspects
- Infrastructure Discovery
- Internet of Things
- Localization
- Medium Access Control
- Mobility and Dynamics
- Obstacle Avoidance
- Pattern Formation
- Performance Evaluation, Experimental Analysis
- Population Protocols, Swarm Computing
- Resource Efficiency
- RFID Algorithms
- Routing and Data Propagation
- Self-stabilization, Self-* Properties
- Sensor Networks
- Systems and Testbeds
- Time Synchronization
- Topology Control
- Tracking
- Unmanned Autonomous Entities
- Virtual Infrastructures

===========
Committees
===========
Program Committee

- Othon Michail, University of Liverpool, UK (chair)
- Giuseppe Prencipe, University of Pisa, Italy (chair)

- Davide Bilò, University of L'Aquila, Italy
- Paolo Boldi, University of Milan, Italy
- Quentin Bramas, University of Strasbourg, France
- Arnaud Casteigts, University of Geneva, Switzerland
- Shantanu Das, Aix-Marseille University, France
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy
- Shlomi Dolev, Ben-Gurion University of the Negev, Israel
- Thomas Erlebach, Durham University, UK
- Chryssis Georgiou, University of Cyprus, Cyprus
- Olga Goussevskaia, Federal University of Minas Gerais (UFMG), Brazil
- Ralf Klasing, CNRS and University of Bordeaux, France
- Evangelos Kranakis, Carleton University, Canada
- George Mertzios, Durham University, UK
- Nils Morawietz, Friedrich Schiller University Jena, Germany
- Alfredo Navarra, University of Perugia, Italy
- Lorenzo Palazzetti, University of Perugia, Italy
- Christoforos Raptopoulos, University of Patras, Greece
- Christian Scheideler, Paderborn University, Germany
- Christian Schindelhauer, University of Freiburg, Germany
- George Skretas, Hasso Plattner Institute, Germany
- Paul Spirakis, University of Liverpool, UK
- Tami Tamir, Reichman University, Israel
- Sébastien Tixeuil, Sorbonne University, France
- Prudence Wong, University of Liverpool, UK

Steering Committee

- Sotiris Nikoletseas, University of Patras and CTI, Greece (Chair)
- Jie Gao, Rutgers University, USA
- Magnús M. Halldórsson, Reykjavik University, Iceland
- Bhaskar Krishnamachari, University of Southern California, USA
- P. R. Kumar, Texas A&M University, USA
- José Rolim, University of Geneva, Switzerland
- Christian Scheideler, Paderborn University, Germany
- Paul Spirakis, University of Liverpool, UK

===========
Proceedings
===========
The conference proceedings will be published in the Springer "Lecture Notes
in Computer Science" series after the conference (expected October 2025).

===========
Special Issue
===========
Selected papers will be invited to a special issue of the Theoretical
Computer Science journal.

=======
Awards
=======
Awards will be given to the best paper and the best student paper. The
awards are kindly sponsored by Springer. To be eligible for the best
student paper award, at least one of the paper authors must be a full-time
student at the time of submission, and the student(s) must have made a
significant contribution to the paper. The program committee may decline to
make these awards or may split them.

================
Paper Submission
================
Papers are to be submitted electronically using the EasyChair server
(*https://easychair.org/conferences/?conf=algowin2025*). The submissions
must contain original results that have not already been published and are
not concurrently submitted to a journal or conference with published
proceedings. By submitting a paper, the authors acknowledge that in case of
acceptance at least one of the authors will register for ALGO/ALGOWIN 2025
and present the paper.

Submissions must be in the form of a single pdf file prepared using the
LNCS latex templates and style files (available, together with Springer's
authors' guidelines, from
*https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines*
).
Springer's proceedings LaTeX templates are also available on Overleaf
(*https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj#.WsdHOy5uZpg*
).

Each submission should consist of the main part of the paper, not exceeding
12 pages (including the title page and excluding the references), plus an
optional clearly marked appendix (to be read at the discretion of the
program committee). Any figure pertaining to the main part of the paper
should be included therein (within the 12 page limit). The first page must
include an indication of whether the paper is eligible for the best student
paper award.

--
Giuseppe Prencipe
Dipartimento di Informatica
L.go B. Pontecorvo, 3
56100, Pisa
ITALY
tel. +39 050 2213148
fax. +39 050 2212726

**********************************************************
*
* 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] AAMAS 2025: Call for Participation (Early Registration: 31 March, 2025)

The 24th International Conference on Autonomous Agents and Multiagent
Systems (AAMAS 2025) will be held 19–23 May 2025 in Detroit, Michigan, USA.

Registration is open, and early registration ends on 31 March, 2025
(details below).

https://aamas2025.org/index.php/conference/registration/

======================
CALL FOR PARTICIPATION
======================

AAMAS is the largest and most influential conference in the area of agents
and multiagent systems. The aim of the conference is to bring together
researchers and practitioners in all areas of agent technology and to
provide a single, high-profile, internationally renowned forum for research
in the theory and practice of autonomous agents and multiagent systems.
AAMAS is the flagship conference of the non-profit International Foundation
for Autonomous Agents and Multiagent Systems (IFAAMAS).

- Date: 19-23 May 2025
- Location: Detroit, Michigan, USA
- Web site: https://aamas2025.org/
- Social Media: https://bsky.app/profile/aamasconf.bsky.social
- Registration is now open:
https://aamas2025.org/index.php/conference/registration/
- Early Registration: April 31, 2025

== Program ==

The timetable for workshops, tutorials, the doctoral consortium (DC), and
competitions can be viewed at a glance here:
https://docs.google.com/spreadsheets/d/10L8iD7pFPPOKdmWcn81taRGAcmPRkLHs3vkaHf7APF8/edit?gid=0#gid=0

- Workshop & Tutorial Days are Monday, 19 May and Tuesday, 20 May.
- The Doctoral Consortium is a full-day event that will be held on Monday,
19 May.

The list of accepted papers is available here:
https://aamas2025.org/index.php/conference/program/accepted-papers/

The program features an exciting set of 14 workshops, 12 tutorials, 8
competitions, and a full-day doctoral consortium event.

- Accepted workshops:
https://aamas2025.org/index.php/conference/program/accepted-workshops/
- Accepted tutorials:
https://aamas2025.org/index.php/conference/program/tutorials/
- Accepted competitions:
https://aamas2025.org/index.php/conference/program/competitions/

In addition, the program will feature talks of winners of the 2025 ACM
SIGAI / AAMAS Autonomous Agents Award and the Victor Lesser Distinguished
Dissertation Award.

== Visa, Travel, and Accommodation Information ==

- Visa information:
https://aamas2025.org/index.php/conference/attending/visa-information/
- Travel information: AAMAS 2025 will be held in the Detroit Marriott at
the Renaissance Center.
- Plan your visit to AAMAS and Detroit here:
https://visitdetroit.com/aamas2025/
- Accommodation information:
https://aamas2025.org/index.php/conference/attending/accommodation/

Please book accommodation as soon as possible to get the best rates. Book
your hotel room here:
https://book.passkey.com/event/50924357/owner/437/landing

**********************************************************
*
* 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 for 4th Workshop on Quantum Optimization @ GECCO 2025 (Malaga, Spain). Deadline extension: April 2, 2025

(apologies for cross postings)

QuantOpt@GECCO-2025

4th Workshop on Quantum Optimization

Genetic and Evolutionary Computation Conference (GECCO'25)

Malaga, Spain, July 14-18, 2025

Extended Paper Submission Deadline: April 2, 2025

Scope
Quantum computers are rapidly becoming more powerful and increasingly applicable to solve problems in the real world. They have the potential to solve extremely hard computational problems, which are currently intractable by conventional computers. Quantum optimization is an emerging field that focuses on using quantum computing technologies to solve hard optimization problems.

There are two main types of quantum computers: quantum annealers and gate-based quantum computers. Quantum annealers are specially tailored to solve combinatorial optimization problems. They find (near) optimal solutions via quantum annealing, which is similar to traditional simulated annealing, and use quantum tunnelling phenomena to provide a faster mechanism for moving between states and faster processing. On the other hand, gate-based quantum computers are universal and can perform general purpose calculations. These computers can be used to solve combinatorial optimization problems using the quantum approximate optimization algorithm and quantum search algorithms.

Quantum computing has also given rise to quantum-inspired computers and algorithms. Quantum-inspired computers use dedicated hardware technology to emulate/simulate quantum computers. Quantum-inspired optimization algorithms use classical computers to simulate some physical phenomena such as superposition and entanglement to perform quantum computations, in an attempt to retain some of its benefit in conventional hardware when searching for solutions.

To solve optimization problems on a quantum computer, we need to reformulate them in a format suitable for the quantum hardware, in terms of qubits, biases and couplings between qubits. In mathematical terms, this requirement translates to reformulating the optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. This is closely related to the renowned Ising model. It constitutes a universal class, since all combinatorial optimization problems can be formulated as QUBOs. In practice, some classes of optimization problems can be naturally mapped to a QUBO, whereas others are much more challenging to map.

Content
The aim of the workshop is to provide a forum for both scientific presentations and discussion of issues related to quantum optimization. As the algorithms that quantum computers use for optimization can be regarded as general types of randomized search heuristics, there are potentially great research benefits and synergy to bringing together the communities of quantum computing and randomized search heuristics.

The workshop aims to be as inclusive as possible and welcomes contributions from all areas broadly related to quantum optimization – by researchers from both academia and industry.

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

· Formulation of optimization problems as QUBOs (including handling of non-binary representations and constraints)

· Fitness landscape analysis of QUBOs

· Novel search algorithms to solve QUBOs

· Experimental comparisons on QUBO benchmarks

· Theoretical analysis of search algorithms for QUBOs

· Speed-up experiments on traditional hardware vs quantum(-inspired) hardware

· Decomposition of optimization problems for quantum hardware

· Application of the quantum approximate optimization algorithm

· Application of Grover's algorithm to solve optimization problems

· Novel quantum-inspired optimization algorithms

· Optimization/discovery of quantum circuits

· Quantum optimization for machine learning problems

· Optical Annealing

· Dealing with noise in quantum computing

· Quantum Gates' optimization, Quantum Coherent Control

All accepted papers of this workshop will be included in the Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'25) Companion Volume.

Instructions for Authors
We invite submissions of two types of paper:

· Regular papers (limit 8 pages)

· Short papers (limit 4 pages)

Papers should present original work that meets the high-quality standards of GECCO. Each paper will be rigorously evaluated in a review process. Accepted papers appear in the ACM digital library as part of the Companion Proceedings of GECCO. Each paper accepted needs to have at least one author registered by the author registration deadline. Papers must be submitted via the online submission system https://ssl.linklings.net/conferences/gecco/. Please refer to https://gecco-2025.sigevo.org/Paper-Submission-Instructions for more detailed instructions.

Workshop Chairs
- Alberto Moraglio, University of Exeter, UK

- Mayowa Ayodele, D-Wave systems, UK

- Francisco Chicano, University of Malaga, Spain

- Ofer Shir, Tel-Hai College and Migal Institute, Israel

- Lee Spector, Amherst College, USA

- Matthieu Parizy Fujitsu Limited, Japan

**********************************************************
*
* 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] GECCO 2025 Calls for Hot-of-the-Press, Late Breaking Abstracts and Competition Entries

2025 Genetic and Evolutionary Computation Conference (GECCO 2025)
https://gecco-2025.sigevo.org/HomePage
14 - 18 July 2025, Málaga, Spain

Call for Hot-off-the-Press

The Hot-Off-the-Press (HOP) track offers authors of recent papers the opportunity to present their work to the GECCO community, both by giving a talk on one of the three main days of the conference and by having a 2-page abstract appear in the Proceedings Companion, in which the workshop papers, late-breaking abstracts, and tutorials also appear. We invite researchers to submit summaries of their own work recently published in top-tier conferences and journals. Contributions are selected based on their scientific quality and their relevance to the GECCO community.

Further information can be found at: https://gecco-2025.sigevo.org/Call-for-HOPs

The submission deadline is 12 April 2025. Looking forward to receiving your submissions.

Eric Medvet (emedvet@units.it<mailto:emedvet@units.it>), GECCO 2025 Hot-off-the-Press Chair

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

Call for Late-Breaking Abstracts

Two-page abstracts describing late-breaking developments in the field of genetic and evolutionary computation are solicited for presentation at the Late-Breaking Abstracts Workshop of the 2025 Genetic and Evolutionary Computation Conference (GECCO 2025), and for inclusion in the conference proceedings companion, available to all attendees of the conference and in the ACM Digital Library. Please emphasise what is the exciting new component/innovation that will enhance the field of genetic and evolutionary computation, and why you think it will help advance the field. This is a great opportunity to elicit informed feedback from world-leading peers and gain attribution for ideas in case other groups are working on similar innovations.

Further information can be found at: https://gecco-2025.sigevo.org/Call-for-LBAs

The submission deadline is 12 April 2025. Looking forward to receiving your submissions.

Heike Trautmann (htrautm@mail.uni-paderborn.de<mailto:htrautm@mail.uni-paderborn.de>), GECCO 2025 Late-Breaking Abstracts Chair

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

Call for Competition Entries

GECCO 2025 will host a number of competitions ranging from different types of optimization problems to games and industrial problems, see the list at: https://gecco-2025.sigevo.org/Competitions

To accompany your competition entry, you may additionally submit an abstract for review (if your competition offers it). The accepted abstracts will be published in the GECCO Companion Proceedings. The authors will also be invited to present their work in poster session.

To competition organizers: should you wish to, you can submit the description of your competition as a 2-page abstract. The formatting and registration requirements are the same as for the other competition papers.

The submission deadline is 12 April 2025. Looking forward to receiving your submissions.
Yuri Lavinas (yuri.lavinas@ut-capitole.fr<mailto:yuri.lavinas@ut-capitole.fr>), Hemant Singh (h.singh@adfa.edu.au<mailto:h.singh@adfa.edu.au>),
GECCO 2025 Competition Chairs

+++++++++++++++++++
Richard Allmendinger
GECCO 2025 Publication Chair

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

[DMANET] Deadline 4 April 2025 - ROAR-NET Training School on Computational Modelling of Combinatorial Optimisation Problems

The First ROAR-NET Training School on Computational Modelling of
Combinatorial Optimisation Problems, will take place at the Luxembourg
Institute of Science and Technology (LIST) in Belvaux, Luxembourg,
from 16 to 20 June 2025.

Trainee application deadline: 4 April 2025

More details: https://roar-net.eu/events/first-training-school/

# About the Training School

The First ROAR-NET Training School will consist of a combination of
lectures, problem-solving group projects, poster presentations by the
Trainees, and team-building activities. Topics include:

- Problem structuring
- Problem modelling for constructive search and for local search
- The ROAR-NET API specification
- Practical aspects of model development and implementation

Each project involves the development, implementation (coding), and
evaluation of a model for a given optimisation problem and will be
carried out by a team composed of 4-5 Trainees and a mentor (a
Trainer).

# Who Can Apply?

PhD students, postdocs, researchers, and innovators with good
programming and/or optimisation skills are invited to apply to attend
the school as Trainees. Financial support is available for eligible
applicants from COST Member and Near Neighbour Countries.

Trainee application deadline: 4 April 2025

For full details, see the Call for Trainee Applications:
https://roar-net.eu/calls/ts-call-1/

# About ROAR-NET

COST Action CA22137 - Randomised Optimisation Algorithms Research
Network (ROAR-NET) is an interdisciplinary research network supported
by COST. Involving researchers and innovators from academia, industry,
and other interested parties, the network aims to make Randomised
Optimisation Algorithms (ROAs) widely competitive in practice by
identifying and reducing obstacles to their adoption at the
scientific, technical, economic, and human levels. Focusing on
practitioners, whose needs are seen as the driving force for new
theoretical, methodological, and technical advances, ROAR-NET pursues
the sustainable development of widely available software tools,
training materials and programmes, and ultimately a more extensive
acceptance and deployment of these methods.

The network brings together a large number of ROA theoreticians and
algorithm developers, applied researchers, software developers, and
practitioners from more than 40 countries. This geographical diversity
helps to ensure that the frameworks, libraries, and software tools
developed through the network are applicable to a wide range of
real-world problems while supporting the latest theoretical
developments.

Learn more about ROAR-NET: https://www.roar-net.eu/

# About COST

COST (European Cooperation in Science and Technology) is a funding
agency for research and innovation networks. COST Actions help connect
research initiatives across Europe and enable scientists to grow their
ideas by sharing them with their peers. This boosts their research,
career, and innovation.

Learn more about COST: https://www.cost.eu/

We encourage all interested candidates to apply and look forward to
welcoming you to Luxembourg in June 2025.

Best regards,

Marco Chiarandini
on behalf of
Ekhiñe Irurozki, LTCI, Télécom Paris, Institut Polytechnique de Paris,
ROAR-NET Science Communication Coordinator,
and the Management Committee of ROAR-NET

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

[DMANET] Call for Papers – 4th IEEE International Conference on Technology, Engineering, Management for Societal Impact using Marketing, Entrepreneurship, and Talent (TEMSMET 2025)

Dear All,

We are pleased to invite you to the 4th IEEE International Conference on
Technology, Engineering, Management for Societal Impact using Marketing,
Entrepreneurship, and Talent (TEMSMET 2025), organized by the National
Institute of Technology Delhi in collaboration with IEEE TEMS. The
conference is scheduled for October 8-10, 2025, at the National Institute
of Technology Delhi, India.

Theme and Significance

The theme of TEMSMET 2025, "Innovation and Technology Management in the Era
of Gen AI," emphasizes the transformative potential of Generative
Artificial Intelligence (Gen AI) in reshaping industries, management
strategies, and sustainable development practices. The conference serves as
a global platform for researchers, academicians, and industry professionals
to exchange innovative ideas, groundbreaking research, and actionable
insights on harnessing the power of Gen AI.

Why Attend TEMSMET 2025?

TEMSMET 2025 offers a diverse array of opportunities for participants to:

-

Gain Expert Insights: Learn from keynote talks from globally renowned
AI, engineering, and management experts.
-

Explore Contemporary Issues: Participate in panel discussions on
critical topics such as AI ethics, sustainable development, and the future
of technology education.
-

Engage in Hands-on Learning: Attend workshops featuring practical
applications of AI tools and methodologies.
-

Showcase Your Research: Present your work to distinguished international
experts and audiences during technical sessions.
-

Build Valuable Connections: Network with leading academicians, industry
leaders, policymakers, and peers.

Conference Tracks

We welcome submissions of original research in the following areas:

1.

Innovations in Power Engineering
2.

Artificial Intelligence, Machine Learning, and Cybersecurity
3.

Smart Systems and Communications
4.

Engineering and Smart Management
5.

Advancements in VLSI, Embedded Systems, and Signal Processing
6.

Innovations and Entrepreneurship

Important Dates

Paper Submission Closes July 5, 2025

Notification of Acceptance August 8, 2025

Final Camera-Ready Submission August 21, 2025

Early Registration Closes August 23, 2025

Regular Registration Closes September 2, 2025

Conference Dates October 8-10, 2025

Submission Guidelines

Authors are invited to submit original, unpublished research papers in IEEE
double-column format. Submissions should not exceed six (6) pages,
including references, figures, and tables. Accepted papers will be
published in the IEEE Xplore Digital Library, ensuring global visibility.

For detailed guidelines and templates, please visit our official website:

temsmet2025.org

Join Us

TEMSMET 2025 is an unmissable event for anyone passionate about the future
of technology, engineering, and management. Whether you are a researcher,
an industry professional, or a student exploring new horizons, this
conference offers unparalleled knowledge exchange, collaboration, and
innovation opportunities.

We look forward to your valuable contributions and enthusiastic
participation. *Please circulate this invitation among your department/
Institute and professional & academic networks.* Please feel free to share
this email and the attached brochure with your peers and students to help
spread the word.

For any queries, contact us at: temsmet2025@nitdelhi.ac.in

Warm regards,

Anurag Singh

Sabrina Gaito

--
Anurag Singh,

**********************************************************
*
* 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 Discrete Optimization at University of Toronto

Applications are invited for a Post-Doctoral position at the University of Toronto, Canada. The broad area of research is Discrete Optimization. Possible focus areas include Approximation Algorithms, Scheduling, Network Optimization, Computational Discrete Optimization, Facility Location; however, strong applicants in all areas of Discrete Optimization and Graph/Networks Algorithms will be considered. The applicants should be within 5 years (or close to completion) of their Ph.D. in Computer Science, Mathematics / Applied Mathematics, Industrial Engineering, Operations Research / Management, or a related field.
The successful candidate will work under the supervision of professor Igor Averbakh in the Department of Management, University of Toronto Scarborough. The position carries a salary of $4,200 Canadian dollars per month. The start date is negotiable.
The initial contract will be for 8-12 months, with a possibility of extensions for up to 2 years based on mutual interest and availability of funds. To apply, send a C.V. and a sample of recent research (papers, preprints, etc.) electronically to professor Igor Averbakh at igor.averbakh@rotman.utoronto.ca<mailto:igor.averbakh@rotman.utoronto.ca>
Applications will be accepted until the position is filled.
Employment as a Postdoctoral Fellow at the University of Toronto is covered by the terms of the CUPE 3902 Unit 5 Collective Agreement.
This job is posted in accordance with the CUPE 3902 Unit 5 Collective Agreement.
The University of Toronto is strongly committed to diversity within its community and especially welcomes applications from racialized persons / persons of colour, women, Indigenous / Aboriginal People of North America, persons with disabilities, LGBTQ2S+ persons, and others who may contribute to the further diversification of ideas.

Igor Averbakh
Professor, Operations Management
Department of Management,
University of Toronto Scarborough and
Rotman School of Management (cross-appointed)

**********************************************************
*
* 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: 15th International Workshop on Pragmatics of SAT (PoS 2025)

------------------------------------------------------------------------------------
15th International Workshop on Pragmatics of SAT (PoS 2025)
-------------------------------------------------------------------------------------

The aim of the Pragmatics of SAT (PoS) workshop series is to provide a
venue for researchers working on designing and/or applying Boolean
satisfiability (SAT) solvers and related solver technologies, including but
not restricting to satisfiability modulo theories (SMT), answer set
programming (ASP), and constraint programming (CP) as well as their
optimization counterparts, to meet, communicate, and discuss latest results.

PoS 2025 (http://www.pragmaticsofsat.org/2025/) will be co-located with the
28th International Conference on Theory and Applications of Satisfiability
Testing (SAT 2025) and the 31st International Conference on Principles and
Practice of Constraint Programming (CP 2025).

Workshop Website: http://www.pragmaticsofsat.org/2025/
Workshop Location: Gilmorehill Campus, Glasgow, UK
Workshop Date: August 10, 2025

Topics of interest include, but are not limited to:

+ Efficient data structures
+ Techniques for debugging or certifying solvers
+ Visualization of benchmarks structure
+ Monitoring solver behavior
+ Evaluation of solvers
+ Domain specific encodings
+ Domain specific heuristics
+ Solver API
+ System and library description
+ New (successful) application of constraint-based technologies
+ New (potential) use cases of constraint-based technologies
+ Constraint solving and machine learning
+ Scaling using multi-core or distributed technology
+ Reflection on past and projection of future of applied SAT research
(position papers and talks are both welcome)

Submissions must be made electronically, through EasyChair (
https://easychair.org/conferences/?conf=pos25), as a PDF using the CEURART
one column style (https://ceur-ws.org/Vol-XXX/CEURART.zip).

Submission categories:
- Original Papers
- Work-in-Progress Papers
- Presentation-Only Papers
- SAT/CP Fast Track

Original papers are expected to describe original work, including papers
whose focus might be too narrow to be published in a conference. Both short
original papers (up to 8 pages, excl. references) and long original papers
(8-15 pages, excl. references), including system descriptions of SAT and
related solver technologies are welcome.

Work-in-Progress papers are expected to describe less mature work, to
gather feedback from the community. This may include papers submitted to
conferences or journals, which should be clearly stated in the paper.

Presentation-Only papers are expected to describe work that was recently
accepted or published at another conference or a journal but may have been
missed by the community (including, e.g., domain-specific applications of
declarative solvers at the respective domain-specific conferences).
Submissions to this category will be evaluated only on their relevance to
the workshop.

Additionally, as in 2024, we offer a Fast Track category for original
papers on topics related to PoS that did not make it to SAT 2025 and CP
2025. Such papers will have the opportunity to be submitted late, as
original papers. In this case, reviewing for PoS will also consider the
SAT/CP reviews.

Submissions will be reviewed by the program committee, which will select a
balanced program of high quality contributions. If a sufficient number of
original papers are accepted for the workshop (6+), post-proceedings in
CEUR-WS Proceedings will be published.

Important Dates:

Abstract submission deadline: May 5, 2025 (all submissions except SAT/CP
fast track)
Paper submission deadline: May 12, 2025
SAT/CP fast track submission deadline: June 1, 2025 (no separate abstract
registration is needed)
Notification to authors: June 20, 2025
Workshop: August 11, 2025

More information is available on the workshop's web page:
http://www.pragmaticsofsat.org/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/
*
**********************************************************