[DMANET] GACLM 2026 CFP: IEEE co-sponsored 3rd International Generative AI and Computational Language Modelling Conference, 15 - 18 September 2026 | Abu Dhabi, UAE

[Apologies if you got multiple copies of this invitation] The 3rd International Generative AI and Computational Language Modelling Conference (GACLM 2026) https://gaclm.org/2026/index.php 15 - 18 September 2026 | Abu Dhabi, UAE Hybrid Event and Technically Co-Sponsored by IEEE UAE Section *GACLM 2026 CFP:* With the emergence of Generative AI (GenAI), the world is experiencing a new era of generative models producing various types of data, including textual and visual data. This is accompanied by the unprecedented advancement of Computational Language Modeling (CLM) techniques that are supporting a wide range of downstream applications. Both Generative AI and Computational Language Modeling are leading the paradigm shift we are witnessing in Artificial Intelligence. The International Generative AI and Computational Language Modeling Conference (GACLM) addresses the architectures, applications, challenges, approaches, and future directions of this new era of Artificial Intelligence systems based on GenAI and CLM. We invite the submission of original papers on all topics related to GACLM, with special interest in, but not limited to, the following: · Human-Centered Generative AI · Natural Language Processing (NLP) · Large Language Models (LLMs) · Text generation, summarization, and question answering · Sentiment analysis, misinformation detection, and emotion detection · Machine translation and multilingual models · Language comprehension, grammar and style checking, and complex reasoning · Document processing and information retrieval · Computer-Assisted Language Learning · Adversarial machine learning and applications · Generative adversarial networks (GANs) · GenAI and diffusion models · Federated and distributed learning for GenAI · Fine-tuning and retrieval-augmented generation (RAG) · Synthetic data generation and data augmentation · Explainable AI (XAI) and trustworthy AI systems · GenAI in healthcare, education, robotics, and smart cities · GenAI for cybersecurity and Internet of Things (IoT) systems · GenAI for sustainability and human good · Computer vision, creative applications, and video generation · GenAI ethics and governance *Submissions Guidelines and Proceedings* Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11" two-column format. All papers should be in PDF format, and submitted electronically at Paper Submission Link. A full paper can be up to 8 pages (including all figures, tables and references). Submitted papers must present original unpublished research that is not currently under review for any other conference or journal. Papers not following these guidelines may be rejected without review. Also submissions received after the due date, exceeding length limit, or not appropriately structured may also not be considered. Authors may contact the Program Chair for further information or clarification. All submissions are peer-reviewed by at least three reviewers. Accepted papers will appear in the GACLM Proceeding, and be published by the IEEE Computer Society Conference Publishing Services and be submitted to IEEE Xplore for inclusion. *Important Dates:* - Paper Submission: *May 15, 2026* - Notification to Authors: July 10, 2026 - Camera Ready Submission: July 30, 2026 *Contact:* Please send any inquiry on GACLM to: info@gaclm.org ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] 3rd Copenhagen School of Stochastic Programming August 19-21

Dear colleagues, Please forward the following message to potentially interested PhD students. The 3rd Copenhagen School of Stochastic Programming will take place at the University of Copenhagen from August 19th to August 21st, 2026. The PhD School provides an introduction to Stochastic Programming given by leading experts on the subject. Participants have the possibility of earning 2 ECTS upon successful completion of the course. Confirmed lecturers: * Ward Romeijnders (University of Groningen) * Stein Wallace (Norwegian School of Economics) * Milos Kopa (Charles University in Prague) * Miguel Lejeune (The George Washington University) For registration and more information visit https://www.math.ku.dk/english/calendar/events/cssp_3/ or contact the organizers: * Giovanni Pantuso: gp@math.ku.dk * Trine Boomsma: trine@math.ku.dk ********************************************************** * * 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] 31st British Combinatorial Conference 2026 - in the Land of Dragons (Cardiff, Wales)

31st British Combinatorial Conference 2026 - in the Land of Dragons (Cardiff, Wales) CALL FOR PARTICIPATION 31st British Combinatorial Conference Monday, 6 July – Friday, 10 July 2026 Cardiff University, Cardiff, Wales Conference website: https://sites.google.com/view/bcc2026/home ABOUT The British Combinatorial Conference (BCC) is held every two years at a UK university. It features nine plenary speakers, covering a broad range of topics in combinatorial mathematics, alongside several mini-symposia on more specialised topics, and contributed talks. The conference also traditionally includes a social programme, such as a music concert. Mini-symposia: * Additive combinatorics * Combinatorial designs and algebraic combinatorics * Combinatorial optimisation * Extremal combinatorics * Matroids and combinatorial geometry * Probabilistic combinatorics IMPORTANT DATES Submission deadline: May 10, 2026 Early registration deadline: May 17, 2026 Registration deadline: June 14, 2026 REMARKS The registration fee covers, in particular, coffee breaks and lunches. Accommodation is not included. A limited number of reasonably priced rooms in university residences are available to book via the conference registration page. ********************************************************** * * 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, SISAP 2026: 19th Int. Conf. on Similarity Search and Applications

============================================================================ ==== 19th International Conference on Similarity Search and Applications, SISAP 2026 October 14-16, 2026, Brno, Czech Republic CORE Rank B conference, https://www.sisap.org/2026/ Topics in brief: Learned Similarity, Embeddings, Vector Databases, Scalable Retrieval, Multimedia and Multimodality, Similarity Models and Theory, Demos and Applications ============================================================================ ==== **Important Dates** Regular paper deadline: May 29, 2026 Demonstration and Doctoral Symposium paper deadline: June 17, 2026 SISAP Indexing Challenge: June 17, 2026 **Scope** The International Conference on Similarity Search and Applications (SISAP) focuses on research in similarity-based data management and retrieval, with emphasis on embedding-based methods, vector databases, and machine-learning-driven similarity search. SISAP covers similarity models, indexing and query processing, scalable and distributed similarity systems, learned and adaptive techniques, and similarity-aware database architectures supporting high-dimensional and multimodal data. Originating from metric indexing research, SISAP is the only international conference dedicated exclusively to similarity search, spanning theory, systems, evaluation, and applications across data management, information retrieval, and machine learning. **Topics of Interest** The SISAP conference solicits original research contributions on similarity search and its applications. Topics of interest include, but are not limited to: Similarity Models and Theory . Models of similarity and dissimilarity in metric and non-metric spaces . Intrinsic dimensionality, concentration phenomena, hubness, and discriminability . Manifolds, embeddings, and geometric properties of similarity spaces . Theoretical foundations and limits of similarity search and indexing Learning and Representations . Feature extraction and representation learning for similarity search . Metric learning and learned similarity measures . Embeddings from self-supervised and foundation models . Multimodal and cross-modal similarity representations Similarity Queries and Processing . Similarity queries and operators (k-NN, range, reverse NN, top-k, diversity queries) . Exact, approximate, and probabilistic similarity search . Similarity joins, ranking, filtering, and aggregation . Query semantics and languages for similarity-based data . Cross-modal similarity search Indexing and Scalable Systems . Indexing and access methods for similarity search . Graph-based, tree-based, hashing, quantization, and hybrid approaches . Learned and adaptive index structures . Parallel, distributed, and GPU-accelerated similarity processing . Dynamic, streaming, and update-aware similarity systems Similarity-Aware Data Management . Similarity search in database and data management systems . Vector databases and similarity-native storage engines . Query optimization and execution for similarity workloads . Integration of similarity search with relational, graph, and hybrid systems . Cloud-native and large-scale similarity services Evaluation and Benchmarks . Evaluation methodologies and cost models for similarity processing . Benchmark datasets, workloads, and experimental frameworks . Accuracy-efficiency trade-offs and reproducibility Applications . Similarity search in multimedia, scientific, industrial, and emerging data domains . Similarity search in healthcare, sports, robotics, security, and other fields . Dense retrieval and semantic search . Recommendation systems and personalization . Search and question-answering within content collections ============================================================================ ==== **Regular Papers** Full papers (from 9 to 14 pages in Springer LNCS format) are expected to be descriptions of complete technical work, whereas short papers (of up to 8 pages) can describe innovative approaches or preliminary results which may nevertheless require more work to mature. Vision papers and other position papers should be submitted as short research papers. Page limits include references. Any appendices, if needed, can only be posted online, and the reviewers are not expected to take them into account. **Demonstration Papers** Demonstration papers (of up to 8 pages in Springer LNCS format) should provide the motivation for the demonstrated concepts, the information about the technology and the system to be demonstrated, and should state the significance of the contribution. Evaluation criteria for the demonstration proposals include: novelty, technical advances and challenges, and the overall practical attractiveness of the demonstrated system. A demonstration submission consists of a paper and an additional 1-page appendix (in PDF format) that illustrates how the demo will be conducted on-site at SISAP. This additional content will not be published in the conference proceedings, should the submission be accepted. **Doctoral Symposium Papers** A submission to the doctoral symposium consists of a paper and an additional 1-page appendix (both in PDF format), which must be single-author and written by the student alone. The paper should be no longer than 6 pages in Springer LNCS format (plus up to 2 pages of references). The paper must describe the problem being addressed, an outline of the planned methodology, contributions made so far, and the work lying ahead as part of the author's PhD study. The additional 1-page appendix will not be published in the conference proceedings, should the submission be accepted. This appendix should describe the benefits that would be obtained by attending the doctoral symposium, namely the student's motivation to attend SISAP, and their advisor's word on how the student would benefit by attending the Doctoral Symposium. ============================================================================ ==== **SISAP Indexing Challenge** SISAP Indexing Challenge is an event for researchers and practitioners aimed at advancing the state-of-the-art in large-scale similarity data management. The challenge provides a platform to showcase innovative solutions and push the boundaries of efficiency and effectiveness in indexing, filtering, and searching. The results provide valuable comparisons of competing approaches and their implementations from given viewpoints and environments. It is expected that participants prepare a detailed report of their solution and results in a typical SISAP's short-paper format, which will be included in the LNCS proceedings of SISAP 2026. Learn more: https://www.sisap.org/2026/indexingchallenge.html ============================================================================ ==== Dr. Vasileios Mezaris Research Director Head of Intelligent Digital Transformation Laboratory Information Technologies Institute (ITI) Centre for Research and Technology Hellas (CERTH) 6th Km Charilaou-Thermi Road P.O. Box 60361, 57001 Thermi-Thessaloniki, Greece Tel: +30 2311 257770, email: bmezaris@iti.gr web: <http://www.iti.gr/~bmezaris> http://www.iti.gr/~bmezaris CONFIDENTIALITY NOTICE: The information in this email and any attachments thereto are confidential, except where the e-mail specifically states that its contents can be disclosed, and is intended solely for the use of its intended recipient(s). It may also be subject to legal privilege or otherwise protected from disclosure. If you are not the intended recipient of this communication, you are hereby notified that any disclosure, copying, distribution, or use of the information contained in or attached to this e-mail is strictly prohibited. Please refrain from disclosing its contents to any third party, but notify the sender immediately and make sure to delete and permanently destroy the e-mail (including any attachments thereto) from your filing systems. Internet communications are not secure and therefore sender/CERTH does not accept any liability for the contents of this message and for any damage whatsoever that may be caused by viruses. ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] HALG 2026 in Stockholm - early registration ends May 4

Dear colleagues, Registration is now open for the 11th IGAFIT Highlights of Algorithms Conference (HALG 2026) Stockholm, June 8–10, 2026 https://2026.highlightsofalgorithms.org/index.html Early registration ends May 4th, 2026, Stockholm time. Students: 1600 SEK (around 150 Euro). Non-students: 2300 SEK (around 210 Euro). Student rates are only valid for: PhD students, Bachelor's- and Master's degree students. Registration includes lunch vouchers all three days of the conference, coffee breaks with pastries, and sandwiches. The IGAFIT Highlights of Algorithms (HALG) conference is a forum for presenting highlights of recent developments in algorithms and for discussing potential further advances in the area. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks, as well as opportunities for researchers and students to present their recent results through short talks and poster presentations. Attending HALG 2026 will also provide opportunities for networking and meeting leading researchers in algorithms. We have an amazing list of invited survey and paper speakers (see homepage). Cheers, Ioana Bercea (KTH Royal Institute of Technology) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Call for papers - ICFNDS 2026

CALL FOR PAPERS The <https://dl.acm.org/conference/icfnds> 10th International Conference on Future Networks & Distributed Systems Shaping the Next Era of Intelligent Connectivity and Distributed Intelligence The Premier Conference on Smart Next-Generation Networking Technologies July 27 - 29, 2026, Bodrum, Turkey Hybrid Conference The 10th International Conference on Future Networks and Distributed Systems (ICFNDS) <https://dl.acm.org/conference/icfnds> serves as a premier international forum for researchers, academics, industry professionals, and practitioners to present and discuss the latest innovations, trends, challenges, and solutions in the fields of future networks and distributed systems. As digital infrastructures continue to evolve rapidly, the conference highlights the growing importance of intelligent, scalable, secure, and resilient networked systems that support emerging applications across industry, government, healthcare, smart cities, transportation, and beyond. ICFNDS 2026 aims to bring together a diverse global community to exchange ideas on both theoretical advances and practical implementations, covering a wide spectrum of topics ranging from core networking technologies and distributed computing architectures to cutting-edge paradigms such as AI-driven networking, edge-cloud continuum, 6G, IoT ecosystems, cyber-physical systems, blockchain-enabled infrastructures, network security, and trustworthy distributed intelligence. The conference welcomes original, high-quality, and unpublished research contributions addressing fundamental challenges, novel methodologies, experimental studies, prototype implementations, and real-world industrial experiences. By fostering collaboration between academia and industry, ICFNDS 2026 seeks to accelerate innovation and shape the future of interconnected and distributed digital systems. As the conference celebrates its 10th edition, ICFNDS 2026 provides a unique opportunity to reflect on the progress made in the field while exploring new directions for next-generation networked and distributed environments that are more adaptive, efficient, sustainable, and human-centered. Important Dates - Final Paper Submission: May 31, 2026 - Notification of Acceptance: June 25, 2026 - Camera Ready Paper: July 10, 2026 - Authors Registration: July 15, 2026 - Conference Date: July 27 – 29, 2026 [image: ACM_ICFNDS_2026_CFP.png] Abdulrezzak Zekiye <https://mysite.ku.edu.tr/azakieh22/> Ph.D. Candidate in Computer Engineering, Koç University. *Researching the usage of blockchain and federated learning in the Internet of Energy field.* Google Scholar <https://scholar.google.com/citations?hl=en&user=qyfAhNAAAAAJ> | ResearchGate <https://www.researchgate.net/profile/Abdulrezzak-Zekiye>| LinkedIn <https://www.linkedin.com/in/abdulrazak-zakieh/> ********************************************************** * * 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] [NCMA 26] NCMA-2026 Rouen, France — Call for full and short papers

16th International Workshop on "Non-Classical Models of Automata and Applications" (NCMA 2026) June 29-30, 2026, Rouen, France https://dlt-ncma-2026.sciencesconf.org/ ************************************************************************* Extended Deadline : April 25, 2026 ************************************************************************* NCMA (since 2009) is a workshop series devoted to research on non-classical models of automata and grammar-like devices, covering both theoretical foundations (descriptional complexity, decidability, complexity) and applications (bio-computing, document processing, self-assembly, etc.). NCMA aims to bring together researchers studying novel or extended computational models, their properties and applications. Topics for NCMA 2026 include (but are not limited) to : - Formal models inspired by linguistics, bio-computing, text processing, document engineering, self-assembly, etc., - Bio-inspired models of automata and generative devices, - Cellular automata, - Forgetting automata and restarting automata, - Automata with additional resources, - Regulated rewriting/automata, - Networks of automata or generative devices, - Models of cooperation and communication, - Quantum automata, - Automata in the framework of membrane computing, - Complexity aspects for formal systems. Important dates (all dates are to be understood AoE) ---------------------------------------------------------------------- * Extended Deadline for submissions: April 20, 2026 * Notification of acceptance: May 18, 2026 * Informal presentation submission deadline: May 22, 2026 * Informal presentation notification: May 29, 2026 * Deadline for all final papers: June 8, 2026 * Conference: June 29-30, 2026 Submissions and Proceedings --------------------------- Authors are invited to submit full papers of up to 16 pages or short papers of up to 8 pages in electronic form (PDF). The proceedings for full papers will appear in an EPTCS volume, while short papers appear as parts of a technical report. Contributed papers should be written in EPTCS format and should be submitted through Easychair. Short papers (written in EPTCS format) may be sent to the conference email address Proofs omitted due to space constraints may be put into an appendix that will be read by the reviewers at their discretion. All papers will be reviewed by at least three referees, and simultaneous submissions to other conferences or workshops with published proceedings are not allowed. Papers should be submitted electronically in PDF through the EasyChair system: https://easychair.org/my2/conference?conf=ncma2026 Invited Speakers ---------------------- Beatrice Palano (Milan, Italie) Abuzer Yakaryilmaz (University of Latvia) Program Committee --------------------------- Martin Berglund (Umeå, Sweden) Cezar Campeanu (Charlottetown, Canada) (co-chair) Giuseppa Castiglione (Palermo, Italy) Pamela Fleischmann (Kiel, Germany) Zsolt Gazdag (Szeged, Hungary) Yo-Sub Han (Seoul, South-Korea) Zbyněk Křivka (Brno, Czech Republic) Martin Kutrib (Giessen, Germany) (co-chair) Sylvan Lombardy (Bordeaux, France) (co-chair) Ian McQuillan (Saskatoon, Canada) František Mráz (Prague, Czech Republic) Benedek Nagy (Famagusta, Cyprus) Florent Nicart (Rouen, France) Beatrice Palano (Milano, Italy) Luca Prigioniero (Loughborough, UK) Rogério Reis (Porto, Portugal) and Agustín Riscos-Núñez (Sevilla, Spain) Hellis Tamm (Tallinn, Estonia) Brink van der Merwe (Stellenbosch, South Africa) Local Information: ------------------------ The workshop will take place in Rouen (France). NCMA 2026 will be co-located with DLT 2026: 30th International Conference on Developments in Language Theory (June 30 - July 3, 2026). Contact: --------- email: comite.organisation.dlt.ncma.2026@listes.univ-rouen.fr web : https://dlt-ncma-2026.sciencesconf.org/ ------------------------------------------------------------ Apologize if you have received multiple copies of this message. ------------------------------------------------------------     ********************************************************** * * 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] SPAA Workshops and Tutorials [Deadline Soon]

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] Call for Papers: Workshop on Social Choice and Learning Algorithms at IJCAI 2026

Call for Papers: Workshop on Social Choice and Learning Algorithms at IJCAI 2026 We are delighted to announce that the 3rd Workshop on Social Choice and Learning Algorithms (SCaLA-26) will take place at IJCAI during August 2026 in Bremen, Germany. It will feature technical sessions, a keynote speaker, and opportunities to forge collaborations between researchers working in social choice and those working in machine learning. The website and submission instructions can be found at the following link: https://sites.google.com/view/scala26 The submission deadline is May 8, 2026. We encourage submissions of fully developed research projects, or extended abstracts representing preliminary explorations of novel ideas. Submissions should include components from both fields of social choice and machine learning (or closely related topics). Topics of interest include (but not limited to): - Computational social choice - Fair Division - Matching - Voting theory - Sortition - Clustering - Ensemble learning - Explainable ML - Language models - Learning preferences - PAC-learning Examples of interesting connections between these topics include, but are not at all limited to: - Using machine learning to learn new mechanisms for matching - Novel uses of social choice for ensemble learning - Exploring the application of fair division concepts to clustering problems, or vice-versa - Applying multi-winner voting concepts to multi-class classification tasks Organizing Committee Ben Armstrong Saar Cohen Nicholas Mattei Zoi Terzopoulou -- *Nicholas Mattei* Associate Professor, Tulane University nsmattei@tulane.edu | www.nickmattei.net Stanley Thomas Hall | 305B +1 504 247 1416 Department of Computer Science Tulane University 6823 St Charles Ave New Orleans, LA 70118 ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Postdoc position at IDSIA, Lugano: SOS and Approximation Algorithms

Postdoctoral Position in Theoretical Computer Science IDSIA USI-SUPSI, Lugano (Switzerland) The Algorithms and Complexity Group at IDSIA (Lugano) invites applications for a PostDoc position under the supervision of Prof. Monaldo Mastrolilli. PROJECT The position is supported by the Swiss National Science Foundation (SNSF) project n. 200021_207429: "Ideal Membership Problems and the Bit Complexity of Sum of Squares Proofs". Research focus: - Bit complexity of Sum of Squares (SoS) proofs and ideal membership problems. - Design of Approximation Algorithms using SoS and SDP techniques. OFFER - Duration: 6 months initially, renewable. - Start date: ASAP. - Salary: Approx. 80,000 CHF/year (low taxes). - Benefits: No teaching duties, generous travel support. - Environment: IDSIA offers an international research environment in Lugano. REQUIREMENTS - Ph.D. in Computer Science, Mathematics, or related fields. - Solid track record in TCS. APPLICATION Please email a CV and contact details of 2-3 references to: Prof. Monaldo Mastrolilli (monaldo.mastrolilli@supsi.ch) ********************************************************** * * 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] Algorithms and Complexity Workshop @ Warwick, July 3, 2026

---------------------------------------------------------------------------------------------------- Workshop Algorithms & Complexity @ Warwick Website: https://sites.google.com/view/algorithmscomplexitywarwick3/home July 3, 2026 - University of Warwick (UK) Registration Deadline: May 31, 2026 ---------------------------------------------------------------------------------------------------- Dear all, The workshop Algorithms & Complexity @ Warwick will be held at the University of Warwick on July 3, 2026 (see https://sites.google.com/view/algorithmscomplexitywarwick3/home for more details). The aim of the event is to highlight several recent exciting advances in the field of Algorithms and Complexity and to facilitate interactions within the research community. We hope that it will provide an excellent opportunity for Theory researchers - including academics, postdocs, and students - to connect and collaborate. Attendance is free, but registration is required to assist with local arrangements/catering. Please note that registration closes on 31 May. The online registration form is available on the website of the event. We hope to see many of you there! Organisers: Sayan Bhattacharya, Artur Czumaj, and Igor Oliveira ********************************************************** * * 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] CASC 2026 [Extended Deadline] - Last Call for Papers

The 28th International Workshop in Computer Algebra in Scientific Computing CASC 2026 Bath, UK 31 August - 4 September 2026 http://www.casc-conference.org LAST CALL FOR PAPERS ############################################################ Note: the deadline for submitting has been extended to May 4th, 2026. The tools of Scientific Computing play an important role in the natural sciences and engineering. Computer Algebra Systems and the underlying algorithms for Symbolic Computation play an increasingly important role within Scientific Computation. The CASC workshop series has been running for two and a half decades to explore the interaction of these topics, their implementation, and their application. The 28th CASC workshop will be held in Bath, UK from 31st August - 4th September 2026. There will be three invited talks, along with a program of contributed talks for which we now invite submissions. ##################################### SCOPE ##################################### The topics addressed in the workshop cover the following. (1) The theory of symbolic computation and its implementation in computer algebra systems. This includes, but is not limited to: - new methods in exact computation; - symbolic algorithms and their complexity; - automated reasoning in algebra and geometry; - parallel symbolic / symbolic-numeric computation; - symbolic / symbolic-numeric methods for differential, differential-algebraic and difference equations; - symbolic / symbolic-numeric methods for polynomial equations and inequalities; and - the embedding of computer algebra technology within different software and hardware environments. (2) All other areas of scientific computing in regards to their benefit from or use of computer algebra methods and software. This includes, but is not limited to: - the use of computer algebra in approximate computation; - computer algebra methods in big data analytics; and - computer algebra methods for simulation and modelling. (3) Applications of the above throughout the natural sciences and engineering. We welcome papers on both fundamental research and implementation issues. We also accept survey papers but these MUST BE CLEARLY LABELLED as such in the title. ##################################### CONFERENCE PARTICIPATION OPTIONS ##################################### We encourage wide participation at the workshop. In light of this, and that the conference scope spans computer science and mathematics (with their different publication traditions), we offer a variety of participation options. 1. Participation with an accompanying paper in LNCS: CASC has a long running relationship with the Springer book series Lecture Notes in Computer Science to publish conference proceedings. Work submitted here should contain an original research result. Submissions should be prepared in the LNCS style and not exceed 20 pages. Survey papers may have up to 25 pages. 2. Participation with abstract only: Participants may opt to submit an extended abstract instead. These should have at least 2 and at most 4 pages in the LNCS style. They must contain the main results of the talk (without proofs). They will be lightly reviewed and distributed locally at the conference. We see three main audiences for this option: - Those who wish to talk on previously published work (in which case that work should be clearly cited in the abstract). - Those whose work is not yet ready for publication, but wish to receive feedback. - Those who plan to submit a journal paper on the work shortly. For the second group, there will be a subsequent journal special issue call after the conference (see below). ##################################### SUBMISSION LINK ##################################### All submissions should be done via easychair: https://www.easychair.org/conferences/?conf=casc2026 Submissions must be prepared in the LNCS style and within the declared page count. ##################################### IMPORTANT DATES ##################################### Paper submission deadline: May 4th, 2026 Notification to Authors: May 31st, 2026 Submission of Final Version: June 5th, 2026 Conference: August 31 – September 4, 2026 ##################################### ACCOMPANYING SPECIAL ISSUE OF MATHEMATICS IN COMPUTER SCIENCE ##################################### CASC has formed a relationship with the Springer Birkhäuser journal Mathematics in Computer Science (MCS) for an ongoing series of special issues on topics presented at CASC. Work submitted here must be of journal quality and will be reviewed to the usual standards of MCS. Submission will be opened after the conference for authors of extended abstracts presented at that year’s conference. There is no a priori page limit, but the length must be justified by the contents of the paper. At notification authors may be asked to revise their paper for a secondary deadline. Deadline for MCS Special Issue submission: Autumn 2026 MCS submission is only open if an extended abstract is presented at the conference - eligible authors will be sent a separate submission link for this after the conference. ##################################### INVITED TALKS ##################################### Carsten Schneider, Director of Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria Joseph Tooby-Smith, University of Bath, UK Thi Xuan Vu - Université de Lille, France ##################################### COMMITTEES ##################################### Program Committee Chairs Ali Kemal Uncu - University of Bath, UK Chenqi Mou - Beihang University, China Program Committee Francois Boulier - Université de Lille, France Florent Bréhard – Laboratoire CRIStAL, France Changbo Chen - Chinese Academy of Sciences, China Victor F. Edneral - Lomonosov Moscow State University, Russia Matthew England - Coventry University, UK Jonathan Hauenstein - University of Notre Dame, USA Rui-Juan Jing - Jinagsu University, China François Lemaire – Laboratoire CRIStAL, France Fatemeh Mohammadi – KU Leuven, Belgium Michael Monagan - Simon Fraser University, Canada Marc Moreno Maza - University of Western Ontario, Canada Chenqi Mou - Beihang University, China Katsusuke Nabeshima - Tokyo University of Science, Japan Sonia Perez-Diaz - Universidad de Alcala, Spain Daniel Robertz - RWTH Aachen University, Germany Timur Sadykov - Plekhanov Russian University, Russia Éric Schost - University of Waterloo, Canada Thomas Sturm - CNRS, France Sergue Vinitsky - Joint Institute for Nuclear Research, Russia Victor Selivanov - A.P. Ershov Institute of Informatics Systems, Russian Academy of Sciences, Russia Svetlana Selivanova - KAIST, South Korea Akira Terui - University of Tsukuba, Japan Ali Kemal Uncu - University of Bath, UK General Chairs François Boulier – University of Lille, France Timur Sadykov - Plekhanov Russian University, Russia Publicity Chairs Thi Xuan Vu - Université de Lille, France Dmitry Lyakhov - KAUST, Saudi Arabia Advisory Board Wolfram Koepf - University of Kassel, Germany Ernst W. Mayr - Technical University of Munich, Germany Werner M. Seiler - University of Kassel, Germany Evgenii V. Vorozhtsov - Khristianovich Institute of Theoretical and Applied Mechanics, Russia Local Organisation James Davenport - University of Bath, UK Ali Kemal Uncu - University of Bath, UK ********************************************************** * * 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] One-day Workshop on Randomness in Computing at Sheffield

Hi, We are pleased to announce a one-day workshop on *Randomness in Computing*, to be held at the University of Sheffield on *June 30, 2026*. The workshop aims to bring together researchers in theoretical computer science interested in randomness and its role in computation, including topics such as randomized algorithms, pseudorandomness, probabilistic methods, and complexity theory. More information (including the schedule and registration) is available at: https://sites.google.com/view/fox-sheffield-2026 The programme will include *five invited talks* and a *session of short talks by junior researchers*. Attendance is free, but registration is required for planning purposes. Best, Parinya ********************************************************** * * 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] MFCS 2026 - Last Call for Papers

======================================================== MFCS 2026 - Last Call for Papers ======================================================== The **51th conference on Mathematical Foundations of Computer Science** (MFCS) will take place in: Paris, France August 24th-28th, 2026 **MFCS** is among the conferences with the longest history in the field — the first conference in the series was held already in 1972. Traditionally, the conference moved between the Czech Republic, Poland, and Slovakia; since 2013, the conference has traveled around Europe. The conference will be preceded, on August 23, by the **Young Research Forum Workshop** intended for students and postdocs. The workshop will start at 13:00 and will feature talks/discussions around different topics related to research and academic life. After the workshop, there will be a social event with board games. NEW: Up to **10 papers** will be accepted by the program committee, for which **no presence onsite** of an author is required. In this case, a reduced fee will be applied. ======================================================== Important dates and information ======================================================== Submissions: April 24th, 2026 Author notification: June 19th, 2026 Camera-ready version: June 26th, 2026 Conference: August 24th-28th, 2026 (YRF Workshop on August 23rd, afternoon) Deadlines are firm; late submissions will not be considered. All dates are AoE. Conference website: https://mfcs2026.irif.fr/ ======================================================== Invited Speakers ======================================================== Jakub Orpšal (University of Birmingham, UK) Damien Pous (CNRS, ENS Lyon, France) Noga Ron-Zewi (University of Haifa, Israel) Tatiana Starikovskaya (ENS Paris, France) Ryan Williams (MIT, USA) ======================================================== Submission guidelines ======================================================== 1) Papers must present original research on the theory of computer science. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as arXiv. 2) Submissions take the form of an extended abstract of up-to 12 pages (LIPIcs document class), excluding a separate title page, references and a clearly labelled appendix. The appendix may consist either of omitted proofs or of a full version of the submission, and it will be read at the discretion of program committee members. The extended abstract has to present the merits of the paper and its main contributions clearly, and describe the key concepts and technical ideas used to obtain the results. Submissions must provide the proofs which can enable the main mathematical claims of the paper to be verified. 3) Submissions authored or co-authored by members of the program committee are allowed. 4) At the time of submission, authors may declare that they are unable to attend the conference in Paris and therefore cannot give an in-person presentation. This choice will not influence the evaluation of submissions by the Program Committee. The Program Committee will rank all papers irrespective of their presentation status. Approximately 80 papers will be selected for in-person presentation, and up to 10 papers will be accepted without presentation. All accepted papers will be published in the same proceedings. This option is intended for authors who wish to publish their results at the conference but, for various reasons (e.g., family or financial constraints), are unable to attend the conference in person. 5) At least one author of each accepted paper with presentation is expected to register for the conference, and give the talk in-person. At least one author of each accepted paper without in-person presentation is expected to register for the conference for a reduced fee, and for each such paper the authors are expected to provide a pre-recorded video of the paper presentation that will be made available on-line during the conference. (Pre-recorded videos of the other papers are optional.) 6) Papers authored only by students should be marked as such at the time of submission in order to be eligible for the best student paper award. 7) MFCS proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. The camera-ready version of accepted papers will need to comply with the LIPIcs style. 8) All submissions should be made via HotCRP at https://mfcs26.hotcrp.com/. ======================================================== MFCS 2025 Programme Committee ======================================================== Michal Koucký (Charles University, Czech Republic) - chair Daniela Petrișan (Université Paris Cité, IRIF, France) - co-chair C. Aiswarya (Chennai Mathematical Institute, India) Christel Baier (Technische Universität Dresden, Germany) Ivona Bezáková (Rochester Institute of Technology, USA) Markus Bläser (Saarland University, Germany) Achim Blumensath (Masaryk University, Czech Republic) Martin Böhm (University of Wrocław, Poland) Édouard Bonnet (CNRS, ENS de Lyon, France) Joshua Brakensiek (University of California, Berkeley, USA) André Chailloux (Inria de Paris, France) Panagiotis Charalampopoulos (King's College London, UK) Lorenzo Clemente (University of Warsaw, Poland) Ugo Dal Lago (University of Bologna, Italy) Debarati Das (Pennsylvania State University, USA) Samir Datta (Chennai Mathematical Institute, India) Jakub Gajarský (Masaryk University and University of Warsaw, Czech Republic/Poland) Anna Gál (University of Texas at Austin, USA) Sumegha Garg (Rutgers University, USA) Mayank Goswami (City University of New York, USA) Florian Horn (Université Paris Cité, IRIF, CNRS, France) Dušan Knop (Czech Technical University, Czech Republic) Hanna Komlos (Max Planck Institute for Informatics, Germany) Stephan Kreutzer (TU Berlin, Germany) Bruno Loff (University of Lisbon, Portugal) Wolfgang Merkle (Heidelberg University, Germany) Igor Carboni Oliveira (University of Warwick, UK) Kristýna Pekárková (AGH University of Krakow, Poland) Thomas Place (University of Bordeaux, LABRI, France) Cécilia Pradic (Swansea University, UK) Jakub Przybyło (AGH University of Krakow, Poland) Colin Riba (ENS de Lyon, LIP, France) Kilian Risse (Lund University, Sweden) Robert Robere (McGill University, Canada) Michał Skrzypczak (University of Warsaw, Poland) Paweł Sobociński (TalTech, Estonia) Henning Urbat (FAU Erlangen-Nürnberg, Germany) Pavel Veselý (Charles University, Czech Republic) Philip Wellnitz (National Institute of Informatics, Japan) Sarah Winter (Université Paris Cite, IRIF, CNRS, France) James Worrell (University of Oxford, UK) Standa Živný (University of Oxford, UK) ========================================== ********************************************************** * * 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 Positions in Quantum Software and Quantum Communication at Aalborg University

The Department of Computer Science at Aalborg University (Denmark) offers two postdoc positions in quantum software and quantum communication. The application deadline is May 25. The starting date is negotiable (earliest August 1). See the following application link for more details: https://aau.varbi.com/en/what:job/jobID:927231/ Best regards, Christian Schilling christianms@cs.aau.dk ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] PhD position in algorithms at Bocconi University in Milan

A PhD position in algorithms is available in the theory group at Bocconi, supervised by Adam Polak. Bocconi University is an amazingly vibrant academic community with leading professors. It is located in central Milan, Italy. A new Computing Sciences department was established four years ago and has already built a strong presence in various areas of CS, including theory: https://cs.unibocconi.eu/research/theory To learn more about life in Milan and Bocconi, check out these posts by Luca Trevisan: https://lucatrevisan.wordpress.com/category/places/bocconi/ Details on eligibility and application procedures are available at: https://www.unibocconi.it/en/programs/phd/admissions Net salary: at least 22000 euros per year (+ possible additions for research and teaching assistantship). Deadline for application: 18 May 2026. Informal enquiries are welcome at adam.polak@unibocconi.it ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] DISC 2026 - Third Call for Papers

===================================== *DISC 2026 Call for Papers* ===================================== 40th International Symposium on Distributed Computing November 9-13, 2026 Rome, Italy https://www.disc-conference.org/wp/disc2026/ ===================================== *DISC Conference Overview* ===================================== The International Symposium on Distributed Computing (DISC) is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. It is organized in cooperation with the European Association for Theoretical Computer Science (EATCS). The symposium was established 41 years ago, in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). DISC 2026 marks the 40th edition of the symposium. To celebrate this special milestone, the conference will include a series of festivities and special events honoring four decades of advances in distributed computing research and the vibrant community that has shaped the field. ===================================== *Important Dates* ===================================== Paper registration: May 27, 2026 Submission deadline: June 1, 2026 Rebuttal phase: July 21-25, 2026 Notification: August 5, 2026 Camera-ready version due date: August 19, 2026 All deadlines are at 23:59 AoE. ===================================== *Scope* ===================================== Submissions are sought in all areas of distributed algorithms and distributed systems, including theory, design, implementation, modelling, analysis, and application of distributed systems and networks. Topics of interest include, but are not limited to: · Biological and nature-inspired distributed algorithms · Blockchain protocols · Distributed and concurrent data structures, replication and consistency · Distributed graph algorithms · Distributed machine learning and data science · Distributed operating systems, middleware, database systems · Experimental evaluation of distributed algorithms and systems · Fault tolerance, reliability, availability · Formal methods for distributed computing: verification, synthesis and testing · Game-theoretic and knowledge-based approaches to distributed computing · High-performance, cloud and grid computing · Internet and Web applications, social networks and recommendation systems · Mobile agents, autonomous distributed systems, swarm robotics · Multiprocessor and multi-core architectures and algorithms · Population protocols and chemical reaction networks · Quantum distributed algorithms · Security in distributed computing, cryptographic protocols · Self-stabilizing, self-organizing, and autonomous systems · Synchronization, persistence and transactional memory · Wireless, mobile, sensor and ad-hoc networks ===================================== *Submissions* ===================================== A submitted paper 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 submission should strive to be accessible to a broad audience, as well as having sufficient details for experts in the area. There are two types of submissions: regular papers and brief announcements. Regular papers must report on original research that has not previously been published (and may not be concurrently submitted to other journals or conferences with proceedings). All ideas necessary for an expert to fully verify the central claims in a paper, including experimental results, should be included in the submission. A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also present a result that is short and elegant but does not require a longer paper. It may also be used to announce a software distribution or an experimental result of interest that can be concisely described. The title of a brief announcement must start with the phrase "Brief Announcement: ". A paper that is not accepted as a regular paper may be invited as a brief announcement. When requested by the program committee, each author of the submitted paper(s) is expected to prepare a professional review of a non-conflicted DISC 2026 submission that falls within their research expertise. Submission should be done via the following web page: https://disc26.hotcrp.com ===================================== *Submission format* ===================================== Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs ( https://submission.dagstuhl.de/series/details/5#author) with \documentclass[a4paper,anonymous,USenglish]{lipics-v2021}. Submissions must be anonymous, without any author names, affiliations, or email addresses. The contact information of the authors will be entered separately in the submission metadata. For regular papers, there is no page limit, and authors are encouraged to use the “full version” of their paper as the submission. The initial 15 pages, excluding the title page and a table of contents, should contain a clear presentation of the merits of the paper, including a discussion of the paper’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. (Illustrative figures are encouraged.) The submission must contain all necessary details, including full proofs of all claims in the paper. Although there is no bound on the length of a submission, material other than the first 15 pages, excluding the title page and a table of contents, will be read at the committee’s discretion. Papers submitted as brief announcements should comply with the above rules, replacing 15 pages with 5 pages. Submissions not conforming to the submission guidelines and papers outside of the scope of the conference will be rejected without consideration. All accept/reject decisions made by the program committee are final. ===================================== *Use of Large Language Models (LLMs)* ===================================== LLM usage policy for authors: - Only human individuals may be listed as authors. Generative AI tools or any other systems may not be credited as authors or co-authors. All listed authors must take full responsibility for the content of the submission. - The usage of generative AI tools to create new content is permitted, but its use must be explicitly and fully disclosed in the work. Authors may use the following format (if applicable): *AI Disclosure: We used [Tool Name] to assist with [Brief Description of Use]. The tool materially affected [Sections X and Y]. More details can be found in [Section Z]. The authors verified the correctness and originality of all content including references.* - Authors are accountable for the accuracy, originality, and integrity of all material in their paper, including any content produced with AI assistance. This includes responsibility for errors, plagiarism, misrepresentation, or fabricated content (e.g., “hallucinatory” references or fabricated data) generated by such tools. [The above policies have been adopted from similar policies of the recent STOC/FOCS/SPAA/NeurIPS conferences.] Any questions about the LLM use policy should be directed to the PC chair, Keren Censor-Hillel (ckeren@cs.technion.ac.il). ===================================== *Anonymous Submissions* ===================================== We will use a relaxed implementation of double-blind peer review. Submissions must not reveal the identity of the authors in any way. In particular, authors’ names and affiliation should not appear in the document itself. Authors should ensure that any references to their own related work are in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). The purpose of this process is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. You are free to disseminate your work through arXiv and other online repositories and give presentations on your work as usual. Moreover, nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. Brief announcements should also be submitted without author names and affiliations so that a reviewer can form an initial judgment without bias, but they can contain a reference to the full version of the work in the bibliography. Please feel free to ask the PC chair if you have any questions about the double-blind policy of DISC 2026. ===================================== *Conflict of Interest* ===================================== The submission form provides an opportunity to specify conflicts of interest with any of the PC members and other member of research community. A conflict of interest is limited to the following: - A family member or close friend; - A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years; - A person with the same affiliation; - A person involved in an alleged incident of harassment; - Frequent collaborators, or collaborators who have jointly published papers within the last two years. If you feel that you have a valid reason for a conflict of interest beyond listed above, or any other issues related to the fair treatment of your submission, contact the PC chair, Keren Censor-Hillel ( ckeren@cs.technion.ac.il), or the SafeTOC representative for DISC, listed at https://safetoc.org/index.php/toc-advisors/. ===================================== *Participation at DISC* ===================================== It is expected that accepted papers and brief announcements be presented in-person at the conference. ===================================== *Publication* ===================================== The proceedings will be published by LIPIcs. The final version of the paper has to be formatted following the LIPIcs guidelines. Regular papers will have 15 pages in the final proceedings (excluding references), and brief announcements will have 5 pages in the proceedings (including everything). If more space is needed, the authors are encouraged to post the full version e.g. on arXiv and refer to it in their paper. Accepted papers and brief announcements must be presented by one of the authors, with a full registration and according to the final schedule. Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. The best paper at DISC will be considered for publication in the Journal of the ACM. ===================================== *Awards* ===================================== Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper. ===================================== *Organization* ===================================== *Program Committee:* James Aspnes, Yale University, USA Naama Ben-David, Technion, Israel Christian Cachin, University of Bern, Switzerland Armando Castañeda, Universidad Nacional Autónoma de México, Mexico Keren Censor-Hillel, Technion, Israel (Chair) Peter Davies-Peck, Durham University, UK Michal Dory, University of Haifa, Israel Fabien Dufoulon, Lancaster University, UK Constantin Enea, Ecole Polytechnique, France Jeremy Fineman, Georgetown University, USA Leszek Antoni Gąsieniec, University of Liverpool, UK Ran Gelles, Bar-Ilan University, Israel George Giakkouipis, Inria, Rennes, France Seth Gilbert, NUS, Singapore Wojciech Golab, University of Waterloo, Canada Alexey Gotsman, IMDEA Software Institute, Spain Danny Hendler, Ben-Gurion University, Israel Taisuke Izumi, The University of Osaka, Japan Siddhartha Jayanti, Dartmouth College, USA Tomasz Jurdzinski, University of Wroclaw, Poland Petr Kuznetsov, Telecom Paris, Institut Polytechnique de Paris, France Quanquan Liu, Yale University, USA Thomas Locher, DFINITY, Switzerland Giuliano Losa, Stellar Development Foundation, USA Darya Melnyk, TU Berlin, Germany Alessia Milani, Aix-Marseille University, LIS, France Shreyas Pai, IIT Madras, India Boaz Patt-Shamir, Tel Aviv University, Israel Ivan Rapaport, Universidad de Chile, Chile Andrea W. Richa, Arizona State University, USA Peter Robinson, Augusta University, USA Joel Rybicki, Humboldt University of Berlin, Germany Christian Scheideler, Paderborn University, Germany Lili Su, Northeastern University, USA Jukka Suomela, Aalto University, Finland François Taïani, Univ Rennes, Inria, CNRS, IRISA, France Andrei Tonkikh, Aptos Labs, USA Jennifer Welch, Texas A&M University, USA Philipp Woelfel, University of Calgary, Canada Michelle Yeo, Nanyang Technological University, Singapore and Aarhus University, Denmark Leqi Zhu, University of Manitoba, Canada *Conference Committee:* Ioannis Chatzigiannakis, Sapienza University of Rome, Italy (co-Chair) Yannic Maus, TU Graz, Austria (Treasurer) William K. Moses Jr., Durham University, UK (Publicity Chair and Proceedings Chair) Ami Paz, CNRS and Paris-Saclay University, France (Workshops Chair) Andrea Vitaletti, Sapienza University of Rome, Italy (co-Chair) *Steering Committee:* Dan Alistarh, IST, Austria (2024 PC Chair) Hagit Attiya, Technion, Israel (Chair) Keren Censor-Hillel, Technion, Israel (2026 PC Chair) Pierre Fraigniaud, CNRS and Université Paris Cité, France (Vice Chair) Dariusz Kowalski, Augusta University, USA (2025 PC Chair) Alessia Milani, Aix-Marseille University, LIS, France (Member-at-large) Ami Paz, CNRS and Paris-Saclay University, France (Member-at-large) ------ Regards, William K. Moses Jr. Publicity Chair, DISC 2026 https://sites.google.com/view/wkmjr ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] FLoC Workshop CfP: LLM-Solve 2026 - LLMs meet Constraint Solving

CALL FOR PAPERS LLM-Solve 2026: LLMs meet Constraint Solving (2nd Edition) FLoC & CP 2026 Workshop Sunday, July 19, 2026, at ISCTE, Lisbon, Portugal https://submissions.floc26.org/llm-solve/ IMPORTANT DATES Submission deadline: May 15, 2026 Notification: May 25, 2026 Workshop: July 19, 2026 ABOUT LLM-Solve 2026 is a workshop for researchers at the intersection of Large Language Models and Constraint Solving (CP, SAT, SMT, MIP, and related paradigms). LLMs now act as agentic systems that orchestrate multi-step reasoning and tool use, yet they struggle with reliability and formal correctness. Constraint solvers offer provable guarantees but require expertise to formalize problems and select suitable techniques. The opportunity is bidirectional. LLMs can help non-experts with modeling and interactive solving, while constraint solvers can provide execution, verification, and structured reasoning for LLM-driven agents. TOPICS OF INTEREST (not restricted to) - LLMs and agentic systems for constraint modeling and acquisition - LLM-guided solver heuristics and search strategies - Hybrid approaches combining LLMs and constraint solvers - Constraint solvers for improving LLM reasoning and verification - SAT/CP-based methods for controlling or guiding LLM outputs - LLM-driven explanations and interactive constraint solving - Benchmarks, datasets, and evaluation methodologies for LLM-Constraint integration - Real-world applications combining constraint-solving and LLMs SUBMISSIONS Extended abstracts up to 2 pages (excluding references), with an optional appendix of up to 10 pages. Submissions may cover published work, original work, work in progress with preliminary results, or position papers. PDF following LIPIcs guidelines (https://submission.dagstuhl.de/series/details/5#author). All presenters and attendees must register for the FLoC workshop day. Submit: https://submissions.floc26.org/llm-solve/ ORGANIZERS Tias Guns (KU Leuven, Belgium) Serdar Kadıoglu (Brown University, USA) Stefan Szeider (TU Wien, Austria) Dimos Tsouros (UOWM, Greece) FLoC'26: https://www.floc26.org/venue CP'26: https://cp2026.a4cp.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] [CFP] The British Machine Vision Conference (BMVC), Lancaster, UK, 23- 26, Nov 2026

*** Please accept our apologies if you receive multiple copies of this CFP *** ===================================================== CALL FOR PAPERS ****************************************************************** The British Machine Vision Conference (BMVC) 23-26, Nov, 2026, Lancaster, UK https://bmvc2026.bmva.org ****************************************************************** The British Machine Vision Conference (BMVC) is one of the major international conferences on computer vision and related areas. It is organised by the British Machine Vision Association (BMVA). BMVC’26 will be hosted by Lancaster University on 23rd - 26th November 2026. Top papers from BMVC 2026 will be invited to submit extended versions to a special issue of the International Journal of Computer Vision (IJCV). *Key Dates (23:59 AoE)* Abstract Submission Deadline: 22 May, 2026 Paper & Supplementary Submission Deadline: 29 May, 2026 Rebuttal Period: 3 - 10 Jul, 2026 Author Notification of Decisions: 7 Aug, 2026 Camera-Ready Paper Deadline: 28 Aug, 2026 *Please note that the Abstract and Paper/ Supplementary deadlines will not be extended. *Topics of Interest * Authors are invited to submit high-quality papers in image processing, computer vision, machine learning and related areas including, but not limited to: · 3D from X, Shape Modeling and Processing · Action, Event, and Video Understanding · Adversarial Attack and Defense · Biometrics · Computational Photography and Photogrammetry · Computer Vision Theory · Datasets and Evaluation · Deep Learning Architectures and Techniques · Document Analysis · Embodied Vision: Active Agents, Simulation · Explainable, Fair, and Ethical AI · Generative Models · Humans: Face, Gesture, Pose, and Body Movement · Image and Video Retrieval · Low-level and Physics-based Vision · Medical and Biological Image Analysis · Motion Estimation and Tracking · Multimodal Learning (Vision + Language, Audio, etc.) · Recognition, Segmentation, and Scene Understanding · Representation, Self-supervised, and Transfer Learning · Uncertainty · Vision Applications, Systems, and Robotics · Visual Reasoning · Brave New Ideas (novel approaches or theories, not necessarily benchmark gains) *Submission Guideline* Main papers must not exceed 14 pages (excluding references). Supplementary information (e.g., appendices, videos, additional results) can be submitted as a single .zip file by the deadline. All submissions must be made through the OpenReview system. BMVC’26 employs a double-blind review process. Work submitted to BMVC’26 must be original and cannot be under concurrent review for another peer-reviewed conference or journal. *Organising Committee* *General Chairs * Jun Liu Lancaster University Majid Mirmehdi University of Bristol *Advisory Chairs* Ming-Hsuan Yang UC Merced; DeepMind Stan Sclaroff Boston University Mubarak Shah University of Central Florida *Programme Chairs* Bryan M. Williams Lancaster University Hossein Rahmani Lancaster University Bohyung Han Seoul National University Jianfei Cai Monash University Gabriela Czanner University of Southampton Michael Yang University of Bath *Technical Programme Chairs* Qiuhong Ke Monash University Ping Hu UESTC; VinUniversity Haoxuan Qu Lancaster University Zhuoling Li Lancaster University *Workshop Chairs* Richard Jiang Lancaster University Guosheng Hu University of Bristol Ziquan Liu QMUL Emma Wilson Lancaster University *Industrial / Keynote Chairs* Mark Nixon University of Southampton *Doctoral Consortium Chairs* Ali Cheraghian Macquarie University *Website Chairs * Xiaofei Hui Lancaster University *Proceedings Chairs* Yakun Ju University of Leicester Jian Hu QMUL Qiuchi Xiang Lancaster University Yu Xue Lancaster University *Publicity Chairs * Kosta Derpanis York University Qian Zheng Zhejiang University Ritesh Vyas PDEU Zhengxin Yu Lancaster University *Sponsorship Chair* Ziquan Liu QMUL *Equality, Diversity and Inclusion Chairs* Emily Winter Lancaster University Yujun Cai UQ *Sustainability Chairs* Adrian Friday Lancaster University *Local Arrangement Chairs* Miles Walker Lancaster University *BMVA * Toby Breckon Treasurer Neill Campbell Chairman Andrew Gilbert Payments Master General Further Information and Updates: https://bmvc2026.bmva.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] [Algorithms] (IF 2.1, CiteScore 4.5) 4th volume of the Editor's Choice Articles

We are pleased to share with you the 4th volume of the Editor's Choice Articles in the open access journal /Algorithms /(https://www.mdpi.com/journal/algorithms). These articles are free to access and can be downloaded below: 1. Using Smartwatches in Stress Management, Mental Health, and Well-Being: A Systematic Review https://www.mdpi.com/1999-4893/18/7/419 2. Research on the Integrated Scheduling of Imaging and Data Transmission for Earth Observation Satellites https://www.mdpi.com/1999-4893/18/7/418 3. Filter Learning-Based Partial Least Squares Regression and Its Application in Infrared Spectral Analysis https://www.mdpi.com/1999-4893/18/7/424 4. Early Detection of Alzheimer's Disease Using Generative Models: A Review of GANs and Diffusion Models in Medical Imaging https://www.mdpi.com/1999-4893/18/7/434 5. Transmit and Receive Diversity in MIMO Quantum Communication for High-Fidelity Video Transmission https://www.mdpi.com/1999-4893/18/7/436 6. A Comprehensive Review and Benchmarking of Fairness-Aware Variants of Machine Learning Models https://www.mdpi.com/1999-4893/18/7/435 7. Iterative Matrix Techniques Based on Averages https://www.mdpi.com/1999-4893/18/7/439 8. Explainability and Interpretability in Concept and Data Drift: A Systematic Literature Review https://www.mdpi.com/1999-4893/18/7/443 9. Frost Resistance Prediction of Concrete Based on Dynamic Multi-Stage Optimisation Algorithm https://www.mdpi.com/1999-4893/18/7/441 10. Adaptive Nonlinear Proportional–Integral–Derivative Control of a Continuous Stirred Tank Reactor Process Using a Radial Basis Function Neural Network https://www.mdpi.com/1999-4893/18/7/442 We also warmly welcome your submissions if you have relevant work to contribute. Please feel free to contact our Managing Editor, Mr. Musea Wu (musea.wu@mdpi.com), for any questions or assistance. -- Mr. Musea Wu Managing Editor *News: * 1. /Algorithms/received an increased 2024 Impact Factor of 2.1 and CiteScore of 4.5 2. /Algorithms/ ranks Q1 in Scopus: "Mathematics - Numerical Analysis" (https://www.scopus.com/sourceid/21100199795) 3. Recruiting Editorial Board Members for /Algorithms/ (https://www.mdpi.com/about/announcements/14101) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Deadline 27 April 2026: LSE Fellow in Discrete Mathematics

Deadline Monday 27 April 2027 23:59 UK time: The Department of Mathematics at the London School of Economics and Political Science (LSE) seeks to appoint an LSE Fellow with expertise in a subject area related to Discrete Mathematics. Salary from £43,277 to £51,714 pa inclusive, with potential to progress to £55,497 pa, inclusive of London allowance. This is a career development position and is fixed term for two years. You will contribute to the intellectual life of the School through conducting and publishing outstanding quality research, engaging in high quality teaching as instructed by the Head of Department, and participating in the wider School and Department activities. You should have: - completed, or be close to completing, a PhD related to discrete mathematics by the post start date; - a developing, competitive research record in discrete mathematics, and a clear and viable strategy for future research; - excellent communication and presentation skills; - the ability to work in close partnership with fellow teachers and professional services colleagues; - the ability to foster an engaging and supportive learning environment; and - a commitment to equality and diversity. We offer an occupational pension scheme, generous annual leave, and excellent training and development opportunities. For further information about the post, please go to https://jobs.lse.ac.uk/Vacancies/W/5718/0/466300/15539/lse-fellow-in-mathematics, which also has links to the job description, person specification, and how to apply documents. If you have any technical queries with applying on the online system, please use the 'contact us' links at the bottom of the LSE Jobs page. Should you have any queries about the role, please email maths.operations@lse.ac.uk. The closing date for receipt of applications is 27 April 2026 (23:59 UK time). Regrettably, we are unable to accept any late applications.

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

[DMANET] PhD position in Reinforcement Learning for Automatic Discovery of Dynamical Systems from Data

We are offering a PhD position in Applied Mathematics and Machine Learning, focused on the intersection of reinforcement learning, optimization, and dynamical systems identification. The project aims to develop reinforcement learning methods for the automatic discovery of nonlinear dynamical systems from data, combining ideas from:     reinforcement learning and sequential decision-making     system identification and inverse problems     optimization and control theory     representation learning for structured dynamical models The goal is to design algorithms that can learn governing equations or compact dynamical representations from observations, with a focus on scalability, robustness, and theoretical guarantees. Applications will be used as motivating benchmarks, but the core emphasis is methodological: building general-purpose frameworks for data-driven discovery of dynamical systems. This position is suited for candidates interested in theoretical and algorithmic aspects of modern ML, particularly those working at the interface of reinforcement learning, optimization, and mathematical modeling. Location: Montpellier, France Deadline: May 4 Applications must be submitted via the doctoral school ED I2S portal (Université de Montpellier): https://edi2s.umontpellier.fr → PhD offers → Statistics and Data Science → LPHI – Reinforcement learning for automatic model discovery Kind regards, Ovidiu Radulescu -- Prof. Ovidiu Radulescu University of Montpellier Laboratory of Pathogens and Host Immunity Leader, Computational Systems Biology team ------------------------------------------------------------------------ LPHI - UMR 5294 CNRS/UM/INSERM Phone: +33-(0)4-6714-9221 Pl. E. Bataillon - Bat. 24 Fax: +33-(0)4-6714-4286 Université de Montpellier email: ovidiu.radulescu@umontpellier.fr CP 107 34095 Montpellier Cedex 5 FRANCE ********************************************************** * * 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] Nomination for Asian Prize for Combinatorics Deadline April 30

Dear Colleagues, This is a reminder that the deadline for nominating candidates for the Asian Prize for Combinatorics is April 30, 2026. Nominations should be sent to asiacomb2026@ibs.re.kr. Detailed information about the prize can be found on the official website: https://asiacomb.com/Prize/ Cheers, Hong Liu on behalf of ASIACOMB 2026 Organizing Committee ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Post-doctoral Position in Network Modelling and Resilience Optimization

Kindly find below a job description for a post-doctoral position at SKEMA Business School ------------------------------------------------------------------------------------------------------------------------------- The Centre for Analytics and Management Science (CAMS) at SKEMA Business School has a vacancy for one full-time post-doctoral researcher in network modelling and resilience optimization for a period of 15 months. This position is funded by the MOBILIENCE project supported by the ANR PEPR IRIMA on climate adaptation, urban resilience, and digital innovation. MOBILIENCE is a multidisciplinary project that aims to enhance the resilience of urban mobility networks to flood-induced disruptions based on the data-models-decision continuum. The candidate will collect data to develop multimodal network models and simulation frameworks for designing scenarios and capturing disruption-aware behavior. The obtained models will serve as the basis for determining stochastic, time-adaptive rerouting plans designed to keep city-wide mobility functional when large floods affect multiple corridors and overall network connectivity. The candidate will work together with Professor David Rey and will be based at SKEMA Sophia Antipolis campus. The candidate is expected to work on research activities within the scope of the MOBILIENCE project, including research publications, conference presentations and workshop participation with project partner institutions such as Université Gustave Eiffel. Candidates must have a PhD in operations research, engineering, mathematics, economics, or computer science. A knowledge of network modeling and transportation is desirable but not required. Strong data science and programming skills are required, and the candidate is expected to have excellent oral and written communication skills in English. A working knowledge of the French language is appreciated. *Keywords*: stochastic and dynamic optimization, game theory, network modelling, urban transportation, resilience. *Job characteristics*: - Contract type: Fixed-term contract (15 months) - Start date: September 2026 (flexible depending on availability) - Location: SKEMA Business School, Sophia Antipolis (France) - Salary: €3,700 – €3,950 gross/month (depending on experience) Applications should be sent to Prof. David Rey: david.rey@skema.edu and include the following documents in PDF format: - A cover letter. - Curriculum Vitae (CV) with a list of your publications and references. - The one or two publications you are the most proud of. *Applications will be reviewed until June 30th, 2026 or until the position is filled.* ------------------------------------------------------------------------------------------------------------------------------- ********************************************************** * * 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] 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/ * **********************************************************