Friday, November 20, 2020

[DMANET] Postdoc in quantum approaches to discrete optimization (Sandia Labs, USA)

Our team is seeking a highly motivated Postdoctoral Appointee that is passionate about quantum computing. Are you driven by the prospect of better understanding the power and limitations of quantum computing and crafting novel approaches for realizing quantum advantages? If you are seeking an opportunity to work under the mentorship of and in collaboration with accomplished specialists in quantum information science, check us out!


On any given day, you may be called on to:

-Design quantum or quantum-inspired classical (approximation) algorithms for discrete optimization, machine learning, simulation, and other application areas

-Perform detailed analysis on the performance of quantum and classical algorithms, with the goal of identifying quantum advantages

-Contribute in a stimulating interdisciplinary environment with computer scientists, physicists, and mathematicians to develop theoretical and practical approaches for addressing real-world problems

-Publish results in relevant journals and present at conferences


Qualifications We Require

-PhD in physics, computer science, mathematics, electrical engineering or related field and possess a bachelor's in science, technology, engineering or mathematics (STEM).

-Experience with quantum information science or theoretical computer science. We encourage theoretical computer scientists interested in quantum information science but without formal expertise in such to apply.

-Good interpersonal skills as evidenced by a history of publication of results in peer-reviewed journals and external presentations at appropriate scientific conferences

-Able to acquire and maintain a DOE security clearance


Qualifications We Desire

-Some exposure to quantum algorithm design, quantum optimization, quantum complexity theory, or broader quantum information theory

-Experience with programming language such as C/C++ or Python

-Desire to work in a collaborative environment and interested in interdisciplinary research

-Experience making and delivering effective technical presentations


About Our Team

Sandia's Quantum Algorithms for Optimization and Learning and Simulation (QOALAS) and Fundamental Algorithms for Quantum Computing (FAR-QC) are DOE-funded efforts to develop new quantum algorithms for optimization, machine learning, and quantum simulation. These projects bring together a diverse team of quantum information and computer science specialists from Argonne Lab, Berkeley Lab, Caltech, Dartmouth, Los Alamos Lab, Microsoft, Oak Ridge Lab, University of Maryland, and University of Southern California. More information is available at https://www.sandia.gov/far-qc.

More broadly, the Discrete Math and Optimization Department conducts state-of-the-art research and develops mathematics and computing in support of Sandia missions. Principal areas of focus include graph algorithms, parallel computing, combinatorial optimization, integer programming, and quantum and neuromorphic algorithms. Our team delivers creative enabling technologies and software tools. The department works on a wide variety of application areas including energy systems, scientific computing, systems software, logistics, and quantum algorithms.

All qualified applicants will receive consideration for employment without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, disability, or veteran status


Apply at http://sandia.gov/careers, job #673907, by December 2nd, 2020.

—
Ojas Parekh
Center for Computing Research
Sandia National Laboratories

**********************************************************
*
* 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 for the Special Issue "Planning and Scheduling Optimization" in Applied Sciences (IF: 2.474)

A Special Issue In the Applied Sciences Journal

Dear Colleagues,

We invite you to submit your work to the Special Issue of Applied Sciences that is devoted to recent research, current developments, and applications of complex systems planning and scheduling. This includes the principles and practice of the design, implementation, and analysis of exact and approximate optimization methods.

This Special Issue is also devoted to the optimization challenges of modern manufacturing, engineering, and healthcare systems. It also aims to present the most recent developments of operations research models and other applications of intelligent computing techniques used for planning and scheduling in a variety of manufacturing, engineering, and healthcare systems. The topics of interest include but are not limited to:

Heuristic and metaheuristic algorithms for planning and scheduling problems in manufacturing, engineering and healthcare systems;
Exact algorithms (brand and bounds, dynamic programming, etc.);
Different scheduling applications (timetabling, network routing, crew scheduling, production scheduling, resource-constrained project scheduling, etc.);
Energy-efficient planning and scheduling problems;
Intelligent optimization approaches for intelligent manufacturing systems;
Artificial Intelligence and data analytics (manufacturing, services, healthcare, services and industries of the future, etc.).
Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com <https://www.mdpi.com/> by registering <https://www.mdpi.com/user/register/> and logging in to this website <https://www.mdpi.com/user/login/>. Once you are registered, click here to go to the submission form <https://susy.mdpi.com/user/manuscripts/upload/?journal=applsci>. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors <https://www.mdpi.com/journal/applsci/instructions> page. Applied Sciences <https://www.mdpi.com/journal/applsci/> is an international peer-reviewed open access semimonthly journal published by MDPI.

<>Keywords

planning
scheduling
exact and approximate methods
intelligent manufacturing systems
healthcare systems
logistics systems
Deadline for manuscript submissions: 31 December 2020. This special issue is now open for submission and papers will be processed as they are submitted.



Guest Editors


Prof. Farouk Yalaoui
Dr. Taha Arbaoui
Dr. Yassine Ouazene



**********************************************************
*
* 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] YouTube Tutorial on Modeling (in Operations Research)

YouTube-Tutorial on Mathematical Modeling
Alf Kimms <alf.kimms@uni-due.de>

Beginners in Operations Research usually find it difficult to formulate
a model
on their own or to fully understand a model without the support of an
advisor.
Students get better over time by studying more and more examples. In
this way
they learn how to formulate a mathematical model. The idea behind this
online
tutorial is to support the learning process. Typical tips and tricks are
explained in a series of short videos.

This material is for an audience in the early stage of the operations
research
experience. Things are explained on a very basic level. Bachelor and
master
students will benefit most.

The videos can be found on YouTube. A playlist link can be retrieved
from the
following website:
https://www.log.msm.uni-due.de/lehre/youtube-tutorial-modellierung/
If you find this interesting, it would be very much appreciated if you
communicated this link to your students by referencing the video
playlist
in your course material or by adding a link to your website for
instance.
I hope that your students can benefit from it.

Thanks a lot and take care,
Alf Kimms
(President-Elect of the German OR Society)

--
Prof. Dr. Alf Kimms
Chair of Logistics and Operations Research
Mercator School of Management
University of Duisburg-Essen, Campus Duisburg
47048 Duisburg
Germany
phone: +49 (0) 203 379 3492
fax: +49 (0) 203 379 5451
mailto: alf.kimms@uni-due.de
http://www.msm.uni-due.de/log/
**********************************************************
*
* 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] FSTTCS 2020 - Call for Participation

FSTTCS 2020 - Call for Participation
=====================================

Conference dates: December 15 - 17, 2020

Registration Deadline: 30 November 2020


FSTTCS 2020 is the 40th conference on Foundations of Software Technology and Theoretical Computer Science. It is a forum for presenting original results in foundational aspects of Computer Science and Software Technology.

Due to the COVID-19 pandemic, FSTTCS 2020 will be held online.

=================
Invited Speakers
=================


* Sanjeev Arora, Princeton University
* Albert Atserias, Universitat Politècnica de Catalunya
* Yin Tat Lee, University of Washington
* Joël Ouaknine, MPI for Software Systems, Saarbrücken and University of Oxford
* Sanjit Seshia, University of California, Berkeley
* Amir Shpilka, Tel Aviv University


=====================
Conference Programme
=====================


FSTTCS 2020 features 52 high-quality papers. The detailed conference programme is available at:


https://www.fsttcs.org.in/2020/program.php


====================================
Workshops and Co-located Events
====================================


Track A workshop

Title: Workshop on Matrix Rigidity
Dates: December 13 - 14, 2020


Track B workshops

Title: Strategies for Uncertainty (SUN)
Dates: December 13 - 14, 2020


Title: Advances in Verification
Dates: December 18, 2020


Co-located event

Title: Workshop on Research Highlights in Programming Languages
Dates: December 15 - 17, 2020


More details about the workshops and the co-located event can be found at:


https://www.fsttcs.org.in/2020/#workshops


=============
Registration
=============

This year there is a common registration for FSTTCS 2020, the satellite workshops and the co-located event. The fee for basic registration is INR 1000 (approximately 12 Euros or 14 Dollars). The deadline for registration is November 30, 2020.


https://www.fsttcs.org.in/2020/#register


=====================
Organising Committee
=====================

* A Baskar (BITS Pilani, K K Birla Goa Campus)
* Pritam Bhattacharya (BITS Pilani, K K Birla Goa Campus)
* Amaldev Manuel (IIT Goa)
* Anup Basil Mathew (BITS Pilani, K K Birla Goa Campus)
* A V Sreejith (IIT Goa)

Program Co-chairs:

* Nitin Saxena (IIT Kanpur)
* Sunil Simon (IIT Kanpur)


**********************************************************
*
* 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. Student in Random Processes and Algorithms at Hasso Plattner Institute Potsdam

The Algorithm Engineering group at the Hasso Plattner Institute (HPI) currently hosts about twenty-five researchers and invites applications for a new

Ph.D. Student in Random Processes and Algorithms.

The research group uses methods from mathematics and computer science to approach a range of algorithmic areas including artificial intelligence, network theory and random processes / structures. We are currently seeking to strengthen our focus within the area of probabilistic analysis of randomized optimization algorithms, such as evolutionary algorithms and other nature inspired heuristics.

As part of the privately funded Faculty of Digital Engineering of the University of Potsdam, we engage both in teaching of outstanding and highly selected students as well as in internationally renowned research. The group and the institute is located at the beautiful Campus Griebnitzsee, at the border to Berlin, offering a vibrant scientific environment.

What we offer:
• Inspiring research environment;
• Close collaboration with other scientists;
• Generous travel allowance and latest computing facilities;
• Modern work space in Potsdam-Babelsberg;
• Integration into an international group of researchers;
• Exceptional students to work with.

What we expect:
• An excellent degree in Computer Science, Mathematics or a related discipline;
• Some course or other experience with probability theory;
• Enthusiasm for mathematical problems and scientific work;
• Enjoying teamwork and collaboration;
• A desire to obtain a PhD within 3-4 years.

Application process:
• All applications should include a detailed CV, a copy of the Master thesis and a list of courses and grades.
• Please also mention names and contact details of one or two references -- preferably one from your thesis adviser.
• The starting date and particular research topic is flexible.
• Interested candidates should direct their questions to friedrich@hpi.de.
• Applications must be sent via email, preferably as a single PDF, to jobs-friedrich@hpi.de by December 15, 2020.
• Promising PhD-student applicants will be asked to work out a small algorithmic open-book test within a 24 hour time window (chosen by themselves).
• All promising applicants will be interviewed (either via video call or on site) and at the same time get the chance to direct further questions to the chair.

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

Thursday, November 19, 2020

[DMANET] CFP: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)

(Apologies for multiple copies)

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

The Annual Symposium on Combinatorial Pattern Matching (CPM) has by now
over 30 years of tradition and is considered to be the leading conference
for the community working on Stringology. The objective of the annual CPM
meetings is to provide an international forum for research in combinatorial
pattern matching and related applications such as computational biology,
data compression and data mining, coding, information retrieval, natural
language processing, and pattern recognition.


The 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021) will
be held in Wroclaw, Poland, July 5-7, 2021.


WEBSITE OF THE CONFERENCE: http://cpm2021.ii.uni.wroc.pl/


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

CALL FOR PAPERS

Papers on original research unpublished elsewhere in all areas related

to combinatorial pattern matching and its applications are welcome.

The proceedings will be published by LIPIcs (of Dagstuhl).

TOPICS OF INTEREST

Papers are solicited on, but not limited to, the following topics:

Bioinformatics and computational biology

Coding and data compression

Combinatorics on words

Data mining

Information retrieval

Natural language processing

Pattern discovery

String algorithms

String processing in databases

Symbolic computing

Text searching and indexing

KEYNOTE SPEAKERS

Hideo Bannai (Tokyo Medical and Dental University, Japan)

Michal Koucký (Charles University, Czech Republic)

Nadia Pisanti (University of Pisa, Italy & Erable Team INRIA, France)

DEADLINE

Friday, January 29, 2021, anywhere on Earth

SUBMISSION

Submission is through the EasyChair conference system:

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

SUBMISSION FORMAT

The authors should submit an extended abstract not exceeding 15 pages,

including figures, title, authors, affiliations, e-mail addresses, and

a short abstract. The authors are required to use the LaTeX style file

supplied by Dagstuhl (LIPIcs) with the original settings (including

the font size and the margins). References will not be counted in the

page limit.

At least one author of an accepted paper is expected to present the

paper at the conference as a registered participant.

Papers must be submitted as a single file in PDF format.

Additional material intended for the referee but not for publication

in the final version—for example details of proofs—may be placed in a

clearly marked appendix that is not included in the page limit.

Papers submitted for review should represent original, previously

unpublished work. At the time the extended abstract is submitted to

CPM, and for the entire review period, the paper (or essentially the

same paper) should not be under review by any other conference with

published proceedings or by a scientific journal.

COVID-19

We are carefully watching the situation with the Covid-19 pandemic. We

hope to conduct a physical event, but we will certainly offer the

possibility of remote participation (with a significantly lower

registration fee) for those who are unable to come due to travel

restrictions or other circumstances. In the worst case, we will move

the event online but are not planning to postpone it.

PROGRAM COMMITTEE MEMBERS

Golnaz Badkobeh (Goldsmiths University of London, UK)

Frédérique Bassino (University Paris 13, France)

Christina Boucher (University of Florida, USA)

Laurent Bulteau (CNRS and Université Paris-Est Marne-la-Vallée, France)

Raphaël Clifford (University of Bristol, UK)

Fabio Cunial (MPI-CBG, Germany)

Funda Ergun (Indiana University, USA)

Paweł Gawrychowski (University of Wrocław, Poland), Co-Chair

Inge Li Gørtz (Technical University of Denmark)

Stepan Holub (Charles University in Prague, Czech Republic)

Tomohiro I (Kyushu Institute of Technology, Japan)

Shunsuke Inenaga (Kyushu University, Japan)

Tomasz Kociumaka (University of California, Berkeley, USA)

Christian Komusiewicz (Philipps-Universität Marburg, Germany)

Dmitry Kosolobov (Ural Federal University, Russia)

Gad M. Landau (University of Haifa, Israel)

Florin Manea (University of Göttingen, Germany)

Pierre Peterlongo (INRIA, France)

Cinzia Pizzi (University of Padova, Italy)

Leena Salmela (University of Helsinki, Finland)

Srinivasa Rao Satti (Seoul National University, South Korea)

Marinella Sciortino (University of Palermo, Italy)

Braha-Riva Shalom (Shenkar College of Engineering and Design, Israel)

Tatiana Starikovskaya (École normale supérieure, France), Co-Chair

Yasuo Tabei (RIKEN, Japan)

Tomasz Waleń (University of Warsaw, Poland)

**********************************************************
*
* 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 Extremal and Probabilistic Combinatorics, TU Ilmenau

Applications are invited for a PhD position in Extremal and Probabilistic Combinatorics (75%, TV-L 13 pay scale, for 3 years, starting date is as soon as possible, but negotiable) at the Institute of Mathematics at Ilmenau University of Technology, Germany.

The applicant will be based in the group of Yury Person. The research will be in the DFG-funded project "Ramsey-type problems in random and in randomly perturbed discrete structures and their sharp thresholds". Applicants should have an excellent degree in mathematics or computer science. Applications should include a CV, a list of courses and grades, a copy or summary of master thesis, list of 2 references.

The closing date is 27.11.2020.

Applications should be made online through: https://jobundkarriere.tu-ilmenau.de/en/jobposting/65aac597a2abfa36491afe9435101c3333bb841e0/apply
For further information please send an email to Yury Person (yury.person@tu-ilmenau.de<mailto:yury.person@tu-ilmenau.de>)

For official advertisement (in German) see https://jobundkarriere.tu-ilmenau.de/jobposting/65aac597a2abfa36491afe9435101c3333bb841e

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

[DMANET] Open Call: [Algorithms, MDPI] Special Issue on Optimal Transport: Algorithms and Applications

We are pleased to announce the launch of new Special Issue dedicated to
"Optimal Transport: Algorithms and Applications" in the journal
Algorithms, an *EI-*, *ESCI-*, and *Scopus-indexed* open access journal.

Topics of interest include (but are not limited to):

* Fast optimal transport algorithms (for transport plans, distances,
barycenters etc.)

* Approximations of optimal transport, including regularizations,
embeddings, or complete reformulations of the problem
* Interactions between machine learning and optimal transport

* Unexpected or fruitful applications of optimal transport

Further information can be found at the Special Issue website:

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

The submission deadline is 31 March 2021. Papers will be published on
an ongoing basis, so you can submit your paper at any point before the
deadline. For any questions, please feel free to contact Ms. Alina Chen
(alina.chen@mdpi.com).

Algorithms (ISSN 1999-4893) is a peer-reviewed open access journal which
provides an advanced forum for studies related to algorithms and their
applications, and is Open Access since 2008, and is since then rising
steadily in the ranks
(https://www.journalindicators.com/indicators/journal/21100199795). It
is ranking Q2 in the category "Computer Science, Theory & Methods", and
it has received it's increased 2020 CiteScore 2.20, and CiteScoreTracker
2020 is 2.70 now (https://www.scopus.com/sourceid/21100199795).

We look forward to receiving your submission.

Best regards,
Ms. Alina Chen/MDPI
Section Managing Editor
E-Mail: alina.chen@mdpi.com

MDPI Branch Office, Wuhan
Skype: live:a70ca49eff100a5b

**********************************************************
*
* 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, November 18, 2020

[DMANET] Preliminary Call for Papers - PODC 2021 - The 40th ACM Symposium on Principles of Distributed Computing

======================================
PODC 2021: PRELIMINARY CALL FOR PAPERS
======================================

The 40th ACM Symposium on Principles of Distributed Computing
July 26-30 2021, Salerno, Italy
[Updates with respect to the COVID-19 situation will appear on the website]

https://www.podc.org<https://www.podc.org/>
Twitter: https://twitter.com/podc_disc


======================================
DATES (all times are AoE)
======================================

Abstract submission: February 11th, 2021
Full paper submission: February 15th, 2021
Notification: April 30th, 2021
Proceedings version: May 21st, 2021

======================================
SCOPE
======================================

The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to, the following:

- biological distributed algorithms
- blockchain protocols
- coding and reliable communication
- communication networks: algorithms, protocols, applications
- complexity and impossibility results for distributed computing
- concurrency, synchronization, and persistence
- design and analysis of distributed algorithms
- distributed and cloud storage
- distributed and concurrent data structures
- distributed graph algorithms
- distributed machine learning algorithms
- distributed operating systems, middleware, databases
- distributed resource management and scheduling
- fault-tolerance, reliability, self-organization, self-stabilization
- game-theoretic approaches to distributed computing
- high-performance, cluster, cloud and grid computing
- internet applications, social networks, recommendation systems
- languages, verification, formal methods for distributed systems
- multiprocessor and multi-core architectures and algorithms
- parallel network computations
- peer-to-peer systems, overlay networks
- population protocols
- quantum and optics based distributed algorithms
- replication and consistency
- security in distributed computing, cryptographic protocols
- sensor, mesh, and ad hoc networks
- specifications and semantics
- system-on-chip and network-on-chip architectures
- transactional memory
- wireless networks, mobile computing, autonomous agents


======================================
PAPER SUBMISSION
======================================

A submitted paper should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state the paper's key contributions, and outline the key technical ideas and methods used to achieve the main claims. A submission should strive to be accessible to a broad audience, as well as having sufficient details for experts in the area.

Papers must be submitted in PDF format via https://podc2021.hotcrp.com<https://podc2021.hotcrp.com/>and fall in two categories: regular papers and brief announcements.

A regular paper must report on original research that has not been previously published. It is not permitted to submit the same material concurrently to journals or conferences with proceedings. Format and length requirements for submissions are stated below. All ideas necessary for an expert to fully verify the central claims in a paper, including experimental results, should be included in the submission.

A brief announcement may describe work in progress or work presented elsewhere. The title of a brief announcement must begin with "Brief Announcement:".

Submissions not conforming to the rules stated in this call, as well as papers outside the scope of the conference, risk being rejected without consideration.


======================================
SUBMISSION FORMAT
======================================

Submissions must be prepared in LaTeX and use the official ACM Master article template (acmart.cls, version of 1.73 or greater), available at https://www.acm.org/publications/proceedings-template. The authors must use `manuscript`, `nonacm` and `anonymous` options when preparing the submission, and use the ACM format for references. No modifications of the format or style are allowed. Sample files are available on the PODC website at https://www.podc.org/podc2021/call-for-papers/.

For regular papers, there is no page limit, and authors are encouraged to use the "full version" of their paper as the submission. The initial 15 pages should contain a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. The submission must contain full proofs of all claims in the paper. Although there is no bound on the length of a submission, material other than the first 15 pages will be read at the committee's discretion.

Papers submitted as brief announcements should comply with the above rules, replacing 15 pages with 5 pages.


======================================
ANONYMOUS SUBMISSIONS
======================================

The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work are in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of this process is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. Authors with further questions on double-blind reviewing are encouraged to contact the PC chair by email.


======================================
CONFLICT OF INTEREST
======================================

Indications of conflicts of interest will be required in the submission form.
A conflict of interest is limited to the following categories:

1. Family member or close friend.
2. Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years.
3. Person with the same affiliation.
4. Involved in an alleged incident of harassment. (It is not required that the incident be reported.)
5. Collaborators who jointly author works within the last two years.

If you feel that you have a valid reason for a conflict of interest not listed above, contact the PC chair or either of the Theory of Computing Advocates affiliated with this conference (Faith Ellen and Idit Keidar). If there is doubt about the validity of a claim of conflict of interest, the PC chair may request that a ToC advocate confidentially verify the reason.


======================================
PUBLICATION
======================================

Accepted regular papers of up to 10 pages and brief announcements of up to 3 pages in two-column ACM proceedings format will be included in the conference proceedings. They must be formatted with the ACM Master templates using \documentclass[sigconf]{acmart}. If more space than available in the proceedings for an accepted paper is needed, a full version must be available publicly, e.g. on arXiv, by the due date for the proceedings version (May 21, 2021), and the proceedings version must refer to this.

Extended and revised versions of selected papers will be considered for a special issue of the Distributed Computing journal. Up to two papers will be selected to be considered for publication in JACM.

The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.


======================================
AWARDS
======================================

Every regular paper is eligible for the best paper award. Regular papers co-authored by full-time students may also be eligible for the best student paper award. For a paper to be considered for this award, the nominated authors should be full time students at the time of submission and they should be principally responsible for the paper's contributions. The program committee may decline to make these awards or may split them.


======================================
ORGANIZATION
======================================

Program Committee:
- James Aspnes, Yale University, USA
- Sepehr Assadi, Rutgers University, USA
- Alkida Balliu, University of Freiburg, Germany
- Petra Berenbrink, University of Hamburg, Germany
- Trevor Brown, University of Waterloo, Canada
- Janna Burman, Université Paris-Saclay, CNRS, LISN, France
- Armando Castañeda, Instituto de Matemáticas, UNAM, Mexico
- Keren Censor-Hillel (chair), Technion, Israel
- Peter Davies, IST Austria, Austria
- Pascal Felber, University of Neuchâtel, Switzerland
- Paola Flocchini, University of Ottawa, Canada
- Pierre Fraigniaud, Université de Paris and CNRS, France
- Ran Gelles, Bar-Ilan University, Israel
- Mohsen Ghaffari, ETH Zurich, Switzerland
- George Giakkoupis, INRIA, France
- Alexey Gotsman, IMDEA Software Institute, Spain
- Vincent Gramoli, University of Sydney, Australia
- Magnús M. Halldórsson, Reykjavik University, Iceland
- Valerie King, University of Victoria, Canada
- Jakub Łącki, Google Research, USA
- François Le Gall, Nagoya University, Japan
- Yoram Moses, Technion, Israel
- Calvin Newport, Georgetown University, USA
- Merav Parter, Weizmann Institute of Science, Israel
- Arpita Patra, Indian Institute of Science, India
- Boaz Patt-Shamir, Tel Aviv University, Israel
- Andrzej Pelc, Université du Québec en Outaouais, Canada
- Peter Pietzuch, Imperial College London, UK
- Maria Potop-Butucaru, Sorbonne Université - LIP6, France
- Andrea Richa, Arizona State University, USA
- Christian Scheideler, Paderborn University, Germany
- Stefan Schmid, University of Vienna, Austria
- Alexander Spiegelman, Novi, USA
- Gadi Taubenfeld, IDC, Israel
- Josef Widder, Informal Systems, Austria
- Philipp Woelfel, University of Calgary, Canada
- Vassilis Zikas, University of Edinburgh and Purdue University, UK

Conference Committee:
- Keren Censor-Hillel, Technion, Israel (Program chair)
- Roberto DePrisco, Università di Salerno, Italy (Organizing chair)
- Avery Miller, University of Manitoba, Canada (General chair)
- Alessia Milani, University of Bordeaux, France (Treasurer)
- Janne H, Korhonen, IST Austria, Austria (Proceedings chair)
- William K. Moses Jr., Technion, Israel (Publicity chair)
- Hsin-Hao Su, Boston College, USA (Workshop chair)

Steering Committee:
- Jennifer Welch (2018-2021), Texas A&M, USA (chair)
- Keren Censor-Hillel (2020-2023), Technion, Israel (PC chair 2021)
- Christian Cachin (2019-2022), University of Bern, Switzerland (PC chair 2020)
- Faith Ellen (2018-2021), University of Toronto, Canada (PC chair 2019)
- Avery Miller, University of Manitoba, Canada (General chair 2021)
- Alessia Milani, University of Bordeaux, France (Treasurer 2021)
- Youla Fatourou (2019-2021), University of Crete, Greece (At-large)




------
Regards,
William K. Moses Jr.
Publicity Chair, PODC 2021
https://sites.google.com/view/wkmjr

**********************************************************
*
* 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: Deadline Approaching - EvoCOP 2021 - The 21st European Conference on Evolutionary Computation in Combinatorial Optimisation

(Apologies for cross-posting)

News:

* Deadline is approaching! -> November 19, 2020

* EvoStar will be a hybrid event!

* Are you an EvoStar Outstanding Student? Want to become one?
http://www.evostar.org/2021/evostar-outstanding-students/

* Fast track publication in the Evolutionary Computation journal (MIT Press)

*************************************************************************************
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 19, 2020 (extended)
https://easychair.org/my/conference?conf=evo2021
*************************************************************************************

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, (and online)
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/11/evo2021_confs_evocop_flyer_extended_deadline_2_02_11_2020.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 19, 2020 (extended deadline)
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)
Rydym yn croesawu gohebiaeth yn Gymraeg a Saesneg. Cewch ateb Cymraeg i bob gohebiaeth Gymraeg ac ateb Saesneg i bob gohebiaeth Saesneg. Ni fydd gohebu yn Gymraeg yn arwain at oedi.
We welcome correspondence in Welsh and English. Correspondence received in Welsh will be answered in Welsh and correspondence in English will be answered in English. Corresponding in Welsh will not involve any delay.

**********************************************************
*
* 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] Challenge on Distributed Load Balancing

Dear All,

Huawei Research Center and the company Algotester are launching a contest on distributed load balancing.
The challenge is mainly meant for students in Europe and can help to identify good talents.

We would be glad if you could relay the info around you (targeting university colleagues, mailing lists, social networks).

Best wishes,

Youcef

Dear
This is a great honor for us invite you to join our Distributed Load Balancing Contest<https://algotester.com/dlbc>.
This is the third contest from Huawei<https://www.huawei.com/en/> and Algotester<https://algotester.com/en>.
At this time we propose you to solve Distributed Load Balancing problem with a multi-agent system in a telecommunication network.
Since the results of the contest will be announced close to Christmas and New Year we have a wonderful prizes for you:

? Huawei Mate Xs<https://consumer.huawei.com/en/phones/mate-x-s/> - the Art of Flexibility!

? Huawei P 40<https://consumer.huawei.com/en/phones/p40/>

? Huawei MatePad Pro<https://consumer.huawei.com/en/tablets/matepad-pro-5g/>

? Huawei Watch GT 2<https://consumer.huawei.com/en/wearables/watch-gt2/>

In addition to individual prizes, all winners will be considered for internship positions!

Register now - https://algotester.com/dlbc
Contest start from Nov 23rd to Dec 6th
Announcement results close to Christmas and New Year.

We wish you luck!

Youcef MAGNOUCHE, PhD
Senior Research Engineer

[huawei 213]
Mathematical and Algorithmic Sciences Lab
Paris Research Center, Huawei Technologies Co. Ltd.

This e-mail and its attachments contain confidential information from HUAWEI, which is intended only for the person to whom it is addressed. If you are not the intended recipient of this email, please notify immediately the sender by phone or email and delete it. Any use of the information contained herein in any way, including, but not limited to, total or partial disclosure, reproduction, or dissemination, by persons other than the intended recipient(s) is prohibited, unless expressly authorized by HUAWEI.
HUAWEI Technologies France SASU ("HUAWEI") respects your privacy and is committed to the protection of your personal data. Your personal data included in this email and/or its attachments may be processed by HUAWEI. In compliance with Regulation (EU) 2016/679 (GDPR) and French data protection law of 6 January 1978 as amended, you can exercise at any time your rights of access, rectification or erasure of your personal data, as well as your rights to restriction, portability or object to the processing by sending us your request via the form available at https://www.huawei.com/fr/personal-data-request or a letter to the following address: HUAWEI Technologies France, Privacy Officer, 18 quai point du jour, 92100 Boulogne-Billancourt, France. To know more about how HUAWEI processes your personal data, please contact us<https://www.huawei.com/fr/personal-data-request/>.





**********************************************************
*
* 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, November 17, 2020

[DMANET] Assistant Professor in Mathematics, LSE

*Department of Mathematics, The London School of Economics and Political Science*

*Assistant Professor in Mathematics*

The Department of Mathematics at LSE seeks to appoint an Assistant Professor. For this post, we are particularly interested in candidates with expertise in a subject area related to the Mathematics of Game Theory. The successful candidate will have an established track-record or trajectory of research at a level of international excellence, will be able to teach mathematics at undergraduate and postgraduate level and will have a commitment to excellence in teaching. The successful candidate will contribute to the general work of the department, including the teaching of a range of courses. She or he will maintain an active programme of research in mathematics and will have a clear, well developed and viable strategy for future outstanding research. She or he will have a PhD in a mathematical subject (or be close to completing one) by the intended start date of 6 September 2021.

For further information about the post, other benefits that come with this job and shortlisting criteria please see the 'how to apply' document, job description and the person specification which are available at https://tinyurl.com/MathJobLSE2020. Salary is competitive with Departments at our peer institutions worldwide and not less than £55,974 pa inclusive. The closing date for receipt of applications is 11 January 2021 (23.59 UK time).

LSE is committed to building a diverse, equitable and truly inclusive university.
For this post, we particularly welcome applications by women and ethnic minorities.

**********************************************************
*
* 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, November 16, 2020

[DMANET] Reminder: Simons-Berkeley Fellowships for Fall 2021 and Spring 2022

The Simons Institute for the Theory of Computing invites applications for
Simons-Berkeley Postdoctoral Fellowships and Simons-Berkeley Research
Fellowships.

Simons-Berkeley Postdoctoral Fellowships are prestigious one- or two-year
postdoctoral positions funded by the Simons Foundation in response to the
COVID-19 crisis. Postdoctoral Fellows will start in Fall 2021 and will have
the opportunity to collaborate with UC Berkeley faculty and to participate
in Simons Institute programs.

Simons-Berkeley Research Fellowships are intended for exceptional
scientists to participate in at least one of the semester-long programs at
the institute. The Institute will host programs on "Computational
Complexity of Statistical Inference," and "Geometric Methods in
Optimization and Sampling" in Fall 2021 and "Causality" and "Learning and
Games" in Spring 2022.

*The deadline for receipt of applications for both positions is December
15, 2020. *For more information, see
https://simons.berkeley.edu/programs/postdoctoral-fellows and
https://simons.berkeley.edu/simons-berkeley-research-fellowship-call-applications
.

--
Peter Bartlett
Associate Director, Simons Institute for the Theory of Computing
Professor, Computer Science and Statistics

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

[DMANET] Call for Papers: Robust Data Analysis and Its Applications

> Call for papers:
>
> *Annals of Operations Research*
> Special Issue on *Robust Data Analysis and Its Applications*
> ----------------------------------------------
> Dear Colleagues,
>
> This is to invite you to submit high-quality research papers for the
> special issue of *Annals of Operations Research* on ''*Robust Data
> Analysis and Its Applications*'' . The special issue aims to publish
> recent works in the fields of robust data analysis and its applications. The
> topics of the special issue include, but are not limited to, those
> addressing the following topics.The main topics of interest are:
> •Robust data mining
> •Robust optimization
> •Robust computing
> •Robust kernel methods
> •Robust classification
> •Robust deep learning
> •Robust network
> •Robust clustering
> •Robust intelligent systems
> •Robust pattern recognition
> •Robust big data
> •Interval analysis
> •Interval data
> •Applications of robust data mining and optimization in domains such as
> business, energy and power systems, health care, environmental sciences,
> portfolio analysis,and all other relevant areas.
>
> The deadline for submission of manuscripts is *February 1, 2021*.
>
> For further information please visit the call for papers at
> https://resource-cms.springernature.com/springer-cms/rest/v1/content/18100768/data/v1
>
> If you have any question regarding this special issue you can contact at
> hmoosaei@gmail.com (Hossein Moosaei)
>
> *Guest Editors:*
> Panos M. Pardalos, University of Florida, USA
> Hossein Moosaei, University of Bojnord, Iran and Charles University, Czech
> Republic
> Milan Hladík, Charles University, Czech Republic
> M. Tanveer, Indian Institute of Technology Indore
>

**********************************************************
*
* 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 in Topological Graph Theory, Matroid Theory or Connectivity

University of Birmingham is inviting applications for a research
fellow in Combinatorics in connection with the EPSRC fellowship
entitled Graph Minor Theory in three dimensions and Connectivity. This
position will be initially for two years with the possibility of
extension for up to five years. Estimated starting date is April 1st
(but earlier or later dates can be agreed on easily).

Deadline for application: January 15th, 2021

Further information: http://web.mat.bham.ac.uk/J.Carmesin/recruiting.html

Sincerely

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

[DMANET] Call for Papers: IFAC Conference on Analysis and Design of Hybrid Systems

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

ADHS 2021 Second Call for Papers
The 7th IFAC Conference on Analysis and Design of Hybrid Systems
Brussels, Belgium, July 7-9, 2021.
Website: https://sites.uclouvain.be/adhs21/

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

* Invited Session Proposals due: December 16, 2020
* Paper Submissions due: December 23, 2020
* Author notification: mid-February, 2021

The Organising Committee has the pleasure of inviting you to participate in the 7th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS 21) to be held in Brussels, Belgium, July 7-9, 2021.

ADHS 2021 will take place at the University Foundation, Brussels and is organized by the department of Applied Mathematics of UCLouvain. Virtual attendance will be possible, and the extent of this possibility will be adapted to the situation of the pandemia.
The conference happens under the auspices of IFAC and is sponsored by the IFAC Technical Committee on Discrete Event and Hybrid Systems.

Contributions are invited in all areas pertaining to the engineering of hybrid systems including: modelling, specification, verification, analysis, control synthesis, simulation, validation, and implementation. We solicit papers and invited session proposals describing theoretical or applied research in the area. We also welcome papers describing tools, reporting case studies or connecting the cognate fields of control theory and formal verification.

Contributions are encouraged on applications of hybrid methods in various fields, such as automotive, avionics, energy and power, mobile and autonomous robotics, the process and manufacture industry, transportation and infrastructure networks, communication networks and networked control systems, cyber-physical systems, safety-critical systems, systems and synthetic biology.

An interactive session with scientists from the industry will be organized. A poster session will be organized and IFAC Young Author, Best Paper, Best Repeatability and Best Poster Prizes will be awarded.

The Program Chairs are planning to edit a special issue of NAHS: the authors of selected papers will be invited to contribute with significantly revised and extended versions of their manuscripts, containing new results.

New this year: ADHS'21 will feature a repeatability evaluation (RE). In other words, all accepted papers which include computational artifacts will be invited to submit these for evaluation to be conducted by a RE program committee. In this way, we aim to improve the reproducibility of computational results in the papers accepted for publication. Note that it is optional to submit an RE package, i.e., availability of a RE package will not affect the final publication of the corresponding paper. Papers whose RE packages pass the repeatability evaluation will be listed online and in the final proceedings. At the same time, papers whose RE package does not pass the repeatability evaluation criteria will be treated the same as papers which do not submit RE packages.

-------------------------------------------------------------------------------------------
Author Guidelines

* Regular papers: Regular papers can have a length of up to 8 pages at submission. Accepted papers are limited to 6 pages in the conference preprints and on-line proceedings. For papers describing tools, please tick the keyword "Computational tools" upon submission.

* Invited session proposals: Invited sessions consist of 4 to 6 papers related to a common theme that fits within the scope of ADHS. An invited session proposal should contain a short description of the common theme as well as the list of papers in the session and their abstracts.
The invited session organiser first has to submit the pdf file of the session proposal (without participating papers). The IFAC Conference Manuscript Management System then returns an acknowledgment that contains an alpha-numeric code for the proposed session. Subsequently, the organiser has to notify the contributing authors of their invited session code. The corresponding author of each paper then submits the paper on-line as an invited paper.

* Invited session papers: Invited session papers can have a length of up to 8 pages at submission. Invited session papers go through the same review process as regular papers. Accepted papers are limited to 6 pages in the conference preprints and on-line proceedings. Submission as an invited session paper requires the invited session code, which can be obtained from the session organiser.

-------------------------------------------------------------------------------------------
Submission Instructions

* The website for submission is: https://ifac.papercept.net/conferences/scripts/start.pl

* All papers submitted to ADHS 21 must be written in English and formatted in the standard IFAC 2-column format, provided on the IFAC Conference Management System website.

* For initial submissions, all regular and invited session papers are limited to eight (8) pages. The submission website will not permit longer papers to be uploaded.

* For the final upload, all accepted and invited papers are limited to six (6) pages.

* For each accepted paper, at least one of the authors should have a full registration in order to have the paper included in the preprints and the post-conference on-line proceedings at IFAC-PapersOnLine.

* Author's kits with style (.cls) files for LaTeX are available from the submission website. Go to http://ifac.papercept.net<http://ifac.papercept.net/> and select "Support" for these files and example files, or directly go to the support page. Please do not change the formatting in any way.

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

Invited Session Proposals due: December 16, 2020
Paper Submissions due: December 23, 2020
Author notification: mid-February, 2021
Final papers due: TBA
Early registration: TBA
Conference: July 7-9, 2021

The reference timezone is Central European Summer Time.

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

* Paulo Tabuada (University of California, Los Angeles, USA)
* Verena Wolf (Saarland University, Germany)
* Claire Tomlin (University of California, Berkeley, USA)

-------------------------------------------------------------------------------------------
Committees

General Chair
* Raphaël Jungers (UCLouvain, Belgium)

Vice-Chair from Industry
* Damien Ernst (ULiège, Belgium)

Program Chairs
* Alessandro Abate (University of Oxford, UK)
* Necmiye Ozay (University of Michigan, USA)

Repeatability Chair
* Sergiy Bogomolov (Newcastle University, UK)
* Aditya Zutshi (Galois, Portland, USA)

Award Chair
* Maurice Heemels (Eindhoven University of Technology, The Netherlands)

Program Committee
* Erika Abraham (RWTH Aachen University)
* Matthias Althoff (Technische Universität München)
* Duarte Antunes (Eindhoven University of Technology)
* Nikolaos Athanasopoulos (Queen's University Belfast)
* Ebru Aydin Gol (Middle East Technical University)
* Shun-ichi Azuma (Nagoya University)
* Laurent Bako (Ecole Centrale de Lyon)
* Ezio Bartocci (TU Wien)
* Sergiy Bogomolov (Newcastle University)
* Luca Bortolussi (University of Trieste)
* Bernard Brogliato (UR Rhône-Alpes)
* Christos G. Cassandras (Boston Univ.)
* Patrizio Colaneri (Politecnico di Milano)
* Samuel Coogan (Georgia Tech)
* Alessandro D'Innocenzo (Università degli Studi di L'Aquila)
* Jamal Daafouz (Université de Lorraine, CRAN, CNRS)
* Thao Dang (VERIMAG)
* Bart De Schutter (Delft University of Technology)
* Jyotirmoy Deshmukh (University of Southern California)
* Dimos V. Dimarogonas (KTH Royal Institute of Technology)
* Uli Fahrenberg (Ecole Polytechnique)
* Georgios Fainekos (Arizona State University)
* Goran Frehse (ENSTA ParisTech, U2IS)
* Martin Fränzle (Carl von Ossietzky Universität, Oldenburg)
* Sicun Gao (University of California, San Diego)
* Antoine Girard (CNRS)
* Alessandro Giua (University of Cagliari, Italy)
* Kim Guldstrand Larsen (Aalborg University, Denmark)
* Sofie Haesaert (TU Eindhoven)
* Maurice Heemels (Eindhoven University of Technology)
* Holger Hermanns (Saarland University)
* Joao Hespanha (University of California, Santa Barbara)
* Laurentiu Hetel (CNRS)
* Jianghai Hu (Purdue Univ)
* Nils Jansen (Raadboud U.)
* Qing-Shan Jia (Tsinghua University)
* Karl H. Johansson (Royal Institute Of Technology)
* Taylor T Johnson (Vanderbilt University)
* Agung Julius (Rensselaer Polytechnic Institute)
* Marc Jungers (CNRS - Université de Lorraine)
* Joost-Pieter Katoen (Univ of Twente/RWTH Aachen University)
* Françoise Lamnabhi-Lagarrigue (CNRS-EECI)
* Fabien Lauer (Université de Lorraine)
* Mircea Lazar (Eindhoven Univ. of Technology)
* Daniel Liberzon (Univ. of Illinois at Urbana-Champaign)
* Hai Lin (University of Notre Dame)
* Jun Liu (University of Waterloo)
* Paolo Mason (L2S CentraleSupélec, CNRS)
* Manuel Mazo Jr (TU Delft)
* Ian M. Mitchell (University of British Columbia)
* Irinel Constantin Morarescu (Universite de Lorraine)
* George J. Pappas (Univ of Pennsylvania)
* Mihaly Petreczky (CNRS)
* Romain Postoyan (CRAN, CNRS, Université de Lorraine)
* Pavithra Prabhakar (Kansas State University)
* Maria Prandini (Politecnico di Milano)
* Christophe Prieur (CNRS)
* Joerg Raisch (Technische Universität Berlin)
* Spyros A. Reveliotis (Georgia Institute of Technology)
* David Safranek (Masaryk University Brno)
* Ricardo Sanfelice (University of California Santa Cruz)
* Sriram Sankaranarayanan (University of Colorado)
* Oleg Sokolsky (Univ of Pennsylvania)
* Sadegh Soudjani (Newcastle University)
* Paulo Tabuada (Univ of California at Los Angeles)
* Bert Tanner (University of Delaware)
* Andrew R. Teel (Univ. of California at Santa Barbara)
* Ashish Tiwari (SRI International)
* Ufuk Topcu (University of Pennsylvania)
* Stavros Tripakis (Aalto University)
* Jana Tumova (Royal Institute of Technology)
* Yorai Wardi (Georgia Institute of Technology)
* Rafal Wisniewski (Aalborg University)
* Verena Wolf (University of Saarbrücken)
* Xiang Yin (Shanghai Jiao Tong University)
* Luca Zaccarian (LAAS-CNRS and University of Trento)
* Majid Zamani (University of Colorado Boulder)
* Naijun Zhan (Institute of Software, Chinese Academy of Science)
* Paolo Zuliani (Newcastle University)

"All publication material submitted for presentation at an IFAC-sponsored meeting (Congress, Symposium, Conference, Workshop) must be original and hence cannot be already published, nor can it be under review elsewhere. The authors take responsibility for the material that has been submitted. IFAC-sponsored conferences will abide by the highest standard of ethical behavior in the review process as explained on the Elsevier webpage (https://www.elsevier.com/authors/journal-authors/policies-and-ethics), and the authors will abide by the IFAC publication ethics guidelines (https://www.ifac-control.org/events/organizers-guide/PublicationEthicsGuidelines.pdf/view).
Accepted papers that have been presented at an IFAC meeting will be published in the proceedings of the event using the open-access IFAC-PapersOnLine series hosted on ScienceDirect (https://sciencedirect.com/). To this end, the author(s) must grant exclusive publishing rights to IFAC under a Creative Commons license when they submit the final version of the paper. The copyright belongs to the authors, who have the right to share the paper in the same terms allowed by the end user license, and retain all patent, trademark and other intellectual property rights (including research data)."

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

[DMANET] PhD positions at the University of Warwick, UK (Application deadline: 18 December, 2020)

PhD positions are available at the Theory and Foundations group in the Department of Computer Science, University of Warwick, UK. The group works on various aspects of theoretical computer science such as:

* automata and formal languages,
* logic and games,
* algorithmic game theory,
* online and dynamic algorithms,
* sublinear and streaming algorithms,
* parameterized complexity and structural graph theory,
* string algorithms,
* parallel algorithms,
* approximation algorithms,
* combinatorial and graph algorithms,
* random structures and randomized algorithms,
* computational complexity,
* privacy-preserving algorithms, cryptography and quantum computing.

The group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP), established in 2007 jointly with Warwick Mathematics Institute and Warwick Business School. Together with DIMAP, the group is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science.

The Department of Computer Science at Warwick offers an excellent research environment. It was ranked 2nd in the latest UK research assessment in Research Excellence Framework (REF) in 2014. The University of Warwick is one of the founding members of the Alan Turing Institute.

The university campus is located on the border of two counties, West Midlands and Warwickshire, is about one hour train ride from London, and 15 minutes from Birmingham International Airport.

The applicants are expected to have a strong background in discrete mathematics, algorithms, or related topics with undergraduate and/or Master's degrees in Computer Science, Mathematics, or related disciplines. The position(s) will be fully funded, and the successful applicant(s) will be receiving a stipend at rate in line with current Research Councils UK rates.

If you are interested in this opening, please send an email to either Dr Sayan Bhattacharya (S.Bhattacharya@warwick.ac.uk<mailto:S.Bhattacharya@warwick.ac.uk>) or Dr Torsten Mutze (torsten.mutze@warwick.ac.uk<mailto:torsten.mutze@warwick.ac.uk>) with a CV and the names and email addresses of two references by 18 December 2020. Please write "Application for a PhD position in the Theory Group" in the subject line of your email.

You are strongly encouraged to informally contact group members you might want to work with prior to submitting your application.

Shortlisted candidates will be interviewed informally on 07 January, 2021, and they will be notified approximately two weeks before the date of the interview.

Permanent members of the group:

* Sayan Bhattacharya
* Dmitry Chistikov
* Graham Cormode
* Artur Czumaj (group leader)
* Charilaos Efthymiou
* Matthias Englert
* Tom Gur
* Marcin Jurdzinski
* Ranko Lazic
* Torsten Mutze
* Igor Carboni Oliveira
* Mike Paterson
* Ramanujan Sridharan

https://warwick.ac.uk/focs/people/

Centre for Discrete Mathematics and its Applications:
https://warwick.ac.uk/dimap/

**********************************************************
*
* 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] DCOSS 2021: Submissions open now

[Apologies for multiple copies of this CFP]
============================================================
The 17th Annual International Conference on
Distributed Computing in Sensor Systems (DCOSS 2021)*
Coral Bay, Pafos, Cyprus
June 7 - 9, 2021
www.dcoss.org



* DCOSS has always been technically co-sponsored by IEEE; approval for this
year pending.
=============================================================



Submissions are now open! https://dcoss.org/paper-submission/

DCOSS 2021 is the 17th International Conference on Distributed Computing in
Sensor Systems to be hosted in Coral Bay, Pafos, Cyprus in June 7-9, 2021.
In the last few years, we have witnessed a significant growth in the use of
IoT and distributed sensor systems in a number of application areas,
ranging from smart transport, energy and buildings, to factory automation,
smart healthcare and environmental monitoring. In order for smart sensor
systems to truly become useful and pervasive, we need to address a number
of research challenges, including the tight integration of sensing and
machine intelligence, reliable and efficient networking, interoperability
and scalability, the need for dependable autonomy, interaction with humans,
and important aspects of security, privacy and trust. DCOSS focuses on
issues arising in the entire IoT and networked sensor systems stack:
covering aspects of high-level abstractions, models and languages, novel
algorithms and applications, system design approaches and architectures, as
well as tools for simulated and real deployments. Potential authors are
invited to submit original unpublished manuscripts that demonstrate recent
advances in both theoretical and experimental research. Topics of interest
include, but are not limited to, the following:

- Artificial Intelligence for IoT

- Smart healthcare to combat epidemics (including COVID-19)

- Edge and fog computing: distributed computing models from sensor to cloud
- Energy harvesting models and optimization
- Machine intelligence in distributed sensor systems and real time analytics
- Communication and networking primitives and protocols
- Autonomy: closing the loop between sensing and actuation
- Task allocation, reprogramming, and reconfiguration
- Robustness, resilience and dependability
- Security and privacy issues
- Approaches, tools, and experience of deployment and operation
- Performance analysis: complexity, correctness, scalability
- Mobile and human-centered sensing
- Interoperability, heterogeneity and scalability
- Crowd sensing and social sensing techniques, applications, and systems
- Complex systems comprising wearable, robotic and/or fixed sensor systems
- Novel and compelling applications
- IoT systems for emerging and developing economies
- Green and environmentally-friendly IoT

Authors are invited to submit original unpublished manuscripts that
demonstrate current research on distributed sensor systems related to DCOSS
topics of interest. Please use the US letter size (8.5 X 11 in) standard
IEEE conference LaTeX format or Microsoft Word template available on the
link below:

http://www.ieee.org/conferences_events/conferences/publishing/templates.html

Note that DCOSS does not follow the double-blind review policy. The names
and affiliations of all the authors must be present in the submitted
manuscript.



A Special Issue of the Computer Networks (COMNET) Elsevier Journal will
include selected best papers of DCOSS 2021.

Please visit DCOSS website at www.dcoss.org for more information.


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

- Technical Program Committee Chairs:
Enzo Mingozzi (University of Pisa, Italy)
Stefano Basagni (Northeastern University, USA)
Jiannong Cao (The Hong Kong Polytechnic University)



TPC Members
---------------------
Carlo Alberto Boano, Graz University of Technology
Azzedine Boukerche, University of Ottawa
Kevin Chan, US CCDC Army Research Laboratory
Thomas Erlebach, University of Leicester
Raja Jurdak, Queensland University of Technology
Tomasz Jurdzinski, University of Wroclaw
Evangelos Kranakis, Carleton University
Olaf Landsiedel, Kiel University
Jun Luo, Nanyang Technological Univeristy
Prasant Misra, TATA Consultancy Services
Nathalie Mitton, Inria Lille-Nord Europe
Miguel Mosteiro, Pace University
Gian Pietro Picco, University of Trento
Cristina Pinotti, University of Perugia
Utz Roedig, University College Cork
Vasos Vassiliou, University of Cyprus
Dong Wang, University of Notre Dame
Hongkai Wen, University of Warwick
Jie Yang, Florida State University
Desheng Zhang, Rutgers University
Ambuj Varshney, University of California, Berkeley
Nicolas Tsiftes, RISE Research Institutes of Sweden
Xiaolong Zheng, Beijing University of Posts and Telecommunications
Shijia Pan, University of California Merced
Jiaxin Ding, Shanghai Jiaotong university
Chenren Xu, Peking University
Sirajum Munir, Bosch Research
Jean-Francois Chamberland, Texas A&M University
Behnam Dezfouli, Santa Clara University
Jie Gao, Rutgers University
Gaia Maselli, University of Rome
Enrico Natalizio, University of Lorraine/Loria
Theofanis Raptis, IIT-CNR
Francesco Restuccia, Northeastern University
Simone Silvestri, University of Kentucky
Eirini Eleni Tsiropoulou, University of New Mexico
Damla Turgut, University of Central Florida
Antonio Virdis, University of Pisa
Thiemo Voigt, Swedish Institute of Computer Science



- Local Chairs
---------------------
Vasos Vassiliou (University of Cyprus, Cyprus)
Zinon Zinonos (Neapolis University Pafos, Cyprus)



- Workshops Chairs
Enrico Natalizio (University of Lorraine, France)
Zhangyu Guan (University at Buffalo, USA)
- Poster & Demo Chairs
Thomas Lagkas (International Hellenic University, Greece)
Roger Chamberlain (Washington University in St. Louis, USA)



- Proceedings Chair
Marios Angelopoulos (Bournemouth University, UK)



- Publicity Chairs
Eirini Eleni Tsiropoulou (University of New Mexico, USA)
Lei Shu (Nanjing Agricultural University & University of Lincoln, China/UK)
Tamoghna Ojha (Indian Institute of Technology Kharagpur, India)


- Steering Committee Chair:
Sotiris Nikoletseas (University of Patras and CTI, Greece)




******** Collocated Events ********

DCOSS 2021 will collocate with several thematic Workshops and Special
Sessions on emerging topics and technologies.

The event will also feature a poster and demo session.

Important Dates:
Abstract Registration Deadline: January 18, 2021
Paper Submission Deadline: January 25, 2021
Acceptance Notification: March 15, 2021
Camera Ready Deadline: March 29, 2021
Early Registration Deadline: April 22, 2021



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


--
*Tamoghna Ojha**, PhD*
*Publicity Co-Chair*, DCOSS 2021,
*Richard E Merwin Student Scholar (2016)*, IEEE Computer Society,
Smart Wireless Applications & Networking (SWAN
<http://cse.iitkgp.ac.in/~smisra/swan/>) Lab,
Dept. of Computer Science and Engineering,
Indian Institute of Technology Kharagpur,
Kharagpur, India - 721302
Alternate Email ID: <tojha@sit.iitkgp.ernet.in>, <tamoghna.ojha@gmail.com>

URL: Personal Website <http://cse.iitkgp.ac.in/~tamoghna/> LinkedIn
<http://in.linkedin.com/in/tamoghnaojha>

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

[DMANET] Lecturer Position in Algorithms (University of Sheffield, UK) [Closing Date: 4 December 2020]

[Apologies for multiple postings]

This is an exciting opportunity for a Lecturer in Algorithms at the
University of Sheffield, UK, a world top 100 University. Working in the
Department of Computer Science, you will join our established Algorithms
Group. The group focuses on the design and analysis of algorithms which
provably solve computational problems efficiently.

The Department is embarking on an exciting growth strategy following our
strong performance in the Research Excellence Framework (REF) 2014, in
which we were ranked 5th out of 89 computer science departments in the UK.
To build upon our continued success, we seek to appoint a Lecturer in the
design and analysis of algorithms, with specialist expertise in an area
including, but not limited to:

- randomised algorithms
- streaming algorithms and sublinear-time algorithms
- combinatorial optimisation
- approximation algorithms
- parameterised complexity and fixed-parameter tractable algorithms
- distributed computing
- graph algorithms analysis
- data structures design and analysis
- algorithmic game theory
- randomised search heuristics

You will hold a PhD in computer science or a related area, and you will be
able to conduct research to the highest standards. You will secure research
funding, publish in high impact journals and conferences, supervise
research students and manage research projects. As a teacher, you will play
a key role in maintaining our reputation for high-quality teaching by
designing, delivering and assessing undergraduate and postgraduate-level
courses in computer science. We seek candidates who will be able to make a
distinctive individual contribution to our algorithms research portfolio.

We're one of the best not-for-profit organisations to work for in the UK.
The University's Total Reward Package includes a competitive salary, a
generous Pension Scheme and annual leave entitlement, as well as access to
a range of learning and development courses to support your personal and
professional development.

We build teams of people from different heritages and lifestyles whose
talent and contributions complement each other to greatest effect. We
believe diversity in all its forms delivers greater impact through
research, teaching and student experience. The Department of Computer
Science holds a Silver Athena SWAN award, in recognition of our commitment
to equality and diversity.

This role has been identified as a full-time post, but we are committed to
exploring flexible working opportunities with our staff which benefit both
the individual and the University. We would be pleased to consider flexible
delivery of the role subject to meeting the business needs of the post.
For more information:

https://www.jobs.ac.uk/job/CCJ593/lecturer-in-algorithms

https://www.sheffield.ac.uk/dcs/about-department/jobs

--
Pietro S. Oliveto
Senior Lecturer,
EPSRC Early Career Fellow,
Department of Computer Science,
The University of Sheffield, Sheffield, UK.
*www.dcs.shef.ac.uk/people/P.Oliveto/rig/
<http://www.dcs.shef.ac.uk/people/P.Oliveto/rig/>*

**********************************************************
*
* 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] EURO 2021 Athens - Stream - "OR and the Arts, Creativity"

EURO 2021, Athens, Greece, July 11-14, 2021

Stream "OR and the Arts, Creativity"

At the occasion of EURO 2021, 31th European Conference on Operational Research, Athens, Greece, July 11-14, 2021, https://euro2021athens.com/, I am glad to welcome you to the stream on "OR and the Arts, Creativity".

Contributions are welcome related to all OR aspects of Arts and Creativity. As in the past, this stream may host talks around, e.g., Music, Dance, Theater, Museum, Gallery, but also Image, Video and Sound Processing, Inverse Problems and Forward Problems, Transformation and Optimization, Human Resource Management, and Space-Time Design and Research ... The sessions were exciting and deep, colorful and inspirational.
I encourage those interested in the stream to submit their contributions with one the following session Codes:

1115f599, 355e9b29, fa07763f,

by using the Abstract Submission System of EURO 2021 Athens under

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

Looking forward to seeing you in Athens!

Stream organizer: Gerhard-Wilhelm Weber
E-mail: gerhard_wilhelm.weber@put.poznan.pl


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