[DMANET] Postdoc position in Theoretical CS

Kindly advertise the job below. The Lane Department of Computer Science and Electrical Engineering at West Virginia University invites applications for a Postdoctoral Fellow in the general areas of theoretical computer science and algorithmic operations research, with an emphasis on computational complexity and game theory. A PhD in computer science and expertise in the areas of computational logic and game theory are required. The position is funded by NSF (Algorithmic Foundations) and is concerned with the designing efficient algorithms and establishing the computational complexity of selected problems in mathematical programming and combinatorial optimization. Responsibilities will include but are not limited to the following: conducting research on quantified polyhedral programming and quantified circuits, attending research conferences, reading scientific literature to keep abreast of technological advances and current research findings and teaching one course in theoretical computer science. The position is funded for two years, starting August 15, 2026. Applicants must submit a cover letter, curriculum vitae, and contact information for two professional references at this link: https://wvu.taleo.net/careersection/faculty/jobdetail.ftl?job=29316&tz=GMT-04%3A00&tzname=America%2FNew_York Contact K. Subramani (k.subramani@mail.wvu.edu) if you have questions. K. Subramani Professor LDCSEE West Virginia University ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * ********************************************************** ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] London Colloquia in Combinatorics 2026

The London Colloquia in Combinatorics will take place on 13 May 2026 at Queen Mary University London and 14 May 2026 at the London School of Economics and Political Science. More information about the event can be found here: https://2dcic.github.io/ As part of the colloquia, we will host a poster session on 14 May allowing PhD students in Discrete Mathematics and related areas to present their work. A best poster prize will be awarded during the evening reception that day. PhD students who wish to present a poster should apply by sending an email to Peter Allen (p.d.allen@lse.ac.uk) by Friday ​**1st May 2026**, with a title and abstract for their poster. Notifications for selected posters will be sent out by Monday 4th May 2026. Posters should be A1 in size and in portrait format. They should be brought in at the start of the LSE day of the Colloquia (14th May 2026). We will pay the reasonable costs of printing posters, and can print them locally if desired. PhD students are strongly encouraged to present a poster if they are planning to apply for travel funding to attend the colloquia, as funding priority will be given to PhD students who present posters. ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] XVIII Madrid UPM Machine Learning and Advanced Statistics Summer School (June 8th - June 19th, 2026)

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

[DMANET] Research Associate Position (Postdoc) at TU Dortmund

Dear colleagues, at the Faculty of Mathematics at TU Dortmund, a position as a research associate (TV‑L E13) is to be filled in the near future (there is some flexibility with the starting date) within a research project funded by the Federal Ministry of Research, Technology and Space and led by Professor Paul Manns. The goal of the research project is to combine reinforcement learning with global optimization algorithms (branch‑price‑and‑cut) for mission planning of heterogeneous fleets of autonomous surveillance and inspection robots. The project duration is two years. Main responsibilities are * Analysis, development, and implementation of a branch‑price‑and‑cut algorithm * Analysis, development, and implementation of a reinforcement learning method for the intended application. * Evaluation of the algorithms using the simulation environment and real‑world data provided by the project partner * Publication and presentation of results in international journals and at conferences Ideal candidate profile: * Solid knowledge of discrete optimization, ideally with a connection to vehicle routing problems, typically demonstrated through a relevant PhD in mathematics, computer science, or economics (operations research) * Strong programming skills in Python and/or C++ * Experience with modern AI methods such as reinforcement learning is an advantage * Excellent written and spoken communication skills in English Further information is available on request via email to paul.manns@tu-dortmund.de. Please feel free to forward this information to potential candidates. Thank you and best regards, Paul Manns ------------------------------------------------------ TU Dortmund University Paul Manns (he/him) Professor for Optimization Faculty of Mathematics Vogelpothsweg 87 44227 Dortmund Email: paul.manns@tu-dortmund.de Phone: +49 231 755 7242 ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] CPAIOR 2026 – Early Registration Deadline (April 20)

Dear colleagues, This is a final reminder that the *early registration deadline for CPAIOR 2026 is Monday, April 20.* The conference will take place from May 26 to May 29, 2026, at the ESSEC Business School campus in Rabat, Morocco. Registration and practical information are available on the conference website: https://sites.google.com/view/cpaior2026/home We encourage you to register before the deadline! *About Onomo Hotel special rate: *some participants experienced difficulties contacting the hotel, so we have updated the contact email on our website to a more responsive address. *Student accommodation in campus:* Please keep in mind that the *booking deadline for this option is set for Sunday, April 19 at 12:00 AM.* See details on our webpage. We look forward to welcoming you to Rabat! Best regards, Tias Guns Program Chair Diego Delle Donne and Emiliano Traversi Local Chairs ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] EuroTDP | Differential Privacy Workshop CFP | September 17 near Vienna, Austria

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

[DMANET] ALGOWIN 2026 - 1st Call for Papers

CALL FOR PAPERS ALGOWIN 2026 22nd International Symposium on Algorithmics of Wireless Networks September 3-4, 2026 L’Aquila, Italy (as part of ALGO 2026) Conference webpage: *https://algo-conference.org/2026/algowin/ * EasyChair link: *https://easychair.org/conferences/?conf=algowin2026 * ============== Important Dates ============== Submission deadline: June 29, 2026 (AoE) Notification: August 3, 2026 Camera-ready due: August 24, 2026 Conference: September 3-4, 2026 ===== Scope ===== The International Symposium on Algorithmics of Wireless Networks (ALGOWIN), previously known as ALGOSENSORS, is an international forum dedicated to the algorithmic aspects of wireless networks. It covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots, and drones. The focus is on the design and analysis of algorithms, models of computation, graph and network algorithms, and experimental analysis. ALGOWIN 2026 will be held at the University of L’Aquila. It will be part of ALGO 2026, which also hosts ESA, IPEC, ATMOS, ALGOCLOUD, WABI, and WAOA. =============== Keynote Speaker =============== There will be one keynote talk at ALGOWIN 2026. The invited speaker is: - Paola Flocchini (University of Ottawa, Canada). The invited talk will be integrated in the global ALGO program, as a joint keynote. ============= Call for Papers ============= Original research contributions are solicited related to diverse algorithmic aspects of sensor networks, wireless networks, broadly construed, as well as distributed robotics, including the theoretical, experimental and application perspectives. Topics of interest include, but are not limited to: - Ad Hoc Networks - Autonomous Mobile Robots - Communication Protocols - Complexity and Computability - Computational Models - Data Aggregation and Fusion - Distributed Aspects of Group Search - Distributed Consensus and Fault Tolerance - Dynamic Networks, Temporal Graphs - Energy Management, Power Saving Schemes - Game Theoretic Aspects - Infrastructure Discovery - Internet of Things - Localization - Medium Access Control - Mobility and Dynamics - Pattern Formation - Performance Evaluation, Experimental Analysis - Population Protocols, Swarm Computing - Radio Networks - Resource Efficiency - Routing and Data Propagation - Security and Privacy aspects - Self-stabilization, Self-* Properties - Sensor Networks - Systems and Testbeds - Time Synchronization - Topology Control - Tracking - Unmanned Autonomous Entities - Virtual Infrastructures =========== Committees =========== Program Committee - Ralf Klasing, CNRS and University of Bordeaux, France (chair) - Aris Pagourtzis, National Technical University of Athens and Archimedes AI, Greece (chair) - Prudence Wong, University of Liverpool, UK (chair) - Petra Berenbrink, Universität Hamburg, Germany - Davide Bilò, University of L'Aquila, Italy - Anya Chaturvedi, Arizona State University, USA - Li-Hsuan Chen , National Chung Cheng University, Taiwan - Shantanu Das, Aix-Marseille University, France - Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy - Antonio Fernández Anta, IMDEA Software & Networks Institutes, Spain - Florent Foucaud , Université Clermont Auvergne, France - Jie Gao, Rutgers University, USA - Leszek Gąsieniec, University of Liverpool, UK - Konstantinos Georgiou, Toronto Metropolitan University, Canada - Ling-Ju Hung, National Taipei University of Business, Taiwan - Tomasz Jurdziński , University of Wroclaw, Poland - Sushanta Karmakar, Indian Institute of Technology Guwahati, India - Evangelos Kranakis, Carleton University, Canada - Nikos Leonardos, National Technical University of Athens, Greece - Stefano Leucci, University of L'Aquila, Italy - Euripides Markou, University of Ioannina and Archimedes AI, Greece - George Mertzios , Durham University, UK - Othon Michail, University of Liverpool, UK - Hendrik Molter , Ben-Gurion University of the Negev, Israel - Tobias Mömke, Augsburg University, Germany - Nils Morawietz , University of Jena, Germany - William K. Moses Jr., Durham University, UK - Miguel A. Mosteiro, Pace University, USA - Paolo Penna, IOG, Switzerland - Alexandru Popa, University of Bucharest, Romania - Maria Potop-Butucaru, Sorbonne Université, France - Tomasz Radzik, King's College London, UK - Peter Rossmanith, RWTH Aachen University, Germany - Paul Spirakis, University of Liverpool, UK Steering Committee - Sotiris Nikoletseas, University of Patras and CTI, Greece (Chair) - Jie Gao, Rutgers University, USA - Magnús M. Halldórsson, Reykjavik University, Iceland - Bhaskar Krishnamachari, University of Southern California, USA - P. R. Kumar, Texas A&M University, USA - José Rolim, University of Geneva, Switzerland - Christian Scheideler, Paderborn University, Germany - Paul Spirakis, University of Liverpool, UK =========== Proceedings =========== The conference proceedings will be published in the Springer “Lecture Notes in Computer Science” series after the conference (publication expected November 2026). =========== Special Issue =========== Selected papers will be invited to a special issue of the Theoretical Computer Science journal. ======= Awards ======= Awards will be given to the best paper and the best student paper. The awards are kindly sponsored by Springer. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper. The program committee may decline to make these awards or may split them. ================ Paper Submission ================ Papers are to be submitted electronically using the EasyChair server (*https://easychair.org/conferences/?conf=algowin2026 *). The submissions must contain original results that have not already been published and are not concurrently submitted to a journal or conference with published proceedings. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors will register for ALGO/ALGOWIN 2026 and present the paper. Submissions must be in the form of a single pdf file prepared using the LNCS latex templates and style files (available, together with Springer's authors' guidelines, from *https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines *). Springer's proceedings LaTeX templates are also available on Overleaf (*https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj#.WsdHOy5uZpg *). Each submission should consist of the main part of the paper, not exceeding 12 pages (including the title page and excluding the references), plus an optional clearly marked appendix (to be read at the discretion of the program committee). Any figure pertaining to the main part of the paper should be included therein (within the 12 page limit). The first page must include an indication of whether the paper is eligible for the best student paper award. ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Two fully-funded PhD scholarships available for commencement in 2026

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

[DMANET] SC-Square 2026: Deadline Extension

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

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

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

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

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

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

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

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

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

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