Friday, October 23, 2020

[DMANET] Last Call for Papers: EvoCOP 2021 - The 21st European Conference on Evolutionary Computation in Combinatorial Optimisation

(Apologies for cross-posting)

News:

- Fast Track Publication in Evolutionary Computation Journal: Authors nominated
for the best regular paper award will be invited for fast track publication in
the Evolutionary Computation journal (MIT Press). The invited submissions must
significantly extend the conference paper and will undergo peer review.

- EvoStar goes Hybrid!

*************************************************************************************
Last Call for Papers: EvoCOP 2021 - The 21st European Conference on
Evolutionary Computation in Combinatorial Optimisation

http://www.evostar.org/2021/evocop/

April 7 - 9, 2021
Seville, Spain (and online)

held as part of EvoStar (http://www.evostar.org)

Submission deadline: November 1, 2020
*************************************************************************************

The 21st European Conference on Evolutionary Computation in Combinatorial
Optimisation is a multidisciplinary conference that brings together researchers
working on applications and theory of evolutionary computation methods and
other metaheuristics for solving difficult combinatorial optimisation problems
appearing in various industrial, economic, and scientific domains.

Successfully solved problems include, but are not limited to, multi-objective,
uncertain, dynamic and stochastic problems in the context of scheduling,
timetabling, network design, transportation and distribution, vehicle routing,
stringology, graphs, satisfiability, energy optimisation, cutting, packing,
planning and search-based software engineering.

The EvoCOP 2021 conference will be held in the city of Seville, Spain, together
with EuroGP (the 24th European Conference on Genetic Programming), EvoMUSART
(the 10th European conference on evolutionary and biologically inspired music,
sound, art and design) and EvoApplications (the 24th European Conference on the
Applications of Evolutionary Computation), in a joint event collectively known
as EvoStar (Evo*).

Accepted papers will be published by Springer Nature in the Lecture Notes in
Computer Science series. (See https://link.springer.com/conference/evocop for
previous proceedings.)

Download the CFP in PDF format:
http://www.evostar.org/2021/wp-content/uploads/2020/06/evo2021_tracks_flyers_evocop.pdf

The best regular paper presented at EvoCOP 2021 will be distinguished with a
Best Paper Award. Authors nominated for the best regular paper award will be
invited for fast track publication in the Evolutionary Computation journal
(MIT Press). The invited submissions must significantly extend the conference
paper and will undergo peer review.


**** Areas of Interest and Contributions ****

EvoCOP welcomes submissions in all experimental and theoretical aspects of
evolutionary computation and other metaheuristics to combinatorial optimisation
problems, including (but not limited to) the following areas:

* Applications of metaheuristics to combinatorial optimisation problems
* Theoretical developments
* Neighbourhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Constraint-handling techniques
* Parallelisation and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Automatic algorithm configuration and design

Prominent examples of metaheuristics include (but are not limited to):

* Evolutionary algorithms
* Estimation of distribution algorithms
* Swarm intelligence methods such as ant colony and particle swarm optimisation
* Artificial immune systems
* Local search methods such as simulated annealing, tabu search, variable
neighbourhood search, iterated local search, scatter search and path relinking
* Hybrid methods such as memetic algorithms
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Surrogate-model-based methods

Notice that, by tradition, continuous/numerical optimisation is *not* part of
the topics of interest of EvoCOP. Interested authors might consider submitting
to other EvoStar conferences such as EvoApplications.


**** Submission Details ****

Paper submissions must be original and not published elsewhere. The submissions
will be peer reviewed by members of the program committee. The reviewing
process will be double-blind, please omit information about the authors in the
submitted paper. Submit your manuscript in Springer LNCS format:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0

Page limit: 16 pages

Submission link: https://easychair.org/my/conference?conf=evo2021

The authors of accepted papers will have to improve their paper on the basis of
the reviewers' comments and will be asked to send a camera-ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference, attend the conference and present the work.


**** Important Dates ****

Submission deadline: November 1, 2020
EvoStar: April 7-9, 2021


**** EvoCOP Programme Chairs ****

Sébastien Verel
Université du Littoral Côte d'Opale (ULCO), France
verel@univ-littoral.fr

Christine Zarges
Aberystwyth University, Wales, UK
c.zarges@aber.ac.uk


----------------------------------------------------------------------------------------------------------------------
Prifysgol y Flwyddyn ar gyfer Ansawdd y Dysgu a Phrofiad Myfyrwr
University of the year for Teaching Quality and Student Experience
(The Times and Sunday Times, Good University Guide 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] Call for Positions - Institute of Engineering Sciences - University of O'Higgins (Chile)

Dear colleagues,

The University of O'Higgins (Chile) has opened new academic positions in
multiple areas (Engineering, Health, Agriculture, Social and Education
Sciences). In the case of the *Institute of Engineering Sciences*, we
invite candidates in all Engineering areas to apply. Preference will be
given to applications to the following areas:

• *Industrial Engineering or related areas*, specialized in Business
Intelligence, Market Intelligence, Economy, Industrial Processes,
Management, Public Policies, Industrial Organization, or Finance.
• Computer Science or related areas, specialized in Software Engineering,
Data Engineering, or Security.
• Artificial Intelligence or related areas, specialized in Machine
Learning, Data Science, or Natural Language Processing.
• Geological Engineering or related areas, specialized in modeling in
Hydrology and Hydrogeology, or Environmental Geology.
• Mechanical Engineering, Chemical Engineering, or related areas,
specialized in Asset Management and Maintenance, Design of Machines and
Products, Thermal Sciences, or Material Sciences.
• Electrical Engineering or related areas, with specialization in
Telecommunication, Telematics, Sensor Networks, Computer Networks, or
Remote Sensing.

Experience and interest in the following problem areas will be positively
evaluated: Climate Change, Smart Agriculture, Geological Hazard, Energy,
Management of Hydric Resources, Transport, Pollution, and Circular Economy.

Deadline: November 30th, 2020

Application Platform: www.uoh.cl/#concurso-academico (in Spanish).

Complete Call Information: http://tiny.cc/uoh2020english

The University of O'Higgins is a state institution in the Region of O'
Higgins, Chile. Its main campus is located in Rancagua, about 80 km south
of Santiago. The Institute of Engineering Sciences has as main mission the
development of basic and applied research in engineering sciences. With a
multidisciplinary and interdisciplinary spirit, and with a focus on
addressing problems of the Region of O'Higgins, it aims to generate
impactful research and technological development with a global projection.

For more information, you can visit our webpage or contact me at
gonzalo.munoz@uoh.cl

Best regards.

**********************************************************
*
* 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:-- 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020)

** Final Call for Papers - please circulate this CFP to your colleagues and
networks **

-- 12th International Conference on Soft Computing and Pattern Recognition
(SoCPaR 2020) --

http://www.mirlabs.org/socpar20

http://www.mirlabs.net/socpar20

On the World Wide Web

* December 15-18, 2020 *

SoCPaR 2019 Proceedings: https://www.springer.com/gp/book/9783030493448

Indexed by: SCOPUS, Thomson ISI Web of Science, DBLP etc.

History of SoCPaR series: http://www.mirlabs.net/socpar19/previous.php

SoCPaR 2020: Scopus Proceedings

All accepted and registered papers will be published in AISC Series of
Springer, indexed in ISI Proceedings, EI-Compendex, DBLP, SCOPUS, Google
Scholar and Springerlink.

** Important Dates **

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

Paper submission due: October 31, 2020 (Extended Deadline)

Notification of paper acceptance: November 15, 2020

Registration and Final manuscript due: November 25, 2020

Conference: December 15-18, 2020

**About SoCPaR 2020**

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

After the success of the 11th International Conference on Soft Computing
and Pattern Recognition (SoCPaR 2019), SoCPaR 2020 is organized to bring
together worldwide leading researchers and practitioners interested in
advancing the state of the art in Soft Computing and Pattern Recognition,
for exchanging knowledge that encompasses a broad range of disciplines
among various distinct communities. It is hoped that researchers and
practitioners will bring new prospects for collaboration across disciplines
and gain inspiration to facilitate novel breakthroughs. The themes for this
conference are thus focused on "Innovating and Inspiring Soft Computing and
Intelligent Pattern Recognition".

**Submission Guidelines**

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

Submission of 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:

http://www.springer.com/series/11156

SoCPaR'20 Submission Link:

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

** SoCPaR 2020 Organization **

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

General Chairs

Ajith Abraham, Machine Intelligence Research Labs, USA

Yukio Ohsawa, The University of Tokyo, Japan
Seán McLoone, Queen's University Belfast, UK

Program Chairs
Biju Issac, Northumbria University, UK
Isabel Jesus, ISEP, Portugal
M. A. Jabbar, Vardhaman College of Engineering, Hyderabad, India

**Technical Contact**

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

Dr. Ajith Abraham

Email: ajith.abraham@ieee.org

Note: We sincerely hope that this conference announcement is interesting
for you. If you are not interested or wish to unsubscribe then please reply
to this email and we will remove your name from our future emails. Our
apologies for any inconvenience.

--
Best Regards
Dr. Sanju Tiwari (PhD, Post-Doc)
Sr. Researcher
Universidad Autonoma de Tamaulipas, Mexico
General Chair *KGSWC-2020* (First Indo-American Conference)
http://www.kgswc.org/indo-american/
Member IEEE
Member Machine Intelligence Research Labs(MIR Lab), USA

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

[DMANET] Final CFP:-- 16th International Conference on Information Assurance and Security (IAS 2020)

** Final Call for Papers - please circulate this CFP to your colleagues and
networks **

-- 16th International Conference on Information Assurance and Security (IAS
2020) --

http://www.mirlabs.org/ias20

http://www.mirlabs.net/ias20

On the World Wide Web

* December 15-18, 2020 *

IAS 2019 Proceedings: https://www.springer.com/gp/book/9783030493356

Indexed by: SCOPUS, Thomson ISI Web of Science, DBLP etc.

History of IAS series: http://www.mirlabs.net/ias19/previous.php

IAS 2020: Scopus Proceedings

All accepted and registered papers will be published in AISC Series of
Springer, indexed in ISI Proceedings, EI-Compendex, DBLP, SCOPUS, Google
Scholar and Springerlink.

** Important Dates **

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

Paper submission due: October 31, 2020 (Extended Deadline)

Notification of paper acceptance: November 15, 2020

Registration and Final manuscript due: November 25, 2020

Conference: December 15-18, 2020

**About IAS 2020**

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

Information assurance and security has become an important research issue
in the networked and distributed information sharing environments. Finding
effective ways to protect information systems, networks and sensitive data
within the critical information infrastructure is challenging even with the
most advanced technology and trained professionals. The 15th International
Conference on Information Assurance and Security (IAS) aims to bring
together researchers, practitioners, developers, and policy makers involved
in multiple disciplines of information security and assurance to exchange
ideas and to learn the latest development in this important field.

**Submission Guidelines**

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

Submission of 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:

http://www.springer.com/series/11156

IAS'20 Submission Link:

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

** IAS 2020 Organization **

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

General Chairs

Ajith Abraham, Machine Intelligence Research Labs, USA

Biju Issac, Northumbria University, UK
Abdelkrim Haqiq, Hassan 1st University, Faculty of Sciences and Techniques,
Morocco


Program Chairs
Kanwalinderjit Gagneja, California State University, Bakersfield, USA
Álvaro Herrero, Universidad de Burgos, Spain
M. A. Jabbar, Vardhaman College of Engineering, Hyderabad, India

**Technical Contact**

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

Dr. Ajith Abraham

Email: ajith.abraham@ieee.org

Note: We sincerely hope that this conference announcement is interesting
for you. If you are not interested or wish to unsubscribe then please reply
to this email and we will remove your name from our future emails. Our
apologies for any inconvenience.

--
Best Regards
Dr. Sanju Tiwari (PhD, Post-Doc)
Sr. Researcher
Universidad Autonoma de Tamaulipas, Mexico
General Chair *KGSWC-2020* (First Indo-American Conference)
http://www.kgswc.org/indo-american/
Member IEEE
Member Machine Intelligence Research Labs(MIR Lab), USA

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

[DMANET] Ph.D Positions in Algorithms, University of Augsburg

The Faculty of Applied Computer Science of Augsburg University (Prof.
Dr. Tobias Mömke) is inviting applications for one

PhD position

starting at the earliest possible date. The contract will initially be
restricted to one year. Given the respective preconditions, an extension
is planned. Part-time employment is possible. The salary is based on
personal and collectively agreed conditions up to Entgeltgruppe 13 TV-L.

Tasks

- Scientific research on algorithms
- Participation in teaching and student supervision
- Pursuit of further scientific qualification (e.g., doctorate)

We Offer

- Collaboration in research on up-to-date scientific questions, in
particular within
  Approximation Algorithms, Online Algorithms and Algorithms for Big Data
- Active support for work on individual research questions
- Possibility to attend workshops, conferences and summer schools

We Expect

- A finished Master's degree (or equivalent) with very good grades in
Computer Science, Mathematics or another related field (e.g., Physics)
- Fun pursuing mathematical scientific work and knowledge transfer
- Ability to work self-sufficiently and good communication skills

The required qualification should be part of the application documents
in form of transcripts.

Since most of the teaching is done in German language, non-German
speakers should give believable evidence that they are able to learn
German within a short time frame.

The University of Augsburg promotes gender equality at work. Women are
expressly asked to apply. The University of Augsburg particularly
supports the compatibility of family and work. For further information,
please contact the women's representative of the Faculty of Applied
Computer Science. Disabled candidates with otherwise equal suitability,
ability and subject-specific performance will be preferred.

Please compile your application composed of the habitual documents (CV,
transcripts of grades, description of scientific interests, name and
contact details of one or two references) to a single pdf file and
e-mail it to Prof. Dr. Tobias Mömke (moemke@informatik.uni-augsburg.de)
until

15 November 2020.

Inquiries can be directed to Prof. Dr. Tobias Mömke
https://www.uni-augsburg.de/en/fakultaet/fai/informatik/prof/raa/team/tm/

--
Prof. Dr. Tobias Mömke
University of Augsburg
Room 1026, Building N
Universitätsstraße 6a
86159 Augsburg
Germany

Phone: +49 821 598 2449


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

[DMANET] Postdoc in Lyon or Saint-Etienne

The Excellence Laboratory Milyon (Labex Milyon) opens the 2021 campaign of postdoctoral researchers in Lyon or Saint-Etienne in Mathematics, Computer Science and their interactions (including some aspects of theoretical physics).

Milyon offers three postdoctoral positions of two years with no teaching load for the period 2021–2023.

More information on the link below:
https://milyon.universite-lyon.fr/postdoctoral-positions-2021-2023--130160.kjsp?RH=1571748911317

Deadline for applications: January 6th 2021

______________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon
http://perso.ens-lyon.fr/nicolas.trotignon/index.html


**********************************************************
*
* 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] 10 PhD Positions in Algorithmics and Stochastics and in the NETWORKS project (the Netherlands)

10 PhD Positions in Algorithmics and Stochastics and in the NETWORKS project (the Netherlands)

The NETWORKS project is a collaboration of world-leading researchers from four institutions in The Netherlands: TU Eindhoven<https://www.youtube.com/watch?v=Bxx8oosZf9Q&feature=youtu.be>, University of Amsterdam<https://youtu.be/KIZMIdZ0ljo>, Leiden University<https://www.youtube.com/watch?v=3gDfOvufoQQ> and the Centrum Wiskunde & Informatica (CWI)<https://www.youtube.com/watch?v=XCfI7_rLeho>. Research in NETWORKS focuses on stochastics and algorithmics for network problems. NETWORKS offers a highly stimulating research environment and an extensive training program for PhD students.

Recently NETWORKS was awarded a COFUND grant the Marie Skłodowska-Curie Actions, funded by the European Commission. The grant allows NETWORKS to expand its activities by opening a number of additional positions for PhD students. As a NETWORKS-COFUND PhD student you can define your own PhD project in one of the research areas mentioned above, in collaboration with your NETWORKS supervisors.
Application deadline
November 30, 2020
Contract
full time employment contract for 4 years
Salary indication
from €2.325 to €2.972 in 4 years
Location
The Netherlands (Amsterdam, Eindhoven, Leiden)

Are you interested in the stochastics and algorithmics behind network problems? And would you like to be part of this project with its many activities? Then go to

https://www.thenetworkcenter.nl/Open-Positions/openposition/29/14-PhD-Positions-in-Stochastics-and-Algorithmics

On this website you can find an extensive information package about the positions and possible NETWORKS supervisors, and further details about the application procedure. Applying should also be done through the above website.

**********************************************************
*
* 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, October 22, 2020

[DMANET] PhD position in University of Delaware

We are looking for excellent candidates for Ph.D. positions in the
Department of Computer and Information Sciences in the University of
Delaware effective Spring 2021 and Fall 2021. The students will work under
the supervision of Dr. Ilya Safro. There are several open positions in
algorithms for quantum computing, graphs, machine learning, combinatorial
scientific computing, and large-scale optimization. Some projects will
include collaboration with and internships at national labs.

The ideal candidate should have the BSc or MSc degree in computer science,
mathematics or physics and a basic background in
+ theoretical computer science, discrete mathematics, algorithms
+ machine learning
+ numerical methods
+ Python, C/C++

Basic knowledge in quantum computing, and optimization is a big plus. Some
(academic or industrial) experience in one of the following areas will be
considered as an advantage: HPC and parallel programming/MPI/OpenMP/Hadoop,
graph/network libraries, scientific computing libraries, deep learning and
such libraries as Keras and Tensorflow.

Please email your application to Ilya Safro at isafro@udel.edu and apply on
the UD webpage. The application should include a single pdf with the cover
letter or/and essay, resume, grades, and contact details of 2-3 references.
The subject line must contain "PhD Application (QC)" for quantum computing
or "PhD Application (ACS)" for all other areas.

The 7th oldest institution of higher education in the USA, the University
of Delaware (with about 18,000+ undergraduate and 3,000+ full-time graduate
students) is conveniently situated halfway between Washington, D.C., and
New York City, and about forty minutes away from Baltimore and
Philadelphia. The University is a home to such world-class research centers
as Data Science Institute, Delaware Energy Institute, Delaware
Biotechnology Institute, National Institute for Innovation in Manufacturing
Biopharmaceuticals, and many more.
Additional information about the Department and the University is available
at: www.cis.udel.edu and www.udel.edu/about, respectively.


--
Dr. Ilya Safro
Associate Professor
Computer and Information Sciences
University of Delaware
http://www.eecis.udel.edu/~isafro

**********************************************************
*
* 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] Full Professorship/Chair in Hardware-Aware Combinatorial Optimization at TU Hamburg

FULL PROFESSORSHIP/CHAIR IN HARDWARE-AWARE COMBINATORIAL OPTIMIZATION AT
TU HAMBURG
--

Hamburg University of Technology (www.tuhh.de <www.tuhh.de>) is a modern
and dynamic university, striving for international excellence in
research and teaching. It sets ideal conditions for unlocking the
knowledge and innovation potential of today's technological challenges
by combining its engineering expertise in the three focal areas of Green
Technologies, Life Science Technologies, and Aviation and Maritime
Systems with cross-cutting research on digitalization, engineering
methods, and new materials.

The School of Electrical Engineering, Computer Science and Mathematics
at Hamburg University of Technology (TUHH) seeks applications for an

ENDOWED PROFESSORSHIP (W3) IN THE FIELD OF HARDWARE-AWARE COMBINATORIAL
OPTIMIZATION (Ref. No. P2011).

Our goal is to establish a group that excels at developing and
implementing state-of-theart optimization techniques on modern computing
architectures at hardware level. TUHH is in close alignment with the
sponsor Fujitsu that the emphasis and focus of this chair will be on
interdisciplinary research within and beyond TUHH, enabling next
generation IT architectures to support technical, medical, and other
sciences and advancing pioneering industrial applications beyond what is
possible today. The successful candidate will have an exceptional record
in foundational research and combine his/her expertise with a strong
interest in interdisciplinary work with groups in engineering and
logistics at TUHH.

Your tasks:
- mapping industrial optimization problems to modern hardware
architectures such as parallel or quantum computing
- algorithmic paradigms for hardware architectures as mentioned above
- industrial optimization problems in machine learning
- efficient close-to-hardware implementation of optimization techniques
- estimating real-world performance of industrial optimization processes.

The successful candidate is expected to offer courses in the degree
programs at TUHH both at undergraduate and graduate level, as well as to
engage in academic self-governance and further development of the
curricula offered by TUHH. The position is to be filled as soon as possible.

TUHH is an equal opportunity employer and particularly welcomes and
encourages applications from women. It is certified as a family-friendly
university and supports dual careers.

Applications by disabled persons with equal qualifications will be given
preference. The deadline for applications is November 29,2020.
Applications can be submitted in German or English. Please upload your
application (including Cover Letter, CV, Ref. No., list of publications,
relevant certificates, overview of research activities and teaching
experience) at the official application portal at
https://stellenportal.tuhh.de/jobposting/4e98d49c7dee223203482d1e1316990eac777fe1
<https://stellenportal.tuhh.de/jobposting/4e98d49c7dee223203482d1e1316990eac777fe1>.

In case of any questions, feel free to contact TUHH's Vice President of
Research, Prof. Dr.-Ing. Irina Smirnova (berufungen@tuhh.de
<mailto:berufungen@tuhh.de>). The legal framework of the Federal
Republic of Germany applies (in Hamburg the law is applied pursuant to
Section 15 HmbHG).


**********************************************************
*
* 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 applied geometry - TU Graz

[apologies for cross-posting]

Dear colleagues,

A PhD student position in applied geometry is available at the Institute for Geometry of the Graz University of Technology, Austria, starting December 2020 at the earliest.

The position is part of the "Discretization in Geometry and Dynamics<https://www.discretization.de/>" effort (SFB Transregio 109), in particular project A05<https://www.discretization.de/projects/A05/> . The general focus is on discrete geometry with an emphasis on structure preservation from the smooth theory. In particular A05 aims at the study of conformal deformations of discrete surfaces, discrete surface and curve flows, as well as their applications in geometry processing / modeling, computer graphics, and physical simulation.

We are looking for candidates with an interest in geometry processing with a strong mathematical component, at the interface between theory and efficient algorithms. At least some programming experience (C++/Matlab/Mathematica/Python) will be required, research experience is a plus, as is experience in differential geometry / partial differential equations. Successful candidates must hold a Master's or Diplom degree in Mathematics, Applied Mathematics, Computer Science or similar, and should be able to work independently and as part of a very international group.

The official instructions for the application procedure are published by TU Graz at https://www.tugraz.at/sites/mibla/mitteilungsblaetter/studienjahr-20202021/2-stueck-21-oktober-2020/ (in German). For further information, candidates can contact me (Olga Diamanti) at [olga.diamanti AT tugraz DOT at].

Please feel free to forward to any interested colleagues or students.

Thank you, and best regards,
Olga Diamanti



-----------------------------------------------------------
Olga Diamanti Institut fuer Geometrie, TU Graz
olga.diamanti@tugraz.at<mailto:olga.diamanti@tugraz.at> Kopernikusgasse 24/IV
http://olga-diamanti.net/ A-8010 Graz
-----------------------------------------------------------


**********************************************************
*
* 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, October 21, 2020

[DMANET] Call for Papers: 37th SoCG - Buffalo, New York - June 7-11, 2021

******* Call for Papers: 37th SoCG - Buffalo, New York - June 7-11, 2021 *******

The 37th International Symposium on Computational Geometry (SoCG 2021) will be held in Buffalo, New York, June 7-11, 2021, as part of the Computational Geometry (CG) Week. We invite submissions of high quality that describe original research on computational problems in a geometric setting. Topics of interest include, but are not limited to:
● Design, analysis, and implementation of geometric algorithms and data structures;
● Lower bounds on the computational complexity of geometric problems;
● Mathematical, numerical, and algebraic issues arising in the formulation, analysis, implementation, and experimental evaluation of geometric algorithms and heuristics;
● Discrete and combinatorial geometry;
● Computational topology, topological data analysis, and topological combinatorics;
● Applications of computational geometry in any field.

On these topics, contributions to mathematical foundations, algorithmic complexity, experiments & evaluation, and/or applications will be considered.

*Conference Web Page*

https://cse.buffalo.edu/socg21/

*EasyChair Link*

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

*Important Dates*

● Nov. 25, 2020: Abstracts due (23:59 AoE (anywhere on Earth))
● Dec 2, 2020: Papers due (23:59 AoE (anywhere on Earth))
● Feb 10, 2021: Notification of acceptance/rejection
● Mar 18, 2021: Final versions of accepted papers due
● June 7-11, 2021 (Monday-Friday): Symposium

*Submission Guidelines*

Format. Submissions must be formatted in accordance with the LIPIcs proceedings guidelines. Authors must use the LaTeX class file socg-lipics-v2019.cls, which is a wrapper around the standard LIPIcs class. Style files and instructions are available from the conference webpage.

Submissions must not exceed 500 lines, excluding front matter (title, authors, and affiliations), references, and a clearly marked appendix (further described below), but including all other lines (in abstract, algorithms, tables, captions, etc.). The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors to not exceed 500 lines even if some lines are not counted automatically.

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

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

Previous or simultaneous submissions. Results previously published or accepted for publication in the proceedings of another conference cannot be submitted. Simultaneous submissions of the results to another conference with published proceedings are not allowed. Exempted are workshops and conferences without formal proceedings, but possibly with handouts containing short abstracts. Results that have already been accepted (with or without revision) for publication in a journal at the time of their submission to the symposium are not allowed. A paper submitted to a journal but not yet accepted for publication can be submitted to the symposium. In such cases, the authors must mention this on the front page of the submission and clearly identify the status of the journal submission at the date of the full paper submission deadline.

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

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

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

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

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

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

Guidelines for reviewers. The guidelines are available from the conference webpage.

*Accepted Papers*

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

Presentation, awards, and special issues. An author of each accepted paper will be expected to attend the symposium and present the paper (approximately 20 minutes). Given the developing COVID-19 pandemic, the format of both attendance and presentation will be clarified closer to the event.
Awards will be given for the best paper and for the best student presentation. Authors of a selection of papers from the symposium will be invited to submit extended versions of their papers to special issues of Discrete & Computational Geometry and Journal of Computational Geometry. As in the previous years, the authors of the best paper will be invited to submit an extended version of their paper to Journal of the ACM.

*Code of Conduct*

SoCG is dedicated to providing an environment that is free from harassment, bullying, discrimination, and retaliation for all participants. All attendees, speakers, sponsors, and volunteers at our conference are required to agree with the CG Week code of conduct. If an author has a conflict of such nature with a potential reviewer, and the author has sufficient grounds to believe that the review would be negatively biased, then the author is asked to declare this conflict by contacting a SoCG advocate, such as Anne Driemel, who will treat any supporting information confidentially. For a list of SoCG advocates with contact information, please refer to the webpage (http://computational-geometry.org/codeofconduct.html).

*Program Committee*

● Eyal Ackerman (University of Haifa at Oranim, Israel)
● Pankaj K. Agarwal (Duke University, USA)
● Ulrich Bauer (Technical University of Munich, Germany)
● Kevin Buchin; co-chair (TU Eindhoven, Netherlands)
● Jean Cardinal (Université Libre de Bruxelles, Belgium)
● Éric Colin de Verdière; co-chair (CNRS, LIGM, Marne-la-Vallée, France)
● Guilherme Dias da Fonseca (Aix-Marseille University, France)
● Anne Driemel (Bonn University, Germany)
● Ioannis Z. Emiris (NK University of Athens, and "Athena" RC, Greece)
● Brittany Terese Fasy (Montana State University, USA)
● Stefan Felsner (TU Berlin, Germany)
● Bernd Gärtner (ETH Zurich, Switzerland)
● André Lieutier (Dassault Systèmes, France)
● Dmitriy Morozov (Lawrence Berkeley National Laboratory, USA)
● Wolfgang Mulzer (FU Berlin, Germany)
● Amir Nayyeri (Oregon State University, USA)
● Jeff M. Phillips (University of Utah, USA)
● Eva Rotenberg (Technical University of Denmark)
● Michiel Smid (Carleton University, Canada)
● Diane L. Souvaine (Tufts University, USA)
● Jonathan Spreer (University of Sydney, Australia)
● Konstantinos Tsakalidis (University of Liverpool, UK)
● Antoine Vigneron (Ulsan National Institute of Science and Technology, Republic of Korea)
● Meirav Zehavi (Ben-Gurion University, Israel)

**********************************************************
*
* 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: PDCAT-PAAP 2020 at Shenzhen, China, Dec. 28-30, 2020

[Apologies for cross posting]

=============================================================
The Joint International Conference PDCAT-PAAP 2020,

the 21st International Conference on Parallel and Distributed Computing,
Applications and Technologies (PDCAT'20) and the 11th International
Symposium on Parallel Architectures, Algorithms and Programming (PAAP'20)


Shenzhen, China

December 28-30, 2020.

http://hpcc.siat.ac.cn/meeting/pdcat-paap2020/index.html

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


The International Conference on Parallel and Distributed Computing,
Applications and Technologies (PDCAT) and International Symposium on
Parallel Architectures, Algorithms and Programming (PAAP) are major forums
for scientists, engineers, and practitioners throughout the world to
present the latest research, results, ideas, developments and applications
in all aspects of parallel and distributed computing, parallel
architectures, algorithms and programming techniques. We devoutly wish
participants to learn the basic theory of a gradual approach, practical
experimental data, new business models, and the latest academic trends from
this conference. During these 20 years, PDCAT and PAAP had been
successfully held in many countries including China, Japan, Korea,
Singapore, Australia and New Zealand across Asia-Oceania.

Extended versions of selected papers will be recommended to special issues
of some SCI-indexed international journals. The tentative journals include
Tsinghua Science and Technology, Computers and Electrical Engineering,
Wireless Communications and Mobile Computing, Concurrency and Computation:
Practice and Experience, Computer Science and Information Systems, IEEE
Access. The invited papers will go through the normal reviewing process.


The steering committee, program, and organization chairs of PDCAT and PAAP
are closely monitoring the COVID-19 situation. The conference will be a mix
of physical and virtual attendance. Our community's health and safety are
our priority: attending the physical meeting and giving the talks will be
safe. A virtual presence will be possible in case of remaining safety
concerns or travel restrictions. The authors of the accepted papers will
have the choice to attend the conference virtually.


We are inviting new and unpublished papers on, but not limited to, the
following topics:

Networking and Architectures:

Multi/many-core architectures

Interconnection networks

Cluster, grid and cloud computing systems

Network-on-chip architectures

Survivable and safety-critical systems

Ubiquitous computing systems

Sensor, wireless and RFID systems

Reconfigurable architectures

Self-healing, self-protecting network systems

Algorithms and Applications:

Combinatorial and graph algorithms

Numeric algorithms

Task mapping and job scheduling

Parallel/distributed databases and knowledge discovery

High-performance scientific computing

Resource allocation and management

Power-aware Computing Secure distributed computing

Network routing and traffic control

Parallel Programming:

Multi/many-core programming

Parallel programming theory and models

Formal methods and verification

Middleware for parallel systems

Parallel programming languages

Parallel compilers and runtime systems

Performance analysis, debugging and optimization

Parallel libraries and application frameworks

High Performance Systems:

Operating systems for parallel/distributed systems

High-performance computer arithmetic

Memory hierarchy and caching

Performance tuning, optimization and profiling

Human-computer interaction in parallel/distributed systems

Photonic and quantum computing

Media computing in parallel/distributed systems

Software engineering for parallel/distributed system

Privacy and Security:

Cloud security

Data privacy protection

Cryptography Intrusion detection

Copyright protection

Access control

Data provenance

Trusted computing

Big Data Processing and Deep Learning:

Mass data stream processing in clouds

Big data models and computation theory

Big data mining and fusion

Dimension reduction for large data sets

Big data placement, scheduling and optimization

Multi-source data processing and integration

Deep learning models Deep learning applications

All submissions are electronic via Springer's Online Conference Service
(OCS), and the submission server is now available at

https://ocs.springer.com/ocs/home/PDCAT-PAAP2020

Important Dates:

Paper submission: November 10, 2020

Notification acceptance: November 24, 2020

Camera-ready and Registration: December 01, 2020

Conference date: December 28-30, 2020

******** Main Organizers ********

Honorary Chair

Guoliang Chen, Nanjing Univ of Posts & Telecom, China

General Chairs

Jianping Fan, Shenzhen Institutes of Advanced Technology, CAS, China

Shengzhong Feng, Shenzhen Supercomp Centre, China

Hong Shen, Sun Yat-Sen University, China

Chengzhong Xu, University of Macau, China

Program Chairs

Yong Zhang, Shenzhen Institutes of Advanced Technology, CAS, China

Hui Tian, Griffith University, Australia

Haiying Shen, University of Virginia, USA

Francis Lau, The University of Hong Kong, China

Li Ning, Shenzhen Institutes of Advanced Technology, CAS, China

Advisory Chair

Francis Chin, The University of Hong Kong, China

Publications Chairs

Vincent Chau, Shenzhen Institutes of Advanced Technology, CAS, China

Yingpeng Sang, Sun Yat-sen University, China

Local Arrangement Chairs

Fumin Qi, Shenzhen Supercomp Centre, China

Xuelei Li, Shenzhen Institutes of Advanced Technology, CAS, China

Registration and Finance Chair

Yicheng Xu, Shenzhen Institutes of Advanced Technology, CAS, China

Contact us by: pdcat-paap2020@siat.ac.cn

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

[DMANET] Fully-funded PhD position in Hamburg on Algorithms/Scheduling

FULLY-FUNDED PHD POSITIONS IN ALGORITHMS/SCHEDULING AT HAMBURG
UNIVERSITY OF TECHNOLOGY (TUHH)
--
The Institute of Algorithms and Complexity at TUHH: Hamburg University
of Technology (www.algo.tuhh.de <https://tuhh.de>) in Hamburg, Germany
offers an exciting opportunity to work in a PhD program at the forefront
of algorithms and computer sciences.

The position is on algorithms/scheduling and offers the chance to
develop new algorithmic approaches to scheduling applications. The new
algorithms will build on advanced methods from combinatorial
optimization, mathematical programming, (mixed-)integer programming,
approximation algorithms and fixed-parameter tractability. For a first
glimpse, we refer to the survey on parameterized algorithms for
scheduling problems (https://arxiv.org/pdf/1709.01670.pdf
<https://arxiv.org/pdf/1709.01670.pdf>).

The position is fully-paid and offered with an employment contract for 3
years. It comes with social security and generous travel money. We
provide close supervision and support by a panel of established
professors and scientists. Transferable skills and career development
are an integral part of the program.

The position is within Institute for Algorithms and Complexity
(www.algo.tuhh.de <https://www.algo.tuhh.de>), whose research covers a
broad spectrum of algorithmic research; this includes big data
algorithms, foundations of data science, combinatorial optimization,
approximation and parameterized algorithms, and applications in
operations research and discrete mathematics. The institute hosts
several international researchers, so English is used on a daily basis
as a working language.

The institute is located in the newly built Hamburg Innovation Port
(www.hamburg-innovation-port.com/wp-content/uploads/2018/09/01-HIPtuhhlogowasser_web.jpg
<https://www.hamburg-innovation-port.com/wp-content/uploads/2018/09/01-HIPtuhhlogowasser_web.jpg>),
which is located right at the Harburg harbour with great views of the
harbour and Hamburg's famous opera house (Elbphilharmonie). Several
other institutes of the TU Hamburg are located in the area, as well as
DASHH - Data Science in Hamburg, the Helmholtz Graduate School for the
Structure of Matter, and the German Air and Space Research Center (DLR).
They are all located in the Free and Hanseatic City of Hamburg, which is
Germany's second largest city, home to a population of about 1.8 million
people. It is a famous city of entertainment, trade and commerce, with
several universities and much research in algorithms.

TU Hamburg offers several attractive benefits, including subsidized
public transport for the Hamburg metropolitan area, a sports centre on
campus, family-friendly working hours, healthy campus initiatives, and more.

An excellent Master degree in Computer Science, (Applied) Mathematics,
Operations Research, Engineering or related field is required. Affinity
with optimization, algorithms, complexity theory, or discrete
mathematics is preferred. The salary of the position is determined
according to level TV-L E-13 of the German public sector. The exact
amount of salary depends on experience, family circumstances, tax
classification and other factors. Travel funding is available, for
attending conferences and workshops, and visiting other researchers.

Interested individuals should apply using the official application
portal of the vacancy:
https://stellenportal.tuhh.de/en/jobposting/4ee4c6fd187866f973b5acd72a1f5ad9a5368f4d0/apply
<https://stellenportal.tuhh.de/en/jobposting/4ee4c6fd187866f973b5acd72a1f5ad9a5368f4d0/apply>.
Applications should be submitted in English. Applications received by 18
November 2020 will receive full consideration. Applications should
include a curriculum vitae, a letter of motivation, names and a detailed
list of university courses with grades. If the candidate wishes, he or
she may provide contact information of one or two letter writters who
are acquainted with the applicant's previous academic activity. Any
questions regarding the position should be directed to Matthias Mnich
(matthias.mnich@tuhh.de <mailto:matthias.mnich@tuhh.de>).

Hamburg University of Technology regards diversity as an integral part
of academic excellence and is committed to employment equity and
accessibility for all employees. As such, we encourage applications from
women, persons with disabilities, members of diverse gender identities,
and others who may contribute to the further diversification of ideas.
In Hamburg, you will have the opportunity to work across disciplines and
collaborate with an international community of scholars and a diverse
student body.

**********************************************************
*
* 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] Third Computational Geometry Challenge: First Announcement

Dear colleagues,

We are happy to announce the Third Computational Geometry Challenge,
as part of CG Week in Buffalo, USA, June 7-11, 2021.

As in the last years, the objective will be to compute good solutions to instances
of a difficult geometric optimization problem. The specific problem chosen for
the 2021 Challenge is „Coordinated Motion Planning", as follows.
(See the website
https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2021/#problem-description
for illustrations and animations.)

Given a set of n axis-aligned unit-square „robots" in the plane,
a set S = {s_1,…,s_n} of n non-overlapping „start" pixels of the integer grid,
and a set T = {t_1,…,t_n} of n non-overlapping „target" pixels of the integer grid.
During each unit of time, robots can move (at unit speed) in direction north/south/east/west
to adjacent pixels, provided they stay disjoint from all other robots.
(This condition has to be satisfied at all times, not just when robots are at pixel positions.
For example, if there are robots at each of the adjacent pixels (x,y) and (x+1,y),
then the robot at (x,y) can move east into position (x+1,y) only if the robot
at (x+1,y) moves east at the same time, so the two robots remain in contact,
during the movement, but never overlap.)
In addition, there may be a set of obstacles, consisting of a number of blocked pixels
that cannot be used by robots.

The task is to compute a feasible set of trajectories for all robots i that moves each of
them from s_i to t_i.

We will run the challenge in two separate categories, with the two following objective functions:

(A) minimize the makespan, i.e., the time until all robots have reached their destinations;
(B) minimize the overall energy, i.e., the total distance traveled by all robots.

The problem is motivated by questions of multi-object motion planning, such as robot navigation
and air traffic control. Even the version considered in the Challenge is known to be NP-complete;
see [1], and [2] for an illustrating video.

Details of the competition (such as benchmark instances, data formats, and rules for
submission and evaluation) will be announced in coming weeks; see the timeline below.

The contributors with the most outstanding solutions will be recognized at CG Week
and invited to present their results, both at the event and in the proceedings.

We are looking forward to your contributions and welcome questions and comments!

Challenge Team:
----------------------
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Joe Mitchell

Advisory Board:
---------------------
Bill Cook, Andreas Fabri, Michael Kerber, Philipp Kindermann, Kevin Verbeek

Timeline:
------------
- November 15, 2020: Release of instances, detailed rules, start of contest

- February 15, 2021: Contest closes, winners are invited to submit an abstract
for the SoCG proceedings by early March

- March 1, 2021: First version of proceedings abstracts due for screening and editing

- March 15, 2021: Feedback on abstracts, notification of acceptance,
details of final revision

- March 31, 2021: Final versions due

References:
----------------
[1] E.D. Demaine, S.P. Fekete, P. Keldenich, H. Meijer, C. Scheffer.
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM Journal on Computing, Vol. 48, No. 6, pp. 1727-1762, 2019

[2] A.T. Becker, S.P. Fekete, P. Keldenich, M. Konitzny, L. Lin, C. Scheffer.
Coordinated Motion Planning: The Video.
In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), pp. 74:1-74:6.
https://www.ibr.cs.tu-bs.de/users/fekete/Videos/CoordinatedMotionPlanning.mp4
**********************************************************
*
* 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, October 20, 2020

[DMANET] BDSN 2020 CFP:The 8thInternational workshop on Big Data and Social Networking Management and Security , December 14-16, 2020.

*The 8th International workshop on Big Data and Social Networking
Management and Security (BDSN 2020)*

http://emergingtechnet.org/BDSN2020/


*In conjunction with The Seventh International Conference on Social
Networks Analysis, Management and Security(SNAMS-2020) Paris, France.
December 14-16, 2020.*

*BDSN 2020 CFP*

Data has always been recognized as an important asset for driving value be
it scientific, governmental or for enterprise. The amount of data being
generated constantly with high volume, velocity and variety has marked the
emergence of "Big Data" as a contemporary research challenge with vast
opportunities. In the context of the digital-world, the internet and Social
Networks have contributed immensely in generating Big Data pools. Hundreds
of millions of people around the globe are nowadays connected using
different type of social networks. Big Data and Social Networks become
interrelated in the modern computing agenda being both concerned with
intensive data. As much opportunities they hold, Big Data and Social
Networks come with their own challenges such as management, Security,
Processing etc. In order to unlock the potentials of these technologies,
innovative solutions are required, which will leverage new models in
computing.

The 8th International workshop on Big Data and Social Networking Management
and Security will be a forum for scientists, researchers, students, and
practitioners to present their latest research results, ideas,
developments, and applications in the areas of big data and social
networking. We are mainly interested in receiving state of the art work on
different aspect of big data management system, big data security and
privacy, cloud computing and big data, social networking and big data
analytics, and social networking management and security, to mention but
few.

*The topics of interest for this workshop include, but are not limited to:*

- Big data and Social Networking concepts and applications
- Emerging technologies in Big Data and Social Networking
- Management Issues of Social Network Big Data
- Security challenges in Big Data and Social networks
- Social Network and Big Data Analytics
- Open Source tools for Big Data
- Green Computing for Big Data
- Network Infrastructure for Social Networking and Big Data
- Social Networks Monitoring Tools As a Service
- Cloud Computing for Big Data and Social Networks
- Big Data and the Internet of Things
- Big Data Management
- Big Data and Decision Making
- Visualization tools for Big Data

*Submissions Guidelines and Proceedings*

Manuscripts should be prepared in 10-point font using the IEEE 8.5" x 11"
two-column format (IEEE Templates
<https://www.ieee.org/conferences_events/conferences/publishing/templates.html>).
All papers should be in PDF format, and submitted electronically at Paper
Submission Link. A full paper must not exceed the stated length (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 SNAMS Proceeding and to be submitted to IEEE
Xplore for inclusion. The proceedings are also submitted for indexing to EI
(Compendex), Scopus and other indexing services like DBLP.

Submitted papers must include original work, and must not be under
consideration for another conference or journal. Submission of regular
papers must not exceed 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

*Important Dates*

Submission Date: 25 October, 2020
Notification to Authors: 15 November, 2020
Camera Ready Submission: 1 December, 2020

*Journal Special Issues*

Selected papers from the presented papers will be invited to submit an
extended version to number of journals. Papers will be selected based on
their reviewers' scores and appropriateness to the Journal's theme. All
extended versions will undergo reviews and must represent original
unpublished research work. Further details will be made available at a
later stage.

Please send any inquiry to the 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] Four PhD scholarships within Australian Research Council Future Fellowship "Bio-inspired computing for problems with chance constraints" available

Four PhD scholarships within Australian Research Council Future Fellowship "Bio-inspired computing for problems with chance constraints" available

The Optimisation and Logistics group at the

School of Computer Science,
The University of Adelaide, Australia

has four scholarships available for PhD students working
within the ARC Future Fellowship "Bio-inspired computing for problems with chance constraints" starting in 2021.

Scholarships are for the duration of 3 years with a possible extension of 6 months.
There are no teaching duties, but students are able to take up additional paid casual teaching work during their candidature and get involved in teaching courses within Computer Science.

We are seeking an excellent candidate with a master or honours in computer science
mathematics, or statistics.
The successful applicant should carry out theoretical or applied work on
evolutionary algorithms, ant colony optimisation, and related bio-inspired computing methods for problems with stochastic constraints
Candidates having experiences in the field of randomised methods, statistics and/or
computational complexity of bio-inspired computation are highly encouraged to apply.

Currently, around 20 researchers
from several nationalities work in the Optimisation and Logistics group.
The group collaborates with several of the major research
institutions in Europe and the U.S. and has high international visibility.
For more information, please visit http://cs.adelaide.edu.au/~optlog/

Applications (including curriculum vitae, IELTS test results, list of publications if
applicable, list of university grades, and names of two references with their
e-mail addresses) must be sent by email in PDF format with subject line
"PhD application: Bio-inspired computing for problems with chance constraints" to Prof Frank Neumann
(frank.neumann@adelaide.edu.au). Positions remain open until filled and applicants are encouraged to send their application documents as early as possible.


--------
Frank Neumann
Professor
Optimisation and Logistics
School of Computer Science
University of Adelaide, Australia
Adelaide, SA 5005
Australia
www.cs.adelaide.edu.au/~frank<http://www.cs.adelaide.edu.au/~frank>



**********************************************************
*
* 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] Tucker Prize - Call for nominations 2021

Dear colleagues,

The Mathematical Optimization Society invites nominations for the 2021
A.W. Tucker Prize, to be awarded at the International Symposium on
Mathematical Programming (ISMP) in Beijing, China (August 15 — 20,
2021). The prize is awarded to an outstanding doctoral dissertation
defended (and degree awarded) between January 1, 2018 and January 1,
2021.

The deadline for nominations is January 15, 2021. The nominator must
be a faculty member at the institution that awarded the nominee's
doctoral degree, or a member of the nominee's dissertation
committee. Applications should consist of the following four files,
each of which should be submitted as a single PDF file:

- a letter of nomination,
- the nominee's dissertation,
- a separate summary of the dissertation's contributions, written by
the nominee, that is no more than five (5) pages in length, and
- a brief biographical sketch of the nominee.

Nominations and the accompanying documentation must be written in
English. The nomination should be emailed to Amitabh Basu at
basu.amitabh@jhu.edu

The call for nominations is also announced on the MOS website:
http://www.mathopt.org/?nav=tucker_call

Nominations will be evaluated by the 2021 A.W. Tucker Prize Committee,
with at most three finalists chosen for the prize. The finalists will
be invited to give oral presentations of their work at a special
session of ISMP 2021. The winner will be announced during the
symposium.

More details about the prize can be found on the MOS website:
http://www.mathopt.org/?nav=tucker

Best,
Laura Sanita
on behalf of the 2021 A.W. Tucker Prize Committee (Amitabh Basu, Frank
E. Curtis, Simge Kucukyavuz, Francesca Maggioni, Laura Sanita)
**********************************************************
*
* 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] 2 PhD positions in KTH on Data Science

We are looking for two highly-qualified and motivated individuals to pursue a PhD in the area of data science. The prospect PhD students will join a research team in KTH led by professor Aristides Gionis (https://www.kth.se/profile/argioni/). The research team focuses on developing novel methods to extract knowledge from data, modeling large-scale complex systems, and exploring new application areas in data science. Emphasis is given in the areas of graph mining, social-network analysis, modeling of information networks and social-network dynamics, as well as in emerging domains, such as interpretable AI. The work combines foundational research in algorithms with development of novel applications.

The advertised positions are funded by the European Research Council (ERC) Advanced Grant REBOUND, which aims to study the phenomena of polarization and echo chambers in online media and develop methods to mitigate these phenomena, and by the H2020 European project SoBigData++, which aims at using big data analysis to understand complex social phenomena.

Successful applicants should have completed successfully, or expected to complete, a Master of Science degree, and have strong background in algorithmic design, data mining, machine learning, and combinatorial optimization. Applicants are required to have strong implementation skills and experience with managing large-scale data. Doctoral students are expected to be able to publish high-quality papers and develop research prototypes.

Application deadline: Oct 29, 2020

More information and link to apply: https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:355118/type:job/where:4/apply:1

All the best,
Aris
**********************************************************
*
* 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 at TU Delft on Trustworthy AI

We have a PhD position opening at TU Delft (The Netherland) on the intersection of combinatorial optimisation and machine learning to deliver novel trustworthy, safe, and explainable machine learning algorithms. Deadline for applying is until the New Year. Please see the vacancy for more details: https://www.tudelft.nl/over-tu-delft/werken-bij-tu-delft/vacatures/details/?jobId=1294&jobTitle=PhD%20position%20in%20Algorithmics&fbclid=IwAR2TSKMYuinKxv5-otaLWmPsMWxXkC5dj73w-X14FnVyH2_fY4MIB5QHFqA.


Best,

Emir


--

Dr Emir Demirović

Assistant Professor

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

[DMANET] e-PCC: weekly online seminar series for postgraduate students in discrete mathematics

Dear all,

We are calling PhD students in discrete mathematics or computer science to take part in a weekly online seminar series run by PhD students for PhD students. The seminar series is called e-PCC ( https://pcc2020.github.io/ <https://pcc2020.github.io/> ) and it is being run instead of this year's Postgraduate Combinatorics Conference (a UK postgraduate conference in combinatorics and related areas) which is postponed due to COVID-19.

If you are interested in taking part (attending or giving a talk) in this seminar series, please subscribe to our mailing list here: https://docs.google.com/forms/d/e/1FAIpQLSdSbI4uNwyJ_0XqoBbNV5WDsFn6W4vfOdh5qTauLrmrcNMl6Q/viewform <https://docs.google.com/forms/d/e/1FAIpQLSdSbI4uNwyJ_0XqoBbNV5WDsFn6W4vfOdh5qTauLrmrcNMl6Q/viewform>
The series will be run weekly and speakers will give a 20 - 25 minute presentation on zoom followed by 5 -10 minutes for questions
We aim to start the seminar series mid November (exact dates will be announced soon).

For further information, please contact one of the organisers:
Benjamin Merlin Bumpus (https://www.bmbumpus.com/ <https://www.bmbumpus.com/>) or
Michael McKay (https://mckay2.github.io/ <https://mckay2.github.io/>).

Cheerfully,

Ben
**********************************************************
*
* 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 2021 - First Call for Papers

==================================
ICALP 2021 - First Call for Papers
==================================

http://easyconferences.eu/icalp2021/

The 48th International Colloquium on Automata, Languages, and Programming (ICALP)
will take place in Glasgow, Scotland, on 13-16 July 2021.

ICALP is the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series
of workshops, which will take place on 12 July 2021.

COVID-19: We will monitor the global travel situation and consider whether the
conference will be physical, virtual or hybrid. If there is a physical component,
remote participation for both speakers and attendees will also be an option.

=============== Important dates =======================

Submission deadline: Friday 12 February 2021, 23:59 AoE
Notification: Wednesday 28 April 2021
Camera-ready deadline: Friday 7 May 2021

Deadlines are firm; late submissions will not be considered.


===========================
Submissions and Proceedings
===========================


ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is a series of high-quality conference
proceedings across all fields in informatics established in cooperation with
Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of Open Access, i.e., they are available online and
free of charge.


Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12 pages,
excluding references presenting original research on the theory of computer
science. All submissions must be formatted in the LIPIcs style
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
and submitted via Easychair to the appropriate track of the conference. The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly
from the required format may be rejected without consideration of merit.


No prior publication and no simultaneous submission to other publication outlets
(either a conference or a journal) is allowed.


Technical details necessary for a proper scientific evaluation of a submission
must be included in the 12-page submission or in a clearly labelled appendix, to
be consulted at the discretion of program committee members. Authors are strongly
encouraged to also make full versions of their submissions freely accessible in
an on-line repository such as ArXiv, HAL, ECCC.


Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best student paper
awards for each track of the conference. In order to be eligible for a best student
paper award, a paper should be authored only by students and should be marked as
such upon submission.


Topics
======
Papers presenting original research on all aspects of theoretical computer science
are sought. Typical but not exclusive topics of interest are:


Track A: Algorithms, Complexity and Games
-----------------------------------------
* Algorithmic and Complexity Aspects of Network Economics
* Algorithmic Aspects of Networks and Networking
* Algorithmic Aspects of Security and Privacy
* Algorithms for Computational Biology
* Algorithmic Game Theory and Mechanism Design
* Approximation and Online Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Complexity
* Computational Geometry
* Computational Learning Theory
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Distributed and Mobile Computing
* Foundations of Machine Learning
* Graph Mining and Network Analysis
* Parallel and External Memory Computing
* Quantum Computing
* Randomness in Computation
* Theoretical Foundations of Algorithmic Fairness

Track B: Automata, Logic, Semantics, and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models of Computation
* Automata, Logic, and Games
* Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
* Formal and Logical Aspects of Learning
* Formal and Logical Aspects of Security and Privacy
* Logic in Computer Science and Theorem Proving
* Models of Computation: Complexity and Computability
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid, and Stochastic Systems
* Principles and Semantics of Programming Languages
* Program Analysis, Verification, and Synthesis
* Type Systems and Typed Calculi


===============================
ICALP 2021 Programme Committees
===============================


Track A: Track A: Algorithms, Complexity and Games
---------------------------------------------------
* Nikhil Bansal (CWI Amsterdam, Netherlands), Chair

* Yossi Azar (Tel Aviv University, Israel)
* Luca Becchetti (Sapienza University of Rome, Italy)
* Aleksander Belov (University of Latvia, Latvia)
* Eric Blais (University of Waterloo, Canada)
* Niv Buchbinder (Tel Aviv University, Israel)
* Kevin Buchin (TU Eindhoven, Netherlands)
* Parinya Chalermsook (Aalto University, Finland)
* Vincent Cohen-Addad (Google Research, Switzerland)
* Shahar Dobzinski (Weizmann Institute, Israel)
* Ran Duan (Tsinghua University, China)
* Vida Dujmovic (University of Ottawa, Canada)
* Yuval Filmus (Technion, Israel)
* Samuel Fiorini (Université libre de Bruxelles, Belgium)
* Andreas Galanis (University of Oxford, UK)
* Mika Göös (EPFL, Switzerland)
* Inge Li Gørtz (TU Denmark, Denmark)
* Heng Guo (University of Edinburgh, UK)
* Prahladh Harsha (TIFR, Mumbai, India)
* Sungjin Im (UC Merced, USA)
* Stacey Jeffery (CWI Amsterdam, Netherlands)
* Iordanis Kerenidis (CNRS - Université Paris Diderot, France)
* Michael Kapralov (EPFL, Switzerland)
* Ravi Kumar (Google Research, USA)
* Stefan Kratsch (HU Berlin, Germany)
* Silvio Lattanzi (Google Research, Switzerland)
* Shi Li (SUNY Buffalo, USA)
* Konstantin Makarychev (Northwestern University, USA)
* Marcin Mucha (University of Warsaw, Poland)
* Wolfgang Mulzer (FU Berlin, Germany)
* Jesper Nederlof (Utrecht University, Netherlands)
* Aleksandar Nikolov (University of Toronto, Canada)
* Neil Olver (LSE, UK)
* Rasmus Pagh (IT University of Copenhagen, Denmark)
* Merav Parter (Weizmann Institute, Israel)
* Alexandros Psomas (Purdue University, USA)
* Barna Saha (UC Berkeley, USA)
* Thatchaphol Saranurak (University of Michigan, USA)
* Rahul Savani (University of Liverpool, UK)
* Mohit Singh (Georgia Tech, USA)
* Sahil Singla (IAS/Princeton, USA)
* Noah Stephens-Davidowitz (Cornell University, USA)
* László Végh (LSE, UK)
* Meirav Zehavi (Ben-Gurion University, Israel)

Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------------------------------------
* James Worrell (University of Oxford, UK), Chair

* Parosh Aziz Abdulla (Uppsala University, Sweden)
* S. Akshay (Indian Institute of Technology Bombay, India)
* Nathalie Bertrand (Inria Rennes, France)
* Michael Blondin (Université de Sherbrooke, Canada)
* Olivier Carton (IRIF, Université de Paris, France)
* Corina Cîrstea (University of Southampton, UK)
* Dana Fisman (Ben Gurion University, Israel)
* Paul Gastin (LSV, ENS Paris-Saclay, France)
* Stefan Göller (University of Kassel, Germany)
* Radha Jagadeesan (DePaul University Chicago, USA)
* Bakhadyr Khoussainov (University of Auckland, New Zealand)
* Emanuel Kieroński (Wrocław University, Poland)
* Bartek Klin (Warsaw University, Poland)
* Barbara König (University of Duisburg-Essen, Germany)
* Laura Kovacs (Vienna University of Technology, Austria)
* Ugo Dal Lago (University of Bologna and Inria, Italy)
* Christoph Löding (RWTH Aachen University, Germany)
* Madhavan Mukund (Chennai Mathematical Institute, India)
* Sebastian Maneth (University of Bremen, Germany)
* Richard Mayr (University of Edinburgh, UK)
* Annabelle McIver (Macquarie University, Australia)
* Sophie Pinchinat (IRISA, Université de Rennes, France)
* Cristian Riveros (Pontificia Universidad Católica de Chile, Chile)
* Davide Sangiorgi (University of Bologna and Inria, Italy)
* Lijun Zhang (Institute of Software, Chinese Academy of Sciences, China)

===============================
ICALP 2021 Organizing Committee
===============================


Simon Gay, Conference Chair

Oana Andrei
Ornela Dardha
Jessica Enright
David Manlove
Kitty Meeks
Alice Miller
Gethin Norman
Sofiat Olaosebikan
Michele Sevegnani

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