[DMANET] Postdoc and PhD positions in Combinatorics at Heidelberg University, Germany (research group: Felix Joos)

In the group of Prof Felix Joos at Heidelberg University, Germany there
are open positions to be filled in the following categories:

Postdoc: 2-year position (extension possible)
PhD student: 3-year position

Starting date: Around September/October 2025 (negotiable)

For the postdoc position please apply via mathjobs (soft deadline 1st
December): https://www.mathjobs.org/jobs/list/25716

Applications for the PhD positions should be directly sent to Felix Joos
(joos@uni-heidelberg.de). For informal inquires, please get in touch
with him.

Postdoc applicants should have a strong background in combinatorics.

PhD applicants should have a degree in Mathematics or related. Please
include in your application a cover letter, a cv, your master thesis and
names of two to three people who are willing to write a letter of
recommendation for you.

DEADLINE: all applications for the PhD position received until 15th
December receive full consideration. The position remains open until filled.

More information about the Heidelberg combinatorics group:
https://web.ifi.uni-heidelberg.de/tcs
**********************************************************
*
* 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][Deadline extended] AHPC3 - The 1st Workshop on Accelerated HPC in the Cloud-Edge Continuum

==============================================================================
CALL FOR PAPERS

AHPC3: The 1st Workshop on Accelerated HPC
in the Cloud-Edge Continuum

Affiliated with the 33rd Euromicro International Conference on Parallel,
Distributed and Network-Based Processing (PDP 2025)

12-14 March 2025, Turin (Italy)

IMPORTANT DATES

Abstracts submission: October 30, 2024 November 11, 2024 (Extended)
---
Papers submission: November 11, 2024 November 20, 2024 (Extended)
---
Authors notification: December 16, 2024
---
Camera-Ready submission: January 27, 2025

SPECIAL ISSUE

Selected papers will be invited to submit extended versions for a special issue
of the International Journal of Networked and Distributed Computing,
published by Springer.


WEBSITE: http://ahpc3.di.unipi.it/
==============================================================================

Today, we are witnessing an increasing demand for high-performance computing
infrastructures. Modern applications imply the need to process computationally
intensive workloads. Unlike in the past, when just a handful of application
domains used HPC infrastructures, nowadays, they are requested by a plethora of
domains and applications. This is mainly due to the high availability of a
large amount of data. Traditionally, HPC infrastructures were sharply distinct
from Cloud infrastructures by their unique software and hardware requirements
and their on-premises nature.
However, in recent times, such distinctions have become increasingly blurry,
driven by the proliferation of applications such as Big Data and AI/ML. Modern
Cloud infrastructures are getting closer to HPC systems in terms of performance
capabilities and hardware specifications.
This workshop aims to explore the intersection of high-performance computing
and modern Cloud Edge continuum architectures. The focus will be on achieving
HPC by relying on Cloud-Edge architectures. The workshop will investigate how
technologies that are typically exploited in the context of Cloud and Edge
environments, including serverless computing, microservices, and load
balancers must be adapted, tailored, and managed to achieve efficient and
scalable solutions that can support the execution of HPC applications.
The key topics include lightweight virtualisation, dynamic execution
environments, and advanced scheduling technologies crucial to deploying
high-performance workflows in Cloud environments, but not limited to them. In
addition, the workshop will focus on orchestration and deployment techniques.
The workshop aims to attract submissions on innovative programming paradigms
for high-performance Cloud Edge computing, including network communication,
data management and fault tolerance, reliability, and security strategies. It
seeks insights on managing data-intensive workloads, heterogeneous resource
management tools, and HPC application monitoring in Cloud-Edge environments.
Emphasis will be placed on sustainability and efficient green practices.
In addition, contributions to the potential for FPGA/GPU acceleration
architectures for data flow processing and joint resource-sharing mechanisms in
hybrid HPC environments are welcome. Similarly, we aim to explore the latest
innovations, challenges, and applications in Cloud-Edge continuity and hybrid
Cloud HPC, focusing on accelerated environments such as FPGA and GPU architectures.
Improvement and innovation opportunities like these call for new solutions and
theoretical frameworks. The 1st International Workshop on Accelerated HPC in
the Cloud Edge Continuum (AHPC3) aims to bring together Cloud, Edge computing,
and HPC experts from academia and industry to identify new challenges, discuss
novel systems, methods, and approaches for Hybrid and accelerated HPC
Cloud-Edge infrastructures and architectures, and promote this vision toward
academia and industry stakeholders.

==============================================================================

TOPICS OF INTEREST

Topics of interest for the workshop include but are not limited to the
following ones:


Adaptation of Cloud-Edge technologies and methodologies for HPC (e.g.,
serverless, microservices, task offloading)
- Cloud-Edge computing architectures for HPC (e.g., resource federation)
- Lightweight virtualisation tools, execution environments and scheduling techniques
- Orchestration, deployment techniques and algorithms for High-performance
workflows in Cloud-Edge environments
- Programming paradigms for High-Performance Cloud-Edge computing
- Communication and Data management for Cloud-Edge computing
- Fault tolerance, reliability and security in the Cloud-Edge continuum
- Data-intensive workloads and tools
- Methodologies and tools for heterogeneous resource management
- Tools and techniques for monitoring HPC Cloud-Edge applications
- Sustainability for HPC Cloud-Edge computing
- Accelerated FPGA/GPU architectures for Cloud-Edge computing
- Data stream processing with FPGA/GPU in Cloud-Edge computing
- Federated resource-sharing mechanisms for hybrid HPC

==============================================================================

SUBMISSIONS AND ATTENDANCE

Accepted papers will be published in the conference Proceedings. Submitted
papers must be original work that has not appeared in and is not under
consideration for another conference or a journal. Every submitted paper will
be reviewed by at least three members of the Program Committee. Reviewing will
be single-blind. Authors are invited to submit papers of the following types
and lengths in the IEEE Conference proceedings format style:


- Regular papers (maximum 8 pages) should present innovative works whose claims
are supported by solid justifications.
- Short papers (maximum 4 pages) should target position papers that articulate
a high-level vision or describe challenging future directions.


Please note that registering on the submission site with a title and meaningful
abstract by the earliest deadline is required to enable the actual paper
submission.

The authors must be prepared to sign a copyright transfer statement. At least
one author of each accepted paper must register for the workshop by the early
date, to be indicated by the organisers, and *must* present the paper.

SUBMISSION LINK: http://ahpc3.di.unipi.it/submissions.html

==============================================================================

ORGANISERS

- Luca Ferrucci, University of Pisa, luca.ferrucci@unipi.it<mailto:luca.ferrucci@unipi.it>, General Chair
- Stefano Forti, University of Pisa, stefano.forti@unipi.it<mailto:stefano.forti@unipi.it>, General Chair
- Valerio Besozzi, University of Pisa, valerio.besozzi@phd.unipi.it<mailto:valerio.besozzi@phd.unipi.it>, Program Chair
- Alberto Ottimo, University of Pisa, alberto.ottimo@phd.unipi.it<mailto:alberto.ottimo@phd.unipi.it>, Program Chair
- Jacopo Massa, University of Pisa, jacopo.massa@phd.unipi.it<mailto:jacopo.massa@phd.unipi.it>, Program Chair

==============================================================================

PROGRAM COMMITTEE

- Jorn Altmann, Seoul National University
- Hojjat Baghban, Chang Gung University
- Roberto Casadei, University of Bologna
- Emanuele Carlini, ISTI-CNR
- Marcin Copik, ETH Zürich
- Massimo Coppola, ISTI-CNR
- Patrizio Dazzi, University of Pisa
- Maria Fazio, University of Messina
- Carlos Guerrero, University of Balearic Islands
- SongHee Kang, Seoul National University
- Hanna Kavalionak, ISTI-CNR
- Isaac Lera, University of Balearic Islands
- Matteo Mordacchini, IIT-CNR
- Paolo Palazzari, ENEA
- Paul Rourab, Siksha 'O' Anusandhan University
- Jocelyn Sérot, Université Clermont Auvergne
- Konstantinos Tserpes, NTUA
- Paolo Trunfio, University of Calabria
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Scheduling seminar] Hugo Chareyre (Artelys) | November 6 | Operational scheduling in automotive industry

Dear scheduling researcher,

We are delighted to announce the talk given by Hugo Chareyre (Artelys).
The title is " Operational scheduling in automotive industry". The
seminar will take place on Zoom on Wednesday, November 6 at 14:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/98884415966?pwd=OTzYfvWhtPObJTHpZaK2BarbGHoLUh.1
Meeting ID: 988 8441 5966
Passcode: 576609

You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
Artelys has developed a scheduler service for Toyota Motor Europe that
creates plannings for post-production workshops operations across
Europe. The problem consists in scheduling operations on vehicles on
different production lines with available resources. This case study
details how this industrial problem differs from the classical Resource
Constrained Project Scheduling Problem (RCPSP) with its additional
operational constraints (multiple shifts, preemptive breaks, sequence
constraints, etc.) and its multi-objectives (minimizing late tasks, late
vehicles, maximizing efficiency and workers ergonomics, etc.). Artelys
has worked closely with Toyota to deploy this scheduler service as
micro-service in order to solve this complex problem in a real-time
context and as a flexible decision-aid software. The associated
constraint programming model is implemented with Fico Mosel modelling
language and the model is solved using Artelys Kalis solver. This
micro-service has replaced a manual tedious task that was taking place
differently in all workshops by delivering faster, higher quality solutions.

The next talk in our series will be:
Philippe Laborie (Hexaly) | November 20 | Hexaly Optimizer for Scheduling
For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek Hanzalek, Michael Pinedo and Guohua Wan

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

**********************************************************
*
* 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] Aarhus University is hiring Assistant and Associate Professors

Aarhus University - an international top-100 University - has made an ambitious strategic investment in recruitment to expand the Department of Computer Science. We expect to hire four candidates in 2025. Therefore, the department invites applications from candidates in computer science that are driven by excellence in research and teaching as well as external collaboration on societal challenges.

The successful candidates will have the opportunity to contribute to and shape the research and teaching as well as the industrial and societal collaboration associated with the department expansion.

The department has world-class research groups within "Algorithms, Data Structures and Foundations of Machine Learning", "Data-Intensive Systems", "Cryptography and Cyber Security", "Computational Complexity and Game Theory", "Logic and Semantics", "Ubiquitous Computing and Interaction", "Collaboration and Computer-Human Interaction", and "Programming Languages".

We encourage applicants to strengthen the above groups. Additionally, we wish to expand competencies within topics like Machine Learning/Artificial Intelligence, NLP/Large Language Models, Quantum Computing, Quantum Cryptography, Economics and Computation, Tangible/Physical Computing, Systems and Networks, and Software Engineering.

We are looking for both tenure-track Assistant professors and Associate professors, and we generally encourage candidates within all areas of Computer Science – not restricted to the above – to apply.

Link to the call:
https://cs.au.dk/about-us/vacancies/job/aarhus-university-is-hiring-assistant-and-associate-professors-to-contribute-to-the-future-of-the-department-of-computer-science-3

Application deadline: January 13th, 2025.

Best
Kasper Green Larsen
Professor, Ph.D.
Computer Science, Aarhus University
Head of Algorithms, Data Structures and
Foundations of Machine Learning

**********************************************************
*
* 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] DeepLearn 2025: early registration November 26

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

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: November 26, 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: (to be completed)

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

Nello Cristianini (University of Bath), tba

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), tba

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

Preslav Nakov (Mohamed bin Zayed University of Artificial Intelligence), tba

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

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

[DMANET] 2nd Call for Papers: SoCG 2025

2nd Call for Papers: SoCG 2025

The 41st International Symposium on Computational Geometry (SoCG 2025) is
planned to be held in Kanazawa, Japan, June 23–27, 2025, as part of the
Computational Geometry (CG) Week. We invite high quality submissions that
describe original research on computational problems in a geometric and/or
topological setting. Topics of interest include, but are not limited to:

- Design, analysis, and implementation of geometric algorithms and data
structures;
- Computational complexity of geometric problems;
- Implementation and experimental evaluation of geometric algorithms and
heuristics, including mathematical, numerical, and algebraic aspects;
- Discrete and combinatorial geometry;
- Computational topology, topological data analysis, and topological
combinatorics;
- Applications of computational geometry or topology in any field.

IMPORTANT DATES

- November 26, 2024 (Tuesday): Abstracts and paper registration due (23:59
AoE (anywhere on Earth))
- December 3, 2024 (Tuesday): Papers due (23:59 AoE (anywhere on Earth))
- February 6, 2025 (Thursday): Notification of acceptance/rejection
- mid March 2025: Final versions of accepted papers due
- June 23–27, 2025: Symposium

SoCG 2025 conference web page: https://socg25.github.io/socg.html

SoCG 2025 HotCRP submission webpage: https://socg25.hotcrp.com/

CODE OF CONDUCT
SoCG is dedicated to providing an environment that is free from harassment,
bullying, discrimination, and retaliation for all participants. Starting in
2025, CG Week including SoCG will be organized as an event of the CG
Society (https://computational-geometry.org/society/). All members of the
Society are bound by its Code of Conduct. Only members of the Society can
give a presentation and hence at least one author of each accepted paper
must become a member of the Society. Society membership is free.

SUBMISSION GUIDELINES

+ Paper types
When writing or evaluating a SoCG paper, it is important to keep in mind
that there are different types of contributions, each with its own
strengths. To ensure that a submission is evaluated on its own merits,
authors will need to identify the main strengths of their submission, as
captured by four possible paper types. PC members and external reviewers
will be asked to take into account these paper types together with their
associated evaluation criteria when they evaluate a paper. There are no
quotas for the paper types and submissions can be labeled with more than
one paper type at the time of submission.

- Mathematical Foundations: A typical paper will contain theorems and
proofs describing new results in discrete or combinatorial geometry,
discrete differential geometry or topology, or in topological
combinatorics. The paper will primarily be evaluated on its technical
depth, the importance of the results, the elegance of the solution, the
connection of the problem studied to computational geometry and topology,
and the potential future impact on algorithm development.

- Algorithmic Complexity: A typical paper will contain algorithms, data
structures, theorems, proofs, or lower bound constructions describing new
results on computational geometry problems. The paper will primarily be
evaluated on the (mathematical or computational) relevance and importance
of the problem studied, its technical depth, the elegance of the solution,
and the potential future impact of the results or the proposed new methods
and techniques.

- Experiments and Implementation: A typical paper will make a clear
contribution to the implementation and evaluation of geometric algorithms,
such as exact, approximate, or algebraic computation, algorithms
engineering, or the experimental evaluation of competing algorithmic
approaches. The paper will primarily be evaluated on the completeness and
the expected impact of the proposed implementation, the soundness of the
experiments, the quality and quantity of testing, and on the general amount
of knowledge gained.

- Applications: A typical paper will describe the modeling and
algorithmic choices made when developing or adapting computational geometry
techniques for an application area. The paper will be primarily evaluated
on the soundness of the modeling decisions, the ingenuity of the solution,
the effectiveness of the proposed method, and the expected impact in the
application area. One might also consider the lesson learned regarding the
applicability or suitability of computational geometry tools to the
specific area.

+ Double Blind and PC submissions
SoCG will employ a lightweight double-blind reviewing process, and will
allow PC members (other than the PC chairs) to submit to the conference as
well. Submissions should not reveal the identity of the authors in any way.
In particular, authors' names, affiliations, funding information, and email
addresses should not appear in the submission. Authors should ensure that
any references to their own related work is in the third person (e.g., not
"We build on our previous work ..." but rather "We build on the work of
..."). Particular care needs to be taken if there is any accompanying
software or data, which needs to be linked anonymously (for example, via a
DropBox anonymous folder or Anonymous GitHub, perhaps with a subset of
synthetic data if the real data is not anonymized). Upon registering a
submission, the authors will declare conflicts of interest with PC members,
as well as listing email address or domain level conflicts (i.e. "Haitao
Wang (University of Utah)", "All (Graz University of Technology)") of other
professional or personal conflicts. This includes past advisors and
students, people with the same affiliation, and any recent/frequent
coauthors and collaborators. Please refer to the SoCG 2025 Conflict of
Interest Guidelines (
https://docs.google.com/document/d/1QNR3JUe_DimGP79EbcmayUi7I3obiTdxAIzXMFxaCfI/pub)
for a detailed discussion of possible conflicts of interest.

The purpose of lightweight double-blind reviewing is to help PC members and
external reviewers come to an initial judgment about the paper without
bias, not to make it impossible for them to discover the authors if they
were to try. Authors should feel free to disseminate their ideas or draft
versions of their paper as they normally would. For example, authors may
post drafts of their papers on the web, submit them to arXiv, and give
talks on their research ideas. We encourage authors with further questions
on double-blind reviewing to contact the PC chairs, or to see the more
detailed discussion in the proposal that preceded the vote to move to
double blind.

+ Format
Submissions must be formatted in accordance with the LIPIcs proceedings
guidelines (https://www.dagstuhl.de/en/publishing/series/details/lipics).
Authors are required to use the LaTeX class file socg-lipics-v2021.cls
(V0.9, Sep 19, 2022), with the option "anonymous"; note that the class file
is a wrapper around the standard LIPIcs class. The LIPIcs style and
instructions are available here (
https://submission.dagstuhl.de/series/details/5#author); the SoCG class
file is available here (
https://computational-geometry.org/documents/socg-lipics-v2021.cls), and
instructions on how to use it are available here (
https://computational-geometry.org/documents/linecount_2022_09_19.pdf).
Submissions must not exceed 500 lines, excluding front matter (title),
references, and a clearly marked appendix (further described below), but
including all other lines (in abstract, algorithms, tables, captions,
etc.). The class files provide line counting which should be accurate in
most cases. Authors should refrain from putting excessive amounts of text
in parts in which lines are not counted automatically. If authors need
constructs that contain uncounted lines of text, they should compensate for
this by reducing the final line count accordingly. It is the sole
responsibility of the authors not to exceed 500 lines even if some lines
are not counted automatically.

+ Contents of the submission
Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, as well as a short abstract. This
should be followed by the main body of the paper that begins with a precise
statement of the problem considered, a succinct summary of the results
obtained (emphasizing the significance, novelty, and potential impact of
the research), and a clear comparison with related work. The remainder of
the extended abstract should provide sufficient details to allow the
program committee to evaluate the validity, quality, and relevance of the
contribution. Clarity of presentation is very important; the entire
extended abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and non-experts, often
under tight time constraints.

In addition, authors are asked to avoid "et al." in citations in favor of
an equal mention of all authors' surnames. For instance, if the number of
authors is large, consider writing "The authors in [#] show" instead of "A
et al. [#] show".

+ Appendix and additional data
All details needed to verify the results must be provided. Supporting
materials, including proofs of theoretical claims and experimental details,
that do not fit in the 500-line limit should be given in an appendix. If
more appropriate, the full version may be given as the appendix. In both
cases, however, the authors should include in the main part specific
pointers to the relevant locations in the appendix. The appendix will be
read by the program committee members and subreviewers at their discretion
and will not be published as part of the proceedings. Thus, the paper
without the appendix should be able to stand on its own. Experimental and
implementation results (independent of paper type) must be reproducible and
verifiable. Authors of all types of papers are encouraged to put
accompanying software and relevant data, if there is any, in a repository
accessible to the reviewers.

+ Previous or simultaneous submission
Results previously published or accepted for publication in the proceedings
of another conference cannot be submitted. Simultaneous submissions of the
results to another conference with published proceedings are not allowed.
Exempted are workshops and conferences without formal proceedings, but
possibly with handouts containing short abstracts. In particular,
submissions of papers that have appeared or will be submitted to EuroCG are
allowed, since EuroCG does not publish formal proceedings, while
submissions of papers that have appeared in CCCG are not allowed. Results
that have already been accepted (with or without revision) for publication
in a journal at the time of their submission to the symposium are not
allowed.

+ Strict guidelines
Submissions deviating from the above guidelines risk being rejected without
further consideration.

+ Guidelines for reviewers
The guidelines for reviewers are available here (
https://computational-geometry.org/documents/socg-reviewing.pdf).

ACCEPTED PAPERS

+ Presentation: An author of each accepted paper is expected to attend the
symposium and present the paper (approximately 20 minutes). Note that SoCG
2025 will be organized as an event of the CG Society (
https://computational-geometry.org/society/) and hence the presenting
author(s) must be a member of the Society. Society membership is free.

+ Best paper award: An accepted paper may be selected as the best paper.
All papers are eligible.

+ Best student paper award: An accepted paper may be selected as the best
student paper. A paper is eligible if all authors are students at the time
of submission. This must be indicated in the submission process. There is a
box provided for this purpose on the submission server.

+ Best student presentation award: Based on the feedback from the audience,
a presentation during the symposium by a student may be selected as the
best student presentation.

In exceptional cases, each of these awards may be granted to more than one
paper/presentation.

+ Invited papers and special issues: Authors of the best paper will be
invited to submit an extended version of their paper to the Journal of the
ACM, and authors of one (or more) most highly ranked papers may be invited
to submit their full paper to the journal TheoretiCS. Authors of a
selection of accepted papers from the symposium will be invited to submit
extended versions of their papers to special issues of Discrete &
Computational Geometry and Journal of Computational Geometry.

+ Format: Final proceedings versions of accepted papers must respect the
same formatting constraints as the submissions (LIPIcs proceedings format
with socg-lipics-v2021; 500-line limit, excluding front matter and
references), but must not comprise any appendix. If any supporting material
(including complete proofs of theoretical claims and experimental details)
does not fit in the specified limit, then the full version of the paper
containing this information must be referenced in the conference version
and made available at a public repository, such as arXiv, by the time the
final version is submitted. Where applicable, we encourage the authors to
make accompanying software and/or data publicly accessible, with proper
references in the paper.

PROGRAM COMMITTEE

- Mikkel Abrahamsen, University of Copenhagen
- Oswin Aichholzer, Graz University of Technology (co-chair)
- Hugo Akitaya, University of Massachusetts Lowell
- Mark de Berg, Eindhoven University of Technology
- Sujoy Bhore, Indian Institute of Technology Bombay
- Ahmad Biniaz, University of Windsor
- Håvard Bakke Bjerkevik, SUNY Albany
- Gerth Stølting Brodal, Aarhus University
- Hsien-Chih Chang, Dartmouth College
- Siu-Wing Cheng, Hong Kong University of Science and Technology
- Vida Dujmović, University of Ottawa
- David Eppstein, University of California, Irvine
- Emily Fox, University of Texas at Dallas
- Jie Gao, Rutgers University
- Dan Halperin, Tel Aviv University
- Tao Hou, University of Oregon
- Christian Knauer, University of Bayreuth
- Francis Lazarus, Université Grenoble Alpes
- Chih-Hung Liu, National Taiwan University
- Daniel Lokshtanov, University of California Santa Barbara
- Anna Lubiw, University of Waterloo
- Amir Nayyeri, Oregon State University
- Eunjin Oh, Pohang University of Science and Technology
- Tim Ophelders, Utrecht University and TU Eindhoven
- Irene Parada, UPC BarcelonaTech
- Rahul Saladi, Indian Institute of Science
- Patrick Schnider, University of Basel and ETH Zürich
- Raimund Seidel, Saarland University
- Don Sheehy, North Carolina State University
- Shakhar Smorodinsky, Ben-Gurion University
- Jonathan Spreer, University of Sydney
- Takeshi Tokuyama, Kwansei Gakuin University
- Torsten Ueckerdt, Karlsruhe Institute of Technology
- Pavel Valtr, Charles University
- Kasturi Varadarajan, University of Iowa
- Haitao Wang, University of Utah (co-chair)
- Jinhui Xu, University at Buffalo
- Jie Xue, New York University Shanghai

**********************************************************
*
* 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] Online Resources for DCs (IFORS)

As our material progresses, this is just a reminder every now and then.
To access information regarding IFORS Developing Countries resources, its regular updates – and to submit your possible "free" (not copyright protected) material, you may occasionally visit the link:

http://ifors.org/developing_countries/index.php?title=Main_Page .

With this open online resources page we aim to provide a platform to make research and applications of OR widely accessible to the entire OR community including researchers, academicians and scholars in the Developing Countries (DCs).

For this purpose we invite scholarly contributions spanning across all areas and sectors ranging from arts and science, to communication and education.

The International Federation of Operational Research Societies (www.ifors.org/ ) is a 65-year-old organization which is currently composed of 54 national societies. Regional Groups of are: ALIO (The Latin American Ibero Association on Operations Research), APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies). conferences are held every three years. The conference 2023 was held very successfully in Santiago, Chile; the next exciting IFORS conference will be celebrated in 2026 in Vienna. Please visit the following link for details regarding the same: https://www.ifors2026.at/home/ .

Thank you very much for your attention. We look forward to your enthusiastic participation and scholarly contributions.

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

[DMANET] Postdoc Position in Information Theory at OIST (Amedeo Roberto Esposito)

Dear all,

I have various postdoc positions at OIST in Okinawa, Japan, starting right away.

The successful candidate would work directly with me and the topic can vary

based on common interests.

Actual areas of interest include:

- information measures;

- concentration of measure in non-classical settings (non iid);

- information-theoretic bounds on the generalisation error of learning algorithms;

- estimation theory;

- hypothesis testing in non-classical settings;

- estimation and prediction in biological settings;

- properties (contraction) of Markovian and non-Markovian operators on probability measures;

- variational characterisations of information measures;

Knowledge of measure theory and functional analysis is strongly appreciated.

If you know someone that might be interested please kindly forward them this email.

Best,

Amedeo Roberto Esposito

**********************************************************
*
* 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] DTW 2025: International Workshop on Digital Twins - February 19-21, 2025 - Padova, Italy

Dear Colleagues

We are organizing a workshop on Digital Twins in Padova, Italy, on February 19-21, 2025.
The workshop will be interdisciplinary: mathematics and computer science.

Important information:
- the website of the event is here: https://sites.google.com/view/dtw25
- there is no registration fee but registration is mandatory due to limited capacity.
- we have a call for posters here: https://sites.google.com/view/dtw25/call-for-posters with deadline January 10, 2025.

Theme:
Digital twins constitute a virtual, precise representation of some physical system. As such, they are an
ultimate goal of the most advanced mathematical models. The aim of this workshop is to bring together leading
experts in some of the intertwined fields connected to similar applications, focusing in particular on the mathematical
and on the computer science aspects of Machine Learning and cyber-physical systems. On the mathematical side,
emphasis will be given to the analysis of differential equations and algorithms arising in specific models or in more
general theories. On the computer science side, attention will be devoted to formal methods and artificial intelligence
for advanced modeling, analysis, verification, synthesis, and control of cyber-physical systems.

Chairs:
- Mattia Fogagnolo, University of Padova, Italy
- Matteo Zavatteri, University of Padova, Italy

Scientific committee:
- Davide Bresolin, University of Padova, Italy
- Erik Chinellato, University of Padova, Italy
- Marco Cirant, University of Padova, Italy
- Francesco Fantin, University of Padova, Italy
- Antonia Larese, University of Padova, Italy
- Fabio Marcuzzi, University of Padova, Italy
- Nicolò Navarin, University of Padova, Italy
- Luca Pasa, University of Padova, Italy
- Mario Putti, University of Padova, Italy
- Alessandro Sperduti, University of Padova, Italy
- Daniela Tonon, University of Padova, Italy

Invited speakers:
1) Alessandro Abate, University of Oxford, U.K.
2) Martin Burger, University of Hamburg, Germany
3) Luca Dedè, Politecnico di Milano, Italy
4) Barbara Hammer, Bielefeld University, Germany
5) Mauro Maggioni, Johns Hopkins University, U.S.A.
6) Michel Reniers, Eindhoven University of Technology (TU/e), the Netherlands
7) Carola Bibiane Schönlieb, University of Cambridge, U.K
8) Stefano Tonetta, Fondazione Bruno Kessler, Trento, Italy

Sincerely,
Matteo Zavatteri
**********************************************************
*
* 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] Application of Metaheuristics

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
special session (workshop) on
"APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE PROBLEMS" at the 15th
International Conference on
Large Scale Scientific Computation - LSSC'25, June 16 - 20, 2025, Sozopol,
Bulgaria,
with arrival: June 15 and departure: noon June 20.

The session is organized by:
Prof. Stefka Fidanova (stefka.fidanova@gmail.com)
from the Institute of Information and Communication Technologies, Bulgarian
Academy of Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Topics

The list of topics includes, but is not limited to:

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms,
ant colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing techniques
and
other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics, finance,
physics, medicine, biology, engineering etc

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a
special volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2025
Notification of acceptance of the talks on the basis of the submitted
abstract
January 31, 2025
Deadline for registration
March 01, 2025
Deadline for submission of full papers
March 01, 2025
Notification of acceptance of full papers
April 15, 2025

Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the results)
are to be written in standard LaTeX.
The length of the contributed papers is limited to 8 pages. It is assumed
that ONE participant
will present not more than ONE talk.

Send the abstracts and papers to special session organizers and conference
organizers,
indicating the name of the special session.
After sending the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation,
registration form and conference location you can find at the conference
web page http://parallel.bas.bg/Conferences/SciCom25/

Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

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