[DMANET] Extended Deadline for Paper Submission: CALDAM 2027

Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2027 - Extended Deadline for Paper Submission The 13th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2027) will be organized by The LNM Institute of Information Technology, Jaipur, India from 11th to 13th of February 2027. Invited Speakers: *1. Ryuhei Uehara, Japan Advanced Institute of Science and Technology, Japan* *2. Niranjan Balachandran, Indian Institute of Technology Bombay, India* *3. Apurva Mudgal, Indian Institute of Technology Ropar, India* Conference webpage: https://caldam2027.lnmiit.ac.in/ Submission Link: https://easychair.org/conferences/?conf=caldam2027 Important Dates: *Last date for Paper Submission * *(Extended)* *: *September 21, 2026, AoE *September 28, 2026, AoE* *Revision of submission * *(Extended)* *: * September 23, 2026, AoE *September 30, 2026, AoE* Notification of Acceptance: November 13, 2026, AoE Camera-ready Version: November 27, 2026, AoE The detailed CFP can be found here: https://caldam2027.lnmiit.ac.in/call-for-papers CALDAM 2027 invites papers describing original research in the areas of design, analysis and experimental evaluation of algorithms and in discrete applied mathematics. An indicative list of sub-areas are given below. Papers must be typeset using LaTeX/LaTeX2e and may not exceed 14 pages in LNCS style, including bibliographic references. Further details may be included in a clearly marked appendix that will be read at the discretion of the program committee. Only electronic submission is allowed. Submitted papers must describe previously unpublished work and may not be submitted concurrently to another conference with refereed proceedings or to a refereed journal. Please find the guidelines for authors on the Springer website. CALDAM Topics: Approximation Algorithms | Combinatorial Algorithms | Combinatorics | Data Structures | Parallel and Distributed Algorithms | Combinatorial Geometry | Graph Drawing | Graph Theory | Computational Geometry | Online Algorithms | Network Optimization | | Randomized Algorithms | Parameterized Complexity | Theoretical Aspects of Machine Learning | Computational Learning Theory Proceedings: The proceedings of accepted papers of CALDAM 2027 will be published in the Lecture Notes in Computer Science (LNCS) by Springer. Also, selected papers of CALDAM 2027 are likely to be published in a special issue of the Theoretical Computer Science (TCS) journal of Elsevier and the Acta Informatica journal of Springer. With best regards B.S. Panda <https://web.iitd.ac.in/~bspanda/> Rishi Ranjan Singh <https://www.iitbhilai.ac.in/index.php?pid=rishi> PC Co-Chairs, CALDAM 2027 -- Dr. Rishi Ranjan Singh Associate Professor Dept. of Computer Science and Engineering, Indian Institute of Technology (IIT) Bhilai, Kutelabhata, Durg, Chhattisgarh, India, 491001 +91 831 805 1673 ********************************************************** * * 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] Positions in Bonn: full professor and assistant professor with tenure track

Dear colleagues, We welcome applications for two positions at our institute (http://www.or.uni-bonn.de) in Bonn, Germany: 1. a full professor (https://www.or.uni-bonn.de/stellenausschreibung/W3.pdf) 2. an assistant professor with tenure track (https://www.or.uni-bonn.de/stellenausschreibung/W1.pdf) The deadline is November 9. Please let me know if you have any questions. Best regards Jens Vygen ********************************************************** * * 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] [Habilitation Thesis Defense] Martin Krejca

Dear all, It is my great pleasure to invite you to my habilitation thesis defense on *October 9 (Friday), 2026* from *12 p.m. (noon, Paris time) onward* in *room 26-00/534* of the *Jussieu campus*, Paris, France. The thesis is titled /Understanding Complex Behavior Emerging From Randomized Processes in Artificial Intelligence/ and is online available at the following link. The abstract and the jury are at the end of this e-mail. https://www.lix.polytechnique.fr/Labo/Martin.KREJCA/files/hdr-thesis/emergence-of-complexity-in-ai.pdf You can *join online* with the following link: *https://rendez-vous.renater.fr/private/HDR_Defense_Krejca_id_53539c99cefc1de44b49accbacad2bb3c72d62f8218aaccd66bf8908caae71cc__uws-7r9fkgbr_b9d93e-f5f9e7-8ca614* *If you intend to join online*, please contact me (martin.krejca@polytechnique.edu) so that I can provide you with the password that is required for joining. *If you intend to join on-site*, then please register with the following link by October 4. Space is /immensely/ scarce, limited to 8 seats, so I will need to make a selection if the demand is too high. If possible, please prefer to join online. https://evento.renater.fr/survey/martin-krejca-hdr-defense-ih885iad If you wish the join the celebration after the defense, then please register with the following link by October 4. https://evento.renater.fr/survey/martin-krejca-hdr-celebration-hlkoawhv I am happy to see you both online or on-site! Best regards, Martin *Abstract* Artificial intelligence (AI) is a vast area in computer science that spans various research directions. Many of these directions analyze or improve state-of-the-art models, forming the /core/ of modern AI research. The remaining directions investigate less prominent AI approaches, methods supporting the state of the art, or topics that are also studied using modern AI models. These constitute the /wider/ AI area and provide an important extension of the core. In this thesis, I summarize my scientific contributions to two fields that fall into the wider AI area: multi-objective evolutionary algorithms (MOEAs) and stochastic infection processes. MOEAs are optimization heuristics that construct complex solutions to hard problems by iteratively applying simple operations—a concept also present in other AI methods. Moreover, evolutionary principles are used in order to enhance existing AI approaches, acting as supporting tools. On the other hand, stochastic infection processes model spreading phenomena in networks, which are frequently subject to investigation via modern AI tools. The processes underlying both of these areas are similar, with simple iterative decisions resulting in overall complex behavior. This allows studying them via similar approaches, which forms the basis of my research. My main goal is to derive mathematically rigorous guarantees for such processes that provide deep insights for the reasons of the complex behavior that we observe. Since my PhD, my line of research in these two areas has led to several publications, most of them at top AI venues. In this thesis, I discuss these contributions, describe how I use these topics to educate a new generation of researchers, and I provide an overview of my vision for how I will contribute to these areas in the future. For MOEAs, my contributions analyze the impact of different operations on the performance of state-of-the-art algorithms. We find that some operations have issues or bottlenecks, and we provide better alternatives that can provably result in drastic performance improvements. For stochastic infection processes, we pioneer the fully rigorous analysis of an established model where infected agents can be temporarily immune, and we study the influence of diminishing and of increasing infection rates. Notably, we find that the exact definition of immunity plays a crucial role in the resulting behavior. *Jury* *Christoph Dürr*, Sorbonne University, France, /Head of jury/ *Joshua Knowles*, Schlumberger Cambridge Research, UK, /Reviewer/ *Johannes Lengler*, ETH Zurich, Switzerland, /Reviewer/ *Jonathan E. Rowe,* University of Birmingham, UK, /Reviewer/ *Carlos A. Coello Coello*, CINVESTAV-IPN, Mexico, /Jury member/ *Marc Schoenauer*, INRIA, France, /Jury member/ ********************************************************** * * 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] Bridges between proofs, communication, and computation, Cambridge, November 30 – December 4, 2026

Dear colleagues, This is to announce the following workshop at Cambridge. November 30 – December 4, 2026 Isaac Newton Institute for Mathematical Sciences, University of Cambridge https://www.newton.ac.uk/event/lfcw03/ Registration deadline: *September 20, 2026* This workshop will bring together researchers from several areas of complexity to discuss recent connections between proof complexity and computation. These connections often rely on ideas and techniques from communication complexity, algebraic complexity, circuit complexity, and the complexity of total search problems. They have led to new perspectives on the power and limitations of proof systems, and to new methods for establishing complexity lower bounds and unprovability results. The talks will focus on developments in and around proof complexity, including communication-based lower-bound methods, lifting theorems, algebraic techniques, circuit lower bounds, and connections with search problems. The workshop will provide a forum for presenting current research with emphasis on lower bounds, barriers, and connections between different models of computation and proofs. Best wishes, Iddo -- Professor Iddo Tzameret Chair in Computational Complexity Department of Computing Imperial College London Huxley Building South Kensington Campus London, SW7 2AZ E-mail: i.tzameret@imperial.ac.uk Website: https://www.doc.ic.ac.uk/~itzamere/ ********************************************************** * * 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] Erdos Center postdoc application deadline looming!

The Erdos Center at the Renyi Institute organizes a Special Semester on Ordered Combinatorics, January 1-June 30, 2027. For more information, see https://erdoscenter.renyi.hu/articles/simons-semester-ordered-combinatorics-2027-spring The first major event in the framework of the program will be a Winter School for PhD students and early career combinatorists working In Order and Structure in Geometry, January 18-22, 2027. There will be three minicourses Andreas Holmsen (KAIST) — Intersection patterns and homological minors Cosmin Pohoata (Emory) — The Erdős–Szekeres problem Géza Tóth (Rényi) — Crossing numbers of graphs HURRY UP! Registration for the School will end on September 30. LESS THAN TWO WEEKS FROM NOW Cheers, Penny Haxell, Janos Pach, Gabor Tardos, Ji Zeng,! ********************************************************** * * 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] In-person workshop October 5th: Optimization for Interpretable Machine Learning – Registration reminder

Dear colleagues, A quick reminder about our upcoming *in-person workshop* *Optimization for Interpretable Machine Learning: Classification and Clustering* to be held on *Monday, October 5, 2026*, at *ESSEC Business School, Cergy (Paris area), France*. The workshop will bring together researchers working at the interface of Mathematical Optimization and Machine Learning, with a particular focus on classification, clustering, interpretability, and structured learning models. The *updated *list of invited speakers is: - *Zacharie Alès* — ENSTA Paris, UMA Laboratory, France - *Lavinia Amorosi* — Sapienza University of Rome, Italy - *Farnaz Farzania* — Copenhagen Business School, Denmark - *Javier Marenco* — Universidad Torcuato Di Tella, Argentina - *Justo Puerto* — IMUS, University of Seville, Spain - *Fabian Wilschewski* — University of Duisburg-Essen, Germany The *workshop program is now available on the event website*, together with further information and the registration form: https://sites.google.com/essec.edu/oiml-workshop/home Participation is free of charge, but registration is required. *Registration will remain open until Friday, September 25.* We hope to see many of you in Cergy! Best regards, *Diego Delle Donne* ESSEC Business School ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Postdoc at the University of Sydney

A postdoctoral position is available in theoretical computer science with me at the University of Sydney on topics related to reactive synthesis, nondeterministic planning, and decision theory. The appointment is initially for 2 years, with the possibility of extension. The starting date is flexible, but expected around early 2027. The successful candidate will join the Sydney Algorithms and Computing Theory group working in foundational aspects of computer science (usyd-sact.github.io/). Application link: tinyurl.com/cmfe4s58 For informal enquiries, feel free to contact me at sasha.rubin@sydney.edu.au ********************************************************** * * 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] Faculty Positions in Mathematics at KFUPM

The Department of Mathematics at King Fahd University of Petroleum & Minerals (KFUPM) invites applications for Assistant, Associate, and Full Professor positions in Mathematics. Interested candidates are invited to see the full advertisement and apply through MathJobs.org: https://www.mathjobs.org/jobs/list/25020 ********************************************************** * * 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 Marne-la-Vallée (near Paris, France), deadline September 30

A PhD position is available in Marne-la-Vallée (near Paris, France) for the ANR Project PLASMA. In this project, we have brought together theoretical computer scientists with a shared interest in providing mathematical insights into real-world implementations. Beyond conducting detailed studies of key implementations, our primary goal is to develop a comprehensive theoretical framework for analyzing modern algorithms and data structures, which could be used to guide the evolutions of these algorithms, with an emphasis on modeling modern computer architecture. Additionally, we aim to create mathematical models that capture the key statistical properties of real-world data and validate these models against state-of-the-art implementations. Position: - Full-time for 3 years, starting at the very beginning of January 2027 (or sooner). - In the Analysis of Algorithms subteam of the CS lab of Université Gustave Eiffel (5 permanent researchers and 3 PhD students). - Possibility of a co-supervision with the CS lab of Université de Caen Normandie. Topics: - The exact topic will be determined with the PhD student, at the boundary between the actual implementation of algorithms in contemporary programming languages and the combinatorial and probabilistic tools used to analyze them. It can be more on the CS side or on the analysis side. - The candidate must be specialized in algorithmics, combinatorics, or discrete probability, while having some notions of and an interest in all three areas. Low-level programming skills are not required, but are certainly an asset for these topics. Applications: Send an email with your application in only one pdf file to Cyril Nicaud ( [ mailto:cyril.nicaud@univ-eiffel.fr | cyril.nicaud@univ-eiffel.fr ] ) and Julien Courtiel ( [ mailto:julien.courtiel@unicaen.fr | julien.courtiel@unicaen.fr ] ) before ** September 30 ** containing: - A short motivation letter - A curriculum vitae (CV) - Transcripts of records for your Bachelor's and Master's studies - Your master's thesis (or a draft) - The email addresses of two references we can contact You can contact Cyril Nicaud ( [ mailto:cyril..nicaud@univ-eiffel.fr | cyril.nicaud@univ-eiffel.fr ] ) and Julien Courtiel ( [ mailto:julien.courtiel@unicaen.fr | julien.courtiel@unicaen.fr ] ) for more information. ********************************************************** * * 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 Computational Geometry and Computational Topology at TU Eindhoven

TLDR: PhD position in Computational Geometry and Computational Topology at TU Eindhoven (TU/e) Apply here by October 2: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry-and-computational-topology The Project Computational geometry and computational topology are areas of research focused on the design and analysis of algorithms for spatial data. These algorithms typically leverage geometric and topological structure present in the data to obtain efficient solutions. This project focuses on computing similarities between networks in a spatial context, such as networks embedded in the Euclidean plane, or on a terrain. We intend to develop topology- and geometry-aware graph edit distances, drawing inspiration from well-studied variants of the Fréchet distance between curves. This project has a vacancy for one PhD student. Tasks As a PhD student working on the project, your main task will be to perform research, in close collaboration with your advisory team and others involved in the project. The advisory team consists of dr. Tim Ophelders and prof. dr. Bettina Speckmann. One PhD student is already working on the project. Your tasks as a PhD student also include participating in international conferences and workshops to present your results. Besides working on your research project, you will also assist in some algorithms-related courses, as a teaching assistant (TA). You will be working in the TU/e Algorithms cluster (algo.win.tue.nl<https://algo.win.tue.nl/>), one of the largest research groups world-wide that focuses on algorithms research. The cluster is known for its research in computational geometry and topology, algorithms for spatiotemporal data, and algorithmic visualization, as well as graph and FPT algorithms. The cluster provides a lively and international environment for your research. As a PhD student, you do need not speak Dutch: it is easy to get by with English, not only at the university (where all courses are taught in English) but also in everyday life. Requirements - A master’s degree (or an equivalent university degree) in computer science or mathematics, with a strong background in algorithms. - A passion for research in computational geometry and computational topology - An interest in teaching algorithms-related courses - Fluency in spoken and written English (C1 level) Employment Benefits - 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), with a year-end bonus of 8.3% and annual vacation pay of 8%. - An excellent technical infrastructure, on-campus children's day care and sports facilities. - A staff immigration team and a tax compensation scheme for international candidates. Applying All applications should be submitted through the TU/e application website: https://www.tue.nl/en/working-at-tue/vacancy-overview/phd-in-computational-geometry-and-computational-topology For full consideration, apply by October 2, 2026. Questions If you have questions about the position or project, please contact dr. Tim Ophelders (t.a.e.ophelders@tue.nl<mailto:t.a.e.ophelders@tue.nl>) ********************************************************** * * 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: SAND 2027 in Paderborn, Germany

Dear DMANET community, Please note the upcoming submission deadline for SAND. Cheers, Stefan ====================================== SAND 2027: Call for Papers ====================================== The 6th Symposium on Algorithmic Foundations of Dynamic Networks June 30 - July 2, 2027 Paderborn, Germany https://sand2027.cs.upb.de/ <https://sand2027.cs.upb.de/> ====================================== Dates ====================================== Submission Deadline: December 8, 2026, 23:59 AoE Notification: February 26, 2027 Camera-ready version: March 27, 2027 Conference: June 30 - July 2, 2027 ====================================== Scope ====================================== The Symposium on Algorithmic Foundations of Dynamic Networks is a primary venue for original research on the fundamental aspects of computing in dynamic networks and dynamic computational processes. Broadly, the conference and its community aim to improve understanding of the role of dynamics in computing. We seek high-quality contributions related to this aim from all viewpoints, including theory, design, analysis, and applications, and welcome both conceptual and technical contributions, as well as novel ideas and new problems. Topics of interest include, but are not limited to: - Bio-inspired, physical, and chemical dynamic models - Boolean networks - Complex systems, financial, social, and transportation networks - Computability and complexity within dynamic networks - Continuous models of dynamic networks - Distributed computation in dynamic networks - Dynamic graph algorithms - Dynamically reconfigurable networks and graph reconfiguration - Dynamics of games, puzzles, and gadget systems - Fault tolerance, network self-organization, and formation - Geometric dynamic models - Information spreading, gossiping, and epidemics - IoT, cloud, edge, and fog computing - Learning approaches for dynamic networks - Multilayer, peer-to-peer, and overlay networks - New models for dynamic networks - Offline and online algorithms for dynamic networks - Population protocols and chemical reaction networks - Randomness in dynamic networks - Reconfigurable and swarm robotics, programmable matter, and DNA self-assembly - Streaming models - Temporal data and dynamic network analysis - Temporal graphs - Wireless networks, mobile computing, and autonomous agents ====================================== Paper Submission ====================================== Papers should be submitted electronically through Easychair (https://easychair.org/conferences/?conf=sand2027). Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs ( https://submission.dagstuhl.de/series/details/5#author) with \documentclass[a4paper,anonymous,USenglish]{lipics-v2021}. Submissions must be anonymous, without any author names, affiliations, or email addresses. SAND accepts two types of submissions: regular papers and brief announcements. A regular paper submission must be original research and report on novel results that have not appeared or been concurrently submitted to a journal or a conference with published proceedings. Every regular paper submission must be at most *15 pages*, excluding references, plus an (optional) appendix. The main part of the submission (i.e. the *15 pages*) should contain a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. There is no guarantee that the reviewers will read the (optional) appendix; this will only be read at the discretion of the Program Committee. The appendix can contain missing proofs from the main text, or it can just be the full version of the paper, this decision is left to the authors. A brief announcement submission may report on preliminary work or work presented elsewhere. The title of a brief announcement submission should begin with "Brief Announcement: ". Papers submitted as brief announcements should include presentation of their merits within *5 pages* plus at most 1 extra page of references, plus an (optional) appendix (as described above). The program committee may decide that some of the regular papers not selected for publication are suitable for publication in the brief announcement format. The authors of any such paper will be asked to prepare a brief announcement final version out of their original regular submission. By default, every regular paper submission will be considered as a potential brief announcement, if it is not accepted as a regular paper. Any authors who *do not* wish their regular paper submission to be considered for the brief announcement format in case of rejection, are asked to clearly indicate this on the first page of their submission, for example by adding above or below the title "NOT eligible for brief announcement". ====================================== Instructions for Double-Blind Review ====================================== The reviewing process is double-blind, the authors' names must not be included in the paper, and the writing of the manuscript should be done in such a way to not de-anonymize authors (e.g., instead of, our result [1], they should use, the result of [1]). We assume that reviewers do not actively try to recognize the authors. Therefore, authors are allowed to publish their results on pre-print services before or at any point of the submission/reviewing process. Non-anonymous submissions will be rejected. ====================================== Use of AI Tools ====================================== If any AI tools were used in preparing a submission (beyond copyediting or use of internet search tools), the nature of the usage should be disclosed in the submission for the sake of transparency. If AI tools are used, authors remain accountable for the content of the paper, including avoiding plagiarism and providing appropriate citations of sources. ====================================== Publication ====================================== The conference proceedings will be published by LIPIcs. The final version of the paper must be formatted following the LIPIcs guidelines ( https://submission.dagstuhl.de/documentation/authors). Papers accepted in full will have 15 pages in the final proceedings (excluding references). Any papers accepted in the brief announcement format will have 5 pages in the final proceedings plus at most 1 extra page of references. Extended and revised versions of selected papers will be considered for a special issue of a journal. For every accepted regular paper and brief announcement, at least one of the authors must fully register and present the paper during the conference and according to the conference program. Any paper accepted but not presented will be withdrawn from the final proceedings. ====================================== Awards ====================================== All regular papers are eligible for the best paper award. Regular papers co-authored by at least one full-time student may also be eligible for the best student paper award. For a paper to be considered for the best student paper award, at least one author who is a full-time student at the time of submission should have made a significant contribution to the paper. In case the authors think that their paper is eligible for the best student paper award, they should clearly indicate this on the first page of their submission, for example by adding above or below the title "Eligible for the best student paper award". ====================================== Organization ====================================== Program Chairs: - Thomas Erlebach, Durham University, UK - Stefan Schmid, TU Berlin, Germany Program Committee: - Daniel Amir, Technion, Israel - Thomas Bellitto, LIP6, Sorbonne University, France - Quentin Bramas, University of Strasbourg, France - Petra Berenbrink, University of Hamburg, Germany - Keren Censor-Hillel, Technion, Israel - Anya Chaturvedi, Arizona State University, USA - Robert Elsässer, University of Salzburg, Austria - Yuval Emek, Technion, Israel - Jessica Enright, University of Glasgow, UK - Klaus-Tycho Foerster, TU Dortmund, Germany - Sebastian Forster, University of Salzburg, Austria - Olga Goussevskaia, Federal University of Minas Gerais, Brazil - Kathrin Hanauer, University of Vienna, Austria - David Ilcinkas, University of Bordeaux, France - Frank Kammer, University of Applied Sciences Mittelhessen, Germany - Stefano Leucci, University of L'Aquila, Italy - Yannic Maus, TU Graz, Austria - Othon Michail, University of Patras, Greece - Hendrik Molter, Ben-Gurion University of the Negev, Israel - Nils Morawietz, Friedrich Schiller University Jena, Germany - Thomas Nowak, ENS Paris-Saclay, France - Fukuhito Ooshita, University of Hyogo, Japan - Maria Potop-Butucaru, LIP6, Sorbonne University, France - Andrea Richa, Arizona State University, USA - Ulrich Schmid, TU Wien, Austria - Ana Silva, Federal University of Ceará, Brazil - George Skretas, Hasso Plattner Institute, Germany - Jiri Srba, Aalborg University, Denmark - John Sylvester, University of Liverpool, UK - Tegan Wilson, Northeastern University, USA and University of Wisconsin Madison, USA - Damien Woods, Maynooth University, Ireland - Timothy R. Wylie, University of Texas Rio Grande Valley, USA Organizing Committee: Paderborn University, Germany: - Christian Scheideler (chair) - Matthias Fischer (treasurer) - Petra Schäfermeyer (hotel and social event) - Thomas Thissen (webmaster) Steering Committee: - Othon Michail, University of Patras, Greece (SC chair) - Arnaud Casteigts, University of Geneva, Switzerland (SC vice chair) - Thomas Erlebach, Durham University, UK (PC chair 2027) - Stefan Schmid, Technical University of Berlin, Germany (PC chair 2027) - George Mertzios, Durham University, UK (PC chair 2026) - Andrea Richa, Arizona State University, USA (PC chair 2026) - Christian Scheideler, Paderborn University, Germany (General chair 2027) Advisory Board: - James Aspnes, Yale University, USA - Luca Becchetti, University of Rome Sapienza, Italy - Arnaud Casteigts, University of Geneva, Switzerland - Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy - Paola Flocchini, University of Ottawa, Canada - George Mertzios, Durham University, UK - Othon Michail, University of Patras, Greece - Rotem Oshman, Tel Aviv University, Israel - Nicola Santoro, Carleton University, Canada - Paul Spirakis, University of Liverpool, UK - Viktor Zamaraev, University of Liverpool, UK -- Prof. Dr. Stefan Schmid Intelligent Networks (INET) TU Berlin, Germany Research group at TU Berlin: https://www.tu.berlin/en/eninet Research group at Weizenbaum Institute: https://plamadiso.weizenbaum-institut.de/ <https://plamadiso.weizenbaum-institut.de/> Personal: *https://schmiste.github.io/ <https://schmiste.github.io/>* ********************************************************** * * 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 Positions at the IBS Discrete Mathematics Group (DIMAG) (Due: November 30, 2026)

The IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea invites applications for four research fellowship positions (senior researcher positions). DIMAG is a research group that was established on December 1, 2018 at the Institute for Basic Science (IBS), led by its Chief Investigator (CI) Sang-il Oum. DIMAG is located at the headquarters of IBS in Daejeon, South Korea, a city of 1.5 million people. Website : https://dimag.ibs.re.kr/ Currently, DIMAG consists of researchers from various countries and the work is done in English. DIMAG is co-located with the IBS Extremal Combinatorics and Probability Group (ECOPRO). Successful candidates for the research fellowship positions will be new or recent PhDs with outstanding research potential in all fields of Discrete Mathematics with emphasis on Structural Graph Theory, Extremal Graph Theory, Combinatorial Optimization, Matroid Theory, and Algorithms. This appointment is for about two years, and the starting salary is no less than KRW 66,000,000. The appointment is one-time renewable up to 5 years in total, contingent upon the outstanding performance of the researcher. The expected appointment date is September 1, 2027, and it can be adjusted to earlier or later, but no later than December 1, 2027. This is purely a research position and will have no teaching duties. However, if desired, successful candidates may have the opportunity to teach at KAIST. A complete application packet should include: 1. AMS standard cover sheet (preferred) or cover letter (PDF format) 2. Curriculum vitae including a list of publications and preprints (PDF format) 3. Research statement (PDF format) 4. Consent to Collection and Use of Personal Information (form available on the application page) 5. 3 recommendation letters For full consideration, applicants should upload items 1, 2, 3, and 4 on the application website (https://dimag.ibs.re.kr/apply) by November 30, 2026 (Anywhere on Earth (AoE)), and arrange their recommendation letters to be submitted directly by the letter writers through the link sent via email during the online application process by December 1, 2026 (Anywhere on Earth (AoE)). Based on the information entered during the online application process, a submission link will be sent to each recommender. Only recommendation letters submitted directly by the recommender will be accepted. Applications with missing required documents will not be considered. DIMAG encourages applications from individuals of diverse backgrounds. For Korean citizens who have not yet completed their military duty: 전문연구요원 종사를 희망하는 경우에는 지원 의사와 병역 관계를 cover letter 등에 표시하여 제출 필요. 다만 현역입영대상자의 전문연구요원 신규 편입은 불가하며, 보충역 대상자 및 타 기관에서 전직해서 오는 경우에 한하여 지원 가능(전직 요건이 충족 되어야만 함) Inquiry: dimag _@_ ibs.re.kr (remove _) -- Sang-il Oum (엄상일) https://sangil.dimag.kr/ CI (Chief Investigator) of the IBS Discrete Mathematics Group. Distinguished Research Fellow (수석연구위원), Institute for Basic Science (IBS). ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] New Python package: HITSpy: High-Performance Tabu Search in Python - max score estimator

Dear all, I would like to announce that the Python package HITSpy is available on GitHub, a sister project to the recently announced R package HITSr. The aim is to compute efficiently the maximum score estimator of Manski (1975) in Python, with C++ under the hood for efficiency using OpenMP parallelization. The package supports large sample size and number of parameters. It uses the Hyperplanes Intersection Tabu Search Algorithm (Florios et al., 2025). The Python package is designed to work just like HITSr R package, but for Python users. Key technical features: - Feature 1: HITS algorithm, https://doi.org/10.1016/j.softx.2025.102164, added OpenMP functionality during the neighborhood exploration step - Feature 2: C++ under the hood for efficiency, Python interface for ease of use - Feature 3: pybind11 integration - Feature 4: Solves the estimation of Manski (1975) estimator, https://doi.org/10.1016/0304-4076(75)90032-9, without proving optimality, but supports large datasets (sample size, number of parameters) - Feature 5: Multiple-start runs demo example is provided in Python Repository: https://github.com/kflorios/hitspy Feedback on API design, portability, accuracy and speed is welcome. Best regards, Kostas Florios PhD Operational Research National Technical University of Athens ********************************************************** * * 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] AAMAS 2027 Second CFP + call for self nominations for PC members

Greetings from AAMAS 2027 and Apologies for cross-posting. In this email: - Second call for papers for main track - Call for self-nominations of PC members - Reciprocal Reviewing policy =============================================================== We invite submissions to the 26th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2027), to be held in Hanoi, Vietnam, from 3 to 7 May 2027. Submissions for AAMAS 2027 are on OpenReview: https://openreview.net/group?id=ifaamas.org/AAMAS/2027/Conference - Author registration on OpenReview: 17 Sep 2026 - Abstract submission: 1 Oct 2026 - Paper submission: 8 Oct 2026 - Rebuttal period: 20 - 24 Nov 2026 - Author notification: 21 Dec 2026 - Camera-ready paper: 25 Jan 2027 - Conference: 3 - 7 May 2027 All deadlines are at the end of the specified day, Anywhere on Earth (UTC-12). AAMAS welcomes significant and original research across the full breadth of autonomous agents and multiagent systems, covering established areas as well as emerging topics such as generative and agentic AI. MORE INFORMATION Conference website: https://warwick.ac.uk/fac/sci/dcs/aamas2027/ Full Call for Papers: https://warwick.ac.uk/fac/sci/dcs/aamas2027/calls/ Submission instructions: https://warwick.ac.uk/fac/sci/dcs/aamas2027/calls/instructions/ Findings of AAMAS: https://warwick.ac.uk/fac/sci/dcs/aamas2027/calls/findings/ Please note that all authors must have an OpenReview account, and abstract registration is required before the full-paper submission deadline. Please refer to the conference website for the complete submission, formatting, reviewing, and publication policies. We look forward to receiving your submissions and to welcoming you to AAMAS 2027 in Hanoi. Please feel free to forward this Call for Papers to colleagues, research groups, and relevant mailing lists. ================================================================ Call for Reviewer Self-Nominations ----------------------------------------------- We invite members of the community who are interested in serving as reviewers for AAMAS 2027 to submit a self-nomination through the following form: https://forms.gle/3vd99yvWqNdYqhYR7 We warmly welcome self-nominations across all AAMAS areas. In particular, we would be especially pleased to receive additional nominations in Learning and Adaptation (LEARN), Search, Optimization, Planning, and Scheduling (SOPS), Generative and Agentic AI (GAAI), and Game Theory and Economic Paradigms (GTEP), where strengthening the reviewer pool would be particularly helpful. Reviewing is one of the ways in which we collectively sustain the quality of our research community. The broader the participation, the more evenly the workload can be shared, allowing each reviewer to handle a smaller and more manageable set of papers. The form includes the reviewer eligibility requirements and asks for basic OpenReview information and areas of expertise. Candidates who are recruited will subsequently be asked to complete the official Reviewer Registration in OpenReview, which is a separate step in the AAMAS 2027 reviewing workflow. That registration will collect the more detailed expertise information, including area-specific topics, needed for paper matching and assignment. Thank you very much for considering contributing to AAMAS 2027. Best regards, AAMAS 2027 Program Chairs ============================================================= Reciprocal Reviewer Policy ------------------------------ Each submission must designate at least one qualified author who agrees to serve as a reviewer for AAMAS. - The designated author must meet the qualification criteria defined in the AAMAS Reviewer Guidelines. Exceptions A submission is exempt from this requirement if: - None of the authors is qualified under the “Reviewer Eligibility section” in the Reviewer Guidelines; or - All qualified authors are serving as Area Chairs (ACs), Senior Program Committee (SPC), or in other official organizing roles for AAMAS 2027. Read the full policy on the AAMAS website: https://warwick.ac.uk/fac/sci/dcs/aamas2027/calls/reciprocal-reviewer-policy/ ======================================================== ********************************************************** * * 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] IEEE 4th International Conference on Computing, Management and Telecommunications |December 14–17, 2025 | Madrid, Spain (Hybrid Event)

IEEE ComManTel 2025 4th International Conference on Computing, Management and Telecommunications *December 14–17, 2025 | Madrid, Spain (Hybrid Event)* Sponsored by the IEEE Spain Section 📢 Call for Papers Dear Moayad Aloqaily, We cordially invite you to submit your original research to *ComManTel 2025*, the 4th International Conference on Computing, Management and Telecommunications. This premier venue brings together researchers, engineers, and professionals to present cutting-edge findings across computing technologies, information management, and telecommunications systems. 🎯 Topics of Interest 🖥️ Computing Technologies - Parallel and distributed computing - High-performance and cloud computing - Green computing and energy-aware IT - Artificial intelligence and generative AI - Data mining and cybersecurity 🧠 IT Management - Digital transformation strategies - Agile and project management - Data governance and enterprise systems - E-commerce and E-government - Analytics-driven decision-making 📡 Telecommunications - 5G/6G and future wireless systems - Cognitive radio and IoT - Network virtualization and SDN - Smart city communication - Telecom cybersecurity ⚙️ Systems Engineering - Automation and robotics - Smart manufacturing and industrial IoT - Biomedical engineering systems - Environmental systems - Sustainable infrastructure 📋 Submission Guidelines *Paper Length:* Up to 6 pages, IEEE format *Submission System:* https://edas.info/N33725 <https://h2fgu.r.ag.d.sendibm3.com/mk/cl/f/sh/6rqJfgq8dINmNdUs8nAM2D5LKI5/NdjQ9iNMIjb_> *Requirements:* Original work, not under review elsewhere, following conference formatting guidelines 🗓️ Important Dates Activity Deadline Full/Short Paper Submission *September 15, 2025* Poster/Demo Submission *September 29, 2025* Notification (Full/Short Paper) *October 29, 2025* Notification (Poster/Demo) *October 15, 2025* Camera-Ready Submission *November 29, 2025* Submit Your Paper <https://h2fgu.r.ag.d.sendibm3.com/mk/cl/f/sh/6rqJfgq8dIPRQ5n1d6ZtxoDGxb7/H737OQzHBDGH> Conference Website <https://h2fgu.r.ag.d.sendibm3.com/mk/cl/f/sh/6rqJfgq8dIR6SY5B7PzRtPLCau9/mGapOgkVELvO> We look forward to receiving your high-quality submissions and welcoming you to Madrid for this exciting conference! Best regards, *ComManTel 2025 Organizing Committee* IEEE ComManTel 2025 - 4th International Conference on Computing, Management and Telecommunications Website: https://commantel.net/2025/ <https://h2fgu.r.ag.d.sendibm3.com/mk/cl/f/sh/6rqJfgq8dISlV0NKbjOzp0T8EDB/1sz7UjIFd608> Email: info@comcomap.net Sponsored by the IEEE Spain Section ********************************************************** * * 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] KolKom 2026: call for contributed talks (Berlin, November 13–14)

Dear colleagues, The 43rd Kolloquium über Kombinatorik (KolKom) will take place on November 13–14, 2026, at IMoS, TU Berlin, with support from MATH+ and ZIB. The meeting brings together researchers from across combinatorics and discrete mathematics for four plenary lectures and contributed talks. Plenary speakers are: - Maria Axenovich (KIT Karlsruhe) - Matthew Kwan (IST Austria) - Monique Laurent (CWI Amsterdam and Tilburg University) - Mohit Singh (Georgia Tech) Contributed talks from all areas of combinatorics and discrete mathematics are welcome. PhD students and postdocs are particularly encouraged to submit, including work in progress. Talks are 20 minutes plus 5 minutes for questions. The submission deadline is October 4, and the registration deadline is October 16. Details, submissions, and registration: https://kolkom26.zib.de/ I hope to see you in Berlin! Best wishes, Christoph Spiegel ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Simons-Berkeley Research Fellowships for Fall 2027

The Simons Institute for the Theory of Computing invites applications for Simons-Berkeley Research Fellowships and Long-Term Visitors for the Fall 2027 semester. Simons-Berkeley Research Fellowships are intended for exceptional scientists to participate in at least one of the semester-long programs at the institute. Long-term visitors must be active researchers in the field and must be beyond their postdoctoral years. The Institute will host a programs on "Diffusion Generative Modeling" in Fall 2027. The application portal will open October 1st and the deadline for receipt of both applications is December 1, 2026. For more information, see the call for applications <https://simons.berkeley.edu/research-fellowship-call-applications> and the Long-Term Visitor Application <https://simons.berkeley.edu/long-term-visitor-application-call-applications> . Thanks for helping us spread the word about these opportunities. -- Nikhil Srivastava Interim Associate Director Simons Institute for the Theory of Computing ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] =?Windows-1252?Q?[CFP]_Deadline:_October_16, _2026_=96_The_5th_Internation?= al Workshop on TwinNetApp in conjunction with IEEE WCNC 2027 | Panama City, Panama

We apologize if you receive multiple copies of this CFPs. We appreciate your help to contribute & forward this CFPs to your friends. =============================================== Call for Papers The Fifth International Workshop on Data Driven and AI-Enabled Digital Twin Networks and Applications (TwinNetApp) in conjunction with IEEE WCNC 2027 April 5-8, 2027 - Panama City, Panama Workshop Website: https://wcnc-twinnetapp.bcrg.uk<https://wcnc-twinnetapp.bcrg.uk/> Conference Website: https://wcnc2027.ieee-wcnc.org =============================================== Digital Twin (DT) technology is becoming a key component of next-generation communication networks by enabling real-time synchronization between physical systems and their virtual counterparts. Moving beyond conventional simulation, DTs provide real-time monitoring, predictive modelling, data-driven decision-making, and advanced what-if analysis. Their integration with emerging technologies, such as 5G/6G, Generative AI, Intelligent IoT, Edge/Fog Computing, and quantum technologies further expands their potential. In this context, the fifth TwinNetApp welcomes original research contributions on the design, implementation, and evaluation of DT-enabled applications. Bringing together researchers and industry professionals, the workshop provides a multidisciplinary environment to explore the role of DTs in developing sustainable and intelligent communication infrastructures. Topics of interest include, but are not limited to: * Data-driven DT networks for real-time communication systems * DT-enabled IoT applications * DT in Edge/Fog/Cloud Computing * Real-time communication protocols for DT networks * Security and privacy in DT networks * Quantum-enabled DT networks * DT-assisted AI applications for smart cities * Communication protocols for enabling DT deployment in real-world applications * Energy-aware DT networks * DT for Reconfigurable Intelligent Surfaces (RIS) * DT for enhanced Mobile Broadband (eMBB), massive Machine Type Communications (mMTC), and Ultra Reliable Low Latency Communications (URLLC) applications • DT for resource management and network optimization * DT-enabled health applications * Real-world DT simulations, prototypes, and testbed demonstrations General Chairs * Dr. Kubra Duran, Edinburgh Napier University, UK (K.Duran@napier.ac.uk<mailto:K.Duran@napier.ac.uk>) * Prof. Berk Canberk, Edinburgh Napier University, UK (B.Canberk@napier.ac.uk<mailto:B.Canberk@napier.ac.uk>) * Prof. Octavia A. Dobre, Memorial University, Canada (odobre@mun.ca<mailto:odobre@mun.ca>) * Prof. Marco Di Renzo, Université Paris-Saclay, CNRS-CentraleSupélec, France & King’s College London, UK (marco.1.di_renzo@kcl.ac.uk<mailto:marco.1.di_renzo@kcl.ac.uk>) Important Dates & Info. =============================================== Paper Submission Deadline: October 16, 2026 Notification of Acceptance: January 22, 2027 Camera Ready: February 18, 2027 Best Paper Award for outstanding contributions. The page length limit for all initial submissions for review is SIX (6) printed pages (10-point font) and must be written in English. Initial submissions longer than SIX (6) pages will be rejected without review. EDAS paper submission link will be activated soon. 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] [CFP] Special Session on Evolutionary Computation for Explainable and Trustworthy AI @ EvoApps 2027 (EvoStar)

Dear Colleagues, We are pleased to invite submissions to the Special Session on *Evolutionary Computation for Explainable and Trustworthy AI*, held as part of *EvoApps 2027* at the upcoming *EvoStar 2027* conference. Call for Papers Artificial Intelligence systems are increasingly deployed in domains where predictive accuracy alone is insufficient—decisions must also be understandable, reliable, robust, and open to scrutiny. Many explainability and trustworthiness problems involve competing objectives, complex search spaces, discrete or structured representations, and constraints that traditional optimization methods struggle to address. Evolutionary computation is particularly well-suited to these challenges. Population-based search can generate diverse explanations, explicitly balance criteria such as fidelity, stability, diversity, and plausibility, operate with non-differentiable models, and optimize symbolic, rule-based, visual, prototype-based, or counterfactual representations. This special session provides a focused forum for researchers developing evolutionary and bio-inspired approaches to the generation, optimization, evaluation, and auditing of explanations and intrinsically interpretable AI systems. Scope & Topics of Interest We welcome methodological contributions, evaluation studies, benchmarks, and real-world applications across machine learning, computer vision, image processing, and related areas, including (but not limited to): - *Explanation Generation:* Evolutionary generation and optimization of local/global, counterfactual, causal recourse, and actionable explanations. - *Interpretable Models:* Genetic programming, symbolic regression, rule learning, fuzzy systems, and neuroevolution for transparent or self-explainable models. - *Representation & Discovery:* Prototype-, example-, concept-, and case-based explanations, as well as feature selection/construction for explainability. - *Computer Vision & Multimodal AI:* Evolutionary visual explanations for image processing, computer vision, deep models, and foundation models. - *Trustworthiness & Auditing:* Evolutionary optimization and analysis of robustness, fairness, uncertainty, bias, and automated testing of black-box models. - *Specialized Approaches:* Quality-diversity methods for multiple valid explanations, human-in-the-loop/interactive evolutionary explainability, and explainable evolutionary reinforcement learning. - *Evaluation:* Benchmarks, metrics, reproducibility, scalability, and user-centered evaluation. More Information: https://www.evostar.org/2027/evoapps/ecxtai/ Organizers - *Diego Oliva* — Universidad de Guadalajara, Mexico ( diego.oliva@cucei.udg.mx) - *Oscar Ramos-Soto* — Universidad de Guadalajara, Mexico ( oscar.ramos9279@alumnos.udg.mx) - *Fernando Lezama* — GECAD – Polytechnic of Porto, Portugal ( flz@isep.ipp.pt) - *Saul Zapotecas-Martínez* — Instituto Nacional de Astrofísica, Óptica y Electrónica, Mexico (szapotecas@inaoep.mx) We look forward to receiving your contributions! Feel free to forward this call to colleagues who may be interested. Best regards, *The Session 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] New R package: HITSr: High-Performance Tabu Search in R - max score estimator

Dear all, I would like to announce the availability of a new R package, HITSr, now hosted on GitHub. The package provides parallel OpenMP C++ calculation of the maximum score estimator (Manski, 1975) using the Hyperplanes Intersection Tabu Search algorithm (Florios et al., 2025). It is intended for users working with binary choice models, mainly in Econometrics, and for developers who may want to integrate these routines into larger computational workflows. Key technical features: - Feature 1: HITS algorithm, https://doi.org/10.1016/j.softx.2025.102164, added OpenMP functionality during the neighborhood exploration step - Feature 2: C++ under the hood for efficiency, R interface for ease of use - Feature 3: Rcpp integration - Feature 4: Solves the estimation of Manski (1975) estimator, https://doi.org/10.1016/0304-4076(75)90032-9, without proving optimality, but supports large datasets (sample size, number of parameters) - Feature 5: Multiple-start runs demo example is provided in R Implementation details: - Written in R with Rcpp components where performance‑critical. - Documented via roxygen2; includes reproducible examples. - Supports Linux/macOS/Windows. - Tested on Windows. Repository: https://github.com/kflorios/hitsr Feedback on API design, portability, accuracy and speed is welcome. Best regards, Kostas Florios PhD Operational Research National Technical University of Athens ********************************************************** * * 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] Special Session on Computational Intelligence applied to Sustainability @ EvoApps 2027 (EvoStar)

Dear Colleagues We are happy to invite you to the Special Session in Computational Intelligence applied to Sustainability, held as part of EvoApps 2027 at the upcoming EvoStar 2027 conference (https://www.evostar.org/2027/). The application of Computational Intelligence techniques to sustainability is a fast-growing field, yielding innovative solutions in areas like wind farm optimization, land use, water distribution, smart grids, and AI-driven decision support in healthcare. This special session seeks to bring together researchers and practitioners to explore the latest advancements in applying Computational Intelligence to sustainability, with a focus on methodologies that directly or indirectly address one or more SDGs (https://sdgs.un.org/goals). Topics of interest include, but are not limited to: - Renewable Energy Systems: Optimization of energy generation, distribution, and storage. - Smart Cities: Design and management of resilient, sustainable urban environments. - Agriculture and Food Security: Sustainable farming practices, precision agriculture, and food supply chain optimization. - Environmental Monitoring and Management: Applications in pollution control, conservation, and natural resource management. - Healthcare and Well-being: AI-driven diagnostics, telemedicine, and optimization of healthcare systems. - Water Resources Management: Efficient distribution, usage, and conservation of water resources. - Sustainable Manufacturing and Industry 4.0: Green manufacturing processes, waste reduction, and lifecycle assessment. - Risk Reduction and Management: Early warning systems for natural disasters, climate change risk assessment, response optimization, and resilience building. - Circular Economy: Strategies for waste minimization, recycling, and sustainable product design. We welcome original research, review articles, and case studies that demonstrate the potential of Computational Intelligence to create sustainable solutions and drive progress toward the SDGs. Contributions that highlight interdisciplinary approaches and real-world implementations are particularly encouraged. More Information: https://www.evostar.org/2027/evoapps/cis/ Submission Details - Page limit: 14 pages, Springer LNCS format. - Submission link and details: https://www.evostar.org/2027/submit-paper/ Important Dates - Submission deadline: November 1, 2026 (AoE) - EvoStar 2027: March 31- April 2, 2027 Organisers - Valentino Santucci - University for Foreigners of Perugia, Italy - valentino.santucci(at)unistrapg.it - Fabio Caraffini - Swansea University, UK - Fabio.caraffini(at)swansea.ac.uk - Jamal Toutouh - University of Malaga, Spain - jamal(at)uma.es - Lucia Ballerini - University for Foreigners of Perugia, Italy - lucia.ballerini(at)unistrapg.it —-- Prof. Jamal Toutouh Tenured Professor - University of Málaga – jamal@uma.es 🌐 website: jamal.es ********************************************************** * * 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 Economics and Computation at Imperial College London

Dear Colleagues, Applications are invited for a PhD student in Economics and Computation under the supervision of Aris Filos-Ratsikas at Imperial College London, see more information below. Imperial College London has 4 PhD application deadlines during the year (October/December/February/April). For full funding consideration, please apply by 1st October 2026. The starting date of the PhD would be 1st October 2027. More information on how to apply can be found here: https://www.imperial.ac.uk/computing/prospective-students/courses/phd/phd-application-guidelines/ For informal inquiries, prospective applicants are encouraged to contact Aris Filos-Ratsikas directly at Aris.Filos-Ratsikas@imperial.ac.uk <mailto:Aris.Filos-Ratsikas@imperial.ac.uk>. Information for the PhD position: The area of Economics and Computation studies problems of an economic nature from the perspective of computer science. This includes areas such as Algorithmic Game Theory and Mechanism Design, Social Choice Theory, and Fair Division. These problems are characterised by a set of agents that have preferences over a set of possible outcomes, and the goal is to design good algorithms for aggregating those preferences, or for studying the outcomes of the strategic interactions between those agents. Potential themes for the PhD project are the fair division of divisible and indivisible resources, the distortion in social choice theory, or the computational complexity of problems related to equilibrium computation in games or markets. Ideal candidates for the PhD studentships will have an interest and an existing background in theoretical computer science and algorithm design and analysis. Experience with algorithmic game theory or social choice theory is desirable, but not required. In general, candidates with a strong mathematical background are very welcome to apply. ********************************************************** * * 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] CSTA 2026: The IEEE co-sponsored International Conference on Cybersecurity Systems, Technologies and Applications, 8 - 10 December, 2026 | San Antonio, USA.

[Apologies if you got multiple copies of this invitation] The International Conference on Cybersecurity Systems, Technologies and Applications (CSTA 2026) https://emergingtechnet.org/CSTA2026/index.php 8 - 10 December, 2026 | San Antonio, USA. Hybrid Event and Technically Co-Sponsored by IEEE Lone Star Section *CSTA 2026 CFP:* The International Conference on Cybersecurity Systems, Technologies and applications (CSTA 2026) is a lively and inclusive gathering where researchers, academics, and industry professionals from across the globe come together to explore the latest advancements in Cybersecurity Systems and intelligent systems. Cybersecurity Systems received a lot of attention as AI continues to reshape industries and push the boundaries of what’s possible. CSTA 2026 creates a welcoming space for innovation, collaboration, and the exchange of ideas in the Cybersecurity domain. CSTA 2026 serves as a premier platform for researchers, academics, and industry professionals to converge and explore the latest advancements, challenges, and applications in the dynamic fields of Cybersecurity Models and Systems. The International Conference on Cybersecurity Systems, Technologies and applications (CSTA 2026) aims to bring together leading researchers, academics, and practitioners from around the world to share their latest findings, innovations, and applications in Artificial Intelligence and intelligent systems. CSTA 2026 provides a premier interdisciplinary platform for presenting advances and exchanging insights on the theoretical foundations, cutting-edge technologies, and real-world implementations of AI. CSTA 2026 will feature keynote talks, technical paper sessions, workshops, and tutorials covering a wide range of Cybersecurity topics. We invite submissions of high-quality research papers describing original and unpublished results in all areas of Artificial Intelligence Systems. addresses the use of advanced intelligent systems in providing cybersecurity solutions in many fields, and the challenges, approaches, and future directions. We invite the submission of original papers on all topics related to Intelligent Systems with special interest in but not limited to: · Cybersecurity and Data-Driven Systems · Cybersecurity based Machine Learning and Data-Driven Systems · Cybersecurity and Multimodal AI · Cybersecurity for Generative AI, Foundation Models, and Large Language Models · Cybersecurity Computer Vision, Image and Video Processing Systems · Cybersecurity in Generative AI, Foundation Models, and Large Language Models · Artificial Intelligence Systems Security · Computational Language and Human-Centered Systems · Cybersecurity for Cloud, Edge systems · Cybersecurity Applications *Submissions Guidelines and Proceedings* Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11" two-column format. All papers should be in PDF format, and submitted electronically at Paper Submission Link. A full paper can be up to 8 pages (including all figures, tables and references). Length of short papers can be up to 6 pages. Submitted papers must present original unpublished research that is not currently under review for any other conference or journal. All submissions are peer-reviewed by at least three reviewers. Accepted papers will appear in the conference Proceeding, and to be submitted to IEEE Xplore for inclusion. *Important Dates:* - *Paper submission deadline: 10 September 2026* - Notification of acceptance: 1 November 2026 - Camera-ready Submission: 15 November 2026 *Contact:* Please send any inquiry on CSTA to: emergingtechnetwork@gmail.com ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Two open-rank academic positions in Operations Research at CORE, UCLouvain

Dear colleagues, The Center for Operations Research and Econometrics (CORE) at the Université catholique de Louvain (UCLouvain), Belgium, invites applications for two open-rank academic positions in Operations Research: 1. Academic position in "Optimization and Learning for Data-Driven Decision Systems" Full announcement and application details: https://jobs.uclouvain.be/PersonnelAcademique/job/An-academic-in-Optimization-and-Learning-for-Data-Driven-Decision-systems/1433460333/ This position focuses on developing a strong, internationally visible research agenda in mathematical optimization and its integration with data science and machine learning for decision systems. Areas of interest include one or more of the following: advanced optimization methods (linear, integer, stochastic, robust, distributionally robust, and chance-constrained optimization); predictive and prescriptive analytics bridging forecasting and decision-making; learning-integrated decision frameworks (predict-then-optimize, decision-focused learning, and reinforcement learning); and algorithmic decision models combining mathematical programming with AI techniques. The successful candidate is expected to play an active role within the Louvain Institute for Data Analysis and Modeling (LIDAM), and more specifically within CORE, by participating in academic events, publishing in leading journals in operations research, mathematical programming, and machine learning, supervising doctoral students, and collaborating actively with researchers at CORE, LIDAM, and the Institute of Information and Communication Technologies, Electronics, and Applied Mathematics (ICTEAM). 2. Academic position in "Quantitative Supply Chain Management" Full announcement and application details: https://jobs.uclouvain.be/PersonnelAcademique/job/An-academic-in-Quantitative-Supply-Chain-Management/1433540233/ This position focuses on developing an internationally visible research agenda addressing complex decision and optimization problems in one or more of the following areas: supply chain design, planning, and operations at strategic, tactical, and operational levels, including sourcing, production, inventory, distribution, and transportation. Representative applications include, but are not limited to, network design, supplier selection and contract design, pricing and tariff optimization, production planning and scheduling, inventory control, routing, and decision-making under risk and uncertainty, including reliability and resilience considerations. The research program is grounded in mathematical programming, with expected expertise in integer, stochastic, robust, and distributionally robust optimization applied to complex logistics problems. The integration of optimization with data-driven approaches, leveraging statistical and econometric methods to improve uncertainty modeling and support real-world decision-making, is a valued extension of the research agenda. The successful candidate is expected to play an active role within LIDAM, and more specifically within CORE, by participating in academic events, publishing in leading journals in operations research and management science, supervising doctoral students, and collaborating actively with researchers at CORE, LIDAM, and related institutes, including the Louvain Research Institute in Management and Organizations (LOURIM) and ICTEAM. The teaching load associated with both positions may involve courses taught in English and French, at both bachelor’s and master’s levels, across the campuses of the Louvain School of Management (LSM). Knowledge of French is not required at the beginning of the appointment, but candidates are expected to acquire it before confirmation of the appointment. For further information, please feel free to contact: Daniele Catanzaro Professor of Discrete Optimization President, Center for Operations Research and Econometrics (CORE) Université catholique de Louvain Voie du Roman Pays 34, L1.03.01 B-1348 Louvain-la-Neuve, Belgium Apologies for any cross-posting, and thank you for helping us circulate these opportunities widely. ********************************************************** * * 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] EuroVis 2027: Call for workshops

EuroVis 2027: Call for workshops We solicit workshops related to all areas of visualization. These informal workshops in EuroVis provide a setting for participants to discuss advanced topics in visualization, involve experts and practitioners in the field, disseminate work in progress, and promote new ideas. Workshops at EuroVis are open to all registered attendees (“invitation only” workshops will not be approved). Important Dates * Proposal Submission Monday, October 12, 2026 * Notification Monday, October 26, 2026 * All deadlines are at 11:59 pm (23:59) Anywhere on Earth (AoE)<https://time.is/Anywhere_on_Earth>. Workshops should: * Emphasize emerging ideas, concepts, or technologies that are currently too nascent or too interdisciplinary for a full symposium; * Encourage active participation from the audience and create opportunities not only for the presenters but all attendees to contribute to the outcomes of the workshop, for example, through collective or small group discussions. * Be open to and experiment with non-traditional submission types (e.g., demonstrations; artwork; pedagogical material; high-quality, standalone talks; etc.) Possible topics may include emerging or persisting problems, developing research agendas, networking to find common interests and possibilities for cooperation, interacting with domain experts involving analysis of their domain problems, bringing together new disciplines, etc. When choosing workshop topics to propose, please consider pre-approved workshops, EGPGV and EuroVA, and try to avoid large overlaps. Note that workshops remain extremely well attended, but as new associated events and publication formats are introduced to EuroVis, the number of submitted papers may drop from previous years. So, a more interactive format (rather than one based mainly on presentations of submitted papers) is encouraged. Submission requirements Workshop proposals should include: * a title, * the contact details of the organizers, * a brief description of the organizers’ background, related publications, and research, * the planned activities (e.g., mainly talks, mainly interactive sessions, a mix), including an outline schedule for the program—workshops are strongly encouraged, though not required, to consider ways to engage all participants interactively, * the intended result and impact of the workshop, * a brief justification for why this workshop is necessary (e.g., why would the topic benefit from a more informal setting, in what ways is the topic emergent or a relatively poor fit for the main conference program, etc.), * a chosen measure for a successful CFP (e.g., number of submissions), possibly including an outline for a “backup policy” (e.g., changing the workshop format or voluntarily withdrawing the workshop before acceptance notification is sent, but should not require the workshop organizers to submit emergency papers to their own workshop), * a statement of the organization and the development of the list of participants (intended size, detailed selection procedures, and timeline for finalizing workshop presenters), * a list of any special technology needed, * the number of poster slots requested, if the workshop intends to feature posters, and * the proposed dates for the call for participation, author notification, and camera-ready deadlines (author notification must be before the early registration deadline for EuroVis; for inclusion of materials in the EG digital library and/or the downloadable proceedings, the camera-ready deadline must be 4 weeks prior to the conference). Because the number of workshop time slots is limited, half-day workshop proposals are strongly encouraged. However, well-justified full-day proposals will also be considered. Full-day proposals may optionally state what changes would be implemented to allow the workshop schedule to fit within a half day. If the proposed workshop is a follow-up of a previous workshop, please include a critical reflection of the prior workshop(s), including a discussion of the results and evidence of impact. The proposal should not exceed four pages. Please use the template file from https://www.eurovis2025.lu/fileadmin/files/egPublStyle-EuroVis_full-short-stars-posters-edu_2025.zip Attendance At least one author for each paper must register and attend the conference in person. Evaluation criteria The workshops aim to include various topics and a healthy mix of new and recurring events. Repeat submissions will be partially judged by the previous workshop's success. Workshop success will be judged subjectively, but popularity, research impact, visibility, and attendee feedback will all be considered. Specifically, the workshop proposals will be evaluated according to the following criteria: * The potential for inspiring people, being influential, and opening new lines of research, * The degree to which the workshop provides a more interactive environment for participants—all things being equal, preference will be given to workshops that emphasize participant interaction, * The coherence of the proposed topic and the degree to which it would benefit from a workshop environment, * The ability to attract people and make them excited about the workshop, * The appropriateness with respect to EuroVis topics, * If this workshop has special needs, the feasibility of the proposed plan, including financial, logistics, scheduling, and coordination impact, is also important. The workshop chairs will balance the proposed topics to support the diversity of topics within EuroVis and complement the main program. Organizers should consider what steps they will take to encourage diverse participants in their workshop (e.g., a balance of experience, background, gender, etc.) to make participation as inclusive as possible. If accepted, workshops are required to prepare a short summary (50–100 words) for the workshop website and the web program. Workshop Chairs * Angelos Chatzimparmpas, Utrecht University * Cagatay Turkay, University of Warwick * Tanja Blascheck, University of Stuttgart ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] Postdoctoral Fellow positions in Computer Science

Postdoctoral Fellow positions in Computer Science The Helsinki Institute for Information Technology (HIIT) is seeking Postdoctoral Fellows to join the Helsinki region information technology research community. The position is intended support early-career researchers on their road towards being independent researchers, in collaboration with one or more supervisors in HIIT Faculty. The position gives the fellows excellent opportunities for high-quality and high-impact research and for creating research networks supporting their careers. The deadline for applications is October 4th, 2026 at 11:59 PM (23:59 UTC+03:00). More information (including the application link) is available at https://www.hiit.fi/hiit-postdoctoral-fellow-positions-in-computer-science ********************************************************** * * 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] Job opportunity in Australia (one week left to apply)

Monash University in Melbourne, Australia is looking to hire a discrete mathematician for a continuing research and teaching position in an established and highly successful discrete mathematics research group. For full details of the position including selection criteria see: https://careers.pageuppeople.com/513/cw/en/job/694429/lecturersenior-lecturer-in-discrete-mathematics The deadline for applications is imminent: *Sunday 13 Sep* Australian time (and be aware that we are nearly a full day ahead of some parts of the world). Please circulate to anyone in the job market. For inquiries, please contact me at ian.wanless@monash.edu Prof Ian Wanless ********************************************************** * * 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] evoApplications 30th International Conference on the Applications of Evolutionary Computation - 31 March - 2 April 2027

evoApplications - 30th International Conference on the Applications of Evolutionary Computation. http://www.evostar.org/2027/evoapps/ Dear Colleague(s), Below you will find the call for papers for evoApplications * 2027. *Deadline*: November 1, 2026. *Venue*: Mainz, Germany Feel free to distribute and thank you for your time. Apologies for the cross-posting. EvoApplications, the International Conference on the Applications of Evolutionary Computation -formerly known as EvoWorkshops- brings together researchers in applications of Evolutionary Computation and other Nature-inspired techniques. EvoApplications invites high quality contributions for its 30th edition, which will be held as part of the EvoStar 2027 event and co-located within EvoStar with four related conferences: EuroGP, EvoCOP, EvoLearn, and EvoMUSART. The aim of EvoApplications is to create a friendly environment that can lead to the establishment or strengthening of scientific collaborations and exchanges among attendees. Therefore, EvoApplications solicits high-quality original research papers (including significant work-in-progress) on any aspect of applications of Evolutionary Computation, both to real-world or methodological contexts in which Evolutionary Computation can contribute to pushing the limits of the state of the art beyond the present ones. We encourage you to submit papers focused on interesting, relevant and original works that are related to all kinds of applications of Evolutionary Computation. EvoApplications Conference Proceedings in SpringerLink <https://link.springer.com/conference/evoapplications> (since 2009) EvoWorkshops Conference Proceedings in SpringerLink <https://link.springer.com/conference/evoworkshops> (from 1999 to 2008) *Conference programme chairs* - *Josefa Díaz-Álvarez* University of Extremadura *mjdiaz (at) unex.es <http://unex.es/>* - *Jamal Toutouh* University of Malaga *jamal (at) uma.es <http://uma.es/>* *Publication chair* - *Harald Michael Ludwig* TU Wien, Austria *harald.ludwig (at) tuwien.ac.at <http://tuwien.ac.at/>* *Submission Details* Accepted papers will be published by Springer Nature in the Lecture Notes in Computer Science series. Submissions must be original and not published elsewhere. They will be peer reviewed by at least three members of the program committee. The reviewing process will be *double-blind, so please omit information about the authors in the submitted paper*. Follow these instructions <https://www.evostar.org/2027/submit-paper/> to submit a paper. -- Jamal Toutouh El Alamin ********************************************************** * * 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] IEEE ComComAp 2026 - CFP - Paphos, Cyprus [Deadline Extended]

Call for Papers *IEEE ComComAp 2026* The 2026 8th Computing, Communications and IoT Applications Conference The 2026 8th IEEE Computing, Communications and IoT Applications Conference (IEEE ComComAp 2026) will be held from *December 14–17, 2026* in *Paphos, Cyprus*. The conference will be organized as a *hybrid event*. IEEE ComComAp 2026 invites researchers, practitioners, and industry experts to submit original research papers, short papers, posters, and demos in the areas of computing, communications, Internet of Things, and related emerging technologies. Topics of Interest - Internet of Things and smart applications - Cloud, edge, and fog computing - Wireless and mobile communications - 5G, 6G, and future networks - Artificial intelligence and machine learning applications - Cybersecurity, privacy, and trust - Smart cities and intelligent systems - Data analytics and big data applications - Distributed systems and networking - AR/VR and emerging computing technologies Important Dates *Full/Short Paper Submission Due:* September 15, 2026 (Extended) *Conference Dates:* December 14–17, 2026 Submission Authors are invited to submit original and unpublished work through the conference submission system. *Submission Link:* https://conferences.sparcly.ai/ComComAp2026 Publication Accepted and presented papers are expected to be submitted for inclusion in the conference proceedings, subject to meeting all publication requirements. Conference Website For more information, please visit: https://comcomap.net/2026/ *IEEE ComComAp 2026* December 14–17, 2026 | Paphos, Cyprus | Hybrid Event --Regards, ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************

[DMANET] ICAA 2027 - Final Call for Papers

ICAA 2027 Final Call for Papers (Submission Deadline Extended) =============================== International Conference on Applied Algorithms ICAA 2027, Kolkata, India, January 06 - 08, 2027 (In Hybrid Mode) Department of Computer Sc. & Engg. Heritage Institute of Technology =============================== Email: icaa@heritageit.edu URL:https://icaa.co.in Call for Papers =============== The conference seeks original contributions related to design, analysis, implementation, and experimental evaluation of efficient algorithms and data structures for problems with relevant real-world applications. We seek contributions that demonstrate novel algorithmic approaches, computational techniques, innovative applications of algorithms in real-world scenarios and case studies showcasing the impact of algorithms in solving complex problems. Submissions should present significant algorithmic contributions supported by analysis and/or experimental evaluation clearly highlighting the motivating application. Papers on industrial applications with strong algorithmic content are welcome and should emphasize real-world implementations of systems or provide analytical insights based on real-world datasets with industrial applications. Keynote Speakers ================ Janos Pach, Renyi Institute, Budapest, Hungary and EFPL, Switzerland Sourav Chakraborty, ISI, Kolkata, India Sumanta Ghosh, ISI, Kolkata, India Maharaj Mukherjee, Bank of America, New York, USA (Online) Danilo Pelusi, University of Teramo, Italy (Online) Submission Instructions ======================= Authors are invited to submit papers on original research on Applied Algorithms. Simultaneous submission to a journal or another conference with refereed proceedings is not allowed. The Proceedings of ICAA 2027 will be published as a Springer Verlag LNCS volume. Papers must be prepared using LaTeX/LaTeX2e and should not exceed 12 pages in Springer Verlag LNCS style. The LNCS style file must be used without altering margins and font size. The paper must be submitted as a .pdf file using Microsoft CMT. An appendix of a maximum of two pages may be added during submission to include additional results, and this will be read at the discretion of the reviewers. Important Dates =============== Paper Deadline: 16 September, 2026 (FINAL) Notification of Acceptance: 25 October, 2026 Camera Ready Papers due: 31 October, 2026 Author Registration starts: 31 October, 2026 Early Bird Registration by: 15 November, 2026 Conference Starts: 06 January 2027 All dates are AoE Topics of Interest ================== We solicit contributions covering various areas including but not limited to the following topics: Graph Algorithms Electronic Design Automation Computational Biology Algorithmic Microfluidics Computational Geometry Social Network Analysis Approximation Algorithms Cryptography and Network Security Randomized Algorithms Energy Efficient Algorithms Spatial Informatics and GIS Quantum Computing Discrete Geometry Number Theoretic Algorithms Machine Learning Algorithms Natural Language Processing Deep Learning Algorithms Computer Vision Reinforcement Learning Algorithms Data Mining Heuristic Search Logic and Reasoning Generative AI Optimization Algorithms Recommender Systems Robotics Image Processing Neuromorphic Computing Program Committee ================= Akash Agrawal, Meta, Menlo Park, CA, USA Amitava Mukherjee, BITS Pilani, Dubai, UAE Andrzej Lingas, Lund University, Sweden Anindya Halder, North Eastern Hill University, Shillong, India Anirban Bhar, SRM University, India Aniruddha Dasgupta, Bluebell Research, Australia Anup K. Sen, Heritage Institute of Technology, Kolkata, India Anurina Tarafdar, Heritage Institute of Technology, Kolkata, India Arijit Karati, National Sun Yat-Sen University, Taiwan Asit Kumar Das, IIEST Shibpur, Howrah, India B. Uma Shankar, ISI Kolkata, India Bhaskar Dasgupta, University of Illinois at Chicago, USA Bruhadeshwar Bezawada, South Arkansas University, USA Christos Zaroliagis, University of Patras, Greece (Co-Chair) C.V. Jawahar, IIIT Hyderabad Daniele Frigioni, University of L'Aquilla, Via Vetoio, Italy Deba Prasad Mandal, ISI Kolkata, India Debranjan Sarkar, Heritage Institute of Technology, Kolkata, India Deeksha Arya, University of Tokyo, Japan Deepika Prakash, JK Lakshmipat University, Jaipur, India Diganta Sengupta, Heritage Institute of Technology, Kolkata, India Dinabandhu Bhandari, Heritage Institute of Technology, Kolkata, India Elisavet Konstantinou, University of the Aegean, Greece Haider Banka, IIT Dhanbad, India Joydeep Das, The Heritage Academy, Kolkata, India Krishnendu Ghosh, College of Charleston, USA Kushal Shah, UTMT Bhopal, India Mia Persson, Malmo University, Sweden Michiel Smid, Carleton University, Canada Mohuya Byabartta Kar, Heritage Institute of Technology, Kolkata, India Nilanjana G. Basu, IEM Salt Lake, Kolkata, India Nilina Bera, Heritage Institute of Technology, Kolkata, India Othon Michail, University of Patras, Greece Partha Basuchowdhuri, IACS, Kolkata, India Partha Bhowmick, IIT Kharagpur, India Pintu Lohar, Sunway University, Malaysia Poulami Das, Heritage Institute of Technology, Kolkata, India Prashant Srivastava, Amity University, Noida, India Prosenjit Gupta, Heritage Institute of Technology, Kolkata, India (Co-Chair) Rajat K. De, ISI Kolkata, India Ram Narayan Yadav, IITRAM, Ahmedabad, India Ravi Janardan, University of Minnesota, USA Ritankar Mandal, Heritage Institute of Technology, Kolkata, India Saladi Rahul, IISc Bangalore, India S. K. Venkatesan, CQRL Bits LLP, Chennai, India Sabyasachee Banerjee, Heritage Institute of Technology, Kolkata, India Samarjit Chakrabarty, University of North Carolina, USA Sanjoy K. Saha, Jadavpur University, India Shankho Subhra Pal, Agentic AI Research, Google, India Sharath Raghvendra, North Carolina State University, USA Soharab Hossain Shaikh, BML Munjal University, Gurgaon, India Soumendu Chakraborty, IIIT Lucknow, India Subhajit Datta, Heritage Institute of Technology, Kolkata, India Subhashis Majumder, Heritage Institute of Technology, Kolkata, India (Co-Chair) Subhrajit Bhattacharya, NITTE Bangalore, India Sujay Saha, Heritage Institute of Technology, Kolkata, India Suman Kundu, IIT Madras, India Suman Sanyal, Goa Institute of Management, India Swarup K. Roy, Tezpur University, India Tathagata Bhattacharya, Auburn University, Montgomery, USA Trupil Limbasiya, Bennet University, India Uroš Čibej, University of Ljubljana, Slovenia Vikas Malviya, MIE-SPPU Institute of Higher Education, Doha, Qatar Vikas Upadhyaya, NIIT University, India Wing-Kai Hon, National Tsing Hua University, Taiwan Yoshihiro Maruyama, Kyoto University, Japan Advisors ======== H. K. Chaudhary, Chairman, Kalyan Bharti Trust P R Agarwala, Chairman, Board of Governors, Heritage Institute of Technology, Kolkata, India P. K. Agarwal, CEO, Kalyan Bharti Trust Basab Chaudhuri, Principal, Heritage Institute of Technology, Kolkata, India Sujit K. Barua, Registrar, Heritage Institute of Technology, Kolkata, India Souvik Bhattacharyya, Principal Advisor, Higher Education, Kalyan Bharti Trust Amitava Bagchi, Former Professor, Heritage Institute of Technology, Kolkata, India Steering Committee Chairs ========================= Bhargab B. Bhattacharya, IIEST Shibpur, Howrah, India Sandeep Sen, IIIT DElhi, India General Chair ============= Subhashis Majumder, Heritage Institute of Technology Organizing Chair ================ Diganta Sengupta, Heritage Institute of Technology Publicity Chairs ================ Sabyasachee Banerjee, Heritage Institute of Technology Nilanjana G. Basu, IEM Salt Lake, Kolkata Reshma Roychoudhuri, Heritage Institute of Technology Registration Chairs ==================== Poulami Das, Heritage Institute of Technology Pratyusa Dash, Heritage Institute of Technology ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************