Wednesday, September 22, 2021

[DMANET] Metabolism and mathematical models: Two for a tango

Dear all,

This is the 1st announcement for a workshop titled "Metabolism and mathematical
models: Two for a tango" that will take place in a virtual way on November 18-19, 2021.

As the title indicates, the topic of the workshop is metabolism in general, with a special
focus, although not exclusive, on parasitology. Besides an exploration of the biological,
biochemical and biomedical aspects, the workshop will also aim at presenting some of
the mathematical modelling, algorithmic theory and software development that have
become crucial to explore such aspects.

More details will be provided soon but initial information may be already found on
this page:
https://team.inria.fr/erable/en/events/metabolism-and-mathematical-models-two-for-a-tango/.

As you can see, we'll be very happy to have six Keynote speakers:
Michael Barrett, University of Glasgow, Scotland;
Frédéric Bringaud, University of Bordeaux, France;
Fabien Jourdan, Inrae Toulouse, MetaboHUB, France;
Daniel Merkle, University of Southern Denmark, Denmark;
Daniel Segrè, Boston University, US;
Alena Zikova, Institute of Parasitology, Czech Academy of Sciences, Czech Republic.

The workshop will take place in the afternoons, from 2pm to 5:30pm CET time.
Registration is free but is required. To register, go to this link:
https://www.eventbrite.com/e/workshop-metabolism-and-mathematical-models-two-for-a-tango-tickets-175493324257

If you are interested, keep tuned, both on your mails for the 2nd announcement
with all information, and on the web page of the workshop.

Cheers from the organisers,
Ariel Silber (Dept. of Parasitology, Institute of Biomedical Sciences, Univ. of São Paulo, Brazil)
and Marie-France Sagot (Inria, CNRS and Univ. of Lyon 1, France)
**********************************************************
*
* 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: "Surveys in Algorithm Analysis and Complexity Theory" special issue of Algorithms

CALL FOR PAPERS:
"Surveys in Algorithm Analysis and Complexity Theory" -- A special issue of
Algorithms (ISSN 1999-4893)

This is a special issue consisting of surveys in theoretical computer science.
We invite original articles summarizing recent breakthroughs and/or describing
the state of the art in any currently active research area related to
algorithms, data structures, or computational complexity.
Articles should be well-structured, and each article should focus on a clearly
defined topic.
In addition, sufficient background, definitions, and figures should be provided
to ensure that the text will be accessible to anyone interested in theoretical
computer science.
Implementation-based surveys that compare the practical performance of various
algorithms for a particular computational problem are also invited.
We hope that the surveys published in this special issue will be useful for
other researchers and become highly cited in the near future.

Guest Editor:
Dr. Jesper Jansson, Kyoto University, Japan

Keywords:
* algorithm analysis
* modern data structures
* computational complexity
* fixed-parameter tractability
* approximation algorithms
* lower bounds
* bioinformatics algorithms
* computational geometry
* parallel and distributed computing
* quantum computing

Submission information:
Submitted manuscripts should not have been published previously nor be under
consideration for publication elsewhere.
All submissions will be thoroughly refereed through a peer-review process.
Manuscripts should be submitted online after registering and logging in.
Accepted articles will be published continuously in the journal (as soon as
accepted) and will be listed together on the special issue website.
A guide for authors and other information related to the submission of
manuscripts is available on the "Instructions for Authors"-page.
The article processing charges for publication in this open-access journal are
also listed on the journal's webpage.
We are glad to announce that the journal is offering an exceptional "early bird
discount" (100% discount) on the article processing charges for articles
submitted by 2021-11-15.

Deadline:
The deadline for manuscript submissions is 2022-06-30.

About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is an open-access journal of
computer science, computational mathematics, artificial intelligence,
automation and control systems, theory, methods and interdisciplinary
applications, data and information systems, and software engineering.
It is published online monthly by MDPI.

Journal webpage:
https://www.mdpi.com/journal/algorithms

Special issue main webpage:
https://www.mdpi.com/journal/algorithms/special_issues/survey_algorithm_complexity

Instructions for authors:
https://www.mdpi.com/journal/algorithms/instructions

Submission:
https://susy.mdpi.com/user/manuscripts/upload/?journal=algorithms



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

[DMANET] [Scheduling seminar] Leah Epstein (University of Haifa) | September 29 | The benefit of preemption

We are delighted to announce the talk given by Leah Epstein (University
of Haifa).

The title is "The benefit of preemption".

The seminar will take place on Zoom on Wednesday, September 29 at 13:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/97989356749?pwd=T2NzMkszN2Y1RDNNZExTc3p0SjJDdz09
<https://cesnet.zoom.us/j/97989356749?pwd=T2NzMkszN2Y1RDNNZExTc3p0SjJDdz09>

Meeting ID: 979 8935 6749
Passcode: 307940

You can follow the seminar online or offline on our Youtube channel as
well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

Given an input of a scheduling problem, any non-preemptive solution for
it can be used as a preemptive solution. Thus, the optimal cost of a
preemptive solution is not larger than that of an optimal non-preemptive
solution. As preemption comes at a cost in real-life applications, it is
of interest to find the worst-case ratio between the two costs. For a
given problem, the supremum ratio over all possible inputs of the ratio
between the two costs (of an optimal solution without preemption and an
optimal solution that possibly uses preemption) is called the power or
benefit of preemption. While many scheduling variants can be studied
with respect to this measure, we will focus on the cases of a single
machine, parallel identical machines, and uniformly related machines,
and we will discuss the objectives of makespan and total (weighted)
completion time. We will exhibit how one can benefit from preemption,
and we will analyze the resulting worst case ratios for several basic
models.

The next talk in our series will be given by

Federico Della Croce (DIGEP - Polito.it) | October 13 | The Longest
Processing Time Rule for Identical Parallel Machines Revisited.

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua

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


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

Tuesday, September 21, 2021

[DMANET] Denes Konig Prize Call for Nomination

Do you know a colleague in the early stages of their career who has made an outstanding contribution to the field of discrete mathematics? SIAM is currently accepting nominations for the Denes Konig Prize!

This prize will be awarded in 2022 at the next SIAM Conference on Discrete Mathematics.


Click the link below for the full prize specifications and requirements.


DENES KONIG PRIZE<https://www.siam.org/prizes-recognition/activity-group-prizes/detail/siag-dm-denes-konig-prize>

This prize is awarded every two years to an individual or individuals in their early career for outstanding research contributions in an area of discrete mathematics, as evidenced by a publication in a peer-reviewed journal within the three calendar years prior to the award year.

To qualify for the 2022 award, the following criteria must be met:

* Key paper published in English between January 1, 2019 - December 31, 2021.
* Paper must be published in a peer-reviewed journal in the 3 years prior to the award year.
* Each candidate must be a graduate student or have been awarded PhD no earlier than 2018.

Click Here to Submit a Nomination!<https://siam2022.secure-platform.com/a/solicitations/9/home>


**********************************************************
*
* 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] Faculty positions in Industrial and Operations Engineering, University of Michigan

The Department of Industrial and Operations Engineering at the University
of Michigan invites applications and nominations for faculty positions
beginning September 2022.

We seek outstanding candidates for faculty positions at all levels
including assistant, associate, and full professor. Our department is
highly multidisciplinary, with a balance of theoretical and methodological
research and applied research interests. From a methodological perspective,
we will be considering candidates in all areas related to Industrial and
Operations Engineering, including Operations Research, Human-System
Integration, Data Analytics, and related disciplines. The many application
areas in the department include operations management, health and human
safety, energy and sustainability, mobility and transportation, public
policy, manufacturing, and robotics. Candidates must have, or be near
completion of a Ph.D., and must demonstrate a strong commitment to
high-quality research and evidence of teaching potential.

Please submit your application to the following:
https://ioe.engin.umich.edu/about/careers/

Candidates should provide (i) a current C.V., (ii) a list of at least three
references, and three summary statements of up to two pages each
describing, respectively: (iii) career teaching plans; (iv) research plans;
and (v) activities, contributions, or plans related to supporting
diversity, equity, and inclusion. For candidates with prior teaching
experience, please provide (vi) a summary of course (teaching) evaluations.
Candidates should also have their references send three letters of
recommendation to us directly at IOEFacultySearch@umich.edu .

Applications will be reviewed on a rolling basis until appointments are
finalized. For full consideration, candidates are encouraged to apply by
October 15, 2021.

Michigan Engineering's vision is to be the world's preeminent college of
engineering serving the common good. This global outlook, leadership focus,
and service commitment permeate our culture. Our vision is supported by a
mission and values that, together, provide the framework for all that we
do. Information about our vision, mission, and values can be found at:
http://strategicvision.engin.umich.edu/

We seek faculty members who commit to excellence in graduate and
undergraduate education, will develop impactful, productive and novel
research programs, and will contribute to the department's goal of
eliminating systemic racism and sexism by embracing our culture of
Diversity, Equity and Inclusion (DEI). We are especially interested in
candidates who can build collaborative ties with other departments within
the College of Engineering and the University. The University of Michigan
is responsive to the needs of dual career families.

If you have any questions regarding the web application submittal process
or other inquiries, please contact Akosua Dow, akosuad@umich.edu .

U-M COVID-19 Vaccination Policy: COVID-19 vaccinations are now required for
all University of Michigan students, faculty and staff across all three
campuses, including Michigan Medicine, by the start of the fall term on
August 30, 2021. This includes those working or learning remotely.

The University of Michigan is a non-discriminatory, affirmative action
employer.


--
Viswanath Nagarajan
Associate Professor
Industrial and Operations Engineering
University of Michigan
Web: http://viswa.engin.umich.edu/

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

[DMANET] Postdoctoral Fellowship at Edinburgh

A 3-year postdoctoral fellowship in computer science is available in
the School of Informatics, University of Edinburgh. This post is part
of Dr He Sun's EPSRC Early Career Fellowship on Efficient Spectral
Algorithms for Massive and Dynamic Graphs, and the post holder is
expected to work on graph clustering, and graph sparsification. Hence,
we would in particular welcome candidates with research experience in
clustering, spectral graph theory, streaming and sublinear algorithms,
and numerical linear algebra.

The post is available from January 1 2022, and will be for 3 years. An
earlier start date before January 2022 is negotiable. The deadline for
application is 24 September 2021.

More information about the post including the link for application can
be found at https://bit.ly/3zwJLjv

Informal enquiries are welcome and could be sent to He Sun ( h.sun@ed.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] Final CFP - 21st International Conference on Intelligent Systems Design and Applications - Springer LNNS Series (SCOPUS Indexed)

** FINAL Call for Papers


-- The 21st International Conference on Intelligent Systems Design and
Applications (ISDA'21) –-

http://www.mirlabs.org/isda21
http://www.mirlabs.net/isda21

On the World Wide Web

December 13-15, 2021

Proceedings of ISDA'21 will be published in Lecture Notes in Networks and
Systems, Springer (Indexed in SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH,
SCImago).
<https://www.springer.com/series/15179>

Proceedings of ISDA'20:
https://link.springer.com/book/10.1007%2F978-3-030-71187-0
History of ISDA series: https://www.mirlabs.org/isda21/previous.php

**Important Dates**
---------------------
Paper submission due: September 30, 2021
Notification of paper acceptance: October 31, 2021
Registration and Final manuscript due: November 15, 2021
Conference: December 13-15, 2021

**About ISDA 2021**
------------------

The International Conference on Intelligent Systems Design and Applications
(ISDA) is a major international conference bringing together researchers,
engineers, and practitioners who work in the areas of intelligent systems
and their applications in industry and the real world. Every year, ISDA
attracts authors from over 30 countries. After the success of the 20th
conference, which was held online, this year's event will also be held
online during December 13-15, 2021.

ISDA 2021 is expected to provide an opportunity for researchers to meet and
discuss the latest solutions, scientific results, and methods in solving
intriguing problems in the fields of artificial intelligence and its
real-world applications. The conference programme will include workshops,
special sessions, tutorials, prominent keynote speakers, and regular paper
presentations in parallel tracks. All submitted papers will be reviewed by
experts in the field based on the criteria of originality, significance,
quality, and clarity. Conference contents will be submitted for inclusion
in Springer and other Abstracting and Indexing (A&I) databases.

**Topics (not limited to)**
---------------------------

Intelligent Systems Architectures and Applications
Intelligent Image and Signal Processing
Intelligent Internet Modeling
Intelligent Data mining
Intelligent Business Systems
Intelligent Control and Automation
Intelligent Agents
Intelligent Knowledge Management
Innovative Information Security
Innovative Networking and Communication Techniques
Web Intelligence
Intelligent Software Engineering

**Submission Guidelines**
-------------------------
Submission of a paper should be made through the submission page from the
conference web page.
Please refer to the conference website for guidelines to prepare your
manuscript.

Paper format templates:
https://www.springer.com/de/authors-editors/book-authors-editors/manuscript-preparation/5636#c3324

ISDA'21 Submission Link:
https://easychair.org/conferences/?conf=isda2021


**Plenary Talks**
-----------------------------
You are welcome to attend 8 Keynote Talks offerred by world-renowned
professors and industry leaders. The detailed information is available on
conference website.

Speaker 1: Antônio de Padua Braga, Federal University of Minas Gerais,
Brazil
Title: Large margin classification with graph-based models

Speaker 2: Juergen Branke, University of Warwick, Coventry, United Kingdom
Title: Learning to optimise – optimal learning

Speaker 3: Oscar Cordon, University of Granada, Spain
Title: Hybrid Intelligent Systems for Forensic Anthropology and Human
Identification

Speaker 4: Kalyanmoy Deb, Michigan State University, USA
Title: TBA

Speaker 5: Marco Dorigo, Université Libre de Bruxelles, Belgium
Title: TBA

Speaker 6: Andries Engelbrecht, University of Stellenbosch, South Africa
Title: Set-based Particle Swarm Optimization Approach to Portfolio
Optimization

Speaker 7: Frédéric Guinand, Le Havre Normandy University, France
Title: Swarms of Unmanned Aerial Vehicles

Speaker 8: Günther Raidl, Technische Universität Wien, Austria
Title: Combinatorial Optimization Meets (Reinforcement) Learning

Speaker 9: Cengiz Toklu, Beykent University, Istanbul, Turkey
Title: Hybrid Algorithms. Applications to Structural Mechanics

**ISDA 2021 Organization**
-------------------------
General Chairs
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Thomas Hanne, University of Applied Sciences and Arts Northwestern
Switzerland, Switzerland
Weiping Ding, Nantong University, China

Program Chairs
Tzung-Pei Hong, National University of Kaohsiung, Taiwan
Tatiane Nogueira Rios, Universidade Federal da Bahia, Brazil

**Technical Contact**
---------------------
Dr. Ajith Abraham
Email: ajith.abraham@ieee.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/
*
**********************************************************

Monday, September 20, 2021

[DMANET] (CfP) Tools for Stochastic Modelling and Evaluation -- IFIP/PERFORMANCE 2021 workshop

Dear colleague,

Performance 2021 "Tools for Stochastic Modelling and Evaluation"
workshop deadline is approaching. More information are available
below:

Tools for Stochastic Modelling and Evaluation
• Organizers: Susanna Donatelli, Giuliana Franceschinis
• Submission website: https://easychair.org/conferences/?conf=tosme21
• Submission deadline: September 30, 2021

Other workshops:

TeaPACS 2021 – 1st International Workshop on Teaching Performance
Analysis of Computer Systems
• Organizers: Vittoria de Nitto Personè, Y. C. Tay

WAIN 2021 – 3rd International Workshop on AI in Networks and Distributed Systems
• Organizers: Luca Vassio, Danilo Giordano, Jinoh Kim, Jon Crowcroft

**********************************************************
*
* 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] TES Thematic Mini-Conference Computational Topology and Machine Learning, September 28 + 29, 2021

Dear colleagues,


We wish to announce the


Thematic Mini-Conference Computational Topology and Machine Learning,
-------------------------------------------
September 28 + 29, 2021


of the

Thematic Einstein Semester
"Geometric and Topological Structure of Materials"
https://www3.math.tu-berlin.de/mathplus/TES-Summer2021/
TU Berlin, April-September 2021


Tuesday, September 28, 2021
---------------------------
Time Zone: Berlin Time (Central European Summer Time, CEST)

* 04:00 pm to 04:40 pm, Jose Perea (Northeastern U)
* 04:50 pm to 05:30 pm, Bastian Rieck (ETH Zürich)
* 06:00 pm to 06:40 pm, Henry Adams (Colorado State U)
* 06:50 pm to 07:30 pm, Roland Kwitt (U Salzburg)


Wednesday, September 29, 2021
-----------------------------
Time Zone: Berlin Time (Central European Summer Time, CEST)

* 04:00 pm to 04:40 pm, Peter Bubenik (U Florida)
* 04:50 pm to 05:30 pm, Chao Chen (Stony Brook)
* 06:00 pm to 06:40 pm, Yusu Wang (UC San Diego)
* 06:50 pm to 07:30 pm, Mathieu Carrière (Inria Sophia Antipolis)


For titles and abstracts please see

https://www3.math.tu-berlin.de/mathplus/TES-Summer2021/



Participation:
-------------

free



Registration:
------------

Please register for the semester activities via this form:

https://docs.google.com/forms/d/e/1FAIpQLSdW_OVSvdTWHsZHdzqrTTvd54pTaCCnu6Snw_ui7TOT4XbHkA/viewform

Registered participants will receive the links for the semester by e-mail.



Organizers:
----------

Myfanwy Evans (U Potsdam)
Kathryn Hess Bellwald (EPFL)
Frank Lutz (TU Berlin)
Dmitriy Morozov (LBNL)
Ileana Streinu (Smith College)


---
**********************************************************
*
* 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] FACS 2021 - Call for Participation

=============================================================================
**
** Call for Participation: FACS 2021
**
** 17th International Conference on Formal Aspects of Component Software
**
** Virtual Event
** October 28-29, 2021
**
** https://facs2021.inria.fr
**
=============================================================================

## OVERVIEW

Component-based software development proposes sound engineering principles
and techniques to cope with the complexity of present-day software systems.
However, many challenging conceptual and technological issues remain in
component-based software development theory and practice. Furthermore, the
advent of service-oriented and cloud computing, cyber-physical systems, and
the Internet of Things has brought to the fore new dimensions, such as
quality of service and robustness to withstand faults, which require
revisiting established concepts and developing new ones.

FACS 2021 is concerned with how formal methods can be applied to
component-based software and system development. Formal methods have
provided foundations for component-based software through research on
mathematical models for components, composition and adaptation, and
rigorous approaches to verification, deployment, testing, and certification.

## REGISTRATION

FACS 2021 is free to attend, but registration is mandatory. Registered
attendees will receive invites to the online event. Registration is open
until Friday, 22 October 2021.

https://facs2021.inria.fr/registration/

## PROGRAMME

TIME GMT+2 (Amsterdam, Berlin, Bern, Brussels, Budapest, Madrid, Oslo,
Paris, Praga, Rome, Sofia, Stockholm, Vienna, Warsaw)

# OCTOBER 28, 2021

# 13h -> 15h - Session 1 (Modelling & Composition)

Component-based Approach Combining UML and BIP for Rigorous System Design.
Salim Chehida, Saddek Bensalem and Abdelhakim Baouya.

Composable Partial Multiparty Session Types.
Claude Stolze, Marino Miculan and Pietro Di Gianantonio.

A Canonical Algebra of Open Transition Systems.
Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini and
Pawel Sobocinski.

Corinne, a Tool for the Composition of Choreography Automata.
Simone Orlando, Vairo Di Pasquale, Franco Barbanera, Ivan Lanese and Emilio
Tuosto.

# 15h15 -> 16h30 - Session 2 (Invited Talk)

Parametric and Interval Model Checking - Recent Advances and Applications.
Radu Calinescu

# OCTOBER 29, 2021

# 13h -> 15h - Session 3 (Verification)

Specification and Verification of Parametric Systems with Recursive
Architectures.
Marius Bozga and Radu Iosif.

A linear parallel algorithm to compute bisimulation and relational coarsest
partitions.
Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma and Anton
Wijs.

Automated Generation of Initial Configurations for Testing Component
Systems.
Frederic Dadeau, Jean-Philippe Gros and Olga Kouchnarenko.

Monitoring Distributed Component-Based Systems.
Yliès Falcone, Hosein Nazarpour, Saddek Bensalem and Marius Bozga.

# 15h15 -> 16h30 - Session 4 (Invited Talk)

Learning Assumptions for Verifying Cryptographic Protocols Compositionally.
Corina Pasareanu

**********************************************************
*
* 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 Algorithm Engineering for Scalable Data Reduction

You love algorithms, their analysis and efficient implementation? You
are about to or know somebody who graduates with an excellent Master?s
degree and is looking for a PhD position? Then please read on:

The Algorithm Engineering Group Heidelberg at Heidelberg University
is inviting applications for a full-time position in a DFG funded
project of a

PhD Student (m/f)

starting on November 1st, 2021 (the exact date pu to a couple of months
is negotiable). Starting in the group as a PostDoc is also possible.

Working Area:

A successful candidate will work under the supervision of Prof. Dr.
Christian Schulz on engineering scalable data reduction algorithms.
Over the last two decades, significant advances have been made in the
design and analysis of FPT algorithms for a wide variety of graph
problems. However, these theoretical algorithmic ideas have received
very little attention from the practical perspective. This project aims
to bridge the gap between theory and practice currently observed in FPT
or kernelization approaches.

Further responsibilities as part of the position include the supervision
of bachelor and master students and possibly TA duties.

Requirements:

- Very good university degree (Master or equivalent) in computer science
or a related field
- willingness to learn and later assist teaching in German
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis or relevant courses); knowledge
in combinatorial algorithms and linear algebra is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement

Heidelberg University offers excellent conditions for undergraduate,
graduate, and PhD students. As part of the university we pursue a
non-discriminatory employment policy and value equal opportunities, as
well as diversity (https://www.uni-heidelberg.de/diversity/). The
university lays special emphasis on increasing the number of women in
senior and in academic positions. Given equal qualifications, preference
will be given to female applicants.

Please *forward this email to anyone who may be interested* or send your
application documents (cover letter, CV, copies of certificates) and the
contact information of two references if available to the address below.
To receive full consideration, submit the documents via *email*
by October 15th, 2021 to:

Univ.-Prof. PD. Dr. Christian Schulz

Algorithm Engineering
Heidelberg University
Telephone: +49 (0) 6221 54- 14342
E-Mail: christian.schulz@informatik.uni-heidelberg.de
Web: https://schulzchristian.github.io/
https://ae.ifi.uni-heidelberg.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] IGAFIT panel on ERC grants - 2pm CEST, September 30 - Questions are welcome

Dear all,

We would like to invite you to the IGAFIT panel discussion on ERC grants on
September 30 (detail below).

*Date & Time: *September 30, 2021, 14:00 CEST. The one-hour discussion will
be followed by a short networking session.
*Panelists:* Keren Censor-Hillel, Daniel Marx, David Peleg, Saket Saurabh.
*Location: *Online at
https://www.airmeet.com/e/fe786f10-15f1-11ec-86ea-5b469367924a
*Questions for the panelists* are welcomed at
https://forms.gle/aFWZbd6iqHeHGS1t6.

The goal of the event is to share the panelists' experiences and insights
to help researchers in the algorithms community better prepare for ERC grant
applications. We welcome both beginning researchers who might apply for an
ERC grant in the future and established researchers considering applying
for ERC or other grants. There will be a chance to ask questions during the
event. However, to increase the chance of getting your questions answered,
you are encouraged to use the link above to send questions and comments
ahead of time. You can find more information about events by IGAFIT on
our web page: http://igafit.mimuw.edu.pl/?page_id=483786.

The meeting will be held using the Airmeet platform and to attend please go
to https://www.airmeet.com/e/649d9310-cdc2-11eb-847d-79adba337a09. In order
to access the Airmeet platform, you will need to register, so that others
know who you are. Then before and after the talk, you will be located
inside a Social Lounge, where discussion tables are visible. Most of the
tables can have up to 8 chairs, and you can join a table by clicking the
"Take a Seat" button on a table. This way you will be able to talk to
people seated currently at the table. When the session starts you will be
automatically switched to see the stage. You can find more instructions on
how to use Airmeet here:
https://www.airmeet.com/hub/step-by-step-guide-use-airmeet-for-attendees/.

We invite you to take part in the event. Please advertise broadly and bring
your students/postdocs as well.

Organization Committee:
Nikhil Bansal
Artur Czumaj
Andreas Feldmann
Danupon Nanongkai
Adi Rosén
Eva Rotenberg
Piotr Sankowski
Christian Sohler

**********************************************************
*
* 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 CFP] Parameterized and Approximation Algorithms in Graph Drawing, Journal of Graph Algorithms and Applications (JGAA)

CALL FOR PAPERS

Special Issue on Parameterized and Approximation Algorithms in Graph Drawing
of
Journal of Graph Algorithms and Applications (JGAA)
Dear Colleagues,

It is a great pleasure to invite you to submit a paper to the Special Issue
of Journal of Graph Algorithms and Applications (JGAA) on "Parameterized
and Approximation Algorithms in Graph Drawing".

In the course of a few decades, the fields of parameterized complexity and
approximation algorithms have emerged as distinguished research areas
providing an impressive collection of broadly usable methodologies and
remarkable theoretical and practical contributions. These branches of
complexity theory provide a framework of powerful techniques that allow us
to tackle hard (often NP-hard) problems, by either considering restricted
graph classes or by seeking solutions "close" to the optimal ones.
Moreover, in recent years, the research efforts in these two fields have
converged into the study of the unified notion of parameterized
approximation algorithms.

CFP on the journal's page:https://jgaa.info/docs/cfp-param-algo.pdf

Submission Deadline: February 28th, 2022


Topics
======

The emphasis of this special issue is on original results in the areas of
fixed-parameter tractable and approximation algorithms in graph drawing and
network visualization. This includes, but is not limited to, theoretical
and combinatorial aspects that arise at the interface of graph drawing with
computational and discrete geometry, combinatorial optimization, visual
computing, VLSI and computer-aided design, computer graphics, and
information visualization. The range of topics includes:

- fixed-parameter tractable and approximation algorithms
- (parameterized) inapproximability
- W[k]-hardness
- parameterized approximations
- (lossy) kernelization
- fine-grained complexity of approximations
- subexponential-time approximations

Other topics that are not listed but that might be of interest for the
study of parameterized and approximation algorithms in graph drawing will
also be evaluated. To bridge the gap between theory and practice, we
welcome contributions dealing with techniques and data structures to obtain
efficient parameterized and approximation algorithms to tackle
graph-visualization problems as well as implementations, experimental
evaluations, and algorithm engineering issues of approximation,
parameterized, and kernelization algorithms that emerge in practice.


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

We invite authors to submit papers describing original research of
theoretical or practical significance concerned with parameterized and
approximation algorithms in graph drawing and network visualization until
the 28th of February, 2022. We aim for a fast reviewing process in order to
have this special issue available at the end of 2022. Papers should be
submitted to the editors of the special issue in PDF format. All
communications between the editors, authors, and reviewers will be done by
email unless otherwise requested by the author or reviewer. All submissions
must be formatted using the LaTeX style file of Journal of Graph Algorithms
and Applications (http://jgaa.info/authors.jsp). The default margins and
fonts must not be modified. The submission should contain a scholarly
exposition of ideas, techniques, and results, including motivation and a
clear comparison with related work. The claims of the paper should be fully
substantiated, including full proofs or appropriate experimental data.
Papers of good quality that do not fit within the scope of this special
issue might be handled as regular JGAA submissions.


Guest Editors
=============

Giordano Da Lozzo, Roma Tre University; giordano.dalozzo@uniroma3.it
Philipp Kindermann, Universität Trier; kindermann@uni-trier.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/
*
**********************************************************

Friday, September 17, 2021

[DMANET] Membership Drive - Association of Cyber Forensics

The Association of Cyber Forensics and Threat Investigators (ACFTI) is
an ambitious, non-profit technical organisation focusing on the
academics and research of cybersecurity, digital forensics, incident
response, and threat investigations and their influence to the
society. ACFTI started in 2016 as an initiative dedicated to promoting
all areas of cybersecurity, digital forensics, incident response, and
threat investigations in Latin America, but efforts were
systematically consolidated in 2020 to report new developments and
latest proven methodologies and to publish scholarly research
presenting the current research issues and advances in the mentioned
areas. Listed in the Union of International Associations with UIA Org
ID AA1922.

Website: https://www.acfti.org/
Twitter: @acfti
Facebook: https://www.facebook.com/groups/ACFTI/

Association Growth Initiative
----------------------------------

In response to the growing fragmentation of applied knowledge in
cybersecurity, digital forensics, incident response, and threat
investigations, ACFTI has successfully established an international
workshops series, which successfully held two workshops in Dubai and
Germany. ACFTI also maintains a free open-access journal "Journal of
Cyber Forensics and Advanced Threat Investigations". Thanks to our
industry partners, and financial supporters who made this possible.

We are planning to get involved in more projects, events, and
activities more relevant to our areas of interest.

Membership Drive and Volunteers Needed
----------------------------------

To achieve our goals of increasing growth in society, We are seeking
to increase our members and are looking for volunteers to join us and
to establish special interest groups and chapters across different
disciplines and countries. All are welcome (early career researchers,
academics, students, practitioners, experienced researchers, civil
servants), underrepresented groups in cybersecurity are especially
welcome to join us as well.

If you are doing applied research in any of our areas of interest, or
you are simply interested in cybersecurity, feel free to fill out this
Google form as an Expression of Interest in joining the "Association
of Cyber Forensics and Threat Investigators".
https://forms.gle/adUy9cA8yzTzx96z5
After receiving the Expression of Interest, you will be invited to our
communication platform where we can coordinate the community and set
up events and other collaboration opportunities.

What do We Offer
----------------------------------

ACFTI offers the possibility of making an impact by offering
collaboration in joint projects and activities, internships for
students, training and continuing professional education, research
achievement/outstanding service awards to recognize outstanding
individuals who have made a significant contribution to cybersecurity,
digital forensics, incident response, and threat investigations every
year. ACFTI is also in the process of setting up a fellow award to
recognize outstanding leaders of the profession who have made
significant, nationally recognized contributions to cybersecurity,
digital forensics, incident response, and threat investigations. A
fellow is the highest classification of ACFTI membership.

Finally, feel free to forward this email to colleagues or others that
might be interested.

Sent By: Andrew Zayine, on behalf of the President of the association board
Prof. John William Walker
Nottingham Trent University,
Cyber Security Researcher/Consultant, and Practicing Expert Witness,
Cybersec Innovation Partners Ltd, London, SE1 9SG, United Kingdom.
**********************************************************
*
* 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 2022 - deadline extended to November 15 (firm)

Dear colleagues,


After receiving a number of requests by people who are interested in SAND and would have liked to submit, but only recently became aware of it, the steering and organizing committees of SAND have decided to give a quite long extension.


The new and firm deadline now becomes: November 15, 2021 (AoE)



The SAND committees also tend to believe that the new deadline is strategically a better choice for a new conference like SAND.



We would like to emphasize that SAND is aiming at strong research contributions that will establish SAND as the primary conference of research on algorithms for dynamic networks and more broadly on dynamics in computing.



For your reference:



Conference website: https://www.sand-conf.org/
Submission link: https://easychair.org/conferences/?conf=sand2022



On behalf of the SAND 2022 committees,



James Aspnes and Othon Michail

PC chairs of SAND 2022




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

SAND 2022: Call for Papers

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



1st Symposium on Algorithmic Foundations of Dynamic Networks

February 2022, online-only event due to the pandemic



https://www.sand-conf.org/

Twitter: https://twitter.com/SANDconference



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

Important Dates

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



Submission deadline: November 15th, 2021 (23:59 AoE)

Notification: end January 2022



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

Scope

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



We are pleased to announce the 1st 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=sand2022).



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/documentation/authors) with



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



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. Note that reviewers are not required to read the appendices. 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 of 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:

- James Aspnes (co-chair), Yale University, USA

- Luca Becchetti, University of Rome Sapienza, Italy

- Petra Berenbrink, University of Hamburg, Germany

- Janna Burman, Université Paris-Sud – LRI, France

- Arnaud Casteigts, University of Bordeaux, France

- Keren Censor-Hillel, Technion, Israel

- Andrea Clementi, University of Rome Tor Vergata, Italy

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy

- David Doty, University of California, Davis, USA

- Yuval Emek, Technion, Israel

- Thomas Erlebach, University of Leicester, UK

- Sándor Fekete, TU Braunschweig, Germany

- Paola Flocchini, University of Ottawa, Canada

- David Ilcinkas, CNRS, Bordeaux, France

- Zvi Lotker, Bar Ilan University, Israel

- Toshimitsu Masuzawa, Osaka University, Japan

- George Mertzios, Durham University, UK

- Othon Michail (co-chair), University of Liverpool, UK

- Rolf Niedermeier, TU Berlin, Germany

- Rotem Oshman, Tel Aviv University, Israel

- Andrea Richa, Arizona State University, USA

- Nicola Santoro, Carleton University, Canada

- Christian Scheideler, University of Paderborn, Germany

- David Soloveichik, University of Texas at Austin, USA

- Paul Spirakis, University of Liverpool, UK

- Damien Woods, Maynooth University, Ireland

- Viktor Zamaraev, University of Liverpool, UK

- Christos Zaroliagis, University of Patras, Greece



Organizing Committee:

- James Aspnes, Yale University, USA (PC chair)

- Othon Michail, University of Liverpool, UK (PC chair)

- Giuseppe Antonio Di Luna, University of Rome Sapienza, Italy (General chair)

- Viktor Zamaraev, University of Liverpool, UK (General chair)

- George Skretas, University of Liverpool, UK (Publicity chair)



Steering Committee:

- Paola Flocchini, University of Ottawa, Canada (chair)

- James Aspnes, Yale University, USA (PC chair 2022)

- Othon Michail, University of Liverpool, UK (PC chair 2022)

- 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 (Treasurer)



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

- Rolf Niedermeier, TU Berlin, Germany

- 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] [ICALP 2022] Call for workshops

First Call for Workshops - ICALP 2022 -
July 4 - July 8, 2022
Paris, France
https://icalp2022.irif.fr/


The International Colloquium on Automata, Languages and Programming (ICALP)
is the main conference and annual meeting of the EATCS (European
Association for Theoretical Computer Science). This year, after two virtual
ICALP events, we are happy to be able to host this event in hybrid
mode--and hope that many of us will be able to meet again in beautiful
Paris! This is a call for workshops to be affiliated with ICALP 2022. We
invite researchers to organise workshops on central topics on Automata,
Languages and Programming, to help further mark off ICALP 2022.


Important Dates:

Workshop proposal deadline: Friday 19 November 2021, 23:59 AoE
Workshop notification: Friday 10 December 2021
Workshops: Monday 4 July 2022.

We strongly suggest that prospective workshop organizers contact
the workshop selection committee before submitting a proposal.

Workshop Proposal Guidelines:

Proposals should be submitted no later than
*** Friday 19 November 2021 ***
by sending an email to the workshop selection committee, see below. You
should expect notification on the acceptance of your proposal by 10
December 2021.

A workshop proposal submission should consist of the following

A short scientific justification of the proposed topic, its significance,
and the particular benefits of the workshop to the community.
An organisational part including:
- workshop's name and URL (if already available);
- contact information for the workshop organizers (including their
webpages);
- expected number of participants (if available, please include the data of
previous years);
- proposed format and agenda (e.g. paper presentations, tutorials, see
below for more details);
- potential invited speakers;
- plans for dissemination, if any (e.g. a journal special issue);
- planned format of the event (see below for mode details);
- virtual/hybrid backup plans (including platform preference).


As for the format, a standard option is a full one-day workshop consisting
of invited talks by leading experts and of shorter contributed talks,
either directly invited by the organizers or selected among presentation
submissions. Deviations from this standard are also welcome, including open
problem sessions, discussion panels, or working sessions. If you plan to
have invited speakers, please specify their expected number and, if
possible, tentative names. If you plan a call for contributed talks (or
papers) followed by a selection procedure, the submission date should be
scheduled after ICALP 2022 notification (11 April 2022), while the
notification should take place before the early registration deadline. In
your submission please include details on the schedule, planned procedure
of selecting contributed talks (or papers). If you plan to have published
proceedings of your workshop, please provide the name of the publisher.

Note that ICALP 2022 is not able to provide financial support for the
organization of workshops. The conference can however provide a room,
internet connection and help with some local organisation. For workshops
that are online or in hybrid mode, it is expected that the organizers
provide the supporting technical infrastructure.


Workshop Selection Committee:

Track A: Valia Mitsou <vmitsou@irif.fr>
Track B: Mahsa Shirmohammadi <mahsa@irif.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] ADT-21 PhD Day - Call for Abstracts

Dear Colleagues,

The ADT-21 conference (https://www.irit.fr/ADT2021/) is scheduled to be
held at the University of Toulouse from Nov 3rd to 5th. We are very excited
to announce that a PhD Day will be organized on Nov 2nd.
We strongly encourage you (or your students) to participate!

The PhD Day program will include two tutorials:

-- "Computational Social Choice: Some New Directions" by Jérôme Lang
(LAMSADE, University of Paris-Dauphine)
-- "Nash Equilibria in Non-Cooperative Games: How to Compute Them?" by
Régis Sabbadin and Paul Jourdan (INRAE, University of Toulouse)

In addition, it will include a session of short presentations (5-7 minutes)
by PhD Students, where they will have the opportunity to share their
research in algorithmic decision theory, game theory, computational social
choice, and related fields.

In this context, we would like to invite you to submit an abstract to
participate in the PhD Day, by filling in the Google Form below by October
5th:
(
https://docs.google.com/forms/d/e/1FAIpQLSe4iYDKHukdI1Aj55i2Z8tvSwjFQbEVgKcd-kfR4zkkwQAPyA/viewform?usp=sf_link
)
In the form you will be asked to provide your contact information, as well
as a short abstract/description of your PhD research (max 500 words). If
your abstract is accepted, you will have to give a brief talk in the
presentation session.
Notification of acceptance will be sent by October 15th at the latest.

Tutorials and presentations are going to be streamed. However, please take
into account that our aim is to host this PhD day as an in-person event.
Just in a few exceptional cases we may allow students to present online.
Please refer to the ADT-21 conference website for more information about
Covid restrictions and access to the University.

Should you have any questions, please do not hesitate to contact one of the
organizers of the PhD Day (see e-mail addresses below).

Looking forward to seeing you in Toulouse!

The ADT-21 PhD Day organizing committee,
Georgios Amanatidis (g.d.amanatidis@gmail.com)
Roi Naveiro (roi.naveiro@icmat.es),
Arianna Novaro (Arianna.Novaro@univ-paris1.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] INOC 2022 - Second Call for Papers

---------------------------------------------------------
Second Call for Papers

INTERNATIONAL NETWORK OPTIMIZATION CONFERENCE (INOC 2022)

Aachen, Germany-- 1-4 March 2022

https://sites.google.com/view/inoc2022/

inoc2022@math2.rwth-aachen.de @inoc2022 (twitter)

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

The International Network Optimization Conference (INOC 2022) provides a forum for researchers in the broad field of network optimization to present and publish their latest results and ongoing research. INOC is the conference of the European Network Optimization Group (ENOG), a working group of EURO. The conference has been held biyearly since 2003, the latest in Avignon (France) in 2019. INOC 2022 will be held in March 2022, most probably in a hybrid format, physically at RWTH Aachen University (Aachen, Germany) and online for those who are unable to attend.

Invited speakers
----------------

Markus Leitner (VU Amsterdam) - Influence maximization in (social) networks

Anita Schöbel (Frauenhofer ITWM, TU Kaiserslautern) -
Robust multi-objective optimization: Concepts, results and applications

J. Cole Smith (Syracuse University) - The Current and Future Waves of Interdiction Models and Algorithms

Topics of Interest
------------------

INOC solicits contributions in the broad field of Network Optimization, from the areas of Mathematical Optimization, Operations Research, and Graph Theory. Also application-oriented network optimization from areas like Telecommunications, Routing, and Logistics are most welcome. Topics include but are not restricted to:

Algorithmic Game Theory on Networks
Approximation Algorithms
Combinatorial Optimization
Connectivity Problems
Graph Algorithms
Graph Theory
Heuristics and Meta-heuristics
Mixed Integer Linear Programming
Mixed Integer Nonlinear Optimization
Multi-objective Optimization
Multicommodity Flows
Network Design
Network Flows
Network Interdiction
Network Optimization
Network Reliability
Path and Tree Problems
Robust Optimization
Routing Algorithms
Stochastic Networks
Supply Chain Network Optimization
Sustainable Mobility and Transportation
Telecommunication Networks
Transportation Networks
Vehicle Routing

Submission Guidelines
---------------------

INOC accepts both full papers to be published in the proceedings and extended abstracts to be published at the conference only:

- Full papers describing original, not yet published or submitted work can be up to 6 pages (with two columns) long.

- Extended abstracts describing recent results and ongoing research can be up to 2 pages long.

All submission have to be formatted with the templates provided at the submissions webpage. Contributions will be peer reviewed by the program committee (seehttps://sites.google.com/view/inoc2022/ for the list of committee members). The proceedings will be published at OpenProceedings.

After the conference, extended papers can be submitted to a special issue of the journal Networks.

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

Submission deadline for full papers: October 1, 2021
Submission deadline for extended abstract: November 19, 2021
Notification of acceptance: December 17, 2021
Early registration deadline and final paper submission: January 17, 2022
Rosenmontag (Carnival): February 28, 2022
Welcome reception: March 1, 2022

Venue
-----

The conference will be held at RWTH Aachen University in Aachen, Germany. For those that are not yet able to come to Aachen, online participation will be offered.

Contact
-------

The conference is organized by the Discrete Optimization Group at RWTH Aachen University, led by Christina Büsing and Arie Koster. All questions about submissions should be emailed toinoc2022@math2.rwth-aachen.de

--
Prof. Dr. Arie M.C.A. Koster
RWTH Aachen University
Lehrstuhl II für Mathematik
Pontdriesch 10-12, 2.0G, Raum 306
D-52062 Aachen
E: koster@math2.rwth-aachen.de
W: http://www.math2.rwth-aachen.de/~koster/
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct)
F: +49 (0)241 80-92136

**********************************************************
*
* 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] Postdoctoral Researcher in TCS at the University of Leeds (deadline 3.10.2021)

We are happy to invite applications for a 18-months postdoctoral research
position (salary: £31,866 per annum at grade 7) within the School of
Computing at the University of Leeds. The position is part of the EPSRC
funded project (EP/V00252X/1) on the "Next Generation of Algorithms for
Mixed Integer Linear Programming (MILP)" led by Dr. Sebastian Ordyniak.

The project focuses on the development of novel algorithms and algorithmic
lower
bounds for MILP based on the principles of parameterized
complexity (PC). Towards this aim we will develop novel ways to measure
and exploit the structure of MILP instances based on decompositional,
backdoor, and hybrid approaches. We will also explore
how the novel algorithmic lower bounds and upper bounds can best be
exploited for various problems in TCS, AI, and ML.

The project comes with a generous travel budget, which will allow us to
closely collaborate with the leading research groups within PC and the
complexity of MILP such as the algorithms and complexity groups at Charles
University in
Prague, TU Vienna, University of Warwick, Royal Holloway University of
London, and the University of Bergen.

Candidates interested in the position should have:

- a PhD degree (or be close to completion) in Computer Science or
Mathematics

- a strong background in algorithms and complexity, more specifically, in
parameterized complexity and/or the computational complexity of MILP

- very good scientific writing and communication skills

Participation and presentations at scientific conferences are expected
and will be funded.

If you are interested in working in an internationally connected,
world-leading research team within the Algorithms research group at
the University of Leeds, please send your application
to sordyniak@gmail.com (a detailed cv is sufficient at this stage) until
3.10.2021.

**********************************************************
*
* 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: EUROCAST 2022 Workshop on Theory and Applications of Metaheuristic Algorithms

Dear colleague,

we kindly want to bring this workshop/conference to your attention:

----------------------------------------------------------------------
Workshop on Theory and Applications of Metaheuristic Algorithms as
part of the 18th Int. Conference on Computer Aided Systems Theory
http://eurocast2021.fulp.ulpgc.es/workshops-main-lines
----------------------------------------------------------------------

February 20-25, 2022, Las Palmas, Canary Islands, Spain


*** Deadline for 2-page abstracts: November 15, 2021 ***

WORKSHOP SCOPE

The workshop invites original work concerning all aspects of
metaheuristics and heuristic problem solving, in particular:

• Theory and applications of metaheuristics such as
Evolutionary Algorithms, GRASP, Iterated Greedy,
Iterated Local Search, Large Neighborhood Search,
Scatter Search, Simulated Annealing, Swarm Algorithms, Tabu Search,
and Variable Neighborhood Search
• New algorithmic developments
• Hybrid approaches
• Mathematical programming based approaches, e.g., Matheuristics
• Constraint programming based approaches
• Parallel metaheuristics
• Machine learning and simulation
• Data driven modeling and prediction
• Simulation based heuristic optimization
• Applications of simulation based soft computing
• Applications in combinatorial optimization, bio- and medical
informatics, networks and telecommunications, logistics,
scheduling, and transportation
PAPER SUBMISSION

An extended two pages abstract including references in English must be
submitted with an indication of the workshop at
https://eurocast2022.fulp.ulpgc.es/participation
by *November 15, 2021*. Please follow the instructions for LNCS authors
given
at the Springer web site . Authors will be notified of acceptance by
December 15, 2021. Accepted abstracts will be published in a
pre-conference volume with ISBN. After the conference, full papers will
be invited and accepted ones will be published in post-conference
proceedings. It is anticipated that the finally selected full papers
will be published in line with prior Eurocast meetings in the Springer
LNCS series.
WORKSHOP ORGANIZERS

Michael Affenzeller, Stefan Wagner University of Appllied Sciences
of Upper Austria, Campus Hagenberg
michael.affenzeller@fh-hagenberg.at, stefan.wagner@fh-hagenberg.at
Guenther Raidl TU Wien, Austria
raidl@ac.tuwien.ac.at

IMPORTANT DATES

• Extended Abstract Submission Deadline: November 15, 2021
• Acceptance Notification: December 15, 2021

########################################################################


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

Thursday, September 16, 2021

[DMANET] FMEC 2021 Final Call: The Sixth International Conference on Fog and Mobile Edge Computing, Gandia, Spain. December 6-9, 2021.

The Sixth International Conference on Fog and Mobile Edge Computing (FMEC
2021)

http://emergingtechnet.org/FMEC2021/index.php

Gandia, Spain. December 6-9, 2021


*FMEC 2021 CFP:*

Cloud computing provides a large range of services and virtually unlimited
available resources for users. New applications, such as virtual reality
and smart building control, have emerged due to the large number of
resources and services brought by cloud computing. However, the
delay-sensitive applications face the problem of large latency, especially
when several smart devices and objects are getting involved in human's life
such as the case of smart cities or the Internet of Things. Therefore,
cloud computing is unable to meet the requirements of low latency, location
awareness, and mobility support. To solve this problem, researchers have
introduced a trusted and dependable solution through the Fog and the Mobile
Edge Computing (FMEC) to put the services and resources of the cloud closer
to users, which facilitates the leveraging of available services and
resources in the edge networks. By this, we are moving from the core (cloud
data centers) to the edge of the network closer to the users. FMEC
dependability is based on providing user centric service. The purpose of
Fog and the Mobile Edge Computing is to run the heavy real-time
applications at the network edge directly using the billions of connected
mobile devices.

Several features enable the Fog and the Mobile Edge Computing to be a
perfect paradigm to the aforementioned purpose, which are the dense
geographical deployment of servers, supporting mobility and the closeness
to users. As in every new technology, some challenges face the vision of
the Fog and the Mobile Edge Computing, which are the administrative
policies and security concerns (i.e. secure data storage, secure
computation, network security, data privacy, usage privacy, location
privacy, etc). FMEC 2021 conference aims to investigate the opportunities
and requirements for Mobile Edge Computing dominance. In addition, it seeks
for novel contributions that help mitigating Mobile Edge Computing
challenges. That is, the objective of FMEC 2021 is to provide a forum for
scientists, engineers, and researchers to discuss and exchange new ideas,
novel results and experience on all aspects of Fog and Mobile Edge
Computing (FMEC). FMEC 2021 is Technically Co-Sponsored by IEEE Spain
Section. Researchers are encouraged to submit original research
contributions in all major areas, which include, but not limited to:

* Mobile Cloud Computing Systems.
* FMEC Security and Privacy Issues.
* FMEC Pricing and billing models.
* FMEC support for VANETS and MANETS
* Cloudlet based computing
* Dew based computing
* Lightweight authentication mechanisms in FMEC architecture.
* Access Control models in FMEC.
* Identification of incentives for FMEC service providers.
* The future perspective for FMEC: Challenges and Open Issues.
* FMEC Quality of Service (QoS) improvements techniques.
* FMEC architecture features and evolution.
* FMEC Real-time communication interfaces and protocols.
* FMEC Resource scheduling that enhances the reliability and scalability.
* FMEC Resources monitoring mechanism and utilization measuring mechanism.
* FMEC resources allocation and management.
* Real-time load prediction model to optimize the user satisfaction.
* FMEC virtualization.
* Data storage, processing, and management at FMEC platform.
* Cyber hacking, next generation firewall of FMEC.
* Deployment strategies of FMEC Servers
* Admission control for FMEC.
* Social engineering, insider threats, advance spear phishing.
* Incident Handling and Penetration Testing.
* Forensics of Virtual and FMEC Environments.
* Security protocols in FMEC.
* Security and privacy of mobile cloud computing
* Security, privacy and reliability issues of MCC and IoT
* Security and privacy of IoT
* Security and privacy management in MCC
* MCC intrusion detection systems
* Security of pricing and billing for mobile cloud computing services
* Security of mobile, peer-to-peer and pervasive services in clouds
* Security of mobile commerce and mobile Internet of Things
* Security of mobile social networks
* Security and privacy in smartphone devices
* Security and privacy in social applications and networks
* Security of Mobile, peer-to-peer and pervasive services in clouds
* Security of Mobile commerce and mobile internet of things
* Security of Operating system and middleware support for mobile computing
* Security and privacy in sensor networks
* Security and privacy in social applications and networks
* Web service security
* Security of 3G/4G systems, Wi-MAX, Ad-hoc
* Security of Mobile social networks
* Near field communication services
* Service-oriented architectures, service portability, P2P
* Network virtualization and cloud-based radio access networks

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper can be up to 8 pages
(including all figures, tables and references). Submitted papers must
present original unpublished research that is not currently under review
for any other conference or journal. Papers not following these guidelines
may be rejected without review. Also submissions received after the due
date, exceeding length limit, or not appropriately structured may also not
be considered. Authors may contact the Program Chair for further
information or clarification. All submissions are peer-reviewed by at least
three reviewers. Accepted papers will appear in the FMEC Proceeding, and be
published by the IEEE Computer Society Conference Publishing Services and
be submitted to IEEE Xplore for inclusion.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers up to 8 pages and must follow the IEEE paper format. Please include
up to 7 keywords, complete postal and e-mail address, and fax and phone
numbers of the corresponding author. Authors of accepted papers are
expected to present their work at the conference. Submitted papers that are
deemed of good quality but that could not be accepted as regular papers
will be accepted as short papers. Length of short papers can be between 4
to 6 pages.

*Important Dates*

*Submission Date: 20 September, 2021 (Firm and Final)*

Notification to Authors: 10 October, 2021

Camera Ready Submission: 30 October, 2021


*Contact:*

Please send any inquiry on FMEC 2021 to Emerging Tech. Network Team at:
emergingtechnetwork@gmail.com

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

[DMANET] Workshop on Advances in Distributed Graph Algorithms (ADGA) 2021 --- call for participation

=============================================================
10th Workshop on Advances in Distributed Graph Algorithms (ADGA 2021)
October 4, 2021. Hybrid event (Freiburg (Germany) and virtual).
http://adga.hiit.fi/2021
=============================================================

The 10th Workshop on Advances in Distributed Graph Algorithms (ADGA
2021) will take place as a hybrid event on *Monday, October 4th, 2021*,
co-located with DISC 2021. It will be possible to attend ADGA 2021
either as an online conference via Zoom or as a physical event at the
University of Freiburg, Germany. For information about the registration,
please visit http://www.disc-conference.org/wp/disc2021/registration.

The ADGA workshop series focuses on the theoretical foundations of
distributed graph algorithms. All presentations in the ADGA workshops
are invited talks that cover current topics in this research area. The
talks are designed to cover general aspects of a research topic rather
than to present a particular new result. Such aspects include the
advances achieved in the topic, the main remaining objectives, the
technical obstacles, etc.

ADGA 2021 will start at *3pm (CEST)* and end at around *7:15pm*. The
exact schedule as well as speaker information and abstracts can be found
on the website http://adga.hiit.fi/2021 soon.

For any questions related to ADGA 2021, please do not hesitate to send
an email to Sebastian Brandt (brandts@ethz.ch).


======================
Invited Speakers and Talks
======================

*Alkida Balliu* (University of Freiburg): The Ubiquity of Δ-Coloring
*Anton Bernshteyn* (Georgia Institute of Technology): Distributed
Algorithms and Descriptive Combinatorics
*Peter Davies* (University of Surrey): LOCAL and Low-Space MPC: A Bridge
Between Distributed and Parallel Computing
*Laurent Feuilloley* (University of Lyon 1): Local Certification of
Graph Classes
*Krzysztof Nowicki* (BARC, University of Copenhagen): Spanning Trees and
Small Cuts in Congested Clique
*Goran Zuzic* (ETH Zurich): An Overview of Universally-Optimal
Distributed Algorithms

--
This email has been checked for viruses by Avast antivirus software.
https://www.avast.com/antivirus

**********************************************************
*
* 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, September 15, 2021

[DMANET] Postdoc positions at the IBS Discrete Mathematics Group, South Korea

The IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea invites
applications for two postdoctoral research fellowship positions.

URL: https://dimag.ibs.re.kr/hiring/

DIMAG is a research group that was established in December 1, 2018 at
the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG
is located at the headquarters of the Institute for Basic Science
(IBS) in Daejeon, South Korea, a city of 1.5 million people.

The position is available for individuals who are within the first
five years after obtaining their Ph.D. at the date of appointment or
expecting to obtain a Ph.D. within three months from the date of
appointment. Successful candidates for postdoctoral research
fellowship positions will be new or recent Ph.D.'s with outstanding
research potential in all fields of discrete mathematics with emphasis
on structural graph theory, extremal graph theory, combinatorial
optimization, matroid theory, or fixed-parameter tractable algorithms.

This appointment is for two years, and the starting salary is no less
than KRW 57,000,000. The appointment is one time renewable up to 3
years in total contingent upon the outstanding performance of the
researcher. The expected appointment date is September 1, 2022. This
is a purely research position and will have no teaching duties.

A complete application packet should include:

1. AMS standard cover sheet (preferred) or cover letter (PDF format)
2. Curriculum vitae including a publication list (PDF format)
3. Research statement (PDF format)
4. Consent to Collection and Use of Personal Information (PDF file
available on the website)
5. At least 3 recommendation letters

For full consideration, applicants should email items 1, 2, 3, and 4
and arrange their recommendation letters emailed to dimag@ibs.re.kr by
December 5, 2021, Sunday.

Recommendations letters forwarded by an applicant will not be considered.

DIMAG encourages applications from individuals of diverse backgrounds.

--
Sang-il Oum (엄상일) https://dimag.ibs.re.kr/home/sangil/
CI, Discrete Mathematics Group, Institute for Basic Science (IBS).
Professor, Dept. of Mathematical Sciences, KAIST.

**********************************************************
*
* 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 and postdoc-level positions in quantum and classical algorithms for optimization

Many expect Quantum Computing to provide crucial breakthroughs for a wide spectrum of challenges; but making progress will require close cooperation of outstanding talent from Quantum Information Theory, Computer Science, Theoretical Physics, Mathematics and Artificial Intelligence.

* Do you have an excellent background in any one of these fields?

* Are you interested in learning even more about the others, while working on interdisciplinary projects?

* Are you motivated by working closely and interactively with colleagues and senior experts from different areas?

* Do you want to work on cutting-edge problems that can have a significant impact?

Then you should consider getting in touch with us!

We are an interdisciplinary group of academic and industrial experts from the mentioned fields, located in Germany (Braunschweig, Hannover, Cologne, Bochum) and Austria (Linz). We have successfully formed a consortium that aims at putting "Computing" into "Quantum Computing", in the course of two related projects. In the project QuBRA, we will evaluate quantum algorithms against best-in-class classical optimization methods and identify the quantum advantage regime. In ProvideQ, we will develop new methods for embedding novel quantum algorithms into frameworks of classical optimization.

Our goal is to recruit a closely-knit multidisciplinary team of up to 20 researchers across physics, mathematics, and computer science for at least three years from 2022. We value creativity, mathematical rigor, and openness to interdisciplinary collaborations.

Positions to be filled include:

• Machine learning (CS) at the Leibniz Universität Hannover, advised by Avishek Anand
• Algorithm Engineering (CS) at TU Braunschweig, advised by Sándor Fekete
• Quantum Algorithms (Physics) at University of Cologne, advised by David Gross
• Quantum Algorithms and Artificial Intelligence (Computer Science) at JKU Linz, advised by Richard Kueng
• Quantum Algorithms (Physics) at the Leibniz Universität Hannover, advised by Tobias J. Osborne
• Quantum Software Engineering (CS), advised by Ina Schaefer
• Quantum Algorithms and Optimization Under Uncertainty (Mathematics) at TU Braunschweig, advised by Sebastian Stiller
• Quantum Algorithms and Quantum Software Engineering (Mathematics/CS) at Ruhr-Universität Bochum, advised by Michael Walter

Candidates should send a CV including certificates and a list of publications to wiebke.moeller@itp.uni-hannover.de <mailto:wiebke.moeller@itp.uni-hannover.de>, putting "quantum positions" in the subject line. In your application, indicate your preferences of which advisor to work with. Please also include electronic contact details of two referees. Deadline is October 15th. Later applications will be considered in case the positions will not have been filled.

The salary is based on the German TV-L E13 pay scale. Applications from candidates with diverse backgrounds are strongly encouraged.
**********************************************************
*
* 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/
*
**********************************************************