Theory Announcements: November 2024

Saturday, November 30, 2024

[DMANET] DeepLearn 2025: early registration December 25

******************************************************

12th INTERNATIONAL SCHOOL ON DEEP LEARNING
(with a special focus on Large Language Models, Foundation Models and Generative AI)

DeepLearn 2025

Porto – Maia, Portugal

July 21-25, 2025

https://deeplearn.irdta.eu/2025/

******************************************************

Co-organized by:

University of Maia

Institute for Research Development, Training and Advice – IRDTA
Brussels/London

******************************************************

Early registration: December 25, 2024

******************************************************

SCOPE:

DeepLearn 2025 will be a research training event with a global scope aiming at updating participants on the most recent advances in the critical and fast developing area of deep learning. Previous events were held in Bilbao, Genova, Warsaw, Las Palmas de Gran Canaria, Guimarães, Las Palmas de Gran Canaria, Luleå, Bournemouth, Bari, Las Palmas de Gran Canaria and Porto.

Deep learning is a branch of artificial intelligence covering a spectrum of current frontier research and industrial innovation that provides more efficient algorithms to deal with large-scale data in a huge variety of environments: computer vision, neurosciences, speech recognition, language processing, human-computer interaction, drug discovery, biomedicine and health informatics, medical image analysis, recommender systems, advertising, fraud detection, robotics, games, business and finance, biotechnology, physics experiments, biometrics, communications, climate sciences, geographic information systems, signal processing, genomics, materials design, video technology, social systems, earth and sustainability, etc. etc.

The field is also raising a number of relevant questions about robustness of the algorithms, explainability, transparency, interpretability, as well as important ethical concerns at the frontier of current knowledge that deserve careful multidisciplinary discussion.

Most deep learning subareas will be displayed, and main challenges identified through 18 four-hour and a half courses, 2 keynote lectures, 1 round table and a hackathon competition among participants. Renowned academics and industry pioneers will lecture and share their views with the audience. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Face to face interaction and networking will be main ingredients of the event. It will be also possible to fully participate in vivo remotely.

DeepLearn 2025 will place special emphasis on large language models, foundation models and generative artificial intelligence.

ADDRESSED TO:

Graduate students, postgraduate students and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees, so people less or more advanced in their career will be welcome as well.

Since there will be a variety of levels, specific knowledge background may be assumed for some of the courses.

Overall, DeepLearn 2025 is addressed to students, researchers and practitioners who want to keep themselves updated about recent developments and future trends. All will surely find it fruitful to listen to and discuss with major researchers, industry leaders and innovators.

VENUE:

DeepLearn 2025 will take place in Porto, the second largest city in Portugal, recognized by UNESCO in 1996 as a World Heritage Site. The venue will be:

University of Maia
Avenida Carlos de Oliveira Campos - Castêlo da Maia
4475-690 Maia
Porto, Portugal

https://www.umaia.pt/en

STRUCTURE:

3 courses will run in parallel during the whole event. Participants will be able to freely choose the courses they wish to attend as well as to move from one to another.

All lectures will be videorecorded. Participants will be able to watch them again for 45 days after the event.

An open session will give participants the opportunity to present their own work in progress in 5 minutes. Also companies will be able to present their technical developments for 10 minutes.

The school will include a hackathon, where participants will be able to work in teams to tackle several machine learning challenges.

Full live online participation will be possible. The organizers highlight, however, the importance of face to face interaction and networking in this kind of research training event.

KEYNOTE SPEAKERS:

Yonina Eldar (Weizmann institute of Science), Model Based AI and Applications

Manuela Veloso (JPMorganChase), AI, Humans, and Robots for Task Solving

PROFESSORS AND COURSES:

Pierre Baldi (University of California Irvine), [intermediate/advanced] From Deep Learning and Transformers to AI Risks and Safety

Sean Benson (Amsterdam University Medical Center), [intermediate] Digital Twins and Generative AI for Personalised Medicine

Xavier Bresson (National University of Singapore), [intermediate/advanced] Graph Networks, Diffusion Models and Large Language Models

Nello Cristianini (University of Bath), [introductory] Machina Sapiens - Towards More General Forms of AI

Mark Derdzinski (Dexcom), [introductory] From Prototype to Production: Evaluation Strategies for Agentic Applications

Samira Ebrahimi Kahou (University of Calgary), [intermediate/advanced] Explainability in Machine Learning

Elena Giusarma (Michigan Technological University), [introductory/intermediate] Machine Learning at the Frontier of Astrophysics: Simulating the Universe

Shih-Chieh Hsu (University of Washington), [intermediate/advanced] Real-Time Artificial Intelligence for Science and Engineering

Xia "Ben" Hu (Rice University), [introductory/advanced] Efficient LLM Serving: Algorithms, Systems and Applications

Lu Jiang (ByteDance & Carnegie Mellon University), [introductory/advanced] Transformers for Image and Video Generation: Fundamentals, Design, and Innovations

Jayashree Kalpathy-Cramer (University of Colorado), [introductory/intermediate] Multimodal AI for Healthcare

Yingbin Liang (Ohio State University), [intermediate/advanced] Theory on Training Dynamics of Transformers

Chen Change Loy (Nanyang Technological University), [intermediate/advanced] Harnessing Prior for Content Enhancement and Creation

Evan Shelhamer (DeepMind), [intermediate] Test-Time Adaptation for Updating Models on New and Different Data

Atlas Wang (University of Texas Austin), [intermediate] Low Rank Strikes Back in the Era of Large Language Models

Xiang Wang (University of Science and Technology of China), [advanced] Large Language Models for User Behavior Modeling: Cross-Modal Interpretation, Preference Optimization, and Agentic Simulation

Cao (Danica) Xiao (GE HealthCare), [introductory/intermediate] Transforming Healthcare and Drug Development through Multimodal AI with LLMs and Generative AI Technologies

Rex Ying (Yale University), [intermediate/advanced] Multimodal Foundation Models for Graph-Structured Data: Framework and Scientific Applications

OPEN SESSION:

An open session will collect 5-minute voluntary oral presentations of work in progress by participants.

They should submit a half-page abstract containing the title, authors, and summary of the research to david@irdta.eu by July 13, 2025.

INDUSTRIAL SESSION:

A session will be devoted to 10-minute demonstrations of practical applications of deep learning in industry.

Companies interested in contributing are welcome to submit a 1-page abstract containing the program of the demonstration and the logistics needed. People in charge of the demonstration must register for the event.

Expressions of interest have to be submitted to david@irdta.eu by July 13, 2025.

HACKATHON:

A hackathon will take place, where participants can work in teams to tackle several machine learning challenges. They will be coordinated by Professor Sergei V. Gleyzer (University of Alabama). The challenges will be released 2 weeks before the beginning of the school. A jury will judge the submissions and the winners of each challenge will be announced by August 25, 2025. The winning teams will receive a modest monetary prize and the runners-up will get a certificate.

SPONSORS:

Companies/institutions/organizations willing to be sponsors of the event can download the sponsorship leaflet from

https://deeplearn.irdta.eu/2025/sponsors/

ORGANIZING COMMITTEE:

Sergei V. Gleyzer (Tuscaloosa, hackathon chair)
José Paulo Marques dos Santos (Maia, local chair)
Carlos Martín-Vide (Tarragona, program chair)
Sara Morales (Brussels)
José Luís Reis (Maia)
Luís Paulo Reis (Porto)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://deeplearn.irdta.eu/2025/registration/

The selection of 6 courses requested in the registration template is only tentative and non-binding. For logistical reasons, it will be helpful to have an estimation of the respective demand for each course.

Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed and the on-line registration tool disabled when the capacity of the venue will have got exhausted. It is highly recommended to register prior to the event.

FEES:

Fees comprise access to all program activities and lunches.

There are several early registration deadlines. Fees depend on the registration deadline.

The fees for on site and for online participation are the same.

ACCOMMODATION:

Accommodation suggestions will be available in due time at

https://deeplearn.irdta.eu/2025/accommodation/

CERTIFICATE:

A certificate of successful participation in the event will be delivered indicating the number of hours of academic activities. This should be sufficient for those participants who plan to request ECTS recognition from their home university.

QUESTIONS AND FURTHER INFORMATION:

david@irdta.eu

ACKNOWLEDGMENTS:

Universidade da Maia

Universidade do Porto

Universitat Rovira i Virgili

Institute for Research Development, Training and Advice – IRDTA, Brussels/London
**********************************************************
*
* 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/
*
**********************************************************

Friday, November 29, 2024

[DMANET] PhD opening in TCS and/or combinatorial optimization in Lund

The Department of Computer Science at Lund University invites
applications for a PhD position in theoretical computer science and/or
combinatorial optimization.

The PhD student will be working in the Mathematical Insights into
Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom
(www.jakobnordstrom.se), which is active at both the University of
Copenhagen and Lund University on either side of the Oresund Bridge. We
are closely affiliated with the Basic Algorithms Research Copenhagen
(BARC) centre, and are part of a world-leading environment in algorithms
and complexity theory encompassing also the IT University of Copenhagen
and the Technical University of Denmark (DTU). We aim to attract top
talent from around the world to an ambitious, creative, collaborative,
and fun environment. Using the power of mathematics, we strive to create
fundamental breakthroughs in algorithms and complexity theory. While the
focus in on foundational research, we do have a track record of
surprising algorithmic discoveries leading to major industrial applications.

The MIAO research group has a unique profile in that we are doing
cutting-edge research both on the mathematical foundations of efficient
computation and on state-of-the-art practical algorithms for real-world
problems. This creates a very special environment, where we do not only
conduct in-depth research on different theoretical and applied topics,
but where different lines of research cross-fertilise each other and
unexpected and exciting synergies often arise. Much of the activities of
the group revolve around powerful algorithmic paradigms such as, e.g.,
Boolean satisfiability (SAT) solving, Groebner basis computations,
integer linear programming, and constraint programming. This leads to
classical questions in computational complexity theory—though often with
new, fascinating twists—but also involves work on devising clever
algorithms that can exploit the power of such paradigms in practice.

Our most recent new line of research is on how to verify the correctness
of state-of-the-art algorithms for combinatorial optimization. Such
algorithms are often highly complex, and even mature commercial solvers
are known to sometimes produce wrong results. Our work on designing a
new generation of certifying combinatorial solvers, which output not
only an answer but also a machine-verifiable mathematical proof that
this answer is correct, has already received several international
awards, but many more exciting problems are still waiting to be solved!

With this call, we are mainly looking for a mathematically gifted PhD
student with excellent programming skills to continue our
ground-breaking work on certifying algorithms. There is some flexibility
as to what kind of research PhD students in the group pursue, though,
and all candidates are welcome, both those who want to go deep into
either theory or practice and those who are inspired by the challenge of
bridging the gap between the two.

This is a four-year full-time employed position, but PhD positions
usually (though not necessarily) include 20% teaching, in which case
they are prolonged for one more year. The starting date is negotiable,
but should ideally be in August-September 2025 or earlier. All positions
in the research group are fully funded, employed positions (including
travel money) that come with an internationally competitive salary.

The application deadline is January 17, 2025. Please see
https://jakobnordstrom.se/openings/PhD-Lund-250117.html for more
information and instructions how to apply. Informal enquiries are
welcome and may be sent to jakob.nordstrom@cs.lth.se.

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

[DMANET] 2nd Call for Postdoc and Group Leader Positions at the Max Planck Institute for Informatics

M A X P L A N C K I N S T I T U T E
for
I N F O R M A T I C S

seeks several

POSTDOCS and GROUP LEADERS

for the Algorithms and Complexity Department [
https://www.mpi-inf.mpg.de/departments/algorithms-complexity/]

directed by Danupon Nanongkai.

We are looking for applicants from all areas of algorithms and complexity
as well as related areas (such as algorithm engineering, high-performance
computing, theory of computation, and quantum computing). Researchers of
several nationalities work in the Algorithms and Complexity Department, and
our working language is English. The department is a part of the Max Planck
Institute for Informatics, located on the campus of Saarland University in
Saarbruecken, Germany. We maintain close collaborations with algorithms and
complexity researchers in other institutes on the campus, including the
Department of Computer Science, CISPA Helmholtz Center for Information
Security, and Max Planck Institute for Software Systems. The group has high
international visibility, and its members collaborate with multiple leading
research institutions in Europe and the U.S. There is generous travel
support available for all group members. Postdocs are free in their choice
of research topics and collaborators. Group leaders are expected to
independently build and lead research groups with internal and external
funding. The initial contract is for two years for postdocs and up to five
years for group leaders. There are possibilities for extensions,
promotions, and in exceptional cases, permanent employment. The starting
dates for the positions are flexible.

The Max Planck Society is committed to employing more individuals with
disabilities and expressly welcomes these to apply. The Max Planck Society
seeks to increase the percentage of women in the areas where they are
underrepresented and expressly encourages these to apply.

Applications should be submitted via our web form available at

https://www.mpi-inf.mpg.de/d1/offers/postdoc

by uploading a single PDF file containing

* a curriculum vitae,
* a complete list of publications, and
* a research plan (1 page suffices).

Moreover, we ask for the names and email addresses of three references we
may contact. These should be ready to submit a letter of recommendation by
31 December 2024.

The submission server is online now, with applications reviewed as they
arrive. All applications submitted by 15 December 2024 will receive full
consideration. Simultaneous applications for a Lise Meitner Award
Fellowship or a Simons-MPI joint fellowship are possible. (Separate
applications need to be submitted through our server and the system of the
Simons Institute for the Theory of Computing. Applications to Simons
Institute were due by 31 August 2024.)

[DMANET] PACE Challenge: Searching for a PC chair for PACE 2026

The Parameterized Algorithms and Computational Experiments Challenge (PACE) is an annual implementation challenge aimed to connect the theory of parameterized algorithm design to practice. The 10th iteration of the challenge (PACE 2025) is currently running, chaired by Sebastian Siebertz. See https://pacechallenge.org/ for more details. PACE 2025 will conclude with an award ceremony at ALGO 2025. In the fall of 2025, the next iteration (PACE 2026) is scheduled to start.

The PACE steering committee is looking for a PC chair with experience at the interface of parameterized complexity theory and applied algorithmics to organize PACE 2026. The PC chair assembles a small program committee, whose work consists of selecting a challenge problem, setting up benchmark inputs, collecting and evaluating submissions, and hosting the award ceremony at ALGO. After an iteration of PACE is concluded, the PC publishes a report summarizing the outcomes in the proceedings of IPEC, the International Symposium on Parameterized and Exact Computation. Chairing an iteration of PACE is a great way to inspire and challenge a new generation of researchers, as well as an opportunity to learn about diverse approaches to solve hard problems in practice.

Researchers interested to take on the challenge of being the PC chair for PACE 2026 are invited to email the PACE steering committee chair, Bart M. P. Jansen, at b.m.p.jansen@tue.nl<mailto:b.m.p.jansen@tue.nl> with a short motivation of their interest and the intended challenge problem. Proposals will be evaluated based on their alignment with the PACE mission, which can be found here: https://pacechallenge.org/about/ . The deadline for applications is December 31st 2024. Informal inquiries about the position are welcome and can be sent to the same email address.

On behalf of the PACE Steering Committee,

Bart M. P. Jansen.
PACE Steering committee chair.

[DMANET] Submission Deadline: December 1, 2024 – The 1st International Workshop on TwinNetApp in conjunction with IEEE WCNC 2025 | Milan, Italy

========================================
We apologize if you receive multiple copies of this CFPs.
========================================

CALL FOR PAPERS
The First International Workshop on Data Driven and AI-Enabled Digital Twin
Networks and Applications (TwinNetApp) in conjunction with IEEE WCNC 2025,
Milan, Italy
https://wcnc25-twinnetapp.bcrg.uk/
https://wcnc2025.ieee-wcnc.org/workshop/ws09-twinnetapp-data-driven-and-ai-enabled-digital-twin-networks-and-applications

The next generation of technologies is envisioned to connect the physical
and digital worlds. In this regard, Digital Twins (DT) is an emerging
technology that has taken the world by storm due to its multiple benefits
and deployment in interdisciplinary applications ranging from real-time
remote monitoring to healthcare, industrial control systems and predictive
maintenance in aerospace. DT connects the physical and digital worlds by
building an accurate virtual replica of system objects in real-time.
Real-time network monitoring, performance testing, optimization, and fast
simulation are some examples that exploit DT advantages in the
communication domain and beyond. DT delivers a new generation platform to
analyse and test complex systems that are not currently available in
traditional simulations and evaluations. Therefore, the use of DT is
required in communication systems. Further, DT can deliver seamless
analysis, monitoring, and predictions between digital and virtual
counterparts of real-world systems, when it is used together with
next-generation mobile communications (5G/6G), Virtual Reality (VR),
Internet of Things (IoT), Artificial Intelligence (AI), Transfer Learning
(TL), 3D models, Augmented Reality (AR), distributed computing and
intelligent health applications. The workshop will invite authors to submit
papers presenting new research related to all aspects of DT networks,
systems and applications. Topics of interest include, but are not limited
to:

- Data-driven and IoT-based DT networks for real-time communication
systems
- Real-time communication protocols for DT networks
- DT-enabled health applications
- Wireless communications for cyber-physical DT applications
- Security and privacy concepts in DT
- Trustworthy AI enabled DT applications
- DT-assisted AI applications for smart cities
- Communications protocols for enabling DT deployment in real-world
applications
- AI applications of DT systems
- DT in Edge/Fog/Cloud Computing
- 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
- Connected networking systems for environmental sensing
- DT for precision agriculture, smart city and industry 4.0 applications
- Real-world DT simulations, prototypes, and testbed demonstrations

*General Chairs*

- Berk Canberk, Edinburgh Napier University, UK (B.Canberk@napier.ac.uk)
- Octavia Dobre, Memorial University, Canada (odobre@mun.ca)
- Marco Di Renzo, Université Paris-Saclay, CNRS, CentraleSupélec,
Laboratoire des Signaux et Systémes, France (
marco.di-renzo@universite-paris-saclay.fr)

*Keynote Speaker*

- Trung Q. Duong, Memorial University, Canada (tduong@mun.ca)

*Industrial Chair*

- Gökhan Yurdakul, CEO - BTS Group, Turkey (yurdakulg@btsgrp.com)

*Important DatesSubmission Deadline:* December 1, 2024
*Notification of Acceptance: *January 15, 2025
*Camera Ready: *February 1, 2025

*Submission Details:*
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. For
further details please refer to
https://wcnc2025.ieee-wcnc.org/call-workshop-papers.

*Submission Link:*
https://edas.info/newPaper.php?c=32909&track=127537

*Best Paper Award:*
The workshop will feature a Best Paper Award with a cash prize of 800
Dollars, sponsored by BTS Group (https://btslabs.ai/).

Kind regards,

Lal Verda Cakir

PhD Candidate

Edinburgh Napier University, UK

[DMANET] The Airbus Beluga Competition is open!

To all sequential decision-making lovers,

we are announcing that the Beluga™ Airbus Competition has officially begun! We're thrilled to invite you to share your ideas for advancing trustworthy AI and decision-support in real-world industrial applications.
This unique opportunity allows you to develop and test solutions (any approach is welcome!) that address real-world challenges in the Beluga™ cargo system, focusing on optimizing loading and unloading management processes.

Here's what you'll tackle:
1. Scalability (Deterministic) - Ensure solutions scale efficiently.
2. Scalability (Probabilistic) - Account for stochastic events.
3. Explainability - Make decisions transparent and understandable.

Competition Timeline
- November 18th - January 19th: Preparation period: Register, collect data and requirements, and start developing your solution. The Q&A section on our portal is open for any questions you might have!
- January 20-March 30: Submission period: Submit your models and solutions for one or more of the challenges.
- March 31-April 30: Evaluation and winner announcement
- TUPLES Final Event (September-October 2025): Award Ceremony

Ready to join? Head to https://tuples.re2n.app/oi to register and find all the details on how to participate.

We're excited to see what you'll create. Welcome aboard!

The TUPLES AI Trustworthy competition team.
https://tuples.ai/competition-challenge/

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

Thursday, November 28, 2024

[DMANET] [HCCS PerCom 2025] SUBMISSION DEADLINE APPROACHING DEC 1st

**********SUBMISSION DEADLINE APPROACHING DECEMBER 1st**************

********************************************************************

Call for Papers
Fifth Workshop on Human-Centered Computational Sensing (HCCS'25)
co-located with the IEEE PerCom 2025, March 17-21, 2025 -
Washington DC, USA.
https://sites.google.com/view/hccs25/home

The fifth edition of the Human-Centered Computational Sensing (HCCS'25) workshop aims to advance and promote research on how unobtrusive observations of human cognitive, behavioral, physiological, and contextual data are increasingly enabling innovative computing experiences. The workshop will also foster discussions about the societal implications of computational sensing. Traditionally, sensors have been understood narrowly as devices that capture physiological measurements, often through wearables. This workshop adopts a broader, human-centric perspective, envisioning sensing as time-evolving measurable data directly linked to individuals and their communities. With this approach, sensing encompasses human reactions and interactions observed through spoken, written, or signed language, eye gaze, facial and bodily expressions, social networks, geospatial patterns, and other forms of human-generated data. Advances in multimodal human data acquisition and fusion have the potential to significantly impact all areas of human life, including productivity, health and well-being, training and education, human-computer interaction, accessibility, safety and security, as well as gaming, sports, and entertainment.

Relevant topics include but are not limited to:
* Context-Aware Sensing for Adaptive Learning Environments
* Emotion Recognition through Physiological and Behavioral Signals
* Personalized Well-being Applications using Continuous Sensing
* Smart Workplaces through Behavioral Sensing
* Human Activity Recognition in Unstructured Environments
* Emotion-Adaptive Interfaces for Human-Computer Interaction
* Geospatial Behavior Analysis for Urban Planning
* Fusion of multifaceted, heterogeneous, and/or incommensurable human sensing data
* Localization and proximity-detection systems
* AI-empowered mobile sensing systems
* Generative AI for synthetic sensor data generation and evaluation
* User acceptance, quality of experience, and social impact studies
* Accessibility of human sensing technologies
* New interventions acting on human-centered computational sensing
* Experimental analysis with human sensing data from real-world applications
* Human-centered sensing for healthcare, industry, social goods and all possible application domains
* Experiences and lessons learned from research projects focused on human-centered computational sensing
* Privacy and ethical considerations for human-centered computational sensing, including gender equality.

Organizers will consider the possibility of inviting authors of selected papers accepted to HCCS'25 to submit an extended work to a Special Issue of an international journal.

Submission and Registration:
Authors are invited to submit technical or theoretical papers for presentation at the workshop, describing original, previously unpublished work, which is not currently under review by another workshop, conference, or journal. Papers should present novel perspectives within the general scope of the workshop.
Accepted workshop papers will be included and indexed in the IEEE digital libraries (Xplore).
Papers may be no more than 6 pages in length. Authors can purchase one additional page for the camera-ready version. Papers in excess of the page limits will not be considered for review or publication. All papers must be typeset in double-column IEEE format using 10pt fonts on US letter paper, with all fonts embedded. The IEEE LaTeX and Microsoft Word templates, as well as related information, can be found at the IEEE website.

Submission instructions will be available soon on the workshop and conference websites.

It is a requirement that all the authors listed in the submitted paper are also listed in the submission system. Each accepted workshop paper requires a full PerCom registration (no registration is available for workshops only). Papers that are not presented in presence at the workshop will not be published in the proceedings.

Please submit papers using this link:
https://easychair.org/conferences/?conf=percom2025

After login, select the track "HCCS (5th Workshop on Human-Centered Computational Sensing 2025)" and proceed with your submission.

Important Dates:
* Paper submission deadline: December 1st 2024
* Paper notification: January 8th, 2025
* Camera Ready Deadline: February 2nd, 2025

Organizers:

Workshop co-chairs
* Franca Delmastro (IIT-CNR)
* Michele Girolami (ISTI-CNR)
* Marco Levorato (Donald Bren School of Information and Computer Sciences)

Publicity co-chairs
* Flavio Di Martino (IIT-CNR)
* Rajesh Titung (Rochester Institute of Technology)
* Viet Dung Nguyen (Rochester Institute of Technology)

Steering Committee
* Cecilia O. Alm (Rochester Institute of Technology)
* Reynold Bailey (Rochester Institute of Technology)

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

Wednesday, November 27, 2024

[DMANET] Reminder: MIPLIB 2024 Submission

Dear colleagues,

MIPLIB, short for Mixed-Integer Programming Library, is the standard test set used to compare mixed-integer solvers. It was first released in

1992 by Robert E. Bixby, E.A. Boyd, and R.R. Indovina. Naturally, as mixed-integer solvers become more accessible, more industries integrated mixed-integer solvers, and the size of instances increased, new iterations of MIPLIB were required. Releases followed in 1996, 2003, 2010, and 2017, with these releases following an unofficial seven year schedule. The customary seven years has now passed since the last release, and a new iteration of MIPLIB, MIPLIB 2024, is being put together.

In its current state, MIPLIB 2017 serves as the standard benchmark set for comparing the performance of different mixed-integer solvers. It was compiled by a group of 21 interested researchers, including representatives of the development teams of nine mixed-integer solvers, with submissions derived from 66 unique submitters (including bulk submissions from online optimization servers and optimization competitions). Nevertheless, the mixed-integer landscape has changed in seven years. New applications of mixed-integer solvers have arisen, and an increasing amount of industries are now using mixed-integer solvers.

Therefore, we are advertising the submission for MIPLIB 2024:

https://miplibsubmissions.zib.de/

To emphasize the importance of MIPLIB: It is the standard benchmark library for mixed-integer solvers. Having one of your instances included in this benchmark guarantees that mixed-integer solvers as a whole try and improve solution time on the included instance. If the instance is representative, then performance will at least partly generalize to other similar instances that you might have. It also guarantees that academics will regularly consider new solving techniques for your instance. Having as many industries and applications represented as possible is critical for MIPLIB 2024 to be an appropriate benchmark for mixed-integer solvers. Please submit any and all instances you are comfortable sharing to: https://miplibsubmissions.zib.de/

Extended Deadline: 31.12.2024

Instance specifications: Anything that is classified as a mixed-integer linear program (this includes binary and integer programs). Instances containing indicator and SOS constraints are also welcome.

Timo,
on behalf of the MIPLIB committee

PD Dr. Timo Berthold * Software Engineering - Director * FICO
Fair Isaac Deutschland GmbH
Takustr. 7, 14195 Berlin, Germany
+49 30 841 85 425
www.fico.com

[A close up of a sign Description automatically generated]

[DMANET] CfP: DisCoTec 2025

[Apologies for multiple postings]
************************************************************************

Joint Call for Papers

DisCoTec 2025

20th International Federated Conference on Distributed Computing Techniques

Lille, France, 16-20 June 2025

Submission deadline: 7 February 2025

https://www.discotec.org/2025

************************************************************************

DisCoTec 2025 is one of the major events sponsored by the International
Federation for Information Processing (IFIP) and the European Association
for Programming Languages and Systems (EAPLS). It gathers conferences and
satellite events that cover a broad spectrum of distributed computing
subjects — from theoretical foundations and formal description techniques,
testing and verification methods, to language design and system
implementation approaches. The three main conferences are:

* COORDINATION 2025 - International Conference on Coordination Models and
Languages
* DAIS 2025 - International Conference on Distributed Applications and
Interoperable Systems
* FORTE 2025 - International Conference on Formal Techniques for
Distributed Objects, Components, and Systems

DisCoTec 2025 is organised by Inria Lille and the University of Lille. It
will be hosted by Polytech Lille.

* NEW: Accommodations for parents of young children *

Subject to budget availability, we are planning to make special
logistical arrangements for conference participants travelling with young
children (and potentially accompanying persons). We invite interested
persons to contact the General Chair (simon.bliudze@inria.fr), as soon as
possible to discuss the arrangements that might be applicable.

* Keynote Speakers *

- Alysson Bessani (Universidade de Lisboa, Portugal)

- Hélène Coullon (IMT Atlantique, France)

- Omar Inverso (GSSI, Italy)

- Burcu Ozkan (TU Delft, The Netherlands)

* Important Dates (for all main conferences) *

All deadlines expire at 23:59 anywhere on earth.

- Abstract submission: 31 January 2025

- Paper submission: 7 February 2025

- Paper notification: 28 March 2025

- Camera-ready: 23 April 2025 (TBC)

- DisCoTec conference: 16-20 June 2025

See each conference site for topics of interest, paper categories, and
submission instructions.

* Main Conferences *

- COORDINATION (https://www.discotec.org/2025/coordination)
27rd International Conference on Coordination Models and Languages
PC Chairs: Cinzia Di Giusto (Université Côte d'Azur, FR) and António
Ravara (NOVA School of Science and Technology, PT)

- DAIS (https://www.discotec.org/2025/dais)
25st International Conference on Distributed Applications and
Interoperable Systems
PC Chairs: Daniel Balouek (INRIA, FR) and Ibéria Medeiros (University
of Lisbon, PT)

- FORTE (https://www.discotec.org/2025/forte)
45st International Conference on Formal Techniques for Distributed
Objects, Components and Systems
PC Chairs: Carla Ferreira (NOVA University of Lisbon, PT) and Claudio
A. Mezzina (University of Urbino, IT)

* Artefact Evaluation Chairs *

- DisCoTec-wide: Roberto Casadei (University of Bologna, Italy)

- COORDINATION: Duncan Attard (University of Glasgow, UK)

- DAIS: Vinicius Cogo (Ciências/ULisboa, Portugal)

- FORTE: Emilio Incerto (IMT School for Advanced Studies Lucca, Italy)

* Proceedings *

Main conference proceedings will be published as volumes in the Springer
LNCS-IFIP series. The volumes will be open access from the IFIP digital
library after a 3-year embargo.

* Journal Special Issues *

Selected papers accepted at the main conferences will be invited for
submission to special issues in high-quality journals, such as:

- Logical Methods in Computer Science

- Science of Computer Programming (Software Track).

* Organizing Committee *

- Simon Bliudze, General Chair (Inria Center at the University of Lille,
France)
- Larisa Safina, Satellite Events Chair (Inria Center at the University
of Lille, France)
- Adrien Luxey-Bitri, Young Researchers Forum Chair (University of Lille,
France)
- Imen Sayar, Gender equality / Women in Science co-Chair (University of
Lille, France)
- Manel Barkallah, Gender equality / Women in Science co-Chair
(University of Namur, Belgium)
- Bas van den Heuvel, Publicity co-Chair (University of Freiburg, Germany)
- Matthew Alan Le Brun, Publicity co-Chair (University of Glasgow, UK)
- Rémy Raes, Head of student volunters (Inria Center at the University of
Lille, France)

* Steering Committee *

- Rocco De Nicola (IMT School for Advanced Studies Lucca, Italy)
- Adrian Francalanza (University of Malta, Malta; Chair)
- Ivan Lanese (University of Bologna/INRIA, Italy)
- Alberto Lluch Lafuente (Technical University of Denmark, Denmark)
- Mieke Massink (CNR-ISTI, Italy)
- Luís Veiga (INESC-ID, Universidade de Lisboa, Portugal)
- Gianluigi Zavattaro (University of Bologna, Italy)
- Carla Ferreira (NOVA University of Lisbon, Portugal)
- Jorge A. Pérez (University of Groningen, The Netherlands)

[DMANET] Postdoctoral assistant position available on the topic of Cutting and Packing Optimisation

The CODeS research group at KU Leuven, Belgium is looking for a postdoctoral assistant on the topic of Cutting and Packing (or combinatorial optimisation in general).

You can apply for this job no later than December 18, 2024.

For more information and to apply for this position, visit the following webpage: https://www.kuleuven.be/personeel/jobsite/jobs/60410118?lang=en

A postdoc position is available within the research group CODeS/NUMA from the department of Computer Science, part of the Science and Technology Group of KU Leuven.
The overall research theme of CODeS includes the design, analysis and application of heuristics for combinatorial optimisation problems. CODeS investigates the construction of models, the behaviour and the application of metaheuristics for combinatorial optimisation and has been highly active in these fields for over a decade. CODeS' research lab, located in Gent has a prolific history of collaboration with industrial partners.

Responsibilities
CODeS/NUMA@Gent is looking for a postdoc with varied research and educational responsibilities. The research is focused in the area of combinatorial optimisation, in particular cutting and packing optimization. You will collaborate with other researchers and PhD students within multiple research projects. You will analyse and solve combinatorial optimisation problems and develop the required software and algorithms in order to do so. You will publish your research results at regular times in internationally recognized journals and conferences.
The educational tasks contain the supervision of bachelor, master and PhD students and the teaching of computer and data science courses.

Profile
The perfect candidate:
Has obtained a PhD in Computer Science or a similar domains
Has knowledge and experience in relevant research areas such as combinatorial optimization, local-search and metaheuristics
Expertise on cutting and packing optimization is a plus
Is a good programmer with knowledge of programming languages such as C++, Java or Python
Is willing to teach classes in the academic bachelor and master courses at KU Leuven, Gent Campus
Is motivated, passionate and has good interpersonal skills
Is willing to work interdisciplinary
Has experience with writing project proposals and obtaining competitive grants

Offer
The selected candidate will be part of a dynamic and established research group within the department of Computer Science. The initial contract is determined for three years with possible extension. The salary is based on KU Leuven standards (barema 44).

Interested?
For more information please contact Prof. dr. Tony Wauters, mail: tony.wauters@kuleuven.be or Prof. dr. ir. Greet Vanden Berghe, mail: greet.vandenberghe@cs.kuleuven.be .

[DMANET] EuroCG 2025: First Call for Contributions

================
Call for Contributions
================

41st European Workshop on Computational Geometry
Organized as an event of the Computational Geometry Society,
https://computational-geometry.org/
April 9-11, 2025, Liblice, Czech Republic
https://kam.mff.cuni.cz/conferences/eurocg2025/

EuroCG 2025 will be held on April 9-11, 2025 in Liblice, Czech Republic.
EuroCG is an annual workshop that combines a strong scientific tradition
with a friendly and informal atmosphere. The workshop is a forum where
established researchers and students can meet, discuss their work, present
their results, and establish scientific collaborations.

=============
Important Dates
=============

Submission Deadline: January 21, 2025
Acceptance Notification: February 21, 2025
Early Registration ends: March 5, 2025
Camera-ready version: March 7, 2025
EuroCG 2025: April 9-11, 2025
All deadlines are 23:59 AoE.

=============
Invited speakers
=============

- Oswin Aichholzer (Graz University of Technology)
- Eva Rotenberg (Technical University of Denmark)
- Uli Wagner (Institute of Science and Technology Austria)

=============
Topics of interest
=============

Topics of interest cover all aspects of computational geometry, including
but not limited to the following:

- discrete and combinatorial geometry and topology,
- design and analysis of geometric algorithms and data structures,
- implementation and experimental evaluation of geometric algorithms,
- numerical and algebraic issues arising from implementations,
- analysis of geometric configurations,
- geometric modeling, visualization and simulation,
- combinatorial optimization,
- graph drawing,
- structural molecular biology,
- geometric puzzle analysis,
- applications of computational geometry,
- geographic information systems,
- robotics and virtual worlds, and
- computer-aided design and manufacturing.

=========
Submission
=========

We invite authors to submit extended abstracts of their original research.
Submissions must be formatted in LaTeX using a supplied class file, and not
be longer than 175 lines of text. Submissions will be handled through
EasyChair.

Authors must use the LaTeX class files euroCG25 and eurocg25-submission,
which are based on the LIPIcs class file. These class files should
automatically count all lines containing text, excluding title and
references, and excluding figures. Authors are expected to make reasonable
effort to make sure all lines that contain text are counted: the class file
should be considered an aid, and the responsibility of correctly counting
lines remains with the authors. A zip file containing an example of how to
use the class file can be found at
https://kam.mff.cuni.cz/conferences/eurocg2025/.

Your submission should provide a clear statement of your results including
proofs. The main (175 line) body of your submission should be
self-contained and contain a clear and succinct description of your
results. Content that does not fit in the main body due to space
restrictions must be placed into a clearly marked appendix, which will only
be read at the discretion of the program committee.

==============
Acceptance Policy
==============

EuroCG is a non-competitive forum. We will accept all submissions which are
original, correct, well-presented, non-trivial, and in scope. The program
committee judges submissions on these five criteria, each of which can lead
to rejection. If a submission satisfies all criteria, then it will be
accepted: there is no competition against other submissions. For this
reason authors are not requested to hide their names and affiliations at
the time of their submission (the review process will not be double blind).

- Originality: If a submission does not contain original research by the
authors, or if there is good reason to believe this is the case, this is a
reason for rejection. We do not accept submissions which have already been
accepted for publication in a conference and/or journal at the date of the
EuroCG submission deadline. However, we do explicitly allow submissions
that are under review at another
conference or journal at the date of the EuroCG submission deadline.
- Correctness: If the main / a major result of a submission is not correct,
this is a reason for rejection. If an attentive reviewer cannot establish
correctness of the results from the content of the submission, this is a
reason for rejection. However, an acceptance at EuroCG is no correctness
guarantee.
- Presentation: If a submission is written in a way that makes it
unreadable, or it does not follow the submission guidelines as listed in
the call for contributions, this is a reason for rejection.
- Technical Depth: If a submission is trivial, this is a reason for
rejection. However, there is no minimum level of technical depth required.
- Scope: If a submission is out of scope, this is a reason for rejection.
However, we wish to be inclusive in our interpretation of scope, which
includes but is not limited to the list of topics in the call for
contributions.

==========
Proceedings
==========

EuroCG does not have formally reviewed proceedings. A booklet of abstracts,
without ISBN, will be accessible online on the website for the benefit of
the community and must be regarded as a collection of preprints rather than
a formally reviewed selection of papers. Results presented at EuroCG are
expected to appear in other conferences with formal proceedings and/or in
journals.

Authors of selected papers will be invited to submit extended versions to a
special issue of the Computing in Geometry and Topology (CGT) journal.

There will also be a voting for the Best Student Presentation.

==========================================
Presentation of the papers and conference attendance
==========================================

EuroCG is dedicated to providing an environment that is free from
harassment, bullying, discrimination, and retaliation for all participants.
According to the decision taken at EuroCG 2024 [
https://computational-geometry.org/eurocg/], from 2025 onwards EuroCG will
be organized as an event of the CG Society [
https://computational-geometry.org/society/]. Only members of the Society
can attend EuroCG. Society membership is free. All members of the Society
are bound by its Code of Conduct [
https://computational-geometry.org/society/code-of-conduct/]. A person
whose membership has been suspended, for example by the Code of Conduct
Committee [https://computational-geometry.org/society/code-of-conduct/#ccc],
cannot attend EuroCG in person.

EuroCG is fundamentally an in-person event and all presentations are
expected to be given in person. Hence at least one author of an accepted
contribution must become a member of the society and attend EuroCG. If no
author of an accepted contribution is attending EuroCG, then the
contribution may be removed from the program, the booklet of abstracts, and
the conference website.

================
Program Committee
================

Michael A. Bekos (University of Ioannina)
Carla Binucci (University of Perugia)
Sergio Cabello (University of Ljubljana)
Jean Cardinal (Université Libre de Bruxelles)
Éric Colin de Verdière (CNRS, LIGM, Marne-la-Vallee)
Sabine Cornelsen (University of Konstanz)
Sándor Fekete (TU Braunschweig)
Stefan Felsner (TU Berlin)
Petr Hliněný (Masaryk University)
Michael Hoffmann (ETH Zürich)
Fabian Klute (UPC Barcelona)
Jan Kratochvíl - co-chair (Charles University)
Giuseppe Liotta - co-chair (University of Perugia)
Rahnuma Islam Nishat (Brock University)
Yoshio Okamoto (University of Electro-Communications)
Dömötör Pálvölgyi (Eötvös Loránd University)
Charis Papadopoulos (University of Ioannina)
Zuzana Patáková (Charles University)
Joseph O'Rourke (Smith College)
Paweł Rzążewski (Warsaw University of Technology and University of Warsaw)
Gelasio Salazar (Universidad Autónoma de San Luis Potosí)
Christiane Schmidt (Linköping University)
Miloš Stojaković (University of Novi Sad)
Alessandra Tappini (University of Perugia)
Pavel Valtr (Charles University)
Marc van Kreveld (Utrecht University)
Birgit Vogtenhuber (Graz University of Technology)
Meirav Zehavi (Ben-Gurion University)
Johannes Zink (Universität Würzburg)

==================
Organizing Committee
==================

Martin Balko - co-chair (Charles University)
Pavel Hubáček (Czech Academy of Sciences)
Anna Kotěšovcová (Conforg)
Maria Saumell - co-chair (Czech Technical University)
Pavel Valtr (Charles University)

Looking forward to seeing you in Liblice.

The organizers.

Tuesday, November 26, 2024

[DMANET] Tenure-Track Assistant Professor Position in Algorithms at SDU, Denmark

The Department of Mathematics and Computer Science (IMADA) at University of Southern Denmark (SDU), Odense, Denmark, invites applications for a tenure-track assistant professor position in Algorithms, with a focus on applications in Algorithmic Cheminformatics. The intended starting date is 1 April 2025, with room for flexibility. The application deadline is 8 January 2025.

The initial three years of this position are funded by the MATOMIC project ("Mathematical Modelling for Microbial Community Induced Metabolic Diseases" https://www.sdu.dk/en/forskning/matomic). One focus of the project is the use of methods based on representing molecules and reactions via graph transformation techniques. During this time, the applicant is expected to work together with other IMADA researchers in the development of novel, practically efficient algorithms and modelling techniques, with corresponding implementations. See https://cheminf.imada.sdu.dk for previous and current work in the research group.

Past the first three years the position is funded by the department. As a tenure-track position it is a focused assistant professorship with a guaranteed assessment for a position as tenured associate professor. At the latest before the end of the sixth year of employment and contingent on a positive academic assessment, the assistant professor will transition into a permanent (tenured) position as associate professor. A tenure-track assistant professor can request assessment for tenure earlier.

What we seek:

We are looking for candidates
- with a PhD and research background in Computer Science with a focus on Algorithms and an interest in the transfer of algorithmic ideas into working tools,
- with a strong track record of publications in top-level conferences and journals, relative to academic age, and
- who can contribute to teaching and advising in the department's Bachelor, Master's and PhD programmes in Computer Science and related fields.

Fluency in English is required, whereas knowledge of Danish is not a prerequisite for application. More than half of the research staff members in computer science have international backgrounds. Successful applicants will be offered Danish courses by the university.

For further information and questions on the position, please contact Professor Rolf Fagerberg, rolf@imada.sdu.dk.

What we offer:

The Department of Mathematics and Computer Science offers a modern, inclusive, international, and interdisciplinary working environment with state-of-the-art facilities. Research at the Department of Mathematics and Computer Science is organised in five main research sections:

- Algorithms
- Artificial Intelligence, Cybersecurity, and Programming Languages
- Data Science and Statistics
- Computational Science
- Topology, Algebra, Analysis and Geometry.

The current focus areas of the Algorithms research conducted at IMADA include algorithmic cheminformatics, external memory algorithms, data structures, combinatorial optimization, online algorithms, graph theory, complexity theory, and cryptology. There are also ample options for collaboration across sections, departments, and faculties.

The department also hosts the SDU eScience Centre, a national provider of HPC infrastructure for research, and thus offers access to attractive computational resources for research, teaching, and industry. Besides the BSc, MSc, and PhD programmes in Computer Science, the department offers BSc, MSc, and PhD programmes in mathematics, applied mathematics, mathematics economics, a BSc degree in artificial intelligence, and an MSc degree in data science.

The University of Southern Denmark was founded in 1966 and now has more than 27,000 students, almost 20% of whom are from abroad. It has more than 3,800 employees and 115 different study programmes in the fields of the humanities, social sciences, natural sciences, health sciences, and engineering. Its main campus is located in Odense, the third largest city in Denmark.

Odense provides family-friendly living conditions with the perfect combination of a historic city centre with an urban feel and yet a close proximity to beaches and recreational areas. Its location on the beautiful island of Funen is ideal with easy connection by train or highway to Aarhus and Copenhagen and to international airports. As the birthplace of Hans Christian Andersen, Denmark's famous fairy tale author, the city is home to a vibrant and creative population and hosts numerous festivals and markets throughout the year.

Application, salary etc.:

Appointment to the position will be in accordance with the salary agreement between the Ministry of Finance and the Danish Confederation of Professional Associations. Please check links for more information on salary (only available in Danish) and taxation.

Applications will be assessed by an expert committee. Applicants will be informed of their assessment by the university. Shortlisting may be used in the assessment process.

The University wishes our staff to reflect the diversity of society and thus welcomes applications from all qualified candidates regardless of personal background.

Application link: https://fa-eosd-saasfaprod1.fa.ocs.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/2235/?utm_medium=jobshare

[DMANET] Postdoc at Lyon

Two two-year postdoc positions, offered by the Labex MiLyon, have been opened in Lyon, France.

All research topics of the LIP (the computer science lab at ENS de Lyon) are eligible: algorithms, graph theory, statistical learning, computer arithmetic, computer algebra, high-performance computing, combinatorics, compilation, algorithmic complexity, cryptography, distributed computing, quantum computing, programming languages, logic, computational models, parallelism, formal proofs, scheduling, networks, semantics, verification.

Candidates must find a mentor in the lab prior to their official application.

Deadline for applications: January 10th, 2025.
Postdoc with no teaching duty, for the period Sep. 2025 - Aug. 2027.

More about LIP here:
https://www.ens-lyon.fr/LIP/

Submission link and more information available from there:
https://milyon.universite-lyon.fr/postdoctoral-positions-2025-2027-351922.kjsp

Contact at LIP : Isabelle Guérin Lassous, director of LIP, isabelle.guerin-lassous@ens-lyon.fr
______________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon
http://perso.ens-lyon.fr/nicolas.trotignon/index.html

[DMANET] Call for Papers: 2025 Genetic and Evolutionary Computation Conference (GECCO 2025)

[Our apologies if you receive multiple copies of this call]

2025 Genetic and Evolutionary Computation Conference (GECCO 2025)
https://gecco-2025.sigevo.org/HomePage
Málaga, Spain (hybrid event)
July 14-18, 2025

We are inviting you to submit your latest top-quality work for presentation and publication at the Genetic and Evolutionary Computation Conference 2025, the premier conference in the field of genetic and evolutionary computation. Topics include genetic algorithms, genetic programming, swarm intelligence, complex systems, evolutionary combinatorial optimization and metaheuristics, evolutionary machine learning, evolutionary multiobjective optimization, evolutionary numerical optimization, neuroevolution, real-world applications, theory, hybrids, and more. Full details on the conference tracks are available at https://gecco-2025.sigevo.org/Tracks. GECCO 2025 is going to be held as a hybrid event.

The GECCO 2025 Program Committee invites you to submit technical papers describing your best work in genetic and evolutionary computation. Full papers of at most 8 pages (excluding references) should present original work that meets the high-quality standards of the conference. Accepted full papers will appear in the ACM Digital Library as part of the Main Proceedings of GECCO 2025.

For full papers, a separate abstract must be submitted first by January 22, 2025. Full papers are due by the non-extendable deadline of January 29, 2025.

Each paper submitted to GECCO 2025 will be rigorously evaluated in a double-blind review process. Evaluation is done on a per-track basis, ensuring high interest and high expertise of the reviewers. Review criteria include the significance of the work, technical soundness, novelty, clarity, writing quality, relevance and, if applicable, sufficiency of information to permit replication. In addition to full papers, poster-only papers of at most 4 pages (including references) may also be submitted. Poster-only papers are expected to present original work that has not yet reached the maturity and completeness of research results that are published as full papers at GECCO. The review of poster-only submissions follow the same double-blind process mentioned above.

Accepted poster-only papers will appear in the ACM Digital Library as part of the Companion Proceedings of GECCO 2025. Poster-only papers are due by the non-extendable deadline of January 29, 2025, and no abstract needs to be submitted first.

By submitting a paper, the author(s) agree that, if their paper is accepted, they will:

* Submit a final, revised, camera-ready version to the publisher on or before the camera-ready deadline (April 9, 2025)
* Register at least one author before May 8, 2025 to attend the conference
* Attend the conference (at least one author, either on-site or on-line)
* Present the accepted paper at the conference

Each accepted paper needs to have at least one author registered. A registered author may present more than one paper at the conference without having to pay additional registration fees.

IMPORTANT DATES

* Abstract submission for full papers: January 22, 2025
* Full paper submission: January 29, 2025
* Poster-only submission: January 29, 2025
* Notification of paper acceptance: March 19, 2025
* Camera-ready: April 9, 2025
* Presenter mandatory registration: May 8, 2025

More information is available at: https://gecco-2025.sigevo.org/Call-for-Papers

******
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
******

Richard Allmendinger
GECCO 2025 Publicity Chair

Monday, November 25, 2024

[DMANET] CFP Journal of Combinatorial Optimization -SI ECCO

Call for Papers

Journal of Combinatorial Optimization

Special Issue:

The latest developments in combinatorial optimization

_________________________________________________________

This special issue will present recent advances and challenges in all areas of Combinatorial Optimization. The issue will be based on contributions presented at the ECCO XXXVI Conference, June 6-8, 2024, but invitation to submit is extended to all ECCO and CO members.

*** Deadline for submission updated: January 15, 2025. ***

Main areas / topics of interest are (but not restricted to):

* Graphs and networks
* Mathematical programming
* Routing and scheduling
* Facility location
* Bioinformatics
* Exact methods
* Approximation algorithms
* Heuristics
* Metaheuristics
* Matheuristics

All articles will be thoroughly refereed according to the high standard of the Journal of Combinatorial Optimization.

Full papers must be submitted through the Springer Editorial System https://www.editorialmanager.com/joco/

Please see the Author Instructions on the site if you have not yet submitted a paper through this web-based system. Be sure to note that your work is intended for the Special Issue and to select the article type SI: ECCO 2024.

Accepted papers will be published online individually, before print publication.

We look forward to receiving your contribution.

The Guest Editors,

Silvano Martello

Greet Vanden Berghe

Tony Wauters

[DMANET] PhD opportunities at the University of Birmingham

*Imminent funding deadline (5 December) - please contact us immediately if you are interested.*

Dear all,

We invite applications for PhD study at the University of Birmingham.

We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation. Our work includes category theory, computational complexity, programming language semantics, proof theory, type theory, verification and much else besides.

See our webpage, with links to individual researchers, here:
https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-computation/index.aspx

Information about PhD applications may be found here:
https://www.birmingham.ac.uk/schools/computer-science/postgraduate-research/applying-for-phd-in-computer-science.aspx

If you are considering applying, please contact any of us. We will be very happy to discuss the opportunities available.

Best regards,
Jakub Opršal & The Birmingham CS theory group

[DMANET] ISSAC 2025 -- Second Call for Papers

----------------------------------------------------------------------
SECOND CALL FOR PAPERS

ISSAC 2025
International Symposium on Symbolic and Algebraic Computation
July 28th to August 1st, 2025
Center for Research in Mathematics (CIMAT) in Guanajuato, Mexico.
https://www.issac-conference.org/2025/

----------------------------------------------------------------------
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2025 will be the 50th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communications, software demonstrations and vendor exhibits with a center-piece of contributed research papers.

ISSAC 2025 will be held from July 28th to August 1st, 2025, at the Center for Research in Mathematics (CIMAT) in Guanajuato, Mexico.

Important Dates
---------------

* Abstract submission deadline: January 23, 2025, 23:59 (anywhere on Earth)
* Paper submission deadline: January 30, 2025, 23:59 (anywhere on Earth)
* First notification of acceptance/rejection: April 16, 2025
* End of rebuttal phase: April 23, 2025
* Final notification after rebuttal phase: April 30, 2025
* Camera-ready copy due: May 21, 2025

Submission Instructions
-----------------------

ISSAC 2025 invites the submission of original research contributions to be considered for publication and presentation at the conference. Papers should not duplicate work published or submitted for consideration elsewhere.

Papers must be in English and should not exceed 8 pages in the ACM two-column style, found at:
http://www.acm.org/publications/proceedings-template
which can be downloaded from:
https://portalparts.acm.org/hippo/latex_templates/acmart-primary.zip

However, two additional pages may be used for bibliographical references, and/or for experimental results (tables, figures), experimental data (e.g. input or output systems for a solver) and computer program code (library code, scripts, worksheets, Makefiles, etc.). The portion of the paper before these two additional pages must be self-contained.

Extended abstracts are not allowed. At least one author of each accepted paper must register for the conference and present the paper.

Submission is via EasyChair, at the web site
https://easychair.org/my/conference?conf=issac2025

Topics
------

All areas of computer algebra and symbolic mathematical computation are of interest. These include, but are not limited to:

- Algorithmic aspects:

* Exact and symbolic linear, polynomial and differential algebra
* Symbolic-numeric, homotopy, perturbation and series methods
* Computational algebraic geometry, polynomial and semialgebraic optimization
* Computational group theory and number theory, quantifier elimination and logic
* Computer arithmetic
* Summation, recurrence equations, integration, solution of ODEs & PDEs
* Symbolic methods in other areas of pure and applied mathematics
* AI methods and symbolic computation
* Complexity of algebraic algorithms and algebraic complexity

- Software aspects:

* Design of symbolic computation packages and systems
* Language design and type systems for symbolic computation
* Data representation
* Considerations for modern hardware
* Algorithm implementation and performance tuning
* Mathematical user interfaces
* Use with systems such as digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation

- Application aspects:

* Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact.

- Satellite Workshops/Conferences:

* The organizing committee of ISSAC 2025 invites proposals for Satellite Events aimed at enriching the conference program, attracting a broader audience, and promoting new developments and original research results in all areas of symbolic mathematical computation.

Organizing Committee
--------------------

* General Chair: Carlos D'Andrea. Universitat de Barcelona, Spain
* Program Committee Chair: Sonia Pérez Díaz. University of Alcalá, Spain
* Local Arrangements Chair: Cristhian Garay López. Centro de Investigación en Matemáticas (CIMAT), Mexico
* Treasurer: Javier Carvajal-Rojas. Centro de Investigación en Matemáticas (CIMAT), Mexico
* Proceedings Editor: Santiago Laplagne. Universidad de Buenos Aires, Argentina
* Publicity Chair: Matías Bender. Inria - CMAP, École Polytechnique, France
* Tutorial Chair: Josephine Yu. Georgia Institute of Technology, USA
* Short Communications Chair: Xiaohong Jia. Chinese Academy of Sciences, China
* Software Presentations Chair: Thi Xuan Vu. University of Lille, France

Program Committee
-----------------

* Erika Ábrahám. RWTH Aachen University, Germany
* Jérémy Berthomieu. Sorbonne Université, CNRS, France
* Michela Ceria. Polytechnic University of Bari, Italy
* Maria Francis. Indian Institute of Technology Hyderabad, India
* Bruno Grenet. Université Grenoble-Alpes, France
* Kai Hormann. University of Italian Switzerland, Switzerland
* Gabriela Jeronimo. Universidad de Buenos Aires, Argentina
* Christoph Koutschan. Austrian Academy of Sciences, Austria
* Pierre Lairez. Inria, France
* Jesús de Loera. University of California, Davis, USA
* Katsusuke Nabeshima. Tokyo University of Science, Japan
* Gleb Pogudin. École Polytechnique, Institute Polytechnique de Paris, France
* Mauricio Velasco. Universidad Católica, Uruguay.
* Daniel S. Roche. United States Naval Academy in Annapolis, Maryland, USA
* Liyong Shen. School of Mathematical Sciences, University of the Chinese Academy of Sciences, China
* Carsten Schneider. Research Institute for Symbolic Computation. Johannes Kepler University, Austria
* Josué Tonelli-Cueto. Johns Hopkins University, USA
* Rafael H. Villarreal. Cinvestav - IPN, Mexico

Local Arrangements Committee
----------------------------

* Cristhian Garay López (Chair). Centro de Investigación en Matemáticas (CIMAT), Mexico
* Claudia Reynoso Alcántara. Universidad de Guanajuato, Mexico
* Luis Nuñez Betancourt. Centro de Investigación en Matemáticas (CIMAT), Mexico

[DMANET] M2 Internship Offer in Operations Research – Université d’Evry-Paris Saclay

Dear all,

In the team of AROBAS, IBISC, at University Evry-Paris Saclay, France, we
are offering a Master 2 research internship for up to 6 months, starting at
the beginning of February 2025. The internship will take place at the
University of Evry-Paris Saclay, at the IBISC laboratory. Evry is located
25.0 km from the center of Paris and 45 minutes from the center of Paris by
RER D. If you are interested in operational research and would like to
pursue a career in this field, do not hesitate to contact me. Details about
the internship topic and contact information for applying are below:

*Subject:* Integrated closed-loop supply chain and disassembly line
balancing optimization under time-of-use electricity pricing

*Context and missions*

With growing concerns about environmental sustainability, climate change,
and resource depletion, in recent years, companies and consumers have
increasingly focused on circular economies and practices that minimize
waste. The rise of sustainability and environmental awareness has also
fuelled the interest in closed-loop systems. A *Closed-loop supply
chain* (CLSC)
refers to a system where products, materials, or components are returned
after their useful life for reuse, recycling, remanufacturing, or proper
disposal. Unlike a traditional "open-loop" supply chain, which follows a
linear flow from production to consumption and then disposal, a closed-loop
supply chain seeks to minimize waste and maximize resource recovery by
bringing products back into the production process.

A disassembly line aims to efficiently separate a product into its
components for reuse, recycling, or proper disposal. Regarding the
*Disassembly
Line Balancing Problem, *the main objective is to *assign disassembly tasks
to workstations* in a way that minimizes the total cycle time while
ensuring that each workstation is neither overburdened nor underused*.* While
disassembly and closed-loop supply chain are distinct concepts, they are
closely connected, especially in industries where product recovery,
recycling, and remanufacturing are central to business models. By
optimizing disassembly processes, businesses can improve the overall
effectiveness of their closed-loop systems, ensuring that valuable
materials are efficiently extracted and returned to the supply
chain. Despite this strong connection between the two concepts, they have
been rarely studied in an integrated way

The disassembly industry is often energy-intensive and most previous DLBP
studies focus on only minimizing the quantity of used energy but ignore
energy cost saving under Time-of-Use (TOU) tariffs. To the best of our
knowledge, (TOU) tariffs have not been addressed in disassembly line
balancing problems. Based on all these findings, incorporating closed loop
supply chain and disassembly line balancing decisions under the TOU tariffs
will provide interesting insights to decision makers and researchers in the
field.

* The following phases will be carried out during the internship:*

· Conduct a literature review on integrated problems of closed-loop
supply chain and disassembly line balancing.

· Propose an appropriate mathematical model.

· Develop exact or approximate solution methods and validate the
proposed approaches using data.

*Profile required: *

We are looking for a candidate in M2 or in their final year of an
engineering school, specialized in Operations Research, Combinatorial
Optimization, Computer Science, Industrial Engineering, or a related field.

• Formulation of complex problems (LP, MILP).

• Strong skills in algorithms and programming (C++ or Python)

• Good proficiency in English for documentation and result communication,
French knowledge is not required.

*Details :*

Start Date: From February 2025

Duration: 6 months

Laboratory: IBISC Laboratory, AROBAS Team

Location : Evry-Courcouronnes

Contact: To apply, please send your CV, academic transcripts, and class
rankings to Melek Rodoplu (melek.rodoplu@univ-evry.fr)

Please feel free to share this email with anyone you think may be
interested in this position.

Best Regards,

Melek Rodoplu, Ph.D.
Assistant Professor of Supply Chain Management
Université d'Evry-Paris Saclay

23 Bd Francois Mitterrand, 91000 Évry-Courcouronnes

[DMANET] CfP - AI-SEC-2025 [Deadline extension]: The 1st International Workshop on Artificial Intelligence for Cybersecurity, Open University of Catalonia, Barcelona, Spain, April 9-11, 2025.

[Apologies if you receive multiple copies of this CfP.]

********************************************************************************
The 1st International Workshop on Artificial Intelligence for Cybersecurity (AI-SEC-2025), in conjunction with the 39th International Conference on Advanced Information Networking and Applications (AINA-2025) Conference, Open University of Catalonia, Barcelona, Spain, April 9-11 2025.
https://sites.google.com/community.unipa.it/ai-sec2025?pli=1
********************************************************************************

About the Workshop: The AI-SEC 2025 workshop aims to bring together researchers, industry professionals, and practitioners to discuss the latest advancements in artificial intelligence for cybersecurity. The workshop will focus on innovative AI techniques and real-world applications that strengthen system and network security, counter evolving cyber threats, and ensure the robustness of AI models in distributed environments.
Topics of Interest: All topics related to the contribution of artificial intelligence approaches to the security of networks and distributed systems are welcome. These include, but are not limited to:
• AI for the detection of threats and anomalies in Software-defined Networking
• AI-Enhanced security for Mobile Ad-hoc Networks and Wearable Systems
• AI-assisted techniques for security in web applications
• Detection and mitigation of AI-enabled cyberattacks
• AI-assisted techniques for network intrusion detection
• Security in IoT and pervasive networks with AI
• AI-assisted authentication and network access control
• Network forensic analysis using AI
• AI-powered malware detection in distributed settings
• AI-based context-aware network diagnostic and threat detection
• AI for data security and privacy in distributed systems
• Vulnerability assessment of AI and related technologies in distributed computing systems
• AI for physical layer and cross-layer security
• Applications of AI methods for wireless and mobile security
• AI-based fault tolerance in distributed systems
• AI-enhanced Trust Management in Multi-agent Systems

SUBMISSION GUIDELINES
We welcome research papers up to 10 pages. Submissions should be made in PDF format following the Lecture Notes Style of Springer Proceedings (template available here: https://voyager.ce.fit.ac.jp/conftools/Springer/For-the-authors-LECTURE-NOTES-TEMPLATES.zip). For detailed submission instructions, please visit https://voyager.ce.fit.ac.jp/conf/aina/2025/guidelines.php.

Paper submission link: https://edas.info/N32463

All accepted papers will be included in conference proceedings of Lecture Notes series published by Springer. Proceedings will be sent by Springer for indexing in SCOPUS. Authors of accepted papers will be given instructions for submission of camera ready and copyright form.

IMPORTANT DATES
Submission Deadline: November 30, 2024
Author Notification: January 5, 2025
Camera-Ready Submission: February 5, 2025

ORGANIZING COMMITTEE
Workshop co-chairs:
-Andrea Augello, University of Palermo
-Ashish Gupta, BITS-Pilani Dubai campus

Publicity chair:
-Farwa Batool, IMT Alti Studi di Lucca

Program committee (TPC):
TBA

[DMANET] Research Group Leader Position in Reliable Graph Machine Learning

The Research Center Trustworthy Data Science and Security
https://rc-trust.ai/ is seeking to fill the following position at the
TU Dortmund University as soon as possible. If you are interested in
the position, please send your application (Ref-No. W52-24) until 20th
December 2024!

Young Investigator Group Leader
*** Reliable Graph Machine Learning ***

You will create your own independent research group; funding for 5
years includes your own position plus one additional PhD position
funded by our research center.

Envisioned research should be focused but not limited to:
▪ Adversarial Attacks on Graph Neural Networks
▪ Adversarial Attacks on Node Embeddings
▪ Neural Network Architectures for Graphs
▪ Generative Models for Graphs
▪ Geometric Deep Learning
▪ Representation Learning
▪ Bayesian Methods for Graph Machine Learning
▪ Robustness Certificates, Reliability Guarantees or Uncertainty
Quantification supporting Trustworthy Machine Learning

We are searching in particular for young female scientists with
▪ Excellent degree (doctorate) in machine learning, artificial
intelligence, or related research areas.
▪ High degree of independence to create and lead an independent
research group within an interdisciplinary research environment.
▪ Experience with interdisciplinary research projects with
fundamental theoretical research and practical applications

More information:
https://static.rc-trust.ai/Reliable-Graph-Machine-Learning.pdf

If you have any further questions, please contact:
Prof. Dr. Emmanuel Müller
open-positions@rc-trust.ai

More young investigator positions will open in the next weeks on
***Active Learning and Uncertainty Quantification***
and some more core ML topics. If you interested, feel free to apply
early!

Sunday, November 24, 2024

[DMANET] IGAFIT HALG 2025, June 4-6, 2025 ETH Zurich - Call for invited talks nominations

The 10th IGAFIT Highlights of Algorithms conference (HALG 2025)
ETH Zurich, Switzerland. June 4-6, 2025
https://kyng.inf.ethz.ch/halg2025/
http://2025.highlightsofalgorithms.org/

The IGAFIT Highlights of Algorithms (HALG) conference is designed to be a forum for presenting the highlights of recent developments in algorithms. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks and survey presentations, as well as the possibility for all researchers and students to present their recent results through a series of short talks and poster presentations.

This year, HALG is planned to feature around 16 invited talks and 5-6 survey talks, as well as ~50-60 short contributed presentations and a poster session. The last editions of the conference were a true success with about 200 registrants with a large participation of PhD and young researchers.

Call for Nominations

The HALG 2025 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks:
A. survey (50 minutes): a survey of an algorithmic topic that has seen exciting developments in the last couple of years.
B. paper (30 minutes): a significant algorithmic result appearing in a paper in 2024 or later.
To nominate, please email Virginia Vassilevska Williams (program chair) <halgchair AT gmail DOT com> the following information:
Basic details: speaker name + topic (for survey talk) or paper's title, authors, conference/arxiv + preferable speaker (for paper talk). Brief justification: Focus on the benefits to the audience, e.g., quality of results, importance/relevance of topic, clarity of talk, speaker's presentation skills.
All nominations will be reviewed by the Program Committee (PC) to select speakers that will be invited to the conference. Nominations deadline: 11th January 2025. Please keep in mind that the conference does not provide financial support for the speakers.

Theory Announcements

Saturday, November 30, 2024

[DMANET] DeepLearn 2025: early registration December 25

Friday, November 29, 2024

[DMANET] PhD opening in TCS and/or combinatorial optimization in Lund

[DMANET] 2nd Call for Postdoc and Group Leader Positions at the Max Planck Institute for Informatics

[DMANET] PACE Challenge: Searching for a PC chair for PACE 2026

[DMANET] Submission Deadline: December 1, 2024 – The 1st International Workshop on TwinNetApp in conjunction with IEEE WCNC 2025 | Milan, Italy

[DMANET] The Airbus Beluga Competition is open!

Thursday, November 28, 2024

[DMANET] [HCCS PerCom 2025] SUBMISSION DEADLINE APPROACHING DEC 1st

Wednesday, November 27, 2024

[DMANET] Reminder: MIPLIB 2024 Submission

[DMANET] CfP: DisCoTec 2025

[DMANET] Postdoctoral assistant position available on the topic of Cutting and Packing Optimisation

[DMANET] EuroCG 2025: First Call for Contributions

Tuesday, November 26, 2024

[DMANET] Tenure-Track Assistant Professor Position in Algorithms at SDU, Denmark

[DMANET] Postdoc at Lyon

[DMANET] Call for Papers: 2025 Genetic and Evolutionary Computation Conference (GECCO 2025)

Monday, November 25, 2024

[DMANET] CFP Journal of Combinatorial Optimization -SI ECCO

[DMANET] PhD opportunities at the University of Birmingham

[DMANET] ISSAC 2025 -- Second Call for Papers

[DMANET] M2 Internship Offer in Operations Research – Université d’Evry-Paris Saclay

[DMANET] CfP - AI-SEC-2025 [Deadline extension]: The 1st International Workshop on Artificial Intelligence for Cybersecurity, Open University of Catalonia, Barcelona, Spain, April 9-11, 2025.

[DMANET] Research Group Leader Position in Reliable Graph Machine Learning

Sunday, November 24, 2024

[DMANET] IGAFIT HALG 2025, June 4-6, 2025 ETH Zurich - Call for invited talks nominations

Mailing Lists

Search This Blog

Blog Archive

Saturday, November 30, 2024

Friday, November 29, 2024

Thursday, November 28, 2024

Wednesday, November 27, 2024

Tuesday, November 26, 2024

Monday, November 25, 2024

Sunday, November 24, 2024

Mailing Lists

Subscribe To

Search This Blog

Blog Archive