[DMANET] SC-Square 2026: Deadline Extension

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

[DMANET] Deadline Extended: EUROYoung Workshop 2026 (Lugano, Oct 14–16)

Dear all, We are pleased to announce that the abstract submission deadline for the EUROYoung Workshop 2026 has been extended. The workshop will take place in Lugano (Switzerland) from 14 to 16 October 2026, and we warmly invite you to join us for this three-day event dedicated to Operations Research. Updated key dates: * Abstract submission deadline: 24 April 2026 (10:00 AM CET) * Notification of acceptance: 8 May 2026 * Registration: 9 May 2026 (00:00 AM CET) – 1 June 2026 (11:59 PM CET) The EUROYoung Workshop aims to foster community and collaboration among young researchers in Operations Research. Participants will enjoy plenary talks and have the opportunity to present their work. In addition to the academic program, the workshop will feature networking opportunities and social activities designed to help participants build new connections. Low accommodation fees will be available for participants. More information can be found on our website: https://euroyoung.eu/lugano2026/ If you have any questions, please feel free to contact us at euroyoung2026@usi-supsi.ch<mailto:euroyoung2026@usi-supsi.ch> We look forward to welcoming you to Lugano! Best regards, Eleonora Vercesi On behalf of the 6th EUROYoung Workshop Organizing Committee ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] CFP: RADICAL 2026: Concurrency & Logic, Liverpool (UK) - co-located with CONFEST 2026

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

[DMANET] PhD position in algorithms at University of Salzburg (Austria)

The University of Salzburg (Department of Computer Science) is currently seeking a Predoctoral University Assistant ("PhD student") in the Big Data Algorithms Group headed by Sebastian Forster. The goal is to develop algorithms for solving clustering, distance, flow, or cut problems that are as well-suited as possible to dynamic, parallel, or distributed computing models. * Requirements: Master's degree (or equivalent) in computer science or a related field * Start date: Fall 2026 * Duration: Four years * Salary: 41.601 EUR gross/year for 30 hours/week * Application deadline: May 6, 2026 Please follow this link for further details: https://karriere.plus.ac.at/en/jobs/6e6aa798-0429-01e8-cabb-69c12151a2bd Group website: https://www.plus.ac.at/big-data-algorithms/team/?lang=en Contact for research-related questions: forster@cs.sbg.ac.at (Sebastian Forster) Contact for general questions: tetiana.mazanko@plus.ac.at (Tetiana Mazanko) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] FLoC workshop OVERLAY 2026 - May 1 deadline extension - ERRATA CORRIGE: May 1

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

[DMANET] 4-year PhD position at Eindhoven University of Technology (Alexandra Lassota)

Dear colleagues, I would greatly appreciate it if you could share the PhD position advertisement below with any master’s students you know who might be interested. Thanks a lot in advance! Alex ______________________________________________________ In the Combinatorial Optimization group at Eindhoven University of Technology (The Netherlands), there is a vacancy for a 4 year PhD-position. This PhD position is supervised by Alexandra Lassota (https://www.tue.nl/en/research/researchers/alexandra-lassota) and Frits Spieksma (https://www.tue.nl/en/research/researchers/frits-spieksma). The vacancy can be found at: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-algorithms-and-complexity-for-discrete-optimization-problems The vacancy closing date will be the 31.05.26, or until the position is filled. The preferred starting date is August or September 2026. *Project Description This project focuses on investigating theoretical properties and the computational hardness of discrete optimization problems, with a focus on structured cases in problems from operations research such as scheduling and integer programming. While many of these problems are classically NP-hard, specific formulations often have exploitable structures that enable efficient solution methods. This research aims to identify such tractable structures, develop corresponding algorithms, and sharpen the boundaries between polynomial-time solvability and inherent hardness. Beyond theoretical insights, the project seeks to translate these advances into practical algorithmic frameworks for combinatorial optimization. Improvements in solving structured discrete optimization models have wide-ranging implications across applications including supply chain management, resource allocation, fair division and voting rules, among others. *Job Description You will work under the supervision of Alexandra Lassota and Frits Spieksma in the Combinatorial Optimization group within the Department of Mathematics and Computer Science at TU/e. Your responsibilities include to perform scientific research on the topic of the above-mentioned project, and to publish and present your results at international venues. For a small percentage of your time, you will be asked to assist with educational tasks (course support and supervision of students). *Job Requirements - You have a bachelor and master degree in Mathematics, Computer Science, or Econometrics. - You have a strong background in Combinatorics and Complexity Theory. - You have good communication skills and like occasional travels. - You are creative, ambitious, as well as self-motivated, proactive, and goal-oriented. - You have a good command of the English language (knowledge of Dutch is not required). *Conditions of Employment A meaningful job in a dynamic and ambitious university, in an interdisciplinary setting and within an international network. You will work on a beautiful, green campus within walking distance of the central train station. In addition, we offer you: - Full-time employment for four years, with an intermediate assessment after nine months. You will spend a minimum of 10% of your four-year employment on teaching tasks, with a maximum of 15% per year of your employment. - Salary and benefits (such as a pension scheme, paid pregnancy and maternity leave, partially paid parental leave) in accordance with the Collective Labour Agreement for Dutch Universities, scale P (min. € 3,059 - max. € 3,881). - A year-end bonus of 8.3% and annual vacation pay of 8%. - High-quality training programs and other support to grow into a self-aware, autonomous scientific researcher. At TU/e we challenge you to take charge of your own learning process. - An excellent technical infrastructure, on-campus children's day care and sports facilities. - An allowance for commuting, working from home and internet costs. - A Staff Immigration Team and a tax compensation scheme (the 30% facility) for international candidates. *Application We invite you to submit a complete application by using the apply button on the website. Besides personal and contact information, you should upload the following documents as PDFs: - Cover letter in which you describe your motivation and qualifications for the position. - Curriculum vitae, including a list of your publications and the contact information of two references. Kindly note that we may reach out to references at any stage of the recruitment process. We recommend notifying your references upon submitting your application. - BSc and MSc transcripts Do not upload any other documents. We look forward to receiving your application and will screen it as soon as possible. The vacancy will remain open 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] Final Call-for-Participation: TalentCLEF2026 Workshop/Lab (CLEF2026) - Shared tasks on multilingual job and skill intelligence for next-generation HR systems.

(* apologies for cross-posting *) Final Call for Participation TalentCLEF Workshop/Lab (CLEF 2026) Shared task on multilingual job and skill intelligence for next-generation HR systems. 📅 Registration Deadline: April 23, 2026 https://talentclef.github.io/talentclef/ Overview The labor market is changing faster than ever: skills evolve in years, job roles shift continuously, and organizations operate across languages and borders. At the same time, the use of Artificial Intelligence in Human Resources is rapidly expanding, transforming how talent is identified, matched, and developed. However, this growing adoption also highlights a critical need for public benchmarks and standardized evaluation frameworks that enable reproducibility, fair comparison, and robust development of NLP systems in Human Capital Management. TalentCLEF 2026 invites the community to address these challenges through shared tasks on skill and job intelligence, fostering the development of accurate, multilingual, and practically applicable solutions for Human Capital Management Key information: - Web: https://talentclef.github.io/talentclef/ - Data: https://doi.org/10.5281/zenodo.17625261 - Codabench Task A: https://www.codabench.org/competitions/14226/ - Codabench Task B: https://www.codabench.org/competitions/14489/ - Registration: https://clef-labs-registration.dipintra.it/ Why participate? - Evaluate your models on realistic Human Capital Management tasks - Work with multilingual and cross-lingual data (English and Spanish) - Access open, privacy-preserving datasets - Contribute to an emerging benchmark in HR/NLP - Publish a system description paper in CLEF Working Notes (CEUR-WS) - Present your work at CLEF 2026 in Jena, Germany Tasks Overview TalentCLEF 2026 is structured into two independent but complementary tasks, allowing participants to compete in one or both. - Task A - Contextualized Job-Person Matching: - Goal: Rank candidate résumés for a given job offer. - This task focuses on context-aware matching between full job descriptions and candidate profiles. It is framed as an information retrieval problem, where systems must return a ranked list of résumés ordered by relevance. - The task includes English, Spanish, and cross-lingual settings, reflecting real-world recruitment scenarios. - Task B - Job-Skill Matching with Skill Type Classification: - Goal: Identify and classify relevant skills for a given job title. - Participants must retrieve skills from a predefined gazetteer and classify each skill as: Core (required) and Contextual (optional). - This task emphasizes skill-based representations and the nuanced role of skills within job profiles. Important Dates - 2nd February 2026 - Development data available for Tasks A - 2nd February 2026 - Training data available for Task B - 16th February 2026 - Development data available for Task B - 2nd March 2026 - Codabench Release for Task A and Task B - 20th April - 3rd May 2026 - Evaluation Period for Task A and Task B - 23rd April - Official registration deadline - 7th May 2026 – Publication of Official Results - 30th May 2026 – Submission of CLEF 2026 Participant Working Notes (CEUR-WS) - 27th June 2026 - Notification of Acceptance for Participant Papers Workshop and Proceedings Teams participating in TalentCLEF will be invited to submit a system description paper for the CLEF 2026 Working Notes proceedings, published on CEUR-WS. The TalentCLEF 2026 workshop will be co-located with CLEF 2026 and held in Jena, Germany, from September 21 to 24, 2026. Participants will have the opportunity to present their approaches at the workshop. Main Organizers - Luis Gascó, Avature - Hermenegildo Fabregat, Avature - Laura García-Sardiña, Avature - Paula Estrella, Avature - Casimiro Pío Carrino, Avature - Jens-Joris Decorte, TechWolf - Matthias De Lange, TechWolf - Warre Veys, TechWolf - Daniel Deniz Cerpa, Avature - Álvaro Rodrigo, Universidad Nacional de Educación a Distancia (UNED) - Rabih Zbib, Avature ********************************************************** * * 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]: CIT-2026, The 24th International Conference on Computer and Information Technology, UK, 26-28 October 2026

[Please accept our apologies if you receive multiple copies of this message] ************************* CIT-2026 Call for Papers********************** *The 24th International Conference on Computer and Information Technology (CIT-2026)* *https://hpcn.exeter.ac.uk/cit2026* *Exeter, UK, 26-28 October 2026* INTRODUCTION ============= CIT-2026 is the 24th edition of the highly successful International Conference on Computer and Information Technology. The goal of the conference is to provide a forum for scientists, engineers and researchers to discuss and exchange novel ideas, results, experiences and work-in-process on all aspects of computer and information technology. CIT has become a major platform for researchers and industry practitioners from different fields of computer and information technology. Each year, CIT attendees appreciate and benefit from multidisciplinary exchanges in computer and information technology. In previous years, CIT has attracted many high quality research papers spanning over the various aspects of information technology, computing science and computer engineering. These papers highlight foundational work that strives to push beyond limits of existing computer technologies, including experimental efforts, innovative systems, and investigations that identify weaknesses in existing IT services. CIT-2026 will be hosted in Exeter, the capital city of Devon and provides the county with a central base for education, medicine, religion, commerce and culture. The city is also home to the magnificent Exeter Cathedral, which dates back to Norman times. Exeter is also ideally placed to base a trip to branch out visiting places such as the famous Dartmoor National Park and the unspoilt beaches of the North and South Devon coastlines. Prospective authors are invited to submit their papers to CIT-2026. All accepted papers will be submitted to IEEE Xplore and will be submitted for indexing by Engineering Index (EI). The authors of selected best papers will be invited post conference to extend their contributions for special issues of prestigious journals to be planned in conjunction with the conference. SCOPE AND TOPICS ================ Topics of interest include, but are not limited to: Track 1: Computer Science Track 2: Information Technology Track 3: Networking and Communications Track 4: Information Security PAPER SUBMISSION GUIDELINE ========================== All papers need to be submitted electronically through the conference submission website (https://hpcn.exeter.ac.uk/cit/) with PDF format. The materials presented in the papers should not be published or under submission elsewhere. Each paper is limited to 8 pages (or 10 pages with over length charge) including figures and references using IEEE Computer Society Proceedings Manuscripts style (two columns, single-spaced, 10 fonts). Once accepted, the paper will be included into the conference proceedings published by Conference Publishing Services (submitted for indexing by EI). At least one of the authors of any accepted paper is requested to register the paper at the conference. IMPORTANT DATES ================= · Submission Deadline: 10 July 2026 · Authors Notification: 30 August 2026 · Final Manuscript Due: 30 September 2026 · Registration Due: 30 September 2026 · Conference Date: 26-28 October 2026 For more information, please visit the conference website: https://hpcn.exeter.ac.uk/cit2026 ********************************************************** * * 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] MASSIVE Workshop @ PAAMS 2026 – Multi-Agent Systems: Simulations, Intelligence & VErification

======================================================= Call for Papers – MASSIVE Workshop @ PAAMS 2026 Workshop on Multi-Agent Systems: Simulations, Intelligence & VErification Website CFP: https://sites.google.com/view/massive2026workshop/home Contact: massive26@protonmail.com<mailto:massive26@protonmail.com> ======================================================= Dear Researchers, we cordially invite you to submit your work to the MASSIVE Workshop (Multi-Agent Systems: Simulations, Intelligence & VErification), co-located with PAAMS 2026 – 24th International Conference on Practical Applications of Agents and Multi-Agent Systems. This will be a hybrid event (offering both in-person and online participation) held on October 21–23, 2026, in the beautiful city of Naples, Italy, a UNESCO World Heritage site. Intelligent systems today operate across a wide variety of complex, distributed, and dynamic environments. MASSIVE 2026 welcomes contributions that advance the foundations and application of intelligent systems, from theoretical models to experimental studies, and real-world applications. The workshop focuses on Agent-Based Modeling and Simulation (ABMS), Multi-Agent Systems (MAS), Multi-Agent Pathfinding, Applications of Machine Learning, Agentic AI, Digital Twins, and Swarm Robotics, aiming at exploring the next generation of intelligent systems. ---------------------------------------------------------------------- Publication: ---------------------------------------------------------------------- *** Accepted papers will be considered for publication in PAAMS 2026 proceedings (Springer CCIS series) subject to meeting the publisher's quality standards. *** ---------------------------------------------------------------------- Topics of interest include, but not limited to: ---------------------------------------------------------------------- - Multi-agent coordination, planning and learning - Agent-Based Modeling frameworks - Agentic AI and LLM-driven agents - Formal models and validation - Applications of Machine Learning and Reinforcement Learning - Swarm robotics and emergent behavior - Game Theory - Digital Twins - Financial Simulations - Blockchain and DeFi systems - Cybersecurity - Logistics and industrial systems - Healthcare modeling - Crisis management systems ---------------------------------------------------------------------- Important Dates ---------------------------------------------------------------------- Paper submission deadline: 8th May 2026 Notification of acceptance: 19 June 2026 Camera-ready deadline: 15 July 2026 Conference: 21–23 October 2026, Naples, Italy ---------------------------------------------------------------------- Call for papers ---------------------------------------------------------------------- CFP info and details: https://sites.google.com/view/massive2026workshop/call-for-papers Submissions should be uploaded to EasyChair; please ensure you select the MASSIVE Workshop track under the PAAMS conference. Submission link: https://bit.ly/4er9QaS Looking forward your submissions, Kind Regards, Alessia Di Fonso, PhD (MASSIVE Workshop co-chair) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Machines, Computations and Universality - MCU 2026 - FIRST CALL FOR PAPERS

============================================================ MCU 2026 - FIRST CALL FOR PAPERS 11th Conference on Machines, Computations and Universality Trier, Germany, July 27–29, 2026 Co-located with CiE 2026 ============================================================ We invite submissions to MCU 2026, the 11th edition of the International Conference on Machines, Computations and Universality. The MCU series focuses on fundamental aspects of computation and universality across a wide range of computational models. IMPORTANT DATES ------------------------------------------------------------ Submission deadline: May 10, 2026 (AoE, strict) Notification: June 15, 2026 Final version: August 15, 2026 SUBMISSION ------------------------------------------------------------ https://easychair.org/conferences/?conf=mcu2026 Please distribute. ============================================================ ABOUT MCU ------------------------------------------------------------ The MCU conference series, initiated in Paris in 1995, has a long tradition of exploring the nature of computation and universality. Previous editions were held in Metz (1998), Chișinău (2001), St. Petersburg (2004), Orléans (2007), Zurich (2013), Famagusta (2015), Fontainebleau (2018), Debrecen (2022), and Nice (2024). The 2026 edition will take place at Trier University, Germany. SCOPE ------------------------------------------------------------ MCU 2026 welcomes contributions on theoretical and interdisciplinary aspects of computation, including (but not limited to): * Discrete models: Turing machines, automata, grammars, cellular automata, tile assembly systems, rewriting systems * Analog and hybrid models: BSS machines, real computation, infinite-time models, quantum computing * Natural and emerging computation: molecular computing, neural models, membrane systems, swarm intelligence * Foundations: computability, complexity, decidability, universality, and their limits Special emphasis is placed on: * Boundaries between decidability and undecidability * Minimal and universal computational models * Predictability and complexity of computational processes TOPICS OF INTEREST ------------------------------------------------------------ Topics of interest include, but are not limited to * Analog and continuous computation * Automata theory * Cellular automata * Computability theory and degree structures * Computable structures and models * Decidability of theories * DNA computing, self-assembly and tiling * Dynamical systems and computational models * Emerging and non-standard models of computation * Finite model theory * Generalized recursion theory * Higher type computability * Hyper-computational models * Infinite time Turing machines * Membrane computing * Molecular computation * Morphogenesis and developmental biology * Multi-agent systems models * Natural computation and hybrid systems * Neural nets and connectionist models * Physics and computability * Proof theory and computability * Quantum computing and information * Randomness and Kolmogorov complexity * Relativistic computation * Swarm intelligence and self-organisation * Theory of Petri nets * Turing, Counter, Register, Signal machines * Universality of systems PROGRAM CHAIRS ------------------------------------------------------------ Henning Fernau (Trier University, Germany) Serghei Verlan (University Paris-Est Créteil, France) INVITED SPEAKERS ------------------------------------------------------------ Martin Kutrib (University of Gießen, Germany) Olivier Bournez (Ecole Polytechnique, Paris, France) - tutorial at CiE. Joint CiE special session “At the Borderline of Universality”: * Artiom Alhazov, State University of Moldova * Matthew Cook, University of Groningen * Gemma De les Coves, Pompeu Fabra University, Barcelona * Victor Mitrana, University of Bucharest AUTHOR GUIDELINES ------------------------------------------------------------ All papers must be original and not simultaneously submitted to another journal or conference. We expect non-anonymous submissions up to 15 pages in LNCS format, including all content except for an optional appendix (read at the discretion of the PC); alternatively, include a link to an arXiv version. Accepted papers will appear in the Springer LNCS volume of MCU. A selection of papers will further be invited to a Special Issue of a journal. Submission link: https://easychair.org/conferences/?conf=mcu2026 PROGRAM COMMITTEE Artiom Alhazov (State University of Moldova, Moldova) Péter Battyányi (University of Debrecen, Hungary) Song Bosheng (Hunan University, China) Olivier Bournez (Ecole Polytechnique, France) Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Budapest, Hungary) Jérôme Durand-Lose (University of Orléans, France) Rudi Freund (TU Wien, Austria) Daniela Genova (University of North Florida, USA) Dora Giammarresi (Tor Vergata University of Rome, Italy) Mika Hirvensalo (University of Turku, Finland) Jarkko Kari (University of Turku, Finland) Lila Kari (University of Waterloo, Canada) Tomas Masopust (University of Olomouc, Czech Republic) Benedek Nagy (Eastern Mediterranean University, Famagusta, North Cyprus) Matthew Patitz (University of Arkansas, USA) Simon Perdrix (INRIA, France) Agustín Riscos-Núnez (University of Seville, Spain) Shinnosuke Seki (University of Electro-Communications, Tokyo, Japan) KG Subramanian (Liverpool Hope University, UK) György Vaszil (University of Debrecen, Hungary) Tomoyuki Yamakami (University of Fukui, Japan) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Workshop 2nd Announcement: Structuring Combinatorial Problems with Symmetry

Dear colleagues, we are happy to announce the workshop Structuring Combinatorial Problems with Symmetry <http://structuring-combinatorial-problems-with-symmetry-26.tobiasmetzlaff.com/> to take place at *Chemnitz University of Technology *in *Germany *from *24–26 **June** 2026*. The workshop focuses on the systematic and algorithmic use of symmetry as well as group-theoretic and optimization-based methods in the study of combinatorial and geometric problems. We bring together researchers working in discrete mathematics, polynomial optimization, applied real algebraic geometry as well as group and representation theory where symmetry plays a structural or algorithmic role. The goal is to foster exchange between intertwining perspectives and to stimulate further collaboration in this active area. Lectures will be given by: * Daniel Brosch <https://www.danielbrosch.com/> (Klagenfurt) * Nidhi Kaihnsa <https://sites.google.com/view/kaihnsa/about> (Copenhagen) * Nando Leijenhorst <https://nanleij.github.io/> (Toulouse) * Philippe Moustrou <https://pmoustro.perso.math.cnrs.fr/index.html> (Toulouse) * Sven Polak <https://sites.google.com/site/svenpolak/> (Tilburg) * Leonie Scheeren <https://www.mathematik.rwth-aachen.de/cms/mathematik/fachgruppe/Institute-Lehrstuehle/Personen/~bkbg/Mitarbeiter-CAMPUS-/?gguid=PER-WN9RPS4&lidx=1> (Aachen) * Frank Vallentin <https://www.mi.uni-koeln.de/opt/frank-vallentin/> (Cologne) In order to register, send an email to sebastian.debus@uni-konstanz.de or math@tobiasmetzlaff.com with the subject "Registration SPP26 Symmetry", indicating your name and affiliation. There is no registration fee. On request, we will share a zoom link for remote participation. We welcome contributed talks of 30 minutes. To propose a talk, indicate so in your registration email and include a title and short abstract. For further information on the program, speakers, and registration, visit the official webpage: http://structuring-combinatorial-problems-with-symmetry-26.tobiasmetzlaff.com/ Kind regards, Sebastian Debus, Tobias Metzlaff, Christoph Helmberg ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] [Scheduling seminar] Bruno Escoffier (LIP6, Sorbonne) | April 15 | Resource Leveling for Scheduling Problems: Some Complexity and Approximation Results

Dear scheduling researcher, We are delighted to announce the talk given by Bruno Escoffier (LIP6, Sorbonne). The title is "Resource Leveling for Scheduling Problems: Some Complexity and Approximation Results". The seminar will take place on Zoom on Wednesday, April 15 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/93518304259?pwd=raL1poIlb2JMYLa3rJeU746uORq1Xh.1 Meeting ID: 935 1830 4259 Passcode: 688261 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Scheduling problems usually consider resource constraints as hard constraints. In resource leveling instead, a function of resource use is optimized, typically under a deadline constraint. This is motivated by the fact that, in practice, additional resources (e.g., workforce or machines) can be mobilized in order to meet a deadline, yet at some cost. In this talk we will focus on the following setting: given a (target) resource level, our goal is to schedule the jobs in such a way as to best respect this resource level, that is to say, to exceed it as little as possible. We study classical scheduling problems (with or without precedence constraints, with arbitrary or unit processing times,...) in this setting, providing both positive and negative complexity and approximability results. The next talk in our series will be Alena Otto (TU Munich)| April 29 | Overcoming poor data quality: Optimizing validation of precedence relation data. For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan ********************************************************** * * 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] Workshop on Real-world Applications of Geometry and Algebra (RAGA 2026) at Eindhoven University of Technology

Dear all, This is an announcement of the third workshop on "Real-world Applications of Geometry and Algebra", RAGA 2026. In this workshop, speakers from industry and academia will talk about topics in their area that involve (or could benefit from) the use of geometry, graph theory and algebra. The workshop will take place in Eindhoven (The Netherlands), June 1-2 2026. You can register via our *workshop website* <https://sites.google.com/view/appliedgeometryalgebra/raga/raga-2026>. For administrative purposes, we request that you register by *May 22*. Invited Speakers include: Max Bannach (ESA) Gijs Bellaard (TU/e) Guus Bollen (Sioux) Wouter Castryck (KU Leuven) Sean Dewar (KU Leuven) Samantha Fairchild (TU/e) Max Goering (TU/e) Okke Hendriksen and Willem Verhaegh (ASML) Gregor Kemper (TU Munich) Kathlén Kohn (KTH Stockholm) Rob Kooij (TU Delft and TNO) Ivan Kryven (Utrecht University) Alexandru Onose (ASML) Willem Renema (Naturalis) Alvaro Samperio (CUNEF Spain) This workshop is funded by *Math4NL* <https://math4nl.nl>, *NWO* <https://www.nwo.nl> and *TU/e* <https://www.tue.nl>. Best regards, Aida Abiad, Mireille Boutin, Rob Eggermont, Samantha Fairchild ********************************************************** * * 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 Due Jul 15] AHPC 2026 High-Performance Computing, Oct 1-2, OKCity, USA & Online

[Apologies if you receive multiple copies] --- 1st Call for Abstracts and Papers ------------- 2026 OkIP International Conference on Advances in High-Performance Computing (AHPC) Online & Oklahoma City, OK, USA October 1-2, 2026 https://eventutor.com/e/AHPC006 OkIP Published & Submission for Indexation Submission Deadline: July 15, 2026 Extended versions of the best papers will be considered for publication in the inaugural volume of the International Journal of High-Performance Computing. >> Areas: * High-Performance Computing (HPC) Advanced Concepts * HPC AI/ML/LLM/DL * Parallel Computing * Mobile & Wireless Computing * Network Architecture/System * HPC Simulation/Security * HPC Applications More detailed areas here: https://eventutor.com/event/82/program >> Contribution Types (Two-Column Format Style): - Full Paper: Accomplished research results (6 pages) - Short Paper: Work in progress/fresh developments (3 pages) - Extended Abstract/Poster/Journal First: Displayed/Oral presented (1 page) >> Technical Program Committee https://eventutor.com/event/82/page/223-committee >> Important Dates: - Abstract or Paper Submission: July 15, 2026 - Author Notification: August 1-15, 2026 - Camera Ready Paper Submission, Registration: August 7-22, 2026 - Conference Date: October 1-2, 2026 Please feel free to contact us for any inquiries at: Kris Zeuti OkIP Secretariat info@okipublishing.com ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] CHSZLabLib: Python Interface to State-of-the-Art Graph Algorithm Libraries

Dear colleagues, We are pleased to announce CHSZLabLib, an open-source Python library that provides a unified interface to a collection of high-performance C++ algorithm libraries developed by the Algorithm Engineering Group at Heidelberg University. The library covers a broad range of combinatorial optimization problems on graphs and hypergraphs: - Graph partitioning (KaHIP, HeiStream, SharedMap) - Hypergraph partitioning (FREIGHT) - Community detection and clustering (VieClus, SCC, CluStRE, HeidelbergMotifClustering) - Minimum and maximum cuts (VieCut, fpt-max-cut, HeiCut) - Maximum (weight) independent set (KaMIS, CHILS, LearnAndReduce) - Hypergraph independent set and b-matching (HyperMIS, HeiHGM) - Maximum 2-packing set (red2pack) - Edge orientation (HeiOrient) - Fully dynamic graph algorithms for matching, edge orientation, and weighted independent set (DynMatch, DynDeltaOrientation, DynDeltaApprox, DynWMIS) In total, the library integrates 20 C++ solver libraries (350,000+ lines of C++) behind a consistent Python API with Graph/HyperGraph objects and typed result dataclasses. Pre-built wheels are available for Linux (x86_64) and macOS (arm64); no C++ compiler is required for installation. Installation: pip install chszlablib The library is intended for convenient access and rapid prototyping. For scientific studies and performance measurements, we recommend using the original C++ repositories directly (linked in the README), which provide full documentation, parameter spaces, and experimental setups. Please cite the original papers for each algorithm used; all references are listed in the repository. GitHub: https://github.com/CHSZLab/CHSZLabLib PyPI: https://pypi.org/project/chszlablib/ License: MIT Best regards, Christian Schulz Heidelberg University ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

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

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

[DMANET] =?Windows-1252?Q?[CFP]_CloudNet_2026_Submission_Deadline:_15_May, _2026_?= – 14th IEEE International Conference on Cloud Networking (CloudNet 2026) | Athens, Greece

======================================== We apologize if you receive multiple copies of this CFPs. We appreciate your help to contribute & forward this CFPs to your friends. ======================================== You are cordially invited to submit your latest research results to the CloudNet 2026. The 14th IEEE International Conference on Cloud Networking (CloudNet 2026) Call for Papers Cloud networking has emerged as a promising direction for cost-efficient, reliable service and data delivery across wide-area backbones and data-centre fabrics. CloudNet 2026 will bring together the world’s distinguished researchers and industry experts in this field and will provide a great opportunity for you to present your research as well as exchange ideas with a highly motivated audience. https://cloudnet2026.ieee-cloudnet.org/ Important Dates: Paper Submission: 15 May 2026 Acceptance Notification: 24 August 2026 Camera-ready Deadline: 21 September 2026 Submit paper here: https://edas.info/newPaper.php?c=34693 Submit a demo/artifact here: https://edas.info/newPaper.php?c=34693&track=136833 Authors are invited to submit original contributions. Submissions must be in IEEE single-spaced double-column style with a length limitation of 6 pages. Conference Topics Include (but are not limited to) * Multi-Cloud Federation * Mobile Cloud Networking * Reliability of Data Center Network and Architecture * RAN Virtualization * Programmable Data Planes * Cloud continuum * Big Data Analytics * Edge Computing * Cloud Computing Applications * DataCenter and Cloud-Native Networks * Energy-Efficient Data Centers and Networks * Network service softwarization * Integration between cloud technologies and the networks * Resource Optimization and Management * Traffic Characterization and Measurements * AI/ML-for Resource Management and Orchestration * Cloud Sovereignty * Cloud Security * Intrusion Detection/Prevention Systems * Deep Packet Inspection Systems * Cloud Computing Privacy * Agentic AI for cloud networking * Generative AI for cloud networking Organizing Committee General Co-Chairs Ch.Verikoukis, ISI/ATH and Univ. of Patras F. Granelli, Univ. of Trento Executive Chair S. Papavassiliou, NTUA Technical Program Co-Chairs B.Canberk, Edinburgh Napier University J.Vardakas, IQU and Univ. of W.Macedonia Anna-Maria Vegni, Rome Tre University Tutorial Chair D.Manias, Mississippi State University Workshop and Special Session Chair D.Xenakis, University of Athens Keynote Chair P.Papadimitriou, U. of Macedonia Demo Chair H.Chergui, I2CAT Panel Co-Chairs I.Chochliouros, OTE V.Theodorou, Intracom Telecom Publicity Co-Chairs H.Kim, Incheon National University A.Leivadeas, Université du Québec Y.Yigit, Edinburgh Napier University Publication Co-Chairs E.Liotou, Harokopio University Web Co-Chairs D.Selis, ISI/ATH H.Andronikou, ISI/ATH Local Arrangement Co-Chairs A.Palivou, ISI/ATH E.Stai, NTUA P.Marantis, ISI/ATH Best regards, Yagmur Yigit PhD Student, Edinburgh Napier University This message and its attachment(s) are intended for the addressee(s) only and should not be read, copied, disclosed, forwarded or relied upon by any person other than the intended addressee(s) without the permission of the sender. If you are not the intended addressee you must not take any action based on this message and its attachment(s) nor must you copy or show them to anyone. Please respond to the sender and ensure that this message and its attachment(s) are deleted. It is your responsibility to ensure that this message and its attachment(s) are scanned for viruses or other defects. Edinburgh Napier University does not accept liability for any loss or damage which may result from this message or its attachment(s), or for errors or omissions arising after it was sent. Email is not a secure medium. Emails entering Edinburgh Napier University's system are subject to routine monitoring and filtering by Edinburgh Napier University. Edinburgh Napier University is a registered Scottish charity. Registration number SC018373 BSL users can contact us via contactSCOTLAND-BSL, the on-line British Sign Language interpreting service. Find out more on the contactSCOTLAND website. ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] FLoC workshop on proof complexity - Call for Presentations

FLoC workshop on proof complexity - Call for Presentations ---------------------------------------------------------- Lisbon, 18/19 July 2026 https://proofcomplexityworkshop.gitpages.uni-jena.de The workshop will be part of FLoC (https://www.floc26.org) and affiliated with the conference SAT'26 (https://satisfiability.org/SAT26/). === Important Dates === 15 May 2026 ........ Abstract submission 20 May 2026 ........ Notification to authors 1 June 2026 ........ Early registration deadline 18-19 July 2026 .... Workshop in Lisbon === Scope === Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P? Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT solving. === Invited Speakers === Noah Fleming (University of Lund) Jan Pich (University of Oxford) === Submissions === We welcome 1-2-page abstracts presenting (finished, ongoing, or if clearly stated even recently published) work on proof complexity. Particular topics of interest are * Proof Complexity * Bounded Arithmetic * Relations to SAT solving * Relations to Computational Complexity === Submission Guidelines === Abstracts are invited of ongoing, finished, or (if clearly stated) even recently published work on a topic relevant to the workshop. Abstracts (at most 2 pages) are to be submitted electronically in PDF via https://submissions.floc26.org/pc/ Accepted communications must be presented at the workshop by one of the authors. === Student travel bursaries available === Bursaries for travel support will be available for students, who want to attend the workshop and combine this with a visit to SAT. Details will be announced on the SAT'26 websites in due time. === Organizers === Olaf Beyersdorff (University of Jena) Massimo Lauria (Sapienza Rome) Jan Johannsen (LMU Munich) ********************************************************** * * 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: ICIST 2026, Coimbra, Portugal, October 1-6, 2026. Submission Deadline: May 15, 2026

Following the success of previous events, the 16th International Conference on Information Science and Technology (ICIST 2026) will be held in Coimbra, Portugal, on October 1-6, 2026. Located between the two largest Portuguese cities, the conference site features a historic royal city with numerous historical buildings, classified as a UNESCO World Heritage site. ICIST2026 aims to provide a high-level international forum for scientists, engineers, and educators to present the state-of-the-art research and applications in neural networks and related fields. The symposium will feature plenary speeches given by world-renowned scholars, regular sessions with broad coverage, and special sessions focusing on popular topics. Technical Co-sponsor: IEEE Systems, Man and Cybernetics Society. Accepted papers will be included in the IEEE Xplore. When: October 1 - 6, 2026 (Coimbra, Portugal) - - - - - - - - - - - - - - - - - - - - Important Dates: Paper submission deadline: May 15, 2026 Notification of acceptance: June 15, 2026 Camera-ready copy and author registration: July 15, 2026 Abstract submission deadline: September 15, 2026 Website: https://conference.cs.cityu.edu.hk/icist/ - - - - - - - - - - - - - - - - - - - - Call for Papers and Special Sessions Prospective authors are invited to contribute high-quality papers to ICIST2026. Additionally, proposals for special sessions within the technical scope of the conference are solicited. Special sessions, organized by internationally recognized experts, aim to bring together researchers in specialized, focused topics. Papers submitted for special sessions are peer-reviewed using the same criteria as those for contributed papers. Researchers interested in organizing special sessions are invited to submit formal proposals to ICIST2026. A special session proposal should include the session title, a brief description of the scope and motivation, names, contact information, and brief biographical information on the organizers. - - - - - - - - - - - - - - - - - - - - Topic Areas: The topics of contributing papers include, but are not limited to, the following areas: Intelligent Control and Automation Autonomous systems, linear and nonlinear control, learning and adaptive control, intelligent control, optimization-based and optimal control, fault detection and identification, hybrid intelligent systems, networked control, fuzzy logic control, industrial automation, neural control, process control, robot control, mechatronic systems, environmental monitoring and control, intelligent manufacturing systems, microprocessor-based control, motor control, power systems, vehicle control, aerospace applications, and other applications. Intelligent Information Processing Machine learning, adaptive filtering, signal processing, audio/speech processing and coding, higher-order spectral analysis, nonlinear & blind signal processing, neural signal processing, component analysis, array signal processing, parallel and distributed processing, time series analysis, multimedia signal processing, design and implementation of signal processing systems, DSP implementations, embedded systems, image and multidimensional signal processing, image processing & understanding, computer vision & pattern recognition, bioimaging and signal processing, multimedia communications, computer vision & virtual reality, next-generation mobile communications, communication signal processing, modulation and channel coding, network coding, sensor networks, cryptography and information security, and other applications. - - - - - - - - - - - - - - - - - - - - Paper Submission Authors are invited to submit full-length papers (8 pages maximum) by the submission deadline through the online submission system. Potential organizers are also invited to enlist five or more papers with cohesive topics to form special sessions. The submission of a paper implies that the paper is original and has not been submitted under review or is not copyright-protected elsewhere, and will be presented by an author if accepted. All submitted papers will be refereed by experts in the field based on the criteria of originality, significance, quality, and clarity. The authors of accepted papers will have the opportunity to revise their papers, taking into consideration the referees’ comments and suggestions. All accepted papers will be submitted for inclusion into IEEE Xplore, subject to meeting IEEE Xplore’s scope and quality requirements. Selected high-quality papers will be included in several journal special issues. ********************************************************** * * 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] JCDCG^3 2026 (Sept. 7-10, Tokyo Univ. of Science), 1st Call For Presentations

JCDCG^3 2026: The 28th Japan Conference on Discrete and Computational Geometry, Graphs, and Games --- Celebrating the 80th birthdays of Professors Jin Akiyama and Vašek Chvátal. (Apologies for multiple distributions) ---- First Call For Presentations ---- Date: Sept. 7 (Mon) -- 10 (Thu), 2026 Conference Site: Tokyo University of Science Submission Deadline: June 12 (Fri), 2026 (JST) Web site: https://sites.google.com/view/jcdcggg2026 http://www.alg.cei.uec.ac.jp/itohiro/JCDCGG/ Invited Plenary Speakers: - Jin Akiyama (Tokyo Univ. of Science, Japan) - Vašek Chvátal (Concordia Univ. in Montreal, Canada and Charles Univ. in Prague., Czech) - Erik D. Demaine (MIT, USA) - David Eppstein (Univ. California, Irvine, USA) - Stefan Langerman (ULB, Belgium) - Joseph O'Rourke (Smith College, USA) - János Pach (Rényi Institute, Hungary and EPFL, Switzerland) - Tadashi Tokieda (Stanford Univ., USA) Scope: We invite submissions of original research on, but not restricted to, discrete geometry, computational geometry, graph theory, graph algorithms, and complexity and winning strategies of puzzles and games. The collection of extended abstracts will be distributed only in electronic form. Submission format: Authors are required to submit a pdf-file of an extended abstract of ** at most 2 pages ** in a standard 10-point font on A4-paper (any format is OK if it obeys these restrictions) to https://easychair.org/conferences/?conf=jcdcg32026 by June 12, 2026 (JST). Note: - The official language for abstracts and presentations of talks in this conference is English. Publishing a collection of selected papers: The collection of extended abstracts will be provided in electronic form. No proceedings will be published. A collection of selected full papers of this conference, however, is planned to be published as a special issue of a journal. Details will be announced afterward. *** Note *** For oral presentations, submissions that are slightly out of scope may be accepted, but for the collection of papers published by the journal, the scope will be reviewed more strictly, i.e., some submissions accepted for oral presentations may be excluded from the collection on the basis of scope. ************ *************************************************************** * Important Dates: * - Submission (extended abstracts at most 2 pages) Deadline: * June 12 (Fri), 2026 (JST), * - Notification: (expected to be) July 03 (Fri), 2026, * - Camera-Ready File Submission Deadline: July 24, 2026, * - Conference: Sept. 7 (Mon) -- 10 (Thu), 2026. *************************************************************** Committees: Conference Co-Chairs: Toshinori Sakai (Tokai University, Japan) Akifumi Sako (Tokyo University of Science, Japan) Program Committee: - Supanut Chaidee (Chiang Mai University, Thailand) - Shinya Fujita (Yokohama City Univ., Japan) - Michitaka Furuya (Kwansei Gakuin Univ., Japan) - Hiro Ito (UEC, Japan; Chair) - Michael Lampis (Univ. Paris Dauphine, France) - Jayson Lynch (MIT, USA) - Yasuko Matsui (Tokai Univ., Japan) - Daiki Miyahara (UEC, Japan) - Atsuki NAGAO (Ochanomizu Univ.) - Hirotaka Ono (Nagoya Univ., Japan) - Kenta Ozeki (Yokohama National Univ., Japan) - Toshinori Sakai (Tokai Univ., Japan) - Koki Suetsugu (Toyo Univ., Japan) - Ryuhei Uehara (JAIST, Japan) - Yushi Uno (Osaka Metropolitan Univ., Japan) - Chao YANG (Guangdong Univ. of Foreign Studies, China) Organizing Committee: - Shinya Fujita (Yokohama City University, Japan) - Hiro Ito (UEC, Japan) - Gen Kawatani (Sophia University, Japan) - Takako Kodate (Tokyo Woman's Christian University, Japan) - Yasuko Matsui (Tokai University, Japan) - Atsuki Nagao (Ochanomizu University, Japan) - Natsumi Oyamaguchi (Tokyo University of Science, Japan) - Toshinori Sakai (Tokai University, Japan; Chair) - Xuehou Tan (Tokai University, Japan) - Shin-ichi Tokunaga (Institute of Science Tokyo, Japan) - Yushi Uno (Osaka Metropolitan University, Japan) Contact: JCDCG^3 2026 Organizing Committee <jcdcggg_contact@googlegroups.com> ..A A .. ......ITO Hiro, Professor . ..... School of Informatics and Engineering, . @ @ .... The University of Electro-Communications . = x = . .... 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, JAPAN . . . . E-mail: itohiro@uec.ac.jp .(( (( ( .......................................... ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] 2nd CFP (keynote confirmed): The 9th International Conference on Algorithmic Decision Theory (ADT 2026)

The 9th International Conference on Algorithmic Decision Theory (ADT 2026) will be held at University Paris Dauphine-PSL on November 16-18, 2026 Established in 2009, the ADT conferences usually take place every two years with the aim of gathering researchers interested in the algorithmic aspects of decision theory. ADT seeks to bring together researchers and practitioners coming from diverse areas of Computer Science, Economics, and Operations Research in order to improve the theory and practice of modern decision support. Important Dates * Title and Abstract Submission: May 4th, 2026 * Full Paper Submission: May 11th, 2026 * Notification of acceptance: July 13th, 2026 * Final Version of Accepted Papers: August 11th, 2026 * Conference Dates: November 16th-18th, 2026 * Conference Webpage: https://adt2026.sciencesconf.org/ * Submission Webpage: https://cmt3.research.microsoft.com/ADT2026 Keynote speakers * Aurélie Beynier, Sorbonne Université * Marc Lanctot, Google Deepmind * Maria Polukarov, King's College London About ADT 2026 The 9th International Conference on Algorithmic Decision Theory (ADT 2026) focuses on algorithmic decision theory broadly defined, seeking to bring together researchers and practitioners coming from diverse areas of Computer Science, Economics, and Operations Research in order to improve the theory and practice of modern decision support. The conference topics include but not restricted to: * Algorithms * Argumentation Theory * Artificial Intelligence * Computational Social Choice * Database Systems * Decision Analysis * Discrete Mathematics * Game Theory * Machine Learning and Adversarial Machine Learning * Matching * Multi-agent Systems * Multiple Criteria Decision Aiding * Networks * Optimization * Preference Elicitation * Preference Modeling * Risk Analysis and Adversarial Risk Analysis * Utility Theory Submission Site and Details Submissions are invited on significant, original, and unpublished research on all aspects of Algorithmic Decision Theory. Papers must be at most 15 pages long in the LNCS format (including references). The formal proceedings of ADT 2026 will be published by Springer in the Lecture Notes in Artificial Intelligence (LNAI)<http://www.springer.com/lncs>. ADT 2026 will not accept any paper that, at the time of submission, has already been published in a journal or another venue with formally published proceedings. However, in order to accommodate the publication norms of the many fields that work on decision theory, papers can be submitted but not already published elsewhere (i.e., are under review) provided the authors note they are submitting for the non-proceedings track at the top of their submission. All papers will be peer-reviewed by a double-blind procedure. Therefore, papers must be submitted anonymously as pdf documents via the Microsoft CMT<https://cmt3.research.microsoft.com/ADT2026> system. It is important and required that authors do not reveal their identities in submitted papers. Since the review process is double blind, authors must take measures to ensure that their identity is not easily revealed from the submission itself. Authors should include the submission number (as assigned by the conference system) in the author field of the submission, and refer to their prior work in a neutral manner (i.e., instead of saying “We showed” say “XYZ et al. showed”). It is acceptable to submit work that has been presented in public or has appeared on arXiv, provided the submission itself is anonymized. Submission Format: Authors should consult Springer’s authors’ guidelines and use their proceedings templates<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>, either for LaTeX or for Word, for the preparation of their papers. Note that at least one author of each accepted paper is required to attend the conference to present the work. Authors will be required to agree to this requirement at the time of submission. In addition, the corresponding author of each accepted paper that will appear in the proceedings, acting on behalf of all of the authors of that paper, will need to complete and sign a Consent-to-Publish form, through which the copyright for their paper is transferred to Springer. You may submit an appendix of any length into the CMT system. There is a separate area in CMT for this, the appendix should be formatted in the same way as the main paper. Please note that reviewers are not required to review the appendix so the paper should stand on its own. To accommodate the publishing traditions of different fields, ADT 2026 will accept two types of submissions: Submissions with full text in the proceedings: Papers of this type will be accepted for either oral or poster presentation, or both. Each accepted paper of this type will be allocated at most 15 pages in the proceedings and there will be no distinction between papers accepted for oral or poster presentation in the conference proceedings. Submissions with two-pages abstract in the proceeding: Papers of this type will be accepted for either oral or poster presentation, or both. Each accepted paper of this type will appear as a two-pages abstract in the proceedings, along with a URL pointing to the full paper (on ArXiv or other service). This option is available to accommodate subsequent publication in venues that would not consider results that have been published in formal proceedings. Specifically, the full version of the two-pages abstract at ADT can be submitted to another archival conference or journal. Such papers must be formatted just like papers submitted for full-text publication, at the submission time, but authors are required to write “submission without proceedings” into the author field of their paper (instead of author names), if they choose this category. Otherwise, it will be assumed, by default, that their paper is submitted in the first category (submissions with full-text in the proceedings). ********************************************************** * * 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 Applications for Travel Grants (Deadline: April 17th, 2026)

4th European Summer School on Artificial Intelligence (ESSAI 2026) 2nd International Summer School on Bilateral AI 6-10 July 2026, Vienna, Austria https://essai2026.eu The purpose of travel grants is to support students who have limited or no access to other funding for supporting their attendance at ESSAI 2026. The amount of the travel grant awarded to each student will be 525€ (amount equal to the early registration fee for students). *** Deadline for submissions: April 17th, 2026 (updated deadline). *** *** Notification: April 27th, 2026 (updated deadline). *** Application details can be found at: https://essai2026.eu/grants.php *General Information* ESSAI is the annual summer school on AI held under the auspices of the European Association for Artificial Intelligence (EurAI), and in 2026 it will encompass the 2nd International Summer School on Bilateral AI. ESSAI is the largest school of broad AI in Europe, offering courses in all areas of Artificial Intelligence and from a wide range of perspectives. Its thematic scope is analogous to major AI conferences like ECAI, IJCAI and AAAI, covering all AI subdisciplines and their interconnections. ESSAI is a central meeting place for AI students and young researchers to deepen their knowledge, broaden their perspectives, discuss current research, and build connections with other researchers. *Registration is Open* Registration fees and dates can be found at: https://essai2026.eu/registration.php ***Early Registration Deadline: April 30, 2026*** ***Register now to secure your spot at ESSAI 2026!*** *Location* The fourth edition of ESSAI will be held in Vienna, a city where history and innovation walk side by side. Home to world-renowned universities and research centers, Vienna has inspired great thinkers for centuries—think of Erwin Schrödinger, Lise Meitner, Sigmund Freud, Kurt Gödel, Ludwig Wittgenstein, or the Vienna Circle. Today, Vienna continues to welcome students, scholars, and curious minds from around the globe. Vienna awaits you with world-class culture, groundbreaking science, and cozy coffee houses --- all in a city celebrated for its quality of life. *Tentative List of Long Courses* 1. AI for Autonomous Robots: Bridging Theory and Practice 2. Specification-Guided Reinforcement Learning 3. Introduction to Constraint Satisfaction 4. Why Is Symbolic Reasoning Computationally Hard? 5. Wikidata: A backbone for Hybrid/Bilateral AI 6. The Art of Compressing LLMs: Pruning, Distillation, and Quantization Demystified 7. Trustworthy AI 8. Data Driven Approaches in (Multi-objective) Bayesian Optimisation 9. Multi-Perspective Reasoning in Knowledge Representation: An Introduction to Standpoint Logic 10. Recommender Systems: Past, Present, and Future (Challenges) 11. Logic meets Learning 12. Beyond Breakpoints: AI for Software Fault Localization 13. Foundations of Concept-Based Interpretable Deep Learning 14. Learning Deep Low-dimensional Models from High-Dimensional Data: From Theory to Practice 15. Decision trees: from efficient prediction to responsible AI 16. Trustworthy Machine Learning from Data to Models 17. Reward and Constraint Learning: Foundations for Human-AI Alignment 18. Recurrent GNNs: The Power of Iteration 19. Knowledge Compilation: Theory, Practice, and Applications 20. AI for Fair and Transparent Decision-Making from Legal and Technical Perspectives 21. Uncertainty in Machine Learning: From Aleatoric to Epistemic 22. Tractable Circuits: A Common Language for Logic, Probability, and Neural Models 23. Modern Constraint Programming 24. From In-Context Learning to Neuro-Symbolic Reasoning with Large Reasoning Models More details on the program can be found at: https://essai2026.eu/ ********************************************************** * * 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] University Assistant (PostDoc) in the field of combinatorial probability at TU Graz

The Institute of Discrete Mathematics at TU Graz is looking to hire a University Assistant (PostDoc) in the field of combinatorial probability. The contract duration is 72 months, starting September 2026. Admission Requirements: PhD in mathematics Desired Qualification: * Solid knowledge and research experience in one or more of the following fields: enumerative combinatorics, analytic combinatorics, discrete probability, random discrete structures * Ability and willingness to conduct independent research in the above mentioned fields * Very good knowledge of German (required for teaching from the very beginning) and very good knowledge of English * Didactic suitability for the teaching tasks to be undertaken (especially with regard to teaching classes for engineering students and classes with a large number of participants) Application deadline 10 May 2026. For more details and a link to the application form, see the TU Graz Job Portal: https://jobs.tugraz.at/en/jobs/2d4663e1-1a2c-d7f2-0c90-69a6a6a02b83 ********************************************************** * * 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 CFP] LODAS 2026 – Learning & Optimization for Distributed AI Systems @ FLICS 2026 (Valencia, June 9–12)

Dear colleagues, _Apologies for any cross-posting._ ====================================== We are pleased to invite you to submit your contributions to LODAS 2026, The 1st International Workshop on Learning and Optimization for Distributed AI Systems, co-located with the FLICS 2026 Conference to be held in Valencia, Spain, June 9-12, 2026. *Submission deadline (extended): April 28, 2026* * Workshop website: https://jamaltoutouh.github.io/lodas2026/ * Conference website: https://flics-conference.org/ ====================================== SCOPE ====================================== Modern AI systems increasingly operate in distributed, edge, and resource-constrained environments. LODAS 2026 aims to bring together researchers working at the intersection of learning and optimization to address challenges in scalability, reliability, and efficiency for distributed AI systems. We welcome contributions addressing (but not limited to): * Federated, distributed, and edge learning * Communication-efficient and resource-aware AI * Multi-objective and constrained optimization * Workflow scheduling and system-level optimization * Agentic AI and autonomous multi-agent systems * Foundation models under system constraints * Trustworthy, privacy-preserving, and robust AI * Cyber-physical systems, IoT, and digital twins ====================================== Submission Information ====================================== Submissions must be made via EasyChair (details on the workshop website). Formatting: IEEE A4 Manuscript Templates for Conference Proceedings. ====================================== Paper types: ====================================== * Long papers: 7-8 pages (research contributions) * Short/position papers: 4-6 pages (work-in-progress or visionary ideas) * Poster papers (undergraduate): 1-2 pages ====================================== Important Dates ====================================== * Submission deadline (extended): April 28, 2026 * Notification of acceptance: May 5, 2026 * Camera-ready & registration: May 15, 2026 * Workshop date: June 9-12, 2026 (exact session date to be announced) ====================================== Organizing Committee ====================================== * Jamal Toutouh - University of Málaga, Spain * Gabriel Luque - University of Málaga, Spain * Diego Daniel Pedroza-Perez - University of Málaga, Spain We warmly encourage you to submit your latest work and to share this call with colleagues and relevant research mailing lists. Best regards, LODAS 2026 Workshop Organizing Team https://jamaltoutouh.github.io/lodas2026/ ********************************************************** * * 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] Invitation to the Third Tutorial of the 2026 QSR Tutorial Series

We invite you to participate in the last tutorial of the 2026 QSR Tutorial Series. The goal of the series is to provide QSR members and the general public with accessible, high-quality tutorials that expand their knowledge of emerging research areas and practical tools in quality, statistics, and reliability. The information of the last tutorial is below. We look forward to seeing you there! Reliability Models and Data Analysis for New Product Development Reliability testing, experimental design, and data analysis play a critical role in the development, estimation, and improvement of highly reliable products. To obtain high-quality reliability data, test equipment, stress profiles, and experimental designs must be carefully selected. Domain knowledge, such as physics-of-failure mechanisms, failure modes, and operating conditions, should be effectively incorporated into experimental design to ensure efficient data collection and accurate representation in the corresponding reliability models. For engineering teams involved in such efforts, a range of challenges related to equipment selection, statistical methodology, and cost constraints must be addressed. This 2-hour tutorial begins with an overview of widely used reliability testing techniques, statistical models, and test planning methods. The second part focuses on several "interesting" technical challenges and practical solutions we came up with for supporting engineers in reliability testing and data analysis during new product development. This tutorial is intended for a diverse audience, including engineering students, researchers, and industry professionals. Dr. Haitao Liao John & Mary Lib White Systems Integration Chair and Professor Department of Industrial Engineering University of Arkansas - Fayetteville Dr. Haitao Liao is the John & Mary Lib White Endowed Systems Integration Chair and a Professor in the Department of Industrial Engineering at the University of Arkansas, Fayetteville. He earned his Ph.D. in Industrial and Systems Engineering from Rutgers University in 2004, along with M.S. degrees in Industrial Engineering and Statistics from the same institution. He received his B.S. in Electrical Engineering from Beijing Institute of Technology. Dr. Liao's research focuses on reliability modeling, fault diagnosis and prognostics, smart maintenance, service logistics, risk-informed decision-making, and resilience of critical infrastructure. He has authored more than 130 journal articles in leading publications, including European Journal of Operational Research, Naval Research Logistics, IISE Transactions, Annals of Operations Research, IEEE Transactions on Reliability, Reliability Engineering & System Safety, and International Journal of Production Research. He is the recipient of several prestigious honors, including the National Science Foundation CAREER Award (2010) and the Alan O. Plait Award for Tutorial Excellence (2017). In addition, he has received numerous best paper awards from IISE, INFORMS, and the Society of Reliability Engineers. Dr. Liao currently serves as Associate Editor-in-Chief of IEEE Transactions on Reliability and is a Fellow of IISE. April 24, 2026 3:00pm (EDT) Zoom Link: https://kaist.zoom.us/j/86474411685 Kind regards, The Organizing Committee: Alan R. Vazquez, Tecnologico de Monterrey Heeyoung Kim, KAIST William Fisher, JMP ********************************************************** * * 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/ * **********************************************************