Friday, May 24, 2019

[DMANET] 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020): Second Call for Papers

*** Second Call for Papers ***

46th International Conference on Current Trends in Theory and
Practice of Computer Science (SOFSEM 2020)

Atlantica Miramare 4* Beach Hotel, Limassol, Cyprus

January 20-24, 2020

http://www.cs.ucy.ac.cy/~george/lm/lm.php?tk=ZG1hbmV0CQkJZG1hbmV0QHpwci51bmkta29lbG4uZGUJNDZ0aCBJbnRlcm5hdGlvbmFsIENvbmZlcmVuY2Ugb24gQ3VycmVudCBUcmVuZHMgaW4gVGhlb3J5IGFuZCBQcmFjdGljZSBvZiBDb21wdXRlciBTY2llbmNlIChTT0ZTRU0gMjAyMCk6IFNlY29uZCBDYWxsIGZvciBQYXBlcnMJMzg1CUxpc3RzCTE1MAljbGljawl5ZXMJbm8=&url=http%3A%2F%2Fcyprusconferences.org%2Fsofsem2020%2F

*** Submission Deadline: July 29, 2019 ***

(Proceedings to be published by Springer)


INVITED SPEAKERS (list incomplete)

· Mikolaj Bojanczyk, Poland
· Erol Gelenbe, UK
· Gunnar Klau, Germany
· Elias Koutsoupias, UK

SOFSEM (SOFtware SEMinar) is an annual international winter conference
devoted to the theory and practice of computer science. The first SOFSEM was
organized in 1974. SOFSEM consists of invited talks by prominent
researchers, of contributed talks selected from the submitted papers, and of
the Student Research Forum. The program is organized in plenary talks and
parallel tracks devoted to original research in the selected research areas.

SOFSEM has a long-standing tradition of facilitating discussions and collegial
interactions. It is well-known for its familiar and inspiring atmosphere and as
a meeting place for active and leading computer scientists. SOFSEM is a
track-based conference. It features the traditional track on foundations of
computer science and a number of other tracks that cover contemporary
important areas, such as artificial intelligence, cryptography, security,
verification, data science, knowledge engineering, social computing and
human factors, software and web engineering, etc.

The Track Chairs are soliciting technical papers for presentation at the
conference and inclusion in the proceedings published by Springer in the
ARCoSS/LNCS series. The topics of the conference are organised in four
tracks and the (non exhaustive) list of topics for each track is as follows:

Foundations of Computer Science
· Algorithms and data structures
· Automata and formal languages
· Complexity theory
· Computability theory
· Cryptography and security
· Graphs and networks
· Machine learning
· Non-classical models of computing
· Theory of databases, semi-structured data, and finite model theory
· Theory of programming languages

Foundations of Software Engineering
· Methods and tools for improved software processes
· Software architecture of complex software-intensive systems
· Requirements Engineering
· Model-based software engineering methods and tools
· Data-driven improvement of methods, models, and tools
· Methods and tools for software engineering applications
· Empirical Software Engineering

Foundations of Data Science
· Data Models and Query Languages
· Data Integration and Interoperability
· Query Processing and Optimization
· Distributed, Parallel, and P2P Data Processing and Management
· Data Semantics and Linked Data
· Spatial, Temporal, Multimedia Data
· Web- and Graph-based Data
· Probabilistic and Uncertain Data
· Information Extraction and Retrieval
· Data Privacy, Security, and Trust

Foundations of Algorithmic Computational Biology
· Alignment and assembly of sequences
· Biological networks
· Cancer genomics
· Comparative genomics
· Gene expression
· Phylogenetics
· Sequence analysis
· System biology


PAPER SUBMISSION

Detailed guidelines for submission will appear shortly on the conference
web site (https://cyprusconferences.org/sofsem2020/). Papers must be
submitted electronically via Easychair in standard Springer format (max 12
pages). Submitted papers will undergo a peer review process.


PROCEEDINGS

The proceedings will be published by Springer in the ARCoSS/LNCS series.


IMPORTANT DATES

· July 29th, 2019: Submission of abstracts
· August 5th, 2019: Submission of full papers
· September 30th, 2019: Notification of Acceptance/Rejection
· November 25th, 2019: Camera Ready Papers, registration deadline
· January 20-24, 2020: Conference Dates


ORGANISATION

General Chairs
· Yannis Manolopoulos, Open University of Cyprus, Cyprus
· George A. Papadopoulos, University of Cyprus, Cyprus

Steering Committee
· Barbara Catania, University of Genova, Italy
· Miroslaw Kutylowski, Wroclaw Uni. of Technology, Poland
· Jan van Leeuwen, Utrecht University, Utrecht, Netherlands
· Tiziana Margaria-Steffen, University of Limerick, Ireland
· Branislav Rovan, Comenius University, Bratislava, Slovakia
· Petr Saloun, Technical University of Ostrava, Czech Republic
· Julius Stuller, Academy of Sciences, Prague, Czech Republic, chair

Tracks and Track Chairs
· Foundations of Computer Science: Christos Kapoutsis, Qatar
· Foundations of Data Science: Herodotos Herodotou, Cyprus
· Foundations of Software Engineering, Alexander Chatzigeorgiou, Greece
· Foundations of Algorithmic Computational Biology, Riccardo Dondi, Italy
and Florian Sikora, France

Student Research Forum Chair
· Theodoros Tzouramanis, Greece

Webadmin
· Kyriakos Georgiades, Cyprus

**********************************************************
*
* 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 Scholarship at the Astrophysics and High Performance Computing Group of European University Cyprus

The Department of Computer Science and Engineering jointly with the Astrophysics and High Performance Computing Group<http://ahpc.euc.ac.cy/> (http://ahpc.euc.ac.cy/) of European University Cyprus announce one (1) scholarship for 100% of the tuition fees for the Ph.D. Program of Computing/Computer Science. The topics for which the interested applicants are expected to submit a research proposal with their application are:

* Parallel Algorithms and High Performance Computing

* Graph Theory and Applications

* Big Data Applications on Astrophysics
For more information, please contact AHPC through email at ahpc@euc.ac.cy<mailto:ahpc@euc.ac.cy> or call at 22-713188.

Application, supporting material and admission procedure:
1. Application is submitted using the special form available from this link<http://www.euc.ac.cy/en/online-application-form/phd-application-form>
2. The necessary supporting material accompanying the application are described in the application form.
3. Last day for submitting applications: 31 May 2019.
4. The final selection is based on assessment of the applicant's qualifications and personal interview(s).

.....................................................................................................................
The scholarships above are not transferred to other persons and cannot be exchanged in cash or in any other way.
For further information, please contact the Office of Admissions, at info@euc.ac.cy<mailto:info@euc.ac.cy> and 22-713000.


**********************************************************
*
* 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] "Data Science Meets Optimisation" Workshop at IJCAI-19 (deadline May 27, post-proceedings on AMAI)

Call for Papers
Data Science Meets Optimisation (DSO) Workshop at IJCAI-19 (the 28th International Joint Conference on Artificial Intelligence)
August 10-16, 2019, Macao, China
https://sites.google.com/view/ijcai2019dso/
Extended submission deadline: May 27, 2019
(New!!!!) Special issue in the Annals of Mathematics and Artificial Intelligence
Keynote speaker: Prof. dr. Holger Hoos (Leiden University, NL)

*Important dates*
Submission deadline (extended): May 27, 2019
Notification of acceptance: June 15, 2019

*Scope*
Data science and optimisation are closely related. On the one hand, many problems in data science can be solved using optimisers, on the other hand optimisation problems stated through classical models such as those from mathematical programming cannot be considered independent of historical data. Examples are ample. Machine learning often relies on optimisation techniques such as linear or integer programming. Algorithms may be complete, approximative or heuristic and may be applied in on-line or off line settings. Reasoning systems have been applied to constrained pattern and sequence mining tasks. A parallel development of metaheuristic approaches has taken place in the domains of data mining and machine learning. In the last decades, methods aimed at high level combinatorial optimisation have been shown to strongly profit from configuration and tuning tools building on historical data. Algorithm selection has since the seventies of the previous century been considered as a tool to select the most appropriate algorithm for a given instance. Empirical model learning uses machine learning models to approximate the behaviour of a system, and such empirical models can be embedded into an optimisation model for efficiently finding an optimal system configuration.

The aim of the workshop is to organize an open discussion and exchange of ideas by researchers from Data Science and Operations Research domains in order to identify how techniques from these two fields can benefit each other. The program committee invites submissions that include but are not limited to the following topics:
- Applying data science and machine learning methods to solve combinatorial optimisation problems, such as algorithm selection based on historical data, speeding up (or driving) the search process using machine learning, and handling uncertainties of prediction models for decision-making.
- Using optimisation algorithms in developing machine learning models: formulating the problem of learning predictive models as MIP, constraint programming (CP), or satisfiability (SAT). Tuning machine learning models using search algorithms and meta-heuristics. Learning in the presence of constraints.
- Embedding methods: combining machine learning with combinatorial optimization, model transformations and solver selection, reasoning over Machine Learning models.
- Formal analysis of Machine Learning models via optimization or constraint satisfaction techniques: safety checking and verification via SMT or MIP, generation of adversarial examples via similar combinatorial techniques.
- Computing explanations for ML model via techniques developed for optimization or constraint reasoning systems
- Applications of integration of techniques of data science and optimization.


*Submission*
We invite the following submissions (all in the IJCAI proceedings format, see: https://www.ijcai.org/authors_kit ):
- Submission of original work up to 8 pages in length.
- Submission of work in progress (with preliminary results) and position papers, up to 6 pages in length.
- Published journal/conference papers in the form of a 2-pages abstract.
The program committee will select the papers to be presented at the workshop according to their suitability to the aims.
Contributors of the workshop will be invited to submit full versions of their papers for inclusion in a special volume of the Annals of Mathematics and Artificial Intelligence, published by Springer.
Those invited submissions will be subject to refereeing at the usual standards of the journal, and authors will receive more details with the acceptance notice.

Submissions through: https://easychair.org/conferences/?conf=ijcai2019dso


*Workshop organizers*
Patrick De Causmaecker (KU Leuven, BE), patrick.decausmaecker@kuleuven.be<mailto:patrick.decausmaecker@kuleuven.be>
Michele Lombardi (University of Bologna, IT), michele.lombardi2@unibo.it<mailto:michele.lombardi2@unibo.it>
Yingqian Zhang (TU Eindhoven, NL), yqzhang@tue.nl<mailto:yqzhang@tue.nl>

**********************************************************
*
* 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] CTW 2019: Call for Participation - Early Registration Deadline June 1 - University of Twente, Enschede

---------------------------------
CTW 2019 - CALL FOR PARTICIPATION
---------------------------------

17th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
University of Twente, Enschede, The Netherlands
July 1-3, 2019.

https://wwwhome.ewi.utwente.nl/~ctw/

------------------------------------------------------------------
* Early Registration: June 1, 2019
* Conference dates: July 1-3, 2019
------------------------------------------------------------------

We invite you to participate in the 17th CTW at the University of
Twente, Enschede, NL, from Monday, July 1, Wednesday, July 3, 2019.

For the preliminary program and further information, in particular about
registration and accommodation, see the webpage of CTW 2019 at

https://wwwhome.ewi.utwente.nl/~ctw/

Kind regards,
Johann Hurink and Bodo Manthey

--
Bodo Manthey
https://wwwhome.ewi.utwente.nl/~mantheyb/
**********************************************************
*
* 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, May 23, 2019

[DMANET] Post-doc position in combinatorial optimization in Wroclaw

A post-doc positions in Combinatorial Optimization Group, Institute of
Computer Science, University of Wroclaw.

The position is within the project "Algorithmic fundamentals of supply
chain networks" led by Jarek Byrka.
It aims at developing algorithmic tools for typically NP-hard
optimization problems in network design such as routing or clustering.

The position is intended for 18 months starting in Autumn 2019.

Our group offers a stimulating working environment, see:
http://ii.uni.wroc.pl/badania/zaklad/ZOK
Wroclaw is a vibrant city, pleasant to live in, with over 100 000 students.

Applications should be submitted by June 03, 2019.

More details about the offer can be found at:
http://ii.uni.wroc.pl/media/uploads/ogloszenie_postdoc_2019.pdf

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

[DMANET] postdoctoral fellowship

POSTDOCTORAL FELLOWSHIP

UNIVERSITE DU QUEBEC EN OUTAOUAIS, CANADA


A postdoctoral position in computer science is available at the
Research Chair in Distributed Computing of the
Universite du Quebec en Outaouais, Canada,
under the supervision of Prof. Andrzej Pelc.

Requirements: * Ph.D. in Computer Science or Mathematics obtained between
October 1, 2016 and September 30, 2019
* Strong academic background in algorithms and graph theory.
* Strong research record and potential in one or more of the
following domains:
- design and analysis of combinatorial algorithms
- algorithmic aspects of distributed and parallel computing
- algorithms for interconnection networks
- algorithmic aspects of fault tolerance

Further information about the
Research Chair in Distributed Computing, and
about topics related to prospective postdoctoral research
of the successful candidate can be obtained at:
http://w3.uqo.ca/pelc/main.html
and
http://w3.uqo.ca/pelc/caldi/index.htm

Duties: Research in the above areas. NO teaching duties.
Knowledge of French is NOT necessary.
Duration: 12 months
Beginning: January 2020 (flexible)
Stipend: $40 000 per year (Canadian dollars).
Location: The Universite du Quebec en Outaouais is situated in Gatineau,
across the river from Ottawa. The National
Capital region of Ottawa offers a variety of possibilities
for cultural and sports activities (swimming, sailing, hiking,
skating, cross-country and downhill skiing). The campus of the
University of Quebec is a 10 min. drive from downtown Ottawa.

Applications including a detailed CV (with e-mail address),
a statement of research interests, a complete list of publications,
an abstract of Ph.D. Thesis and reprints (preprints) of 2 best papers
should be sent in a zipped file by e-mail to pelc@uqo.ca

Please arrange to have three letters of reference sent directly to the same
e-mail address. Deadline for applications and reference letters is July 31, 2019.

Informal enquiries at
e-mail: pelc@uqo.ca


**********************************************************
*
* 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, May 22, 2019

[DMANET] Call for book Chapters AHMIP2019 Springer

Dear Researchers,

I would like to share with you the following call for chapters.
All your contributions are welcome.

Call for Book Chapters
Applications of Hybrid Metaheuristic Algorithms for Image Processing
To be published by Studies in Computational Intelligence by Springer
http://www.springer.com/series/7092

Introduction

The segmentation of images is a critical task for computer vision
applications. The objective is to generate segmented images as fast and
accurate as possible. However, due to the complex nature of digital images,
the segmentation is not a trivial task. Metaheuristic Algorithms (MA) have
been used to perform image segmentation over the last decade with
interesting results. Usually, MAs can behave in two forms; exploration, and
exploitation. The exploration phase is used to diversify the solutions
along the search space to avoid local stagnation, while the exploitation
phase intensifies the search in a region to ensure convergence. The
performance of many MAs is limited by its operators. In some cases, the
operators that control the algorithm have proved to be very efficient, but
its interaction with different approaches can further enhance its
performance. The hybridization of MAs is a new tendency where two or more
algorithms are merged to generate better results. Usually, the
hybridization can take two forms; sequential use of algorithms, and the
replacement of operators. In the first case, two MA are run in sequence to
firstly explore with an algorithm and then perform exploitation on the
later; however, this approach can significantly increase the number of
iterations required to converge. In the second case, the operators of two
or more algorithms are mixed together provide a better balance between the
intensification and diversification of the solutions without increasing the
number of iterations.

This Book aims to provide a collection of high-quality research works that
address broad challenges in both theoretical and application aspects of
hybrid metaheuristic algorithms in image processing and computer vision. We
invite colleagues to contribute original book chapters that will stimulate
the continuing effort on the application of hybrid MAs approaches to solve
image-processing problems and computer vision problems.

We invite all researchers and practitioners who are developing algorithms,
systems, and applications, to share their results, ideas, and experiences.

Topics of interest include, but are not limited to, the following:

Hybrid Metaheuristics
Theoretical aspects of hybridization
Automated parameter tuning
Parallelization
Evolutionary Computation Algorithms
Swarm Optimization
Multi-objective optimization
Multilevel segmentation
Object recognition
Computer vision
Image processing
Filtering and enhancement
Morphology
Edge detection and segmentation
Feature extraction
Quantum Image Processing
Image thresholding
Applications
Chapter Submission

Submitted manuscripts should conform to the standard guidelines of the
Springer's book chapter format. Manuscripts must be prepared using Latex or
Word according to the Springer's template that can be downloaded from the
(link). Manuscripts that do not follow the formatting rules will be
ignored. Prospective authors should send their manuscripts electronically
to the following email address: salvahin@ucm.es and/or doliva@ucm.es ,
with the subject title as: "Applications of Hybrid Metaheuristic Algorithms
for Image Processing – Book Chapter" in PDF. Submitted manuscripts will be
refereed by at least two independent and expert reviewers for quality,
correctness, originality, and relevance. The accepted contributions will be
published in Intelligent Systems Reference Library by Springer. More
information about Intelligent Systems Reference Library can be found (here).

Publication Schedule

The tentative schedule of the book publication is as follows:

Deadline for paper submission: June 30, 2019 (it could be extended)
First round notification: August 2019
Camera-ready submission: September 2019
Publication date: 1st quarter of 2020


Volume Editors

Diego Oliva
Departamento de Ciencias Computacionales, Universidad de Guadalajara,
CUCEI, México diego.oliva@cucei.udg.mx, doliva@ucm.es

Salvador Hinojosa
Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain
salvahin@ucm.es

More information:
http://diegoliva.com/cfp/cbc_ahmip/


--
Dr. Diego Oliva
diegoliva.com <http://www,diegoliva.com>

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

[DMANET] PostDoc Position in Discrete Optimization at EPFL

The "Discrete Optimization Group" at EPFL, Switzerland

http://disopt.epfl.ch

invites applications for a PostDoc position.

The research interests of the group are in integer programming,
combinatorial optimization, computational and discrete geometry,
geometry of numbers, and approximation algorithms.

The appointment is for 12 months. The earliest possible start date is
October 1, 2019.
The salary will be 7,000 Swiss Francs (currently $6,950 and €6,200) per
month.
The position can be renewed for one year.

The PostDoc position comes with teaching obligations. This either
means that the prospective holder of the position serves as a teaching
assistant or teaches one 2h-course per semester at the doctoral level.

Applications (including curriculum vitae, list of publications,
research plan, names of three references with their e-mail addresses,
and intended period of stay) should be sent as a single PDF-file to

Matthias Schymura (matthias.schymura@epfl.ch).

We will start evaluating applications July 1, 2019, and we will
continue accepting applications until the position is filled.

**********************************************************
*
* 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] IPEC 2019: Final call for papers

==== IPEC 2019 Final Call For Papers ====
The 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) covers research in all aspects of parameterized and exact algorithms and complexity.

--- Topics ---

Papers presenting original research in the area are sought, including but not limited to:
- new techniques for the design and analysis of parameterized and exact algorithms;
- fixed-parameter tractability and kernelization results;
- parameterized complexity theory;
- parameterized (in)approximability results;
- relationships between parameterized complexity and traditional complexity classifications;
- applications of parameterized and exact computation; and
- implementation issues of exact, parameterized, and kernelization algorithms.
Theoretically grounded studies on parameterized and exact computations and kernelization for real-world applications and algorithmic engineering are especially encouraged.

--- Conference ---

IPEC 2019 will be part of ALGO 2019, which also hosts ESA 2019 and a number of more specialized conferences and workshops. IPEC 2019 will take place September 11-13, 2019, in Munich, Germany.

Accepted papers will be published in the symposium proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee. A special issue of Algorithmica is planned for selected papers presented at IPEC 2019.

--- Important dates ---

Title and short abstract registration deadline: May 29, 2019, 23:59 AoE
Full paper submission deadline: June 1, 2019, 23:59 AoE
Notification: July 15, 2019
Conference: September 11-13, 2019

--- Awards ---

The program committee may award a Best Paper Award and a Best Student Paper Award, both of which may be exceptionally split between two or more papers. A student is someone who has not received a PhD degree before the full paper submission deadline. A paper accepted to the conference is eligible for the Best Student Paper Award if either all its authors are students, or besides student co-author(s) there is one non-student co-author that confirms, at the moment of submission, that a clear majority of conceptual work on the paper was done by the student co-author(s). In the latter case, it is moreover expected that a student gives a presentation at the conference. Papers co-authored by members of the program committee are not eligible for the Best Paper Award or the Best Student Paper Award.

--- Special Events ---

There will be an invited tutorial on parameterized inapproximability by Pasin Manurangsi. An invited talk is planned by one of the authors of the paper that was awarded the 2019 EATCS-IPEC Nerode Prize: 'Color-Coding', by Noga Alon, Raphael Yuster, and Uri Zwick. In addition, there will be a session presenting the results of the 4th Parameterized Algorithms and Computational Experiments Challenge (PACE 2019).

--- Submission guidelines ---

Authors are invited to submit an extended abstract of up to 12 pages (excluding the title page and references section) in LIPIcs style, in English, describing original unpublished research. The title page consists exclusively of the title of the paper, author information, and abstract. Results previously published in another conference proceedings or journal (or scheduled for publication prior to IPEC) will not be considered. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. However, the authors are encouraged to make full versions of their submissions freely accessible in an on-line repository such as ArXiv or ECCC.

The extended abstract should contain a summary of the main results, their motivation and importance, and evidence of their correctness. All claims made in the extended abstract must be fully justified in a clearly marked appendix that will be read at the discretion of the program committee. The authors may choose to either present in the appendix only the material excluded from the extended abstract or to attach a full version of the paper as the appendix. In either case, the authors should take a particular notice that the extended abstract should present their work in a comprehensible and self-contained way and the quality of the presentation in the extended abstract will be taken into account by the program committee.

We encourage authors of papers describing implementations, for example following the PACE competition, to read and follow the advice in David Johnson's article 'A Theoretician's Guide to the Experimental Analysis of Algorithms'.

Authors must submit their papers electronically via EasyChair: https://easychair.org/conferences/?conf=ipec2019 . The use of the LIPIcs style file (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors) is mandatory; no changes to font size, page margins, etc., are permitted. Program committee members (except the co-chairs) are allowed to submit papers.

--- Program Committee ---

Amir Abboud (IBM Almaden Research Center)
Édouard Bonnet (ENS Lyon)
Jianer Chen (Texas A&M University)
Petr Golovach (University of Bergen)
Bart M. P. Jansen (Eindhoven University of Technology, co-chair)
Sudeshna Kolay (Ben-Gurion University)
Lukasz Kowalik (University of Warsaw)
O-joung Kwon (Incheon National University)
Daniel Marx (MTA SZTAKI)
Kitty Meeks (University of Glasgow)
Yota Otachi (Kumamoto University)
Felix Reidl (Birkbeck University of London)
Christian Schulz (University of Vienna)
Manuel Sorge (University of Warsaw)
Jan Arne Telle (University of Bergen, 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/
*
**********************************************************

[DMANET] BCC 2019 - Final Reminder: early bird registration and abstract submission

[Apologies for cross-posting.]

Dear colleagues,

We would like to remind you that the early bird registration for the 27th British Combinatorial Conference is available until 31st May 2019. All participants are encouraged to submit an abstract on a topic related to the conference and give a 20-minute presentation; the deadline for abstract submission is also May 31st.

https://www.birmingham.ac.uk/bcc2019

Looking forward to seeing you in Birmingham!

Allan, Andrew, Guillem and Richard

**********************************************************
*
* 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: GCAI 2019 (5th Global Conference on Artificial Intelligence)

Apologies for cross-posting.
Please forward to interested parties.
***************************************************************


-----------------------------------------------------------------
CfP: GCAI 2019 (5th Global Conference on Artificial Intelligence)
-----------------------------------------------------------------


The 5th Global Conference on Artificial Intelligence (GCAI 2019) will
be held in Bolzano, 17-19 September 2019. The core objective of GCAI
2019 is to bring together the two main souls of AI, namely symbolic
reasoning and machine/deep learning, applied to both software and
robotic systems.
See https://gcai2019.inf.unibz.it/

GCAI 2019 will be held as part of the Bolzano Rules and Artificial
INtelligence Summit (BRAIN 2019). With a special focus theme on
"beneficial AI", BRAIN 2019 aims at presenting the latest advancements
in AI and rules and their adoption in IT systems towards improving key
fields such as environment, health and societies. Submissions that
address this theme within the general topics of GCAI are especially
welcome.
See https://brain2019.inf.unibz.it/


SUBMISSION GUIDELINES

GCAI 2019 accepts submissions of two types:
- Full paper submissions, which must be original and cannot be
submitted simultaneously elsewhere. Full paper submissions must be at
most 12 pages long, excluding references. Additional support material
may be included in an appendix, which may be considered or ignored by
the program committee.
- Extended abstract submissions, which report on ongoing or
preliminary work, or on work that is central to symbolic reasoning
and/or machine/deep learning applied to both software and robotic
systems, but that has already been submitted or recently published
elsewhere as a full paper (in the case of an already published paper,
the full version has to be referenced explicitly). Extended abstract
submissions must be at most 4 pages long, excluding references.

Both types of submissions must be prepared in LaTeX or Microsoft Word
using the EasyChair templates, and uploaded in PDF format. Submissions
not complying with these guidelines will be rejected at the discretion
of the program committee.

Each submission will be reviewed by at least two reviewers.
Abstracts are due on 14 June 2019, full papers and extended abstracts
are due on 21 June 2019, and decisions will be made by 26 July 2019.

Submissions: via EasyChairhttps://easychair.org/conferences/?conf=gcai2019

Instructions for authors and EasyChair paper templates can be found
athttps://easychair.org/publications/for_authors.


LIST OF TOPICS

Submissions in all areas of artificial intelligence are welcome.
Suggested topics include, but are not limited to:

Foundations
+ Knowledge representation
+ Cognitive modeling
+ Perception
+ Search
+ Reasoning and programming
+ Machine learning
+ Explainable AI
+ Constraints and uncertainty

Architectures
+ Agents and distributed AI
+ Intelligent user interfaces
+ Natural language systems and linguistics
+ Information retrieval
+ Case-based reasoning
+ Hierarchical and deep representations
+ Affective computing

Applications
+ Aviation and aerospace
+ Education and tutoring systems
+ Games and entertainment
+ Human-machine interaction
+ Law and machine ethics
+ Mathematics and the sciences
+ Medicine and healthcare
+ Management and manufacturing
+ World Wide Web
+ Robotics
+ Security

Implications
+ Philosophical foundations
+ Social impact and ethics
+ Evaluation of AI systems
+ AI education


COMMITTEES

Program Chairs
Diego Calvanese (Free University of Bozen-Bolzano, Italy)
Luca Iocchi (Sapienza University of Rome, Italy)

Program Committee
The PC members are currently being invited; we plan to have about 40 PC members.

Steering Committee
Nikolaj Bjorner (Microsoft Research, USA)
Adel Bouhoula (University of Carthage, Tunisia)
Laura Kovács (Chalmers University, Sweden)
Sriram Rajamani (Microsoft Research, India)
Geoff Sutcliffe (University of Miami, USA)
Andrei Voronkov (University of Manchester, UK)

Organizing Committee of GCAI and BRAIN
2019https://brain2019.inf.unibz.it/?p=organization


PUBLICATION

GCAI 2019 proceedings will be published in the EasyChair EPiC series
in Computing. Proceedings of the previous GCAI conferences are
available online:

Georg Gottlob, Geoff Sutcliffe and Andrei Voronkov (editors).
GCAI 2015. Global Conference on Artificial Intelligence (EPiC Series
in Computing, Volume
36)https://easychair.org/publications/volume/GCAI_2015

Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors).
GCAI 2016. 2nd Global Conference on Artificial Intelligence (EPiC
Series in Computing, Volume
41)https://easychair.org/publications/volume/GCAI_2016

Christoph Benzmüller, Christine Lisetti and Martin Theobald (editors).
GCAI 2017. 3rd Global Conference on Artificial Intelligence (EPiC
Series in Computing, Volume
50)https://easychair.org/publications/volume/GCAI_2017

Daniel Lee, Alexander Steen and Toby Walsh (editors).
GCAI-2018. 4th Global Conference on Artificial Intelligence (EPiC
Series in Computing, Volume
55)https://easychair.org/publications/volume/GCAI-2018


KEY DATES
- Abstract submission deadline: 14 June 2019
- Paper submission deadline: 21 June 2019
- Acceptance notification: 26 July 2019
- Camera ready copy due: 16 August 2019
- Conference: 17-19 September 2019

VENUE
The conference will be held in the main building of the Free
University of Bozen-Bolzano, Bolzano Italy, 17-19 September 2019.

CONTACT
All questions about submissions should be emailed to the program 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/
*
**********************************************************

Tuesday, May 21, 2019

[DMANET] Ph.D./post-doc positions in OR and OR/ML in Montreal

We invite applications for fully funded Ph.D. and post-doc positions in
Montreal in the domain of Operations Research, as well as in the
intersection between Operations Research and Machine Learning. These
positions aim at advancing our collective capabilities to model and solve
hard optimization problems and our understanding of how external data
sources and real-time data can be used to improve the decision-making
process.

* Research Topics
Research topics may be aligned with the interests of the students. Several
pre-defined research projects are also available (some of them in
collaboration with industrial partners). Topics may generally include the
following:
- Large-scale optimization for dynamic (combinatorial) planning problems
(e.g. Benders decomposition, Column Generation, Lagrangian Relaxation)
- Optimization under uncertainty (e.g. stochastic programming, robust
optimization, improvement of uncertainty sets and scenario generation
through external data)
- Improvement of (à priori and real-time) planning through integration of
external data sources via machine learning
- OR based algorithms to efficiently solve machine learning problems

Research applications may include domains such as Logistics and
Transportation (e.g., vehicle sharing systems, facility location, network
design), Telecommunications, and Revenue Management (e.g., assortment
planning; discrete choice models).

>>> We particularly invite applications for a post-doc position on machine
learning and optimization for high-frequency limit-order book data. This
position is at the Department of Finance at HEC Montréal and we encourage
interested candidates to apply as soon as possible. <<<

* Research supervision and environment
The students will work under the supervision of Dr. Sanjay Dominik Jena,
professor at the Department of Management and Technology (
mantech.esg.uqam.ca) at the Management School of Université du Québec à
Montréal (École des Science de la Gestion, UQAM). Sanjay Dominik Jena is
also member of the worldwide renowned research center CIRRELT (
www.cirrelt.ca) and the Canada Exellence Research Chair in Data Science for
Real-time Decision-making (www.cerc-datascience.polymtl.ca). Students may
be co-supervised by other members of these research centers and will be
registered either at the joint Ph.D. program in Management (including ESG
UQAM, HEC Montréal, McGill and Concordia) or at the respective university
of the other supervisor(s).

Montreal is a dynamic Metropolis, located in the province of Québec,
Canada. The city is bilingual (French/English) and known for its
international atmosphere. Montreal offers a vibrate research environment,
hosting five major universities and several research centers in the domains
of Operations Research and Machine Learning. The successful candidates will
be working in one of the above-mentioned research centers.

* Candidate profile
Students are expected to carry out top-level research. They will develop
efficient solution algorithms to difficult planning problems such as those
in the above-listed domains. Candidates for a PhD position should have a
Masters degree (or equivalent) in Computer Science, Operations Research,
Applied Mathematics, or a related field. Candidates for post-doc positions
should have a PhD in the aforementioned domains. All candidates should
belong to the top of their academic classes and demonstrate good
programming and mathematical skills. Experience in mathematical
programming, machine learning, or data analysis is an asset. Candidates
should possess a good level of written and oral English. Even though they
may eventually learn French during their stay, French knowledge is not
obligatory.

* Application procedure
Interested candidates should send their application package electronically
to Sanjay Dominik Jena (sanjay.jena@cirrelt.ca). The application should
contain the following documents:
- Cover letter explaining the motivation to perform a Ph.D. in one of the
domains mentioned above in Montreal, your research interests, as well as
your preferred starting date
- Detailed curriculum vitae with list of publications (if any)
- Grade records of Bachelor and Master programs
- Reference letters or contact details of references (one of them should be
the supervisor of the candidate's Master studies)
- results of GRE or GMAT (if available)

If you have further questions regarding these positions, possible research
topics, etc., please contact Sanjay Dominik Jena (sanjay.jena@cirrelt.ca).
For a start in January 2020, admission deadline is end of August 2019 at
most of the universities. We therefore encourage to apply early, since, if
considered for the entry at a Business school, a GRE/GMAT will be required
which takes some time of preparation. Post-doc positions do not have
specific starting dates.

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

[DMANET] Special Issue "Advanced Techniques in the Analysis and Prediction of Students' Behaviour in Technology-Enhanced Learning Contexts"

CALL FOR PAPERS
Special Issue "Advanced Techniques in the Analysis and Prediction of
Students' Behaviour in Technology-Enhanced Learning Contexts"

Applied Sciences
ISSN: 2076-3417 / Impact factor (2017): 1.689
Section "Computing and Artificial Intelligence"
https://www.mdpi.com/journal/applsci/special_issues/Techniques_Analysis_Prediction

Special Issue Information:
==========================
Dear Colleagues,

Analysing and predicting individuals' behaviour are important topics in
academic environments, especially after the increasing development and
deployment of software tools for supporting learning stages. The automation
of many processes involved in the usual students' activity allows for
processing massive volumes of data collected from teaching-enhanced
learning (TEL) platforms, leading to useful applications for academic
personnel. In this way, monitoring and analysing students' behaviour are
key activities required for the improvement of students' learning.
Recommendations of activities, dropout prediction, performance and
knowledge analysis, and resources optimization, among other
students-centred interests, are complex tasks that involve many elements
that need to be considered. Therefore, it becomes necessary that these
efforts search for support from other fields in the computational science
that have demonstrated a high effectiveness when handling data and
processes that are strongly interconnected. Data mining, big data, machine
learning, deep learning, collaborative filtering, and recommender systems,
among other fields related to intelligent systems, allow for the
development of advanced techniques that provide a significant potential for
the above purposes, leading to new applications and more effective
approaches in the analysis and prediction of the students' behaviour in
academic contexts.
This Special Issue provides a collection of papers of original advances in
the analysis, prediction, and recommendation of applications propelled by
artificial intelligence, big data, and machine learning, especially in the
TEL context. Papers about these topics are welcomed.

Prof. Dr. Juan A. Gómez-Pulido
Prof. Dr. Young Park
Prof. Dr. Ricardo Soto
Guest Editors

Keywords:
=========
Teaching-enhanced learning and teaching
Personalized learning
Intelligent tutoring Systems
Data mining and big data analysis
Intelligent systems
Machine and deep learning
Recommender systems
Collaborative filtering
Software tools
Performance prediction
Knowledge analysis
Optimization

Deadline for manuscript submissions:
====================================
30 November 2019

Special Issue Editors:
======================
Prof. Dr. Juan A. Gómez-Pulido. Department of Technologies of Computers and
Communications, Universidad de Extremadura, Cáceres, Spain
Prof. Dr. Young Park. Department of Computer Science and Information
Systems, Bradley University, Peoria, IL 61625, USA
Prof. Dr. Ricardo Soto. School of Computer Engineering, Pontificia
Universidad Católica de Valparaíso, Valparaiso, Chile

Manuscript Submission Information:
==================================
Manuscripts should be submitted online at www.mdpi.com by registering and
logging in to this website. Once you are registered, click here to go to
the submission form. Manuscripts can be submitted until the deadline. All
papers will be peer-reviewed. Accepted papers will be published
continuously in the journal (as soon as accepted) and will be listed
together on the special issue website. Research articles, review articles
as well as short communications are invited. For planned papers, a title
and short abstract (about 100 words) can be sent to the Editorial Office
for announcement on this website.
Submitted manuscripts should not have been published previously, nor be
under consideration for publication elsewhere (except conference
proceedings papers). All manuscripts are thoroughly refereed through a
single-blind peer-review process. A guide for authors and other relevant
information for submission of manuscripts is available on the Instructions
for Authors page. Applied Sciences is an international peer-reviewed open
access semimonthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a
manuscript. The Article Processing Charge (APC) for publication in this
open access journal is 1500 CHF (Swiss Francs). Submitted papers should be
well formatted and use good English. Authors may use MDPI's English editing
service prior to publication or during author revisions.

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

[DMANET] Special Issue at TCS

Dear Colleagues

Re:Algorithms and Discrete Mathematics – celebrating the silver jubilee of Indian Institute of Technology Guwahati

Please find a call for papers for a TCS-A Special issue at the following link:

https://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/celebrating-the-silver-jubilee

Please feel free to circulate it to appropriate colleagues and channels.

Also if you plan to submit something here, please send me an e-mail in
advance if possible (not essential though).

Regards
Sohel

Dr. M. Sohel Rahman
Professor
Department of CSE, BUET
&
Senior Member, ACM & IEEE
Member LMS
Address:
ECE Building
West Palasi
Dhaka-1205
Bangladesh
URL: http://msrahman.buet.ac.bd/
Google Scholar: https://scholar.google.com/citations?user=IUwFD9gAAAAJ
Researchgate:https://www.researchgate.net/profile/Mohammad_Rahman42

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

[DMANET] Call for abstracts: 2019 Workshop on AI-based Optimisation (AI-OPT 2019)

The 2019 Workshop on AI-based Optimisation (AI-OPT 2019)
https://conference.eng.unimelb.edu.au/ai-opt-2019/

will take place on October, 1-2, 2019 at the University of Melbourne, Australia.

Artificial Intelligence based optimisation techniques such as constraint programming, evolutionary computation, heuristic search, mixed integer programming, and swarm intelligence have found many applications in solving highly complex and challenging optimisation problems. Application domains include important areas such as cybersecurity, economics, engineering, renewable energy, health and supply chain management.

The goal of this informal workshop is to bring together researchers from a wide range of AI-based optimisation areas, discuss current challenges, and foster collaborations. The workshop will consists of technical presentations and allow enough time for discussions and collaborations. PhD students and early career researchers are especially encouraged to participate.

Researchers who are interested in presenting their work are invited to submit a short abstract (at most 1 page) on fundamental aspects and applications of AI-based optimisation.

Algorithmic approaches and topics include (but are not limited to):

-algorithmic game theory

-approximation algorithms

-constraint programming

-evolutionary computation

-heuristics search

-machine learning for optimisation

-mechanism design

-metaheuristics

-mixed integer programming

-parameterised algorithms

-swarm intelligence


Abstracts have to be submitted via Easychair at https://easychair.org/my/conference?conf=aiopt2019


Important dates:

Abstract submission deadline: 15 July, 2019

Notification: 30 July, 2019

Workshop: 1-2 October, 2019

Contact and Organisers:

Uwe Aickelin, The University of Melbourne, Australia

Frank Neumann, The University of Adelaide, Australia


**********************************************************
*
* 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, May 20, 2019

[DMANET] Third Call for Papers: ICDCN (International Conference on Distributed Computing and Networking) 2020

Apologies if you receive multiple copies of this CFP

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

Third Call for Papers

21st International Conference on Distributed Computing and Networking (ICDCN 2020)
January 4-7, 2020
Kolkata, India
www.icdcn.org

Papers describing original research work and practical experiences/experimental results are solicited on topics that tentatively include, but are not limited to:

Distributed Computing Track
-Blockchain
-Concurrent Data Structures
-Distributed algorithms: design, analysis, and complexity
-Distributed operating systems
-Distributed database systems
-Embedded distributed systems, sensors and mobile
-Distributed Robots
-Formal methods for distributed systems
-Experimental evaluation of distributed systems
-Fault-tolerance, reliability, and availability
-Multiprocessor & multi-core architectures & algorithms
-Self-organization, self-stabilization, & autonomic computing
-High performance computing, grid computing
-Multi-tire cloud computing and Big Data processing
-Security, cryptography and Game theory in distributed systems
-Internet-scale distributed systems

Networking Track
-5G, ultra-dense networks, and next-gen networks and services
-Ad-hoc, sensor, PAN and mesh networks
-Backscatter and ultra-low power networks
-Cognitive networking
-Data center and cloud networking
-Energy-efficient networking & integration with smart grids
-Internetworking protocols & Internet applications
-IoT connectivity and Cyber Physical Systems (CPS)
-Mobile Edge Computing (MEC)
-Mobile offloading
-Mobile pervasive computing and networking
-Network function virtualization and Software Defined Networking (SDN)
-Network security & privacy
-Next generation & converged network architectures
-Overlay & peer-to-peer networks and services
-Pricing and network economics

ICDCN 2020 is soliciting submissions as either regular or short papers. At least one author of each accepted paper must register for the conference and present the paper. Regular Papers should not exceed 10 pages double column including figures, tables, and references in standard ACM format. Additional details may be included in a clearly-marked appendix (containing all technical ideas and proofs necessary for an expert to fully verify the claims of the paper) that will be read at the discretion of the program committee. Short Papers should not exceed 5 pages double column including figures, tables, and references in standard ACM format. Some papers not accepted as regular papers may be accepted as short papers with 5 pages in the proceedings, while full papers will be allowed 10 pages.

Best Paper Award: The ICDCN TPC plans to award a Best Paper Award, independently for each of the two tracks. This award will be based on the paper's technical merit, the opinions of the reviewers and the presentation quality at the conference.

Important Dates
Abstract submission: 12th July 2019
Paper submission: 19th July 2019
Notifications: 6th September 2019
Camera Ready Papers: 11th October 2019

Committees

General Chairs
-Nandini Mukherjee, Jadavpur University, India
-Sriram Pemmaraju, University of Iowa, USA

Program Committee Chairs
-Mainak Chatterjee, University of Central Florida, USA (Networking Track)
-Keren Censor-Hillel, Technion, Israel (Distributed Computing Track)

Program Committee Vice Chairs
-Sudip Misra, Indian Institute of Technology, Kharagpur (Networking Track)
-Arpita Patra, IISc, Bangalore (Distributed Computing Track)

Steering Committee Chairs
-Sajal K. Das, Missouri Univ. of Science and Technology, USA
-Sukumar Ghosh, University of Iowa, 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] QBF Workshop 2019: Final Call for Papers

[We apologize if you receive multiple copies of this call]

----------------------------------------------------------------------
CALL FOR PAPERS

QBF 2019
--------
International Workshop on
Quantified Boolean Formulas and Beyond

Lisbon, Portugal, July 7, 2019
http://fmv.jku.at/qbf19/

Affiliated to and co-located with:
Int. Conf. on Theory and Applications
of Satisfiability Testing (SAT'19)
Lisbon, Portugal, July 7-12, 2019
----------------------------------------------------------------------

Quantified Boolean formulas (QBF) are an extension of propositional
logic which allows for explicit quantification over propositional
variables. The decision problem of QBF is PSPACE-complete, compared to
the NP-completeness of the decision problem of propositional logic (SAT).

Many problems from application domains such as model checking, formal
verification or synthesis are PSPACE-complete and hence could be
encoded as a QBF in a natural way. Considerable progress has been made
in QBF solving throughout the past years. However, in contrast to SAT,
QBF is not yet widely applied to practical problems in academic or
industrial settings. For example, the extraction and validation of
models of (un)satisfiability of QBFs has turned out to be
challenging, given that state-of-the-art solvers implement different
solving paradigms.

The goal of the International Workshop on Quantified Boolean Formulas
and Beyond (QBF 2019) is to bring together researchers working on
theoretical and practical aspects of QBF solving. In addition to that,
it addresses (potential) users of QBF in order to reflect on the
state-of-the-art and to consolidate on immediate and long-term
research challenges.

The workshop also welcomes work on reasoning with quantifiers in
related problems, such as dependency QBF (DQBF), quantified constraint
satisfaction problems (QCSP), and satisfiability modulo theories (SMT)
with quantifiers.

===============
INVITED SPEAKER
===============

Alexander Feldman, PARC

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

May 25: Submission (extended)
June 5: Notification (extended)
June 15: Camera-ready versions

Please see the workshop webpage for any updates:
http://fmv.jku.at/qbf19/

======================
CALL FOR CONTRIBUTIONS
======================

The workshop is concerned with all aspects of current research on all
formalisms enriched by quantifiers, and in particular QBF. The topics
of interest include (but are not limited to):

- Applications, encodings and benchmarks with quantifiers
- QBF proof theory and complexity results
- Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc.
- Experimental evaluations of solvers or related tools
- Case studies illustrating the power of quantifiers
- Formats of proofs and certificates
- Implementations of proof checkers and verifiers
- Decision procedures
- Calculi and their relationships
- Data structures, implementation details and heuristics
- Pre- and inprocessing techniques
- Structural reasoning

==========
SUBMISSION
==========

Submissions of extended abstracts are invited and will be managed via
Easychair:

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

In particular, we invite the submission of extended abstracts on work
that has been published already, novel unpublished work, or work in
progress.

The following forms of submissions are solicited:

- Proposals for short tutorial presentations on topics related to the
workshop. The number of accepted tutorials depends on the overall
number of accepted papers and talks, with the aim to set up a
balanced workshop program.

- Talk abstracts reporting on already published work. Such an abstract
should include an outline of the planned talk, and pointers to
relevant bibliography.

- Talk proposals presenting work that is unpublished or in progress.

- Submissions which describe novel applications of QBF or related
formalisms in various domains are particularly welcome.
Additionally, this call comprises known applications that have been
shown to be hard for QBF solvers in the past as well as new
applications for which present QBF solvers might lack certain
features still to be identified.

Each submission should have an overall length of 1-4 pages in LNCS
format. Authors may decide to include an appendix with additional
material. Appendices will be considered at the reviewers' discretion.

The accepted extended abstracts will be published on the workshop
webpage. The workshop does not have formal proceedings.

Authors of accepted contributions are expected to give a talk at the
workshop.

=======
CONTACT
=======

qbf19@easychair.org

===============================
PROGRAM CHAIRS AND ORGANIZATION
===============================

Hubie Chen, Birkbeck, University of London
Florian Lonsing, Stanford University
Martina Seidl, University of Linz, Austria
Friedrich Slivovsky, TU Wien, Austria


**********************************************************
*
* 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] GandALF 2019 : Extended Deadline

GandALF 2019
https://gandalf2019.sciencesconf.org
The Tenth International Symposium on Games, Automata, Logics, and Formal Verification
2 - 4 September 2019, Bordeaux, France

Call for papers

The aim of the GandALF symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The 2019 edition of the symposium is the tenth edition. It is organized in the city of Bordeaux by the LaBRI laboratory.

The symposium covers a large number of research subjects, ranging from theory to applications, and stimulate cross-fertilization. The topics covered by the conference include, but are not limited to, the following:

Automata Theory
Automated Deduction
Computational aspects of Game Theory
Concurrency and Distributed computation
Decision Procedures
Deductive, Compositional, and Abstraction Techniques for Verification
Finite Model Theory
First-order and Higher-order Logics
Formal Languages
Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems
Games and Automata for Verification
Game Semantics
Logical aspects of Computational Complexity
Logics of Programs
Modal and Temporal Logics
Model Checking
Models of Reactive and Real-Time Systems
Stochastic models such Markov decision processes and stochastic games
Program Analysis and Software Verification
Run-time Verification and Testing
Specification and Verification of Finite and Infinite-state Systems
Synthesis

Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome.

PUBLICATIONS
The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. Authors of the best papers will be invited to submit a revised version of their work to a special issue of Information and Computation. The previous editions of GandALF already led to special issues of the International Journal of Foundations of Computer Science (GandALF 2010), Theoretical Computer Science (GandALF 2011 and 2012), Information and Computation (GandALF 2013, 2014, 2016, 2017, and 2018; the latter two still in progress), and Acta Informatica (GandALF 2015).

SUBMISSIONS
Submitted papers should not exceed fourteen (14) pages using EPTCS format (please use the LaTeX style provided at http://style.eptcs.org), be unpublished and contain original research. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF or PS format and will be handled via the EasyChair Conference system at https://www.easychair.org/conferences/?conf=gandalf2019.

IMPORTANT DATES
Abstract submission: May 31st, 2019 (new date)
Paper submission: June 2nd, 2019 (new date)
Notification: July 3rd, 2019
Camera-ready: July 19th, 2018
Symposium : September 2-4, 2019

WEBSITE
https://gandalf2019.sciencesconf.org

INVITED SPEAKERS
Nathanaël Fijalkow (CNRS, France)
Emmanuel Filiot (ULB, Belgium)
Mariëlle Stoelinga (U Twente & Radboud University, Netherlands)
James Worrell (U Oxford, UK)

PROGRAM COMMITEE
Christel Baier (TU Dresden, Germany)
Saddek Bensalem (U Grenoble Alpes, France)
Patricia Bouyer (CNRS, France)
Franck Cassez (Macquarie University, Australia)
Dario Della Monica (U Udine, Italy)
Hugo Gimbert (CNRS, France)
Holger Hermanns (U Saarbrucken, Germany)
Rasmus Ibsen-Jensen (U Liverpool, UK)
Jan Kretinsky (TU Munich, Germany)
Orna Kupferman (U Jerusalem, Israël)
Kim G. Larsen (U Aalborg, Denmark)
Slawomir Lasota (U Warsaw, Poland)
Jérôme Leroux (CNRS, France) co-chair
Andrea Orlandini (ISTC-CNR, Italy)
Gennaro Parlato (University of Molise, Italy)
M. Praveen (CMI Chennai, India)
Jean-François Raskin (ULB, Belgium) co-chair
Vojtěch Řehák (U Masaryk, Czech Republic)
Pierre-Alain Reynier (U Marseille, France)
Jie-Hong Roland (NTU, Taiwan)
Pietro Sala (U Verona, Italy)
Pierluigi San Pietro (Pierluigi San Pietro, Italy)
Martin Zimmermann (Liverpool University, UK)

STEERING COMMITEE
Luca Aceto (Reykjavik University, Iceland)
Javier Esparza (University of Munich, Germany)
Salvatore La Torre (University of Salerno, Italy)
Angelo Montanari (University of Udine, Italy)
Mimmo Parente (University of Salerno, Italy)
Wolfgang Thomas (Aachen University, Germany)

LOCAL ORGANIZERS
>From LABRI, Université de Bordeaux -- https://www.labri.fr
Auriane Dantes
Katel Guerin
Frédéric Herbreteau
Jérôme Leroux
Vincent Penelle
Gabriele Puppis
Grégorie Sutre


**********************************************************
*
* 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] 2nd milestone (June 1) at ITC 2019 International Timetabling Competition

--------------------------------------------------------------------------------
ITC 2019: International Timetabling competition  https://www.itc2019.org
--------------------------------------------------------------------------------
*
NEWS*

* *New participants are welcome!*
o final submission: November 18, 2019
* *2nd milestone submission is coming soon*
o June 1, 2019
o optional submission: not needed for final submission and ordering
* *Winners of the 1st milestone published*
o with the total costs of the best solution for each of the early instances
* *Questions & Answers *added to the website*
*
* Current status
o *138 registered users from 45 countries*

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

***UNIVERSITY COURSE TIMETABLING COMPETITION*

* Assignment of times and rooms to events
* Student sectioning based on course demands
* Optimization by minimizing penalties of
o time and room assignments,
o violated soft constraints,
o student conflicts
* Course structure for student sectioning
* Rooms with travel times and unavailabilities
* Events not meeting every week

***RICH REAL-WORLD DATA INSTANCES*

* Diverse characteristics
* 11 institutions from six continents
* Early, middle and late instances, around 8-10 instances each
* Data collected from the UniTime educational scheduling system

***NO TIME OR TECHNOLOGY LIMITATIONS*

* Commercial solvers allowed
* Looking for the best solutions
* Solution validator as a web service

*MID-COMPETITION STANDINGS*

* Two milestones during the competition
* Quality of the best solutions published
* 300, 200, 100 EUR for the top three solvers
* Submission for milestones is optional, not counted in the final ordering.

***WINNERS*

* Five finalists, prices for the first three
o 1000, 500, 250 EUR
* Free PATAT 2020 registrations
* Awards supported by
o PATAT conference
o EWG PATAT
* Award for the best open source solver
o 500 USD
o Award provided by Apereo Foundation
* Awards for winners of late instances
o 150 EUR per instance
o Awards provided by ORTEC
* Points awarded for each instance
* More points for later instances

***PATAT 2020 CONFERENCE*

* A special track about the competition
* Winners announced
* Journal special issue

***IMPORTANT DATES

*
February 1, 2019 1st milestone submission
June 1, 2019
2nd milestone submission
September 18, 2019 Middle instances published
November 8, 2019 Late instances published
November 18, 2019   Final submission
January 1, 2020 Open source solvers publication
January 15, 2020    
Finalists published
February-March, 2020 PATAT 2020 submissions
August, 2020 Winners announced at PATAT 2020
Autumn, 2020 Journal special issue

    *
**AFTER THE COMPETITION*

* The ITC 2019 website remains available
* Tracking the best-known solutions and related papers

*****SPONSORS*

* Conference on the Practice and Theory of Automated Timetabling (PATAT)
* ORTEC: optimization software and analytics solutions
* Apereo Foundation: supporting open-source software for higher education
* EURO working group on Automated Timetabling (EWG PATAT)
* UniTime educational scheduling system
* Faculty of Informatics, Masaryk University

***ORGANIZERS*

* Tomas Muller, Purdue University, UniTime, s.r.o.
* Hana Rudova, Faculty of Informatics, Masaryk University
* Zuzana Mullerova, Faculty of Informatics, Masaryk University, UniTime, s.r.o.

See https://www.itc2019.org for more details.

**********************************************************
*
* 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] MDPI Special Issue on 'Algorithms for Control and Applications of Unmanned Aerial Vehicles' Deadline 31 December 2019

Dear Colleagues,
In the last few years, drones, and more generally, unmanned autonomous
vehicles (UAVs) have developed rapidly and been used for emergent civil
applications. The most futuristic and promising applications cover a
range of diverse fields, including agriculture, public safety, human
rights monitoring, disaster management, infrastructure monitoring,
package delivery, supply chain, and communication networks. In such
contexts, the UAVs will work in cooperation with a large number of
diverse, energy-constrained, mobile smart devices that are, and will
increasingly be, settled around us. The cooperative work of UAVs,
belonging even to different owners, will be of fundamental importance.

For this Special Issue, we are particularly interested in papers that
present theoretical algorithmic contributions from the perspective of
operations that recur in new applications. The papers should propose
mathematical models to describe the problems characteristic of the
control and application of UAV systems, study the problems of
computational complexity, devise new centralized or distributed
algorithms, and also apply optimization techniques with multiple
objectives.

The topics of interest include, but are not limited to:
- Theoretical foundations (modeling, design and analysis of
algorithms) for Drones/ UAV assisted networks
- Theoretical foundations for parcel delivery using Drones
- Theoretical foundations for supply chain using Drones
- Theoretical foundations for monitoring with Drones/UAV recurring
operations (planting, weeding, fertilizing) in agriculture
- Theoretical foundations for forest monitoring with Drones/UAVs
- Theoretical foundations for recharging IoT devices with Drones
- Theoretical foundations for control automated vehicles with UAVs
- Theoretical foundations for cooperative use of robots and drones
- Theoretical foundations for providing network properties (coverage,
connectivity) in emergency
- Theoretical foundations for providing network properties during
temporary events
- Theoretical foundations for monitoring public safety on roads
- Theoretical foundations for monitoring human rights with drones
in hostile environments
- Theoretical foundations for optimal drones deployment
- Theoretical foundations for optimal drones coverage
- Theoretical foundations for cooperative control of multiple UAVs

Guest Editor: Cristina M. Pinotti

https://www.mdpi.com/journal/electronics/special_issues/UAV_Algorithm

https://www.mdpi.com/si/28066

Algorithms for Control and Applications of Unmanned Aerial Vehicles

--
Francesco Betti Sorbelli
**********************************************************
*
* 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] One-Day Meeting in Combinatorics at Oxford

A One-Day Meeting in Combinatorics will be held in Oxford on Wednesday 29
May 2019. The meeting will take place in the Mathematical Institute, with
talks starting at 11am and coffee available beforehand from 10.30am. This
year's speakers are Vida Dujmovic (Ottawa), Louis Esperet (Grenoble),
Martin Grohe (Aachen), Remco van der Hofstad (Eindhoven) and Perla Sousi
(Cambridge).

Anyone interested is welcome to attend. Some funds may be available to
contribute to the expenses of research students who wish to attend the
meeting.

Further details can be obtained from the web page, which can be found at
http://people.maths.ox.ac.uk/scott/Pages/one-day_meeting.htm

Support for this event by the London Mathematical Society and the British
Combinatorial Committee is gratefully acknowledged.
**********************************************************
*
* 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/
*
**********************************************************

Sunday, May 19, 2019

[DMANET] CPHardware2019 - Call for Abstracts

CALL FOR ABSTRACTS

CP2019 Workshop on Constraint Solving and Special Purpose Hardware Architectures(CPHardware2019)

This workshop focuses on the topic of the use of recent and near-term special purpose hardware architectures for constraint solving, broadly conceived to include any declarative constraint-based formulations (i.e., CP, MIP, SAT, SMT, etc.). The workshop is interested in any special purpose hardware including but not limited to quantum chips and chips for solving Ising/QUBO problems (e.g., Digital/CMOS Annealers) and the models, modeling languages, performance, and applications for the use of these chips for constraint solving.

With the end of Moore's Law and the success of GPUs, hardware researchers have turned to special purpose, as opposed to general purpose, processor architectures. For classical computation, this has led to chips from a number of manufacturers (e.g., Hitachi, Fujitsu) that solve specific classes of optimization problems in hardware. Simultaneously, the availability of early quantum chips (e.g., from IBM, Rigetti, and D-Wave) has raised the possibility of constraint solving using quantum computation. These hardware thrusts have resulted in a small but growing number of researchers exploring constraint solving on such hardware architectures. The goal of this workshop is to develop a CP community by both bringing together these researchers and introducing their work to the rest of the community.

FORMAT
We are planning for a one-day workshop with a series of invited talks and abstract presentations. Confirmed invited speakers:

Carleton Coffrin, Los Alamos National Laboratory
Aidan Roy, D-Wave Systems
Hayato Ushijima, Fujitsu Laboratories of America, Inc.
Davide Venturelli, NASA Ames
Masanao Yamaoka, Hitachi Ltd

SUBMISSIONS
We seek extended abstracts on any work related to the use of special purpose hardware for techniques and problems of interest to the constraints community. The submissions will not be peer reviewed. Ideally, all relevant abstracts will have an oral presentation during the workshop. However, the organizing committee will filter for relevance and, if space/time becomes an issue, may select a subset of the submissions for presentation based on fit with the goals of the workshop.

Submissions should be no more than 2 pages in LNCS format plus references. There is no need for an explicit abstract section given this size restriction.

DATES

June 30, 2019: Author notification for main CP conference
July 14, 2019: Abstract submission deadline
July 28, 2019: Author notification for workshop
(TBD): Early registration
Sept 30, 2019: The Workshop

ORGANIZERS

J. Christopher Beck, University of Toronto
Merve Bodur, University of Toronto
Carleton Coffrin, Los Alamos National Laboratory

WEBSITE: https://sites.google.com/view/cphardware2019/ <https://sites.google.com/view/cphardware2019/>
--
Merve Bodur, PhD
Assistant Professor, Dean's Spark Professor, Industrial Engineering

Department of Mechanical & Industrial Engineering
Faculty of Applied Science & Engineering | University of Toronto
5 King's College Rd., Toronto, Ontario M5S 3G8
Office: 40 St. George Street, BA8106 Phone: 416 978 4739


**********************************************************
*
* 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, May 17, 2019

[DMANET] CfP: The First Workshop on Statistical Deep Learning in Computer Vision.

Dear Colleagues,

It is our pleasure to invite you to submit extended abstracts (4 pages long
excluding references, with optional appendix) for oral and poster
presentations at The First Workshop on Statistical Deep Learning in
Computer Vision (SDL-CV) which will be held in conjunction with ICCV 2019.

We will also invite selected papers for submission to a special issue on
Statistical Deep Learning for Computer Vision in the International Journal
of Computer Vision (IJCV). Extended versions of selected papers will be
invited for book chapter publication.

Submission Deadline: July 31, 2019

Workshop Website: http://www.sdlcv-workshop.com/

Please find the full CfP below.

Kind regards,

Mete Ozay on behalf of the organizers

=== Workshop Description ===

Deep learning has been a useful and primary toolbox to perform various
computer vision tasks successfully in the recent years. Various seminal
works have been proposed to explain the underlying theory and mechanisms of
these successful algorithms, in order to further improve their various
properties, such as generalization capacity of models, representation
capacity of learned features, convergence and computational complexity of
training methods.

In this workshop, we consider statistical approaches employed to improve
our understanding of deep learning, and to develop methods to boost their
properties, with applications in computer vision, such as object
recognition, detection, segmentation, tracking, scene description, visual
question answering, robot vision, image enhancement and recovery. The
workshop will consist of invited talks, oral talks, poster sessions and a
research panel. Our target audience is graduate students, researchers and
practitioners who have been working on development of novel statistical
deep learning algorithms and/or their application to solve practical
problems in computer vision. Accepted papers will present their results in
the workshop in oral talks and poster sessions. We will also invite
selected papers for submission to a special issue on Statistical Deep
Learning for Computer Vision in the International Journal of Computer
Vision (IJCV). Extended versions of selected papers will be invited for
book chapter publication.

=== Covered Topics ===

We solicit original contributions that deploy statistical deep learning
methods employed to perform various computer vision tasks including, but
not limited to:

- Statistical Understanding of Deep Learning

-- Interpretable deep learning, quantitative measures and analyses

- Statistical Normalization Methods

-- Feature, weight, gradient and hybrid normalization methods

- Uncertainty in Deep Learning

-- Uncertainty measures, adversarial methods, intrinsic and extrinsic
uncertainty of models

- Information Theory of Deep Learning

-- Information geometry, information bottleneck, rate distortion, etc.

- Probabilistic Deep Learning

-- Variational methods, graphical methods, Bayesian learning and inference

-- Bayesian deep learning

-- Neural network architecture search via probabilistic models

- Stochastic Optimization for Deep Learning

-- Optimization on Riemannian manifolds, topological manifolds, and
product manifolds

- Probabilistic Programming for Deep Learning

-- Scene perception, logical reasoning, autonomous driving

- Statistical Meta-learning Algorithms

-- Few-shot learning/incremental learning for image classification and
beyond

-- Zero-shot learning for high-level vision tasks

- Reinforcement Learning for Vision Systems

-- RL algorithms and vision problems

- Causal Deep Learning

-- Causal inference, causal feature learning

=== Call for Papers ===

We invite submissions describing works in the domains suggested above or in
closely-related areas. We encourage the submission of previously published
material (clearly marked as such) that is closely related to the workshop
topic. We will invite the best original papers for an oral plenary
presentation. Accepted papers will be presented in oral/poster sessions at
the workshop and appear in the CVF open access archive. The review process
is single-blind. Each paper will receive strong accept (for oral
candidate), accept or reject decision. Note that there is no author
feedback phase during submission. We will also invite selected papers for
submission to a special issue on Statistical Deep Learning for Computer
Vision in the International Journal of Computer Vision (IJCV). Extended
versions of selected papers will be invited for book chapter publication.

Paper submission deadline: July 31, 2019

Author notification: Sep 4, 2019

Camera-ready deadline: Sep 25, 2019

=== Submission Instructions ===

Format and paper length:

A paper submission has to be in English, in pdf format, and at most FOUR
pages (excluding references). The paper format must follow the same
guidelines as used in the ICCV 2019 submissions. For further details,
please see:

http://www.sdlcv-workshop.com/callforpaper.html

=== Invited Speakers ===

We are proud to have a group of diverse invited speakers covering the

entire spectrum of scene and and situation understanding research:

* Xianfeng Gu, Stony Brook University

* Alex Kendall, University of Cambridge

* Yi Ma, University of California, Berkeley

* Yingnian Wu, University of California, Los Angeles

* Alan L. Yuille, Johns Hopkins University

* Lizhong Zheng, Massachusetts Institute of Technology


=== Organizers ===

Ping Luo, HKU

Mete Ozay, PKSHA

Hongyang Li, CUHK

Chaochao Lu, Cambridge University

Lei Huang, IIAI

Wenqi Shao, CUHK

Xianfeng Gu, Stony Brook University

Alan L. Yuille, Johns Hopkins University

Xiaogang Wang, CUHK

Yi Ma, University of California, Berkeley

Lizhong Zheng, MIT

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