Saturday, October 31, 2020

[DMANET] Call for Papers (extended submission deadline) - EvoMUSART 2021 - 10th International Conference on Artificial Intelligence in Music, Sound, Art and Design

------------------------------------------------
Call for papers for the 10th International Conference on Artificial
Intelligence in Music, Sound, Art and Design (EvoMUSART) · Please
distribute · Apologies for cross-posting
------------------------------------------------

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

EvoMUSART webpage: www.evostar.org/2021/evomusart

*Extended submission deadline:* 19 November 2020
Conference: 7-9 April 2021

Special Issue on Genetic Programming and Evolvable Machines — The journal
"Genetic Programming and Evolvable Machines" (Q2, IF: 1.78) will publish a
Special Issue called "Evolutionary computation in Art, music & Design". The
editors of this Special Issue will be Juan Romero and Penousal Machado.
Some authors from EvoMUSART 2021 will be invited to submit a new paper to
this Special Issue.

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.

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 19 November 2020. 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).

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

More information on the submission process and the topics of EvoMUSART can
be found at: www.evostar.org/2021/evomusart

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

We look forward to seeing you in Seville in 2021!

The EvoMUSART 2021 organisers
Juan Romero
Tiago Martins
Nereida Rodríguez-Fernandez (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/
*
**********************************************************

Friday, October 30, 2020

[DMANET] *** ITC 2021: International Timetabling Competition – Sports Timetabling ***

*** ITC 2021: International Timetabling Competition – Sports Timetabling ***

 

* https://www.sportscheduling.ugent.be/ITC2021/ *

 

We are announcing the start ofthe new edition of the international timetabling competition (ITC 2021), which focuseson sports timetabling. We call for your participation.

 

In sports timetabling, theproblem is to decide on a suitable date for each of the matches to be played inthe tournament. This is a complex and challenging problem, even for a smallnumber of contestants. Our competition offers a rich and diverse set of sportstimetabling instances, involving up to 9 different constraints that are commonin real-life.

 

We invite any interested timetabler to participate, and aim to keep the threshold for participation as low aspossible. In that sense, the competition rules have no time or technologyrestrictions: we are looking for the best solutions regardless of thecomputation time, and commercial solvers are allowed. Our website offerssupport for handling the problem instance format.

 

Thanks to our sponsors, we canaward several prizes for the winners, such as 1000 EUR and a free registrationfor the PATAT 2021 conference (Bruges, Belgium) for the winner, and a freeregistration for the MathSport 2021 conference (Reading, UK) for the bestintermediate result.

 

There will be a special trackrelated to ITC 2021 at the PATAT 2021 conference. Moreover, each participantwill have the opportunity to submit a paper for a special journal issue of theconference.

 

The competition closes onApril 30th, 2021. We will release the instances in three groups(early, middle, and late); the early instances are now available on ourwebsite.

 

IMPORTANT DATES

October 31, 2020:  Early instances are published

January 1, 2021: Milestonesubmission deadline

February 2021:  Middle instances are published

April 2021: Late instances arepublished

April 30, 2021: Submissiondeadline, competition closes

May 2021: Finalists areannounced

August 2021: Winners areannounced

 

PRIZES

Winner first milestone:

Free registration forMathSport International 2021 (Reading, UK)

 

Top three overall:

Winner: 1,000EUR + freeregistration for PATAT 2021 (Bruges, Belgium)

Runner-up: 500EUR + discounton registration for PATAT 2021

Third: 250EUR + discount onregistration for PATAT 2021

 

SPONSORS

- EURO working group onAutomated Timetabling (EWG PATAT)

- EURO working group OR inSports (EWG OR in Sports)

 

ORGANIZERS

- David Van Bulck, GhentUniversity

- Dries Goossens, Ghent University

- Jeroen Beliën, KU Leuven

- Morteza Davari, SKEMABusiness School

 

We refer to our website (https://www.sportscheduling.ugent.be/ITC2021/) for all further information. In case you have anyquestions or want to participate in the competition, please send a mail to itc2021@ugent.be.

 

 

 


**********************************************************
*
* 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] WEPA 2020 CALL FOR PAPERS

Dear Colleagues,

We warmly invite submissions related to enumeration to WEPA 2020: Fourth
Workshop on Enumeration Problems and Applications, December 7-10, Online,
and to share this message with people interested in enumeration.
Apologies for cross posting.


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

WEPA 2020 is the Fourth International Workshop on Enumeration Problems and
Applications.
It will take place fully online from Monday, December 7 to Thursday,
December 10, 2020.

Website: https://sites.google.com/view/wepa2020

==================================
IMPORTANT DATES

Submission deadline: November 8 (AoE) abstract registration, November 11
(AoE) full abstract.
Notification: November 25
Registration: December 5
Event: December 7-10

==================================
AIMS AND SCOPE

WEPA is an international forum for researchers in the area of design,
analysis, experimental evaluation, and engineering of algorithms for
enumeration problems. The objective of the workshop is to gather
researchers working in enumeration algorithms, including their applications
in Biology, Data Mining, Logic, and Databases. The goal is to present
recent results, identify and explore directions for future research, and
foster collaborations.

For this reason, along with the sessions for the presentation of
established results, WEPA will feature sessions that are devoted to ideas,
sketches, and open problems. This aims to put in touch senior researchers
with junior researchers and graduate students to investigate problems of
theoretical and practical interest. These sessions will be informal, with
no scheduled presentations, and entirely devoted to the interactions among
the participants. The workshop will feature some (virtual) rooms to allow
space for the parallel working groups.

Submissions to WEPA should describe results in any area of enumeration
problems and including, but not restricted to:
- Applications in Biology, Data Mining, Logic, and Database
- Approximate enumeration and counting
- Combinatorial enumeration and counting
- Input-sensitive algorithms
- Output-sensitive algorithms

==================================
SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 2 pages
(excluding references).
Both original research and discussion of published results are welcome.
Submissions are to be made electronically via EasyChair at
https://easychair.org/conferences/?conf=wepa2020. Invited papers and
accepted contributions will be invited to contribute to a special issue in
a journal.

==================================
REGISTRATION

This year WEPA will be held fully online with no registration fee. However,
it is mandatory to register before December 5 by sending a message to
wepa2020online@gmail.com with the subject "WEPA 2020 registration". All
information regarding participation will be sent to the emails used for
registration.

==================================
INVITED SPEAKERS

Bruno Courcelle (Labri, CNRS and Bordeaux University)
Nicole Schweikardt (Humboldt University of Berlin)
Yann Strozecki (Université de Versailles)

==================================
PROGRAM COMMITTEE

Yixin Cao (Hong Kong Polytechnic University)
Alessio Conte - PC Chair (University of Pisa)
Nadia Creignou (Aix Marseille Univ, Université de Toulon, CNRS, LIS)
Arnaud Durand (Université Paris-Diderot)
David Eppstein (University of California, Irvine)
Fedor Fomin (University of Bergen)
Serge Gaspers (UNSW)
Takashi Horiyama (Hokkaido University)
Mamadou M. Kanté (Université Clermont Auvergne, LIMOS)
Benny Kimelfeld - PC Chair (Technion)
Andrea Marino (University of Florence)
Arnaud Mary (Univ. Claude Bernard- Lyon 1)
Marie-France Sagot (ERABLE European Team, INRIA)
Blerina Sinaimeri (Université Lyon I, INRIA)
Darren Strash (Hamilton College)
Etsuji Tomita (University of Electro Communications)
Takeaki Uno (National Institute of Informatics, Japan)
Kunihiro Wasa (Toyohashi University of Technology)

==================================
ORGANIZING COMMITTEE

Caroline Brosse
Alessio Conte - Chair
Kazuhiro Kurita
Francesco Landolfi
Giulia Punzi
Davide Rucci
Kunihiro Wasa

**********************************************************
*
* 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] Lectureships in Digital Business & Data Analytics at the University of Liverpool

Lectureships in Digital Business & Data Analytics

Operations and Supply Chain Management

University of Liverpool Management School

https://www.jobs.ac.uk/job/CBY459/lecturers-in-digital-business-and-data-analytics-grade-8

£41,526 - £52,560 pa

The Operations and Supply Chain Management Group is now seeking to appoint two new colleagues at the level of Lecturer (the equivalent to Assistant Professor). Operations and supply chain-related research at ULMS has a broad scope and includes an increasing interest in digital business, data analytics and software engineering developments and applications to operations and supply chain design and management. Applications from those with relevant research experience, strong publication plans, and teaching interests in digital business and data analytics are of particular interest for these posts.

You will possess a relevant PhD, or be close to completion of a PhD, and will demonstrate the potential of publishing in world-leading or internationally-excellent journals. Candidates will be able to evidence future research plans demonstrating a capacity to sustain a high level of output.

You will also be expected to demonstrate a desire to teach subjects related to the post as they will teach on undergraduate and/or postgraduate programmes. The School seeks excellence in all aspects of student experience and looks for individuals with a passion for innovative pedagogies and the capacity to create and deliver new and highly contemporary modules.

Closing date 9 November 2020

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

Thursday, October 29, 2020

[DMANET] SSCC 2020 CFP: The International Symposium on Solutions for Smart Cities Challenges , Paris, France. December 14-16, 2020

*The International Symposium on Solutions for Smart Cities Challenges (SSCC
2020)*

Paris, France. December 14-16, 2020

*http://www.sscc.fr/SSCC2020/index.html*
<http://www.sscc.fr/SSCC2020/index.html>



in conjunction with "The Seventh International Conference on Internet of
Things: Systems, Management and Security (IoTSMS 2020)"



*SSCC 2020 CFP*

Internet of Things (IoT) is used to collect and exchange massive data. This
technology promises an immense potential for improving the quality of life,
healthcare, manufacturing, transportation, etc. The use of the IoT in smart
buildings has a great importance and promising outcomes with a direct
impact on our society. Researchers and industrial partners have achieved
several applications where they have leveraged various enabling
technologies for service enhancement. Many sectors in a smart city can
benefit from an enhanced data collection and effective data analysis
process done on the data gathered from these smart building devices that
mainly consist of HVAC systems. However, the incremental number of
connected IoT devices request a scalable and robust network. Consequently,
it rises the attack surfaces of devices as well as their connections, which
make them more exposed to internal and external at tacks. In this context,
the challenging issue is how to construct a secure IoT network and
preserving its resiliency.



*SSCC2020* invites submissions discussing the employment of smart solutions
and approaches in smart cities. Topics of either theoretical, empirical or
applied interest include, but are not limited to:



*Safety, Security, and Resilience*

- Smart networks for smart cities
- Security management in smart cities
- Security in distributed systems
- Modeling, analysis and detection of IoT attacks
- Data mining for cybersecurity in smart cities
- Decentralized architecture for smart cities
- Consensus protocols and applications

*IoT & AI*

- IoT Indoor deployment
- IoT communication protocols
- Building information modeling (BIM) IoT-based HVAC control in smart
buildings
- Artificial Intelligence in Cyber Physical Energy Systems
- Optimization for IoT and smart cities
- Dynamic scheduling for IoT deployment
- Autonomous and Smart decisions

*Edge and Cloud *

- Cloud-Edge for IoT and smart cities
- Fog and Edge computing for smart cities
- Applications/services for Edge AI
- Software Platforms for Edge

*Social aspects and applications *

- Behavioral and Energy Consumption Analytics
- Indoor comfort
- Human factors and organizational resilience for distributed systems

*Important Dates*

- *Paper Submission Date: 15 November, 2020*
- Notification to Authors: 23 November, 2020
- Camera Ready Submission: 1 December 2020

*Submission System*

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



Please send any inquiry to SSCC Team at: contact@sscc.fr

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

[DMANET] Last Call for Papers: CIAC 2021 - 12th International Conference on Algorithms and Complexity

CALL FOR PAPERS

CIAC 2021 - 12th International Conference on Algorithms and Complexity
10-12 May 2021 – Larnaca, Cyprus
http://easyconferences.eu/ciac2021/

COVID19 contingency plan: The steering committee is monitoring closely the situation with COVID19. In case there are any travel restrictions at the time of the conference due to the ongoing pandemic, the organizers will make the necessary arrangements so that affected presenters could make their presentations remotely.

Aims and Scope
The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

Topics
Papers presenting original research in the areas of algorithms and complexity are sought, including (but not limited to):
- sequential, parallel and distributed algorithms and data structures
- approximation and randomized algorithms
- graph algorithms and graph drawing
- on-line and streaming algorithms
- analysis of algorithms and computational complexity
- algorithm engineering
- web algorithms
- exact and parameterized computation
- algorithmic game theory
- computational biology
- foundations of communication networks
- computational geometry
- discrete optimization

Invited Speakers
- Henning Fernau, Trier University, Germany
- Katharina Huber, University of East Anglia, UK
- Seffi Naor, Technion Haifa, Israel

Proceedings
The conference proceedings will be published by Springer-Verlag in the ARCoSS/LNCS series and will be available for distribution at the conference. Accepted papers will be allocated 12 pages total in the LNCS format in the proceedings. More information about the LNCS format can be found on the author instructions page of Springer-Verlag.

Special Issue
The authors of selected papers will be invited to submit an extended version of their paper for possible publication on a special issue of Theoretical Computer Science devoted to CIAC 2021.

Best Paper Award
There will be a CIAC 2021 Best Paper Award, accompanied by a prize of EUR 1,000 offered by Springer.

Important dates
- Deadline for submission: October 31, 2020, 23:59 AoΕ
- Deadline for uploading new versions of already submitted papers: November 6, 2020, AoE
- Notification of acceptance: December 22, 2020
- Final manuscript, camera ready: January 31, 2021

Submission
Authors are invited to submit an extended abstract of at most 12 pages by October 31, 23:59 AoE.
Uploading updated versions of already submitted papers will be allowed until November 6, 23:59 AoE
Submissions are handled by EasyChair at the following web https://easychair.org/conferences/?conf=ciac2021
All submissions will be rigorously peer-reviewed and evaluated on the basis of the quality of their contribution, originality, soundness, and significance.
Simultaneous submission of papers to any other conference with proceedings published or made publicly available, or submitting papers previously accepted for journal publication is not allowed.

Submission Format: An extended abstract submitted to CIAC 2021 should start with the title of the paper, each author's name, affiliation and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results, including motivation and a clear comparison with related work. The extended abstract should not exceed 12 pages total in the LNCS format.
Note: References/Bibliography will not be counted as part of the 12 pages; figures and tables will be counted. If the authors believe that more details are essential to substantiate the claims of the paper, they may include a clearly marked appendix (with no space limit) that will be read at the discretion of the Program Committee. It is strongly recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately.


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

[DMANET] ICALP 2021 - Call for Workshops

==================================
ICALP 2021 Call for Workshops
==================================
*** We are closely monitoring the development of the COVID-19 pandemic. If it is not viable to hold ICALP 2021 as a physical conference, we will run it virtually on the same dates. We will decide in January 2021 at the latest. If ICALP 2021 can go ahead as a physical conference, accepted authors may still present remotely. ***

ICALP 2021 (http://easyconferences.eu/icalp2021/) will take place on the 13th - 16th of July 2021 in Glasgow, United Kingdom. The conference will be preceded by one day of workshops, held on July 12th. We invite proposals for workshops affiliated with ICALP 2021 on all topics covered by ICALP, as well as other areas of theoretical computer science.

Proposals should be submitted no later than

*** November 30th, 2020 ***

by sending an email to the workshop selection committee (details at the end of the call). You should expect notification on the acceptance of your proposal by mid December 2020.

A workshop proposal submission should consist of:

- workshop's name and URL (if already available)

- workshop's organisers together with their email addresses and web pages;

- short description of the area covered by the workshop and the motivation behind it;

- expected number of participants (if available, please include the data of previous years);

- planned format of the event;

- date preference (July 10th or 11th).

As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organisers or selected among submissions. Deviations from this standard are also warmly welcome, including a shorter or a longer time span than a full day, or other elements of the schedule like open problem sessions, discussion panels, or working sessions.

If you plan to have invited speakers, please specify their expected number and, if possible, tentative names. If you plan a call for papers or for contributed talks followed by a selection procedure, the submission date should be scheduled after ICALP 2021 notification (April 28, 2021), while the notification should take place before the early registration deadline. In your submission please include details on the schedule, planned procedure of selecting papers and/or contributed talks. If you plan to have published proceedings of your workshop, please provide the name of the publisher. Please be advised that ICALP 2021 is not able to provide any financial support for publishing workshop proceedings.

Important dates:
Workshop Proposals Deadline: Monday November 30, 2020
Workshop Notification: Monday December 14, 2020
Workshops: Monday July 12, 2021
Conference: Tuesday July 13 - Friday July 16, 2021

Workshop selection committee:
Ornela Dardha ornela.dardha@glasgow.ac.uk
Gethin Norman gethin.norman@glasgow.ac.uk

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

Wednesday, October 28, 2020

[DMANET] CMM/Simons Berkeley joint fellowships

Postdoctoral positions are available at the Center for Mathematical Modeling (CMM) of Universidad de Chile starting between May and December 2021.

The selected candidates, who should simultaneously apply to a research fellowship at the Simons Institute for the Theory of Computing at UC Berkeley, will devote fully to research and will participate in one of the Simons Institute programs in Fall 2021 or Spring 2022. Candidates are expected to spend, before or after their participation at a Simons program, at least six months at CMM, although longer periods are encouraged.

Applications must be submitted not later than December 15, 2020.

More details about the process are available at
http://www.cmm.uchile.cl/?p=38879
**********************************************************
*
* 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] IPCO 2021: 2nd Call for Papers

Call for Papers

Conference on Integer Programming and Combinatorial Optimization
IPCO XXII, May 19-21, 2021
Georgia Institute of Technology, Atlanta, Georgia, USA
https://sites.gatech.edu/ipco-2021/

Program Committee

José Correa (U Chile)
Sanjeeb Dash (IBM Research)
Jesús A. De Loera (UC Davis)
Friedrich Eisenbrand (EPFL)
Oktay Günlük (Cornell)
Satoru Iwata (Tokyo)
Volker Kaibel (Magdeburg)
Andrea Lodi (Polytechnique Montreal)
Jim Luedtke (Wisconsin)
Viswanath Nagarajan (Michigan)
Alantha Newman (Grenoble)
Britta Peis (RWTH Aachen)
Mohit Singh (Georgia Tech)
László Végh (LSE)
Juan Pablo Vielma (Google)
David P. Williamson (Cornell, Chair)
Rico Zenklusen (ETH Zürich)


Submission deadline: November 11, 2020 (23:59 Hawaii Standard Time)

The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Authors are invited to submit extended abstracts of their recent work by November 11, 2020 (23:59 Hawaii Standard Time); see the submission guidelines below for more information. The Program Committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not under review by journals or conferences with proceedings before the notification date (January 31, 2021). Papers violating these requirements will not be considered by the Program Committee.

During the conference, approximately 33 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as a volume of Springer Lecture Notes in Computer Science. They will contain extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals.

Best Paper Award

For the second time, IPCO will present a Best Paper Award, to be chosen by the program committee.

Submission Guidelines

The extended abstract - in Springer LNCS format - should not exceed 12 pages plus references. Appendices are allowed only if they fit within the 12 page limit. Submissions not following these guidelines will not be considered. Full versions of the submitted papers freely accessible in on-line repositories are welcome.

The first page should contain the title, the authors with their affiliations, and a short abstract. The introduction should be a broadly accessible exposition of the main ideas and techniques used to achieve the results, including motivation and a clear comparison with related work. In particular, the introduction should convey to the non-expert why the paper should be accepted to IPCO. Submitted extended abstracts will be refereed according to the standards of top tier refereed conferences. The main acceptance criteria used by the Program Committee are the quality and originality of the research, plus its interest to people working in the field. It is crucial that the importance of the work is understood by the committee. The claimed results must be correct and new.

A paper will not be considered in any of the following cases:

It has been already published;
It has under review by, or accepted to, a journal or another conference with proceedings before the notification date;
It has a member of the Program Committee among its authors;
It is submitted after the submission deadline.

Abstracts should be submitted through the submission website at https://easychair.org/conferences/?conf=ipco2021.

Authors must use LaTeX2e together with the LNCS class file from Springer. Please check the Springer Information for LNCS Authors for additional information; the website is here: https://www.springer.com/us/computer-science/lncs/conference-proceedings-guidelines.


**********************************************************
*
* 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 PhD/Postdoc positions in Theory of Nature-Inspired Algorithms at the University of Passau

Two fully funded PhD/Postdoc positions are available at the Chair of
Algorithms for Intelligent Systems (Prof. Dr. Dirk Sudholt) at the
University of Passau, Germany, starting at the earliest possible date.
The term is 3 years, with the possibility of an extension. The salary is
based on Entgeltgruppe TV-L 13. In case a PhD degree has already been
awarded and you meet fundamental civil service requirements, the
position can be set up as an Akademischer Rat position (Besoldungsstufe
A13).

The research group focuses on the theoretical, algorithmic analysis of
randomised or nature-inspired algorithms such as evolutionary
algorithms, swarm intelligence and estimation of distribution algorithms.

What we expect:

* An excellent degree in Computer Science, Mathematics or a related
discipline
* Very good knowledge in the analysis of algorithms, randomised
algorithms and/or stochastic processes
* Enthusiasm for mathematical problems and scientific work
* Excellent oral and written English communication skills
* The ability to teach in German (or the ability to learn German
within a reasonable time frame) is a plus.

What we offer:

* Cutting-edge research in a modern research field at the interface of
theory of algorithms and artificial intelligence
* Joining a friendly and expanding research team
* A modern university in a city with a rich Lower Bavarian culture and
a high quality of life

Informal inquiries about the positions should be directed to
dirk.sudholt@uni-passau.de.

The University of Passau promotes gender equality at work. Women are
expressly asked to apply. Part-time employment is possible. Disabled
candidates with otherwise equal suitability, ability and
subject-specific performance will be preferred.

Your application (cover letter, CV, transcripts, certificates) should be
compiled as a single .pdf file and emailed to dirk.sudholt@uni-passau.de.

The deadline for applications is *20 November 2020*.

--

Prof. Dr. Dirk Sudholt
Chair of Algorithms for Intelligent Systems
Faculty of Computer Science and Mathematics
University of Passau


**********************************************************
*
* 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. 2: postdoctoral positions at IRIF, Paris, France

Please be reminded that the deadline for applications for the postdoctoral positions described below is this coming Monday, Nov. 2.


>
> 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 2nd, 2020. 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/
*
**********************************************************

Tuesday, October 27, 2020

[DMANET] 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] CPAIOR 2021: Call for Papers

The 18th International Conference on the Integration of Constraint
Programming, Artificial Intelligence, and Operations Research will be
held in Vienna, Austria, some time in the period June 21st-July 9th, 2021.

Website of the conference: https://cpaior2021.dbai.tuwien.ac.at/

The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or applications and
to provide an opportunity for researchers in one area to learn about
techniques in the others. A main objective of this conference series is
also to give these researchers the opportunity to show how the
integration of techniques from different fields can lead to interesting
results on large and complex problems. Therefore, papers that actively
combine, integrate, or contrast approaches from more than one of the
areas are especially solicited. High quality papers from a single area
are also welcome, if they are of interest to other communities involved.
Application papers showcasing CP/AI/OR techniques on novel and
challenging applications or experience reports on such applications are
strongly encouraged.

The program committee invites submissions that include but are not
limited to the following topics:

Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangian and convex relaxations, heuristic functions based on
constraint relaxation.Search methods: branch and bound, intelligent
backtracking, incomplete search, randomized search, portfolios, column
generation, Benders decompositions or any other decomposition methods,
local search, meta-heuristics.AI and Machine Learning techniques applied
to solve optimization and Operations Research problems.Integration
methods: solver communication, model transformations and solver
selection, parallel and distributed solving, combining machine learning
with combinatorial optimization.Modeling methods: comparison of models,
symmetry breaking, uncertainty, dominance relationships.Innovative
applications of CP/AI/OR techniques.Implementation of CP/AI/OR
techniques and optimization systems.

Submissions are of two types: regular papers (submitted for publication
and presentation) and extended abstracts (submitted for presentation only).

This year's conference will, as last year, give a distinguished paper
award and a student paper award.

INSTRUCTIONS FOR REGULAR PAPERS

Regular papers should present original unpublished work and can be of
two types:

* long papers (at most 15 pages plus references)
* short papers (at most 8 pages plus references)

Both long and short papers will undergo rigorous review and are subject
to the same criteria of quality. Both types are also eligible for
distinguished paper or student paper award. Short papers are
particularly encouraged for interesting and novel work in progress, for
which the practical or theoretical relevance is not yet fully identified.

The conference proceedings will be published in the Springer Lecture
Notes in Computer Science series. Authors should consult Springer's
authors' guidelines and use their proceedings templates, either for
LaTeX or for Word, for the preparation of their papers. Springer
encourages authors to include their ORCIDs in their papers. In addition,
the corresponding author of each paper, acting on behalf of all of the
authors of that paper, must complete and sign a Consent-to-Publish form.
The corresponding author signing the copyright form should match the
corresponding author marked on the paper. Once the files have been sent
to Springer, changes relating to the authorship of the papers cannot be
made.

Submission schedule for regular papers (both long and short):

Abstracts: December 10th, 2020 (anywhere on Earth: AoE)

Full papers: December 17th, 2020 (AoE)

Rebuttal Phase: February 13-17, 2021

Notification: February 27th, 2021

Camera-ready version: March 27th, 2021 (AoE)

INSTRUCTIONS FOR EXTENDED ABSTRACTS

Extended abstracts should be 1 or 2 pages in length and may present
preliminary work or work already published in other outlets. The
extended abstracts are submitted for presentation only (if accepted),
and will not be formally published in the LNCS conference volume. A
collection of the accepted extended abstracts will be published on the
conference website. A submission representing work submitted or
published in another outlet should state that outlet. Extended abstracts
will be reviewed to ensure appropriateness for the conference.

Submission schedule for extended abstracts:

Abstract: March 3, 2021 (AoE)

Notification: April 4th, 2020

Submission Process

All papers are to be submitted electronically in PDF format by following
the instructions at the URL

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

QUESTIONS

For any queries on the submission process, please contact the Program
Chair Peter Stuckey: cpaior2021@dbai.tuwien.ac.at


**********************************************************
*
* 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 in Mathematics at LSE

The Department of Mathematics at LSE has openings for PhD students,
including in the areas of Discrete Mathematics and Algorithms,
Operations Research and Analytics, and Game Theory. We are seeking
exceptionally talented and motivated students with a strong mathematical
background and interest in combinatorics, discrete random structures,
mathematical foundations of operations research, discrete optimisation,
algorithms, mathematical and algorithmic game theory, and related areas.

For further information about the PhD programme, application procedures,
and faculty please see
http://www.lse.ac.uk/study-at-lse/Graduate/Degree-programmes-2020/MPhilPhD-Mathematics

Applicants will automatically be considered for LSE funding covering
full fees and an annual stipend of GBP 18,000/year (approximately EUR
20,000 or USD 23,000) for up to 4 years. The award of these
scholarships is competitive, based on academic performance (typically in
an MSc or equivalent) and suitability of the proposed research. The
first (of two) application deadline for funding is 17 December 2020; by
this time a complete application with references must have been
submitted. We strongly encourage interested applicants to meet this
deadline for funding considerations (since, typically, all funded places
get filled in before the second funding deadline).

Prospective applicants are encouraged to contact the following
department faculty members, well in advance of the deadline, to discuss
their qualifications and research interests before submitting a formal
application:

Discrete Mathematics and Algorithms: Dr Tugkan Batu <T.Batu@lse.ac.uk>
Operations Research: Dr Katerina Papadaki <K.P.Papadaki@lse.ac.uk>
Game Theory: Prof Olivier Gossner <O.Gossner@lse.ac.uk>

It is fine if you wish to write to several of us (and/or our other
departmental colleagues), but then please do so in a single email.

LSE values diversity and strives to promote equality at all levels. We
strongly encourage applications from women, ethnic minorities, and
members of other groups under-represented in higher education.
**********************************************************
*
* 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: CfP Special Issue DAM

*Call for Papers *
*Discrete Applied Mathematics *
Special Issue: 18th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization (CTW 2020)

Following the tradition of previous CTWs, a special issue of Discrete
Applied
Mathematics will be devoted to the 18th Cologne-Twente Workshop on Graphs
and Combinatorial Optimization (CTW 2020, https://ctw2020.iasi.cnr.it),
held online on September 14–16, 2020 and organized by CNR-IASI, University
of Rome "Tor Vergata," University "Roma Tre" and CNRS-LIX-Ecole
Polytechnique Palaiseau.
All interested researchers are invited to contribute to this special
volume. The topics should be related to the themes of the workshop

graph theory,
combinatorial optimization,
design and analysis of algorithms,
theory and applications of mathematical programming with discrete variables.

Contributions arising from papers given at the workshop should be
substantially extended and should cite the conference paper.
Submissions of contributions not presented at the workshop are also welcome.
All articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify that the paper is a contribution for the special issue of *CTW 2020*,
so that your paper is assigned to the guest editors. Please see the Author
Instructions on the site if you have not yet submitted a paper through this
web-based system. Be sure to note that your work is intended for the
Special Issue and to select the article type *CTW 2020.*

The deadline for submission is *January 31, 2021*.

Accepted papers will be published online individually, before print
publication.

We are looking forward to receiving your contribution.

The Guest Editors,
Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo
Ventura

--
*DAM Special Issue devoted to*
*http://ctw2020.iasi.cnr.it <http://ctw2020.iasi.cnr.it>*
*18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization*
*Moving ONLINE - September 14-16, 2020*
--
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] Fully Funded PhD position in Visual Computing - VCLab - CNR, ITALY

[apologies for cross-posting]

Dear Colleagues,

The Visual Computing Lab at CNR - ITALY ( http://vcg.isti.cnr.it ) is
hiring a Marie Curie Fellow, focusing on novel visual and geometric
computing methodologies in the widest variety of applications, including
3D digitization, industrial design and manufacturing, architecture,
cultural heritage study and valorisation.

The position is part of the EVOCATION ( https://evocation.eu/ ) project.
The position is available *immediately* and will remain open until filled.

Please feel free to forward this to anyone who may be interested.

Requirements:
Applicants should have completed a M.Sc. or equivalent degree in
computer science or a closely related discipline. We expect experience
and or interest in computer graphics, or visual computing as well as
programming skills and a high level of proficiency in both spoken and
written English.

Benefits:
We can offer you a 36-months PhD training program coordinated among
eight academic and industrial partners, a multidisciplinary research
network where you will work in different research centres and top
industrial partners across Europe; a fully-funded PhD scholarship for 3
years with tuition fees covered; a very competitive (gross) salary which
includes an annual Living Allowance of €36,049.22, an annual Mobility
Allowance of €6,483.57 (to facilitate travel to partner labs), and an
annual Family Allowance (depending on family status) of €5,402.9.

Please apply here for the ESR07 position https://evocation.eu/recruitment

For further information, candidates can contact me at
paolo.cignoni@isti.cnr.it

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

Thank you, and best regards,
Paolo Cignoni

--
Paolo Cignoni -- Research Director
Head of Visual Computing Laboratory
ISTI - CNR
http://vcg.isti.cnr.it/~cignoni

ISTI - CNR
Via Moruzzi, 1
56124 Pisa
ITALY

**********************************************************
*
* 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 26, 2020

[DMANET] Fwd: IFIP PERFORMANCE 2020: Call for participation (Tutorials are free for PhD students)

IFIP WG 7.3 PERFORMANCE 2020

38th International Symposium on

Computer Performance, Modeling, Measurement and Evaluation


November 2-6, 2020, Milan, Italy

https://www.performance2020.deib.polimi.it/

NEWS AND UPDATES


** Tutorials Participation is free for PhD Students **

Links to the Webex rooms are available here:

https://www.performance2020.deib.polimi.it/tutorials/

** Keynote Speakers **


Keynote 1 - November 3, 10.00 NYC, 16.00 Milan

Enterprise Data Trends for Hybrid Multi-clouds

Dr. Naresh M. Patel, Vice President and Chief Architect at NetApp Inc. in
Sunnyvale, CA, USA.


Keynote 2 - November 5, 10.00 NYC, 16.00 Milan

Scheduling Impatient Customers in a Multiclass Many Server Queue

Prof. Amy R. Ward

University of Chicago, Booth School of Business, IL, USA


** Meet the Star Event **

November 6, 11.00 NYC, 17.00 Milan


PhD students can discuss their work with the keynote speakers,

Prof. Mor Harchol-Balter and Prof. Don Towsley, reserve your slot.

CALL FOR PARTICIPATION


The 38th International Symposium on

Computer Performance, Modeling, Measurement and Evaluation 2020

will be held online from November 2nd to November 6th, 2020.


The conference aims to bring together researchers interested in

understanding and improving the performance of computing and

communication systems by means of state-of-the-art quantitative models

and solution techniques.


The program is available at:

https://www.performance2020.deib.polimi.it/accepted-papers/


Registration information is available at:

https://www.performance2020.deib.polimi.it/registration-information/


The registration provides access to all conference tracks, including

workshops and tutorials.

ORGANIZING COMMITTEE

General Chair: Danilo Ardagna (Politecnico di Milano, Italy)


Program Committee Co-Chairs:

Jim Dai (CUHK, Shenzhen, China and Cornell University, USA)

Peter Harrison (Imperial College London, UK)

Nidhi Hegde (University of Alberta, Canada)


Steering Committee:

Sem Borst, Vice-Chair, IFIP WG 7.3, TU Eindhoven and Bell Labs NOKIA

Mark S. Squillante, Chair, IFIP WG 7.3, IBM Research

Benny Van Houdt, Secretary, IFIP WG 7.3, University of Antwerp


Publication Chair

Zhenhua Liu, Stony Brook University, USA


Workshop Chair

Leana Golubchik, University of Southern California, USA

Marco Paolieri, University of Southern California, USA


Tutorial Chairs

Michela Meo, Politecnico Torino, Italy

Marco Mellia, Politecnico Torino, Italy


Travel Grant Chairs

Marco Gribaudo, Politecnico di Milano, Italy

Riccardo Lancellotti, Università di Modena e Reggio Emilia, Italy

Ana Paula Couto da Silva, Universidade Federal de Minas Gerais, Brazil


Publicity Chairs

Manjesh Kumar Hanawal, IIT Bombay, India

Cristina Rottondi, Politecnico Torino, Italy

Daniel Sadoc Menasche, Federal University of Rio de Janeiro, Brazil

Weina Wang, Carnegie Mellon University, USA

TECHNICAL PROGRAM COMMITTEE

TPC available on the Performance 2020 web site at

https://www.performance2020.deib.polimi.it/?page_id=89

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

Call for Papers - ICALP 2021 - the 48th International Colloquium on Automata, Languages, and Programming

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

http://easyconferences.eu/icalp2021/
@ICALPconf

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

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

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



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

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

Deadlines are firm; late submissions will not be considered.


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


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


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


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


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


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


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


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

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




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


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

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



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

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





===============================
ICALP 2021 Organizing Committee
===============================
[the FATA research section, School of Computing Science, University of Glasgow]

Simon Gay, Conference Chair

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



Dr Oana Andrei
Lecturer (Assistant Professor) | School of Computing Science 
University of Glasgow, UK
http://www.dcs.gla.ac.uk/~oandrei | @OanaMAndrei

Note: If I send email out of hours, I'm not expecting a reply out of hours.



[DMANET] Open Rank AI/ML Tenure Stream Faculty Position at York University, Toronto, Canada

York University has an open AI/ML faculty position at York. It is open to
all ranks Assistant/Associate/Full Professor.

See
http://webapps.yorku.ca/academichiringviewer/viewposition.jsp?positionnumber=2083
for more info.


Position Rank: Full Time Professorial Stream - Assistant/Associate/Full
Professor
Discipline/Field: Artificial Intelligence or Machine Learning
Home Faculty: Lassonde School of Engineering
Home Department/Area/Division: Department of Electrical Engineering and
Computer Science
Affiliation/Union: YUFA
Position Start Date: July 1, 2021

Artificial Intelligence/Machine Learning

Department of Electrical Engineering and Computer Science, Lassonde School
of Engineering, York University

The Department of Electrical Engineering and Computer Science, York
University invites highly qualified candidates to apply for a professorial
stream tenured or tenure-track appointment in Artificial Intelligence or
Machine Learning at an open rank ? Assistant, Associate or Full Professor
level, depending on experience ? to commence July 1, 2021. Salary will be
commensurate with qualifications and experience. All York University
positions are subject to budgetary approval.

A PhD in computer science or a closely related field is required, with a
demonstrated record of excellence, or promise of excellence (depending on
the rank of the appointment), in research and in teaching.

Applicants should have a clearly articulated program of research in
Artificial Intelligence or Machine Learning, interpreted broadly. Potential
areas include, but are not limited to, machine learning theory, computer
vision, and natural language processing.

The successful candidate will be expected to engage in outstanding,
innovative, and externally funded research at the highest level.

Candidates must provide evidence of research excellence or promise of
research excellence of a recognized international calibre, as demonstrated
by, for example: the research statement; a record of publications in
significant journals in the field; presentations at major conferences;
awards and accolades; and recommendations from referees of high standing.
The position will involve graduate teaching and supervision, as well as
undergraduate teaching, and the successful candidate must be suitable for
prompt appointment to the Faculty of Graduate Studies.

Evidence of excellence or promise of excellence in teaching will be
provided through means such as: the teaching statement; teaching
accomplishments and pedagogical innovations including in high priority
areas such as experiential education and technology enhanced learning;
teaching evaluations; and letters of reference.

The Department of Electrical Engineering and Computer Science at York
University is one of the foremost academic and research departments in
Canada with more than 60 faculty members, offering a range of undergraduate
programs and research-intensive graduate degrees. For further information
please visit http://eecs.lassonde.yorku.ca .

Established in 2012, the Lassonde School of Engineering, York University
offers a broad range of undergraduate and graduate programs to educate
multidisciplinary problem solvers, critical thinkers, and entrepreneurs who
understand creativity, communications, social responsibility, and cultural
diversity. Further information is available at http://lassonde.yorku.ca/ .

York University champions new ways of thinking that drive teaching and
research excellence. Through cross-disciplinary programming, innovative
course design, diverse experiential learning and a supportive community
environment, our students receive the education they need to create big
ideas that make an impact on the world. Located in Toronto, York is the
third largest university in Canada, with a strong community of 53,000
students, 7,000 faculty and administrative staff, and more than 300,000
alumni.

York University has a policy on Accommodation in Employment for Persons
with Disabilities and is committed to working towards a barrier-free
workplace and to expanding the accessibility of the workplace to persons
with disabilities. Candidates who require accommodation during the
selection process are invited to contact Professor Marcus Brubaker, Chair
of the Search Committee at mab@eecs.yorku.ca.

York University is an Affirmative Action (AA) employer and strongly values
diversity, including gender and sexual diversity, within its community. The
AA Program, which applies to women, members of visible minorities
(racialized groups), Aboriginal (Indigenous) people and persons with
disabilities, can be found at http://acadjobs.info.yorku.ca/ or by calling
the AA line at 416-736-5713. Applicants wishing to self-identify as part of
York University?s Affirmative Action program can do so by as part of the
online application process. All qualified candidates are encouraged to
apply; however, Canadian citizens, permanent residents and Indigenous
peoples in Canada will be given priority. No application will be considered
without a completed mandatory Work Status Declaration form which is
included as part of the online application process.

You should complete the online application process at
https://apply.lassonde.yorku.ca/ . Include a cover letter (indicating
position, and the rank you wish to be considered for), a detailed
curriculum vitae, statements of contribution to research, teaching, and
curriculum development, three sample research publications. We will start
reviewing complete applications on November 15, 2020. For full
consideration, we need to have received your complete application materials
by November 30, 2020.

Posting End Date: November 30, 2020

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

16th International Computer Science Symposium in Russia (CSR 2021): First Call for Papers

We apologize for multiple copies.

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

First Call for Papers

16th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2021)

June 28-July 2, 2021, Sochi, Russia

https://logic.pdmi.ras.ru/csr2021/

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

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.

IMPORTANT DATES

Deadline for submissions:       December 24, 2020
Notification of acceptance:     February 18, 2021
Conference dates:               June 28-July 2, 2021

TOPICS
include, but are not limited to:

(i) algorithms and data structures
(ii) computational complexity, including hardness of approximation and parameterized complexity
(iii) randomness in computing, approximation algorithms, fixed-parameter algorithms
(iv) combinatorial optimization, constraint satisfaction, operations research
(v) computational geometry
(vi) string algorithms
(vii) formal languages and automata, including applications to computational linguistics
(viii) codes and cryptography
(ix) combinatorics in computer science
(x) computational biology
(xi) applications of logic to computer science, proof complexity
(xii) database theory
(xiii) distributed computing
(xiv) fundamentals of machine learning, including learning theory,   grammatical inference and neural computing
(xv) computational social choice
(xvi) quantum computing and quantum cryptography
(xvii) theoretical aspects of big data


OPENING LECTURE

Tim Roughgarden (Columbia University, USA)

INVITED SPEAKERS

TBD

PROGRAM COMMITTEE

Rahul Santhanam (University of Oxford, UK; Chair)
Elena Arseneva (St. Petersburg State Univesity, Russia)
Alexander Belov (University of Latvia, Latvia)
Simina Branzei (Purdue University, USA)
Andrei Bulatov (Simon Fraser University, Canada)
Anupam Das (University of Birmingham, UK)
Laure Daviaud (City University of London, UK)
Laurent Doyen (LSV - ENS Paris-Saclay, France)
Piotr Faliszewski (AGH University of Science and Technology, Poland)
Pawel Gawrychowski (University of Wroclaw, Poland)
Heng Guo (University of Edinburgh, UK)
Siyao Guo (NYU Shanghai, China)
Shuichi Hirahara (NII, Japan)
Mikhail Kapralov (EPFL, Switzerland)
Jesper Nederlof (Utrecht University, Netherlands)
Alexander Okhotin (St. Petersburg State University, Russia)
Sofya Raskhodnikova (Boston University, USA)
Alexander Razborov (University of Chicago, USA)
Suzanna de Rezende (Czech Academy of Sciences, Czech Republic)
Laura Sanita (University of Waterloo, Canada)
Kavitha Telikepalli (TIFR, India)
Amir Yehudayoff (Technion, Israel)
Meirav Zehavi (Ben-Gurion Ubiversity, Israel)


SUBMISSIONS

Authors are invited to submit an extended abstract or a full paper of at most
12 pages in English, not including references, in the LNCS format (LaTeX, as pdf; final
version with source); instructions are here:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
       
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed.  The proceedings of the symposium will be published in Springer's
LNCS series.

Submission server: https://easychair.org/conferences/?conf=csr2021

We are carefully watching the situation with the Covid-19 pandemic. We hope to conduct
a physical event, but it will be possible to participate in the event online for those
who are unable to come due to travel restrictions or other circumstances. In case
the situation in Russia does not allow us to organize a meeting in place,
we are planning to move the event online but not to postpone it.

FURTHER INFORMATION AND CONTACTS

Web:    http://logic.pdmi.ras.ru/csr2021/
Email:  musatov.dv@phystech.edu