Thursday, October 31, 2019

[DMANET] FAW 2020 Call for Papers

Call for Papers


The 14th International Frontiers of Algorithmics Workshop (FAW 2020) will be held on May 29-31, 2020 at Haikou, Hainan Province, China. It will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. Typical, but not exclusive, topics of interest include:

* Algorithms and data structures;
* Algorithmic game theory and incentive analysis;
* Approximation algorithms and online algorithms;
* Automata, languages, logic, and computability;
* Bioinformatics, computational biology and medicine, and biomedical applications;
* Biomedical imaging algorithms;
* Combinatorial optimization;
* Combinatorics and discrete structures related to algorithms and complexity;
* Communication networks and optimization;
* Complexity theory;
* Computational algebra, geometry, number theory, and statistics;
* Computational learning theory, knowledge discovery, and data mining;
* Cryptography, reliability, and security;
* Database theory, large databases, and natural language processing;
* Experimental algorithmic methodologies;
* Geometric information processing and communication;
* Graph algorithms and theory;
* Graph drawing and information visualization;
* Internet algorithms and protocols;
* Large graph algorithms and social network analysis;
* Optimization algorithms in economic and operations research;
* Parallel and distributed computing and multicore algorithms;
* Parameterized algorithms, heuristics, and analysis;
* Pattern recognition algorithms;
* Trustworthy algorithms and trustworthy software.

Submission Guidelines and Publication Information

The submission deadline is December 29, 2020 (23:59 Beijing Time). All submissions are electronic via EasyChair, and the submission server is now available at https://easychair.org/conferences/?conf=faw2020

Only previously unpublished new results will be considered for publication. Papers that have already been published at another journal or conference with proceedings, or simultaneously submitted or accepted to another conference with proceedings will not be considered. Submissions must adhere to the following guidelines: Papers must be formatted using the LNCS style<http://www.springer.com/cn/computer-science/lncs/conference-proceedings-guidelines>, file without altering margins or the font point. A submission should not exceed 12 pages, including references, but excluding the optional appendix. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Papers that deviate from these guidelines risk being rejected without consideration of their merits.

The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS)<http://www.springer.com/cn/computer-science/lncs>, Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.

Selected high quality papers will be invited to a special issue in Theoretical Computer Science<https://www.journals.elsevier.com/theoretical-computer-science/> , Journal of Combinatorial Optimization and SN Operations Research Forum. The invited papers will go through the normal reviewing process.

Invited Speakers

Evripidis Bampis, Sorbonne Université, http://www-desir.lip6.fr/~bampise/
Xujin Chen, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, http://people.ucas.ac.cn/~0011018?language=en
Kazuhisa Makino, Kyoto University, http://www.kurims.kyoto-u.ac.jp/en/list/makino.html
Program Committee Chair

Minming Li City University of Hong Kong

Program Committee

Xiaohui Bei Nanyang Technological University
Xin Chen Liaoning University of Technology
Ran Duan Tsinghua University
Haodi Feng Shandong University
Mordecai Golin The Hong Kong University of Science and Technology
Siyao Guo New York University
Xin Han Dalian University of Technology
Wing-Kai Hon National Tsing Hua University
Naoyuki Kamiyama Kyushu University
Yuqing Kong Peking University
Piotr Krysta University of Liverpool
Shimin Li Winona State University
Zhengyang Liu Bytedance
Giorgio Lucarelli University of Lorraine
Kim Thang Nguyen University Paris-Saclay
Yota Otachi Kumamoto University
Pan Peng University of Sheffield
Rob Van Stee University of Siegen
Changjun Wang Beijing University of Technology
Zihe Wang Shanghai University of Finance and Economics
Chenchen Wu Tianjin University of Technology
Deshi Ye Zhejiang University
Yukun Cheng Suzhou University of Science and Technology
Chihao Zhang Shanghai Jiao Tong University
Yong Zhang Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
Peng Zhang Shandong University
Jialin Zhang Institute of Computing Technology, Chinese Academy of Sciences
Yingchao Zhao Caritas Institute of Higher Education
Important Dates
Submission deadline Dec. 29, 2019
(23:59 Beijing Time)
Author Notification of acceptance Feb. 20, 2020
Final version due Mar. 1, 2020
Conference Dates
May 29-31, 2020



Disclaimer: This email (including any attachments) is for the use of the intended recipient only and may contain confidential information and/or copyright material. If you are not the intended recipient, please notify the sender immediately and delete this email and all copies from your system. Any unauthorized use, disclosure, reproduction, copying, distribution, or other form of unauthorized dissemination of the contents is expressly prohibited.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] IEEE SMARTCOMP 2020 workshops

Dear colleagues
Please find below Call for workshop proposals at IEEE SMARTCOMP 2020. Sorry if you receive multiple copies.
---


IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP 2020)
Bologna, Italy 22-25 June 2020
http://www.smart-comp.org


Call for workshop proposals
-------------------------------
Continuing the well-established tradition of this series of symposia, SMARTCOMP 2020
will provide an international technical forum for experts from industry and academia
to exchange ideas and present results of on-going research in most state-of-the-art areas
of computers and communications. This year, special focus will be on the challenging issues
related to all the opportunities of computing, sensing and communication in the era of the
integration of Internet of Things, Cloud Computing, and Big Data.

The Workshops Committee of SMARTCOMP 2020 invites proposals for half or full day workshops
affiliated with the conference, on topics of interest to SMARTCOMP 2020 attendees. The
purpose of these workshops is to create new opportunities for presenting novel ideas in a
less formal and possibly more sharply focused way than at the conference itself.

Topics of interest include, but are not limited to, Internet of Things, Software-Defined
Networking, Big Data, Cloud Computing, M2M communications and Smart Grid. Papers presented
in the SMARTCOMP 2020 workshops will be included in the conference proceedings and submitted
for publication in IEEE Xplore®.


Submission Guidelines
-------------------------------
Each workshop proposal must include the following:
* the name of the workshop;
* the names, addresses, and short bios of the organizers;
* a brief description (up to one page long) of the technical issues that the workshop's focus
will be on, and the reasons why the workshop is of interest at this time;
* the names of potential Program Committee members;
* the planned format of the workshop, including a strategy to facilitate lively discussions
and involvement of the attendees;
* if a keynote speech is included in the planned format of the workshop, the name(s) of the
potential keynote speaker(s);
* if applicable, a description of past versions of the workshop, including dates, organizers,
number of submitted and accepted papers, and number of attendees;
* if the workshop is going to be organized for the first time, an estimate of the expected
number of submissions and attendees;
* a tentative Call for Papers (as complete as possible);
* a description of the plans for publicity and Workshop Web site.


Submission Method
-------------------------------
Workshop proposals should be submitted, no later than 23 November 2019, in PDF format by email with the subject line
"SMARTCOMP 2020 Workshop Proposal" to the Workshop Chairs:

Dario Bruneo (dbruneo@unime.it)
Eirini Eleni Tsiropoulou (eirini@unm.edu)


Important Dates
-------------------------------
Proposal for workshop submission deadline: 23 November 2020
Notification of workshop acceptance: 15 December 2020
Paper submission deadline: 6 April 2020
Notification of paper acceptance: 30 April 2020
Submission of camera-ready deadline: 15 May 2020


SMARTCOMP 2020 Workshop Chair
Dario Bruneo, University of Messina, Italy
Eirini Eleni Tsiropoulou, University of New Mexico, 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] [EXTENDED DEADLINE] Call for Papers for PMS 2020 in Toulouse - Confirmed Annals of OR special Issue

(Sorry for multiple copies)

*************************************************************************************************************************************************
PMS 2020
17th International Workshop on Project Management and Scheduling
April 15-17, 2020
Toulouse - France
https://pms2020.sciencesconf.org/ <https://pms2020.sciencesconf.org/>

EXTENDED DEADLINE : 15 November 2019

** Confirmed Annals of OR special issue **

Plenary speakers (abstracts available on the web site):
** Stéphane Dauzère-Pérès (Ecole des Mines de Saint-Etienne) - Modeling and solving complex job-shop scheduling problems
** Marjan van den Akker (Utrecht University) - Robustness in Scheduling
** Mario Vanhoucke (Ghent University) - Data Driven Project Management

Industrial plenary talk (abstract available on the web site)
** Philippe Laborie (IBM) - Industrial project and machine scheduling with Constraint Programming

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

PMS is an international Workshop series initialized by the EURO PMS Working Group, devoted to project management and scheduling (https://www.euro-online.org/websites/pms/ <https://www.euro-online.org/websites/pms/>). The Workshop is held every two years in different locations around Europe. This event brings together researchers and practitioners from different disciplines of Computer Science, Operational Research, Optimisation Engineering, Mathematical Programming and Industrial Engineering. The Workshop covers theoretical results and algorithmic developments in the fields of Project Management and Scheduling, including project management and scheduling practice and applications to real-life situations.

PMS 2020 (17th International Workshop on Project Management and Scheduling) will be held in Toulouse - France - on April, 15-17, 2020 at Toulouse Business School, located in the heart of the City famous for its unique architecture which earned it the nickname la Ville Rose ("the Pink City") and counts two UNESCO World heritage sites : the Canal du Midi and and the Basilica of St. Sernin, the largest remaining Romanesque building in Europe (https://www.toulouse-visit.com/ <https://www.toulouse-visit.com/>), not to mention its famous South West French cooking and vibrating nightlife.

The Workshop website is https://pms2020.sciencesconf.org/ <https://pms2020.sciencesconf.org/>

The Workshop will cover the following but non exhaustive list of project management and scheduling areas:
- Project Management: Network modeling, Project scheduling, Resource management, Due-date management, Project risk management, Project scheduling under uncertainty, Proactive/reactive project scheduling, Multicriteria project scheduling, Applications, Software
- Machine Scheduling: Shop scheduling, Scheduling with additional constraints, Machine assignment and scheduling, Flexible/robust scheduling, Grid scheduling, Multicriteria scheduling, Applications, Software.

Methodological/theoretical papers related to Operational Research, Artificial Intelligence/Machine Learning models, exact and heuristic algorithms for scheduling problems are welcome as well papers dealing with data-driven approaches, practical applications and industrial case studies.

All researchers, academics, phd students and practitioners working on the Workshop themes are invited to participate to PMS 2020 submitting an extended abstract (length 4 single-spaced A4 pages). Templates and guidelines to authors are available on the PMS 2020 website. These 4-page submissions will be reviewed according to the standard reviewing process of international Workshops. A selection of submissions will be presented during the Workshop.

After the Workshop, the authors will have the opportunity to submit full papers to a feature issue of Annals of Operations Research.

Submission site is now open, please check "Submission instructions" on the web site !
Check also the latest news (social events, venue) https://pms2020.sciencesconf.org/resource/news <https://pms2020.sciencesconf.org/resource/news>

Important deadlines:
Paper submission: EXTENDED DEADLINE 15 November 2019
Notification of acceptance: 31st January 2020
Final paper due date: 14th February 2020
Early registration: 14th February 2020

A list of hotels will be made available on the PMS 2020 website soon.

For deadlines and detailed information about the Workshop and the venue, please, visit the Workshop website: https://pms2020.sciencesconf.org <https://pms2020.sciencesconf.org/> or send an email to pms2020@sciencesconf.org <mailto:pms2020@sciencesconf.org>

We are looking forward to welcoming you in Toulouse !

On behalf of the Organizing Committee,
Christian Artigues (Workshop 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/
*
**********************************************************

[DMANET] CTW2020: 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization - Ischia (Italy) June 15-17, 2020

------------------------------------------------------------------------------
[Please accept our apologies if you receive multiple copies of this Call
for Papers.]
-----------------------------------------------------------------------------

CALL FOR PAPERS
CTW2020: 18th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization

June 15-17, 2020
Hotel Re Ferdinando
Ischia – Italy


http://ctw2020.iasi.cnr.it
----------------------------------------------------------------------------
*SCOPE*
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2020
welcomes contributions on theory and applications of discrete algorithms,
graphs and combinatorial optimization in the wider sense.

The series of Cologne-Twente Workshops on Graphs and Combinatorial
Optimization started with meetings organized every two years by the
universities of Cologne and Twente. The organizational base was later
expanded by other universities. Since 2003 the workshop is held (almost)
every year.

CTWs are especially intended to let doctoral students and young researchers
present the results of their research activities in a friendly and highly
interactive atmosphere.

*PLENARY SPEAKERS: *
*Dan Bienstock* (Columbia University, USA)
*Marco Sciandrone* (Università di Firenze, Italia)

*PAPER SUBMISSION*
There will be two types of submissions:
*Standard papers* (from 8 to 12 pages) that will be selected for
publication in a volume of the AIRO Springer series (a copyright transfer
will be necessary).
*Traditional CTW Extended abstracts* (up to 4 pages) that will be published
on the workshop webpage (subject to author's approval).
See http://ctw2020.iasi.cnr.it submission page for information.

*IMPORTANT DATES*

- December 31st, 2019: Submission deadline for Standard papers.
- February 15th, 2020: Notification of acceptance for standard papers.
- March 1st, 2020: Submission deadline for extended abstracts.
- April 15th, 2020: Notification of acceptance for extended abstracts.
- May 1st, 2020: Deadline for Early Registration payment.
- June 15th, 2020: Beginning of Conference.


*ORGANIZING COMMITTEE*
*Claudio Gentile,* IASI-CNR
*Leo Liberti, *CNRS-LIX
*Gaia Nicosia,* U. RomaTre
*Andrea Pacifici,* U. TorVergata Roma
*Giovanni Rinaldi,* IASI-CNR
*Giuseppe Stecca,* IASI-CNR
*Paolo Ventura,* IASI-CNR

--
Claudio Gentile
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" (IASI-CNR)
Via dei Taurini, 19 - I 00185 Roma Italy.
Tel: +39 06 4993 7128 - Fax: +39 06 49937106 - e-mail: gentile@iasi.cnr.it

**********************************************************
*
* 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 Artificial Intelligence and Machine Learning

Linköping University (Sweden) advertises up to two (2) positions as
Postdoc in Artificial Intelligence and Machine Learning
(formally based at the Department of Computer and Information Science).

The postdoc(s) will join a research project co-directed by Guest WASP
Professor Hector Geffner. The project focuses on a fundamental research
problem that is at the heart of the current split in AI between data-based
learners and model-based reasoners: the problem of learning symbolic
first-order representations from raw perceptions. Data-based learners,
like those based on deep learning, are popular because there is plenty
of data available. However, they produce black boxes that lack the flexibility,
transparency, and guarantees of model-based systems. Building models by hand,
on the other hand, is just too hard and time-consuming for most applications.
By showing how to learn meaningful, symbolic models from raw perceptions, the
research is aimed at integrating the benefits of data-based learners and
model-based solvers in the context of planning, where representations play a
key role in expressing, communicating, achieving, and recognizing goals.

For further information visit

https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=12070&rmlang=UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PostDoc Position in Quantitative Modeling at Aalborg University

PostDoc Position in Quantitative Modeling at Aalborg University, Denmark
************************************************************************

We are looking for a highly motivated researcher with interest in formal
quantitative modeling.

The position is for one year with the possibility for an extension for
one year. The tentative starting date is February 2020 or soon thereafter.

Applicants are required to demonstrate strong background and
understanding in formal methods. An ideal candidate would have
experience with

--- Formal quantitative modeling using Markov chains or systems of
differential equations and;
--- Tool development facilitating the use of formal methods in practice.

The envisaged research will focus on the development of novel
optimality/verification preserving reduction techniques for quantitative
models. The PostDoc will be supervised by Max Tschaikowski and be a
member of the DEIS group of Kim Larsen. She/he will be expected to
perform independent research, collaborate with team members and help
with the supervision of PhD and MSc students as appropriate.

The envisaged research will build upon the publications listed below and
the accompanying software tool ERODE
(http://sysma.imtlucca.it/tools/erode/).

L. Cardelli, M. Tribastone, M. Tschaikowski, and A. Vandin.
Maximal aggregation of polynomial dynamical systems.
Proceedings of the National Academy of Sciences (PNAS), 2017

L. Cardelli, M. Tribastone, M. Tschaikowski, and A. Vandin.
Symbolic computation of differential equivalences.
Symposium on Principles of Programming Languages (POPL), 2016


Host institution: The Computer Science Department at Aalborg University
takes a leading international position within data management and
verification. It is a very young university (1974) but with a strong
international profile in Mathematics, and Computer Science &
Engineering, also hosting the two most highly cited Computer Scientists
of the country. Denmark in general and Aalborg in particular are known
for their excellent quality of life. Denmark took the top spot on the
United Nation's World Happiness Report, 2013 & 2014 & 2016 and came in
third in the 2015 report:
http://www.visitdenmark.co.uk/en-gb/denmark/art/happiest-people-world .


Application procedure: The applicant must have obtained a PhD degree
before the appointment day. In addition to an academic CV and
recommendation letters, the applicant should provide a short cover
letter which describes the applicant's background, research interests
and initial thoughts and ideas. More specifically, interested applicants
should provide the following:

- A cover letter describing the reasons for applying, qualifications in
relation to the position, and intentions and visions for the position.
- Current academic curriculum vitae.
- Letters of recommendation (2 - 3).
- Copies of relevant certificates (Master of Science and PhD). On
request you could be asked for an official English translation.
- Additional qualifications in relation to the position (e.g., secured
scientific grants, participation in committees or boards, organization
of scientific events, etc.).
- Personal data.

For any questions, please do not hesitate to contact Max Tschaikowski (
tschaikowski@cs.aau.dk / www.maxtschaikowski.com ).

Applications should be send by email to Max Tschaikowski.

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

**********************************************************
*
* 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 30, 2019

[DMANET] [GECCO CFP (final reminder)] Call for Proposals for Tutorials, Workshops and Competitions - GECCO 2020

*********************************************************************
2020 Genetic and Evolutionary Computation Conference (GECCO 2020)
8-12 July, 2020, Cancun, Mexico. http://gecco-2020.sigevo.org/
*********************************************************************


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

* Call for Tutorials, Workshops and Competitions
* Proposals: November 7, 2019
* Acceptance Decision: December 5, 2019
* Conference: July 8-12, 2020

Call for Tutorials
---------------------------------------------------------------------

The Tutorials Chair of GECCO 2020 invites domain experts to submit
proposals for presenting a tutorial at GECCO 2020.

Tutorials at GECCO will be presented by domain experts to cover
current topics relevant to evolutionary computation researchers and
practitioners. Each tutorial will be 110 minutes long. We encourage
the inclusion of interactive activities and demos.

Tutorials will be free to all GECCO attendees. It is expected that
all the instructors involved in a tutorial will attend the
conference. One instructor/presenter of each accepted tutorial will
be able to register for GECCO at half the regular rate. (The
discount can be divided among tutorial instructors if there are more
than one. Each presenter is eligible for only a single tutorial
discount, i.e., it is not possible to aggregate discounts from more
tutorials).

Accepted tutorials' slide sets will be published as part of a
companion volume to the conference proceedings in the ACM Digital
library.

### Submission Process ###

Submissions are made via the Tutorial Proposal Form which is
available at:

https://gecco-2020.sigevo.org/index.html/Call+for+Tutorials


### Reviewing ###

Tutorial proposals will be reviewed by the GECCO 2020 organizing
committee, based on the GECCO attendees' likely interest in them,
the breadth and depth of the topic(s), and the expertise and
credentials of the instructor(s).

### Information and Submissions ###

If you have questions regarding the tutorials at GECCO 2020, please
contact the Tutorials Chair:

Efren Mezura-Montes
University of Veracruz, Mexico
Email: emezura@uv.mx

If you encounter issues or have questions about the Tutorial
Proposal Form, please contact the Electronic Media Chair:

Nadarajen Veerapen
University of Lille, France
Email: nadarajen.veerapen@univ-lille.fr


Call for Workshops
---------------------------------------------------------------------

The Workshops Chairs of GECCO 2020 invite domain experts to submit
proposals for organizing a workshop at GECCO 2020.

Workshops at GECCO provide the possibility to commonly develop
visions and exchange ideas in an informal setting, especially if
focused on an emerging research field or interdisciplinary research
area. In contrast to regular sessions, workshops can (and should)
host interactive sessions (posters, discussions, demonstrations,
etc.). Attendance at the workshops will be free to all GECCO
attendees.

Workshop organizers are responsible for coordination and publicity.
They collect and review papers, and provide a list of accepted
papers and their authors, if applicable. Alternatively, a list of
(invited) speakers and titles of talks to be given can be provided.
If required, the GECCO organizers may provide additional support to
the workshop organizers, such as publicity. Note that organizers,
participants and presenters must register for the conference.
Accepted workshop papers will be published as part of a companion
volume to the conference proceedings in the ACM Digital library.


### Submission Process ###

Submissions are made via the Workshop Proposal Form available at:

https://gecco-2020.sigevo.org/index.html/Call+for+Workshops

### Reviewing of Proposals ###

Workshop proposals will be reviewed by the Workshops Chairs and
other members of the GECCO 2020 organizing committee.
Final decisions will be made based on GECCO attendees' likely
interest, the breadth and depth of the topic(s), and the expertise
and credentials of the instructor(s).

### Information and Proposal Submissions ###

If you have questions regarding the workshops at GECCO 2020, please
contact the Workshops Chairs:

Richard Allmendinger
The University of Manchester, UK
Email: richard.allmendinger@manchester.ac.uk

Hugo Terashima-Marin
Tecnológico de Monterrey, Mexico
Email: terashima@tec.mx

If you encounter issues or have questions about the Workshop
Proposal Form, please contact the Electronic Media Chair:

Nadarajen Veerapen
University of Lille, France
Email: nadarajen.veerapen@univ-lille.fr


Call for Competitions
---------------------------------------------------------------------

The Competitions Chair of GECCO 2020 invites domain experts to
submit proposals for organizing a competition at GECCO 2020.
Competitions demonstrate how Evolutionary Computation and related
techniques can be utilized in challenging practical, real-world and
gaming settings. They also enable fair comparisons between
algorithms and (for recurrent competitions) provide the possibility
to follow the development of approaches over time.

### Submission process ###

Submissions are made via the Competition Proposal Form available at:

https://gecco-2020.sigevo.org/index.html/Call+for+Competitions

Just like at GECCO 2019, we are offering the publication of short
algorithm descriptions as 2-page contributions to the GECCO
Companion. The competition organizers decide whether they want to
offer this to the competition participants. The deadline for these
algorithm descriptions will be in April 2020, and they will be
reviewed by the respective competition organizers.

### Information and Submissions ###

If you have questions regarding the competitions at GECCO 2020,
please contact the Competitions Chair:

Markus Wagner
University of Adelaide, Australia
Email: markus.wagner@adelaide.edu.au

If you encounter issues or have questions about the Competition
Proposal Form, please contact the Electronic Media Chair:

Nadarajen Veerapen
University of Lille, France
Email: nadarajen.veerapen@univ-lille.fr


### Review Process ###

Competition proposals will be reviewed by the Competitions Chair and
other members of the GECCO 2020 organizing committee. Final
decisions will be made based on GECCO attendees' and competitors'
likely interest, the breadth and depth of the topic(s), and the
expertise and credentials of the organizer(s).
The outcome of the review process is scheduled to be announced on
December 5, 2019.

--
Gregorio Toscano, Cinvestav Tamaulipas, Mexico
Mario Garza-Fabre, Cinvestav Tamaulipas, Mexico
Publicity Chairs

Jose A. Lozano, University of the Basque Country, Spain
Editor-in-Chief

Carlos A. Coello Coello, CINVESTAV-IPN, Mexico
General Chair

--
GECCO is sponsored by the Association for Computing Machinery
Special Interest Group for Genetic and Evolutionary Computation
(ACM SIGEVO).

---------------------------------------------------------------------
**********************************************************
*
* 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/postdoc position at University of Wuppertal

Applications are invited for aPostdoctoral Researcheror aPhD studentat the Department of Production and Logistics of the University of Wuppertal, Germany. The position is 3/4 of a full position and can be started as soon as possible and funded for three years (salary according to level E13). Itis embedded in a research project funded by German Research Foundation
(DFG) on efficient matching in the sharing economy using scheduling
procedures.
We have a research focus on operations research methods with application in logistics, production planning and supply chain management. Applicants should have a business administration and/or theoretical/mathematical background and an interest in at least one of the following topics:

- operational research
- auction theory
- computational complexity theory
- scheduling theoryPostdoctoral researchers from other fields may apply as well, but should be prepared to detail how they fit in the research profile of the group.All applicants should have an excellent first academic degree in computer science, mathematics, business administration or a related discipline.  Applications should include a detailed CV, a copy of master (or PhD) thesis, a brief statement of research interests, and a list of publications (if applicable). Please send the application not later than Nov 27th, 2019 to Bergische Universität Wuppertal,

Fakultät für Wirtschaftswissenschaft - Schumpeter School of Business and
Economics,

Lehrstuhl für Produktion und Logistik,

Herrn Prof. Dr. Dirk Briskorn, 42097 Wuppertal

and via email to _*briskorn@uni-wuppertal.de*
<mailto:briskorn@uni-wuppertal.de>_


--

Prof. Dr. Dirk Briskorn
Lehrstuhl für Betriebswirtschaftslehre insb. Produktion und Logistik
Bergische Universität Wuppertal
Schumpeter School of Business and Economics
Gaußstraße 20
42119 Wuppertal
---------------------------------------------
Phone: +49 202 439-5375
E-Mail: briskorn@uni-wuppertal.de
=============================================


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

[DMANET] DEADLINE NOV. 3 - postdoctoral positions at IRIF, Paris, France

IRIF (CNRS and Université de Paris), Paris, France, is seeking excellent candidates for postdoctoral positions in all areas of the Foundations of Computer Science. Every year, about 10 new postdocs join IRIF.

IRIF (Institute for Research in Foundations of Computer Science) is a joint laboratory of the CNRS (French National Center for Scientific Research) and Université de Paris. Currently, it hosts about 90 permanent faculty members, 40 non-permanent full-time researchers, and 50 Ph.D. students. For further information about IRIF please see https://www.irif.fr/en/informations/presentation .

The postdoc positions at IRIF are financed either by the laboratory resources, or by group or personal grants, or by joint applications of IRIF members and the candidate to outside funding agencies with which IRIF is affiliated.

The starting date of the positions is usually in September-October, but this may sometimes vary. Candidates must hold a Ph.D. degree in Computer Science or a related area before the starting date of the position. Knowledge of French is not required, and applications can be sent either in French or in English.

The application deadline for most application tracks is November 3rd, 2019. For a list of specific openings as well as instructions how to apply please visit https://www.irif.fr/postes/postdoc .

**********************************************************
*
* 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] Research School on Graph Packing

LMS Research School on Graph Packing
-------------------------------------------------------

We are inviting applications for participation in a research school on
"Graph Packing":

19 - 25 April 2020,
in Eastbourne, UK.

Lecturers:
- Felix Joos (University of Hamburg, Germany): "Regularity and absorbing
for packing"
- Diana Piguet (Czech Academy of Sciences, Prague): "Random processes
and packings"
- Alexey Pokrovskiy (Birkbeck, University of London): "Rainbow matchings
and packings"

Plenary Speakers:
- Penny Haxell (University of Waterloo, Canada)
- Vojtěch Rödl (Emory University, USA)
- Peter Keevash (University of Oxford, UK)

Organisers: Peter Allen, Julia Böttcher, Jozef Skokan  (London School of
Economics)

Application deadline: 31.1.2020

More information & application form at:
http://personal.lse.ac.uk/boettche/ResearchSchool/

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

Synopsis:

The application of random processes, the regularity method, and the
absorbing method are three powerful modern techniques in Extremal
Combinatorics which featured in many significant advances in the field
over the last 20 years. One topic that brings all these three approaches
together is that of graph and hypergraph packing. Packing problems study
conditions under which copies of different graphs can be embedded
edge-disjointly into a given host graph. There are applications of this
in such diverse areas as information theory, computational complexity,
computational biology, experiment design, and the theory of
combinatorial games. With the help of the above-mentioned techniques,
celebrated breakthroughs were recently possible on a number of
long-standing and difficult questions in this area.

The purpose of this Research School is to introduce young researchers to
these problems, results, and techniques, and to explore open questions
in the field and in related research areas.

-------------------------------------------------------
The research school is financially supported by the London Mathematical
Society and the Heibronn Institute for Mathematical Science. Limited
need-based financial support is available for participants.


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

[DMANET] Two Lecturer Positions (Assistant Professorships) at University of Leicester

[Please note: One of the areas of interest for the job opportunities below is "Optimisation algorithms and Operations Research".]

********************************************************************
Lecturer in Informatics / Computer Science (2 Posts)

University of Leicester

College of Science and Engineering

School of Informatics

Salary Grade 8 - £40,322 to £49,553 per annum

Closing date: 14 November 2019

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

About the School of Informatics
============================

The University of Leicester is ranked one of the top 200 universities in the world and top 25 in the UK according to the Times Higher Education (THE) World University Rankings 2020. Informatics is a School focussed on excellence in everything we do. Working hard together, our ambitious staff and students work in cooperation to deliver research, teaching and learning of the highest quality. The School provides a rich and culturally diverse environment where both students and staff can thrive in a demanding yet cooperative and friendly atmosphere.

In research, the School's vision is to conduct internationally-leading discovery-led research in our research areas of core expertise in Applied Algorithms and AI, Foundations of Computer Science, Interaction Design and Evaluation of Socio-Technical Systems, Software Modelling and Evolution and Verification and Validation. These areas support interdisciplinary, applied and industrial research in the cross-cutting theme of "Data-Driven Application Engineering (DADA)".

We also aim to apply the outcomes of our research to the benefit of the economy and society. Under the overarching DADA theme, the School currently prioritizes two cross-cutting research sub-themes, namely Trustworthy and reliable autonomous systems and Biomedical informatics. The school has research links with the Leicester Institute for Space and Earth Observation and the Leicester Institute for Precision Medicine, and is affiliated with the College of Science and Engineering's Centre for AI and Data Analytics.

The excellence of the School's research has been confirmed in the last two national research assessment exercises (in 2008 and 2014). In each exercise, 95% of our research was judged to be of international quality, 65% was judged to be internationally leading, and over 20% of our research outputs world-leading.

In teaching, we aim to deliver an outstanding student experience, with a wide range of modern undergraduate and postgraduate programmes along with doctoral research, all responsive to a competitive and rapidly changing discipline. Our teaching is founded on strong pedagogical principles, together with a unique approach to staff/student engagement and active learning.

About the Role
===============

We will consider all candidates whose research focuses on one or more of the following areas:

- Cyber-physical systems
- Human Computer Interaction
- Machine Learning and AI
- Optimisation algorithms and Operations Research
- Software Engineering for Autonomous Systems
- Data Science

In this role you will conduct high-level research teaching whilst generating funding through grants, consultancy and knowledge transfer activities. You will give lectures, seminars and tutorials, especially in areas across the School's undergraduate and postgraduate curriculum. Your research will result in significant contributions to papers in leading international conferences and journals, whilst helping to build your relationships with external partners to support knowledge transfer and impact outside academia.

The main emphasis for selection will be on research excellence, but the role also includes the development and delivery of excellent and innovative teaching in the respective areas as well as contributions to the administration and management of the School. You will work in a very supportive environment with research and teaching mentoring. At the heart of the UK, the University of Leicester is a research-intensive university. Different areas of activity are balanced by a departmental workload model to ensure fair and transparent balance between staff and different areas of activity.

There are two full time, open ended positions available.

About You
==========

In addition to being engaged in innovative learning and teaching that engages and inspires students, you will already have an established reputation for research, with a strong record of publications (appropriate to your level of experience) in peer reviewed journals and conferences of substantial international standing. You will have excellent networking skills which you use to seek out opportunities for collaboration and citizenship, both internally and externally. You will also be able to demonstrate the ability to generate external funding through research grants, contracts or other sources. Finally, you will have a track record of engaging with a range of communities related to your research and teaching interests, including external organisations and companies.

Additional information
===================

For informal enquiries, please contact Lu Liu, Head of School of Informatics on +44 (0)116 252 3813 or l.liu@leicester.ac.uk<mailto:l.liu@leicester.ac.uk>

To apply for this position, please see:
https://jobs.le.ac.uk/vacancies/1501/lecturer-in-informatics.html

We anticipate that interviews will take place in late November or early December 2019.

About Leicester
==============

Leicester is an ambitious and leading University committed to international excellence, world-changing research and high quality, inspirational teaching. We are strongly committed to inclusivity, promoting equality and celebrating diversity among our staff and students. Our strength is built on the talent of our scholars, drawn to us by a mutual passion for discovery. We seek to embed an adventurous and entrepreneurial spirit into our research culture, and to create an environment in which both disciplinary and interdisciplinary excellence thrive.

In return for your hard work, we offer a working environment that is committed to inclusivity, through promoting equality and valuing diversity. We offer a competitive salary package with excellent pension scheme and a generous annual leave allowance. Located close to Leicester city centre, our award winning campus benefits from a wide range of cafes, a fully equipped sports centre and nursery facilities. Further information regarding our extensive range of staff benefits is available here.

**********************************************************
*
* 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] Advances in Combinatorics - first papers published

Dear colleagues,

We would like to announce that the new arXiv overlay journal Advances in
Combinatorics has published the first five papers; additional papers will
be published by the end of the year.

https://www.advancesincombinatorics.com/articles

M. Bonamy, F. Kardoš, T. Kelly, P. Nelson, L. Postle: The structure of
binary matroids with no induced claw or Fano plane restriction
W. Cames van Batenburg, T. Huynh, G. Joret, J.-F. Raymond: A tight
Erdős-Pósa function for planar minors
D. Conlon: The Ramsey number of books
J. Corsten, L. DeBiasio, A. Lamaison, R. Lang: Upper density of
monochromatic infinite paths
Z. Dvořák, X. Hu, J.-S. Sereni: A 4-choosable graph that is not
(8:2)-choosable

Advances in Combinatorics is a mathematical journal that publishes
high-quality articles about combinatorial structures such as graphs,
hypergraphs, set systems, matroids, geometrical configurations, and sets of
integers, including their algorithmic aspects. We aim to be a top-level
specialist journal in combinatorics.

The journal follows a model established by the journal "Discrete Analysis"
for diamond open access. The journal has no printed copies; instead, the
journal provides links to the published versions of the articles on arXiv.
So, the journal is free to read for everybody.

Editorial board: Béla Bollobás (Cambridge), Reinhard Diestel (Hamburg),
Timothy Gowers (Cambridge), Dan Kráľ (Masaryk Uni and Warwick), Daniela
Kühn (Birmingham), James Oxley (LSU), Bruce Reed (McGill), Gábor Sárközy
(WPI), Asaf Shapira (Tel Aviv), Robin Thomas (Georgia Tech)

The financial and administrative support for the journal is provided by the
Library of Queen's University in Kingston, ON.

**********************************************************
*
* 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 29, 2019

[DMANET] Simons-Berkeley Research Fellowships for 2020-2021

The Simons Institute for the Theory of Computing invites applications for
Simons-Berkeley Research Fellowships for the Fall 2020 and Spring 2021
semesters. Simons-Berkeley Research Fellowships are intended for
exceptional young scientists to participate in at least one of the programs
at the institute.

The Institute will host programs on "*Probability, Geometry, and
Computation in High Dimensions*" and "*Theory of Reinforcement Learning*"
in Fall 2020, and "*Satisfiability: Theory, Practice, and Beyond*" and
"*Theoretical
Foundations of Computer Systems*" in Spring 2021.

The deadline for receipt of applications is December 15, 2019. For more
information, see the call for applications:
https://simons.berkeley.edu/fellows2020.

--
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] [EXTENDED DEADLINE] Call for papers for the 9th International Conference on Artificial Intelligence in Music, Sound, Art and Design (EvoMUSART)

------------------------------------------------
[EXTENDED DEADLINE] Call for papers for the 9th International
Conference on Artificial Intelligence in Music, Sound, Art and Design
(EvoMUSART)

Please distribute

(Apologies for cross-posting)
------------------------------------------------

The 9th International Conference on Artificial Intelligence in Music,
Sound, Art and Design (EvoMUSART) will be held in Seville, Spain, on
15-17 April 2020, as part of the evo* event.

SPECIAL ISSUES: There are two special issues on JCR journals
associated to EvoMUSART: "Neural Computing and Applications" (Q1, IF:
4.66) and "Entropy" (Q2, IF: 2.419). See EvoMUSART 2020 webpage for
more information on these special issues.

The main goal of EvoMUSART is to bring together researchers who are
using Artificial Intelligence techniques (e.g. artificial neural
network, evolutionary computation, swarm, cellular automata, alife)
for artistic tasks such as visual art, music, architecture, video,
digital games, poetry, or design. The conference gives researchers in
the field the opportunity to promote, present and discuss ongoing work
in the area.

Accepted papers will be published by Springer Verlag in the Lecture
Notes in Computer Science series.

IMPORTANT DATES
Extended! Submission deadline: 15 November 2019

Evo*: 15-17 April 2020

We welcome submissions which use Artificial Intelligence techniques in
the generation, analysis and interpretation of art, music, design,
architecture and other artistic fields. Submissions must be at most 16
pages long, in Springer LNCS format. Each submission must be
anonymised for a double-blind review process. The deadline for
submission is 1 November 2019. Accepted papers will be presented
orally or as posters at the event and included in the EvoMUSART
proceedings published by Springer Verlag in a dedicated volume of the
Lecture Notes in Computer Science series.

Indicative topics include but are not limited to:

* Systems that create drawings, images, animations, sculptures,
poetry, text, designs, webpages, buildings, etc.;

* Systems that create musical pieces, sounds, instruments, voices,
sound effects, sound analysis, etc.;

* Systems that create artefacts such as game content, architecture,
furniture, based on aesthetic and/or functional criteria;

* Systems that resort to artificial intelligence to perform the
analysis of image, music, sound, sculpture, or some other types of
artistic object;

* Systems in which artificial intelligence is used to promote the
creativity of a human user;

* Theories or models of computational aesthetics;

* Computational models of emotional response, surprise, novelty;

* Representation techniques for images, videos, music, etc.;

* Surveys of the current state-of-the-art in the area;

* New ways of integrating the user in the process (e.g. improvisation,
co-creation, participation).

More information on the submission process and the topics of EvoMUSART
can be found at:
http://www.evostar.org/2020/cfp_evomusart.php

Papers published in EvoMUSART can be found at:
https://evomusart-index.dei.uc.pt

We look forward to seeing you in Seville in 2020!

The EvoMUSART 2020 organisers
Juan Romero
Aniko Ekart
Tiago Martins (publication 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/
*
**********************************************************

[DMANET] PhD Studentship at University of Exeter - a decomposition framework for mathematical programming problems Ref: 3751

The University of Exeter's College of Engineering, Mathematics and Physical Sciences is inviting applications for a fully-funded PhD studentship to commence in February 2020 or as soon as possible thereafter. For eligible students the studentship will cover UK/EU/International tuition fees plus an annual tax-free stipend of at least £15,009 for 3.5 years full-time, or pro rata for part-time study. The student would be based in the College of Engineering, Mathematics and Physical Sciences at the Streatham Campus in Exeter.

Project Description:
Mathematical optimisation problems arising from real-world applications typically consist of many interconnecting components, i.e. a fleet of vehicles at a delivery depot, crew and aircraft in airline operations and the numerous, semi-autonomous power stations supplying the electricity grid. These interconnections introduce structure that can be exploited through the use of decomposition techniques. A popular decomposition technique used to exploit such structure is Benders' decomposition.

Recently, a general Benders' decomposition framework has been made available within the mathematical and constraint programming solver SCIP (scip.zib.de). This framework provides the functionality to solve many real-world optimisation problems, specifically mixed integer programs and convex quadratic programs. However, there are still many problem classes that are not fully supported, such as convex and non-convex mixed integer non-linear problems. The goal of this project is to extend the Benders' decomposition framework in SCIP to handle a wider range of problem classes. This will involve the development of novel solution algorithms that can be applied to general problems instances.

This project requires a high competency in mathematics and software design and development. You will become part of the SCIP Development Team (scip.zib.de) and contribute to the growth of this highly regarded general purpose solver. Knowledge of discrete optimisation, operations research and linear programming is a bonus.

How to apply:
In the application process you will be asked to upload several documents.
• CV
• Letter of application (outlining your academic interests, prior research experience and reasons for wishing to undertake the project).
• Transcript(s) giving full details of subjects studied and grades/marks obtained (this should be an interim transcript if you are still studying)
• Two references from referees familiar with your academic work. If your referees prefer, they can email the reference direct to stemm-pgr-admissions@exeter.ac.uk quoting the studentship reference number.
• If you are not a national of a majority English-speaking country you will need to submit evidence of your proficiency in English.

The closing date for applications is midnight on 15th November 2019. Interviews will be held on the University of Exeter Streatham Campus the week commencing 25th November 2019.

If you have any general enquiries about the application process please email stemm-pgr-admissions@exeter.ac.uk or phone +44 (0)1392 722730 or +44 (0)1392 725150. Project-specific queries should be directed to Dr Stephen J. Maher s.j.maher@exeter.ac.uk.

The advertisement can be found at http://www.exeter.ac.uk/studying/funding/award/?id=3751

**********************************************************
*
* 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] CSR 2020 announcement

Call for Papers

15th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2020)

June 29 - July 03, 2020, Ekaterinburg, Russia

https://csr2020.sciencesconf.org/

CSR is an annual international conference held in Russia that is designed to cover a broad range of topics in Theoretical Computer Science. The list of previous CSR conferences can be found at https://logic.pdmi.ras.ru/~csr/ . Conference proceedings are published in Springer's Lecture Notes in Computer Science series. We intend to publish a selection of accepted papers in a special issue of the Springer journal "Theory of Computing Systems".

CSR 2020 will be combined with workshops and a summer school.

Details will be announced later.

IMPORTANT DATES

Deadline for submissions: January 10th, 2020

Notification of acceptance: March 15th, 2020

Conference dates: June 29 - July 03, 2020

Yandex Awards for the best paper and for the best student paper will be given by the PC.

VENUE

Ekaterinburg is the 4th largest city in Russia and the capital of the Ural region. It is easily accessible either via Moscow or Saint Petersburg, or by a direct flight from Europe (Munich, Paris, Prague, Rome) or Asia (Beijing, Harbin, Tel Aviv). The conference will take place at Ural Federal University located in the heart of the picturesque city center.

TOPICS include, but are not limited to:

* algorithms and data structures

* computational complexity, including hardness of approximation and parameterized complexity

* randomness in computing, approximation algorithms, fixed-parameter algorithms

* combinatorial optimization, constraint satisfaction, operations research

* computational geometry

* string algorithms

* formal languages and automata, including applications to computational linguistics

* codes and cryptography

* combinatorics in computer science

* computational biology

* applications of logic to computer science, proof complexity

* database theory

* distributed computing

* fundamentals of machine learning, including learning theory, grammatical inference and neural computing

* computational social choice

* quantum computing and quantum cryptography

* theoretical aspects of big data



DISTINGUISHED OPENING LECTURE / INVITED SPEAKERS

to be announced

PROGRAM COMMITTEE

Eric W. Allender<http://www.cs.rutgers.edu/~allender/> (Rutgers University, USA)

Sergey Bereg<https://personal.utdallas.edu/~besp/> (University of Texas at Dallas, USA)

Davide Bilo<https://sites.google.com/site/bilodavide/> (University of Sassari, Italy)

Karl Bringmann (MPI Saarbrücken, Germany)

Tin-Chih Toly Chen (National Chiao Tung University, Taiwan)

Henning Fernau<https://www.uni-trier.de/index.php?id=49861&L=2> (University of Trier, Germany, PC Chair)

Alexander Grigoriev<https://www.maastrichtuniversity.nl/a.grigoriev> (Maastricht University, Netherlands)

Yo-Sub Han<http://toc.yonsei.ac.kr/~emmous/> (Yonsei University, Republic of Korea)

Kun He<http://faculty.hust.edu.cn/hekun/en/index.htm> (Huazhong University, China)

Dominik Kempa<https://sites.google.com/view/dkempa/home> (University of Warwick, UK)

Mikhail Khachay (Krasovsky Institute of Mathematics and Mechanics, Russia)

Dmitry Kosolobov (Ural Federal University, Russia)

Andrei Krokhin<http://community.dur.ac.uk/andrei.krokhin/> (Durham University, UK)

Giuseppe Lancia<https://users.dimi.uniud.it/~giuseppe.lancia/> (University of Udine, Italy)

Meena Mahajan<https://www.imsc.res.in/~meena/> (The Institute of Mathematical Sciences Chennai, India)

David Manlove<http://www.dcs.gla.ac.uk/~davidm/> (University of Glasgow, UK)

Neeldhara Misra<https://www.iitgn.ac.in/faculty/comp/neeldhara.htm> (IIT Gandhinagar, India)

Jérôme Monnot<https://www.lamsade.dauphine.fr/~monnot/> (Paris Dauphine University, France)

Sergio Rajsbaum<https://www.matem.unam.mx/~rajsbaum/> (Universidad Nacional Autonoma de Mexico, Mexico)

Jörg Rothe<https://ccc.cs.uni-duesseldorf.de/~rothe/> (University of Düsseldorf, Germany)

Markus L. Schmid<http://www.mlschmid.de/> (Humboldt University of Berlin, Germany)

Vladimir V. Shenmaier (Sobolev Institute of Mathematics, Russia)

Arseny Shur<http://kadm.imkn.urfu.ru/pages.php?id=shureng> (Ural Federal University, Russia)

Ulrike Stege<http://webhome.cs.uvic.ca/~stege/Ulrike_Steges_Homepage/Welcome.html> (University of Victoria, Canada)

Serghei Verlan<http://www.lacl.fr/verlan/index.html> (University of Paris Est Créteil, France)

Mikhail Volkov<http://csseminar.imkn.urfu.ru/volkov/> (Ural Federal University, Russia)

Yaokun Wu<http://math.sjtu.edu.cn/faculty/ykwu/Home.php> (Shanghai Jiao Tong University, China)

Tomoyuki Yamakami<http://tomoyukiyamakami.info/> (University of Fukui, Japan)

Ryo Yoshinaka (Tohoku University, Japan)

STEERING COMMITTEE

Edward A. Hirsch<http://logic.pdmi.ras.ru/~hirsch/> (St. Petersburg Department of Steklov Institute of Mathematics, Russia)

Juhani Karhumäki<https://www.utu.fi/en/people/juhani-karhumaki> (University of Turku, Finland)

Alexander Kulikov<http://logic.pdmi.ras.ru/~kulikov/> (St. Petersburg Department of Steklov Institute of Mathematics, Russia)

Ernst W. Mayr<http://wwwmayr.informatik.tu-muenchen.de/personen/mayr/index.html.en> (Technische Universität München, Germany)

Alexander Razborov<http://people.cs.uchicago.edu/~razborov/research.html> (University of Chicago, USA and Steklov Institute of Mathematics, Moscow, Russia)

Mikhail Volkov<http://csseminar.imkn.urfu.ru/volkov/> (Ural Federal University, Russia)


SUBMISSIONS

Authors are invited to submit papers presenting original research in the conference topics, in electronic form (pdf format) via EasyChair at https://easychair.org/conferences/?conf=csr2020

Submissions must be unpublished, not under review for publication elsewhere, and provide sufficient information to judge their merits. Submissions must be in English, and not exceed 12 pages, including the title page, in Springer's LNCS LaTeX style. Additional material, to be read at the discretion of reviewers and PC members, may be provided in a clearly marked appendix or by reference to a manuscript on a web site.

At least one of the authors must commit to presenting the paper at the conference.

Further information and contacts

Web: <http://logic.pdmi.ras.ru/csr2019/> https://csr2020.sciencesconf.org/ Email: csr2020@sciencesconf.org<mailto:csr2020@sciencesconf.org>


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

Monday, October 28, 2019

[DMANET] Two postdoctoral positions in algorithms/random graphs at the University of Glasgow

We are pleased to announce two postdoctoral positions at the University of Glasgow, working with Kitty Meeks and Jessica Enright on the EPSRC-funded project Multilayer Algorithmics to Leverage Graph Structure (MultilayerALGS). These positions are funded for 36 months starting on 1st March 2020 or as soon as possible thereafter.



Candidates for both positions should have (or expect to obtain very soon) a PhD in Computer Science, Mathematics, or a closely related area. The two positions require slightly different expertise: for the first, we are looking for experience in random graphs and/or complex network models, and for the second the emphasis is on algorithmic graph theory and/or parameterised complexity. Candidates whose skills span the two positions are strongly encouraged to apply for both.



The closing date for applications is 5th December 2019, and interviews are scheduled for 10th January 2020. Informal enquiries to Kitty Meeks (kitty.meeks@glasgow.ac.uk<mailto:kitty.meeks@glasgow.ac.uk>) or Jessica Enright (jessica.enright@glasgow.ac.uk<mailto:jessica.enright@glasgow.ac.uk>) are welcome.



For more details and to apply, see https://www.jobs.ac.uk/job/BWG821/research-associate.


---
Kitty Meeks
Royal Society of Edinburgh Research Fellow
School of Computing Science, University of Glasgow

http://www.dcs.gla.ac.uk/~kitty/

Direct line: +44 (0)141 330 1631


**********************************************************
*
* 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 CPM Symposium on Combinatorial Pattern Matching (CPM 2020)

The 31th Annual Symposium on Combinatorial Pattern Matching (CPM 2020) will be held in
Copenhagen, Denmark, June 17-19, 2020.


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
Important dates


DEADLINE: Sunday, February 9, 2020, anywhere on Earth


SUBMISSION
Submission is through the EasyChair conference system:
https://easychair.org/conferences/?conf=cpm2020


SUBMISSION FORMAT

The authors should submit an extended abstract not exceeding 10 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). References will not be counted in the page limit. At least 10-point font should be used.

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 and surveys of important results. 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.


PROGRAM COMMITTEE MEMBERS

Amir Abboud
Amihood Amir
Hideo Bannai
Philip Bille
Panagiotis Charalampopoulos
Debarati Das
Rolf Fagerberg
Gabriele Fici
Johannes Fischer
Elazar Goldenberg
Roberto Grossi
Inge Li Gørtz (co-chair)
Danny Hermelin
Artur Jez
Dominik Kempa
Juha Kärkkäinen
Dominik Köppl
Avivit Levy
Zsuzsanna Lipták
Giovanni Manzini
Shay Mozes
Kunsoo Park
Solon Pissis
Nicola Prezza
Jakub Radoszewski
Wojciech Rytter
Sharma Thankachan
Przemyslaw Uznanski
Tomasz Waleń
Oren Weimann (co-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/
*
**********************************************************

Saturday, October 26, 2019

[DMANET] LATIN 2020 Second CFP

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

SECOND CALL FOR PAPERS

LATIN 2020

The 14th Latin American Theoretical Informatics Symposium
May 25 to 29, 2020 --- São Paulo, Brazil

https://latin2020.ime.usp.br

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

LATIN (Latin American Theoretical Informatics) started in 1992, when a
group of Latin American researchers, under the leadership of Imre
Simon (São Paulo, Brazil), launched the first of a series of symposia
in theoretical computer science, to be held in Latin America. This is
the 14th meeting of the series, after São Paulo, Brazil (1992),
Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este,
Uruguay (2000), Cancún, Mexico (2002), Buenos Aires, Argentina (2004),
Valdivia, Chile (2006), Búzios, Brazil (2008), Oaxaca, Mexico (2010),
Arequipa, Peru (2012), Montevideo, Uruguay (2014), Ensenada, Mexico
(2016) and Buenos Aires, Argentina (2018).

In 2020, LATIN will be held at the University of São Paulo, Brazil.

For further information on LATIN, visit http://latintcs.org

----------------------------------------------------------------------
SCOPE AND TOPICS
----------------------------------------------------------------------

LATIN is devoted to different areas in theoretical computer science
including, but not limited to: algorithms (approximation, online,
combinatorial optimization, etc.), algorithmic game theory, analytic
combinatorics and analysis of algorithms, automata theory and formal
languages, combinatorics and graph theory, computational algebra and
number theory, computational complexity, computational biology,
computational geometry, data structures and information retrieval,
foundations of data science and theoretical machine learning, parallel
and distributed computing, quantum computing, randomization and
pseudorandomness, sublinear algorithms and testing.

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

Maria-Florina Balcan, Carnegie Mellon University
Nikhil Bansal, CWI and Eindhoven University of Technology
Maria Chudnovsky, Princeton University
Nicole Immorlica, Microsoft Research
Eduardo Sany Laber, Pontifical Catholic University of Rio de Janeiro
Alexander Razborov, The University of Chicago
Luca Trevisan, Bocconi University
Bianca Zadrozny, IBM Research Brazil

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

Paper Abstract Submission: 10 November 2019
Paper Submission: 17 November 2019
Notification of Paper Authors: 3 February 2020
Camera Ready: 24 February 2020

------

Poster Abstract Submission: 23 February 2020
Notification of Poster Authors: 17 March 2020
Poster Final Version Submission: 20 March 2020

All deadlines are AOE time zone.

----------------------------------------------------------------------
PROCEEDINGS
----------------------------------------------------------------------

As in previous editions, the proceedings of LATIN 2020 will be
published in Springer's Lecture Notes in Computer Science. Visit the
LATIN webpage at SpringerLink:
https://link.springer.com/conference/latin

----------------------------------------------------------------------
SUBMISSION
----------------------------------------------------------------------

The submission process must be completed electronically through
EasyChair (https://easychair.org/conferences/?conf=latin2020).

Submitted papers are limited to twelve (12) single-column letter-size
pages in Springer LNCS format, and must be written in English. For
the submission guidelines, please check the LATIN 2020 website at
https://latin2020.ime.usp.br

----------------------------------------------------------------------
POSTER SESSIONS
----------------------------------------------------------------------

LATIN 2020 will have poster sessions to facilitate and promote
attendance. We especially encourage students and young researchers to
submit their preliminary findings and on-going work covering all the
subjects of LATIN.

Poster authors are required to submit a two-page abstract of their
work. All submissions will be peer-reviewed, and at least one author
of each abstract accepted to the poster session must present the work
personally at the poster session of LATIN 2020.

For details, please visit https://latin2020.ime.usp.br

----------------------------------------------------------------------
MINICOURSES
----------------------------------------------------------------------

We plan to have minicourses during the LATIN2020. Details will be
available on the LATIN 2020 website.

----------------------------------------------------------------------
PROGRAMME COMMITTEE
----------------------------------------------------------------------

Yoshiharu Kohayakawa (Chair), Universidade de São Paulo, Brazil
Flávio Keidi Miyazawa (Chair), Universidade Estadual de Campinas, Brazil

* Andris Ambainis, University of Latvia, Latvia
* Frédérique Bassino, Université Paris 13, France
* Flavia Bonomo, Universidad de Buenos Aires, Argentina
* Prosenjit Bose, Carleton University, Canada
* Olivier Carton, Université Paris Diderot, France
* Ferdinando Cicalese, University of Verona, Italy
* Jose Correa, Universidad de Chile, Chile
* Pierluigi Crescenzi, Université Paris Diderot, France
* Luc Devroye, McGill University, Canada
* Martin Dietzfelbinger, TU Ilmenau, Germany
* David Fernández-Baca, Iowa State University, USA
* Esteban Feuerstein, Universidad de Buenos Aires, Argentina
* Eldar Fischer, The Technion, Israel
* Pierre Fraigniaud, Université Paris Diderot, France
* Martin Fürer, The Pennsylvania State University, USA
* Anna Gál, The University of Texas at Austin, USA
* Ron Holzman, The Technion, Israel
* Marcos Kiwi, Universidad de Chile, Chile
* Teresa Krick, Universidad de Buenos Aires, Argentina
* Cláudia Linhares Sales, Universidade Federal do Ceará, Brazil
* Kazuhisa Makino, Kyoto University, Japan
* Conrado Martínez, Universitat Politècnica de Catalunya, Spain
* Marco Molinaro, Pontifical Catholic University of Rio de Janeiro, Brazil
* Veli Mäkinen, University of Helsinki, Finland
* Gonzalo Navarro, Universidad de Chile, Chile
* Rolf Niedermeier, TU Berlin, Germany
* Rafael Oliveira, University of Toronto, Canada
* Roberto Imbuzeiro Oliveira, IMPA, Brazil
* Daniel Panario, Carleton University, Canada
* Alessandro Panconesi, Sapienza Università di Roma, Italy
* Pan Peng, University of Sheffield, UK
* Ely Porat, Bar-Ilan University, Israel
* Paweł Prałat, Ryerson University, Canada
* Pavel Pudlák, Czech Academy of Sciences, Czech Republic
* Svetlana Puzynina, Saint Petersburg State University, Russia
* Sergio Rajsbaum, Universidad Nacional Autónoma de México, Mexico
* Andrea Richa, Arizona State University, USA
* Rahul Santhanam, University of Oxford, UK
* Asaf Shapira, Tel Aviv University, Israel
* Alistair Sinclair, UC Berkeley, USA
* Mohit Singh, Georgia Tech, USA
* Maya Stein, Universidad de Chile, Chile
* Jayme Luiz Szwarcfiter, Universidade Federal do Rio de Janeiro, Brazil
* Eli Upfal, Brown University, USA
* Jorge Urrutia, Universidad Nacional Autónoma de México, Mexico
* Brigitte Vallée, Université de Caen, France
* Mikhail V. Volkov, Ural Federal University, Russia
* Raphael Yuster, University of Haifa, Israel

----------------------------------------------------------------------
IMRE SIMON TEST-OF-TIME AWARD
----------------------------------------------------------------------

As of 2012, the Imre Simon Test-of-Time Award is given to the LATIN
paper deemed most influential among all those published at least ten
years prior to the current edition of the conference. Papers
published in the LATIN proceedings up to and including 2010 are
eligible for the 2020 award.

----------------------------------------------------------------------
BEST PAPER AWARD
----------------------------------------------------------------------

Papers presented at the conference will be considered for the LATIN
2020 Alejandro Lopez-Ortiz Best Paper Award.

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

C. N. Lintzmayer (co-chair), UFABC; G. O. Mota (co-chair), UFABC;
J. C. de Pina (co-chair), USP; Y. Wakabayashi (co-chair), USP;
M. K. de Carli Silva, USP; C. E. Ferreira, USP; C. G. Fernandes, USP;
A. Mandel, USP; D. M. Martin, UFABC; L. L. C. Pedrosa, Unicamp;
S. Robins, USP; C. M. Sato, UFABC; R. C. S. Schoeury, Unicamp;
E. C. Xavier, Unicamp.

----------------------------------------------------------------------
LATIN STEERING COMMITTEE
----------------------------------------------------------------------

Kirk Pruhs (chair), University of Pittsburgh, USA; Michael A. Bender,
Stony Brook University, USA; Cristina G. Fernandes, Universidade de
São Paulo, Brazil; Joachim von zur Gathen, Bonn-Aachen I.C.I.T.,
Germany; Evangelos Kranakis, Carleton University, Canada; Alfredo
Viola, Universidad de la República, Uruguay.


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

Friday, October 25, 2019

[DMANET] DCC '20 deadline extended

Dear Colleague,

The deadline for the *IEEE Data Compression Conference* (DCC '20) has
been *extended
by a week*, from November 1st to November 8th. The conference will feature
another special session on *Computation over Compressed Data*. This
session extends the special sessions at DCC '14, '16 and '18 and we invite
you to submit interesting new results you may have both on *compact data
structures* and on *compression-aware algorithms* (i.e., those that run
faster on compressible inputs).

The session will be an opportunity for members of our community to confer
with each other and reinforce our topics' relevance to the wider field of
data compression. Selected papers from the 2014, 2016 and 2018 sessions
were invited to special issues of the *Journal of Discrete Algorithms*
(published March 2017), *Algorithmica* (published July 2018) and *Information
and Computation* (in preparation), respectively. If we again receive
enough suitable papers, we will arrange another special issue of a
comparable journal for extended versions of some of them.

Papers are now due by *November 8th* 2019 (23:59 PST) and the conference
will take place from March 24th to 27th 2020 in Snowbird, Utah (a premier
ski resort in the Rocky Mountains). The DCC submission process (see
http://www.cs.brandeis.edu/~dcc/Call.html) will allow authors to direct
their papers to the special session, but submissions will be otherwise
handled in the same way, will be subject to the same review process and, if
accepted, will be included in the same proceedings.

Best regards,
Travis Gagie and Simon Gog
(session co-chairs)

**********************************************************
*
* 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: SWAT 2020: The 17th Scandinavian Symposium and Workshops on Algorithm Theory, Torshavn, Faroe Islands, June 22-24, 2020

CALL FOR PAPERS

Paper Submission Deadline: February 14, 2020

https://easychair.org/cfp/swat2020


SWAT 2020: 17th Scandinavian Symposium and Workshops on Algorithm Theory
Vestarabryggja 15, Torshavn, Faroe Islands, June 22-24, 2020
https://www.setur.fo/en/education/swat-2020/


The Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which alternates with the Algorithms and Data Structures Symposium (WADS), is a forum for researchers in the area of design and analysis of algorithms and data structures.

We invite submissions of papers presenting original research on algorithms and data structures. Though we welcome experiments, the theoretical results in the articles will be the main measure for evaluating their merits. Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parametrized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms. The algorithmic problems considered may be motivated by applications, e.g. in optimization, geometry and topology, graph analysis, bioinformatics, visualization, string processing, information retrieval, machine learning, algorithmic game theory, or mechanism design.

Contributors must submit their papers using the Easychair system Submissions (https://easychair.org/cfp/swat2020) should be in LIPIcs format (without font size, margin, or line spacing changes), and not exceed 12 pages including front page and references. See www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren<http://www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren> for instructions. Additionally, if full details of proofs do not fit into the page limit, a clearly marked appendix containing the remaining details must be included; this appendix will not be regarded as part of the submission and will be considered only at the discretion of the program committee. Submissions deviating substantially from this format risk rejection without consideration of their merits.

Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the symposium, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal. However, we encourage authors to make a preprint of their paper available at a public repository such as arXiv. At least one author of every accepted paper is expected to register and present the paper at the symposium. Symposium proceedings will be published in the "Leibniz International Proceedings in Informatics" (LIPIcs) series. A prize will be awarded to the author(s) of the best student-authored paper. A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the submission process.

Important Dates
Paper submission deadline: February 14, 2020
Notification of acceptance: Early April, 2020
Symposium: June 22-24, 2020

Program Committee
Peyman Afshani, Aarhus University
Susanne Albers (chair), Technical University of Munich
Per Austrin, KTH Royal Institute of Technology
Sayan Bhattacharya, University of Warwick
Joan Boyar, University of Southern Denmark
Parinya Chalermsook, Aalto University
Timothy Chan, University of Illinois at Urbana-Champaign
Faith Ellen, University of Toronto
Travis Gagie, Diego Portales University Santiago
Naveen Garg, Indian Institute of Technology, Delhi
Fabrizio Grandoni, IDSIA, University of Lugano
Roberto Grossi, University of Pisa
Pinar Heggernes, University of Bergen
Thore Husfeldt, Lund University and IT University of Copenhagen
Telikepalli Kavitha, Tata Institute of Fundamental Research
Yusuke Kobayashi, Kyoto University
Kasper Green Larsen, Aarhus University
Daniel Lokshtanov, University of California Santa Barbara
Benjamin Moseley, Carnegie Mellon University
Wolfgang Mulzer, Freie Universität Berlin
Seth Pettie, University of Michigan
Michał Pilipczuk, University of Warsaw
Hadas Shachnai, Technion
Michiel Smid, Carleton University
Philipp Woelfel, University of Calgary
Christian Wulff-Nilsen, University of Copenhagen
Qin Xin, University of the Faroe Islands

Organizing Committee
Olavur Ellefsen, Tokni and University of the Faroe Islands
Jogvan Thomsen, Vinnustovnurin
Michael Thomsen, Globe Tracker and University of the Faroe Islands
Qin Xin (Chair), University of the Faroe Islands

Steering Committee
Lars Arge, Aarhus University
Magnús M. Halldórsson (Chair), Reykjavík University
Andrzej Lingas, Lund University
Jan Arne Telle, University of Bergen
Esko Ukkonen, University of Helsinki






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