Wednesday, December 24, 2025

[DMANET] PhD position in computational complexity at the University of Sheffield, UK

Dear colleagues,

We invite applications for a *fully funded PhD position* in *computational
complexity theory*, jointly supervised by *Dr. Swagato Sanyal* and *Prof.
Or Meir *at *the University of Sheffield, UK.*

The project will study open questions in computational complexity theory,
more specifically in Boolean function analysis, query complexity,
communication complexity, and circuit complexity. The specific questions to
be studied will be determined jointly with the student to suit their
interests.

The position is expected to start in *February - April 2026*.
The application deadline is *January 31, 2026.*

Further details and application instructions can be found here:
https://www.findaphd.com/phds/project/computational-complexity-theory/?p193336

Please feel free to circulate this announcement to interested students. Any
enquiries may be sent to swagato.sanyal@sheffield.ac.uk

Best regards,
*Swagato Sanyal*
*Lecturer, University of Sheffield*

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

Tuesday, December 23, 2025

[DMANET] Special Session "AI in Group Theory" at ISAIM2026 - Ft. Lauderdale Jan 7-9, 2026

There will be an all day Special Session on "AI in Group Theory" on Friday,
Jan 9, 2026
at ISAIM2026 - (Ft. Lauderdale Jan 7-9, 2026)
https://isaim2026.cs.ou.edu/sessions.html
Organizers: Elena Bunina <https://cris.biu.ac.il/en/persons/elena-bunina>
and Alexei Miasnikov <https://web.stevens.edu/algebraic/alexeim/>

This special session explores contemporary Machine Learning and AI
techniques as tools for research in group theory and adjacent
algebraic/combinatorial domains. We invite talks on AI-assisted conjecture
generation and proof search, learning algebraic invariants and
representations from data, symbolic–neural pipelines for
word/conjugacy/isomorphism problems, and reinforcement or generative
methods for algorithm discovery. We also welcome contributions on
verification and evaluation (formal proofs, benchmarks, reproducible
pipelines). The aim is to bring together mathematicians and AI researchers,
showcase concrete case studies (e.g., automorphisms, Burau representations,
growth and random groups), and outline open problems and datasets to
accelerate progress.

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

[DMANET] PhD position in Algorithms, TDA and Generative models for drug design at Edinburgh

We are looking for a PhD student to start in September 2026.

The topic is to reduce off-target effects for drug design with generative models. The idea will be to guide the generation process using the shapes of proteins and drugs.

The project will be good for students interested in
• Learning theory, statistics, algorithms
• Topological data analysis
• Generative models and ML

See more details at this page: here: https://homepages.inf.ed.ac.uk/rsarkar/positions/drugdesigncdt.html


Best wishes,

Rik




--

Rik Sarkar

Reader, School of Informatics
The University of Edinburgh
10 Crichton street, IF 3.45
Edinburgh EH8 9AB

rsarkar@inf.ed.ac.uk<mailto:rsarkar@inf.ed.ac.uk>
http://homepages.inf.ed.ac.uk/rsarkar/
The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.
**********************************************************
*
* 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/
*
**********************************************************

Monday, December 22, 2025

[DMANET] Call for Abstracts & Announcement – ASIACOMB 2026 (Daejeon, South Korea)

ASIACOMB 2026
*August 24–28, 2026*
Venue: Daejeon Convention Center, Daejeon, South Korea
Website: https://asiacomb.com/

ASIACOMB 2026 will mark the inaugural edition of the ASIACOMB conference
series. Planned as a biennial event held in Asia, the conference promotes
international collaboration by providing a high-level forum for the
exchange of ideas in combinatorics and connecting the Asian combinatorics
community with researchers worldwide.
*Plenary Speakers*
Anton Bernshteyn (UCLA)
Jie Han (Beijing Institute of Technology)
Mihyun Kang (Graz University of Technology)
Jaehoon Kim (KAIST)
Allen Knutson (Cornell University)
Bojan Mohar (Simon Fraser University)
Alexander Postnikov (Massachusetts Institute of Technology)
Van Vu (Yale University)
Joshua Zahl (Nankai University)

*Abstract submission** is now open. Deadline: March 22, 2026*
We invite submissions of abstracts presenting original research in all
areas of combinatorics, including (but not limited to): additive
combinatorics, algebraic combinatorics, design theory and finite geometry,
enumerative and analytic combinatorics, extremal and probabilistic
combinatorics, graph theory and hypergraph theory, connection of
combinatorics with other fields such as theoretical computer science,
analysis, or probability.

Please see our submission page: https://asiacomb.com/Abstract_submission/ for
more details.
Participation is not restricted to authors of submitted abstracts;
researchers are warmly welcome to attend the conference without presenting
a contributed talk.
Contact: asiacomb2026@ibs.re.kr
Homepage: https://asiacomb.com/
ASIACOMB 2026 is supported by the Institute for Basic Science (IBS) and the
Extremal Combinatorics and Probability Group (ECOPRO).

The registration of ASIACOMB 2026 will open in January 2026. We warmly
encourage members of the DMANET community to join ASIACOMB 2026, whether to
present recent work or simply to participate in the discussions and
interactions that define the ASIACOMB spirit.

Organizing Committee:
Hong Liu (IBS ECOPRO)
Felix C. Clemen (University of Victoria)
Zichao Dong (IBS ECOPRO)
Seonghyuk Im (KAIST & IBS ECOPRO)
Suyun Jiang (Jianghan University)
Zhou Wu (Universitat Politècnica de Catalunya)

**********************************************************
*
* 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] MIC 2026 call for papers

MIC 2026
16th Metaheuristics International Conference
Ischia Island (Napoli), Italy
8 – 11 June, 2026

www.mic2026.unina.it

Aims, Themes & Scope: As per tradition, looking at the previous editions of the MIC conferences, this conference focuses on the progress of the area of Metaheuristics and their applications and provides an opportunity to the international research community to discuss recent research results, to develop new ideas and collaborations, and to meet old friends and make new ones in relaxed atmosphere. MIC 2026 strives to propose a high-quality program that will be completed by a number of invited talks, tutorials, workshops and special sessions.

Solicited contributions can cover a variety of topics including but not limited to:
- Metaheuristic techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, memory-based optimization, dynamic local search, evolutionary algorithms, memetic algorithms, ant colony optimization, particle swarm optimization, scatter search, path relinking, etc.
- Techniques that enhance the usability and increase the potential of metaheuristic algorithms such as reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, parallelization of metaheuristic algorithms, etc.
- Empirical and theoretical research in metaheuristics including large-scale experimental analyses, algorithm comparisons, new experimental methodologies, engineering methodologies for metaheuristic algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms, etc.
- High-impact applications of metaheuristics in fields such as bioinformatics, electrical and mechanical engineering, telecommunications, sustainability, business, scheduling and timetabling. Particularly welcome are innovative applications
of metaheuristic algorithms that have a potential of pushing research frontiers.
- Contributions on the combination of metaheuristic techniques with those from other areas, such as integer programming, constraint programming, machine learning, etc.
- Contributions on the use of metaheuristic techniques in machine learning and deep learning for finetuning and neural architecture search, etc.
- Challenging applications areas such as continuous, mixed discrete-continuous, multi-objective, stochastic, or dynamic problems.

MIC 2026 accepts submissions in three different formats:
1. Regular paper: novel and original research contributions of a maximum of 15 pages (LNCS format)
2. Short paper: extended abstract of novel research works of 6 pages (LNCS format)
3. Oral presentation: high-quality manuscripts that have recently, within the last year, been submitted or accepted for journal publication.

All submitted papers will undergo a review process. All papers must be prepared using Lecture Notes in Computer Science (LNCS) template, and must be submitted in PDF using the easychair system (https://easychair.org/conferences?conf=mic2026).

Contact information:
Paola Festa (E-mail: infomic2026@unina.it, paola.festa@unina.it)
Dept. of Mathematics and Applications "R. Caccioppoli", University of Napoli "Federico II"
**********************************************************
*
* 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] Fully-Funded Research Fellowship MATS Summer 2026

My name is Eric and I work at MATS <https://www.matsprogram.org/>. We have
a Summer 2026 program for researchers interested in the field of AI safety
and alignment that is currently accepting applications, and we want to
share this with the researchers in the DMANET community.

Reducing risks from unaligned AI is an urgent, talent-constrained
challenge. We believe ambitious people from many backgrounds can
meaningfully contribute to this work. That's why we're training the next
generation of researchers in AI alignment, interpretability, security, and
governance.

As part of the fully-funded 12-week *MATS Summer 2026
<https://www.matsprogram.org/apply?utm_source=dmanet&utm_medium=mailing-list&utm_campaign=s26>*
program (June–August 2026), fellows receive:


- $15,000 stipend + $12,000 compute
- Office space in Berkeley or London (depending on mentor preference)
- Housing, meals, and travel covered
- Mentorship from world-class researchers and a dedicated research
manager
- A close-knit cohort, regular seminars and workshops, and an active
global alumni network
- The opportunity to continue for an additional 6-12 months with ongoing
funding and support (~75% of fellows historically do!)

MATS has accelerated 450+ researchers so far. Among alumni who graduated
before 2025, 80% are working directly in AI safety/security and 10% have
co-founded active AI safety startups. Participants have coauthored 150+
papers, with 7,800+ citations
<https://scholar.google.com/citations?user=VgJaUK4AAAAJ&hl=en>, and rate
our program 9.4/10. Our mentors include world-class researchers from
Anthropic, Google DeepMind, OpenAI, UK AISI, GovAI, Redwood, METR, Apollo
Research, Goodfire, RAND, AI Futures Project, and more.

Please forward this to anyone you know who'd be a good fit!

⏰ *Application deadline:* *January 18, 2026 AoE.* *Visit our website for
details.*
<https://www.matsprogram.org/apply?utm_source=dmanet&utm_medium=mailing-list&utm_campaign=s26>


Best,
Eric

--

Eric Dhan
Operations Generalist, MATS
LinkedIn <https://www.linkedin.com/in/eric-dhan/>

**********************************************************
*
* 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] CMSC 2026 – Call for Contributions

*(Apologies for cross-posting)*


Dear all,


We are pleased to invite you to submit your work to the 8th edition of the
international conference *Creative Mathematical Sciences Communication*,
which will be held in Padova, Italy, from October 12 to October 15, 2026.


The CMSC conference series, initiated in 2013, aims to explore new ways of
communicating the rich mathematical ideas fundamental to computer science.
There's a need and an appetite among mathematicians and computer scientists
for outreach and engagement at all levels. Bringing together researchers,
educators, and communicators, the conference aims to explore new approaches
to mathematical and computational thinking and lay the groundwork for
innovative teaching and research engagement methods at all educational
levels.


The organizers of CMSC believe that engaging in mathematical science goes
in two directions. Certain areas of research, such as algorithms and
combinatorics, are accessible even to elementary-age children, while
conversely, interaction with non-specialists, including young learners, can
spark new research questions. Creating opportunities for broad and
inclusive engagement in the mathematical sciences not only enriches the
researchers but also brings lasting benefits to society as a whole.


Therefore, we invite both researchers (working in areas such as
mathematics, computer science, engineering, and education in general) and
teachers (working at any level) to contribute and attend the conference.
Any participant who submits a contribution (i.e., a standard paper or a
poster) that passes the reviewing process will have the opportunity to
present their work during the conference. At the bottom, you'll find the
full Call for Contributions.


For now... SAVE THE DATE! If you would like to know more or have questions,
you can write to us at cmsc2026@dei.unipd.it or visit our website
https://cmsc2026.github.io for more details.


Looking forward to seeing you in Padova!


*CMSC 2026 Organizers*

Maarten Löffler, Utrecht University (program co-chair)

Alice Raffaele, University of Padova (organizing co-chair)

Francesco Silvestri, University of Padova (organizing and program chair)


*Program Committee*

TBA


*Steering Committee*

Frances Rosamond, University of Bergen, Norway (Chair)

Małgorzata Bednarska-Bzdęga, Adam Mickiewicz University Poznań, Poland

Tim Bell, University of Canterbury, New Zealand

Sarah Carruthers, Vancouver Island University, Canada

Valentina Dagiene, Vilnius University, Lithuania

Michael Fellows, University of Bergen, Norway

Valia Mitsou, IRIF, Paris Diderot University, France

Jam Ramanujam, The Institute of Mathematical Sciences, Chennai, India

Rüdiger Reischuk, University of Lübeck, Germany

Eljakim Schrijvers, Eljakim IT, Netherlands (International Chair)

Matt Skoss, The Australian Association of Mathematics Teachers, Australia

Verena Specht-Ronique, HLTM Marburg, Germany

Brett Stephenson, University of Tasmania, Australia


---------------------------------------------------------------------------

*CMSC 2026 – Call for Contributions*

Authors are invited to submit manuscripts on topics related to the
conference's scope (see below). All manuscripts will be peer-reviewed by
members of the Programme Committee.

More precisely, CMSC welcomes the following contributions:

- *Standard papers* from 3 to 12 pages; the papers should be in one of
the following categories:
- Research papers (e.g., empirical, qualitative, quantitative, theory
building, research methods, comparative studies, transferability
of methods
and results from other disciplines)
- Best practice papers/country reports/experience reports
- Description of creative products, for instance, a dance or song
performance
- Position/discussion papers
- *Poster proposals* up to 3 pages for:
- work in progress
- short description of published work

The page limitations include references. Papers may have an appendix, whose
length must not exceed 3 pages; reading of the appendix is at the
discretion of the reviewers. Accepted papers will be published in the
Springer Lecture Notes in Computer Science (LNCS) series. The submissions
should be formatted accordingly. Posters will not be published.

Work submitted to CMSC as standard papers should be novel and original.
Material that has been previously published can be presented as a poster,
or it can be submitted as a standard paper only if the work has been
significantly revised. Note, however, that while novel work is highly
valued, constructive replication of previous studies can also be a
significant contribution, and a new interpretation or evaluation of
previously published work can make a good contribution.

All inquiries about submissions should be sent to cmsc2026@dei.unipd.it.


*Conference Scope*

The main topics of the conference include, but are not limited to:

- Teaching Computer Science in early childhood, primary, secondary, and
higher education
- CS Unplugged
- Computational Thinking / Algorithmic Thinking
- Broadening engagement and diversity for the exact sciences
- Teacher education in Mathematics and Computer Science
- Teaching CS in relation to other subjects
- Linking mathematical and computational content for fundamental
competency development
- Contests and competitions
- Education for students with special needs
- Education within resource-limited environments
- Education in conflict-affected areas

*Accepted Contributions*

For all accepted contributions, we expect at least one author to attend the
conference and present the work. Given the creative nature of CMSC, you
will have a free choice of how to present your work, as long as it fits the
schedule and conference locations. We encourage authors to contact the
organizers before the submission for inquiries about special requirements
of the presentation. Possible formats include, but are not limited to:

- a traditional plenary conference talk
- a video showing a live performance
- an installation of limited size
- a test session for an educational activity (with other participants as
test subjects)

In addition, for a selected number of accepted papers, it would be possible
to present their work during the last day, at the Teachers' Day, to
teachers from primary/secondary schools. More details will be provided in
late Spring 2026.


*Submission Guidelines*

All contributions (papers and posters) must be submitted through the Microsoft
CMT platform <https://cmt3.research.microsoft.com/CMSC2026>, using LNCS
templates. More details will be posted soon. Submissions must be formatted
according to the Springer LNCS style guidelines using LaTeX. The maximum
length of the paper (including references, but excluding the optional
appendix) is 12 pages.


*Standard Paper Requirements*

All submissions must be formatted according to the Springer LNCS style
<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>
guidelines using LaTeX <https://www.latex-project.org/>.


*Poster Requirements*

To prepare a poster submission (up to 3 pages), authors are also asked to
use the same Springer LNCS style
<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>
and to use LaTeX <https://www.latex-project.org/>. The purpose of the
poster is to stimulate discussion with conference participants about your
presented activity during the conference. During the poster session, the
poster presenters should be present at their booth to give short
presentations to interested participants.

The final poster of an accepted poster submission should have the following
requirements:

- Size and orientation: A1 portrait (594 × 841 mm)
- Minimum information required: title, author(s), institution(s),
contact information, problem statement, description of work, gained
results, future work, and primary references. Please bring a printed poster
of the correct size to the conference.

*Submission Platform*

The Microsoft CMT service was used to manage the peer-review process for
this conference. This service was provided free of charge by Microsoft,
which covered all expenses, including costs for Azure cloud services, as
well as software development and support.

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

[DMANET] Workshop: Developments in algorithmic, discrete and tropical geometry

Dear colleague,

This is our second announcement for the workshop `Developments in algorithmic, discrete and tropical geometry' on the occasion of Michael Joswig's 60th birthday. It will take place from February 2 to February 4, 2026 at Freie Universität Berlin.

You may find further details on the webpage: https://mathconf.eu/adtg-2026/

To help us with planning, please register until January 03, 2026. Limited travel funds are available for young researchers. Of course there is a tight relation to the development of mathematical software, in partiuclar, polymake and OSCAR.

Best regards,
Georg Loho (FU Berlin and University of Twente)
Marta Panizzut (UiT, Norway)
Benjamin Schröter (KTH - Royal Institute of Technology, Stockholm)
**********************************************************
*
* 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/
*
**********************************************************

Sunday, December 21, 2025

[DMANET] Special Session "MLDL-HIC" at WCCI 2026 - Maastricht, Netherlands

Dear Colleague,

We are organizing a Special Session for the International Joint Conference
on Neural Networks (IJCNN 2026) entitled *"Advances in Machine Learning and
Deep Learning for Hyperspectral Image Classification,"* which is part of
the IEEE World Congress on Computational Intelligence (WCCI) 2026, to be
held in Maastricht, the Netherlands, June 21–26, 2026.

The objective of this special session is to bring together researchers and
practitioners in machine learning, deep learning, and remote sensing to
share novel computational approaches for hyperspectral image classification.

Topics of interest include, but are not limited to, the following:

· Remote Sensing Applications of Hyperspectral Imaging

· Hyperspectral Imaging for Advanced Remote Sensing Techniques

· Deep Learning Architectures for Hyperspectral Image Classification

· Transfer Learning for Hyperspectral Image Classification

· Unsupervised and Semi-Supervised Learning Methods

· Data Augmentation and Synthetic Data Generation for Hyperspectral
Data

· Multisource and Multimodal Data Fusion

· Explainability and Interpretability in Hyperspectral Image
Classification

· Advanced Feature Extraction Techniques

· Adversarial Attacks and Robustness in Hyperspectral Image
Classification

· Real-Time Hyperspectral Image Classification

· Applications of Hyperspectral Image Classification

· Benchmarking and Evaluation of Deep Learning Models

· Hybrid and Ensemble Models for Hyperspectral Classification

· Hyperparameter Tuning and Optimization Techniques

· Challenges and Future Directions in Hyperspectral Image
Classification

Details about the session can be found
here: https://sites.google.com/view/wcci2026/home

Information on papers submission can be found here:
https://attend.ieee.org/wcci-2026/information-for-authors/


All accepted papers will be included in the WCCI 2026 proceedings,
published on the IEEE Xplore Digital Library.

The deadline for the submission of papers is approaching: January 31, 2026,
23:59 AoE time (no extension will be given, see Important Dates
<https://attend.ieee.org/wcci-2026/important-dates-deadlines/>)

For any additional inquiries, please feel free to contact us.

Best regards,

Nian Ashlee Zhang, University of the District of Columbia, USA
Man-Fai Leung, Anglia Ruskin University, U.K.
Feng Xia, RMIT University, Australia
Donald C. Wunsch II, Missouri University of Science and Technology, USA

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

[DMANET] Call for Nominations: SoCG Test of Time Award 2026

SoCG Test of Time Award 2026
Call for Nominations

The SoCG Test of Time Award, instated six years ago, recognizes papers published in the Proceedings of the Annual Symposium on Computational Geometry (SoCG). An award will be given to a paper published at SoCG no later than 2006. More than one paper may be selected for the award.

Nomination Procedure
Anyone in the computational geometry community may nominate one or more papers by submitting the nomination via e-mail to socgtot@gmail.com with a subject line of SoCG Test of Time Award. The nomination should contain a brief explanation of the impact of the nominated paper(s). The deadline for submitting the nomination is February 15, 2026.

Selection
The winners are selected by a committee appointed by the SoCG steering committee. The committee for 2026 consists of Pankaj K. Agarwal (Duke University), Mark de Berg (TU Eindhoven), Siu-Wing Cheng (HKUST), and Yusu Wang (UCSD).

In selecting the Test of Time Award, the committee will pay particular attention to long term impact. This impact can come in many forms. Some possibilities are: (i) to open up a new area of research; (ii) to introduce new techniques; (iii) to solve a problem of lasting importance. The selection will be announced by March 15, 2026.

About the Award
This is the sixth SoCG Test of Time Award. The winners of the previous awards can be found at

https://computational-geometry.org/cg-week/awards/, or
https://computational-geometry.org/Awards/SoCG_Test_of_Time.html

The 2026 award winners will be presented at CG Week 2026, to be held in New Brunswick, USA, June 2-5, 2026.


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

[DMANET] FLOC 2026 Call for Papers

The Federated Logic Conference (FLoC) unites the ten leading international conferences focused on mathematical logic and its applications in computer science. Since 1996, FLoC is organized every four years and counts with over 2,000 attendees. FLoC 2026 will be held at the Institut Universitaire de Lisbonne (ISCTE) in Lisbon, Portugal, on July 20-23 & July 26-29 (Conferences), July 18-19 & July 24-25 (Workshops), July 13-17 (FoPSS Summer School).

FLoC 2026 welcomes original, high-quality contributions on all aspects of logic in computer science.

# Important Dates (AoE)

CAV - 38th International Conference on Computer Aided Verification
https://conferences.i-cav.org/2026/
Paper Submission: January 28, 2026
Author Response Period: March 30 - April 1, 2026
Author Notification: April 17, 2026
Conference Dates: July 26-29, 2026

CP - 32nd International Conference on Principles and Practice of Constraint Programming
https://cp2026.a4cp.org
Abstract Submission: February 28, 2026
Paper Submission: March 7, 2026
Author Response Period: March 9-12, 2026
Author Notification: April 30, 2026
Conference Dates: July 20-23, 2026

CSF - 39th IEEE Computer Security Foundations Symposium
https://csf2026.ieee-security.org
Paper Submission: January 29, 2026
Author Notification: April 1, 2026
Conference Dates: July 26-29, 2026

FSCD - 11th International Conference on Formal Structures for Computation and Deduction
https://fscd2026.github.io
Abstract Submission: January 23, 2026
Paper Submission: January 30, 2026
Author Response Period: March 23–27, 2026
Author Notification: April 16, 2026
Conference Dates: July 20-23, 2026

ICLP - 42nd International Conference on Logic Programming
https://www.semsys.aau.at/events/iclp2026/
Abstract Submission (Regular Papers): January 24, 2026
Paper Submission (Regular Papers): January 31, 2026
Author Notification (Regular Papers): March 5, 2026
Paper Submission (Short Papers): March 27, 2026
Revision Submission (Regular Papers): March 27, 2026
Final Author Notification: April 17, 2026
Conference Dates: July 20-23, 2026

IJCAR - 13th International Joint Conference on Automated Reasoning
https://www.floc26.org/ijcar
Abstract Submission: February 6, 2026
Paper Submission: February 13, 2026
Author Response Period: March 30-31, 2026
Author Notification: April 14, 2026
Conference Dates: July 26-29, 2026

ITP - 17th International Conference on Interactive Theorem Proving
https://itp-conference-2026.github.io
Abstract Submission: February 12, 2026
Paper Submission: February 19, 2026
Author Notification: April 26, 2026
Conference Dates: July 26-29, 2026

KR - 23rd International Conference on Principles of Knowledge Representation and Reasoning
https://kr.org/KR2026/
Abstract Submission: February 8, 2026 (Main Track)
Paper Submission: February 13, 2026 (Main Track)
Author Response Period: March 24-28, 2026 (Main Track)
Author Notification: April 13, 2026 (Main Track)
Conference Dates: July 20-23, 2026

LICS - 41st Annual ACM/IEEE Symposium on Logic in Computer Science
https://lics.siglog.org/lics26/
Abstract Submission: January 15, 2026
Paper Submission: January 22, 2026
Author Response Period: March 26–29, 2026
Author Notification: April 16, 2026
Conference Dates: July 20-23, 2026

SAT - 29th International Conference on Theory and Applications of Satisfiability Testing
https://satisfiability.org/SAT26/
Abstract Submission: February 20, 2026
Paper Submission: February 27, 2026
Author Response Period: April 13-17, 2026
Author Notification: April 30, 2026
Conference Dates: July 20-23, 2026

In addition to the conferences there will be 86 workshops (including Mentoring Workshop, Olympic Games, tutorials, and doctoral consortia)! Learn more and find submission details: https://www.floc26.org/
#FLoC2026
#LogicInCS #Lisbon

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

Saturday, December 20, 2025

[DMANET] Call for Nominations: 2026 Edsger W. Dijkstra Prize in Distributed Computing

** Apologies for multiple posting **

The 2026 Edsger W. Dijkstra Prize in Distributed Computing

http://www.podc.org/dijkstra/
http://www.disc-conference.org/wp/dijkstra-prize/

Nomination deadline: January 30, 2026

The Edsger W. Dijkstra Prize in Distributed Computing is named for
Edsger Wybe Dijkstra (1930-2002), a pioneer in the area of
distributed computing. His seminal works on concurrency primitives
(such as semaphores), concurrency problems (such as mutual
exclusion and deadlock), finding shortest paths in graphs,
fault-tolerance, and self-stabilization are important foundations
upon which the field of distributed computing is built.

The prize is given for outstanding papers on the principles of
distributed computing, whose significance and impact on the theory
and/or practice of distributed computing has been evident for at least
a decade. The Prize includes an award of $2000.

The Prize is sponsored jointly by the ACM Symposium on Principles
of Distributed Computing (PODC) and the EATCS Symposium on
Distributed Computing (DISC). This award is presented annually,
with the presentation taking place alternately at ACM PODC and
EATCS DISC. In 2026, it will be presented at PODC. The winners of
the award will share the cash award, and each winning author will
be presented with a plaque. An announcement of each year's prize
recipient(s) will be included in the PODC and DISC proceedings of
that year, describing the paper's lasting contributions.

Nominations and Eligibility:

Nominations by any member of the scientific community are eligible,
as long as the nominated work has had a significant impact on research
areas of interest within the theory of distributed computing
community, and as long as the year of the original publication is
at least ten years prior to the year in which the award is given.

Papers authored or co-authored by members of the Award Committee will
not be eligible for consideration. Members of the Award Committee can
nominate papers. However, they must carefully consider
nominations from within the community. Members of the Award Committee
will be especially sensitive to conflict-of-interest issues if
papers by former students or close colleagues are nominated.
(Members of the Award Committee cannot nominate such papers themselves.)
Self-nominations are not allowed.

The nomination must include a short paragraph (approximately 200 words)
summarizing the contribution of the nominated work. The nomination
may include additional material, for example, support letters, but its
total length should not exceed six pages.

Your nomination must be sent to the chair of the 2026 Award Committee,
Seth Gilbert (Dijkstra.Prize@gmail.com).

The nomination deadline is January 30, 2026.

Selection Process:

Although the Award Committee is encouraged to consult with the
distributed computing community at large, the Award Committee is
solely responsible for the selection of the winner of the award. The
prize may be shared by more than one paper. All matters relating to
the selection process that are not specified here are left to the
discretion of the Award Committee.

The list of past winners can be found at http://www.podc.org/dijkstra/
and http://www.disc-conference.org/wp/dijkstra-prize/

Award Committee for 2026:
James Aspnes, Yale University, USA
Keren Censor-Hillel, Technion, Israel
Cyril Gavoille, University of Bordeaux, France
Seth Gilbert, National University of Singapore
Andrzej Pelc, Universite du Quebec en Outaouais, Canada
Eric Ruppert, York University, Canada

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

[DMANET] PhD positions at School of Computer Science of Charles University, Prague

Several PhD positions in theoretical computer science and discrete mathematics
are available at the School of Computer Science of Charles University, Prague,
Czech Republic. Applications are invited from candidates who have a strong
background in computer science and/or mathematics and complete their MSc.
degree by summer 2026.

* Starting date: Fall 2026.
* Application deadline: February 15, 2026.

The School of Computer Science hosts active research groups in

* algorithms and complexity,
* discrete geometry and computational topology,
* graph theory,
* number theory and combinatorics,
* artificial inteligence,
* operations research, optimization, computational social choice,

as well as other areas of computer science and discrete mathematics. See

https://www.mff.cuni.cz/en/iuuk/people/phd-positions

for more information.

Funding:

For the usual duration of the study (4 years), the School guarantees a total
net income of at least 28,500 CZK/month to doctoral students; this is often
supplemented by additional grant funding. Funding from the second year on is
conditioned on the PhD candidate's good progress towards his/her degree based
on a yearly evaluation of doctoral students.

PhD students can take advantage of subsidized meals, discounted public
transport, the possibility of staying in student dormitories, and free "Czech
as foreign language" classes. The national health insurance scheme covers our
doctoral students.

Application:

The application should indicate the area of interest and contain:

* a short letter of motivation (research statement),
* a professional CV,
* a letter of recommendation,
* transcripts of all courses and grades,
* copies of academic certificates (Bc and MSc, if available),
* other optional materials, e.g., copies of English language certificates if
available, published papers, etc.

The application and a letter of recommendation should be sent electronically to
positions@iuuk.mff.cuni.cz. The referees can send their letters directly to the
indicated email. In both cases, make sure that the name of the applicant is
contained in the subject.

Inquiries can be directed to Zdenek Dvorak <rakdver@iuuk.mff.cuni.cz> (PhD
program board chair).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] AIces 2026: early registration December 30

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

1st INTERNATIONAL SCHOOL ON THE COGNITIVE, ETHICAL AND SOCIETAL DIMENSIONS OF ARTIFICIAL INTELLIGENCE

AIces 2026

Porto – Maia, Portugal

March 30 – April 2, 2026

https://aices.irdta.eu/2026/

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

Co-organized by:

University of Maia

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

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

Early registration: December 30, 2025

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

SCOPE:

AIces 2026 will be the first in a series of research training events aiming at updating participants on the most recent multidisciplinary discussions about the foundations, meaning, challenges and risks of AI.

The event will have a global scope along 3 thematic lines: cognition, ethics, and society. It will cover current debates about: AI and philosophy of mind; cognitive architectures; machine learning and cognitive development; large language models and visual information; robotics and embodied cognition; neuroscience-inspired AI; algorithmic bias and fairness; transparency and explainability; accountability and responsibility; privacy and surveillance; autonomy and control; AI impact on human values and social inequalities; the future of work and automation; governance, regulation and public policies; AI, human rights and democracy; AI and global development; information and AI education.

The event will consist of 10 courses, 2 keynote lectures, 3 symposia collecting short contributions from participants, and 3 open thematic debate sessions. 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.

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, AIces 2026 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:

AIces 2026 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:

2 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.

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.

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

KEYNOTE SPEAKERS:

David Danks (University of Virginia), Trustworthy AI in an Untrustworthy World

Ming Lin (University of Maryland), Socially Responsible and Trustworthy AI

PROFESSORS AND COURSES:

Ricardo Baeza-Yates (Barcelona Supercomputing Center), [introductory] Introduction to Responsible AI

Susan Brennan (Stony Brook University), [introductory/advanced] Where Are the Humans in Human-Centered AI?

Thomas Breuel (Nvidia Research), [introductory] Facts and Rules in LLMs

Carlos Castillo (Pompeu Fabra University), [introductory] Algorithmic Fairness in High-Risk AI Applications

Alan Dix (Cardiff Metropolitan University), [introductory] AI for Social Justice

Elia Formisano (Maastricht University), [introductory/intermediate] Auditory Cognition in Humans and Machines

Marijn Janssen (Delft University of Technology), [introductory/advanced] Data and AI Governance - From Control to Trust

Christian Lebiere (Carnegie Mellon University), [intermediate] Computational Cognitive Models of Human-AI Teaming

Paul Smolensky (Johns Hopkins University), [intermediate/advanced] Symbol Processing in Transformers and Other Neural Networks

Savannah Thais (City University of New York), [intermediate/advanced] Measurement for Safer AI

SYMPOSIA:

A symposium will collect 10-minute voluntary presentations on any of the 3 thematic areas of the event: cognition, ethics, and society.

A 1-page abstract containing the title, authors, and summary of the presentation must be sent to david@irdta.eu by February 28, 2026.

Only registered participants can contribute to symposia.

OPEN DEBATES:

Open debate sessions will be organized for each of the 3 thematic areas of the school: cognition, ethics, and society.

A 2-page expression of interest to lead the respective session including the topics to be debated, the structure, call for contributions, and dynamics of the session must be sent to david@irdta.eu by December 30, 2025.

Only registered participants are eligible for leading a debate session.

SPONSORS:

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

https://aices.irdta.eu/2026/sponsors/

ORGANIZING COMMITTEE:

Samuel Anjos (Maia, social networks)
José Paulo Marques dos Santos (Maia, local chair)
Carlos Martín-Vide (Tarragona, program chair)
Santiago Montes (Tarragona, webpage)
Sara Morales (Luxembourg)
José Luís Reis (Maia)
Luís Paulo Reis (Porto)
David Silva (London, organization chair)

REGISTRATION:

It has to be done at

https://aices.irdta.eu/2026/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://aices.irdta.eu/2026/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, Luxembourg/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] CfA - Session "Discrete, continuous and hybrid stochastic optimal control in OR" - IFORS 2026 Vienna

Session "Discrete, continuous and hybrid stochastic optimal control in OR"

Call for Abstracts


Dear colleagues,

Warmly welcome to the

The 24th Conference of the International Federation of Operational Research Societies:
"Decision Support for a Sustainable World"
12 - 17 July 2026, Vienna, Austria

(IFORS 24 Vienna 2026; https://www.ifors2026.at/home/ ).


One of the various sessions in the stream "Combinatorial Optimization" (Stream Organizers: Prof. Dr. Silvano Martello and Prof. Dr. Paolo Toth) will be:

Discrete, continuous and hybrid stochastic optimal control in OR

Session Organizer: Prof. Dr. Gerhard-Wilhelm Weber (gerhard-wilhelm.weber@put.poznan.pl)

Code 680afa60


Submission deadline for abstracts is 15 March 2026.


The link to the Abstract Submission System is

https://www.euro-online.org/conf/ifors2026/ .

You may submit an abstract to this session using the Code 680afa60 and then inserting your abstract (max. 600 characters).


Key dates and Deadlines

March 15, 2026
Deadline for abstract submissions

April 25, 2026
Early bird registration deadline

May 1, 2026
Final registration deadline for authors


Looking forward to meeting you at IFORS 2026 in beautiful Vienna !


**********************************************************
*
* 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, December 19, 2025

[DMANET] Workshop Announcement: Positivity, Convexity and Computation in Rigidity Theory 2026

We want to draw your attention to the workshop

"Positivity, Convexity and Computation in Rigidity Theory
<http://www.iaa.tu-bs.de/AppliedAlgebra/workshop_rigidity_2026/index.html>",

which will take place on

February 26 – 27, 2026,

at the Technische Universität Braunschweig in Germany. In addition, we plan
a reception with a poster session in the evening on the 25th of February.
In order to register, please send an email to
rigidity_workshop2026@tu-braunschweig.de.

With this workshop we bring together researchers interested in geometric
rigidity theory with experts on positivity, convexity, symmetry and
computational methods. We plan to have plenty time for discussions, and we
hope that this exchange encourages the development of new approaches and
strategies for tackling geometric problems in rigidity theory.

List of keynote speakers:

- Matteo Gallet
<https://dmg.units.it/en/research/researchareas/researchfocus/10974/>(Università
degli Studi di Trieste)
- Hana Dal Poz Kouřimská
<https://sites.google.com/view/hanakourimska/home>(Universität Potsdam)
- Wai Yeung Lam <https://sites.google.com/view/waiyeunglam/>(Université
du Luxembourg)
- Fatemeh Mohammadi <https://www.fatemehmohammadi.com/> (KU Leuven)
- Cordian Riener <https://www.cordian.de/>(Arctic University of Norway,
Tromsø)
- Daniel Robertz
<https://www.math.rwth-aachen.de/~Daniel.Robertz/index_en.html>(RWTH
Aachen)
- Mohab Safey El Din <https://safey.perso.lip6.fr/>(Sorbonne Université)
- Louis Theran <https://theran.lt/>(University of St Andrews)

You can find further information on the workshop website

http://www.iaa.tu-bs.de/AppliedAlgebra/workshop_rigidity_2026/index.html.

The workshop is part of the German priority program "Combinatorial Synergies
<https://combinatorial-synergies.de/>" funded by the DFG (German Research
Foundation). The Combinatorial Synergies program contains dozens of PIs
from the Applied Algebra and Geometry community in Germany. In general,
priority programs are large scale research endeavors funded over a period
of six years.

We are looking forward to seeing you in Braunschweig!
Best wishes, the organizers
Matthias Himmelmann, TU Braunschweig
Martin Winter, TU Berlin / MPI Leipzig
Timo de Wolff, TU Braunschweig

**********************************************************
*
* 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] The 35th International Conference on Computer, Communication and Networks (ICCCN 2026), July 27 - 30, 2026, Honolulu, Hawaii, USA

** Please accept our apologies if you receive multiple copies of this CFP
***
CALL FOR PAPERS (ICCCN 2026)

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

The 35th International Conference on Computer Communications and Networks
(ICCCN 2026)
July 27 - 30, 2026, Honolulu, Hawaii USA
http://www.icccn.org/icccn26/
****************************************************************************************

ICCCN 2026 is Technically Co-Sponsored by the IEEE and IEEE Communication
Society.

Paper Submission link: https://easychair.org/conferences/?conf=icccn2026 (for
all Conference, Workshop, and Poster papers). The paper submission site is
open now.

ICCCN is one of the leading international conferences for presenting novel
ideas and fundamental advances in the fields of computer communications and
networks. ICCCN serves to foster communication among researchers and
practitioners with a common interest in improving computer communications
and networking through scientific and technological innovation.

Scope:

The primary focus of the ICCCN 2026 conference is on new and original
research results in the areas of design, implementation, and applications
of computer communications and networks. ICCCN 2026 covers the following
technical Tracks (the detailed Track scope and descriptions are posted at

http://www.icccn.org/icccn26/committeesandtracks/technical-tracks/index.html
):

Track 1: Infrastructure Networking Technologies

· Dimitrios Pezaros, University of Glasgow, UK

· Ananthram Swami, DEVCOM Army Research Laboratory

· Feng Wang, Arizona State University

Track 2: Network Architecture, Algorithm, Protocol, and Evaluation

· Berk Canberk, Edinburgh Napier University, United Kingdom

· Kanchana Thilakarathna, University of Sydney

· Murat Yuksel, University of Central Florida

Track 3: IoT and Cyber-Physical Systems

· Fatemeh Afghah, Clemson University, USA

· Chiu Tan, Temple University

· Lei Xie, Nanjing University, China

Track 4: Edge and Cloud Computing

· Oliver Bringmann, Eberhard Karls Universität Tübingen, Germany

· Virginia Pilloni, University of Cagliari, Italy

· Yifan Zhang, Binghamton University

Track 5: Mobile/Pervasive Communications, Networking and Sensing

· Hao Han, Nanjing University of Aeronautics and Astronautics, China

· Tamer Nadeem, Virginia Commonwealth University

· Wei Wang, San Diego State University, USA

Track 6: Social Networks, Extended Reality, and Metaverse

· Bin Li, Penn State University, USA

· Yao Liu, Rutgers University

· Muhammad Shahzad, North Carolina State University

Track 7: AI/ML for Networks & Networks for AI/ML

· Ahmed Alkhateeb, Arizona State University

· Longfei Shangguan, University of Pittsburgh

· Cheng Zhang, Texas A&M University

· Yanfu Zhang, William & Mary

Track 8: Security, Privacy, and Trust

· Xinwen Fu, University of Massachusetts at Lowell

· Isabel Wagner, University of Basel, Switzerland

· Shucheng Yu, Yeshiva University, USA

· Chuan Yue, Colorado School of Mines

Track 9: Emerging Topics in Networking (e.g., Quantum Networking,
Distributed Quantum Computing, Distributed Machine Learning)

· Trung Q. Duong, Memorial University, Canada

· Nirmalaya Roy, UMBC, USA

· Jindi Wu, DePaul University, USA

Instructions for Authors:

Submitted manuscripts must be formatted in standard IEEE camera-ready
format (double-column, 10-pt font) and must be submitted via EasyChair (
https://easychair.org/conferences/?conf=icccn2026; this site will accept
paper submissions soon in due time) as PDF files (formatted for 8.5×11-inch
paper). The manuscripts should be no longer than 9 pages including all
figures/tables and references. Submitted papers should not be previously
published in or be under consideration for publication in another
conference or journal. Paper titles and/or author names cannot be changed
and/or added to the papers after the submission deadline or in the
camera-ready version if accepted. The Program Committee reserves the right
to not review papers that either exceed the length specification or have
been submitted or published elsewhere. Submissions must include a title,
abstract, keywords, author(s) and affiliation(s) with postal and e-mail
addresses. Note: ICCCN'26 will select Best Paper and a runner-up paper to
recognize the research quality and excellence. The Program Committee
reserves the right to recommend some borderline conference papers to be
accepted as short papers in the conference (the short papers should be no
longer than 6 pages including all figures/tables and references).

Review and Publication of Manuscripts:

Submitted papers will be reviewed by the TPC and judged on originality,
technical correctness, relevance, and quality of presentation (the review
process is single-blind). An accepted paper must be presented at the
conference venue by a registered author at the full registration rate. Each
full registration covers up to two conference papers authored by the
registered author. If the originally registered author is unable to attend
the conference due to extenuating circumstances, he/she must explicitly ask
for the transfer of registration to one of the other authors of the paper.
Please note that an author's registration cannot be transferred to a nonauthor
presenter under any circumstances. Accepted and presented (onsite) papers
will be published in the conference proceedings and IEEE Xplore.

Workshops:
ICCCN 2026 workshops are exciting forums to present, discuss, and formulate
specialize topics and emerging hot research topics (new areas, new problems
or new methods). The workshops offer a perspective distinct from and
complementary to the research themes of the main conference. Workshop
papers should be no longer than 6 pages including all figures/tables and
references. The detailed info can be found in each workshop's Call for
Papers from
http://www.icccn.org/icccn26/workshop/list-of-workshops/index.html. For any
questions or additional information, please contact the Workshop General or
Workshop Program Chairs.

Poster Papers:

ICCCN 2026 provides an opportunity to present in-progress work in the
fields of computer communications and networks. Topics of interest are the
same as the research topics in the ICCCN 2026 main conference Call for
Papers. Early implementations, prototypes, work-in-progress
systems/applications as well as commercial products that are related to the
topics are welcome. Presenting a poster is an effective way to obtain early
and valuable feedback from a knowledgeable crowd at the conference. Posters
must be formatted in standard IEEE camera-ready format (double-column,
10-pt font). Each poster submission must be no longer than 2 pages
including all figures/tables and references.

Important Dates: All times below are 11:59 pm (Honolulu, Hawaii USA);

Conference and Poster papers:

· Paper submission due: February 13, 2026

· Poster Paper submission due: March 29, 2026

· Acceptance Notification: April 24, 2026

· Conference date: July 27 -30, 2026

Workshop papers:

· Paper submission due: March 1, 2026

· Acceptance Notification: April 29, 2026

· Workshop date: July 29 - 30, 2026

All (conference/poster/workshops) Camera-Ready Papers Due: May 11, 2026
(Hard deadline)

Please refer to "Author Information" posted at the conference website for
more info on paper submission, presentation and related rules/policies.

Executive Chair: Krishna Kant, Temple University, USA (kkant@temple.edu)
General Chair: Ruidong Li, Kanazawa University, Japan (liruidong@ieee.org)
TPC Co-Chairs:
Qun Li, William & Mary, USA (liqun@cs.wm.edu)

Danda Rawat, Howard University, USA (danda.rawat@howard.edu)
Workshops General Chair:
Kewei Sha, University of North Texas, USA (comersha@gmail.com)
Poster Chair:

Wenjia Li, New York Institute of Technology, USA (wli20@nyit.edu)
Local Arrangement Chair:

Prof. Yi Zhu, Hawai'i Pacific University, USA (yzhu@hpu.edu)

Publications Co-Chairs:
Wei Tong, Nanjing University,China (wtong@nju.edu.cn)

Zhengrui Qin, Northwest Missouri State University, USA (zqin@nwmissouri.edu)
Publicity Co-Chairs:
(America) Mostafa Fouda, Idaho State University, ID, USA (mfouda@ieee.org)
(Europe) Zhengxin Yu, Lancaster University, U.K. (z.yu8@lancaster.ac.uk)
(Asia) Qiao Xiang, Xiamen University, China (qiaoxiang@xmu.edu.cn)
(Oceania) Wei Xiang, La Trobe University, Australia (W.Xiang@latrobe.edu.au)

Publicity Chair for Workshops:
Zongxin Xie from Kennesaw State University, USA (zxie1@kennesaw.edu)

**********************************************************
*
* 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] Submission Deadline: January 18, 2026 – The 4th International Workshop on TwinNetApp in conjunction with IEEE ICC 2026 | Glasgow, Scotland, UK

We apologize if you receive multiple copies of this CFPs.

We appreciate your help to contribute & forward this CFPs to your friends.

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


Call for Papers


The Fourth International Workshop on Data Driven and AI-Enabled

Digital Twin Networks and Applications (TwinNetApp)


in conjunction with IEEE ICC 2026


May 24-28, 2026 – Glasgow, Scotland, UK

Workshop Website: https://icc26-twinnetapp.bcrg.uk/

Conference Website: https://icc2026.ieee-icc.org/

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

Digital Twin (DT) technology has emerged as a critical enabler for
next-generation communication networks. Regarding this, DTs provide
real-time synchronization between physical and digital systems and support
advanced monitoring, emulation, and optimization capabilities. By bridging
the physical and virtual domains, DTs provide novel approaches to design,
analyze, and operate complex infrastructures that go far beyond traditional
simulation methods. Real-time network monitoring, predictive modelling,
proactive management, and what-if simulation are significant examples that
highlight DT's potential in the communication domain and beyond. When
combined with next-generation mobile communications (5G/6G), Artificial
Intelligence (AI), Generative AI (GenAI), Internet of Things (IoT),
Transfer Learning (TL), Augmented Reality (AR), Virtual Reality (VR),
Edge/Fog Computing, federated architectures, and microservice-based
platforms, DT becomes a foundation to guarantee latency-sensitive,
energy-efficient, and secure services. These synergies create opportunities
for sustainable and scalable solutions in diverse sectors, from smart
cities and agriculture to healthcare, manufacturing, and autonomous
systems. This workshop invites original contributions that address all
aspects of DT networks, systems, and applications, including theoretical
models, system architectures, optimization methods, security mechanisms,
and real-world testbeds. By bringing together academia, industry, and
standardization bodies, the workshop aims to establish a cross-disciplinary
forum to explore the transformative role of DT in shaping sustainable,
intelligent, and connected communication infrastructures. 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
- Quantum-enabled DT networks
- DT-assisted AI applications for smart cities
- Communication 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 DT networking systems for environmental sensing
- DT for precision agriculture, and industry 4.0 applications
- Real-world DT simulations, prototypes, and testbed demonstrations


General Chairs

- Kubra Duran, Edinburgh Napier University, UK (K.Duran@napier.ac.uk)
(IEEE Member)
- Berk Canberk, Edinburgh Napier University, UK (B.Canberk@napier.ac.uk)
(IEEE Senior Member)
- Octavia Dobre, Memorial University, Canada (odobre@mun.ca) (IEEE
Fellow)


Important Dates

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

Paper Submission Deadline: January 18, 2026

Notification of Acceptance: March 8, 2026

Camera Ready: March 22, 2026


Submission

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

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.

Submission Link: TBA


--
Kind regards,
Lal Verda Cakir

PhD Candidate
Edinburgh Napier University, UK

**********************************************************
*
* 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] One PhD position in Computational Social Choice at TU Wien

Dear all,

I'm offering one PhD position at TU Wien, Vienna, Austria, to work on my
WWTF research project titled

"Structural and Algorithmic Aspects of Preference-based Problems in
Social Choice"

https://www.wwtf.at/funding/programmes/vrg/VRG18-012/index.php?lang=EN

The research topics include voting, structured preferences, stable
matching (matchings under preferences), resource allocation, with a
focus on parameterized and approximation algorithm design.

The position is available immediately. Applicants with a solid
background in areas such as algorithm design (including but not limited
to parameterized algorithms and approximation algorithms), computational
complexity, and/or discrete mathematics are welcome to apply.

Please send your application in a single PDF file, including
(1) your academic CV,
(2) a reference letter from your supervisor,
(3) a motivation letter, including an explanation of your research
interests,
(4) your Master's thesis and
(5) a list of subjects studied, giving sufficient details and
grades/marks obtained

directly to

jiehua.chen@ac.tuwien.ac.at

by *January 30th, 2026*.

For informal inquiries please contact me (jiehua.chen@ac.tuwien.ac.at).

Thanks!

Jiehua Chen

--
Jiehua Chen
jiehua.chen@tuwien.ac.at
https://www.ac.tuwien.ac.at/jchen/about/

Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9-11, E192-01, Stiege 2, 4. Stock
A-1040 Wien
Austria

**********************************************************
*
* 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] Announcement -13th DIMACS Implementation Challenge: Network Flows 2.0

***************************************************************
13th DIMACS Implementation Challenge: Network Flows 2.0

Date: January 21-22, 2027 (tentative)
Location: Lehigh University, Bethlehem, PA, USA

Organizers:
Andrew V. Goldberg, Lehigh University
Tamra Carpenter, DIMACS
Loukas Georgiadis, University of Ioannina
Giuseppe Italiano, Luiss University
Daniel Spielman, Yale University
Clifford Stein, Columbia University
David P. Williamson, Cornell University

Presented in association with the DIMACS Implementation Challenges<http://dimacs.rutgers.edu/archive/Challenges/>.

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

Announcement:

[cid:image002.png@01DC70CB.525841E0]The First DIMACS Challenge, devoted to network flows, took place in 1990-1991. The Challenge was a big success and started the tradition of DIMACS Challenges. The First Challenge greatly reduced the gap between theory and practice and raised standards for experimental work in the area. During the decades since the Challenge, network flow algorithms evolved, and new applications of network flows emerged. Many original benchmark instances are too easy for the improved implementations. Theoretical progress has been especially impressive, leading to near-linear algorithms for the minimum-cost flow problem and its special cases. Once again, experimental work is falling behind. The need for updated benchmarks and new algorithm implementations motivates the Network Flows 2.0 Challenge.

The Challenge Workshop will take place at the end of January at Lehigh University<https://www2.lehigh.edu/about/bethlehem-lehigh-valley> campus in Bethlehem, PA, USA. The tentative date for the workshop is January 21-22, 2027. This is just before the 2027 SODA and ALENEX conferences<https://www.siam.org/conferences-events/siam-conferences/alenex27/>. These conferences will be in Philadelphia, PA, about 70 miles from Bethlehem.

The goals for the challenge are:

* Update benchmarks for network flow problems to account for improved algorithm performance and to include instances from real-life applications.
* Motivate implementations and experimental evaluation of new algorithms.
* Compare old and new algorithm implementations on improved benchmarks.

Tracks and core benchmarks

* Benchmark track: The first track of the Challenge will produce benchmark instances and instance generators. We will provide links to existing benchmarks and encourage the submission of new ones, both real-life and synthetic. Submitted instances will be visible to participants immediately. Instances submitted by April 15, 2026, will be considered for the core benchmark set. The organizers will compile a set of core benchmarks. In addition, we may accept some papers on "interesting" benchmarks and generators, which give new insight into algorithm performance, for presentation in the workshop.
* Implementation track: The second track of the challenge will be devoted to new flow algorithm implementations. This track will start at the same time as the first track. The participants can use existing test instances, instances submitted by the benchmark track participants, or produce their own instances (which they can also contribute).
* Core benchmarks: All participants of the implementation track will be required to use the core benchmarks for the problem they are working on. Exceptions will be made only if special aspects of an implementation make it unreasonable (e.g., an implementation is aimed at a specific application). The participants are encouraged to use other benchmarks that they find useful. This will also help to identify benchmarks for future research, which will be one of the outcomes of the Challenge.

Important Dates:


Instance submission for core benchmarks: April 15, 2026

Workshop paper submission (tentative): September 15, 2026
Acceptance notification: October 15, 2026
Final paper due: December 15, 2026
Challenge workshop (tentative): January 21- 22, 2027

For further information:

* View the attached 13th DIMACS Implementation Challenge: Network Flows 2.0 Flyer
* Visit the Challenge website: https://coral.ise.lehigh.edu/flow-challenge-2-0/
* Email the organizers: flowchallenge20@googlegroups.com<mailto:flowchallenge20@googlegroups.com>

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

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

[DMANET] FICO Xpress Best Paper Award 2026

Dear colleagues,

We invite you to nominate or self-nominate papers for the Xpress Best Paper Award 2026.
The nomination deadline is January 31, 2026, 23:59 AoE.
The Xpress Best Paper Award acknowledges outstanding papers in the named areas in which the usage of FICO Xpress Optimization products played a significant role.
Papers published in the two years between January 1, 2024, and December 31, 2025, will qualify for the fourth edition awarded in 2026.
The award includes a $1,500 cash prize.

Detailed information can be found at this blog https://community.fico.com/s/blog-post/a5Q4w000000403KEAQ/fico4407 or the award homepage https://www.i2damo.de/de/xpress-best-paper-award .
Also, see these blogs about the winners of the past three years:
- https://community.fico.com/s/blog-post/a5QQi0000067HNFMA2/fico6140
- https://community.fico.com/s/blog-post/a5QQi000002rzAfMAI/fico5205
- https://community.fico.com/s/blog-post/a5Q4w000001UfWLEA0/fico4101
Please feel free to contact me with any questions.

Best regards and happy holidays,
Timo Berthold, on behalf of the award committee

PD Dr. Timo Berthold * Software Engineering - Director * FICO
Fair Isaac Deutschland GmbH
Takustr. 7, 14195 Berlin, Germany
www.fico.com<http://www.fico.com/>

[A close up of a sign Description automatically generated]


Register Court (Registergericht): Amtsgericht Darmstadt, HRB 105180
Managing Director (Geschäftsführer): Dean Sanderson

This email and any files transmitted with it are confidential, proprietary and intended solely for the individual or entity to whom they are addressed. If you have received this email in error please delete it immediately.


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

[DMANET] Two PhD positions in Foundations of Machine Learning on Graphs

Two PhD positions in Foundations of Machine Learning on Graphs

Two full-time PhD positions are available within the Discrete Mathematics and Mathematical Programming (DMMP) group at the University of Twente (NL).

The four-year positions are part of the LOGSMS project ("Learning on Graphs: Symmetry Meets Structure"), funded by the NWO VIDI grant of Dr. Gaurav Rattan.

The field of Machine Learning on Graphs seeks to extract knowledge from graph-structured and network data through machine learning models. LOGSMS will combine diverse tools from discrete mathematics, learning theory and machine learning, thus facilitating the design and analysis of provably powerful graph learning models.

We are primarily looking for candidates with a strong background in discrete mathematics, graph theory and graph algorithms. Prior experience in machine learning is highly appreciated, but not obligatory.

Further details about the individual positions, such as relevant prior experience and work profile description, are available at the following website:

https://gaurav-rattan.github.io/LOGSMS/

The website also contains the link to the formal application portal of UT. Please apply before 16 January 2026 to receive full consideration.

For informal enquiries, you are welcome to contact Dr. Gaurav Rattan at the following email address: g.rattan@utwente.nl

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

[DMANET] [Cryptography] (IF 2.1, CiteScore 5.0) Selected Papers in Volume 9, Issue 3

We are sharing with you some selected papers published in the open access
journal /Cryptography/ (https://www.mdpi.com/journal/cryptography)
Volume 9, Issue 3, which are free to access and can be downloaded here:

1. Multi-Line Prefetch Covert Channel with Huge Pages
https://www.mdpi.com/2410-387X/9/3/51

2. Efficient Secure Multi-Party Computation for Multi-Dimensional
Arithmetics and Its Applications
https://www.mdpi.com/2410-387X/9/3/50

3. Composable Privacy-Preserving Framework for Stakes-Based Online
Peer-to-Peer Applications
https://www.mdpi.com/2410-387X/9/3/48

4. The Eye-Opening Arbiter-PUF FPGA Implementation with Auto Error
Detection
https://www.mdpi.com/2410-387X/9/3/47

5. Universally Composable Traceable Ring Signature with Verifiable
Random Function in Logarithmic Size
https://www.mdpi.com/2410-387X/9/3/59

6. Enhancing the Multikey GSW Scheme with CRT Decomposition and
Ciphertext Compression for Efficient Distributed Decryption
https://www.mdpi.com/2410-387X/9/3/55

See this full volume via https://www.mdpi.com/2410-387X/9.

Additionally, we welcome your submissions if you have relevant papers to
be submitted. Please contact the journal editorial office
cryptography@mdpi.com.

Best regards,
Xue Cheng
Managing Editor
--
MDPI Branch Office, Wuhan
Cryptography Editorial Office
https://www.mdpi.com/journal/cryptography
MDPI, Grosspeteranlage 5, 4052 Basel, Switzerland

Twitter: @Cryptogr_MDPI https://twitter.com/Cryptogr_MDPI
LinkedIn: Cryptography-MDPI
**********************************************************
*
* 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, December 18, 2025

[DMANET] PhD student position in the Algorithms and Complexity group at University of Cologne

The Algorithms and Complexity research group led by Christian Sohler
in the Computer Science Division
at University of Cologne invites applications for a research fellow
position for candidates working
on areas of algorithms and data structures. The successful applicant
will work towards a
doctorate as part of the position.

YOUR TASKS
» organize practical training for courses, teaching support,
conducting courses (totaling 4 SWS)
» contribute to the general research conducted in the working group
» present and publish research results at conferences and in journals
» provide assistance with scientific self-administration


YOUR PROFILE
» Degree in computer science, mathematics, or a closely related
subject with excellent grades
» extensive knowledge in the field of development and theoretical
analysis of algorithms and data structures, as demonstrated by
corresponding grades or scientific publications
» very good oral and written communication skills in English
» desirable: very good German language skills
» desirable: proficiency in C/C++ or Python

The University of Cologne promotes equal opportunities and diversity.
Women will be considered preferentially in accordance with the Equal
Opportunities Act of North Rhine-Westphalia
(Landesgleichstellungsgesetz – LGG NRW). We also expressly welcome
applications from all suitable candidates regardless of their gender,
nationality, ethnic and social origin, religion, disability, age,
sexual orientation and identity.
The position is available from 1 April 2026 on a full-time basis
(39,83 hours per week). The position is to be filled for a fixed term
until 31 March 2028. If the applicant meets the relevant wage
requirements and personal qualifications, the salary is based on
remuneration group 13 TV-L of the pay scale for the German public
sector.
Please submit your application (without a photo), including proof of
the required qualifications, online under:
https://jobportal.uni-koeln.de. The reference number is Wiss2512-17.
The application deadline is 21 January 2026.

**********************************************************
*
* 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] Second Announcement: PhD positions in Theoretical Computer Science

The Algorithm, Graph, and Geometry Laboratory at Carleton University
<https://carleton.ca/scs/> in Canada is seeking strong applications for
funded PhD positions in Theoretical Computer Science. The successful
candidate will pursue research in computational geometry, algorithms, and
graph theory.

For more information and application details, please visit https://cglab.ca/
.

For further inquiries, please contact bobby.miraftab@gmail.com

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