[DMANET] New deadlines: Call for Papers ICCL 2026: 17th International Conference on Computational Logistics, Aug 13- Sept 2, 2026, Morocco

***apologies for cross-postings*** Call For Papers ICCL 2026, 17th International Conference on Computational Logistics, https://www.iccl2026.uni-hamburg.de/ e-mail: ICCL2026@aui.ma August 31 - September 02, 2026, Al Akhawayn University, Ifrane, Morocco The submission of abstracts and papers will be handled through the ICCL 2026 EasyChair Management System: https://easychair.org/my2/conference?conf=iccl26 ICCL focuses on the theory and applications of operations research, artificial intelligence, and management science to problems in logistics. Authors are kindly invited to submit their contributions in the field of logistics involving operations research and management, decision support, artificial intelligence, and information systems. Practical cases providing insights and real-world experience are encouraged to be submitted. Submitted contributions will be peer-reviewed and may be submitted as:     Full papers for publication in Springer’s Lecture Notes in Computer Science (LNCS).     Extended abstracts for presentation only. The theme of this year’s conference is “Logistics in the Age of AI.” The conference topics include, among others:     Operations research, planning and decision support     Machine learning and AI for logistics     Routing     Freight, multimodal and nearshoring     Maritime logistics and port operations     Urban logistics and public transport     Warehousing and inventory     Supply chain design and sustainability     Reverse logistics and circular economy     Humanitarian and health-care logistics     Large-scale and combinatorial optimization     IoT, real-time systems and ICT     Data-driven logistics, benchmarking and reproducibility     Uncertainty, stochastic and robust planning     Simulation, modelling and digital twins     Energy-aware logistics     Sector-specific studies (e.g., agro, land)     Case studies, demos, datasets and Tools Important Dates (Extended — Firm Deadlines)     Full paper submission deadline:  May 31, 2026     Abstract submission deadline: June 15, 2026     Notification of acceptance for full papers and abstracts: June 30, 2026     Early-bird registration deadline: July 15, 2026 Submissions The submission of abstracts and papers will be handled through the ICCL 2026 EasyChair management system. Full paper submissions Full papers should have a length between 8 to 15 pages following the LNCS style files. For a paper to be included in this volume, it should be presented at the conference by one of the authors.     Upload the pdf file of the 8-15 page regular paper in LNCS style on the EasyChair platform.     Paste the abstract corresponding with the full paper in the textbox (maximum 3000 characters, including spaces) to be included in the abstracts booklet, which will be distributed     during the conference.     Authors should consult Springer’s authors’ guidelines and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Additionally,     Springer’s proceedings LaTeX templates are available in Overleaf. Springer encourages authors to include their ORCIDs in their papers. In addition, the corresponding author of     each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should     match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made. Extended abstracts (for presentation only) Submitted abstracts should not exceed one page (maximum 3000 characters, including spaces). At most 4 references can be included. Mathematical formulas can be included in LaTeX notation. Accepted Abstracts should be presented at the conference by one of the authors. Conference Chairs Malek Sarhani, Al Akhawayn University in Ifrane, Morocco Stefan Voß, University of Hamburg, Germany Youssef Chetioui, Al Akhawayn University in Ifrane, Morocco ********************************************************** * * 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] E-CoRe PhD Positions

Dear Colleagues, The E-CoRe project (Energy-efficient Computing via Reversibility), funded by the European Union's Horizon Europe programme under the Marie Skłodowska-Curie Actions, invites applications for 13 PhD positions in reversible computing and energy-efficient systems, distributed across Europe (Italy, Denmark, UK, Poland, and France). We welcome applications from all qualified candidates and are committed to equal opportunity and inclusion in our recruitment. Applicants should, however, satisfy the mobility rule: they should not have lived or worked in the hiring country for more than 1 year in the last 3 years. Deadline: **** May 25, 2026 **** About E-CoRe E-CoRe (Energy-efficient Computing via Reversibility) advances the science and practice of reversible computing for a sustainable digital future. The project sets the stage for the Reversible Computing revolution by training the next generation of experts to make computing sustainable. Energy is a main concern in current society. Limited natural resources and high production costs lead to energy shortages, and energy consumption causes complex and undesirable phenomena such as pollution and global warming. IT accounts for a surprisingly large fraction of global energy consumption; estimated at 10%. Hence, energy efficiency in computing is a critical and necessary research area, often called green computing. The laws of physics (Landauer's principle in particular) fix a lower bound of the amount of energy needed to perform an irreversible computation, proportional to the number of discarded bits of information. Classical computing discards large amounts of information (e.g. x:=0 on 64 bits discards 64 bits), while reversible computing (RC) discards none, avoiding Landauer's lower bound. Although the fraction of energy lost due to Landauer's principle is currently very small, it will become increasingly relevant as hardware technology improves. E-CoRe aims at setting the stage for the RC revolution by forming a community of experts with deep understanding of RC, who will improve and popularise RC languages, algorithms and architectures; in particular in energy intensive applications such as machine learning, blockchains and computer vision for drones. The project is structured into 4 work packages and 13 PhD Topics: Work Package 1- Reversible Programming Languages 1. Reversible Programming Languages (University of Copenhagen, Denmark) 2. Concurrency and Distribution in Reversible Languages (University of Bologna, Italy) 3. Formal Verification Techniques for Reversible Languages (CNRS / Université Côte d'Azur, France) Work Package 2- Reversible Algorithms 4. Reversible Sequential General-Purpose Algorithms (AGH University, Krakow, Poland) 5. Reversible Concurrent and Distributed Algorithms (University of Leicester, UK) 6. Partially Reversible Algorithms (University of Bologna, Italy) Work Package 3- Compilation & Architectures 7. Compilation Principles and Techniques for Reversible Languages (University of Copenhagen, Denmark) 8. Design and Simulation of Adiabatic Architectures (University of Manchester, UK) 9. Design and Simulation of Reversible Neuromorphic Architectures (University of Manchester, UK) 10. Realisation of Energy-Efficient Custom Adiabatic Circuits (University of Southern Denmark, Denmark) Work Package 4- Applications 11. Energy Efficiency in Blockchains (University of Bologna, Italy) 12. Energy Efficiency in Cyber-Physical Systems (University of Southern Denmark, Denmark) 13. Energy Efficiency in Machine Learning (AGH University, Krakow, Poland) Why to Apply Work across Europe with leading institutions in reversible computing. Contribute to sustainable computing and energy efficiency. Benefit from secondments and international collaboration. Competitive salary and conditions under Marie Skłodowska-Curie Action rules. Further Information and Applications Full topic descriptions, eligibility criteria, and application instructions are available at https://e-core.nws.cs.unibo.it<https://e-core.nws.cs.unibo.it/> Please share this announcement with suitable candidates and relevant networks. Best regards, Irek Ulidowski E-mail: irekulidowski@gmail.com ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] [CFP]: ICA3PP-2026, The 26th International Conference on Algorithms and Architectures for Parallel Processing, UK, 26-28 October 2026

[Please accept our apologies if you receive multiple copies of this message] ************************* ICA3PP-2026 Call for Papers********************** 26th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP-2026) https://hpcn.exeter.ac.uk/ica3pp2026/ Exeter, UK, 26-28 October 2026 INTRODUCTION ============= ICA3PP-2026 is the 26th event in this prestigious series of conferences started in 1995 that are devoted to algorithms and architectures for parallel processing. ICA3PP is a famous event worldwide that covers many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. With the booming computing demands from every aspect of modern society, parallel processing has become increasingly critical and challenging. This conference provides a forum for academics and practitioners from all over the world to exchange ideas on improving the efficiency, performance, reliability, security and interoperability of computing systems and applications. ICA3PP-2026 will be held in Exeter, England, UK. The objective of ICA3PP 2026 is to bring together researchers and practitioners from academia, industry and governments to advance the theories and technologies in parallel and distributed computing. ICA3PP 2026 will focus on two broad areas of parallel and distributed computing, i.e. architectures, algorithms and networks, and systems and applications. ICA3PP-2026 is a CCF Rank-C conference. Accepted papers would be published by Springer and submitted to the EI database. Excellent papers with extension will be recommended for special issues in renowned journals. SCOPE AND TOPICS ================ Topics of interest include, but are not limited to: Track 1: Parallel and Distributed Architectures Track 2: Software Systems and Programming Models Track 3: Parallel and Distributed Algorithms and Applications Track 4: Service Dependability and Security in Distributed and Parallel Systems Track 5: Network Architectures and Algorithms Track 6: Big Data Management and Analysis Track 7: Internet of Things and Cyber-Physical-Social Computing Track 8: Performance Modeling and Evaluation PAPER SUBMISSION GUIDELINE ========================== All papers need to be submitted electronically through the conference submission website (https://hpcn.exeter.ac.uk/ica3pp/) with PDF format. Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers will be selected based on their originality, significance, timeliness, relevance, and clarity of presentation. Submission of a paper should be regarded as a commitment that, should the paper be accepted, at least one of the authors will register and attend the conference to present the work. Papers must be clearly presented in English in Springer LNCS Format<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>. Detailed formatting guidelines are available at: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines. IMPORTANT DATES ================= * Submission Deadline: 10 July 2026 * Authors Notification: 30 August 2026 * Final Manuscript Due: 30 September 2026 * Registration Due: 30 September 2026 * Conference Date: 26-28 October 2026 For more information, please visit the conference website: https://hpcn.exeter.ac.uk/ica3pp2026/ ********************************************************** * * 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] ISSAC 2026 - Second Call for Short Communications and Software Presentations

SECOND CALL FOR SHORT COMMUNICATIONS AND SOFTWARE PRESENTATIONS ISSAC 2026 International Symposium on Symbolic and Algebraic Computation July 13 - 17, 2026 Carl von Ossietzky Universität of Oldenburg, Germany https://www.issac-conference.org/2026/ ---------------------------------------------------------------------- Note: the deadline for submitting software presentations has been extended. The International Symposium on Symbolic and Algebraic Computation is the premier conference for research in symbolic computation and computer algebra. ISSAC 2026 will be the 51st meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited talks, tutorials, short communications (posters), software demonstrations, and vendor exhibits with a centerpiece of contributed research papers. ISSAC 2026 will be held from July 13 to 17, 2026, at Oldenburg, Germany. The short communications session at ISSAC is a venue to announce early research results or ongoing projects that might not yet be complete. Short communications reporting on recent work published, accepted, or submitted elsewhere are also welcome (with original publications clearly referenced). The short communication submission will be in the form of an extended abstract (see details below). At the conference, short communications will be presented in the form of a poster session. Authors are encouraged to print their poster on a single large A0 sheet. The software presentation sessions at ISSAC are opportunities to demonstrate and communicate about new implementations of algorithms in symbolic and algebraic computation. Of relevance are presentations for new software, new packages, or new developments that present some originality or improved performance compared to the state of the art. Authors are invited to submit an extended abstract in PDF format of no more than 4 pages. The abstracts will be reviewed by the short communications and software committees and relevant experts when needed. The review criteria are content, originality, style, and relevance. The accepted short communication and software abstracts will be published in an upcoming issue of the ACM SIGSAM Communications in Computer Algebra. Important Dates --------------- Short communications (posters): * Abstract submission (.pdf) deadline: May 8, 2026, 23:59 (anywhere on Earth) * Notification of acceptance/rejection: May 25, 2026 * Final version (.tex) due: June 12, 2026 Software presentations: * Submission software presentation deadline: May 1, 2026, 23:59 (anywhere on Earth) * Notification of acceptance/rejection: May 25, 2026 * Final version (.tex) due: June 12, 2026 Submissions ----------- Both for the short communications and the software presentations, the submission is in the form of an extended abstract of no more than 4 pages using the SIGSAM LaTeX style and the CCA templates which are available here: https://www.sigsam.org/cca/ Authors of accepted contributions are expected to present their work at the symposium. Short communications: Please submit via EasyChair at: https://easychair.org/conferences/?conf=issac2026poster Software presentations: Please submit via EasyChair at: https://easychair.org/conferences/?conf=issac2026softwarepre Topics ------ All areas of computer algebra and symbolic mathematical computation are of interest. These include, but are not limited to: Algorithmic aspects: * Exact and symbolic linear, polynomial and differential algebra * Symbolic-numeric, homotopy, perturbation and series methods * Computational algebraic geometry * Polynomial and semialgebraic optimization * Computational group theory and number theory * Quantifier elimination and logic * Computer arithmetic * Summation, recurrence equations, integration, solution of ODEs & PDEs * Symbolic methods in other areas of pure and applied mathematics * AI methods and symbolic computation * Complexity of algebraic algorithms and algebraic complexity Software aspects: * Design of symbolic computation packages and systems * Language design and type systems for symbolic computation * Data representation * Considerations for modern hardware * Algorithm implementation and performance tuning * Mathematical user interfaces * Use with systems such as digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation Application aspects: * Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact. Invited Speakers ---------------- Saugata Basu, Purdue University, United States of America Assia Mahboubi, Inria & Vrije Universiteit Amsterdam, France, Netherlands Oded Schwartz, The Hebrew University of Jerusalem, Israel Wadim Zudilin, Radboud Universiteit, Netherlands Tutorial Speakers ----------------- Bettina Eick, Technische Universität Braunschweig, Germany Ziming Li, Academia Sinica, China Vincent Neiger, Sorbonne University, France Organizing Committee -------------------- General Chair: Christoph Koutschan, RICAM, Austrian Academy of Sciences, Austria Program Committee Chairs: Alin Bostan, Inria and Sorbonne University, France Clément Pernet, Grenoble INP - UGA, France Local Arrangements Chair: Anne Frühbis-Krüger, Carl von Ossietzky Universität of Oldenburg, Germany Treasurer: Florian Hess, Carl von Ossietzky Universität of Oldenburg, Germany Proceedings Editor:      Thi Xuan Vu, Université de Lille, France Publicity Chair: Ali Kemal Uncu, University of Bath, UK Tutorial Chair: Arne Storjohann, University of Waterloo, Canada Short Communications Chair: Hao Du, Beijing University of Posts and Telecommunications, China Software Presentations Chair: Katsusuke Nabeshima, Tokyo University of Science, Japan Short Communications Committee ------------------------------ Erika Ábrahám, RWTH Aachen University, Germany Hao Du, Beijing, University of Posts and Telecommunications, China Claudia Fevola, Inria Saclay, France Kisun Lee, Clemson University, United States of America Jie Wang, Chinese Academy of Sciences, China Software Presentation Committee ------------------------------- Alexander Brandt, Dalhousie University, Canada Clemens Hofstadler, Johannes Kepler University, Austria Dong Lu, Southwest Jiaotong University, China Katsusuke Nabeshima, Tokyo University of Science, Japan Satellite Event --------------- Satisfiability Checking and Symbolic Computation Workshop 2026: https://www.sc-square.org/CSA/workshop11.html --- By submitting your article to an ACM Publication, you are hereby acknowledging that you and your co-authors are subject to all ACM Publications Policies, including ACM's new Publications Policy on Research Involving Human Participants and Subjects. Alleged violations of this policy or any ACM Publications Policy will be investigated by ACM and may result in a full retraction of your paper, in addition to other potential penalties, as per ACM Publications Policy. Please ensure that you and your co-authors obtain an ORCID ID, so you can complete the publishing process for your accepted paper. ACM has been involved in ORCID from the start and we have recently made a commitment to collect ORCID IDs from all of our published authors. We are committed to improve author discoverability, ensure proper attribution and contribute to ongoing community efforts around name normalization; your ORCID ID will help in these efforts. ********************************************************** * * 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] ATMOS 2026 - call for papers

Dear colleagues, We are pleased to announce the first Call for Papers of ATMOS 2026 https://algo-conference.org/2026/atmos/ We look forward to seeing you in L'Aquila. On behalf of the Program Committee, Valentina Cacchiani, University of Bologna Stefan Funke, University of Stuttgart ---------------------------------------------------------------------------- Apologies for any cross posting ---------------------------------------------------------------------------- FIRST CALL FOR PAPERS: ATMOS 2026 ---------------------------------------------------------------------------- 26th Symposium on ALGORITHMIC APPROACHES FOR TRANSPORTATION MODELLING, OPTIMIZATION, AND SYSTEMS (ATMOS 2026) September 3-4, 2026, L'Aquila, Italy Conference website: https://algo-conference.org/2026/atmos/ Submission link: https://easychair.org/conferences/?conf=atmos2026 ---------------------------------------------------------------------------- SCOPE ---------------------------------------------------------------------------- The 26th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2026) will be part of ALGO 2026, which will take place at the Department of Human Studies and at the "San Basilio" Congress Centre of the University of L’Aquila in L'Aquila, Italy. ATMOS is scheduled on 3-4 September 2026. Since 2000, ATMOS brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transport optimization. The symposium provides a forum for the exchange and dissemination of new ideas and techniques. The aim of making transportation better gives rise to very complex and large-scale optimization problems requiring innovative solution techniques and ideas from algorithms, mathematical optimization, theoretical computer science, and operations research. ---------------------------------------------------------------------------- INVITED SPEAKER ---------------------------------------------------------------------------- Renato Werneck, Amazon, USA ---------------------------------------------------------------------------- IMPORTANT DATES ---------------------------------------------------------------------------- Submission deadline: June 26, 2026 (AoE) Notification to authors: August 4, 2026 Camera ready submission: August 11, 2026 Symposium: September 3-4, 2026 ---------------------------------------------------------------------------- TOPICS ---------------------------------------------------------------------------- The symposium welcomes but is not limited to papers addressing the following topics: - Congestion Modelling and Reduction - Crew and Duty Scheduling - Demand Forecasting - Delay Management - Design of Pricing Systems - Electromobility - Infrastructure Planning - Intelligent Transportation Systems - Models for User Behaviour - Line Planning - Mobile Applications for Transport - Mobility-as-a-Service - Multi-modal Transport Optimization - Routing and Platform Assignment - Route Planning in Road and Public Transit Networks - Rostering - Timetable Generation - Tourist Tour Planning - Traffic Guidance - Vehicle Routing - Vehicle Scheduling The symposium welcomes but is not limited to papers applying and advancing the following techniques: Algorithmic Game Theory, Approximation Algorithms, Combinatorial Optimization, Graph and Network Algorithms, Heuristics and Meta-heuristics, Mathematical Programming, Methods for the Integration of Planning Stages, Online and Real-time Algorithms, Simulation Tools, Stochastic and Robust Optimization. ---------------------------------------------------------------------------- SUBMISSIONS ---------------------------------------------------------------------------- Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics related to the symposium. Simultaneous submission to other journals or conferences with published proceedings is not allowed. By submitting a paper the authors acknowledge that, in case of acceptance, at least one of the authors must register at ALGO/ATMOS 2026, attend the conference on-site, and present the paper. Submissions must be in the form of a single PDF file prepared according to the author instructions https://www.dagstuhl.de/en/publishing/series/details/oasics and using the LaTeX OASIcs style file and must be submitted electronically via the EasyChair submission system https://easychair.org/conferences/?conf=atmos2026 ATMOS 2026 accepts two types of submissions, both of which will be reviewed with the same quality standards by the Program Committee. (a) Regular paper submissions: A regular paper submission should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state its key contributions, and outline the key technical ideas and methods used to achieve the main results. A regular paper submission should consist of a main body plus an optional and clearly marked appendix. The target length for the main body (excluding the bibliography, the front page(s) (authors, affiliation, keywords, abstract, ...)) is 12-15 pages. The total paper, including the bibliography, the front page(s) (authors, affiliation, keywords, abstract, ...) and the optional appendix, may not exceed 20 pages. Authors should include all necessary details in their submission so that the Program Committee can judge the correctness, importance and originality of their work. Any material (e.g., proofs or experimental results) omitted (from the main part of 15 pages) due to space limitations can be put into the optional appendix, which will be read at the Program Committee’s discretion. Regular papers will be allotted up to 20 pages in the proceedings. (b) Short paper submissions: A short paper submission may present preliminary results or work-in-progress on a specific topic. Authors should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state the paper’s key contributions, and outline the key technical ideas and methods used to achieve the main claims. A short paper submission should have at least 4 and at most 6 pages. Authors should provide sufficient details in their submission so that the Program Committee can judge the correctness, importance and originality of their work. Short papers will be allotted up to 6 pages in the proceedings. ---------------------------------------------------------------------------- PROCEEDINGS ---------------------------------------------------------------------------- The proceedings will be published on the Dagstuhl Open Access Series in Informatics (OASIcs) publication service. ---------------------------------------------------------------------------- SPECIAL ISSUE ---------------------------------------------------------------------------- A special issue in the journal Networks is planned for high-quality selected papers of ATMOS 2026. An adequately extended version with respect to the ATMOS paper is expected. All submissions will undergo the standard peer-review procedure of the journal Networks. Further information on submission dates will be posted later. ---------------------------------------------------------------------------- PROGRAM COMMITTEE ---------------------------------------------------------------------------- - Thomas Bläsius, Institute of Technology, Germany - Valentina Cacchiani (co-chair), University of Bologna, Italy - David Coudert, INRIA Sophia Antipolis, France - Mattia D'Emidio, University of L'Aquila, Italy - Twan Dollevoet, Erasmus University Rotterdam, the Netherlands - Markus Friedrich, University of Stuttgart, Germany - Stefan Funke (co-chair), University of Stuttgart, Germany - Andrew Goldberg, Lehigh University, Bethlehem, USA - Niels Lindner, Zuse Institute Berlin, Berlin, Germany - Richard Lusby, Technical University of Denmark, Denmark - Matus Mihalak, University of Maastricht, the Netherlands - Federico Perea, University de Seville, Spain - Dennis Schieferdecker, Apple, San Francisco, USA - Philine Schiewe, Aalto University, Finland - Marie Schmidt, University of Würzburg, Germany - Sebastian Stiller, Technical University Braunschweig, Germany - Renato Werneck, Amazon, San Francisco, USA - Christos Zaroliagis, Patras, Greece ---------------------------------------------------------------------------- STEERING COMMITTEE ---------------------------------------------------------------------------- - Matthias Müller-Hannemann, University of Halle, Germany - Marie Schmidt, Universität Würzburg, Germany - Anita Schöbel, University of Kaiserslautern-Landau, Germany - Christos Zaroliagis, University of Patras, Greece (Chair) ---------------------------------------------------------------------------- Valentina Cacchiani, University of Bologna Stefan Funke, University of Stuttgart ********************************************************** * * 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 program in AI & Computer Science at Plaksha University

———————— Applications are now open for the PhD program in AI & Computer Science at Plaksha University, Punjab, India, under the Harish & Bina Shah School of AI & Computer Science. We invite applications from motivated candidates looking to embark on a world-class research journey in emerging areas of AI and Computer Science. The program offers a special fellowship that includes a ₹80,000 monthly stipend with annual increments reaching ₹1,00,000 by year 5, an additional ₹20,000 monthly (optional) stipend for extended TA work, a ₹1,00,000 annual professional development grant, a fully funded 6-month international research visit, and support for A* conference presentations. Students will have the opportunity to work with leading research faculty at Plaksha and collaborate with world-renowned faculty from Berkeley, UPenn, and other top institutions, while being part of a vibrant research ecosystem in emerging AI and CS domains. The program also features structured partnerships with leading global research groups, with PhD topics developed in conjunction with international collaborators to ensure research with global impact and visibility. You are encouraged to experience our academic environment firsthand. Selected candidates may plan a campus visit and interact with faculty to better understand our research. For queries or to plan a visit, please contact Abhijeet Singh at abhijeet.singh@plaksha.edu.in, along with your CV. The CSAI faculty at Plaksha includes Ankur Nahar, Anupam Sobti, Deepak Khemani, Deepan Muthirayan, M Balakrishnan, Mayank Bhardwaj, Pankaj Pansari, Rajesh Sharma, Saeed Salehi, Sandeep Manjanna, Siddharth, and Tapas Pandit. Applications are open for the upcoming academic year. Join a select cohort of exceptional doctoral researchers and contribute to advancing AI and Computer Science through impactful research. The application deadline is April 30, 2026, with interviews scheduled between May 1–15, 2026. Applications can be submitted at https://plaksha.edu.in/phd. We would appreciate it if you could share this opportunity with students or colleagues who may be interested. —————————— ********************************************************** * * 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] iAIMS 2026: The International Conference on Artificial Intelligence Models and Systems Conference, Barcelona, Spain

*The International Conference on Artificial Intelligence Models and Systems (iAIMS 2026)* 16-20 November 2026 | Barcelona, Spain *Hybrid Conference* *Technically sponsored by IEEE Spain section* https://aims-conference.ai/2026/ The Artificial Intelligence Models and Systems Conference (iAIMS 2026) is a lively and inclusive gathering where researchers, academics, and industry professionals from across the globe come together to explore the latest advancements in artificial intelligence and intelligent systems. As AI continues to reshape industries and push the boundaries of what’s possible, iAIMS 2026 creates a welcoming space for innovation, collaboration, and idea exchange. iAIMS 2026 serves as a premier platform for researchers, academics, and industry professionals to converge and explore the latest advancements, challenges, and applications in the dynamic fields of Artificial Intelligence Models and Systems. The conference provides a collaborative environment for exchanging ideas, fostering innovation, and promoting interdisciplinary research at the intersection of these transformative domains. *iAIMS 2026 Symposia* Authors are encouraged to submit their work to one of the following 20 specialized symposiums, each targeting a key research frontier: 1. Advancements in Artificial Intelligence 2. Cutting-Edge Machine Learning Techniques 3. Innovations in Computer Vision 4. Breaking Barriers in Natural Language Processing 5. Exploring Generative AI Applications *Publication* *IEEE is a technical sponsor of iAIMS 2026*. All accepted papers in iAIMS 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 *Submission Guidelines:* Papers submitted to iAIMS must be the original work of the authors. They may not be simultaneously under review elsewhere. Publications that have been peer-reviewed and have appeared at other conferences or workshops may not be submitted to iAIMS. Authors should be aware that IEEE has a strict policy with regard to plagiarism https://www.ieee.org/publications/rights/plagiarism/plagiarism-faq.html The authors' prior work must be cited appropriately. *Submission Link: **https://conferences.sparcly.ai/iAIMS2026* <https://conferences.sparcly.ai/iAIMS2026> *Organizing Committee* Honorary Chairs - Jaime Lloret Mauri, Universidad Politécnica de Valencia, Spain - Jose Luis Muñoz-Tapia, Universitat Politècnica de Catalunya, Spain General Co-Chairs - Christiancarmine Esposito, University of Salerno, Italy - Attila Kertész, University of Szeged, Hungary - Vlado Stankovski, University of Ljubljana, Slovenia Program Co-Chairs § Javier Berrocal, Universidad de Extremadura, Spain § Safa Otoum, ZU, UAE --Regards, ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] PhD Position: Bridging Theory and Practice in Parallel Graph Algorithms

We have a 4-year PhD position opening at VU Amsterdam on the overlap of theory and systems for parallel graph algorithms. This position will be jointly supervised by Yasamin Nazari (TCS group) and Tiziano De Matteis (Massivizing Computer Systems group). Successful applicants are expected to have a strong background and interest in both theory and programming/systems. For application instructions and more details please see: https://workingat.vu.nl/vacancies/phd-position-bridging-theory-and-practice-in-parallel-graph-algorithms-amsterdam-1288268 ********************************************************** * * 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] Tools for Educational Activities in Logic, a FLoC 2026 Workshop: Final Call for Contributions

Final Call for Contributions for the Workshop Tools for Educational Activities in Logic (TEAL@FLoC'26) https://teal.cs.brown.edu/floc2026/ July 25, 2026, Lisbon, Portugal *** Dear colleagues, We invite contributions to the workshop Tools for Educational Activities in Logic (TEAL), collocated with FLoC 2026. TEAL welcomes work on tools for learning about logic, broadly defined. Our goal is an interactive, community-building workshop, not just another publication venue. Accordingly, we welcome multiple types of contributions including plenary demos, discussion topics, research papers, repeat papers, and experience reports. *Important Dates* Submission deadline: April 29, 2026 (AoE) Author Notification: May 27, 2026 Workshop: July 25, 2026 For more information, see: https://teal.cs.brown.edu/floc2026/ Best wishes, Shriram Krishnamurthi and Thomas Zeume -- Prof. Dr. Thomas Zeume Logic and formal verification Faculty of Computer Science Ruhr University Bochum Universitätsstraße 150 44801 Bochum ********************************************************** * * 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] Simons Institute for the Theory of Computing is accepting new proposals

The Simons Institute invites the worldwide theoretical computer science (TCS) and related communities to submit proposals to organize a research program or cluster at the Simons Institute for Fall 2027 or later. Proposals are due *June 15, 2026*. Proposers are encouraged to contact a member of the Institute leadership in advance of this deadline to get preliminary feedback on the program topic. Proposals may be for standard, semester-long programs, for longer (one-year) programs, for shorter summer clusters, or for more experimental events, such as a short intensive program (a new option available for the first time this year) during a regular academic semester. Proposals should indicate any constraints or preferences for the timing of the program. For more information, see the Call for Research Program Proposals <https://simons.berkeley.edu/participate/how-to-submit-proposal>. Thanks for helping spread the word about this opportunity. -- Sampath Kannan Associate Director Simons Institute for the Theory of Computing ********************************************************** * * 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 Workshops and Tutorials

Dear all, We welcome proposals for workshops and tutorials that fall within the scope of the SPAA community <https://spaa.acm.org/> or address research challenges in related areas/problems that have potential impact on the SPAA community. Proposals will be evaluated on a rolling basis, so early submissions are encouraged and will be reviewed promptly. Please submit proposals to the SPAA 2026 Workshops and Tutorials Chair, Quanquan Liu (quanquan.liu@yale.edu). Proposals should be submitted by April 25, 2026. Proposals should be brief (at most 3 single-column pages). Workshop Proposals: The following information should be included in a workshop proposal: 1. Title 2. Name and email address of the organizer(s) 3. A description of the proposed format and agenda 4. Procedures for selecting participants and presenters Here is a sample template<https://docs.google.com/document/d/15A8DNiWd-qBJsm4GnP1BlUFnXtCZfRaIxjYXm279IQY/edit?usp=sharing> that you may use, although other formats are also acceptable. We welcome workshops that are either invitation-based (example: Workshop on Recent Advances in Parallel and Concurrent Data Structures<https://sites.gatech.edu/spaa24datastr/> in SPAA 2024) or submission-based (example: Highlights of Parallel Computing <https://ucrparlay.github.io/hopc24/> (HOPC) 2024). Tutorial Proposals: Tutorials will be 1 or 1.5 hours long, depending on the number of accepted tutorials and local arrangements. A tutorial proposal should include: 1. Title and abstract 2. An outline of the tutorial content and objectives, with sufficient detail to convey both scope and depth 3. Prerequisite knowledge 4. A very brief biography of the tutorial organizers and relevant information Evaluation Committee: All workshop and tutorial proposals will be evaluated by a committee comprising the following members of the SPAA 2026 organizing committee. * Rezaul Chowdhury (Program Chair) * Quanquan Liu (Workshops and Tutorials Chair) Important Dates: * April 25, 2026: Proposals due * May 10, 2026: Notification of acceptance * July 6, 2026: SPAA workshops/tutorials in London (July 7-10, 2026, SPAA conference) Thank you! Cheers, Quanquan ********************************************************** * * 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 9th DIS Conference -Czech Republic-Final Call for Papers

The *9th International Conference on the Dynamics of Information Systems (DIS 2026)* will take place *May 31 – June 4, 2026* at *Jan Evangelista Purkyně University, Ústí nad Labem, Czech Republic.* *Conference Focus:* DIS 2026 explores cutting-edge topics in information science, AI, machine learning, optimization, operations research, and data-driven applications across diverse domains. *Topics Include (but are not limited to):* - Information science & uncertainty modeling - Optimization & operations research - Machine learning & AI - Data science & computational medical analysis - Quantum information, dynamical systems, and robotics - Applications in economics, energy, environment, and more *Important Dates:* - Submission Deadline: *April 20, 2026 *( Abstract submissions are also welcome at this stage). - Author Notification: Notifications will be sent on a rolling basis - Camera-ready Submissions for LNCS: July 1, 2026 *Plenary Speakers:* - Panos M. Pardalos, <https://scholar.google.com/citations?user=4e_KEdUAAAAJ&hl=en> University of Florida, USA - Peter Richtárik <https://scholar.google.com/citations?user=pGh242UAAAAJ&hl=en>, KAUST, Saudi Arabia - Roman Belavkin, <https://www.mdx.ac.uk/about-us/our-people/staff-directory/dr-roman-belavkin/> Middlesex University, UK - Zbyšek Posel <https://ki.ujep.cz/cs/personalni-slozeni/zbysek-posel/>, UJEP, Czech Republic All accepted papers will be published in *Springer LNCS proceedings*. *Learn More & Contact:* https://dis2026.ujep.cz/ dis2026@rt.ujep.cz ********************************************************** * * 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] 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/ * **********************************************************