[DMANET] 1 PostDoc position in Algorithms at IDSIA, USI-SUPSI, Switzerland

The Algorithms and Complexity Group of IDSIA, USI-SUPSI, Lugano (Switzerland), opens one PostDoc position. This position is supported by the Swiss National Science Foundation project "Approximation Algorithms for Clustering and Network Design" (November 2025-October 2029) The main goal of this project is to design improved approximation algorithms for a wide family of applications, including clustering and network design. The PostDoc position is initially for 1 year, but an extension by 1 extra year is expected. The gross salary is around 80.000 CHF per year, with low taxes. There are no teaching duties and there is generous travel support. Candidates should hold (or be close to obtaining) a Ph.D. in Computer Science or related areas, and should have a solid publication record in the area of TCS. Top conferences in this area include STOC, FOCS, SODA, and ICALP. IDSIA offers an international working environment. Lugano is a tidy and lively town, with a wonderful view on Ceresio lake and mountains around. Ticino Canton offers many opportunities for hiking, biking, skiing, etc. Local restaurants serve very good (Italian style!) food. The interested candidates should email Prof. Fabrizio Grandoni, fabrizio.grandoni at gmail.com, a detailed CV and contact details of 2-3 references. For full consideration, applications should be sent within May 2026. For any question, do not hesitate to contact: Prof. Fabrizio Grandoni fabrizio.grandoni at gmail.com http://people.idsia.ch/~grandoni/ ********************************************************** * * 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 EITS 2026 - IEEE co-sponsored 2nd International Conference on Emerging and Intelligent Technologies and Systems, 9-12 June, 2026 | Valencia, Spain

[Apologies if you got multiple copies of this invitation] The 2nd International Conference on Emerging and Intelligent Technologies and Systems (EITS 2026) Hybrid Event https://eits-conference.org/2026/index.php 9-12 June, 2026 | Valencia, Spain Technically Co-Sponsored by IEEE Spain Section *EITS 2026 CFP:* Emerging and intelligent technologies and systems represent the forefront of innovation in computing, communication, and automation. They combine advances in artificial intelligence, machine learning, the Internet of Things (IoT), cloud and edge computing, 5G/6G networks, robotics, and data science to create adaptive, efficient, and human-centered solutions. These technologies are transforming industries such as healthcare, transportation, energy, and smart cities by enabling intelligent decision-making, real-time responsiveness, and sustainable development. As they continue to evolve, emerging and intelligent systems are shaping the foundation of next-generation digital societies, offering both opportunities and challenges in terms of security, ethics, and large-scale deployment. The International Conference on Emerging and Intelligent Technologies and Systems (EITS 2026) will bring together leading researchers, practitioners, and industry experts to present and discuss the latest advances, applications, and challenges in intelligent technologies and next-generation systems. EITS 2026 serves as a premier forum for innovation, cross-disciplinary collaboration, and knowledge exchange across academia and industry. We invite the submission of high-quality, original research papers describing innovative ideas, breakthrough results, and practical applications. with special interest in, but not limited to, the following: · Artificial Intelligence, Machine Learning and Generative AI · Intelligent Communication, Networking and Computing Systems · Generative AI, Foundation Models, and Large Language Models · Computer Vision, Image and Video Processing · Cybersecurity and Trustworthy Systems · Artificial Intelligence Systems Security · Computational Language and Human-Centered Systems · Emerging Applications, Ethics, Society, and Governance · Robotics, Intelligent Automation and Sustainable Systems *Submissions Guidelines and Proceedings* Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11" two-column format. All papers should be in PDF format, and submitted electronically at Paper Submission Link. A full paper can be up to 8 pages (including all figures, tables and references). Submitted papers must present original unpublished research that is not currently under review for any other conference or journal. Papers not following these guidelines may be rejected without review. Also submissions received after the due date, exceeding length limit, or not appropriately structured may also not be considered. Authors may contact the Program Chair for further information or clarification. All submissions are peer-reviewed by at least three reviewers. Accepted papers will appear in the EITS 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: April 30th, 2026 (Firm and Final)* - Notification of acceptance: May 10th, 2026 - Camera-ready Submission: May 25th, 2026 *Contact:* Please send any inquiry on EITS 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 Contributions - Workshop on Formal Methods in Quantum Computing

Call for Contributions Second Workshop on Formal Methods in Quantum Computing Lisbon, Portugal, July 18, 2026, co-located with FLoC 2026 Submission: Monday, May 11, AoE Notification: June Workshop: July 18 Website: https://fmqc-workshop.github.io/2026/call ============================================= About The recent surge in quantum computing, driven by substantial investments from governments and industry leaders such as IBM and Google, highlights its growing significance in both research and applications. Positioned at the intersection of quantum physics, applied mathematics, and theoretical computer science, the field presents vast opportunities for interdisciplinary collaboration and synergy. This workshop, approaching quantum computing from a computer science perspective, seeks to bridge the gap between diverse research communities and foster the transfer of technology and methodologies from computer science, promoting cross-disciplinary innovation and progress. ============================================= Call for Contributions Workshop contributions can be extended abstracts as well as short and long papers (including already published results). There are no formatting guidelines for contributions. Accepted contributions will be invited for presentation at the workshop. At the workshop, we will assess whether there is sufficient interest in a special issue. Topics of interest include but are not limited to: * ZX-Calculus * Quantum Process Algebra * Efficient Data Structures (e.g., Quantum Decision Diagrams and Tensor Networks) * SAT/SMT Solving in Quantum Computing * Programming Languages for Quantum Computing * Quantum Topology * Quantum Error Correction Codes (e.g., Topological Codes) * Post-Quantum Cryptography * Model Counting for Quantum Computing ============================================= Confirmed Invited Speakers Bob Coecke (keynote) Yu-Fang Chen Tim Coopmans Johannes Klaus Fichte Markus Hecher Kuldeep Meel Christopher Vasko ============================================= Organizers Max Bannach Alfons Laarman Jaco van de Pol Christian Schilling ********************************************************** * * 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] Workshop on Theory and Methods for Abstraction (THEMA 2026)

* Apologies if you receive multiple copies of this call * ================================================================== ============== THEMA 2026: 3rd Call for Papers ======================= Workshop on Theory and Methods for Abstraction (THEMA 2026) Location: Lisbon, Portugal Deadline for submission: April 27, 2026 Workshop: July 24, 2026 https://abstraction.cognitive-logics.org/thema2026/ Co-located with the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026) as part of the Federated Logic Conference (FLoC 2026). ================================================================== Aims and Scope ---------------------- Abstraction is a process that is exploited in human reasoning and understanding. Although the word itself comes from the meaning of "to draw away", there is no precise definition that is able to cover all the meanings that it gains depending on its utilisation. Various meanings of abstraction are interpreted in different disciplines such as Philosophy, Cognitive Science, Biomimetics, Mathematics and AI, with the shared consensus of the aim to distil the essential. From the early days of AI research, including in the work of Alan Turing, such abstraction learning has been seen as a crucial heuristic for problem-solving. First, the problem is solved in a relaxed or reduced space, and then the abstract solution is used to guide the search for a solution in the original space. Since the success in solving a problem relies on how "good" the abstraction is, theoretical approaches for defining abstractions with desired properties have been and continue to be investigated while adhering to certain principles of simplification and/or generalization. Abstraction is also being used as a representation technique. Having different layers of representation that enable reasoning at a high level and refining to more low-level details only when necessary, e.g., in Robotics, allows one to determine the focus points of the problem. While usually the representation decisions are left to the experts, there are also methods, e.g. in Model Checking, to automatically find abstractions that allow one to check desired properties of the system at the abstract level. More recently, abstraction is becoming an essential technique for AI systems to present a “model of self”, overviewing their complex structures via showing the key elements making it easier for humans to understand their decision-making. This workshop aims to bring together researchers from different sub-areas of KR and related communities who work on different aspects of abstraction in their respective areas, with the goal of exchanging theories and methods. The following lists topics (but is not limited to these): *Formation of concepts *Symbol learning *Inductive reasoning *Abstraction and analogical reasoning *Abstraction and generalization as operations *The role of abstraction in knowledge *Formal logical and philosophical foundations of abstraction *Abstraction in ontological and conceptual modelling *Systems which employ different levels of granularity *Forgetting and marginalization *Human-inspired theories of perception *Application of abstraction in, e.g., verification and software engineering Invited Speaker -------------------------------------------------- Blai Bonet, Universitat Pompeu Fabra, Spain Elena Romanenko, University of Bozen-Bolzano, Italy Workshop Organizers and Co-Chairs -------------------------------------------------- Oliver Kutz, University of Bozen-Bolzano, Italy Zeynep G. Saribatur, TU Wien, Austria Kai Sauerwald, University of Hagen, Germany Important Dates ---------------------- Paper submission: April 27, 2026 Notification: May 28, 2026 Workshop: July 24, 2026 Submission and Publication Details ----------------------------------------------- We invite short (6 pages) and long papers (13 pages) of unpublished work, or extended abstracts (2 pages) of already published works or works in progress. Reviewing will be single-blind, but anonymous submissions are possible. * All submissions should be formatted in CEUR style (one-column style) without an enabled header and footer. The author kit can be found at http://ceur-ws.org/Vol-XXX/CEURART.zip. Papers must be submitted in PDF only and should include a statement regarding the usage of AI (see CEUR AI policy). For the camera-ready versions, one must also provide the LaTeX sources. *Link to the submission site is on the webpage: https://abstraction.cognitive-logics.org/thema2026/call.html Authors of all accepted original contributions can opt to publish their work in CEUR proceedings. Accepted non-original contributions will be given visibility on the workshop website, including a link to the original publication, if already published. Following the workshop, there will be an open call for inclusion in a special issue of the German Journal of Artificial Intelligence (KI). ********************************************************** * * 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: 33rd International Symposium on String Processing and Information Retrieval, Oct 13-16, Hamilton, Canada

** 33rd International Symposium on String Processing and Information Retrieval** **October 13-16, Hamilton, Canada** **Second call for papers** The International Symposium on String Processing and Information Retrieval (SPIRE 2026) will be held at McMaster University, in Hamilton, Canada. Website: https://sites.google.com/view/spire-2026/ # SCOPE SPIRE 2026 covers research in all aspects of string processing, information retrieval, computational biology, and related applications. Typical topics of interest include (but are not limited to): - String Processing: String pattern matching, text indexing, data structures for string processing, text compression, compressed data structures, compressed string processing, text mining, 2D pattern matching, automata-based string processing, combinatorics on words. - Computational Biology: Algorithms for DNA sequencing, assembly, alignments, read error correction, metagenomics, transcriptomics, gene and regulatory element recognition, motif finding, pangenomics, variants discovery, phylogenetics, genome rearrangements. - Information Retrieval: Retrieval models and ranking, theoretical models and foundations of IR, efficiency and scalability topics in IR, knowledge acquisition in IR, machine learning and natural language processing for IR, knowledge representation and reasoning for IR, user-centric aspects of IR, IR evaluation, fairness, accountability, transparency in IR, domain-specific IR applications, web search. # SUBMISSIONS SPIRE 2026 invites submissions in two categories: - Long papers: Up to 12 pages, excluding references and optional appendices. - Short papers: Up to 6 pages, excluding references and optional appendices. Papers should be submitted electronically via EasyChair via the following link: https://easychair.org/conferences/?conf=spire2026 As in past editions, the proceedings of SPIRE 2026 will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. The use of LNCS templates is mandatory. Suitable templates are available at the Springer Website and on Overleaf. Use the LNCS style file as given: do not change the margin size or the font; do not make a separate title page, etc. Simultaneous submissions to other conferences with published proceedings is not permitted. At least one author per accepted paper is expected to register for the conference and present the paper. The conference will be in-person, with online presentations only in exceptional cases (e.g., authors with travel difficulties). # AWARDS The SPIRE 2026 Conference will present both a Best Paper Award and a Best Student Paper Award, each sponsored by Springer Nature for 500 euros, to recognize outstanding research contributions. # INVITED SPEAKERS Meng He, Dalhousie University, Canada Lila Kari, University of Waterloo, Canada Tomasz Kociumaka, Max Planck Institute for Informatics, Germany # IMPORTANT DATES Submission deadlines: - Abstract Deadline: June 18, 2026 AoE - Full paper deadline: June 25, 2026 AoE (firm deadline) Notifications: August 6, 2026 Camera-ready version: August 20, 2026 Events: - SPIRE: October 13 to 15, 2026 - Workshop on Compression, Text, and Algorithms (WCTA): October 16, 2026 # GENERAL CHAIRS Neerja Mhaskar, McMaster University, Canada Ricardo Baeza-Yates, KTH Royal Institute of Technology, Sweden & University of Chile # PROGRAM COMMITTEE CHAIRS Neerja Mhaskar, McMaster University, Canada Solon P. Pissis, The Cyprus Institute, Cyprus # PROGRAM COMMITTEE Hideo Bannai, Institute of Science Tokyo, Japan Giulia Bernardini, University of Milano, Italy Philip Bille, Technical University of Denmark, Denmark Itai Boneh, University of Wrocław, Poland Christina Boucher, University of Florida, USA Panagiotis Charalampopoulos, King's College London, UK Manuel Cáceres, Aalto University, Finland Jonas Ellert, ENS Paris, France Gabriele Fici, University of Palermo, Italy Johannes Fischer, TU Dortmund, Germany Esteban Gabory, University of Wrocław, Poland Paweł Gawrychowski, University of Wroclaw, Poland Daniel Gibney, University of Texas at Dallas, USA Shay Golan, Ariel University, Israel Stepan Holub, Charles University, Czech Republic Dominik Kempa, Stony Brook University, USA Dmitry Kosolobov, Ural Federal University, Russia Dominik Köppl, University of Yamanashi, Japan Felipe A. Louza, Universidade Federal de Uberlândia, Brazil Takuya Mieno, The University of Electro-Communications, Japan Manal Mohamed, King's College London, UK Gonzalo Navarro, University of Chile, Chile Giulio Ermanno Pibiri, Università Ca' Foscari Venezia, Italy Simon J. Puglisi, University of Helsinki, Finland Giulia Punzi, University of Pisa, Italy Jakub Radoszewski, University of Warsaw, Poland Sharma Thankachan, North Carolina State University, USA Wiktor Zuba, University of Warsaw, Poland ********************************************************** * * 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 4th CINI HPC Summer School 2026

** Call for Attendees ** We are pleased to announce the 4th CINI HPC Summer School 2026, which will take place from 15–19 June 2026 at the University of Salento, Lecce, Italy. Organized by the CINI HPC National Laboratory jointly with the HPC Laboratory at the University of Salento, the Summer School will address the design of scalable parallel algorithms and the use of standard “de facto” programming models and tools crucial for enhancing HPC application performance, including practical hands-on sessions focusing on MPI, OpenMP, GPU programming, and performance monitoring. The curriculum aims to boost participants’ capabilities in utilizing HPC for complex scientific and industrial tasks, bringing together theoretical and technical viewpoints. Over the course of five days, participants will gain insights into the design and analysis of parallel algorithms and related, current technologies. Dr. Alberto Baiardi, Staff Research Scientist at IBM Zurich, will open the Summer School with a keynote address titled "Quantum Computing for Natural Science Simulations". We are seeking highly motivated students, for a learning experience focused on leading-edge subjects. You will be taught by University of Salento faculty members jointly with CINECA leading experts, and attend classes with top students that share your interests. The Summer School represents a unique opportunity to participate in an exciting laboratory of teaching and active learning. Target audience The target audience includes Master’s graduates, Ph.D students, early-stage Postdoc, and engineers. The school welcomes everyone regardless of gender, age, sexual orientation, disability, physical appearance, race, or religion. Applicants will be evaluated on their CV. Requirements Applicants are expected to: - Posses working knowledge of C/C++, Unix (Linux etc), terminal, editor and compilers; - Bring their laptop to write, compile and execute parallel code. School Fees - Ph.D. students, post-docs and Master’s graduates: 350 euro - Faculties/Researchers: 400 euro - Professionals: 500 euro The fee provides access to all of the lectures, teaching materials and social event/dinner. PLEASE NOTE: The electronic payment also includes, additionally, 2 euro, which represent the payment of stamp duty, a mandatory tax obligation under Italian law. Deadlines Applications (available shortly): until April 18, 2026 Notification of acceptance: April 27, 2026 Fee payment for enrolment: no late than May 4, 2026 Summer School: June 15-19, 2026 Submitting your application is a two-step process. Both steps are MANDATORY. 1) for the initial online registration, please use this link: https://conference.unisalento.it/event/19/ You are required to register, but please don’t pay in advance the registration fee. The Summer School Committee will evaluate the requests, and admit the applicants. Only admitted applicants - up to 50 - must, upon receiving confirmation of admission, proceed with the fee payment. 2) The application form and the required documentation must be sent to the Summer School Committee using the documents available at this link: https://trasparenza.unisalento.it/page/5/details/18396/dii-avviso-di-apertura-delle-candidature-hpc-summer-school-aa-20252026.html NOTE: the website provides the call and application form both in English (Avviso_EN_signed.pdf and Form_EN.docx) and Italian (Avviso Summer School_signed.pdf and Fac simile.docx). Further information about the CINI HPC Summer School can be found at: https://hpcsummerschool.massimocafaro.it - ********************************************************************************************* Prof. Massimo Cafaro, Ph.D. Associate Professor of Parallel Algorithms and Data Mining/Machine Learning Head of the HPC (High Performance Computing) Lab Head of the AIMA Lab (Artificial Intelligence Models and Algorithms) Department of Engineering for Innovation University of Salento, Lecce, Italy Via per Monteroni 73100 Lecce, Italy Voice/Fax +39 0832 297371 Web https://www.massimocafaro.it Web https://www.unisalento.it/people/massimo.cafaro E-mail massimo.cafaro@unisalento.it E-mail cafaro@ieee.org E-mail cafaro@acm.org INGV National Institute of Geophysics and Volcanology Via di Vigna Murata 605 Roma CMCC Foundation Euro-Mediterranean Center on Climate Change Via Augusto Imperatore, 16 - 73100 Lecce massimo.cafaro@cmcc.it Weiler’s Law: Nothing is impossible for the man who doesn’t have to do it himself. ********************************************************************************************** -- ********************************************************** * * 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 thesis on temporal graphs (additional information)

Hello the LITIS Laboratory in Le Havre, Normandy, France, proposes a funded PhD thesis on exploring temporal graphs, with a co-supervision with Patras university (Greece).  More details below. Please broadcast this information to any interested student. Best regards Eric *Project title: Exploration of temporal graphs. Application to logistics networks.* Host institution: ULHN University of Le Havre Normandy, France Laboratory : LITIS UR 4108 Starting date: september or october 2026 A temporal graph [1] is a graph with n vertices whose set of edges evolves over time. This evolution may be entirely known, or not. In the latter case, we refer to it as a dynamic graph. If this evolution can be represented using a probabilistic model, it is similar to random graphs (an edge is present with a certain probability). If we do not have such a model, we refer to it as an online problem. A temporal or dynamic graph can be represented as a sequence of static graphs with the same vertices; these graphs are called snapshots. Finally, the static graph containing all the edges present during the lifetime of the graph is called the underlying graph. When modeling transportation networks, an edge is often associated with a travel time or transportation time. For example, an edge representing a shipping line will be associated with a duration measured in days at sea. The same applies to road transport, information transport, etc. It should be noted here that the most fundamental works on temporal graphs generally assume a unit travel time. Sometimes, on the contrary, travel time is neglected in relation to the dynamics of network evolution (transport, generally of information or energy, is much faster than the speed of network evolution). These different assumptions have consequences for the generalization of path in a temporal setting.Such a pathis referred to as a journey(or temporal path). It is a sequence of edges associated with increasing start dates for the crossing, which must comply with the presence of the edges and their travel times. If there are journeysbetween any pair of vertices during the lifetime of the graph, we say that it is temporally connected. If each snapshot is connected, we say that the graph is constantlyoralways-connected. Using these two concepts, one can defineconnected components, either temporal or instantaneous. We have studied these two types of components (and their many variants). Interestingly, determining temporally connected components is very often NP-hard even for unit traversal times [2], while determining instantaneously connected components is polynomial [3]. A related problem is that of exploring a temporal or dynamic graph. An exploration is a temporal path which visits each vertex of the graph at least once. For a fixed lifetime, the graph may be temporally connected without being explorable. The literature on this subject is fairly recent but is growing rapidly. The graphs generally studied in the literature are constantly connected, with unit traversal times. There are two fairly natural questions. The first is the existence of such a path for a given lifetime, and conversely, the minimum lifetime (number of time steps) required to find such a path. The second is what is the minimum number of edges that must be traversed by such a path. There are many results on the first question, see for example [4], but much less on the second, which is the subject of Antoine Toullalan's thesis, scheduled to be defended in 2026 [5]. We know that for any underlying graph, O(n²) time steps are sufficient (and sometimes necessary) to explore a temporal graph. The main result of Antoine Toullalan's thesis is that O(n^1.5 ) edge traversals are sufficient. However, we do not have any example with more than a linear number of edge traversals, whereas for several classes of graphs this number is linear in n. Our conjecture is that 2n-3 edge traversals are always sufficient, given O(n²) time steps. Our objectives are to continue the work of A. Toullalan's thesis in three directions, in order to obtain results on models that are closer to the reality of actual logistics networks. 1) Still in the case of a single time unit for traversing edges and known evolution, study this conjecture by considering new classes of graphs. 2) Consider dynamic graphs, based on random graph models [6,7,8]. There are still few studies, and all focus on the existence of explorations depending on the lifetime of the graph, as in [4]. We wish to study the problem of the minimum number of edges to cross in this context. 3) Variable traversal times. There is still nothing in the literature on exploration in this context. It is certainly possible to use the well-known model of expended graphs, but this will lead to highly complex algorithms. Are other approaches possible? 4) It is of course possible to combine random graphs and arbitrary traversal times, and we would like to obtain results in this general framework. *Bibliograph**y * [1] Holme, P. (2015). Modern temporal network theory: a colloquium./The European Physical Journal B/88 (9), 234. [2] *Balev, S.*, *Sanlaville, E.*, & Schoeters, J. (2024). Temporally connected components. /Theoretical Computer Science/, /1013/, 114757. *[3] **_M. _**_Vernet,_****_Y. Pigné_**, ***E. Sanlaville***(2022) A study of connectivity on dynamic graphs: computing persistent connected components. 4OR-Q J Oper Res. * [4] Erlebach, T., Hoffmann, M., and Kammer, F. "On temporal graph exploration." /Journal of Computer and System Sciences/119 (2021): 1-18. [5] *Balev, S.*, *Sanlaville, É.*, & _Toullalan, A._(2025). Brief Announcement: The Shortest Temporal Exploration Problem. In /4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025)/(pp. 18-1). Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [6] Casteigts, A., Raskin, M., Renken, M., & Zamaraev, V. (2024). Sharp thresholds in random simple temporal graphs. /SIAM Journal on Computing/, /53/(2), 346-388. [7] *Nikoletseas, S.*, *Raptopoulos, C.*, & Spirakis, P. (2023). Max cut in weighted random intersection graphs and discrepancy of sparse random set systems. /Algorithmica/, /85/(9), 2817-2842. [8] Mertzios, G. B., *Nikoletseas, S.*, *Raptopoulos, C.*, & Spirakis, P. G. (2024). Brief Announcement: On the existence of δ-temporal cliques in random simple temporal graphs. SAND2024. /Leibniz International Proceedings in Informatics, LIPIcs/, /292/. [9] Akrida, E C, Mertzios, G B, Spirakis, P G,and *Raptopoulos, C. *"The temporal explorer who returns to the base." /Journal of Computer and System Sciences/120 (2021): 179-193. [10] Baguley, S., Göbel, A., Klodt, N., Skretas, G., Sylvester, J., Zamaraev,V.,Temporal Exploration of Random Spanning Tree Models.Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).[11] Projet ANR TEMPOGRAL (Problèmes algorithmiques sur les graphes temporels), *Eric Sanlaville*porteur. labri.fr/perso/acasteig/tempogral/ Thesis supervision The PhD student will be registered at Le Havre University. However, the recruited person will be co-supervised by Eric Sanlaville and Stefan Balev from Le Havre, and Sotiris Nikoletseas and Christoforos Raptopoulos from Patras University (Greece). He/she will do several sojourns to Patras. Candidate profile : The candidates must have a master degree or equivalent in computer science or applied mathematics, with a strong background in algorithmics and graph theory. English langage proficiency is needed, French and Greek would be appreciated but are not mandatory. To candidate, please provide a CV, short motivation letter and master marks to  the supervisors: eric.sanlaville@univ-lehavre.fr, stefan.balev@univ-lehavre.fr, nikole@cti.gr, raptopox@upatras.gr (The complete application is due by April 29) -- Eric Sanlaville co-directeur LITIS Professeur d'Informatique Université Le Havre Normandie ********************************************************** * * 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] Postdoctoral Fellowships at Erdős Center in 2027

The Erdős Center of the Alfréd Rényi Institute of Mathematics in Budapest, Hungary, invites applications for postdoctoral positions in conjunction with the upcoming Simons Semester in Ordered Combinatorics, taking place from January to June, 2027, see https://erdoscenter.renyi.hu/articles/simons-semester-ordered-combinatorics-2027-spring Applicants must already be in possession of a PhD degree or obtain their PhD by January 1, 2027. The positions come with no teaching duties. Candidates are not required to speak Hungarian. The gross salary will be 1.050.000 HUF per month. The postdoctoral positions are for a duration of 6 to 12 months. Tentative start date January 1, 2027. Deadline for application: July 15, 2026 Send applications by email to ordered.combinatorics@renyi.hu, with the subject: postdoctoral fellowship The application should include: * a CV; * a list of publications; * a statement of purpose, consisting of 1-2 pages on past research, 1-2 pages on future research, and at least a paragraph explaining the relevance of the research semester to the candidate’s research; * the intended starting day and length of stay in months * The applicant should arrange for two letters of recommendation to be sent directly to (with the name of the applicant in the subject line) ordered.combinatorics@renyi.hu. Qualified female candidates and candidates from underrepresented groups are particularly encouraged to apply. Inquiries should be addressed to ordered.combinatorics@renyi.hu. ********************************************************** * * 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 2026: The 8th International Conference on Blockchain Computing and Applications, Barcelona, Spain

*The 8th International Conference on Blockchain Computing and Applications (BCCA 2026)* 16-20 November 2026 | Barcelona, Spain *Hybrid Conference* *Technically sponsored by IEEE Spain section* *https://bcca-conference.org/* 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 across several areas, including the Internet of Things, supply chain management, manufacturing, cyber-physical systems, and healthcare systems. Unlike centralized transaction processing solutions, blockchain uses a distributed ledger to record transactions across multiple devices; this prevents data breaches, identity theft, and a range of cyber-related attacks, thereby enhancing data privacy and security. This conference aims to attract the work of both researchers and practitioners in cybersecurity to share and exchange experiences and research in both academia and industry in the field of blockchain. *BCCA 2026 SYMPOSIA* Authors are encouraged to submit their work to one of the following 20 specialized symposiums, each targeting a key research frontier: 1. Blockchain for LLMs and Decentralized AI 2. Blockchain for Agentic and Autonomous AI 3. Blockchain-Enabled Generative and Multimodal AI 4. AI and Machine Learning for Blockchain Optimization 5. Blockchain Security and Zero-Trust Web3 6. Blockchain-Enhanced Cybersecurity and Privacy 7. Post-Quantum Blockchain and Cryptography 8. Blockchain for Trustworthy and Ethical AI 9. Blockchain for Digital Identity and Governance 10. Blockchain Interoperability and Web3 Infrastructure 11. Blockchain for IoT and Cyber-Physical Systems 12. Blockchain for Digital Twins and the Metaverse 13. Blockchain for Autonomous Transportation and Smart Mobility 14. Blockchain for Big Data and Decision Intelligence 15. Blockchain Applications in Finance, Healthcare, and Government 16. Token Engineering and Decentralized Governance (DAOs) 17. Quantum Computing for AI and Blockchain 18. Green Computing and Sustainable Blockchain 19. Blockchain for Robotics and Autonomous Systems 20. Neuromorphic and Bio-Inspired Computing with Blockchain *Publication* *IEEE is a technical sponsor of BCCA 2026*. All accepted papers in BCCA 2026 and the workshops co-located with it will be submitted to IEEEXplore, dblp and Scopus for inclusion. *Important Dates:* - Papers due: April 15, May 15, 2026 (Extended) - Acceptance notification: June 30, 2026 - Registration: July 30, 2026 - Camera-ready paper: July 30, 2026 - Workshop/Tutorial Proposal Submission: April 15, 2026 - Workshop/Tutorial Proposal Acceptance: June 30, 2026 *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) - *Systemization of Knowledge (SoK): *(10-15 pages) - *Poster papers: *(1-2 pages) *Submission Link: *https://conferences.sparcly.ai/SP/BCCA2026 *Organizing Committee* *Honorary Chair* - Jaime Lloret Mauri, Universidad Politécnica de Valencia, Spain - Jose Luis Muñoz-Tapia, Universitat Politècnica de Catalunya, Spain *General Co-Chairs* - Christiancarmine Esposito, University of Salerno, Italy - Attila Kertesz, University of Szeged, Hungary - Vlado Stankovski, University of Ljubljana, Slovenia *Program Co-Chairs* - Sandra Sendra, Universitat Politècnica de València, Spain - Ismaeel Al Ridhawi, KCST, Kuwait --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] [Cryptography] (IF 2.1, CiteScore 5.0) Selected Papers in Volume 8, Issue 1

We are sharing with you some selected papers published in the open access journal /Cryptography/ (https://www.mdpi.com/journal/cryptography) Volume 8, Issue 1, which are free to access and can be downloaded here: 1. Novel and Efficient Privacy-Preserving Continuous Authentication https://www.mdpi.com/2410-387X/8/1/3 2. Pervasive User Data Collection from Cyberspace: Privacy Concerns and Countermeasures https://www.mdpi.com/2410-387X/8/1/5 3. Privacy-Preserving Multi-Party Cross-Chain Transaction Protocols https://www.mdpi.com/2410-387X/8/1/6 4. Lookup Table-Based Design of Scalar Multiplication for Elliptic Curve Cryptography https://www.mdpi.com/2410-387X/8/1/11 5. E-Coin-Based Priced Oblivious Transfer with a Fast Item Retrieval https://www.mdpi.com/2410-387X/8/1/10 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 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] =?Windows-1252?Q?[CFP]_Extended_SecRIoT-SCC_2026_Deadline:_April_23, _2026?= – 7th IEEE International Workshop on SecRIoT-SCC 2026 co-located with DCOSS-IoT 2026 | Reykjavik, Iceland

======================================== We apologize if you receive multiple copies of this CFPs. We appreciate your help to contribute & forward this CFPs to your friends. ======================================== You are cordially invited to submit your latest research results to the SecRIoT-SCC 2026. Call for Papers 7th IEEE International Workshop on Security, Reliability of IoT Systems & Supply Chain Cybersecurity (SecRIoT-SCC 2026) co-located with DCOSS-IoT 2026 Reykjavik, Iceland, June 22-24, 2026 Workshop Website: https://sites.google.com/view/secriot2026 Conference Website: https://dcoss.org/ As the Internet of Things continues to expand rapidly, security, reliability, and supply chain trustworthiness have become critical concerns for modern interconnected systems. SecRIoT-SCC 2026 aims to bring together researchers and practitioners from academia, industry, and government to discuss recent advances, emerging challenges, and innovative solutions in IoT security and supply chain cybersecurity. Topics of interest include, but are not limited to: * Security, privacy, trust, and reliability in IoT systems * Intrusion detection, malware analysis, and cyber-physical security * Secure embedded systems, operating systems, and communication protocols * Autonomous vehicles, medical devices, and other emerging IoT applications * Supply chain cybersecurity, secure manufacturing, and third-party risk * AI, machine learning, blockchain, and zero-trust approaches for security * Risk assessment, incident response, and regulatory compliance ======================================== Important Dates Submission Deadline: April 8, 2026 April 23, 2026 (Extended) Acceptance Notification: April 30, 2026 Camera Ready Deadline: May 22, 2026 ======================================== Submission link: https://easychair.org/conferences?conf=secriot2026 ======================================== Workshop Chairs * Athanasios Kakarountas (University of Thessaly, Greece) * Leandros Maglaras (De Montfort University, UK & Edinburgh Napier University, Scotland) * Naghmeh Moradpoor (Edinburgh Napier University, Scotland) * Vasileios Vlachos (University of Thessaly, Greece) * Thomas Edward Welsh (University of Iceland, Iceland) ======================================== Regards, Yagmur Yigit, PhD Student, Edinburgh Napier University This message and its attachment(s) are intended for the addressee(s) only and should not be read, copied, disclosed, forwarded or relied upon by any person other than the intended addressee(s) without the permission of the sender. If you are not the intended addressee you must not take any action based on this message and its attachment(s) nor must you copy or show them to anyone. Please respond to the sender and ensure that this message and its attachment(s) are deleted. It is your responsibility to ensure that this message and its attachment(s) are scanned for viruses or other defects. Edinburgh Napier University does not accept liability for any loss or damage which may result from this message or its attachment(s), or for errors or omissions arising after it was sent. Email is not a secure medium. Emails entering Edinburgh Napier University's system are subject to routine monitoring and filtering by Edinburgh Napier University. Edinburgh Napier University is a registered Scottish charity. Registration number SC018373 BSL users can contact us via contactSCOTLAND-BSL, the on-line British Sign Language interpreting service. Find out more on the contactSCOTLAND website. ********************************************************** * * 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] 17th International Workshop on Pragmatics of SAT (PoS 2026)

------------------------------------------------------------------------------------ 17th International Workshop on Pragmatics of SAT (PoS 2026) ------------------------------------------------------------------------------------ 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 restricted 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 2026 will be co-located with the 29th International Conference on Theory and Applications of Satisfiability Testing (SAT 2026) and the Federated Logic Conference (FLoC 2026) in Lisbon, Portugal. Workshop Website: https://www.pragmaticsofsat.org/2026/ Paper submission deadline: May 7, 2026 Notification to authors: June 1, 2026 Workshop Date: July 19, 2026 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 and 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 Submissions must be made electronically, through HotCRP (https://submissions.floc26.org/pos), as a PDF using the CEURART one column style (https://ceur-ws.org/Vol-XXX/CEURART.zip). Submission categories include original papers (including papers submitted to a main FLoC conference such as SAT that did not make it), work-in-progress papers (less mature works for which gathering feedback from the community is desired), and presentation-only submissions (covering recently accepted or published relevant works). 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, we plan to publish the proceedings of the workshop via CEUR-WS proceedings, possibly by joining forces with another, related FLoC workshop. More information is available on the workshop's web page: https://www.pragmaticsofsat.org/2026/ Bart Bogaerts and Dominik Schreiber (PoS 2026 PC Chairs) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Postdoc position in Theoretical CS

Kindly advertise the job below. The Lane Department of Computer Science and Electrical Engineering at West Virginia University invites applications for a Postdoctoral Fellow in the general areas of theoretical computer science and algorithmic operations research, with an emphasis on computational complexity and game theory. A PhD in computer science and expertise in the areas of computational logic and game theory are required. The position is funded by NSF (Algorithmic Foundations) and is concerned with the designing efficient algorithms and establishing the computational complexity of selected problems in mathematical programming and combinatorial optimization. Responsibilities will include but are not limited to the following: conducting research on quantified polyhedral programming and quantified circuits, attending research conferences, reading scientific literature to keep abreast of technological advances and current research findings and teaching one course in theoretical computer science. The position is funded for two years, starting August 15, 2026. Applicants must submit a cover letter, curriculum vitae, and contact information for two professional references at this link: https://wvu.taleo.net/careersection/faculty/jobdetail.ftl?job=29316&tz=GMT-04%3A00&tzname=America%2FNew_York Contact K. Subramani (k.subramani@mail.wvu.edu) if you have questions. K. Subramani Professor LDCSEE West Virginia University ********************************************************** * * 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/ * ********************************************************** ********************************************************** * * 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] London Colloquia in Combinatorics 2026

The London Colloquia in Combinatorics will take place on 13 May 2026 at Queen Mary University London and 14 May 2026 at the London School of Economics and Political Science. More information about the event can be found here: https://2dcic.github.io/ As part of the colloquia, we will host a poster session on 14 May allowing PhD students in Discrete Mathematics and related areas to present their work. A best poster prize will be awarded during the evening reception that day. PhD students who wish to present a poster should apply by sending an email to Peter Allen (p.d.allen@lse.ac.uk) by Friday ​**1st May 2026**, with a title and abstract for their poster. Notifications for selected posters will be sent out by Monday 4th May 2026. Posters should be A1 in size and in portrait format. They should be brought in at the start of the LSE day of the Colloquia (14th May 2026). We will pay the reasonable costs of printing posters, and can print them locally if desired. PhD students are strongly encouraged to present a poster if they are planning to apply for travel funding to attend the colloquia, as funding priority will be given to PhD students who present posters. ********************************************************** * * 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] XVIII Madrid UPM Machine Learning and Advanced Statistics Summer School (June 8th - June 19th, 2026)

Dear colleagues, The Technical University of Madrid (UPM) will once more organize the 'Madrid UPM Machine Learning and Advanced Statistics' summer school. The summer school will be held in Boadilla del Monte, near Madrid, from June 8th to June 19th. This year's edition comprises 12 week-long courses (15 lecture hours each), given during two weeks (six courses each week). Attendees may register in each course independently. No restrictions, besides those imposed by timetables, apply on the number or choice of courses. Early registration is now *OPEN*. Extended information on course programmes, price, venue, accommodation and transport is available at the school's website: https://www.dia.fi.upm.es/MLAS There is a 25% discount for members of Spanish AEPIA and SEIO societies. Please, forward this information to your colleagues, students, and whomever you think may find it interesting. Best regards, Pedro Larrañaga, Concha Bielza, Bojan Mihaljević and Laura Gonzalez Veiga. -- School coordinators. *** List of courses and brief description *** # Week 1 (June 8th - June 3rd, 2026) ## 1st session: 9:45-12:45 ### Course 1: Bayesian Networks (15 h) Basics of Bayesian networks. Inference in Bayesian networks. Learning Bayesian networks from data. Real applications. Practical demonstration: R. ### Course 2: Metaheuristics for Optimization (15 h) Single-solution Metaheurístics. Evolutionary Algorithms. Algorithms based on estimation of distributions. Other Population based Algorithms. Multi-Objective Optimization Using Evolutionary Algorithms. ## 2nd session: 13:45-16:45 ### Course 3: Supervised Classification (15 h) Introduction. Assessing the performance of supervised classification algorithms. Preprocessing. Classification techniques. Combining multiple classifiers. Comparing supervised classification algorithms. Practical demonstration: python. ### Course 4: Reinforcement learning (15 h) Introduction. Dynamic programming methods. Temporal-difference learning. Policy gradient methods. Causal reinforcement learning. Practical demonstration: R. ## 3rd session: 17:00 - 20:00 ### Course 5: Deep Learning (15 h) Introduction. Learning algorithms. Learning in deep networks. Deep Learning for Computer Vision. Deep Learning for Language. Practical session: Python notebooks with Google Colab with keras, Pytorch and Hugging Face Transformers. ### Course 6: Bayesian Inference (15 h) Introduction: Bayesian basics. Conjugate models. MCMC and other simulation methods. Regression and Hierarchical models. Model selection. Practical demonstration: R and WinBugs. # Week 2 (June 10th - June 19th, 2026) ## 1st session: 9:45-12:45 ### Course 7: Causality (15 h) Introduction. Causal graphs. Mediation analysis. Sensitivity analysis to unmeasured confounding. Counterfactual reasoning. Practical sessions: R. ### Course 8: Clustering (15 h) Introduction to clustering. Data exploration and preparation. Prototype-based clustering. Density-based clustering. Graph-based clustering. Cluster evaluation. Miscellanea. Conclusions and final advice. Practical session: R. ## 2nd session: 13:45-16:45 ### Course 9: Gaussian Processes, Bayesian Deep Learning and Bayesian Optimization (15 h) Introduction to Gaussian processes. Sparse Gaussian processes. Deep Gaussian processes. Bayesian deep learning. Introduction to Bayesian optimization. Practical demonstration: python using GPytorch, Pytorch and BOTorch. ### Course 10: Explainable Machine Learning (15 h) Introduction. Inherently interpretable models. Post-hoc interpretation of black box models. Basics of causal inference. Beyond tabular and i.i.d. data. Other topics. Practical demonstration: Python with Google Colab. ## 3rd session: 17:00-20:00 ### Course 11: Generative AI (15 h) Introduction to the course. Neural networks and deep learning. Generative AI for images. Generative AI for language. Hands-on session: Pytorch, VAEs, GANs, diffusion models, LLMs, aligning a generative LLM, using an open-source image generation model. ### Course 12: AI for the Health Domain (15 h) Introduction to AI in healthcare. AI to conversational agents and drug repurposing. From manifolds to foundation models. AI for real-world clinical data. ********************************************************** * * 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] Research Associate Position (Postdoc) at TU Dortmund

Dear colleagues, at the Faculty of Mathematics at TU Dortmund, a position as a research associate (TV‑L E13) is to be filled in the near future (there is some flexibility with the starting date) within a research project funded by the Federal Ministry of Research, Technology and Space and led by Professor Paul Manns. The goal of the research project is to combine reinforcement learning with global optimization algorithms (branch‑price‑and‑cut) for mission planning of heterogeneous fleets of autonomous surveillance and inspection robots. The project duration is two years. Main responsibilities are * Analysis, development, and implementation of a branch‑price‑and‑cut algorithm * Analysis, development, and implementation of a reinforcement learning method for the intended application. * Evaluation of the algorithms using the simulation environment and real‑world data provided by the project partner * Publication and presentation of results in international journals and at conferences Ideal candidate profile: * Solid knowledge of discrete optimization, ideally with a connection to vehicle routing problems, typically demonstrated through a relevant PhD in mathematics, computer science, or economics (operations research) * Strong programming skills in Python and/or C++ * Experience with modern AI methods such as reinforcement learning is an advantage * Excellent written and spoken communication skills in English Further information is available on request via email to paul.manns@tu-dortmund.de. Please feel free to forward this information to potential candidates. Thank you and best regards, Paul Manns ------------------------------------------------------ TU Dortmund University Paul Manns (he/him) Professor for Optimization Faculty of Mathematics Vogelpothsweg 87 44227 Dortmund Email: paul.manns@tu-dortmund.de Phone: +49 231 755 7242 ********************************************************** * * 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] CPAIOR 2026 – Early Registration Deadline (April 20)

Dear colleagues, This is a final reminder that the *early registration deadline for CPAIOR 2026 is Monday, April 20.* The conference will take place from May 26 to May 29, 2026, at the ESSEC Business School campus in Rabat, Morocco. Registration and practical information are available on the conference website: https://sites.google.com/view/cpaior2026/home We encourage you to register before the deadline! *About Onomo Hotel special rate: *some participants experienced difficulties contacting the hotel, so we have updated the contact email on our website to a more responsive address. *Student accommodation in campus:* Please keep in mind that the *booking deadline for this option is set for Sunday, April 19 at 12:00 AM.* See details on our webpage. We look forward to welcoming you to Rabat! Best regards, Tias Guns Program Chair Diego Delle Donne and Emiliano Traversi Local Chairs ********************************************************** * * 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] EuroTDP | Differential Privacy Workshop CFP | September 17 near Vienna, Austria

Dear all, The 1st European Workshop on the Theory of Differential Privacy (EuroTDP) will be held on the 17th of September, at the ISTA Campus near ISTA, Austria. Accepted papers will be presented as posters in the workshop. Workshop website: https://eurotdp.pages.ist.ac.at/ Submission deadline: May 1st, AOE Scope: - New DP mechanisms for wide variety of algorithmic problems - Novel privacy accounting techniques and analyses - Lower bounds/impossibility results related to DP - Relationships between DP and other areas of TCS (for example formal methods) - Other closely allied topics may also be considered, but purely empirical works are not considered within scope Program details: - 3 invited talks by Adam Smith, Jonathan Ullman, and Ravi Kumar - 3 spotlight technical talks - 2 poster sessions Submission guidelines: - Non-archival, no proceedings, previous published or unpublished work all welcome - Submitted file should be a pdf of size at most 10 MB, with at least 1 inch margins and a 10 point font - No page limit, but reviewers only required to read first 4 pages General information: Differential privacy has become the pre-eminent framework to measure and limit loss in privacy when statistics about sensitive data are computed and released. The theoretical study of differential privacy has extended far beyond this scope, establishing deep relationships with long studied areas of theoretical computer science, such as learning theory, robust algorithm design, adaptive data analysis and hypothesis testing. The goal of this workshop is to share and disseminate recent developments in the theory of differential privacy. We invite works on the topics described in the scope above. All further detail may be found on the workshop website (linked above). Best wishes, Anamay Chaturvedi ********************************************************** * * 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 2026 - 1st Call for Papers

CALL FOR PAPERS ALGOWIN 2026 22nd International Symposium on Algorithmics of Wireless Networks September 3-4, 2026 L’Aquila, Italy (as part of ALGO 2026) Conference webpage: *https://algo-conference.org/2026/algowin/ * EasyChair link: *https://easychair.org/conferences/?conf=algowin2026 * ============== Important Dates ============== Submission deadline: June 29, 2026 (AoE) Notification: August 3, 2026 Camera-ready due: August 24, 2026 Conference: September 3-4, 2026 ===== 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 2026 will be held at the University of L’Aquila. It will be part of ALGO 2026, which also hosts ESA, IPEC, ATMOS, ALGOCLOUD, WABI, and WAOA. =============== Keynote Speaker =============== There will be one keynote talk at ALGOWIN 2026. The invited speaker is: - Paola Flocchini (University of Ottawa, Canada). The invited talk will be integrated in the global ALGO program, as a joint keynote. ============= 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 - Distributed Consensus and Fault Tolerance - Dynamic Networks, Temporal Graphs - Energy Management, Power Saving Schemes - Game Theoretic Aspects - Infrastructure Discovery - Internet of Things - Localization - Medium Access Control - Mobility and Dynamics - Pattern Formation - Performance Evaluation, Experimental Analysis - Population Protocols, Swarm Computing - Radio Networks - Resource Efficiency - Routing and Data Propagation - Security and Privacy aspects - Self-stabilization, Self-* Properties - Sensor Networks - Systems and Testbeds - Time Synchronization - Topology Control - Tracking - Unmanned Autonomous Entities - Virtual Infrastructures =========== Committees =========== Program Committee - Ralf Klasing, CNRS and University of Bordeaux, France (chair) - Aris Pagourtzis, National Technical University of Athens and Archimedes AI, Greece (chair) - Prudence Wong, University of Liverpool, UK (chair) - Petra Berenbrink, Universität Hamburg, Germany - Davide Bilò, University of L'Aquila, Italy - Anya Chaturvedi, Arizona State University, USA - Li-Hsuan Chen , National Chung Cheng University, Taiwan - Shantanu Das, Aix-Marseille University, France - Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy - Antonio Fernández Anta, IMDEA Software & Networks Institutes, Spain - Florent Foucaud , Université Clermont Auvergne, France - Jie Gao, Rutgers University, USA - Leszek Gąsieniec, University of Liverpool, UK - Konstantinos Georgiou, Toronto Metropolitan University, Canada - Ling-Ju Hung, National Taipei University of Business, Taiwan - Tomasz Jurdziński , University of Wroclaw, Poland - Sushanta Karmakar, Indian Institute of Technology Guwahati, India - Evangelos Kranakis, Carleton University, Canada - Nikos Leonardos, National Technical University of Athens, Greece - Stefano Leucci, University of L'Aquila, Italy - Euripides Markou, University of Ioannina and Archimedes AI, Greece - George Mertzios , Durham University, UK - Othon Michail, University of Liverpool, UK - Hendrik Molter , Ben-Gurion University of the Negev, Israel - Tobias Mömke, Augsburg University, Germany - Nils Morawietz , University of Jena, Germany - William K. Moses Jr., Durham University, UK - Miguel A. Mosteiro, Pace University, USA - Paolo Penna, IOG, Switzerland - Alexandru Popa, University of Bucharest, Romania - Maria Potop-Butucaru, Sorbonne Université, France - Tomasz Radzik, King's College London, UK - Peter Rossmanith, RWTH Aachen University, Germany - Paul Spirakis, 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 (publication expected November 2026). =========== 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=algowin2026 *). 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 2026 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. ********************************************************** * * 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] Two fully-funded PhD scholarships available for commencement in 2026

Funded by the Australian Research Council Discovery Grant Advancing stochastic optimisation: highly-correlated restless bandit models, Professor Peter Taylor, Dr Jing Fu and Professor Jose Niño-Mora would like to advertise two fully-funded PhD projects, one to be held at The Royal Melbourne Institute of Technology (RMIT) and the other to be held at The University of Melbourne, Australia. Project 1 (RMIT, Australia) Title: Restless-Bandit-Enhanced Multi-Agent Reinforcement Learning Project Description: Restless-Bandit-Enhanced Learning (RB-L) is an emerging framework that integrates restless bandit theorems with reinforcement learning to tackle the curse of dimensionality. It is widely applicable in realistic scenarios. This project aims to trade off learning and control in practical scenarios with inevitable high-dimensional state and/or action spaces. It will incorporate advanced control and learning algorithms, such as classic multi-agent reinforcement learning. The expected outcomes are scalable learning and control algorithms, with rational guarantees of overall performance. The prospective HDR student is expected to have fundamental knowledge of stochastic modeling (such as Markov decision process), reinforcement learning, and linear/convex optimization, and good programming skills for large-scale simulations. Project 2 (University of Melbourne, Australia) Title: Optimality in highly-correlated restless bandit models Project Description: Conventional techniques for analyzing restless bandit models such as Whittle relaxation, fluid approximation, and LP-based approximation focus on proving asymptotic optimality by exploring levels of relaxation over the original optimization problem. A solution of a relaxed problem can reflect intrinsic properties. It can be utilized to propose a heuristic policy for the original problem. Often it is possible to show that such a policy is asymptotically optimal. The objective of this project is to extend these methods to highly-correlated restless bandit models. The project will also consider how well the solutions perform in the non-asymptotic regime. . The prospective HDR student is expected to have fundamental knowledge of stochastic modeling, probability, reinforcement learning, and linear/convex optimization, and good programming skills. In the first instance, interested applicants should email Dr Jing Fu at jing.fu@rmit.edu.au<mailto:jing.fu@rmit.edu.au>, Professor Peter Taylor at taylorpg@unimelb.edu.au<mailto:taylorpg@unimelb.edu.au> and Professor Jose Niño-Mora at jnino@est-econ.uc3m.es<mailto:jnino@est-econ.uc3m.es> explaining why they are interested in the projects and providing details of their curriculum vitae and their academic record. Regards, --------------------------------- Dr Jing Fu Lecturer (Assistant Professor), Department of Electrical and Electronic Engineering School of Engineering, STEM College Royal Melbourne Institute of Technology https://www.rmit.edu.au/profiles/f/jing-fu ********************************************************** * * 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] SC-Square 2026: Deadline Extension

DEADLINE EXTENDED: SC-Square 2026: 11th International Workshop on Satisfiability Checking and Symbolic Computation July 13, 2026, Oldenburg Germany ************************************************************************************ The 11th SC-Square Workshop is a satellite event of ISSAC, held at the University of Oldenburg in Germany, from July 13 to 17, 2026. SC-Square Workshop website: https://www.sc-square.org/CSA/workshop11.html ISSAC conference website: https://www.issac-conference.org/2026/ Key Dates Abstract submission: April 10, 2026 April 24, 2026 Submission deadline: April 17, 2026 May 1, 2026 Notification: TBD Final version: TBD Workshop date: July 13, 2026 Scope Symbolic Computation is concerned with the efficient algorithmic determination of exact solutions to complicated mathematical problems. Satisfiability Checking has recently started to tackle similar problems but with different algorithmic and technological solutions. The two communities share many central interests, but researchers from these two communities rarely interact. Also, the lack of common or compatible interfaces for tools is an obstacle to their fruitful combination. Bridges between the communities in the form of common platforms and road-maps are necessary to initiate an exchange, and to support and direct their interaction. The aim of this workshop is to provide an opportunity to discuss, share knowledge and experience across both communities. Invited Speakers Anna Maria Bigatti<https://scholar.google.com/citations?user=iRTyqncAAAAJ&hl=it> (Università degli Studi di Genova, Italy) Mahsa Shirmohammadi<https://www.irif.fr/~mahsa/> (CNRS, Université Paris Cité, France) Submitting to the Workshop The workshop series has emerged from an H2020 FETOPEN CSA project "SC-Square", which ran from 2016 to 2018. It has been continued aiming at building bridges between Satisfiability Checking and Symbolic Computation. It is open for submission and participation to everyone interested in the topics, whether or not they were members or associates of the original project. The topics of interest include but are not limited to: * Computer Algebra and Symbolic Computation (CA) * Satisfiability Checking (SAT/SMT) * Algorithms for logical theories of arithmetics, including quantifier elimination and decision procedures * Computational Geometry * Algorithmic Group Theory * Formalized mathematics, especially in interactive theorem provers * Tools in SAT/SMT/CA, including tools that combine Symbolic Computation and Satisfiability Checking * Applications relying on Symbolic Computation or on Satisfiability Checking, including hybrid systems and controls Submission guidelines Submissions should be in English, formatted in Springer LNCS style and submitted via https://hotcrp.software.imdea.org/scsquare/ We invite four types of submissions: (1) FULL PAPERS on research, case studies or tool development should present unpublished work not submitted elsewhere (with a limit of 16 pages, not counting references) (2) EXTENDED ABSTRACTS on research, case studies or tool development should present unpublished (potentially ongoing) work not submitted elsewhere (3–5 pages, not counting references) (3) SHORT SURVEYS that describe/explain an existing body of work in an original way (5–8 pages, not counting references) (4) PRESENTATION-ONLY submissions on already published work, work to be published elsewhere, or work in progress on SC-Square related open problems or future challenges. Please submit an abstract for approval by the PC (with a limit of 2 pages). To receive the appropriate level of peer review, please select the relevant category for your paper on the submission site. For consistency, all submissions must use the LNCS style. Current lncs latex files are available from "LaTeX2e Proceedings Templates download" at: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines We plan to publish the proceedings of the workshop in digital form, hosted with CEUR-WS (see http://ceur-ws.org/). People from industry and business are warmly invited to submit papers to describe their problems, challenges, goals, and expectations for the SC-Square community. Workshop Co-Chairs Katherine Kosaian<https://sites.google.com/view/katherinekosaian> (University of Iowa, USA) Alessio Mansutti<https://alessiomansutti.github.io/> (Imdea Software Institute, Spain) Program Committee Kyungmin Bae<http://sv.postech.ac.kr/kmbae/> (Pohang University of Science and Technology, South Korea) Rizeng Chen<https://xiaxueqaq.github.io/> (Peking University, China) Xin Chen<https://shinchern.github.io/> (University of New Mexico, US) Ruiwen Dong<https://sites.google.com/view/ruiwen-dong/> (University of Oxford, UK) Matthew England<https://matthewengland.coventry.domains/index.html> (Coventry University, UK) Stéphane Graham-Lengrand<https://www.csl.sri.com/~sgl/> (SRI, US) Alberto Griggio<https://es-static.fbk.eu/people/griggio/> (Fondazione Bruno Kessler, Italy) Hoon Hong<https://hong.math.ncsu.edu/> (North Carolina State University, US) Dejan Jovanovic<https://dddejan.github.io/> (AWS, US) Ariel Kellison<https://ak-2485.github.io/> (Code Metal, US) George Kenison<https://georgekenison.github.io/> (KU Leuven, Belgium) Hanna Lachnitt<https://lachnitt.github.io/> (Stanford University, US) Pierre Mathonet<https://scholar.google.com/citations?user=KSD99-cAAAAJ&hl=en> (Université de Liège, Belgium) Guillaume Melquiond<https://guillaume.melquiond.fr/> (Inria and ENS Lyon, France) Marc Moreno Maza<https://www.csd.uwo.ca/~mmorenom/homepage-moreno.html> (University of Western Ontario, Canada) Mathias Preiner<https://cs.stanford.edu/~preiner/> (Stanford University, US) Philipp Rümmer<http://www.philipp.ruemmer.org/> (University of Regensburg, Germany) Mohab Safey El Din<https://perso.lip6.fr/Mohab.Safey/> (Sorbonne Université, France) Žaneta Semanišinová<https://tu-dresden.de/mn/math/algebra/das-institut/beschaeftigte/zaneta-semanisinova> (TU Dresden, Germany) Zhikun She<https://scholar.google.com/citations?user=J8viQpMAAAAJ&hl=en> (Beihang University, China) ********************************************************** * * 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: EUROYoung Workshop 2026 (Lugano, Oct 14–16)

Dear all, We are pleased to announce that the abstract submission deadline for the EUROYoung Workshop 2026 has been extended. The workshop will take place in Lugano (Switzerland) from 14 to 16 October 2026, and we warmly invite you to join us for this three-day event dedicated to Operations Research. Updated key dates: * Abstract submission deadline: 24 April 2026 (10:00 AM CET) * Notification of acceptance: 8 May 2026 * Registration: 9 May 2026 (00:00 AM CET) – 1 June 2026 (11:59 PM CET) The EUROYoung Workshop aims to foster community and collaboration among young researchers in Operations Research. Participants will enjoy plenary talks and have the opportunity to present their work. In addition to the academic program, the workshop will feature networking opportunities and social activities designed to help participants build new connections. Low accommodation fees will be available for participants. More information can be found on our website: https://euroyoung.eu/lugano2026/ If you have any questions, please feel free to contact us at euroyoung2026@usi-supsi.ch<mailto:euroyoung2026@usi-supsi.ch> We look forward to welcoming you to Lugano! Best regards, Eleonora Vercesi On behalf of the 6th EUROYoung Workshop Organizing 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] CFP: RADICAL 2026: Concurrency & Logic, Liverpool (UK) - co-located with CONFEST 2026

[Apologies for cross-posting; please forward this call to interested parties] ================================================================== Call for Talk Proposals: RADICAL 2026 Fifth International Workshop on Recent Advances in Concurrency and Logic Website: https://sites.google.com/site/radicalconcur Date: September 5, 2026 Location: Liverpool, UK (Co-located with CONFEST 2026) ++ IMPORTANT DATES Submission deadline: Friday, 5 June 2026 (AoE) Notification to authors: Friday, 10 July 2026 (approx.) Workshop date: Saturday, 5 September 2026 ++ INVITED SPEAKERS Gethin Norman (University of Glasgow) Ana Sokolova (University of Salzburg) ++ MOTIVATION AND SCOPE Concurrency and Logics are two of the most active research areas in theoretical computer science, providing a plethora of models for reasoning about intelligent, distributed systems. Recently, the interplay of concurrency and logic with modern Artificial Intelligence has expanded dramatically. The RADICAL workshop aims to bring together researchers working on different aspects of logic and concurrency in AI, multi-agent systems, and computer science. We share the challenge of developing novel theories and tools for automated reasoning that account for the behaviour of concurrent and multi-agent entities. We particularly welcome submissions addressing the intersection of concurrency, logic, and: - Modern AI & Learning Systems: Verification and synthesis of learning-enabled systems, neuro-symbolic reasoning, and autonomous multi-agent workflows. - Concurrent Systems: Design, verification, and synthesis (both qualitative and quantitative). - Multi-Agent Systems: Strategic reasoning, distributed decision theory, and knowledge representation. - Program Analysis: Advanced type systems, separation logics, and validation techniques for concurrent and distributed programs. Topics covered include, but are not limited to: Concurrency Theory Formal models for communication-based and distributed systems Logics in concurrency Logics for verification of multi-agent systems Logical foundations of decision theory Programming languages and semantics ++ SUBMISSION GUIDELINES RADICAL offers an innovative, informal format heavily oriented toward interaction. Rather than full research papers, we invite short talk proposals. - Format: Up to 2 pages (excluding references) formatted in PDF using the standard EasyChair format. - Submission Link: https://easychair.org/conferences/?conf=radical2026 A submission to RADICAL would typically fall within one of the following categories: Reports of ongoing work and/or preliminary results Summaries of an already published paper (or series of papers) Overviews of (recent) PhD theses, research projects, or consortia Manifestos, calls to action, or personal views on future challenges Note: Submissions based on already published works should include explicit references/links. Submissions will be judged by the PC on the basis of significance, relevance, and the potential to deliver an engaging, compelling talk. Submissions from PC members are encouraged. ++ NO PROCEEDINGS RADICAL will be an informal venue. There will be no formal proceedings, making this an ideal space to present early-stage ideas and cross-pollinate with neighbouring communities. ++ ATTENDANCE POLICY RADICAL 2026 is planned as a highly interactive, in-person event in Liverpool. It is understood that for each accepted submission, at least one co-author will register, attend the workshop, and present the talk. ++ DIVERSITY & INCLUSION RADICAL is committed to fostering an inclusive and welcoming environment. We highly encourage submissions from researchers of all backgrounds, especially those from underrepresented groups in Theoretical Computer Science. ++ WORKSHOP CO-CHAIRS Dan Frumin (University of Groningen, The Netherlands) Muhammad Najib (Heriot-Watt University, UK) Contact: For any inquiries regarding the workshop or the submission process, please contact the organisers at: m.najib@hw.ac.uk ________________________________ Founded in 1821, Heriot-Watt is a leader in ideas and solutions. With campuses and students across the entire globe we span the world, delivering innovation and educational excellence in business, engineering, design and the physical, social and life sciences. This email is generated from the Heriot-Watt University Group, which includes: 1. Heriot-Watt University, a Scottish charity registered under number SC000278 2. Heriot- Watt Services Limited (Oriam), Scotland's national performance centre for sport. Heriot-Watt Services Limited is a private limited company registered is Scotland with registered number SC271030 and registered office at Research & Enterprise Services Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS. The contents (including any attachments) are confidential. If you are not the intended recipient of this e-mail, any disclosure, copying, distribution or use of its contents is strictly prohibited, and you should please notify the sender immediately and then delete it (including any attachments) from your system. ********************************************************** * * 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 in algorithms at University of Salzburg (Austria)

The University of Salzburg (Department of Computer Science) is currently seeking a Predoctoral University Assistant ("PhD student") in the Big Data Algorithms Group headed by Sebastian Forster. The goal is to develop algorithms for solving clustering, distance, flow, or cut problems that are as well-suited as possible to dynamic, parallel, or distributed computing models. * Requirements: Master's degree (or equivalent) in computer science or a related field * Start date: Fall 2026 * Duration: Four years * Salary: 41.601 EUR gross/year for 30 hours/week * Application deadline: May 6, 2026 Please follow this link for further details: https://karriere.plus.ac.at/en/jobs/6e6aa798-0429-01e8-cabb-69c12151a2bd Group website: https://www.plus.ac.at/big-data-algorithms/team/?lang=en Contact for research-related questions: forster@cs.sbg.ac.at (Sebastian Forster) Contact for general questions: tetiana.mazanko@plus.ac.at (Tetiana Mazanko) ********************************************************** * * 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] FLoC workshop OVERLAY 2026 - May 1 deadline extension - ERRATA CORRIGE: May 1

*** deadline extended to May 1 *** 8th International Workshop on Artificial Intelligence and fOrmal VERification, Logic, Automata, and sYnthesis (OVERLAY 2026), co-located with the 9th Federated Logic Conference (FLoC 2026) *** We apologize for possible cross posting *** *********** DEADLINE EXTENSION AND CALL FOR PAPERS *********** OVERLAY 2026 @ FLoC July 18-19, 2026 Lisbon, Portugal https://overlay.uniud.it/workshop/2026 **Extended** submission deadline: **May 1, 2026** Notification: May 25, 2026 FLoC early registration deadline: June 1, 2026 *********** *********** *********** The increasing adoption of Artificial Intelligence techniques in safety-critical systems, employed in real world scenarios, requires the design of reliable, robust, and verifiable methodologies. Artificial Intelligence systems employed in such applications need to provide formal guarantees about their safety, increasing the need for a close interaction between the Artificial Intelligence and Formal Methods scientific communities, and possibly leading to the proposal of novel neurosymbolic approaches. To witness this increasing need, tools and methodologies integrating Formal Methods and Artificial Intelligence, and more broadly symbolic and sub-symbolic solutions, are getting more and more attention, especially considering the wide-range and pervasive applications of machine and deep learning models. The workshop is the main official initiative supported by the OVERLAY group (https://overlay.uniud.it/). The event aims at establishing a stable, long-term scientific forum on relevant topics connected to the relationships between Artificial Intelligence and Formal Methods, by providing a stimulating environment where researchers can discuss opportunities and challenges at the border of the two areas. Important goals of the workshop are (i) to encourage the ongoing interaction between the formal methods and artificial intelligence communities, (ii) to identify innovative tools and methodologies, and (iii) to elicit a discussion on open issues and new challenges. This year's edition will be held on July 18-19, 2026, as part of FLoC 2026, which will be held in Lisbon, Portugal. *** Call for contributions *** We accept contributions (see below for the format) focusing on the interaction between Artificial Intelligence and Formal Methods and on the issue of symbolic/sub-symbolic integration. Presentation of results recently published in other scientific journals or conferences and invited talks will complement the presentations of contributed papers. Topics of interest include (but are not limited to): automata theory automated reasoning, satisfiability, theorem proving automated planning and scheduling controller and reactive synthesis formal verification game theory hybrid and discrete systems logics in computer science neuro-symbolic artificial intelligence logics for neural networks neural networks for logic formal and data-driven approaches to natural language processing runtime verification and monitoring specification and verification of machine/deep learning systems specification and verification of systems based on large language models tools and applications We invite two kinds of contributions: 1. “regular” papers, presenting original research not published nor under review elsewhere. Regular papers should not exceed nine (9) pages plus references and, possibly, an appendix (that will not be published). 2. “short” papers, presenting either original research or results already published in other venues, write-ups on work-in-progress projects worth discussing, etc. Short papers should not exceed four (4) pages plus references. All contributed papers, except if explicitly requested otherwise by the authors, will be included in the Proceedings of the event, published at CEUR Workshop Proceedings (https://ceur-ws.org<https://ceur-ws.org/>). Authors are asked to use the CEURART LaTeX style, available here: https://ceur-ws.org/Vol-XXX/CEURART.zip. Submissions must be in PDF format and submitted through the FLoC HotCRP system at: https://submissions.floc26.org/overlay/ *** Note on the use of Generative AI writing assistance tools *** Please adopt the CEUR guidelines for Generative AI use at the following address: https://ceur-ws.org/GenAI/Policy.html. *** Registration and participation fees *** OVERLAY 2026 will take place as part of FLoC 2026. As a consequence, participants to the workshop must follow the instructions provided by the FLoC 2026 committee for what concerns the registration requirements. *** Venue *** The workshop will take place in Lisbon, in one of the venues of FLoC 2026 (https://www.floc26.org/venue), on July 18 and 19. *** Important dates (all deadlines are AOE) *** - Paper submission (**extended**): May 1, 2026, Anywhere On Earth - Acceptance notification: May 25, 2026 - Workshop: July 18-19, 2026 *** Program Committee Chairs *** Luigi Bonassi - University of Oxford, UK Nicola Gigante - Free University of Bozen-Bolzano, Italy ***Program Committee*** Raffaella Bernardi - Free University of Bozen-Bolzano, Italy Alberto Bombardelli - Kyoto University, Japan Davide Bresolin - University of Padova, Italy Alessandro Burigana - Free University of Bozen-Bolzano, Italy Victor-Alexandru Darvariu - University of Oxford, UK Giuseppe De Giacomo - University of Oxford, UK Görschwin Fey - TU Hamburg, Germany Mirco Giacobbe - University of Birmingham, UK Alessandro Gianola - NESC-ID/Instituto Superior Técnico, Universidade de Lisboa, Portugal Lucía Gómez Álvarez - INRIA Grenoble, France Martin Leucker - University of Lübeck, Germany Federico Mari - University of Rome Foro Italico, Italy Andrea Micheli - Fondazione Bruno Kessler, Trento, Italy Sergio Mover - Lix Ecole Polytechnique, Paris, France Andrea Orlandini - ISTC-CNR, Rome, Italy Ingo Pill - Graz University of Technology, Austria Luca Putelli - University of Brescia, Italy Michel Reniers - Eindhoven University of Technlogy, Germany Sabina Rossi - University of Venice, Italy Sasha Rubin - University of Sydney, Australia Cesar Sanchez - IMDEA, Madrid, Spain Nicola Saccomanno - University of Udine, Italy Enrico Scala - University of Brescia, Italy Stefano Tonetta - Fondazione Bruno Kessler, Trento, Italy Enrico Tronci - University of Rome La Sapienza, Italy Sarah Winkler - Free University of Bozen-Bolzano, Italy Matteo Zavatteri - Fondazione Bruno Kessler, Trento, Italy *** Contacts *** For more information write an email to overlay@uniud.it<mailto:overlay@uniud.it> ********************************************************** * * 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/ * **********************************************************