Wednesday, May 25, 2022

[DMANET] RCRA 2022 - 1st call for papers

[APOLOGIES FOR MULTIPLE POSTINGS]

* ______________________________________________________________________ *

The RCRA group (Knowledge Representation & Automated Reasoning) of
the AI*IA (Italian Association for Artificial Intelligence)

organizes the

29th RCRA workshop on
Experimental evaluation of algorithms for solving
problems with combinatorial explosion (RCRA 2022)

affiliated to the 16th International Conference on Logic
Programming and Non-monotonic Reasoning (LPNMR 2022)
https://sites.google.com/view/lpnmr2022

September, 5th, 2022; Genova, Italy


RCRA group web site:http://rcra.aixia.it/
Workshop web site: TBA
e-mail:marco@dibris.unige.it,M.Vallati@hud.ac.uk

* ______________________________________________________________________ *

This event follows the series of the RCRA (Knowledge
Representation and Automated Reasoning) annual meetings, held
since 1994. The success of the previous events shows that RCRA is
becoming a major forum for exchanging ideas and proposing
experimentation methodologies for algorithms in Artificial
Intelligence.

* ______________________________________________________________________ *


IMPORTANT DATES

Paper submission deadline: July 10th, 2022
Notification of acceptance: August 1st, 2022
Final version of accepted original papers: August 22nd, 2022
RCRA workshop: September 5th, 2022

AIMS AND SCOPE

Many problems in Artificial Intelligence show an exponential
explosion of the search space. Although stemming from different
research areas in AI, such problems are often addressed with
algorithms that have a common goal: the effective exploration of
huge state spaces. Many algorithms developed in one research area
are applicable to other problems, or can be hybridized with
techniques in other areas. Artificial Intelligence tools often
exploit or hybridize techniques developed by other research
communities, such as Operations Research. In recent years, research
in Artificial Intelligence has more and more focused on experimental
evaluation of algorithms, the development of suitable methodologies
for experimentation and analysis, the study of languages and the
implementation of systems for the definition and solution of
problems.

Scope of the workshop is fostering the cross-fertilization of ideas
stemming from different areas, proposing benchmarks for new
challenging problems, comparing models and algorithms from an
experimental viewpoint, and, in general, comparing different
approaches with respect to efficiency, problem modeling, and ease of
development.

Topics of interest include, but are not limited to:
* Experimental evaluation of algorithms for
o knowledge representation
o automated reasoning
o planning
o scheduling
o machine learning
o model checking
o boolean satisfiability (SAT)
o constraint programming
o argumentation
o temporal reasoning
o combinatorial optimization
o quantified boolean formulae and quantified constraints
o modal logics
o logic programming
o answer set programming
o ontological reasoning
* Definition and construction of benchmarks
* Experimentation methodologies
* Metaheuristics
* Algorithm hybridization
* Static analysis of combinatorial problems
* Languages and systems for definition and solution of problems
* Comparisons between systems and algorithms
* Application experiences (visualization, graphics, security, transports,...)


WORKSHOP CHAIRS
Marco Maratea University of Genova, Italy
Mauro Vallati University of Huddersfield, UK


HOST ORGANIZATION AND VENUE
University of Genova, Italy

The workshop will take place in Genova Nervi, Italy, in the
Collegio Emiliani (http://www.collegioemiliani.it/), which is a college
directly situated on the see.

Of course, we will continuously monitor the pandemic situation in
order to evaluate whether the conference can be indeed held as an
in-person event, or we will need to switch to a hybrid event, if not
completely on-line.

SUBMISSIONS

Authors are invited to submit either original and non-original papers.

Publications showing negative results are welcome, provided that the
approach was original and very promising in principle, the
experimentation was well-conducted, the results obtained were
unforeseeable and gave important hints in the comprehension of the
target problem, helping other researchers to avoid unsuccessful
paths.

Workshop submissions must be in PDF format, do not exceed 15 (for
full papers) or 8 (for short papers) pages, and should be written in
LaTeX, using the LNCS style.

RCRA 2022 uses EasyChair for the submission of contributions.

Contributions must be submitted through this page:

https://easychair.org/conferences/?conf=rcra2022

All submissions will be reviewed by at least three members of the
program committee (TBD).

CONTACT
In case of need, the workshop co-chairs can be contacted by sending
an email to:
marco@dibris.unige.it,M.Vallati@hud.ac.uk


PROCEEDINGS

CEUR-WS Proceedings:
Accepted original papers will be published in the AIxIA series of CEUR-WS
AI*IA Series on CEUR-WS.org (upon authors confirmation)

Moreover, as in some previous editions (http://rcra.aixia.it/publications),
we are considering the possibility of having a special issue of an
international journal, provided that a sufficient amount of high quality
papers is collected. All technical papers, original and non-original, will
be eligible.

HISTORY OF THE RECENT WORKSHOP SERIES

* RCRA 2021 as a workshop of AI*IA 2021, Virtual
https://rcra2020.wordpress.com/
* RCRA 2020 as a workshop of AI*IA 2020, Virtual
https://rcra2020.wordpress.com/
* RCRA 2018 as a workshop of FLoC 2018, Oxford, UK
http://rcra.aixia.it/rcra~2018
Extended versions of the best papers will appear in a special
issue of Fundamenta Informaticae
* RCRA 2017 as a workshop of AI*IA 2017, Bari, Italy
http://rcra.aixia.it/rcra2017
Extended versions of the best papers will appear in a special
issue of Fundamenta Informaticae
* RCRA 2016 as a workshop of AI*IA 2016, Genova, Italy
http://rcra.aixia.it/rcra2016
Extended versions of the best papers will appear in a special
issue of JETAI
* RCRA 2015 as a workshop of AI*IA 2015, Ferrara, Italy
http://rcra.aixia.it/rcra2015
Extended versions of the best papers will appear in a special
issue of Fundamenta Informaticae
* RCRA 2014 as a workshop of SAT 2014, IJCAR 2014 and ICLP 2014,
Vienna, Austria -http://rcra.aixia.it/rcra2014
Extended versions of the best papers will appear in a special
issue of AI Communications
* Previous editions:http://rcra.aixia.it/workshops

**********************************************************
*
* 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] Lecturer/Senior Lecturer Position in Project Management

Kent Business School is seeking to appoint a Lecturer/Senior Lecturer in Project Management to join the Department of Analytics, Operations and Systems on either an Education and Research (E&R) or an Education, Scholarship and Professional Practice (ES&P) contract.

The successful applicant will lead and contribute to the delivery of Project Management modules at both undergraduate and postgraduate levels. In particular, the post holder will be expected to provide teaching in one or more of the following: Strategic Portfolio Management, Performance Management, Project Risk Management, and Project Management Office, or possibly new modules in the successful candidate's own area of expertise.

In addition to previous teaching experience, the post holder should have a clearly defined research or scholarship agenda with a track record or clear potential to publish in top peer-reviewed journals (E&R) or professional journals (ES&P). Evidence of income generation, research impact, scholarship, or corporate engagement is expected in the case of appointments to Senior Lecturer level. Although all cognate areas of Project Management will be considered, we are particularly interested in applicants with research or scholarship expertise in areas that the Department of Analytics, Operations and Systems is looking to grow, including (but not limited to) AI and business analytics in project management, digital technologies and social aspects in project management, behaviours in project risk, success factors in projects, governance of projects, and corporate strategies and capabilities to deliver projects.

Applicants who are keen to contribute to the development of key research themes within the School, including sustainability, healthcare, logistics, and transportation are particularly encouraged to apply.

The closing date for the position is 19 June 2022. For more information or to apply, please follow the link below.

https://jobs.kent.ac.uk/vacancy.aspx?ref=KBS-090-22

For informal discussion only, please contact Prof Jesse O'Hanley, Head of the Department of Analytics, Operations and Systems (j.ohanley@kent.ac.uk<mailto:j.ohanley@kent.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] OR2022: Early registration deadline approaching

OR 2022 - International Conference on Operations Research, Karlsruhe,
Germany, September 6-9, 2022, www.or2022.de

The early registration deadline is May 30th.

On behalf of the organization committee, it is my great pleasure of inviting
you to take part in the OR 2022 conference in Karlsruhe, Germany on 6-9
September, 2022. The organization committee is dedicated to hold the
conference in person. However, if we are forced by the pandemic situation,
then we have to switch to an online format. Please visit the conference
website for up-to-date information.

We are proud to present the following distinguished plenary and semi-plenary
speakers.

PLENARY Speakers:

John R. Birge (Chicago Booth, United States)

Victor Pankratius (Bosch Sensortec, Germany)

EURO-Talk Maria Grazia Speranza (University of Brescia, Italy)

SEMI-PLENARY Speakers:

Gabriele Eichfelder (Technische Universität Ilmenau, Germany),

Volker Kaibel (Universität Magdeburg, Germany),

Bahar Yetis Kara (Bilkent University, Turkey),

Nadia Lahrichi (Polytechnique Montréal, Canada),

Virginie Lurkin (University of Lausanne, Switzerland),

Stefan Pickl (Universität der Bundeswehr München, Germany),

Thomas Stützle (The Belgian F.R.S.-FNRS (National Science Foundation)),

Tjark Vredeveld (Maastricht University, The Netherlands),

Talk of the Winner of the 2022 GOR Company Award (to be announced).

Important dates:

Early registration deadline: Monday, May 30, 2022

Presenting author registration deadline: Wednesday, June 15, 2022

We look forward to welcoming you in Karlsruhe!

Steffen Rebennack (on behalf of the organization committee)

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

[DMANET] Deadline extension: AMAI Special Issue on Symbolic Computation in Software Science

Due to requests, the submission deadline for the special issue of the
Annals of Mathematics and Artificial Intelligence (AMAI) on Symbolic
Computation in Software Science has been extended to

June 13, 2022.

------------------------------------------------------------------
Call for submissions

Annals of Mathematics and Artificial Intelligence
Special Issue on Symbolic Computation in Software Science --
In the Era of Computational and Artificial Intelligence

https://www.risc.jku.at/people/tkutsia/organization/amai-scss.html
------------------------------------------------------------------

SCOPE
--------
In 2020, Annals of Mathematics and Artificial Intelligence (AMAI)
celebrated its 30th anniversary. Over the years, the journal has
promoted better understanding of the application of quantitative,
combinatorial, logical, algebraic and algorithmic methods to artificial
intelligence areas as diverse as decision support, automated deduction,
reasoning, knowledge-based systems, machine learning, computer vision,
robotics and planning. AMAI special issues are intended to be
collections of original research papers reflecting the intersection of
mathematics and a focused discipline demonstrating how each has
contributed greatly to the other. A further goal of the journal is to
close the gaps between the fields even further. Papers should report on
current research in the appropriate areas, as well as more retrospective
papers in which progress has been ongoing over a period of time.

The purpose of this special issue of AMAI is to promote research on
theoretical and practical aspects of symbolic computation in software
science, combined with recent artificial intelligence techniques.
Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful algorithms have been developed during the past decades for the
major subareas of symbolic computation: computer algebra and
computational logic. These algorithms and methods are successfully
applied in various fields, including software science, which covers a
broad range of topics about software construction and analysis.
Meanwhile, artificial intelligence methods and machine learning
algorithms are widely used nowadays in various domains and, in
particular, combined with symbolic computation. Several approaches mix
artificial intelligence and symbolic methods and tools deployed over
large corpora to create what is known as cognitive systems. Cognitive
computing focuses on building systems which interact with humans
naturally by reasoning, aiming at learning at scale.

The special issue is related to the topics of the The 9th International
Symposium on Symbolic Computation in Software Science - SCSS 2021.
Participants of the symposium, as well as other authors are invited to
submit contributions.


TOPICS
-------------------
This special issue focuses on advanced results on the topics that
include, but are not limited to, the following:

- software science-relevant applications of
* automated reasoning, knowledge reasoning, common-sense
reasoning, reasoning in science
* combinations of linguistic/learning-based and semantic/reasoning
methods
* algebras, co-algebras, categories, proof theory, model theory
* artificial intelligence and machine learning methods
- algorithm (program) analysis, synthesis, verification
- extraction of specifications from algorithms (programs)
- algorithm (program) transformation
- formal methods for network and system security
- programming models
- formalization and computerization of knowledge; large-scale computer
understanding of mathematics and science
- alignment and joint processing of formal, semi-formal, and informal
libraries
- formal verification of artificial intelligence and machine learning
algorithms, explainable artificial intelligence, symbolic artificial
intelligence
- cognitive computing, cognitive vision, perception systems and
artificial reasoners for robotics
- computational origami


SUBMISSION
-----------
This special issue welcomes original high-quality contributions that
have been neither published in nor simultaneously submitted to any
journals or refereed conferences. Submissions will be peer-reviewed
using the standard refereeing procedure of the Annals of Mathematics and
Artificial Intelligence.

Submitted papers must be in English, prepared in LaTeX according to the
guidelines of the journal:
https://www.springer.com/journal/10472/submission-guidelines.

PDF versions of papers should be uploaded at the submission page

https://www.editorialmanager.com/amai

by June 13, 2022.

Please choose S710: SCSS - Symbolic Computation in Software Science when
you will be selecting the article type.


GUEST EDITORS
--------------------
Adel Bouhoula (Arabian Gulf University, Bahrain)
Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria)
Tetsuo Ida (University of Tsukuba, Japan)
Temur Kutsia (RISC, Johannes Kepler University Linz, 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] Two Lecturer/Senior Lecturer Positions in Business Analytics

Kent Business School is seeking to appoint two Lecturer/Senior Lecturer in Business Analytics positions in the Department of Analytics, Operations and Systems on either an Education and Research (E&R) or an Education, Scholarship and Professional Practice (ES&P) contract.

The successful applicant will lead and contribute to the delivery of Business Analytics modules at both undergraduate and postgraduate levels. In particular, the post holder will be expected to provide teaching in one or more of the following: data analytics, statistics, decision analysis, Soft OR, advanced spreadsheet modelling, simulation, performance management, project management, optimisation, or possibly new modules in the successful candidates' own area of expertise.

In addition to previous teaching experience, the post holders should have a clearly defined research or scholarship agenda with a track record or clear potential to publish in top peer-reviewed journals (E&R) or professional journals (ES&P). Evidence of income generation, research impact, scholarship or corporate engagement is expected in the case of appointments to Senior Lecturer level. Although all cognate areas of Business Analytics will be considered, we are particularly interested in applicants with research or scholarship expertise in areas that the Department of Analytics, Operations and Systems is looking to grow, including (but not limited to) decision analysis, simulation, Soft OR, Systems Thinking, performance management, and optimisation.


Applicants who are keen to contribute to the development of key research themes within the School, including sustainability, healthcare, logistics, and transportation are particularly encouraged to apply.

The closing date for the position is 19 June 2022. For more information or to apply, please follow the link below.

https://jobs.kent.ac.uk/Vacancy.aspx?ref=KBS-089-22

For informal discussion only, please contact Prof Jesse O'Hanley, Head of the Department of Analytics, Operations and Systems, (j.ohanley@kent.ac.uk<mailto:j.ohanley@kent.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/
*
**********************************************************

Tuesday, May 24, 2022

[DMANET] Reachability Problems 2022, Kaiserslauter (Deadline: Jun 28, 2022)

RP 2022: The 16th International Conference on Reachability Problems
Oct 17 - Oct 21, 2022 (Kaiserslauter)
https://rp2022.mpi-sws.org/

Regular paper (for LNCS Proceedings):
Submission deadline: Jun 28, 2022
Notification Due: Aug 1, 2002
Final Version Due: Aug 8, 2002

Informal Presentation:
Deadline: July 31, 2022
Notification: August 8, 2022

Call For Papers

The 16th International Conference on Reachability Problems (RP'22) will be organised by the Max Planck Institute for Software Systems (MPI-SWS) and the University of Kaiserslautern. In 2020 and 2021 the conference was virtual due to COVID restrictions, and this year RP will be organised as a physical meeting in Kaiserslautern, offering a possibility to authors with travel restrictions to give online presentations. The conference proceedings will be published in Springer's Lecture Notes in Computer Science (LNCS). A selection of articles among the contributed papers will be invited to a special issue of a journal.

Confirmed Invited Speakers:
-Wojciech Czerwinski
-Michael Benedikt
-Rupak Majumdar
-Laura Ciobanu

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. This will also be the occasion to review recent breakthroughs by renowned invited experts and survey emerging trends and emphasise on key open challenges. Participants are kindly encouraged to discuss core scientific issues that need to be further tackled.

TOPICS
The conference is specifically aimed at gathering scholars from diverse disciplines and backgrounds interested
in wide range of Theoretical Computer Science areas related reachability problems:

● Algebraic structures
● Automata theory and formal languages
● Computational game theory
● Concurrency and distributed computation
● Decision procedures in computational models
● Graphs and dynamical networks
● Hybrid dynamical systems
● Logic and model checking
● Verification of finite and infinite-state systems

Topics of interest include (but are not limited to):
- reachability problems in infinite-state systems,
- rewriting systems, dynamical and hybrid systems;
- reachability problems in computational games and distributed systems;
- reachability problems in dynamical networks,
- reachability problems in logic and verification;
- reachability problems in formal methods;
- reachability analysis in different computational models,
counter timed/ cellular/ communicating automata;
- Petri nets; computational and combinatorial aspects of algebraic structures
(semigroups, groups and rings);
- frontiers between decidable and undecidable reachability problems;
- predictability in iterative maps and new computational paradigms.

GUIDELINES FOR SUBMISSION. There are two categories of submissions:

REGULAR PAPERS

Authors are asked to submit their papers through EasyChair.
https://easychair.org/conferences/?conf=reach2022

PRESENTATIONS ONLY
In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to submit a paper which recently appeared (or which is going to appear) in proceedings of another conference, or which has not yet been submitted. Neither the paper nor the abstract will be published in the proceedings.

IMPORTANT DATES
Regular papers
Full papers: June 28, 2022
Notification: August 1, 2022
Final Version: August 8, 2022

Presentation-only papers
Abstracts: July 31, 2022
Notification: August 8, 2022

RP Conference: October 17-21, 2022

Conference chairs:
- Anthony W. Lin, University of Kaiserslautern - co-chair
- Georg Zetzsche, Max Planck Institute for Software Systems (MPI-SWS) - co-chair
- Igor Potapov, University of Liverpool - Publication chair

PROGRAM COMMITTEE:

- C. Aiswarya (Chennai Mathematical Institute, IN)
- Mohamed Faouzi Atig (Uppsala University, SE)
- Udi Boker (Interdisciplinary Center (IDC) Herzliya, IL)
- Benedikt Bollig (CNRS, LMF, ENS Paris-Saclay, FR)
- Michaël Cadilhac (DePaul University, US)
- Yu-Fang Chen (Academia Sinica, TW)
- Stéphane Demri (CNRS, LMF, ENS Paris-Saclay, FR)
- Moses Ganardi (MPI-SWS, DE)
- Julian Gutierrez (Monash University, AU)
- Christoph Haase (University of Oxford, UK)
- Peter Habermehl (IRIF, Université Paris Cité, FR)
- Piotr Hofman (University of Warsaw, PL)
- Naoki Kobayashi (University of Tokyo, JP)
- Dietrich Kuske (TU Ilmenau, DE)
- Jérôme Leroux (CNRS, LaBRI, Université de Bordeaux, FR)
- Anthony W. Lin (University of Kaiserslautern, DE)
- K. Narayan Kumar (Chennai Mathematical Institute, IN)
- Guillermo Perez (University of Antwerp, BE)
- Igor Potapov (University of Liverpool, UK)
- Gabriele Puppis (Udine University, IT)
- Karin Quaas (University of Leipzig, DE)
- Krishna S (IIT Bombay, IN)
- Mahsa Shirmohammadi (CNRS, IRIF, Université Paris Cité, FR)
- Daniel Stan (University of Kaiserslautern, DE)
- Alwen Tiu (Australian National University, AU)
- Zhilin Wu (Chinese Academy of Sciences, CN)
- Georg Zetzsche (MPI-SWS, DE)

STEERING COMMITTEE
Parosh Aziz Abdulla (SE)
Olivier Bournez (FR)
Vesa Halava (FI)
Alain Finkel (FR)
Oscar Ibarra (USA)
Juhani Karhumaki (FI)
Jérôme Leroux (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] FLoC Workshop on Logic-Based Methods in Machine Learning (LMML 2022) Call for Spotlight Talks

The workshop on Logic-based Methods in Machine Learning (LMML 2022) is a satellite workshop of the Federated Logic Conference (FLoC 2022) and will take place on July 31, 2022, in Haifa, Israel.

CALL FOR SPOTLIGHT TALKS

The workshop program will consist of invited talks and contributed spotlight talks of 10 minutes.

If you are interested in giving a spotlight talk, please submit an extended abstract (3 pages) on Easychair by June 7, 2022 (AoE) under the following link:

https://easychair.org/conferences/?conf=lmml2022

Speakers will be notified by June 15 about acceptance. Since the workshop will not publish any archival proceedings, the submission of extended abstracts of papers that have been published or submitted elsewhere is welcome. Speakers with accepted contributions are expected to register for the workshop and to give the spotlight talk at the workshop.

TOPICS AND AIMS

The far-reaching success of Machine Learning (ML) motivates an ever-growing range of applications. However, the most successful ML models are opaque ("black-box") because they do not support the explainability or verifiability of their predictions. Recent years have witnessed the emergence of several successful and promising approaches to overcome these limitations with the help of logic-based techniques, including the well-developed technologies of SAT/CP-assisted reasoning and optimization, including the well-developed technologies of SAT-, MaxSAT-, SMT-, and MIPS-solving, constraint optimization, and Model Counting.

This workshop aims at bringing together researchers from various fields that work on SAT-based methods for (i) learning interpretable ML models, (ii) computing explanations for black-box ML models, and (iii) verification of black-box ML models.

ORGANIZERS

Alexey Ignatiev, Monash University, Melbourne, Australia
Stefan Szeider, TU Wien, Vienna, Austria

FURTHER INFORMATION

https://ac.tuwien.ac.at/LMML2022/
https://www.floc2022.org


**********************************************************
*
* 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] Algorithms Teacher Position in Lahore, Pakistan - Summer 2022

We are seeking a highly motivated teacher for algorithms and programming
courses at the Sundar STEM School (https://www.sundarstem.edu.pk/) in
Lahore, Pakistan. Sundar is Pakistan's first specialized high school with a
focus on algorithmic problem solving and preparing the nation's top
students for attendance at the International Olympiad in Informatics (IOI).
The teacher's role is to mentor high-school students who are relatively new
to algorithms and coding and cover a wide range of topics in discrete
mathematics, graph theory, basic algorithms and C++ programming. This will
entail ~4.5 hours of teaching and doubt-clearing per day. Some of our
students have already gone through one year of extensive training and
others are just joining this summer. We prefer applicants who are either
PhD students/graduates in theoretical computer science or have a strong
background in competitive programming or IOI, ICPC and similar Olympiads.

The position will be based at our campus in Lahore, one of the oldest and
most fascinating cities in Asia, with an unbeatable cultural and culinary
scene. This is a two-month full-time position during the summer. Our school
hours are until 3 pm, so the teacher will have the afternoons free. The
salary range is 300-400 USD per week for a pre-doctoral teacher and 700-800
USD per week for a teacher with a PhD. The exact amount would be determined
based on the teacher's CV and experience. Food, accommodation and a return
ticket will be provided by the school and the applicable taxes are also
covered by our side.

To apply, please send your CV to goharshady@gmail.com. Please explicitly
mention any previous teaching experience and your availability during the
summer.

**********************************************************
*
* 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: Graph Drawing and Network Visualization - GD 2022

Sorry if you have received multiple copies of this email
================================================================

Call for Papers

GD 2022

30th International Symposium on
Graph Drawing and Network Visualization

September 13-16, 2022 - Tokyo, Japan
https://graphdrawing.github.io/gd2022/

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

This is a gentle reminder that the deadline for submitting your papers to GD 2022 is approaching:
Abstract submission deadline: June, 1st
Paper submission deadline: June, 8th.

Given the current status of the restrictions in Japan, the conference will be held in online hybrid mode. All authors will be given the possibility to present their work from remote. The organization committee is also preparing for an on-site component, but this possibility cannot be confirmed at the current stage. Please find more information at:

https://graphdrawing.github.io/gd2022/pages/news/

Please recall that, for the first time in the GD conference, this year the review process will be handled in a "lightweight double-blind mode": authors are not allowed to reveal their identity in the submitted paper, but are free to disseminate draft versions of the paper prior to the conference and to give talks on the topic as they normally would.

More details can be found in the full call for papers, which can be accessed at the following links and is reported below for your convenience:

HTML version on the conference website:
https://graphdrawing.github.io/gd2022/pages/cfp/

PDF version:
https://graphdrawing.github.io/gd2022/assets/pdfs/CallforPapers2022.pdf


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

CALL FOR PAPERS
------

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering.

GD has been the main annual event in this area for about 30 years. Its focus is on combinatorial and algorithmic aspects of graph drawing, as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute papers and posters and to participate in the symposium and the graph drawing contest.

GD 2022 will be held at the Tokyo Institute of Technology, Japan, on September 13-16, 2022, with a reception on the evening of September 13. A pre-conference PhD school is planned for September 12-13, 2022.
While we hope that a physical conference will be possible, details of the exact format of the venue (onsite, online, hybrid) will be announced before the submission deadline. Regardless of the format, we are committed to offering remote participation for both presenters and the audience.

The code of conduct for the GD conference can be found at
http://graphdrawing.org/codeOfConduct.html

PAPERS
------

We invite authors to submit papers describing original research of theoretical or practical significance to graph drawing and network visualization.
To promote a balanced coverage of the field, GD has two distinct tracks, and papers submitted to one track will not compete with papers submitted to the other track. Regular papers must be submitted explicitly to one of the two tracks. However, all program committee members may review papers from either track.


Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as combinatorial aspects and algorithm design. The range of topics for this track includes (but is not limited to):
* Design and analysis of graph drawing algorithms
* Geometric and topological graph theory
* Computational topology of graphs on surfaces
* Geometric network design and optimization
* Geometric computing

Track 2: Experimental, applied, and network visualization aspects
--------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing, such as the development and evaluation of network visualization algorithms, systems, and interfaces in different application areas. The range of topics for this track includes (but is not limited to):
* Visualization of networks in real world applications
* Engineering of graph drawing algorithms and network visualization systems
* Benchmarks and experimental studies of algorithms, systems, and user interfaces for graph drawing and network visualization
* Cognitive studies on network visualization readability and user interaction
* Interfaces and methods for interacting with graphs and networks

Authors of accepted applied papers can request the opportunity to show a demo of their software/system during the poster session.

Short papers
------------

In addition to the above two tracks, there will be a separate category for short papers, describing theoretical or applied contributions of shorter length. Papers in this category will be assigned a shorter time for presentation during the conference.

Submission format
-----------------

All submissions must be formatted using the appropriate LaTeX style file, either gd-llncs.cls<https://graphdrawing.github.io/gd2022/assets/template/gd-llncs.cls> for long papers or gd-llncs-short.cls<https://graphdrawing.github.io/gd2022/assets/template/gd-llncs-short.cls> for short papers; these are derived from the style file used for the conference series Lecture Notes in Computer Science (LNCS) provided by Springer. The default margins and fonts must not be modified; in particular, the use of packages such as times.sty is not allowed. Submissions that do not comply with this format risk rejection without consideration of their merits.

To promote inclusion of figures in the submitted papers, submissions will have a strict number of lines limit. Regular papers must have at most 400 lines and at most 14 pages (excluding references). Short papers must have at most 225 lines and at most 7 pages (excluding references).
When counting the lines, the following sections should be excluded: title, authors block, keywords, references. For figures, tables, and algorithm pseudo-code, only the lines of the main caption should be counted. Lines in all the rest of the paper should be counted, including the abstract.
The claims of the paper should be fully substantiated. If this information does not fit within the line/page limits, the authors should include it in a clearly marked appendix, whose length is not constrained and which the reviewers may read at their own discretion.

All submissions will be handled through EasyChair at the web site https://easychair.org/conferences/?conf=gd2022

Posters & Contest
-----------------

Submissions of posters on graph drawing, network visualization, and related areas are solicited. The poster session will provide a forum for the communication of late-breaking research results (which may also appear elsewhere) to the GD community. Authors of posters should prepare an abstract (up to 2 pages in the LNCS style) that must be submitted together with the poster itself.

Details about the traditional Graph Drawing Contest held at the conference are provided on the conference web site https://graphdrawing.github.io/gd2022/pages/contest/

LIGHTWEIGHT DOUBLE-BLIND REVIEW PROCESS
--------------------------------

This year, for the first time in the GD conference, the review process will be handled in a "lightweight double-blind mode". This means that authors are not allowed to reveal their identity in the paper that they submit to GD'22, but are free to disseminate draft versions of the paper prior to the conference and to give talks on the topic as they normally would. In particular, the submitted paper should not contain authors' names, affiliations, and email addresses. References to their own related work are allowed, as long as the supporting text maintains anonymity (e.g., using sentences in the third person, anonymising references).

Members of the Program Committee will not have the identity of the authors of any paper revealed to them during the entire review process. To handle conflicts of interest effectively, authors will be offered the opportunity to declare conflict of interest with relevant PC members when they submit their paper.


PUBLICATION: PROCEEDINGS AND SPECIAL ISSUES
-----------------------

All accepted papers (including the two-page poster abstracts) will appear in the conference proceedings, published by Springer in the Lecture Notes in Computer Science (LNCS) series. The LNCS proceedings will be made freely accessible to the GD community upon publication and openly accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv repository at the same time as submitting their camera-ready versions, in order to provide immediate and unrestricted open access to them. The self-archived arXiv papers shall consist of the LNCS proceedings version (identical, except for possibly changed references to the appendix resp. the arXiv version) plus an optional clearly marked appendix. This appendix could contain a long version of the entire paper or proofs that have been omitted from the main text. Subsequent submissions of revised versions of the paper to the arXiv (known as arXiv "replacements") are allowed. Upon submission of the camera-ready version of an accepted paper, the authors will be required to specify the arXiv identifier associated with the paper for inclusion in a conference index, which will be also published in the arXiv repository. Failure to comply with these guidelines will impede the publication of the paper.

Each paper or poster must be presented at the conference by an author (barring unforeseen circumstances), otherwise the paper will not be included in the proceedings. Should any visa/travel restriction prevent an author from attending the conference and presenting a paper, he/she will be given ways to participate and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a special issue of the Journal of Graph Algorithms and Applications (JGAA). The authors of two selected papers in Track 2 will be invited to submit a substantially extended and enhanced version of their work to IEEE Transactions on Visualization and Computer Graphics (TVCG). Invitations to the special issues will be sent at most two weeks after the conference.

A TVCG papers session at the Graph Drawing conference will also feature regular TVCG papers. Please find more details at
https://www.computer.org/digital-library/journals/tvcg/tvcg-partners-with-conferences


AWARDS
------

For each of the two tracks, the Program Committee of GD 2022 will bestow a Best Paper Award. In addition, to recognize the effort of participants to present their work and to prepare their posters in a clear and elegant way, there will be a Best Presentation Award and a Best Poster Award voted on by the GD 2022 attendees.

IMPORTANT DATES
---------------

Abstract submission deadline June 1 (23:59 PDT)
Paper submission deadline June 8 (23:59 PDT)
Notification of paper acceptance July 18
Poster submission deadline August 10 (23:59 PDT)
Notification of poster acceptance August 19
Final versions due September 5 (23:59 PDT)
Contest submission deadline September 6 (23:59 PDT)
Symposium September 13-16
Invitations to special issues September 30

INVITED SPEAKERS
----------------

Ulrik Brandes, ETH Zurich, Switzerland
Kazuo Misue, University of Tsukuba, Japan

PROGRAM COMMITTEE
-----------------

Patrizio Angelini (co-chair), John Cabot University, Italy
Therese Biedl, University of Waterloo, Canada
Sabine Cornelsen, Universität Konstanz, Germany
Giordano Da Lozzo, Roma Tre University, Italy
Stephan Diehl, Universität Trier, Germany
Henry Förster, Universität Tübingen, Germany
Martin Gronemann, TU Wien, Austria
Yasuhiro Hashimoto, The University of Aizu, Japan
Michael Hoffmann, ETH Zurich, Switzerland
Hiroshi Hosobe, Hosei University, Japan
Yifan Hu, Yahoo! Research, USA
Takayuki Itoh, Ochanomizu University, Japan
Philipp Kindermann, Universität Trier, Germany
Karsten Klein, Universität Konstanz, Germany
Stephen Kobourov, University of Arizona, USA
Jan Kratochvíl, Charles University of Prague, Czech Republic
Kim Marriott, Monash University, Australia
Irene Parada, TU Eindhoven, The Netherlands
Sergey Pupyrev, Facebook, US
Helen Purchase, University of Glasgow, Scotland
Arnaud Sallaberry, LIRMM, Université Paul-Valéry Montpellier, France
Ingo Scholtes, University of Zurich, Switzerland
Falk Schreiber, Universität Konstanz, Germany
André Schulz, FernUniversität in Hagen, Germany
Andrew Suk, University of California San Diego, USA
Antonios Symvonis, National Technical University of Athens, Greece
Alessandra Tappini, University of Perugia, Italy
Meirav Zehavi, Ben-Gurion University, Israel
Reinhard von Hanxleden (co-chair), Christian-Albrechts-Universität zu Kiel, Germany
Tatiana von Landesberger, Universität Köln, Germany


ORGANIZING COMMITTEE
--------------------

Takayuki Itoh (chair), Ochanomizu University, Japan
Ken Wakita, Tokyo Institute of Technology, Japan
Masahiko Itoh, Hokkaido Information University, Japan
Hsiang-Yun Wu, St. Pölten University of Applied Sciences, Austria
Rina Nakazawa, IBM Research, Japan
Yuri Miyagi, National Institute of Advanced Industrial Science and Technology (AIST), Japan


CONTEST COMMITTEE
-----------------

Philipp Kindermann (chair), Universität Trier, Germany
Tamara Mchedlidze, Utrecht University, The Netherlands
Wouter Meulemans, TU Eindhoven, The Netherlands


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

[DMANET] IEEE BCCA 2022: IEEE Blockchain conference [Extended Deadline] SAN ANTONIO, TEXAS, USA

*The Fourth International Conference on Blockchain Computing and
Applications (BCCA 2022)*

*SEP. 05 – 07, 2022 – SAN ANTONIO, TEXAS, USA*

http://intelligenttech.org/BCCA2022/index.php

Blockchain is a revolutionary technology in decentralized systems that
enables secure decentralized transaction processing while ensuring data
privacy and authenticity. It is now playing a significant role in several
areas such the Internet of Things, supply-chain management, manufacturing,
cyber-physical systems, healthcare systems, and much more. Unlike
centralized transaction processing solutions, blockchain uses a distributed
ledger mechanism to record data transactions on multiple devices, this will
prevent data breach, identity theft, and a plethora of cyber-related
attacks, in essence, leading to a sustainability in data privacy and
security. This conference aims at to attract work of both researchers and
practitioners in the area of cyber-security to share and exchange their
experiences and research studies in both academia and industry in the field
of blockchain.

Researchers are encouraged to submit original research contributions in all
major areas, which include, but not limited to:

· *Track 01: Artificial Intelligence and Machine Learning*

o Blockchain based artificial Intelligent Systems applications in
Computers and Communications

o Blockchain based AI and Robotics Technologies

o Blockchain based AI and cloud computing

o Blockchain based Economic paradigms and game theory

o Blockchain based Machine and Deep Learning of Knowledge

o Blockchain based Distributed Knowledge and Processing

o Blockchain based Humans-Agents Interactions / Human-Robot Interactions

· *Track 02: IoT and Cyber-Physical Systems*

o Blockchain-based IoT Applications and Services

o Blockchain-based security for the Internet of Things and cyber-physical
systems

o Blockchain-based Internet of Things architectures and protocols

o Blockchain in Cyber Physical Systems (CPS)

o Blockchain-based application in Intelligent Manufacturing: Industrial
Internet of Things,

o Blockchain and Secure Critical Infrastructure with Industry 4.0

o Intelligent manufacture and management

o Consensus and mining algorithms suited for resource-limited IoTs

o Blockchain-based Controlled mobility and QoS

o Blockchain-based energy optimization techniques in WSN

o Blockchain-based Software defined networks

· *Track 03: Big Data*

o Blockchain in Data Fusion

o Blockchain Analytics and Data mining

o Distributed data store for blockchain

o Distributed transaction for blockchain

o Blockchain based Data Science and Data Engineering

o Protocols for management and access using blockchains

o Blockchain architectures tailored for domain-specific applications

· *Track 04: Security and Privacy on the Blockchain*

o Authentication and authorization in Blockchain

o Applications of blockchain technologies in digital forensic

o Privacy aspects of blockchain technologies

o Blockchain-based threat intelligence and threat analytics techniques

o Blockchain-based open-source tools

o Forensics readiness of blockchain technologies

o Blockchain Attacks on Existing Systems

o Blockchain Consensus Algorithms

o Blockchain-based Intrusion Detection/Prevention

o Security and Privacy in Blockchain and Critical Infrastructure

o Attacks on Blockchain and Critical Infrastructure

o Blockchain and Secure Critical Infrastructure with Smart Grid

· *Track 05: Blockchain Research & Applications for Innovative Networks and
Services*

o State-of-the-art of the Blockchain technology and cybersecurity

o Blockchain-based security solutions of smart cities infrastructures

o Blockchain in connected and autonomous vehicles (CAV) and ITS)

o Blockchain Technologies and Methodologies

o Recent development and emerging trends Blockchain

o New models, practical solutions and technological advances related to
Blockchain

o Theory of Blockchain in Cybersecurity

o Applications of blockchain technologies in computer & hardware security

o Implementation challenges facing blockchain technologies

o Blockchain in social networking

o Performance metric design, modeling and evaluation of blockchain systems

o Network and computing optimization in blockchains

o Experimental prototyping and testbeds for blockchains

All accepted papers in BCCA 2022 will be submitted to IEEEXplore, dblp and
Scopus for inclusion.

*General Co-Chair*

· Giancarlo Fortino, University of Calabria, Italy

· Yaser Jararweh, Duquesne University, USA

*Program Co-Chairs*

· Izzat Alsmadi, Texas A&M, San Antonio, USA

· Önder Gürcan, CEA LIST, Paris-Saclay University, France

· Moayad Aloqaily, MBZUAI, UAE

* Submission Link: *https://easychair.org/conferences/?conf=bcca2022

*Full paper Important Dates:*

- Paper submission deadline : May 5th, 2022 May 31st,2022
- Notification of paper acceptance: July 10th, 2022
- Submission of camera-ready papers due: August 1st, 2022

*Workshop Important Dates:*

- Proposal submission deadline: May 30th, 2022
- Proposal acceptance notification: June 7th, 2022

*Tutorials/Demos Important dates:*

- Tutorial Proposal Submission Deadline: June 3rd, 2022
- Notification of acceptance: June 17th, 2022

**********************************************************
*
* 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] FILOFOCS 2022 - June 15-16, Tel-Aviv University

call for participation

FILOFOCS 2022
15-16 June 2022, Tel-Aviv University


The 9th French-Israeli Workshop on Foundations of Computer Science (FILOFOCS 2022) will take place on June 15-16, 2022 at Tel-Aviv University.
This is the 9th workshop in the FILOFOCS workshop series, taking place in the framework of the French-Israeli Laboratory on Foundations of Computer Science, a joint laboratory of the CNRS, Universite Paris Cite, Tel-Aviv University, the Hebrew University of Jerusalem, and the Weizmann Institute of Science (see filofocs.org ).

Registration is free but mandatory by June 7, 2022 at: https://forms.gle/L8p1UkeJZeG1RfxA6 .

Speakers include:

• Simon Apers • Sophie Laplante
• Benny Applebaum • Nati Linial
• Yossi Azar • Yishay Mansour
• Allan Borodin • Pierre Meyer
• Janna Burman • Rotem Oshman
• Guy Even • Boaz Patt-Shamir
• Uri Feige • Ami Paz
• Michal Feldman • Vianney Perchet
• Pierre Fraigniaud • Liat Peterfreund
• Haim Kaplan • Yaniv Sadeh
• Amos Korman • Robin Vacus
• Robi Krauthgamer • Adrian Vladu
• Gregory Kucherov

The program and further information are available at the workshop's webpage at: https://www.filofocs.org/filofocs-2022 .

We are looking forward to seeing you at the workshop !

best regards,

Yishay Mansour and Adi Rosen
**********************************************************
*
* 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, May 23, 2022

[DMANET] 2nd CFP: 29th International Symposium on String Processing and Information Retrieval (SPIRE), November 8-10, 2022, Concepción, Chile

SPIRE 2022 - *29th International Symposium on String Processing and Information Retrieval*

November 8-10th, 2022, Concepción, Chile

http://spire2022.inf.udec.cl/

Abstract deadline: June 8th, 2022 (anywhere on Earth)

Paper deadline: June 15th, 2022 (anywhere on Earth)

Notification: August 12th, 2022

Camera-ready due: August 22th, 2020

Early bird registration: TBA

The Workshop on Compression, Text and Algorithms (WCTA) will be held on November 11th.

This year, SPIRE will also feature a tutorial on graph databases, see details below.


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

LOCATION

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

SPIRE 2022 will be held in the Faculty of Engineering of the Universidad de Concepción, in the city of Concepción, located next to the BioBio river and the Pacific ocean. Concepción is the second largest city in Chile and can be reached via direct flight from Santiago (about 45 minutes). Universidad de Concepción is the largest educational institution in the city, being also one of the most traditional and prestigious universities in Chile. Its beautiful campus is a touristic attraction by itself, with its famous campanil overlooking both the University and the city. The University hosts more than 20 thousand students in its three campuses, and it has become a symbol of pride for the city. Concepción is a vibrant city with many universities, shopping centers, and surrounded by beautiful nature and picturesque locations such as the Dichato beach (for swimming and seafood eating), Caleta Tumbes (with numerous seafood restaurants), Chiflón del Diablo (a former underground coal mine). Many touristic areas are also relatively close to Concepción, such as Termas de Chillán (a hot spring facility close to the Andes), Pucón (a city surrounded by several National Parks, lakes like Villarrica and Caburgua, hot springs, and the magnificent Villarrica Volcano), and Valdivia (a historical city, close to the sea and surrounded by rivers and a breathtaking natural scenery). Other touristic places in Chile (like San Pedro de Atacama, in northern Chile) can be reached via direct flight from Concepción. The conference will have a hybrid format (onsite + online), yet it can change to a full online format depending on the pandemic situation in November.


**********************************************
SCOPE
**********************************************

All aspects of string processing, information retrieval, computational biology, and related applications are covered. Typical topics of interest include (but are not limited to):

String Processing: string pattern matching, text indexing, data structures for string processing, text compression, compressed data structures, compressed string processing, text mining, 2D pattern matching, automata based string processing.

Information Retrieval (IR): retrieval models, indexing, evaluation, algorithms and data structures for IR, efficient implementation of IR systems, interface design, text classification and clustering, text analysis and mining, collaborative and content-based filtering, topic modeling for IR, search tasks (Web search, enterprise search, desktop search, legal search, cross-lingual retrieval, federated search, (micro) blog search, XML retrieval, multimedia retrieval), digital libraries.

Computational Biology: high-throughput DNA sequencing (assembly, read alignment, read error correction, metagenomics, transcriptomics, proteomics), evolution and phylogenetics, gene and regulatory element recognition, motif finding, protein structure prediction.


**********************************************
INVITED SPEAKERS
**********************************************

TBD


**********************************************
SUBMISSION
**********************************************

SPIRE' 22 invites submissions of long papers (up to 12 pages, excluding references and optional appendices) and short papers (up to 12 pages, excluding references). The reviewing process will be single-blind, namely each submission should be non-anonymous. The submission server will be EasyChair (https://easychair.org/my/conference?conf=spire2022). The proceedings will be published in the LNCS series of Springer-Verlag. The use of either LaTeX or Word LNCS templates is mandatory. Suitable templates are available at the Springer Website (https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines) and at Overleaf (https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj#.WsdHOy5uZpg). Do not change the margin size or the font, do not make a separate title page, etc.: use the LNCS style file as given. Simultaneous submission to other conferences with published proceedings is not permitted.


**********************************************
BEST PAPER
**********************************************

A Best Paper Award (1000EUR prize supported by Springer) will be given to the author(s) of the most outstanding work presented at the conference.


**********************************************
COMMITTEES
**********************************************

Program Committee Chairs:

Diego Arroyuelo (Universidad Técnica Federico Santa María and Millennium Institute for Foundational Research on Data, Chile)
Barbara Poblete (University of Chile and Amazon, USA)


Program Committee:

Amihood Amir, Bar-Ilan University
Ricardo Baeza-Yates, Northeastern University, Universitat Pompeu Fabra and University of Chile
Hideo Bannai, Tokyo Medical and Dental University
Altigran da Silva, Universidade Federal do Amazonas
Antonio Fariña, University of A Coruña
Gabriele Fici, University of Palermo
Travis Gagie, Dalhousie University
Pawel Gawrychowski, University of Wroclaw
Marcos Goncalves, Federal University of Minas Gerais
Inge Li Gørtz, Technical University of Denmark
Meng He, Dalhousie University
Wing-Kai Hon, National Tsing Hua University
Shunsuke Inenaga, Kyushu University
Dominik Köppl, Tokyo Medical and Dental University
Thierry Lecroq, University of Rouen Normandy
Zsuzsanna Lipták, University of Verona
Felipe A. Louza, Universidade Federal de Uberlândia
Giovanni Manzini, University of Pisa
Joao Meidanis, University of Campinas and Scylla Bioinformatics
Alistair Moffat, The University of Melbourne
Viviane P. Moreira, Instituto de Informatica - UFRGS
Gonzalo Navarro, University of Chile
Nadia Pisanti, University of Pisa
Solon Pissis, Centrum Wiskunde & Informatica
Nicola Prezza, Ca' Foscari University of Venice
Simon Puglisi, University of Helsinki
Rajeev Raman, University of Leicester
Kunihiko Sadakane, The University of Tokyo
Srinivasa Rao Satti, Norwegian University of Science and Technology
Marinella Sciortino, University of Palermo
Diego Seco, University of A Coruña
Sharma V. Thankachan, University of Central Florida
Rossano Venturini, University of Pisa
Nivio Ziviani, Federal University of Minas Gerais


Organizing Committee:

Cecilia Hernández (University of Concepción and Centre for Biotechnology and Bioengineering)
José Fuentes-Sepúlveda (University of Concepción)


Steering Committee:

Ricardo Baeza-Yates (Northeastern University, USA, Universitat Pompeu Fabra, Spain and University of Chile)
Christina Boucher (University of Florida, USA)
Nieves R. Brisaboa (University of A Coruña, Spain)
Thierry Lecroq (University of Rouen Normandy, France)
Simon J. Puglisi, (University of Helsinki, Finland)
Berthier Ribeiro-Neto (Google Inc. and Federal University of Minas Gerais,
Brazil)
Sharma Thankachan (University of Central Florida, USA)
Hélène Touzet (CNRS, Lille, France)
Nivio Ziviani (Universidade Federal Minas Gerais, Brazil)


**********************************************
Tutorial on Graph Databases
**********************************************

Speakers:
Aidan Hogan (University of Chile and Institute for Foundational Research on Data)
Domagoj Vrgoč (Pontificia Universidad Católica de Chile and Institute for Foundational Research on Data)

Date: TBA.

Abstract:
This tutorial will provide an introduction to graph databases, which have been gaining more and more attention in recent years, particularly for querying large-scale knowledge graphs. An interesting recent development in this area has been the application of text indexing and compression techniques to optimize graph queries at large scale. The tutorial will be divided into three parts. The first part will introduce and motivate graph databases in the broader context of data management, discussing their advantages (and disadvantages) compared with relational databases, their data models, their key applications, providing also a short demo of graph database engines in use. The second part of the tutorial will focus on querying graph databases, introducing the key primitives used for querying graphs, along with some popular graph query languages, before concluding with some high-level challenges for evaluating graph queries in an efficient manner. Towards addressing these challenges, the final part of the tutorial will introduce indexes and algorithms that enable the efficient evaluation of queries over graph databases, starting with more traditional techniques inspired by relational databases, progressing towards more modern algorithms and indexes; in this part, we will see some surprising applications of text compression and indexing techniques for querying graph databases efficiently (in terms of both time and space). See the website for more details (http://spire2022.inf.udec.cl/#section-tutorial).


**********************************************
CONTACT
**********************************************

For more information about the conference, please contact spire2022@easychair.org.

**********************************************************
*
* 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] The 13th Annual Uri N. Peled Memorial Lecture - Monday May 30, 2022 by Martin Milanič - Shifting paths to avoidable ones

You are cordially invited to attend on zoom

The 13th Annual Uri N. Peled Memorial Lecture

Date: Monday May 30, 2022 (zoom link below)
Time: 13:30 UK; 14:30 France; 15:30 Israel; 18:00 India;
9:30 Rio and Buenos Aires ; 8:30 New York; 7:30 Chicago

Speaker: Martin Milanič (University of Primorska, Koper, Slovenia)
Title: "Shifting paths to avoidable ones"

Abstract:

An *extension* of an induced path P in a graph G is an induced path P'
such that deleting the endpoints of P' results in P. An induced path in a
graph is said to be *avoidable* if each of its extensions is contained in
an induced cycle. In 2019, Beisegel, Chudnovsky, Gurvich, Milanič, and
Servatius conjectured that every graph that contains an induced k‐vertex
path also contains an avoidable induced path of the same length, and
proved the result for k = 2. The case k = 1 was known much earlier, due to
a work of Ohtsuki, Cheung, and Fujisawa in 1976. The conjecture was proved
for all k in 2020 by Bonamy, Defrain, Hatzel, and Thiebaut.

Using a similar approach, we strengthen their result from a
reconfiguration point of view. Namely, we show that in every graph, each
induced path can be transformed to an avoidable one by a sequence of
shifts, where two induced k-vertex paths are *shifts* of each other if
their union is an induced path with k + 1 vertices. We also obtain
analogous results for not necessarily induced paths and for walks. In
contrast, the statement cannot be extended to trails or to isometric paths.

This is joint work with Vladimir Gurvich, Matjaž Krnc, and Mikhail Vyalyi.

Note:
Uri Natan Peled ז"ל was a mathematician, friend, open-minded,
thoughtful, and generous person, author of many research papers,
journal guest editor, survey and book writer. He was a perfectionist
with the patience to wait for the right solution to an open problem before
committing to a final written version. Together with colleagues, his work
introduced many topics related to threshold graphs, as well as
mathematical works on Boolean functions, polyhedral combinatorics, and
information theory. He contributed much to the academic atmosphere at his
home institution, the University of Illinois at Chicago, and was a
frequent visitor to the Caesarea Rothschild Institute at the University of
Haifa. Prof. Peled died on September 5, 2009 at the age of 65. By this
annual lecture series, we honor his memory and his research work.


Forthcoming Topics in Algorithmic Gaph Theory Seminar Meetings

June 13, 2022 Nathan Wallheimer
"Improved Compression of the Okamura-Seymour Metric"
June 20, 2022 Abhiruk Lahiri
"The Graph Square Root Problem"
June 27, 2022 Rishikesh Gajjala
"Perfect matchings and Quantum Physics"

The seminar meets on Mondays at
Israel: 15:30 EU: 14:30 UK: 13:30 USA East coast: 8:30
Korea: 21:30 India: 18:00 Brazil and Argentina: 9:30


Feel free to pass this announcement on to interested trusted colleagues
and students, but please do not republish the zoom link externally.
The zoom link for this year:
Topics in Algorithmic Graph Theory
Zoom Meeting Link:

https://us06web.zoom.us/j/82694935491?pwd=SW1oYVl2WXJDVTJDUlRISjdjWGcwUT09
Meeting ID: 826 9493 5491
Passcode: 3.14159
**********************************************************
*
* 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 Extension] LAMAS & SR 2022 - Final Call for Contributions

[Apologies for multiple cross-posting]

[Deadline Extended to *June 5th (AoE)*]

--------------------------------------------------------------------------------
Final Call for Contributions

2nd International Workshop on
Logical Aspects in Multi-Agent Systems and Strategic Reasoning (LAMAS&SR)
2022
25-26 August 2022, Rennes, France
URL: https://lamassr.github.io/
--------------------------------------------------------------------------------

Objectives
----------

Logics and strategic reasoning play a central role in multi-agent systems.
Logics can be used, for instance, to express the agents' abilities,
knowledge,
and objectives. Strategic reasoning refers to algorithmic methods that
allow for
developing good behaviour for the agents of the system. At the
intersection, we
find logics that can express existence of strategies or equilibria, and can
be
used to reason about them.

The LAMAS&SR workshop merges two international workshops: LAMAS (Logical
Aspects
of Multi-Agent Systems), which focuses on all kinds of logical aspects of
multi-agent systems from the perspectives of artificial intelligence,
computer
science, and game theory, and SR (Strategic Reasoning), devoted to all
aspects
of strategic reasoning in formal methods and artificial intelligence.

List of Topics
--------------

The topics covered by the workshop include, but are not limited to:

* Logical systems for specification, analysis, and reasoning about
multi-agent systems
* Logic-based modelling of multi-agent systems
* Dynamical multi-agent systems
* Deductive systems and decision procedures for logics for multi-agent
systems
* Development and implementation of methods for verification in multi-agent
systems
* Logic-based tools for multi-agent systems
* Logics for reasoning about strategic abilities
* Logics for multi-agent mechanism design, verification, and synthesis
* Logical foundations of decision theory for multi-agent systems
* Strategic reasoning in formal verification
* Automata theory for strategy synthesis
* Applications and tools for cooperative and adversarial reasoning
* Robust planning and optimisation in multi-agent systems
* Risk and uncertainty in multi-agent systems
* Quantitative aspects in strategic reasoning

Invited Speakers
----------------

* Rineke Verbrugge, University of Groningen

Co-Located Event
----------------

LAMAS&SR 2022 will be an event co-located with the 14th International
Conference
on Advances In Modal Logic (AiML 2022, 22-25 August).

About COVID-19
--------------

Local organizers are following closely the evolution of the pandemic
situation.
Our preference is for a full in-person event, but we will employ an online
or
hybrid format according to the situation.

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

* Paper submission: (extended to) June 5 (AoE)
* Author notification: June 30 (AoE)
* Camera ready: July 15 (AoE)
* Workshop: August 25-26, 2022

Contribution Submission
-----------------------

Authors are invited to submit extended abstracts of 2 pages, plus 1 page for
references only, in the AAMAS 2022 format. Both published and unpublished
works
are welcome. Submissions are subject to a single-blind review process, thus,
submissions should not be anonymous, must be in PDF format, and will be
handled
via EasyChair at https://easychair.org/conferences/?conf=lamassr22

Although there will be no formal proceedings, accepted extended abstracts
will
be made available on the workshop website. Extensions of selected original
contributions will be then invited to a special issue of Games, an MDPI
open-access journal, with a special arrangement.

Program Co-Chairs
-----------------

* Fabio Mogavero, Università di Napoli Federico II
* Sophie Pinchinat, Université de Rennes 1

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

* Thomas Agotnes, University of Bergen
* Natasha Alechina, Utrecht University
* Guy Avni, University of Haifa
* Massimo Benerecetti, University of Naples Federico II
* Hans van Ditmarsch, Open University of Netherlands
* Valentin Goranko, Stockholm University
* Wojtek Jamroga, University of Luxembourg and Polish Academy of Sciences
* Dario Della Monica, University of Udine
* Emiliano Lorini, Université Paul Sabatier
* Nicolas Markey, Université de Rennes 1
* Bastien Maubert, University of Naples Federico II
* John-Jules C. Meyer, Utrecht University
* Aniello Murano, University of Naples Federico II
* Rohit J. Parikh, City University of New York
* Sasha Rubin, The University of Sydney, Australia
* Chenwei Shi, Tsinghua University
* Yanjing Wang, Peking University

Organising Committee
--------------------

* Sophie Pinchinat, Université de Rennes 1
* Dylan Bellier, Université de Rennes 1
* Pierre Le Scornet, Université de Rennes 1
* Sophie Maupile, Université de Rennes 1
* Alexandre Terefenko, Université de Rennes 1
* Fabio Mogavero, Università di 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/
*
**********************************************************

Sunday, May 22, 2022

[DMANET] Professor post in Computer Science and Mathematics at the University of Warwick

Opening: Professor in Computer Science and Mathematics at the University
of Warwick
https://warwick.ac.uk/dimap/dimap_post_2022/

The University of Warwick invites applications for a Professor in the
area of Discrete Mathematics, in Algorithms and Complexity, in
Theoretical Computer Science, or in relevant areas on the interface of
Computer Science and Mathematics.

This is a permanent position based in two world leading departments, the
Department of Computer Science and the Warwick Mathematics Institute,
and the position is thought to enhance the collaboration between these
two departments, and to contribute to and lead the activities in the
DIMAP center. The successful applicant is expected to teach courses in
computer science or mathematics, conduct research in her/his field of
expertise and actively participate in other Computer Science and
Mathematics Departments, DIMAP, and university activities. Relevant
areas of interest include, but are not limited to, discrete mathematics,
combinatorics, graph theory, theoretical computer science, design and
analysis of algorithms and data structures, computational complexity.

In order to be considered, applications must be received by June 1, 2022
(Wednesday).

Together with a completed application form, candidates should submit a
Curriculum Vitae which includes a list of publications. Shortlisted
candidates will be requested to arrange for three reference letters to
be submitted to the University. It will be the responsibility of
shortlisted applicants to ensure that the reference letters are received
within 3 weeks of the request date.

Further details about the post can be found here:
https://warwick.ac.uk/dimap/dimap_post_2022/
**********************************************************
*
* 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, May 21, 2022

[DMANET] PhD position in Explainable Combinatorial Optimisation (TU Delft, The Netherlands)

We are seeking a highly motivated candidate to work on the intersection between combinatorial optimisation, AI, and explainability. The goal of the project is to develop novel combinatorial optimisation methods that not only exhibit excellent performance, but also concisely break down the main factors behind automated decision-making in a way that is easy for humans to interpret.


The candidate with join the newly formed XAIT Delft AI Lab alongside three other PhD students. The aim of the lab is to develop novel approaches that focus on the explainable aspect of artificial intelligence for transportation and other civil engineering problems and promote AI-related education. The position is for five years. The extra year compared to the usual four-year contract accommodates the 20% additional AI-related education related activities.


The PhD student will be supervised by Dr Emir Demirović and Dr. Gonçalo Correia at TU Delft (The Netherlands).


The deadline for applications is June 13. Candidates are strongly encouraged to submit their application before the deadline, as applications will be reviewed on a rolling basis. The aim is to conduct interviews and complete the hiring process by the beginning of July.


For more details, please see the formal ad: https://www.tudelft.nl/over-tu-delft/werken-bij-tu-delft/vacatures/details?jobId=6907&jobTitle=PhD%20position%20in%20Explainable%20Combinatorial%20Optimisation


Best,

Emir


--

Dr Emir Demirović

Assistant Professor

Delft AI XAIT Lab Co-Director<https://www.tudelft.nl/en/ai/xait-lab?languageSelect=UK&searchCriteria[0][key]=keywords&searchCriteria[0][values][]=XAITLab&searchCriteria[1][key]=Resultsperpage&searchCriteria[1][values][]=50>

Algorithmics group<https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/>, TU Delft

emirdemirovic.com<http://www.emirdemirovic.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/
*
**********************************************************

Friday, May 20, 2022

[DMANET] Student Symposium in Combinatorics 2022 (closing registration) & Panels

Hello everyone,

The Student Symposium in Combinatorics (SSC) is being held online between
May 30 and June 3 this year! The SSC is part of a collection of PhD Student
Research Symposia supported by MATRIX, a research institute for the
mathematical sciences in Australia, as well as by AMSI, AustMS, and the
UNSW School of Mathematics and Statistics. This is a place for
combinatorics students at all stages of their studies to present and
discuss their research to their peers around the world.

Registration (which is free!) is closing soon. If you're a combinatorics
student or a student who uses combinatorics in their research, we would
love to see you there and we would love it if you gave a talk!

Website: https://sites.google.com/view/2022-student-symposium-comb/

We also have several invited talks from PhD students around the world which
are open to everyone. If you cannot register for the whole symposium but
would like to attend these talks, please register using the following
Eventbrite:

https://www.eventbrite.com.au/e/ssc2022-plenary-speaker-talks-registration-310818074227

Also, as part of the symposium, we have two maths-focused panels that are
open to everyone to attend:

The first panel is titled "Moving from Mathematics to Industry", and
involves four panel members who have all moved from academia and are
currently working in industry. This panel will take place on Thursday 2nd
June 9:30 pm - 10:30 pm AEST (GMT+10).

The second panel is titled "A Strange Love: How I Learned to Stop Worrying
and Love Mathematics", and involves four panel members who have all had
successful careers in areas completely unrelated to maths before retraining
to become mathematicians. This panel will take place on Friday 3rd June
11:00 am - 12:00 pm AEST (GMT+10).

For more information on both panels and the panelists, please consult the
conference website! You must register for (free) tickets at the Eventbrite:

Panel descriptions:
https://sites.google.com/view/2022-student-symposium-comb/panels
Eventbrite:
https://www.eventbrite.com.au/e/ssc2022-panel-discussions-registration-336246070047

On behalf of the SSC organising committee,
Angus Southwell.

**********************************************************
*
* 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 1st International Workshop on Election Infrastructure Security

************************************************************************************
1st International Workshop on Election Infrastructure Security (EIS 2022)
In conjunction with the 27th European Symposium on Research in Computer
Security (ESORICS 2022)
September 26-30, 2022, Copenhagen, Denmark
(https://csis.gmu.edu/EIS-2022/)
************************************************************************************
Call for papers 1st International Workshop on Election Infrastructure
Security

*** Important Dates ***

- Paper submission due: June 30, 2022
- Notification to authors: July 30, 2022
- Camera ready due: August 10, 2022


**Scope**
This workshop aims at providing researchers and practitioners in different
areas of security (network security, cryptography, etc.), networking,
hardware architectures, software engineering, system engineering, machine
learning, and natural language processing with an interdisciplinary forum
to present, discuss, and exchange ideas that address the challenges of
current and next-generation Election Infrastructure systems. The workshop
seeks submissions from academia, government, and industry presenting novel
research results in all practical and theoretical aspects of Election
Infrastructure Security.

**Topics of Interest**

Topics of interest include, but are not limited to:

- Voter registration databases
- Voting machines
- Vote counting machines
- Electronic poll books
- Physical security of voting equipment
- Access control
- Security standards
- Disinformation & misinformation campaigns

**Submission Guidelines**
Submitted papers must not substantially overlap with papers that have been
published or simultaneously submitted to a journal or a conference with
proceedings. Contributions are not required to be anonymized, and are to be
made to the submission web site at http://www.easychair.org. Only PDF files
will be accepted.

The workshop proceedings will be published by Springer in the Lecture Notes
in Computer Science (LNCS) series. Submissions must be prepared in LaTeX
(recommended) or Microsoft Word using the LNCS template. Full papers must
be between 12 and 16 pages in length, and short papers must be between 6
and 11 pages. Authors are encouraged to include their ORCIDs.

**Guest Editors**
For further information, please contact the guest editors at
giancarlo.sperli@unina.it (Giancarlo Sperlì),
vincenzo.moscato@unina.it (Vincenzo
Moscato), malbanese@gmu.edu (Massimiliano Albanese).

**********************************************************
*
* 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 for the Special Issue Anomaly Detection in Cyber-Physical Systems on Elsevier Computer & Security Journal

************************************************************************************
Computers & Security
Elsevier (ISSN: 0167-4048)
Editor-in-Chief: Eugene H. Spafford
(https://www.journals.elsevier.com/computers-and-security)
************************************************************************************
Call For Papers for the Special Issue Anomaly Detection in Cyber-Physical
Systems on Elsevier Computer & Security Journal

*** Important Dates ***
Submission deadline: August 15, 2022
Peer reviews sent to authors: December 31, 2022
First revision of manuscripts due: February 30, 2022
Second round of reviews sent to authors: April 31, 2022
Second revision of manuscripts due: June 15, 2023
Final notifications sent to authors: July 15, 2023
Final accepted manuscripts due: July 31, 2023

**Scope**
The objective of this special issue is to investigate, analyze and address
challenging issues and emerging trends in Anomaly Detection for
Cyber-Physical Systems. To this aim, we solicit contributions on advanced
modeling and mining of Anomaly Detection for Cyber-Physical System,
including both theoretical and application-oriented studies promoting and
building explainable AI models. In particular, we encourage contributions
on the development of novel approaches based on advanced optimization
techniques and learning paradigms (e.g., online learning, reinforcement
learning, and deep learning) to enhance our understanding of complex
phenomena in Cyber-Physical System.

**Topics of Interest**
The topics of interest for this special issue include but are not limited
to:
(i) Supervised, Semi-supervised and unsupervised techniques for anomaly
detection in CPS;
(ii) Representation learning, Transfer learning, Sequence learning and
Reinforcement learning based methods for anomaly detection in CPS;
(iii) Explainable Artificial Intelligence techniques for anomaly detection
in CPS;
(iv) Game theory and Adversarial learning approach for anomaly detection in
CPS;
(v) Federated learning for anomaly detection in CPS;
(vi) Multi-dataset time series for anomaly detection in CPS;
(vii) Multi-dataset Time Series Anomaly Detection.

**Submission Guidelines**
Manuscripts must not have been previously published nor currently under
review by other journals or conferences. If prior work was published in a
conference, the submitted manuscript should include a substantial extension
of at least 35% novel contributions. In this case, authors are also
required to submit their published conference articles and a summary
document explaining the enhancements made in the journal version.

The submission website for this journal is located at
https://www.editorialmanager.com/cose/default.aspx. Please select
"VSI:Anomaly Detection in CPS" when you reach the "Article Type" step in
the submission process. To ensure that all manuscripts are correctly
identified, for consideration by the special issue, the authors should
indicate in the cover letter that the manuscript has been submitted for the
special issue on "Anomaly Detection in Cyber-Physical Systems".

**Guest Editors**
For further information, please contact the guest editors at
giancarlo.sperli@unina.it (Giancarlo Sperlì), vincenzo.moscato@unina.it
(Vincenzo Moscato), malbanese@gmu.edu (Massimiliano Albanese).

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