Thursday, January 12, 2023

[DMANET] 2 PH.D. and 1 POSTDOC POSITIONS AT IDSIA, USI-SUPSI (Switzerland)

The Algorithms and Complexity Group at IDSIA (www.idsia.ch, www.usi.ch) Lugano (Switzerland), opens 2 Ph.D. positions (4 years) and 1 Postdoc position (up to 4 years).

These positions are supported by the Swiss National Science Foundation project "Computational methods for integrality gaps analysis".
For more information visit: https://people.idsia.ch/~monaldo/positions/positions.html

There is no specific deadline; the positions will be filled as soon as eligible candidates with an appropriate background apply.

For applying and/or information please contact:
Prof. Monaldo Mastrolilli
Email: monaldo.mastrolilli@idsia.ch

Prof. Luca Gambardella
luca.gambardella@usi.ch


**********************************************************
*
* 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] LAST CALL for the IET Image Processing special issue on "Advancements in Fine Art Pattern Extraction and Recognition" (deadline 31 January 2023)

__apologies for multiple posting, please distribute among interested
parties__

Call for Papers

*Special Issue of IET Image Processing on Advancements in Fine Art
Pattern Extraction and Recognition*

___________
Aim & Scope

Cultural heritage, especially fine arts, plays an invaluable role in the
cultural, historical and economic growth of our societies. Fine arts are
primarily developed for aesthetic purposes and are mainly expressed
through painting, sculpture and architecture. In recent years, thanks to
technological improvements and drastic cost reductions, a large-scale
digitization effort has been made, which has led to an increasing
availability of large digitized fine art collections. This availability,
coupled with recent advances in pattern recognition and computer vision,
has disclosed new opportunities, especially for researchers in these
fields, to assist the art community with automatic tools to further
analyze and understand fine arts. Among other benefits, a deeper
understanding of fine arts has the potential to make them more
accessible to a wider population, both in terms of fruition and
creation, thus supporting the spread of culture.

This special issue aims to offer the opportunity to present advancements
in the state-of-the-art, innovative research, ongoing projects, and
academic and industrial reports on the application of visual pattern
extraction and recognition for a better understanding and fruition of
fine arts, soliciting contributions from pattern recognition, computer
vision, artificial intelligence and image processing research areas. The
special issue will be linked to the 2nd International Workshop on Fine
Art Pattern Extraction and Recognition (FAPER2022). Authors of selected
conference papers will be invited to extend and improve their
contributions for this special issue, and authors are also invited to
submit new contributions (non-conference papers).

_______________________________________
Topics include, but are not limited to:
- Applications of machine learning and deep learning to cultural
heritage and digital humanities
- Computer vision and multimedia data processing for fine arts
- Generative adversarial networks for artistic data
- Augmented and virtual reality for cultural heritage
- 3D reconstruction of historical artifacts
- Point cloud segmentation and classification for cultural heritage
- Historical document analysis
- Content-based retrieval in visual art domain
- Digitally enriched museum visits
- Smart interactive experiences in cultural sites
- Project, products or prototypes for cultural heritage

_______________________________________________
Submission Deadline (extended): 31 January 2023

Submissions must be made through ScholarOne:
https://mc.manuscriptcentral.com/theiet-ipr

see the PDF call for paper for more information:
https://ietresearch.onlinelibrary.wiley.com/pb-assets/assets/17519667/Special%20Issues/IPR%20SI%20CFP_AFAPER-1651107571727.pdf

___________
Open Access

From January 2021, The IET began an Open Access publishing partnership
with Wiley. As a result, all submissions that are accepted for this
Special Issue will be published under the Gold Open Access Model and
subject to the Article Processing Charge (APC) of $2,300.

*APC can be covered in FULL, i.e. FREE OF CHARGE*, or part by your
institution
*CHECK  YOUR  ELIGIBILITY  HERE*
https://authorservices.wiley.com/author-resources/Journal-Authors/open-access/affiliation-policies-payments/institutional-funder-payments.html

_______________
Editor-in-Chief

Prof. Farzin Deravi, University of Kent, UK

_____________
Guest Editors

Giovanna Castellano, Universita' di Bari, Italy
Gennaro Vessio, Universita' di Bari, Italy
Fabio Bellavia, Universita' di Palermo, Italy
Sinem Aslan, Università Ca' Forscari Venezia, Italy


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

Postdoc Position in Randomized Algorithms

The Randomized Algorithms group at University of Hamburg is looking for a talented computer scientist or mathematician to join the research group. The position is funded by the german DFG and it is for up to 3 years. For a description of the project please refer to


https://gepris.dfg.de/gepris/projekt/491453517?language=en

The start date of the position is quite flexible. Please e-mail all applications (containing a CV and at least 2 reference letters) to

petra.berenbrink@uni-hamburg.de<mailto:petra.berenbrink@uni-hamburg.de>


The application deadline is February 15. Please do not hesitate to contact me with any question you might have.


Petra Berenbrink

**********************************************************
*
* 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 PAPERS - CVPR 2023 Workshop on Image Matching: Local Features and Beyond

CALL FOR PAPERS
*CVPR 2023 Workshop on Image Matching: Local Features and Beyond*

Workshop website: https://image-matching-workshop.github.io
Challenge website: https://www.cs.ubc.ca/research/image-matching-challenge/
CMT website for paper submission:
https://cmt3.research.microsoft.com/IMW2023

*OVERVIEW*

We are happy to announce that the Fifth Workshop on Image Matching:
Local Features and Beyond will be held at CVPR 2023 on June 19, 2023
(morning, Pacific Time) in Vancouver, Canada.

Its goal is to encourage and highlight novel strategies for image
matching that deviate from and advance traditional formulations, with a
focus on large-scale, wide-baseline matching for 3D reconstruction and
pose estimation. This can be achieved by applying new technologies to
sparse feature matching, or doing away with keypoints and descriptors
entirely, such as with dense solutions.

*We will also hold the fifth edition of the Image Matching Challenge*,
co-located with the workshop. Details will be announced in the coming weeks.

*TOPICS*

Workshop topics include (but are not limited to):
- Formulations of keypoint extraction and matching pipelines with deep
networks.
- Application of geometric constraints into the training of deep networks.
- Leveraging additional cues such as semantics and mono-depth estimates.
- Methods addressing adversarial conditions where current methods fail
(weather changes, day versus night, etc.).
- Attention mechanisms to match salient image regions.
- Integration of differentiable components into 3D reconstruction
frameworks.
- Connecting local descriptors/image matching with global
descriptors/image retrieval.
- Matching across different data modalities such as aerial versus ground.
- Large-scale evaluation of classical and modern methods for image
matching, by means of our open challenge.
- New perception devices such as event-based cameras.
- Other topics related to image matching, structure from motion,
mapping, and re-localization, such as privacy-preserving representations.

*SUBMISSION*

We invite paper submissions up to 8 pages, excluding references and
acknowledgements. They should use the CVPR template and be submitted to
the CMT site. Submissions must contain novel work and will be indexed in
IEEE Xplore/CVF. They will receive at least two double-blind reviews.

*IMPORTANT DATES*

- Paper submission deadline: March 19, 2023.
- Notification to authors: April 4, 2023.
- Camera-ready deadline: April 6, 2023 (hard deadline on April 8!).
- Workshop date: June 19, 2023, afternoon (exact schedule TBA).

(All dates are at 11:59PM, Pacific Time, unless stated otherwise.)

*ORGANIZERS*

- Vassileios Balntas, Scape Technologies
- Fabio Bellavia, University of Palermo
- Vincent Lepetit, École des Ponts ParisTech
- Jiri Matas, Czech Technical University in Prague
- Dmytro Mishkin, Czech Technical University in Prague/HOVER Inc.
- Luca Morelli, University of Trento/Bruno Kessler Foundation
- Fabio Remondino, Bruno Kessler Foundation
- Weiwei Sun, University of British Columbia
- Eduard Trulls, Google
- Kwang Moo Yi, University of British Columbia

**********************************************************
*
* 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] Professor position (W2) in Optimization, Uni Augsburg

The Department of Mathematics, University of Augsburg, Germany,
has an opening for a

professor position (level W2) in Optimization

The announcement can be found here:
In German:
https://tinyurl.com/w2optimization

In Englisch:
https://tinyurl.com/w2optimizationEngl

Deadline for applications: 31 January 2023

--
Prof. Dr. Mirjam Dür
Department of Mathematics
University of Augsburg
86135 Augsburg, Germany

T: +49 821 598 2214
E: mirjam.duer@math.uni-augsburg.de
W: http://www.uni-augsburg.de/math/opt/duer

**********************************************************
*
* 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] EATCS Awards - Deadline for submitting nominations ** REMINDER **

We would kindly like to remind you that the deadline for submitting nominations for the 3 awards are:

EATCS Award 2023 <http://eatcs.org/index.php/eatcs-award> : January 30, 2023
Presburger Award 2023 <http://eatcs.org/index.php/presburger> : February 15, 2023
EATCS Fellows 2023 <http://eatcs.org/index.php/eatcs-fellows> : January 31, 2022

More information regarding the awards can be found at http://www.eatcs.org/index.php/eatcs-awards

With best regards,
The Secretary Office of EATCS

**********************************************************
*
* 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] Multiple PhD positions at Bocconi University in Milan

There are multiple PhD positions at recently created Department of
Computing
Sciences at Bocconi University in Milan.

PhD program "Statistics and Computer Science" is a 4-year consisting of two
tracks: Statistics and Computer Science. Students are expected to choose
one of
these tracks, but they have opportunity of learning knowledge from both of
these
areas.

Potential supervisors from the Department of Computing Sciences include
Marek Eliáลก marek.elias@unibocconi.it https://elias.id
Andrea Celli andrea.celli2@unibocconi.it
https://andcelli.github.io/
Laura Sanità laura.sanita@unibocconi.it
https://laurasanita.github.io/

We encourage applications especially from students interested in
Algorithms, Computational Game Theory, Combinatorial Optimization, Online
Algorithms, and related topics.

Application deadline: February 1st 2023
Net salary: minimum 20000EUR per annum (+ additional salary that can be
received for research and teaching assistantship).

Useful links:
Online application portal: https://www.unibocconi.eu/admissionphd (see FAQ
on how to apply)
Information about the PhD school: https://www.unibocconi.eu/phds
Information about the PhD program:
https://www.unibocconi.eu/wps/wcm/connect/bocconi/sitopubblico_en/navigation+tree/home/programs/phd/phd+in+statistics+and+computer+science/
If you would like to learn more about life in Milan and Bocconi University,
I can recommend related blogposts of Luca Trevisan:
https://lucatrevisan.wordpress.com/category/places/bocconi/


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

Wednesday, January 11, 2023

[DMANET] Day on Computational Game Theory: Save the Date

Dear colleagues,

we would like to announce the

13th Day(s) on Computational Game Theory,

to be held on

June 15-16, 2023, at the Vrije Universiteit Amsterdam.

It is a two-day scientific meeting and the follow up to the 12th Day
on Computational Game Theory which was held at the University of
Bremen.

The workshop will bring together researchers in Mathematics, Computer
Science, Operations Research and Economics, who are interested in
algorithmic or computational aspects of game theory, social choice and
related areas. It provides an opportunity to foster collaboration,
present research and exchange ideas in an informal and relaxed
atmosphere.

Invited speakers are

Edith Elkind, University of Oxford, United Kingdom,

and

Neil Olver, London School of Economics and Political Science,
United Kingdom.

There will be room for contributed talks and we strongly encourage PhD
students and young researchers to present their recent results or
ongoing research.

More information will be published soon.

We hope to see you in Amsterdam!
Tim Oosterwijk (Vrije Universiteit Amsterdam)
**********************************************************
*
* 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] Book Announcement

Book Announcement

Maximum-Entropy Sampling:
Algorithms and Application

Authors: Marcia Fampa, Jon Lee

Part of the book series: Springer Series in Operations Research and
Financial Engineering (ORFE)

This monograph presents a comprehensive treatment of the maximum-entropy
sampling problem (MESP),
which is a fascinating topic at the intersection of mathematical
optimization and data science.
The text situates MESP in information theory, as the algorithmic problem of
calculating a
sub-vector of pre-specificed size from a multivariate Gaussian random
vector, so as to maximize
Shannon's differential entropy. The text collects and expands on
state-of-the-art algorithms
for MESP, and addresses its application in the field of environmental
monitoring. While MESP
is a central optimization problem in the theory of statistical designs
(particularly in the area
of spatial monitoring), this book largely focuses on the unique challenges
of its algorithmic
side. From the perspective of mathematical-optimization methodology, MESP
is rather unique
(a 0/1 nonlinear program having a nonseparable objective function), and the
algorithmic
techniques employed are highly non-standard. In particular, successful
techniques come from
several disparate areas within the field of mathematical optimization; for
example: convex
optimization and duality, semidefinite programming, Lagrangian relaxation,
dynamic programming,
approximation algorithms, 0/1 optimization (e.g., branch-and-bound),
extended formulation, and
many aspects of matrix theory. The book is mainly aimed at graduate
students and researchers in
mathematical optimization and data analytics.

Published: 30 October 2022
https://doi.org/10.1007/978-3-031-13078-6

**********************************************************
*
* 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] Optimization 2023 - 1st Announcement

Optimization 2023 is the tenth edition of a series of Optimization international conferences held every three years, in Portugal.
This meeting will be held at the University of Aveiro , July 24-26, 2023, and aims to bring together researchers and practitioners with common interests in optimization. This conference series has international recognition and is being organized under the auspices of APDIO (the Portuguese Operations Research Society).

Plenary speakers:

Miguel Anjos | University of Edinburgh
Jacques Desrosiers | HEC Montréal
Mirjam Dür| University of Augsburg
Ivana Ljubic | ESSEC Business School of Paris
Melvyn Sim | National University of Singapore
Marc Teboulle | Tel Aviv University

Abstract submission deadline: 30 April 2023

For additional information: https://optimization2023.web.ua.pt/

We look forward to meeting you in Optimization 2023,

Agostinho Agra and Luis Gouveia

**********************************************************
*
* 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 Call For Papers: The 17th Conference on Learning and Intelligent Optimization

Second Call For Papers: The 17th Conference on Learning and Intelligent
Optimization (LION17) to be held in Nice, France from June 4-8, 2023

https://lion17.org/

Important dates

Abstract submission: January 25, 2023
Full paper submission: February 1, 2023
Author notification: March 8, 2023
Presentation only abstracts: March 1, 2023
Conference pre-proceedings: May 1, 2023

Submit at: https://easychair.org/my/conference?conf=lion17
The site will start accepting submissions on November 1, 2022.

Topics of Interest

The 17th Learning and Intelligent Optimization conference is an
interdisciplinary conference that brings together researchers in
operations research, machine learning and related fields. We welcome
contributions on all LION themes, i.e., topics containing exact and
heuristic optimization involving learning or intelligent techniques,
such as determining and applying appropriate optimization methods,
expensive algorithm configuration, intelligent learning schemes for
learning from past algorithm behavior, hybrid algorithms (evolutionary,
etc.) to achieve robust and effective performance. Also, we solicit
contributions on this year's special theme "ML and OR pipelines".

We invite submissions presenting new and original research on all topics
related and relevant to the conference. All papers will be reviewed in a
double-blind process and accepted papers will be presented at the
conference.

Keynotes and Tutorials (More to be announced)

- Prof. Wil van der Aalst (RWTH Aachen, Celonis) "Process Mining for
Optimization and Optimization for Process Mining"
- Dr. Martina Fischetti (European Commission Research Center)
"Operations Research + Machine Learning for the design of future
offshore wind farms"
- Prof. Carlos Ansotegui (Universitat de Lleida)

Proceedings

Papers accepted into the LION17 proceedings will be published in Lecture
Notes in Computer Science (LNCS). Submitted papers can have a maximum
length of 15 pages (including references) and should use the LNCS
template, which can be found here:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines.
Papers must be submitted as a PDF in English.

Please note that concurrent submissions are not allowed, and that a
unique author of each accepted paper must register for conference for
the paper to be included in the proceedings.


Special Sessions

In addition to submissions about general LION themes, we also welcome
submissions related to one of our special sessions. The special sessions
will be part of the regular conference and are subject to the same
peer-review as all other submissions.

Special session 1: Bayesian Optimization and (Machine) Learning:
Solutions, Applications, Challenges, and Perspectives
Organized by: Antonio Candelieri and Francesco Archetti (University of
Milano-Bicocca)

Special session 2: Combinatorial and Integer Optimization Layers in Deep
Learning
Organized by: Elias B. Khalil (University of Toronto), Bistra Dilkina
(University of Southern California), Axel Parmentier (Ecole Nationale
des Ponts et Chaussées)

Special session 3: Learning and Intelligent Optimization for Physical
Systems
Organized by: Michael Vrahatis and Konstantinos Chatzilygeroudis
(University of Patras)

Special session 4: Data-Driven Optimization with Business Process Mining
Organized by: Om Prakash Vyas (Indian Institute of Information
Technology Allahabad) and Jerome Geyer-Klingeberg (Celonis)

Special session 5: Responsible AI in Practice
Organized by: Hendrik Baier, Laurens Bliek, Zaharah Bukhsh, Isel Grau,
Yingqian Zhang (Eindhoven University of Technology)

For full descriptions of the special sessions, please see
https://lion17.org


Presentation only abstracts

We also offer the opportunity to submit presentation-only abstracts of
up to 2000 characters regarding ongoing or recently published work.

Program committee

Meinolf Sellmann (InsideOpt)
Kevin Tierney (Bielefeld University)

See the full program and organization committee at https://lion17.org

CPAIOR: Note that CPAIOR 2023 will also be held in Nice from May 29 to
June 1. While there is no official connection between the conferences,
come to Nice and enjoy the good weather and great talks at both
conferences in early June! See: https://cpaior.org/

--
Prof. Dr. Kevin Tierney
Professor for Decision and Operation Technologies
Faculty of Business Administration and Economics
Bielefeld University

Tel: +49 (0)521 106-3940
Room: U9-121

**********************************************************
*
* 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] SAND 2023 - Final Call for Papers

======================================
SAND 2023: Final Call for Papers
======================================

Submission site: https://easychair.org/conferences/?conf=sand2023

2nd Symposium on Algorithmic Foundations of Dynamic Networks
June 19-21, 2023
Pisa, Italy

https://www.sand-conf.org/
Twitter: https://twitter.com/SANDconference


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

Submission deadline: January 23, 2023, 23:59 AoE
Notification: March 23, 2023
Revised papers due: April 8, 2023
Conference: June 19-21, 2023


======================================
Scope
======================================

We are pleased to announce the 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND).

The objective of SAND is to provide a primary venue for the presentation and discussion of research on fundamental aspects of computing in dynamic networks. Focusing on the theory, design, analysis, and application of computing in dynamic networks, SAND seeks high-quality results characterized by a marked algorithmic aspect that shed insights on the computability landscape for dynamic environments or that can be foundational for practical and impactful systems. SAND aims at bringing together researchers from Computer Science and related areas such as Mathematics, Complex Systems, Sociology, Transportations, Robotics, Physics, and Biology to present and discuss original research at the intersection of Algorithms and Dynamic Networks and Systems.

We encourage contributions from all viewpoints, including theory and practice, addressing or being motivated by the role of dynamics in computing. We welcome both conceptual and technical contributions, as well as novel ideas and new problems that will inspire the community and facilitate the further growth of the area.

Topics of interest include, but are not limited to:

- Temporal graphs
- Continuous models of dynamic networks
- Geometric dynamic models
- Reconfigurable and swarm robotics, programmable matter, DNA self-assembly
- Population protocols and chemical reaction networks
- Distributed computation in dynamic networks
- Multilayer, peer-to-peer and overlay networks
- Randomness in dynamic networks
- Wireless networks, mobile computing, autonomous agents
- Streaming models
- Boolean networks
- Information spreading, gossiping, epidemics
- IoT, Cloud, Edge/Fog computing
- Computability and Complexity within dynamic networks
- Offline and online algorithms for dynamic networks
- Learning approaches for dynamic networks
- Complex systems, social and transportation networks
- Fault-tolerance, network self-organization and formation
- New models for dynamic networks
- Bio-inspired, physical, and chemical dynamic models


======================================
Paper Submission
======================================

Papers should be submitted electronically through Easychair (https://easychair.org/conferences/?conf=sand2023).

A submission must be original research and reporting on novel results that have not appeared previously in/(or are concurrently submitted to) a journal or a conference with published proceedings. Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (https://submission.dagstuhl.de/series/details/5#author) with

\documentclass[a4paper,anonymous,USenglish]{lipics-v2021}.

Submissions must be anonymous, without any author names, affiliations, or email addresses. A submission must not exceed 15 pages, excluding the references. Additional details can be provided in a clearly marked appendix. Reviewers are not required to read the appendix. Submissions deviating from the above guidelines will be rejected without consideration of their merits.

The program committee may decide that some of the papers not selected for publication are suitable for publication in the brief announcement format. Any authors who do not wish their paper to be considered for the brief announcement format in case of rejection, are asked to clearly indicate this on the first page of their submission.


======================================
Instructions for Double-Blind Review
======================================

The reviewing process is double-blind, the authors' names must not be included in the paper, and the writing of the manuscript should be done in such a way to not de-anonymize authors (e.g., instead of, our result [1], they should use, the result of [1]). We assume that reviewers do not actively try to recognize the authors. Therefore, authors are allowed to publish their results on pre-print services before or at any point of the submission/reviewing process. Non-anonymous submissions will be rejected.


======================================
Publication
======================================

The conference proceedings will be published by LIPIcs. The final version of the paper must be formatted following the LIPIcs guidelines (https://submission.dagstuhl.de/documentation/authors). Papers accepted in full will have 15 pages in the final proceedings (excluding references). Any papers accepted in the brief announcement format will have 3 pages in the final proceedings (including everything).

Extended and revised versions of selected papers will be considered for a special issue in a journal (for example, the SAND 2022 SI will appear in the Journal of Computer and System Sciences).

For every accepted regular paper and brief announcement, at least one of the authors must fully register and present the paper during the conference and according to the conference program. Any paper accepted but not presented will be withdrawn from the final proceedings.


======================================
Awards
======================================

All papers are eligible for the best paper award. Papers co-authored by full-time students may also be eligible for the best student paper award. For a paper to be considered for the best student paper award, the nominated authors should be full time students at the time of submission and should have a significant contribution to the paper. In case the authors think that their paper is eligible for the best student paper award, they should clearly indicate this on the first page of their submission and briefly justify. The program committee may decline to make these awards or may decide to split them.


======================================
Organization
======================================

Program Committee:

- David Doty, University of California, Davis, USA (co-chair)
- Paul Spirakis, University of Liverpool, UK (co-chair)
- Mostefaoui Achour, Université de Nantes, France
- Hagit Attiya, Technion, Israel
- Petra Berenbrink, Universität Hamburg, Germany
- Silvia Bonomi, Sapienza Università di Roma, Italy
- Janna Burman, Université Paris-Saclay, France
- Arnaud Casteigts, University of Bordeaux, France
- Ho-Lin Chen, National Taiwan University
- Giuseppe Di Luna, Sapienza Università di Roma, Italy
- Mahsa Eftekhari, Microsoft, USA
- Jessica Enright, University of Glasgow, UK
- Javier Esparza, Technische Universität München, Germany
- Pierre Fraigniaud, CNRS, France
- Leszek Gasieniec, University of Liverpool, UK
- Chryssis Georgiou, University of Cyprus
- Peter Kling, Universität Hamburg, Germany
- Dariusz Kowalski, Augusta University, USA
- Marios Mavronicolas, University of Cyprus
- George Mertzios, Durham University, UK
- Othon Michail, University of Liverpool, UK
- Slobodan Mitroviฤ‡, University of California, Davis, USA
- Sotiris Nikoletseas, Patras University, Greece
- Thomas Nowak, Université Paris-Saclay, France
- Giuseppe Prencipe, University of Pisa, Italy
- Andrea Richa, Arizona State University, USA
- Elad Schiller, Chalmers University of Technology, Sweden
- Stefan Schmid, Technische Universität Berlin, Germany
- George Skretas, Hasso Plattner Institute, Germany
- Yuichi Sudo, Hosei University, Japan
- Przemysล‚aw Uznaล„ski, University of Wrocล‚aw, Poland
- Hirozumi Yamaguchi, Osaka University, Japan
- Yukiko Yamauchi, Kyushu University, Japan


Organizing Committee:

- Giuseppe Prencipe, Pisa University, Italy (General Chair 2023)
- Samuele Bonini, Pisa University, Italy


Steering Committee:

- Paola Flocchini, University of Ottawa, Canada (chair)
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy (General chair 2022)
- Viktor Zamaraev, University of Liverpool, UK (General chair 2022)
- Giuseppe Prencipe, Pisa University, Italy (General Chair 2023, Treasurer)
- James Aspnes, Yale University, USA (PC chair 2022)
- Othon Michail, University of Liverpool, UK (PC chair 2022)
- David Doty, University of California, Davis, USA (PC chair 2023)
- Paul Spirakis, University of Liverpool, UK (PC chair 2023)


Advisory Board:

- James Aspnes, Yale University, USA
- Luca Becchetti, University of Rome Sapienza, Italy
- Arnaud Casteigts, University of Bordeaux, France
- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy
- Paola Flocchini, University of Ottawa, Canada
- George Mertzios, Durham University, UK
- Othon Michail, University of Liverpool, UK
- Rotem Oshman, Tel Aviv University, Israel
- Nicola Santoro, Carleton University, Canada
- Paul Spirakis, University of Liverpool, UK
- Viktor Zamaraev, University of Liverpool, 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] Honoring Jayme Swarzfiter – 3 Mondays in January (on zoom)

Honoring Jayme Swarzfiter – 3 Mondays in January on zoom

Israel: 14:30 EU: 13:30 UK: 12:30 USA East coast: 7:30
Korea: 21:30 India: 18:00 Brazil and Argentina: 9:30

Jan. 16, 2023
Celina de Figueiredo
MaxCut is hard when restricted to geometric intersection model
graph classes
Mateus de Paula Ferreira
The time complexity of oriented chromatic number for subgraphs of grids
Jan. 23, 2023
Dieter Rautenbach
On the Mostar index
Jan. 30, 2023
Bruno P. Masquio
Weighted connected matchings
Diego Amaro Ferraz da Costa
A new approach to the study of the split edge coloring
classification problem
For the zoom link:
Send email with the Subject:
Topics in Algorithmic Graph Theory
To: golumbic@cs.haifa.ac.il
if you are not already on the mailing list for the weekly series
"Monday with Marty and Students of Sunil"
**********************************************************
*
* 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, January 10, 2023

[DMANET] Call for Participation: CoRe Challenge 2023 (The 2nd Combinatorial Reconfiguration Challenge)

====================================================================
Call For Participants in the competition

The 2nd Combinatorial Reconfiguration Challenge
(CoRe Challenge 2023)

https://core-challenge.github.io/2023/

Submission deadline: Apr. 30, 2023
====================================================================

** Overview **

Combinatorial Reconfiguration is a novel algorithmic concept that provides
mathematical models and analysis for "transformations over state spaces."
Its appearance ranges from theory to applications. However, its technical
achievements are hard to access. Thus, it is required to found a common
infrastructure for utilizing and applying the algorithmic technology of
combinatorial reconfiguration. See this website
(https://core.dais.is.tohoku.ac.jp/en/project/project_summary/) for more
backgrounds.

The 2nd Combinatorial Reconfiguration Challenge (CoRe Challenge 2023) is a
competition aiming for practically exploring the combinatorial
reconfiguration.

This 2nd challenge continues to target the Independent Set Reconfiguration
(ISR) problem. The ISR problem is one of the most well-studied
reconfiguration problems. Theoretically, the problem is PSPACE-complete,
which implies that there exist instances such that even a shortest
reconfiguration sequence requires a super polynomial steps. Theoretical
results and their references can be found in a survey by N. Nishimura
(https://doi.org/10.3390/a11040052).

** Important Dates **
(Apr. 30, 2023) Challenge ends (submission deadline) --- 23:59 AoE, UTC-12

** Rules/Tracks and Other Details **
See our web page https://core-challenge.github.io/2023/

** Award **
Certificates will be awarded to participants who perform well in each
track/metric.

** Support **
KAKENHI Grant-in-Aid for Transformative Research Areas (B)
"Fusion of Computer Science, Engineering and Mathematics Approaches for
Expanding Combinatorial Reconfiguration"

** Organizers **
Takehiro Ito (Tohoku University, Japan)
Yoshio Okamoto (The University of Electro-Communications, Japan)
Takehide Soh (Kobe University, Japan)
Tomoya Tanjo (National Institute of Genetics, Japan)

** Contact **
For public questions, please use https://groups.google.com/g/core-challenge.
For private questions, please use core.challenge@grp.tohoku.ac.jp
**********************************************************
*
* 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: SIGOPT2023@Cottbus

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

(2nd Call for Talks and Participation)

SIGOPT2023 International Conference on Optimization

www.sigopt2023.b-tu.de

March 14-16, 2023

Brandenburg University of Technology Cottbus-Senftenberg

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


The Special Interest Group in Optimization (SIGOPT) was created in 1993 with the purpose of encouraging cooperation and communication between its members to enrich the scientific network of mathematical optimization. In this regard, a series of conferences has been established in order to conglomerate all the different aspects of mathematical optimization within one event of familiar atmosphere, and it is our pleasure to announce the 5th SIGOPT conference to be held during

March 14 - 16, 2023, in Cottbus, Germany.

The conference is scheduled to take place at the Zentralcampus of the Brandenburg University of Technology Cottbus-Senftenberg (BTU). Further up-to-date information can be found at the conference website www.sigopt2023.b-tu.de

Aims and Scopes

The SIGOPT conference covers theory and practice in all branches of mathematical optimization, e.g., Linear Optimization, Discrete and Combinatorial Optimization, Mixed-Integer Optimization, Nonlinear Optimization, Nonsmooth Optimization and Variational Analysis, Multiobjective and Set-Valued Optimization, Optimal Control and Infinite-Dimensional Optimization, Machine Learning, or Application of Optimization in Real-World Problems. The SIGOPT promotes the collaboration of all the different branches of mathematical optimization, so talks combining theory or methods from different topics are especially welcome. Young researchers are particularly encouraged to submit abstract proposals.

Plenary Speakers

We are pleased to announce the following invited speakers:

Gabriele Eichfelder (TU Ilmenau)
Ulf Lorenz (University of Siegen)
Nicole Megow (University of Bremen)
Ira Neitzel (University of Bonn)
Anita Schöbel (TU Kaiserslautern)
Ola Svensson (EPFL Lausanne)

Social Activities

A guided walking tour on Wednesday will lead us through the city of Cottbus, famous for its clothiers and miners in the past and nowadays one of Germany's strongholds of structural change. Afterwards, we will join for a conference dinner at the Lindner hotel.

Submission of Abstracts and Invited Sessions

Abstracts have to be submitted in LaTeX and should not exceed 1500 characters while being free of references. We offer the possibility to organize invited sessions. Therefore, a suitable session title, a chairperson, and three to four abstracts have to be provided.

Submission of abstracts and session proposals are possible until January 31, 2023, via email to sigopt2023@b-tu.de

Venue & Accommodation

The conference takes place at the Zentrales Hörsaalgebäude of the BTU on the main campus in Cottbus.

BTU Cottbus-Senftenberg
Konrad-Wachsmann-Allee 3
03046 Cottbus

We recommend the Lindner Congress Hotel which is located within a 10-minute walking distance to the venue. A room contingent is reserved under the keyword "SIGOPT 2023" until February 14.

Linder Congress Hotel
Berliner Platz / Karl-Marx-Straße 68
03046 Cottbus

We offer a limited number of day care spots at a BTU Kindergarten in order to allow parents of young children (3yrs and older) to attend the conference without too many limitations. If you are interested in this offer, contact the conference organizers via email until January 31, 2023.

Registration & Conference Fee

Please register for the conference via the website www.sigopt2023.b-tu.de

The conference fee is 140.00 EUR, which includes the conference dinner. An additional spouse ticket can be purchased for 80.00 EUR. Payment has to be made in advance via bank transfer; account details are shown after registration.

Covid-19

In accordance with current regulations of the state of Brandenburg and the University, we can enjoy the conference without wearing masks or social distancing. In case these rules change, further updates can be found on the conference website www.sigopt2023.b-tu.de and will be posted via email to registered participants.

Important Dates

Submission of Abstracts: now open!
Registration: now open!
Deadline Submission of Abstracts and Invited Sessions: January 31, 2023
Notification of Acceptance: in continuous way until February 10, 2023
End of Lindner Hotel Contingent: February 14, 2023
Registration End: February 27, 2023
Conference: March 14-16, 2023

Program Committee

Gennadiy Averkov (BTU Cottbus-Senftenberg)
Anja Fischer (TU Dortmund)
Armin Fügenschuh (BTU Cottbus-Senftenberg)
Ekkehard Köhler (BTU Cottbus Senftenberg)
Sabine Pickenhain (BTU Cottbus-Senftenberg)
Gerd Wachsmuth (BTU Cottbus-Senftenberg)

Organization Committee

Jesse Beisegel (BTU Cottbus-Senftenberg)
Annette Fischer (BTU Cottbus-Senftenberg)
Armin Fügenschuh (BTU Cottbus-Senftenberg)
Patrick Mehlitz (BTU Cottbus-Senftenberg & University of Mannheim)

Contact Information

In case of any issues, feel free to contact the organizers via sigopt2023@b-tu.de


**********************************************************
*
* 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] OJMO volume 3 online

Dear fellow optimizers

We are glad to advertize the third volume of OJMO, published in Open
Access free of charge thanks to the support of the Mersenne center:
https://ojmo.centre-mersenne.org/volume/OJMO_2022__3_/

We also take this opportunity to thank all authors and referees helping
us paving the way for diamond open access in mathematical optimization.

Michaël Poss,
on behalf of the board of OJMO

**********************************************************
*
* 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] Open faculty position in Computer Science at KU Leuven Campus Kulak-Kortrijk

The Science, Engineering & Technology Group of KU Leuven Campus Kulak in
Kortrijk, Belgium, has an opening for a tenured / tenure track position
(depending on the seniority of the selected candidate) in computer
science. The envisaged computer science areas include, but are not
limited to, artificial intelligence, machine learning and data-science,
databases and data-driven systems and applications, computer systems and
computer networks, software engineering, programming languages, and
theoretical computer science. As a faculty member, you develop a
research program at an international level in one or more of these
areas. The new member of staff will be embedded within the Department of
Computer Science of KU Leuven at Campus Kulak.

We are looking for internationally oriented candidates with an excellent
research record, with a solid background in computer science, and with
teaching competence in informatics and computer science. It is important
to note that the teaching duties linked to this position require an
immediate and profound active knowledge of the Dutch language.

Deadline: 28 February 2023

More information is available at
https://www.kuleuven.be/personeel/jobsite/jobs/60172333?hl=en&lang=en
<https://www.kuleuven.be/personeel/jobsite/jobs/60172333?hl=en&lang=en>

--
Jan Goedgebeur
Department of Computer Science
KU Leuven Campus Kulak
Etienne Sabbelaan 53
8500 Kortrijk, Belgium

**********************************************************
*
* 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] SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)--new submission dates

The deadline for registering a submission to SIAM ACDA 23 has been extended to January 16. Correspondingly, the actual paper submission deadline is now January 23.

Note that there are two tracks, and only one has a proceedings publication, whereas the other is just for a talk slot in the conference.
NOTE: in the latter case, the paper may have been submitted – but not yet published – in another venue, either for a journal or a conference with its own archival proceedings, and the submission format
allows for an appendix so that a paper formatted in another way can be adapted easily.

This conference is co-located with the SIAM Optimization Conference (and submissions to ACDA 23 are allowed from individuals presenting there).

The full call for papers is as follows:

Call for Papers

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)
May 31 – June 2, 2023
Seattle, Washington, U.S.

The Sheraton Grand Seattle

(This is the conference of the SIAM Activity Group on Applied & Computational Discrete Algorithms.

This conference is co-located with SIAM Conference on Optimization (OP23).)


Extended Registration and Short Abstract Submission Deadline: January 16, 2023

Extended Paper/Presentation Submission Deadline: January 23, 2023

(see details below)

ACDA brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA expands the area of Combinatorial Scientific Computing to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications.
Included Themes
Topics of interest include but are not limited to discrete or combinatorial problems and algorithms arising in:

Algorithm engineering
Algorithmic differentiation (AD)
Combinatorial optimization and mathematical programming, including scheduling and resource allocation problems
Combinatorial scientific computing (CSC) including models, algorithms, applications, numerical methods, and problems arising in data analysis
Computational biology and bioinformatics
Data management and data science
Design and analysis of application-inspired exact, randomized, streaming, and approximation algorithms
Graph and hypergraph algorithms, including problems arising in network science and complex networks
Interaction between algorithms and modern computing platforms, including challenges arising from memory hierarchies, accelerators, and novel memory technologies
Machine learning and statistical methods for solving combinatorial problems
Numerical linear algebra, including sparse matrix computations and randomized approaches
Parallel and distributed computing, including algorithms, architectures, distributed systems, and all parallelism ranging from instruction-level and multi-core all the way to clouds and exascale
Other applications arising from security, computational finance, computational chemistry/physics, quantum computing, etc.


Types of Contributions

All contributions must be submitted electronically via the EasyChair submission system (https://easychair.org/conferences/?conf=acda23). There are three types of submissions to ACDA, as follows. We strongly encourage making code and data available as well.


1. Archival Proceedings Papers

Submissions may be up to 10 pages in length, excluding references, and must present original research that is not published or concurrently submitted to a journal or a proceedings-based conference. Submissions will be refereed. Accepted papers will be included in the proceedings published by SIAM.

Extended Short Abstract Submission and Registration Deadline: January 16, 2023
Extended Paper Submission for Archival Proceedings Deadline: January 23, 2023



2. Conference Presentations Without Archival Proceedings

Alternatively, authors can elect (at the time of submission) to have an accepted paper be considered for presentation at the conference without appearing in the conference proceedings. Furthermore, in this case, it is allowed for papers to be concurrently submitted to a journal or to another proceedings-based conference; however, these papers

should not yet have been published.

Extended Short Abstract Submission and Registration Deadline: January 16, 2023
Extended Paper Submission for Conference Presentations without Archival Proceedings Deadline: January 23, 2023

Author Notification: March 8, 2023

3. Poster Submissions

A poster submission is in the form of a 2-page (maximum) abstract. Posters are not considered archival, and reviewing of posters will not be double-blind. Poster presentations will not appear in the conference proceedings.

Poster Submission Deadline: March 8, 2023
Author Notification: March 15, 2023

All accepted proceedings papers must use the double-column LaTeX macro at the bottom of the following web page: http://www.siam.org/proceedings/macros.php

Initial submissions need not use this format, but are required to be formatted in at least 11pt font with at least one-inch margins, and be limited to at most 10 pages (not counting cover page and references); if further space is needed to present full details, authors are permitted to include well-marked appendices, but the program committee will not be expected to use this extra material in reviewing the submission. Appendices will not be included in the proceedings.

The main part of the submission should therefore contain a clear technical presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims.

At least one author of an accepted proceedings paper, talk or poster presentation is required to register and present at ACDA. A brief abstract of each presentation will appear in the published ACDA program.

Double-Blind Reviewing

ACDA will employ a lightweight double-blind reviewing process for all submissions. Submissions should not reveal the identity of the authors in any way, in particular, authors of 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 ..."). The purpose of the 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. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, 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. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs.

We strongly encourage also making code and data available; please keep in mind the double-blind nature of the review process. We recommend including a link to an anonymized version that makes a 'best effort' to avoid revealing the identity of the authors (e.g., using Anonymous Github or an anonymous Dropbox/Google Drive folder).

Prizes

Awards will be given for best paper, best poster, and best student presentation.

Invited Presentations

Jose Correa (Universidad de Chile, Chile )
Jelani Nelson (University of California, Berkeley, U.S.)
Rob Schreiber (Cerebras Systems, U.S.)
Blair Sullivan (University of Utah, U.S.)
Sivan Toledo (Tel Aviv University, Israel)
Andrea Walther (Humboldt-Universität zu Berlin, Germany) Joint Plenary Speaker with SIAM Conference on Optimization (OP23)

Minitutorials

Sergei Vassilvitskii: Beyond Worst-Case Analysis
Martin Buecker: Algorithmic Differentiation


Program Committee Co-chairs
Jonathan Berry, Sandia National Laboratories, U.S.
David Shmoys, Cornell University, U.S.

Program Committee

Martin Bücker, Friedrich-Schiller- Universität Jena, Germany
David Bader, New Jersey Institute of Technology, U.S.
Michael Bender, SUNY Stony Brook, U.S.
Anne Benoit, ENS Lyon, France
Dan Bienstock, Columbia University, U.S.
Sarah Cannon, Claremont McKenna College, U.S.
Lenore Cowen, Tufts University, U.S.
Martin Farach-Colton, Rutgers University, U.S.
Maryam Fazel, University of Washington, U.S.
Sándor Fekete, Technische Universität Braunschweig, Germany
Xin Gao, King Abdullah University of Science and Technology, Saudi Arabia
Assefaw Gebremedhin, Washington State University, U.S.
Phil Gibbons, Carnegie Mellon University, U.S.
John Gilbert, University of California, Santa Barbara, U.S.
Andrew Goldberg, Amazon, U.S.
Giulia Guidi, University of California, Berkeley, U.S.
Swati Gupta, Georgia Institute of Technology, U.S.
Kathrin Hanauer, University of Vienna, Austria
Bruce Hendrickson, Lawrence Livermore National Laboratory, U.S
Dorit Hochbaum. University of California, Berkeley, U.S.
Paul Hovland, Argonne National Laboratory, U.S.
Rob Johnson. VMware Research, U.S.
Jeremy Kepner, Massachusetts Institute of Technology, U.S.
Smita Krishnaswamy, Yale University, U.S.
Kamesh Madduri, Pennsylvania State University, U.S.
Fredrick Manne, University of Bergen, Norway
Samuel McCauley, Williams College, U.S.
Nicole Megow, University of Bremen, Germany
Ben Moseley, Carnegie Mellon University, U.S.
Eisha Nathan, Lawrence Livermore National Laboratory, U.S
Uwe Naumann, RWTH Aachen University, Germany
Richard Peng, Georgia Institute of Technology, U.S.
Cynthia Phillips, Sandia National Laboratories, U.S.
Alex Pothen, Purdue University, U.S.
Emilie Purvine, Pacific Northwest National Laboratory, U.S.
Ted Ralphs, Lehigh University, U.S.
Julian Shun, Massachusetts Institute of Technology, U.S.
Aravind Srinivasan, University of Maryland, College Park, U.S.
Cliff Stein, Columbia University, U.S.
Blair Sullivan, University of Utah, U.S.
Adrian Tate, NAG, United Kingdom
Shang-Hua Teng, University of Southern California, U.S.
Denis Trystam, Grenoble Institute of Technology, France
Fabio Vandin, University of Padova, Italy
Santosh Vempala, Georgia Institute of Technology, U.S.
Rich Vuduc, Georgia Institute of Technology, U.S.
Andrea Walther, Humboldt Universität Berlin, Germany
Jean-Paul Watson, Lawrence Livermore National Laboratory, U.S.
David Woodruff, Carnegie Mellon University, U.S.
Shenghao Yang, University of Waterloo, Canada


Organizing Committee Co-Chairs

Lenore Cowen, Tufts University, U.S.
Uwe Naumann, RWTH Aachen University, Germany


Organizing Committee

Anne Benoit, ENS Lyon, France
Dorit Hochbaum, University of California, Berkeley, U.S.
Fredrik Manne, University of Bergen, Norway
Cynthia Phillips, Sandia National Laboratories, U.S.
Adrian Tate, NAG, United Kingdom
Shang-Hua Teng, University of Southern California, U.S.


Funding Agency
SIAM and the Organizing Committee wish to extend their thanks and appreciation to the U.S. National Science Foundation for its support of this conference.
**********************************************************
*
* 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, January 9, 2023

[DMANET] Postdoc position in Probability/Combinatorics at King's College London

Applicants are invited to apply for a Postdoctoral Research Associate
position to work with Dr Matthew Jenssen at the Department of Mathematics,
King's College London.

This 2-year position is full-time and supported by a UKRI Future Leaders
Fellowship. There is flexibility in the start date.

More details are available at

https://jobs.kcl.ac.uk/gb/en/job/060705/Research-Associate

Informal enquiries are welcome:
matthew.jenssen@kcl.ac.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] Conference Call IEEE DAPPS 2023

Call For Papers
Scope

The objective of the 5th IEEE International Conference on Decentralized
Applications and Infrastructures (IEEE DAPPS 2023) is to facilitate the
exchange between researchers and practitioners in the area of Decentralized
Applications (dApps) based on Distributed Ledger Technologies, Blockchains
and related technologies. The conference is part of the IEEE CISOSE 2023
congress.

Blockchain has already established itself in the domains of digital
payments, Non-Fungible Tokens (NFTs) and now Non-Fungible Rights (NFRs).
However, the potential implications of Blockchain technologies go far
beyond their application as the technological backbone for
cryptocurrencies. Blockchains have been successfully applied in numerous
applications and smart contracts provided them with more functionality.
However, dApps make the shift to blockchains even more seamless as they
allow users to engage with the apps just as they did with traditional apps,
but they are powered by blockchains and smart contracts. Hence, dApps are
expected to become a key building block for a plethora of highly expressive
applications. They allow for various novel application scenarios, which are
built upon distributed consensus and thus are hard to block or censor while
providing public verifiability of peer-to-peer transactions without a
trusted central party. For that, permissionless Blockchains such as
Bitcoin, Ethereum, and Cardano, rely on an unrestricted set of participants
that run a consensus algorithm among them. On the contrary, permissioned
Blockchains, such as Hyperledger, Corda, Quorum, and Ripple, distribute
trust among a restricted set of consensus participants, a setup that can be
well suited to model enterprise application scenarios in a more scalable
fashion.

IEEE DAPPS 2023 will provide a high-quality forum for participants from
research and industry. The conference will discuss key theories,
algorithms, infrastructures, and significant deployments for dApps and
decentralized infrastructures, as well as emerging research topics.

Topics of interest include, but are not limited to:

Distributed Ledger Technologies (DLTs)
Smart contract theory
Languages and tools for (secure) dApps
Infrastructures for dApps
Communication protocols and standards for dApps
Software engineering for dApps and smart contracts verification
Decentralized identities and identity management for dApps
Token economy
Central bank digital currencies (CBDC)
Verifiable Random Functions (VRFs)
Off-Chain/Layer 2 dApps
Decentralized Finance (DeFi)
Non-fungible tokens (NFTs)
Intellectual Property (IP) in NFT and NFR systems
Ownership guarantees in NFT and NFR systems
Cryptographic primitives for applications
Analytics for on-chain and off-chain data
Governance structure and mechanisms
Interoperability for dApps, Blockchains, and DLTs
Mapping physical assets to NFRs
Certificate management and NFRs
Privacy of dApps
Security of dApps
Scalability, sharding, and performance of blockchain systems
Policy/laws surrounding dApps, blockchains, and cryptocurrencies
Applications in emerging domains
Other emerging research topics

Important Dates

February 12th, 2023: Abstract submission deadline
February 19th, 2023: Paper submission deadline
April 24th, 2023: Author notification
May 15th, 2023: Camera-ready submission and conference registration
July 17-20, 2023: Conference dates (Athens, Greece)

Paper submission

IEEE DAPPS 2023 solicits research papers describing novel and previously
unpublished scientific contributions to the field of dApps and
decentralized infrastructures. All papers must be original and not
simultaneously submitted to another journal or conference.

Two different types of papers can be submitted:
Regular papers (10 pages IEEE double-column format)
Short papers (6 pages IEEE double column format)

Regular papers should describe novel and previously unpublished scientific
contributions to the field of dApps and decentralized infrastructures. Each
regular paper is limited to 10 pages, including tables, figures and
references.

Short papers aim at presenting novel work in progress, novel applications,
and novel industry perspectives in the field of dApps and decentralized
infrastructures. Each short paper is limited to 6 pages, including tables,
figures and references. Short papers will also be peer-reviewed, however,
they will be evaluated with a focus on the potential for establishing new
ideas and for sparking the interest of participants. PhD candidates are
also invited to submit ongoing work lacking complete results as short
papers.

All papers must be written in English. Manuscripts must include a title, an
abstract, and a list of 4-6 keywords. All papers must be prepared in the
IEEE double-column proceedings format. Please see:
https://www.ieee.org/conferences/publishing/templates.html

IEEE DAPPS 2023 uses a double-blind review policy. Authors are required to
remove their names, affiliation(s) and other identifying information from
the header of the manuscript. This also includes meta-data in the submitted
document as well as acknowledgement sections. Authors are required to cite
their previous work in a neutral manner, for example, avoid "in our
previous work [3]" and instead use "as shown in [3]".
Papers that do not meet these anonymization requirements may be
desk-rejected without further review.

All submitted papers will be peer-reviewed. The name(s) of the author(s)
will not be visible to the reviewers of a paper. The name(s) of the
author(s) will be visible in the submission system to the General Chairs
and the Program Committee Chairs. Authors should report any conflict of
interest with the list of Program Committee members during submission of
the manuscript, in which case the Program Committee Chairs will exclude the
corresponding PC member(s) from reviewing the paper.

Authors must submit their manuscripts via the following link by February
19th, 2023, 23:59 AoE at the latest:
https://easychair.org/conferences/?conf=dapps2023

Preprints

Authors who have submitted articles for publication by the IEEE may be
interested in posting preprint versions of the same article. In order to
find out more about the allowed forms of preprints and to understand what
counts as a prior publication, please see IEEE's Sharing and Posting
Policies as well as Section 8.1.9 on "Electronic Information Dissemination"
in the IEEE Publication Services and Products Board Operations Manual.

Paper publication

All accepted papers will be published by IEEE Computer Society Press
(EI-Index) and included in the IEEE Digital Library. For publication, each
accepted paper is required to be registered by one of its authors, and at
least one author is required to attend and present the paper at the
conference for the paper to be included in the final technical program and
the IEEE Digital Library.

Special issues

The authors of the best papers will be invited to also submit their work
(with at least 30% novel contents) to special issues to be determined.

Contact

The organizing committee of IEEE DAPPS 2023 can be reached via email at:
general-chairs@ieeedapps.net
pc-chairs@ieeedapps.net

**********************************************************
*
* 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 and Incentives for Blockchains and Digital Coins at the University of Edinburgh

Dear colleagues,

Applications are invited for a PhD position in Algorithms and Incentives for Blockchains and Digital Coins at the School of Informatics of the University of Edinburgh. The selected candidate will be supervised by Aris Filos-Ratsikas and co-supervised by Aggelos Kiayias on fundamental topics related to algorithms and incentive mechanisms for blockchain-related applications. The position is funded by IOHK (https://iohk.io/), one of the major blockchain research and infrastructure companies.

The deadline for applications is *January 27th, 2023 or until the position is filled*.

Detailed information on the position and the application process can be found at the following link:

https://www.ed.ac.uk/informatics/postgraduate/fees/research-scholarships/research-grant-funding/phd-studentship-in-incentives-for-blockchain-coins

For additional information, please do not hesitate to contact me.

Best regards,
Aris Filos-Ratsikas
**********************************************************
*
* 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] Special Issue on CEJOR (Reminder)

Dear Colleagues,

Please consider submitting your original paper to the following Special Issue:

Central European Journal of Operations Research

Special Issue on: "Persons and Freight Transportation"

All papers must be submitted online through the Journal editorial manager (maximum number of pages allowed is 25) and will follow the standard peer review process of CEJOR.

During the online submission, please make sure to select "SI: PERSONS AND FREIGHT TRANSPORTATION" in the first step of the submission process.

Guest Editors:

Chefi Triki (Lead Guest Editor)
Ruben Ruiz
Nima (A.) Mirzazadeh
Gerhard-Wilhelm Weber


--


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

[DMANET] Deadline Extended - CfP ''The Interplay of Discrete Optimization and Machine Learning''

The manuscript submission deadline for the special issue on ''The Interplay of Discrete Optimization and Machine Learning'' of Frontiers in Applied Mathematics and Statistics has been extended to February 5, 2023.You are invited to submit your contribution to this research topic via the special issue websitehttps://www.frontiersin.org/research-topics/47207/the-interplay-of-discrete-optimization-and-machine-learningWe have arranged for substantial discounts on the open access publication fees incurred by Frontiers -- 50% on type-A articles (original research papers) and 100% on type-B articles (e.g., review papers). Please email one of the topic editors (Elias Khalil, Sebastian Pokutta, Gonzalo Munoz, and myself) prior to submitting your work to receive a discount code for use during submission.Best regardsAndreas Tillmann--Dr. Andreas M. TillmannInstitute for Mathematical OptimizationCluster of Excellence SE²A - Sustainable and Energy-Efficient AviationTechnical University 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] Open position at the AOC team of LIPN - Paris13 - Starting in September 2023

*** Apologies for multiple copies ***
========================================================================================================================================
Looking for candidates to a Associate Professor position in Computer
Science specialized in Mathematical Programming
========================================================================================================================================

The Université Paris 13 is seeking applicants for an Associate Professor
position in the Department of Computer Science attached to the LIPN
(Laboratory of Computer Science of Paris Nord) as for research and
attached to the IUT Villetaneuse as for teaching.

Knowledge of French is requested.

The application process is open, it closes during March, 2023

Post 27
================
Profile : Computer Science LIPN, University Institute of Technology of
Villetaneuse, Université Paris 13

Teaching Profile
================
Education Department: Data Science
Place of work: IUT de Villetaneuse - Villetaneuse Campus
Teaching team : Data Science

Description:
The person recruited will teach at the IUT de Villetaneuse. S/he will
join the Data Sciences department, where the curriculum targets
statistics and business intelligence. S/he will teach domains of
computer science related to data, such as the development of decision
software, or more generally data analysis tools, data security, etc.
According to needs, the person recruited will lecture in courses related
to data science (data bases, analysis and treatment of structured data,
etc.) in the Networks and Telecommunications and Computer Science
departments.
The person recruited will also take part in the professional supervision
(internships, apprenticeships), pedagogic coordination of courses, and
with time will take responsibility of a curriculum.


Recherche Profile
=================
The Paris-Nord Computer Science Laboratory (LIPN – CNRS UMR 7030) wishes
to strengthen the research in Combinatorial Optimization carried out by
the Algorithms and Combinatorial Optimization (AOC) team by recruiting
an associate professor.

The Algorithms and Combinatorial Optimization (AOC) team includes three
closely related research axes: Polyhedron and optimization in graphs,
Mathematical programming, and Distributed algorithms, software, and
architectures. The variety of approaches implemented and the wide
spectrum of issues addressed allow the team to conduct research on the
theoretical and practical aspects of combinatorial optimization and
operation research, in particular by developing original methods from
conception until the implementation of the algorithms

The team has developed local collaborations (within the MathSTIC
federation in particular), regional (with CERMICS, LIX, CNAM, LAMSADE,
LIP6, etc.), national (Bordeaux, Grenoble, Nantes, Nancy, etc.) and
international (Italy, USA, Mexico, Germany, Canada, Scotland, Spain,
etc.). It also has numerous industrial collaborations.

The Mathematical Programming axis of the AOC team mainly deals with the
exact and approximate resolution of combinatorial optimization problems
via different approaches. Among these approaches are cuts generation and
column generation schemes, as well as decomposition and relaxation
methods. We also approach the resolution of problems by nonlinear
models, polyhedral approaches, optimization under uncertainties
(reoptimization, robustness) and metaheuristics. The Polyhedron and
Optimization in Graphs axis focuses on more structural issues such as
the characterization of equimodular matrices and the description of
Box-TDI systems and polyhedra. The theoretical and methodological work
is complemented by software contributions and industrial transfer.

Successful candidates will hold a PhD in Operations Research or
Mathematical Programming, and will join the Algorithms and Combinatorial
Optimization (AOC) research team. The profile sought can come from any
field of combinatorial optimization and operational research related to
one of the axes of the team.

(http://www-lipn.univ-paris13.fr/AOC/)

Key words: combinatorial optimization, discrete applied mathematics,
mathematical programming.


More information / further contacts
===================================
David Hébert, Head of the SD department, David.Hebert @ univ-paris13.fr
Frédérique Bassino, Director of LIPN, Frederique.Bassino @
lipn.univ-paris13.fr
Roberto Wolfler Calvo, Head of the AOC team, Roberto.Wolfler @
lipn.univ-paris13.fr
Lab URL : http://lipn.univ-paris13.fr

For futher details on the postion :
http://lipn.univ-paris13.fr/
**********************************************************
*
* 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] SI on Security of Emerging Virtual Environments: Metaverse and Extended Reality- Ad Hoc Networks

*Ad Hoc Networks*

*Security of Emerging Virtual Environments:*

* Metaverse and Extended Reality*

***Submissions are due:* March 31st, 2023****

https://www.journals.elsevier.com/ad-hoc-networks/call-for-papers/security-of-emerging-virtual-environments-metaverse-and-extended-reality

*We encourage early submission*

The real world is surrounded by people, buildings, hospitals, factories,
businesses, vehicles, cognitive cities, and the billions of devices that
provide various services and connect us and this world. Various advanced
technologies including AR, VR, XR, and the Digital Twin provide advanced
solutions to create a new virtual world (aka, Metaverse) where the avatars
of the users can interact with 3D objects as in the real life. Metaverse is
a virtual world of Digital Twins and NFTs. Such technologies provide a wide
range of new services that require the collection of various types of data
about real objects, users including their biometric information (e.g., eyes
or voice fingerprints, etc.), and the surrounding environment (e.g.,
weather, traffic flow, etc.). The collected data can be used for
identifying the various users, sharing their characteristics, or capturing
their interaction with the environment to provide a unique immersive
experience in the 3D virtual world. Furthermore, each realistic object
modeled in the virtual environment should rely on the status of its
physical twin including interactions and relations between everything else.
As a result, a wide range of new services and applications will be provided
connecting events in the virtual and the real worlds and causing more
complex interactions. The huge amount of collected data in the virtual and
the real worlds sets heavy challenges on the networking and computing
systems as such technologies have strict boundaries related to the security
and privacy of the gathered data. Moreover, the wireless communication
between mobile devices that generate data streams and the mobility of
physical devices make the related issues more difficult to address. Indeed,
these challenges increase with the complexity of the used technologies as
new advanced attacks can be designed allowing to the exploitation of the
collected data such as creating multiple fake avatars.

The purpose of this special issue is to elaborate on and emphasize the key
aspects to secure emerging virtual environments that rely on wireless
communication. It welcomes original research and innovative solutions on
the above subjects as well as case studies that explore the potential
exploitation of data security, privacy, and trust in the Metaverse.
Research may cover and focus on either the fundamental methodological
studies or the use case and application demonstrations.

Topics of interest include, but are certainly not limited to:

● Blockchain assisted the metaverse

● Blockchain for the Digital Twin

● Edge computing for the Internet of Metaverse

● Network security of the metaverse

● Digital Twin and Metaverse privacy

● Consensus and mining algorithms suited for the metaverse

● Blockchain-based controlled mobility and QoS in the metaverse

● Cybersecurity in the metaverse

● Cybersecurity in XR-based applications

● Trust, Security, and Privacy in the metaverse application

● Trusted Zero-touch networks for the metaverse

● Trusted software and applications for the metaverse

● Digital Identification and authentication mechanisms

● Intrusion detection and prevention in the emerging virtual environments

● Secure mobile ad-hoc network for the metaverse

*Guest editors:*

● Moayad Aloqaily, Mohamed bin Zayed University of Artificial
Intelligence, UAE.

● Ouns Bouachir, Zayed University, UAE.

● Lewis Tseng, Boston College, USA.
● Giancarlo Fortino, University of Calabria, Italy.

**********************************************************
*
* 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 Nomination Knuth Price 2023

Knuth Prize

The Donald E. Knuth Prize for outstanding contributions to the
foundations of computer science is awarded for major research
accomplishments and contributions to the foundations of computer science
over an extended period of time. The Prize is awarded annually by theACM
<https://acm.org/>Special Interest Group on Algorithms and Computation
Theory <https://sigact.org/>(SIGACT) and theIEEE
<https://www.ieee.org/>Technical Committee on the Mathematical
Foundations of Computing <https://tc.computer.org/tcmf/>(TCMF).

*Nomination Procedure.*Anyone in the Theoretical Computer Science
community may nominate a candidate. To do so, please send nominations
for the 2023 Prize to*knuth.prize.2023@gmail.com*by*February 15, 2023*.

For more details see https://sigact.org/prizes/knuth.html

--
Univ.-Prof. Dr. h.c. Monika Henzinger, PhD
Research group "Theory and Applications of Algorithms"
Faculty of Computer Science
University of Vienna
https://cs.univie.ac.at/monika.henzinger
**********************************************************
*
* 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 Papers Special Issue on Deep Learning for Anomaly Detection

Dear Colleagues,

I am contacting you in my capacity as Guest Editor for a Special Issue titled:

"Deep Learning for Anomaly Detection"

to appear in "Algorithms" MDPI journal:

https://www.mdpi.com/journal/algorithms/special_issues/Y072QR9GTI

With this call for papers, I invite you and/or your co-authors to submit an original research paper, or a focused review, for our special issue.

Deadline for manuscript submissions: 30 August 2023.

Submitted papers will be peer reviewed and, upon acceptance, the paper will be published in open access form soon after professional editing.

Thank you in advance for your consideration and I sincerely hope that you will accept this invitation to contribute to this Special Issue. If you believe that you will be able to submit a manuscript, I would also greatly appreciate if you could respond to this invitation at your earliest convenience.

"Algorithms" (ISSN 1999-4893) is an EI, Scopus and ESCI indexed, Open Access journal published online monthly by MDPI.

Best Regards
________________________________________
Alessio Martino, PhD
Assistant Professor of Computer Science
LUISS Guido Carli University
Department of Business and Management
Viale Romania 32, 00197 Rome, Italy<https://www.google.com/maps/place/Viale+Romania,+32,+00197+Roma+RM/@41.9250084,12.491102,17z/data=!3m1!4b1!4m5!3m4!1s0x132f61185c88b765:0xc1b3fadadd3515ae!8m2!3d41.9250044!4d12.4932907> (Room 539)
Phone: (+39) 06-85225957
E-mail: amartino@luiss.it<mailto:amartino@luiss.it>
Web:

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