Tuesday, September 11, 2018

[DMANET] New Book: Foundations of Probabilistic Logic Programming

I am pleased to announce my book:
Foundations of Probabilistic Logic Programming
Languages, Semantics, Inference and Learning
Author: Fabrizio Riguzzi, University of Ferrara, Italy
Publisher: River Publishers
Series: River Publishers Series in Software Engineering
ISBN: 9788770220187
e-ISBN: 9788770220170
http://mcs.unife.it/~friguzzi/plp-book.html

Sample content:
Table of contents http://mcs.unife.it/~friguzzi/table-of-contents.pdf
Preface http://mcs.unife.it/~friguzzi/preface.pdf
Chapter 2 http://mcs.unife.it/~friguzzi/chapter2.pdf

Get it from:
the publisher: http://www.riverpublishers.com/book_details.php?book_id=660
Amazon: http://amzn.eu/d/0094M57

Abstract
Probabilistic Logic Programming extends Logic Programming by enabling the representation of uncertain information. Probabilistic Logic Programming is at the intersection of two wider research fields: the integration of logic and probability and Probabilistic Programming.

Logic enables the representation of complex relations among entities while probability theory is useful for model uncertainty over attributes and relations. Combining the two is a very active field of study. Probabilistic Programming extends programming languages with probabilistic primitives that can be used to write complex probabilistic models. Algorithms for the inference and learning tasks are then provided automatically by the system.

Probabilistic Logic programming is at the same time a logic language, with its knowledge representation capabilities, and a Turing complete language, with its computation capabilities, thus providing the best of both worlds.

Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of activity, with many proposals for languages and algorithms for inference and learning. Foundations of Probabilistic Logic Programming aims at providing an overview of the field with a special emphasis on languages under the Distribution Semantics, one of the most influential approaches. The book presents the main ideas for semantics, inference, and learning and highlights connections between the methods.

Many examples of the book include a link to a page of the web application http://cplint.eu where the code can be run online.

Keywords: Probabilistic logic programming, statistical relational learning, statistical relational artificial intelligence, distribution semantics, graphical models, artificial intelligence, machine learning

**********************************************************
*
* 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, September 10, 2018

[DMANET] Special Issue "Modeling Computing and Data Handling for Marine Transportation" - Algorithms, MDPI - Open Access Journal

Dear Colleagues,

Please consider contributing to the following SI of Algorithms, MDPI on
"Modeling Computing and Data Handling for Marine Transportation":

http://www.mdpi.com/journal/algorithms/special_issues/Modeling_Computing

**** For high quality articles, the publishing fees will be waived. ****

Deadline for manuscript submissions: October 31, 2018

Special Issue Information

Maritime transportation is the major conduit of international trade. In
terms of cost, maritime transport is very competitive relative to land and
airborne transport, increasing only by a few percent the total product cost.
On the other hand, maritime transportation takes longer or may cause harbor
congestion, which further increases voyage times. Furthermore, there are
difficulties in integrating this transportation mode efficiently with other
transport or distribution options. On top of that, the safety and the
environmental impact of maritime transportation, in particular, in the case
of sea accidents, are always two challenging issues.

As recent advances on maritime transportation require the synergy of both
computer science and maritime science, the main focus in this special issue
will be upon the latest developments on IT methodologies for maritime
transportation. Computational intelligence, data mining and knowledge
discovery/representation, risk assessment methodologies as well as
combinatorial optimization are the IT fields that have gain importance in
maritime studies because of their potential in giving solutions for
effective sea transportation.

Submissions are solicited in, but not limited to, the following areas:

- Graph and Network algorithms for Marine Transportation

- Combinatorial optimization techniques for Marine Transportation

- Weather Routing

- Environmentally Safe Shipping

- Safety and Security of Maritime Shipping

- Risk and Safety Analysis, Assessment and Prediction

- Piracy Protection

- GIS in Maritime Applications

- Spatiotemporal and Marine Data Handling

- Route Planning and Monitoring

- Maritime Data Mining and Knowledge Discovery Applications: surveillance,

maritime traffic control, anomaly detection, emergency management, situation

recognition, etc.

- Decision Support Tools for Marine Transportation

- Integration of Heterogeneous Marine Data Sources

Guest Editors:

Dr. Charalampos Konstantopoulos

Prof. Dr. Grammati Pantziou


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

[DMANET] Final CFP: 8th WICT'18 - Springer - Kochi, India

Final Call for Papers

Due to numerous requests from authors, the paper submission deadline has
been extended to September 30, 2018

Apologies for cross-posting. Kindly help to distribute this final CFP to
your mailing list.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

-- The 8th World Congress on Information and Communication Technologies
(WICT'18) --

http://www.mirlabs.org/wict18
http://www.mirlabs.net/wict18

Indexed by: SCOPUS, Thomson ISI Web of Science, DBLP etc.
History of WICT series: http://www.mirlabs.net/wict18/previous.php

WICT 2018: Scopus & UGC Approved Proceedings
All accepted and registered papers will be published in AISC Series of
Springer, indexed in ISI Proceedings, EI-Compendex, DBLP, SCOPUS, Google
Scholar and Springerlink. (Listed in UGC approved list, please refer List
1- Page 32 - S.No. - 1375) (
http://www.ugc.ac.in/pdfnews/8919877_Journals-1.pdf)

** Important Dates **
-------------------------
Paper submission due: September 30, 2018 (Extended)
Notification of paper acceptance: October 21, 2018
Registration and Final manuscript due: November 10, 2018
Conference: December 17 - 19, 2018

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

About WICT'18:
--------------
WICT'18 aims to provide an opportunity for the researchers from academia
and industry to meet and discuss the latest solutions, scientific results
and methods in the usage and applications of ICT in the real world. The
conference programme includes workshops, special sessions and tutorials,
along with prominent keynote speakers and regular paper presentations in
parallel tracks. In the past century, our society has been through several
periods of dramatic changes, driven by innovations such as transportation
systems, telephone etc. Last few decades have experienced technologies that
are evolving so rapidly, altering the constraints of space and time, and
reshaping the way we communicate, learn and think. Rapid advances in
information technologies and other digital systems are reshaping our
ecosystem. Innovations in ICT allow us to transmit information quickly and
widely, propelling the growth of new urban communities, linking distant
places and diverse areas of endeavor in productive new ways, which a decade
ago was unimaginable. Thus, the theme of this World Congress is "Innovating
ICT For Social Revolutions". All accepted and registered papers will be
included in the conference proceedings expected to be published by Springer.

Topics (not limited to)
----------------------------------------
Bioinformatics and Computational Biology
Computer Graphics and Virtual Reality
Data Mining
e-Learning
e-Business
e-Government
Artificial Intelligence
Web Services and Semantic Web
Grid and Cloud Computing
Ambient Intelligence
Body Sensor Networks
Computational Finance and Economics
Cybercrime (Legal and Technical Issues)
Computer Network Security
Data Mining for Information Security
Academic Integrity, Plagiarism Detection and Software Misuse
Intrusion Detection and Forensics
Scheduling For Large Scale Distributed System
Nature Inspired Optimization Algorithms and Their Applications
The Role of Technology in Education and Health
Data Management
Collaborative Design in Knowledge-based Environment
Software Engineering

~~~~~~~~~~~~~~~~~~~~~~
Submission Guidelines:
----------------------
Submission of paper should be made through the submission page from the
conference web page. Please refer to the conference website for guidelines
to prepare your manuscript.

Paper format templates:
http://www.springer.com/series/11156

WICT'18 Submission:
https://easychair.org/conferences/?conf=wict2018

~~~~~~~~~~~~~~~~~~~~~~~~
* Organizing Committee *
-------------------------
General Chairs:
Ajith Abraham, Machine Intelligence Research Labs, USA
Preethi Thekkath, Toc H Institute of Science &Technology, India

Program Co-Chairs
Simone Ludwig, North Dakota State University, USA
Millie Pant, Indian Institure of Technology - Roorkee, India
Antonio J. Tallón-Ballesteros, University of Seville, Spain
Rasmi P S, Toc H Institute of Science &Technology,India

Technical Committee (Please refer website):
http://www.mirlabs.net/wict18/committees.php

For technical contact:
----------------------
Ajith Abraham
Email: ajith.abraham@ieee.org


--
Sanju Mishra Tiwari
Research Associate
Department of Computer Applications
National Institute of Technology
Kurukshetra

**********************************************************
*
* 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] Multiple Postdoc positions available in the algorithms group at the Université Libre de Bruxelles (ULB), Brussels, Belgium

Multiple Postdoc positions available at Université Libre de Bruxelles
(ULB), Brussels, Belgium

The positions are for a period of 12 months with the possibility of renewal
depending on funding. Flexible start date. Research will be conducted
within the Algorithms Group (http://algo.ulb.be/).

The positions would be to work on a project entitled "Efficient data
structures and algorithms for modern computing devices in the age of big
data." Candidates are expected to have expertise in one or more of the
following: algorithms, data structures, algorithm engineering, algorithms
for modern hardware.

Applications (cover letter and CV) should be sent to postdoc@JohnIacono.com.

John Iacono
Algorithms Research Group
Computer Science Department
Faculté des Sciences
Université libre de Bruxelles (ULB)

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

[DMANET] IEEE CEC 2019: Special Session on “Optimization, Learning, and Decision-Making in Bioinformatics and Bioengineering”

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

Special Session on

*Optimization, Learning,
and Decision-Making in Bioinformatics and Bioengineering*

https://tinyurl.com/OLDBB-IEEE-CEC-2019

2019 IEEE Congress on Evolutionary Computation (CEC 2019)

10-13 June 2019, Wellington, New Zealand

*Submission deadline:* 7 January 2019

*Submission details:* http://cec2019.org/papers.html

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


*Scope and topics*

Bioinformatics and Bioengineering (BB) are interdisciplinary scientific
fields involving many branches of computer science, engineering,
mathematics, and statistics. Bioinformatics is concerned with the
development and application of computational methods for the modeling,
retrieving and analysis of biological data, whilst Bioengineering is the
application of engineering techniques to biology so as to create usable and
economically viable products.

Bioinformatics and Bioengineering are relatively new fields in which many
challenges and issues can be formulated as (single and multiobjective)
optimization problems. These problems span from traditional problems, such
as the optimization of biochemical processes, construction of gene
regulatory networks, protein structure alignment and prediction, to more
modern problems, such as directed evolution, drug design, experimental
design, and optimization of manufacturing processes, material and equipment.

The main aim of this special session is to bring together both experts and
new-comers working on Optimization, Learning and Decision-Making in
Bioinformatics and Bioengineering to discuss new and exciting issues in
this area. The topics are, but not limited to, the following

• (Single and multiobjective) optimization techniques
for Bioinformatics and Bioengineering (BB) problems

• Decision-making and MCDM techniques for BB problems

• Experimental optimization of BB problems

• Learning in/from the optimization of BB problems

• Data-driven optimization for BB problems

• Tuning of optimization, learning and decision-making
techniques for BB problems

• Emerging topics in BB

o Novel applications

o Novel challenges

o Interactive visualization

o Predictive fitness landscape design

o Many-objective optimization

o Ecoinformatics

o Side effect machines and other kernal representations for sequence
analysis

o Biomedical data modelling and mining

*Organizers*

Joseph A. Brown (j.brown@innopolis.ru), Innopolis University, Russia

Gonzalo Ruz (gonzalo.ruz@uai.cl), Universidad Adolfo Ibanez, Chile

Daniel Ashlock (dashlock@uoguelph.ca), University of Guelph, Canada

Richard Allmendinger (richard.allmendinger@manchester.ac.uk), The
University of Manchester, UK

More information about the session can be found at
https://tinyurl.com/OLDBB-IEEE-CEC-2019. Feel free to contact the session
organizers if you have any further questions.


Best wishes,

Joseph, Gonzalo, Daniel 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] CEC 2019 Special Session on Theory of Bio-Inspired Computation

================================================================
CEC 2019 Special Session on Theory of Bio-Inspired Computation
================================================================

CALL FOR PAPERS

================
I. MOTIVATION
================

The area of runtime analysis for bio-inspired computing techniques such as evolutionary algorithms and ant colony optimisation provides new insights into the working behaviour of these methods for solving optimisation problems. The theoretical analysis of these algorithms includes studying the runtime complexity with respect to the input size and/or other parameters of the instance of the problem until reaching an optimal or approximate solution of the problem. Rigorous analysis of these algorithms help us in designing more efficient algorithms. Moreover, investigating the effect of different parameters of the studied algorithms lead to more efficient parameter tuning for these algorithms. Furthermore, studying the theoretical behaviour of bio-inspired algorithms with respect to the characteristics of the studied problem is beneficial in choosing the right algorithm for solving each instance of the problem.

The purpose of this special session is to bring together people working on theoretical analysis of bio-inspired computing techniques. We aim to provide a forum for the researchers in this field to discuss the latest outcomes and new directions in the theory of bio-inspired algorithms.

=========
II. SCOPE
=========

The authors are invited to submit papers on original contributions in the area of theoretical analysis of bi-inspired computation techniques. The scope of this special session includes (but is not limited to) the following topics:

* Theoretical foundations of bio-inspired heuristics
* Exact and approximation runtime analysis
* Parametrized complexity analysis
* Black box complexity
* Self-adaptation
* Population diversity
* Population dynamics
* Fitness landscape and problem difficulty analysis
* All problem domains will be considered including:
* combinatorial and continuous optimization
* single-objective and multi-objective optimization
* constraint handling
* dynamic and stochastic optimization
* co-evolution and evolutionary learning


=============
III. SUBMISSION
=============

You should follow the IEEE CEC 2019 submission website.<http://cec2019.org/papers.html#submission> On the submission system select "Theoretical Foundations of Bio-inspired Computation" as "Main Research Topic".

Special session papers are treated in the same way as regular conference papers. Click here<http://www.cec2019.org/> to visit the main CEC 2019 web page.

==================
IV. IMPORTANT DATES
==================

Important Dates

* Paper submissions: January 7, 2019
* Review Submission Deadline: February 28, 2019
* Notification of acceptance: March 7, 2019
* Final paper submission: March 31, 2019

===============
V. ORGANIZORS
===============

Mojgan Pourhassan<https://cs.adelaide.edu.au/~mojgan/>
School of Computer Science
University of Adelaide
Adelaide, Australia

Frank Neumann<https://cs.adelaide.edu.au/~frank/>
School of Computer Science
University of Adelaide
Adelaide, Australia

Chao Qian<http://staff.ustc.edu.cn/~chaoqian/>
School of Computer Science and Technology
University of Science and Technology of China
Anhui, China

**********************************************************
*
* 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, September 7, 2018

[DMANET] WEPA 2018 CALL FOR PAPERS

WEPA 2018: Second Workshop on Enumeration Problems and Applications
November 5-8, Department of Computer Science, University of Pisa, Pisa
Submission Deadline: Sep 10, 2018 (AoE)
Notification: Sep 25, 2018

The WEPA 2018 conference is the Second Workshop on Enumeration Problems and
Applications. It will take place at Department of Computer Science of
University of Pisa, in Pisa (Italy). The conference will take place from
Monday November 5 to Thursday November 8, 2018.


IMPORTANT DATES

Submission of papers: Sep 10, 2018 (AoE)
Acceptance notification: Sep 25, 2018
Registration: Oct 15, 2018
Conference: Nov 5-8, 2018

WEBSITE: wepa2018.di.unipi.it


AIMS AND SCOPE

WEPA is a new 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 Database. 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, this year WEPA will introduce new sessions that are
devoted to ideas, sketches, and open problems: hopefully this will put in
touch senior researchers with junior researchers and graduate students to
investigate problems of theoretical and practical interest. These new
sessions will be informal, with no scheduled presentations, entirely
devoted to the interactions among the participants. The workshop will be
accommodated some 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 (hypergraph dualization, lattices,
functional dependencies,...)
- Input-sensitive algorithms
- Output-sensitive algorithms

There is no registration fee for WEPA this year. However, it is mandatory
to register before 20 October 2018 by sending a message to
wepa2018nov@gmail.com


SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 2 pages
(excluding the references) to be submitted electronically using EasyChair
at the link https://easychair.org/conferences/?conf=wepa2018. Invited
papers and accepted contributions will be invited to contribute to a
special issue in a journal.


INVITED SPEAKERS

Endre Boros (Rutgers University)
Fedor Fomin (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Shin-ichi Minato (Kyoto University)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)


PROGRAM COMMITTEE

Hiroki Arimura (Hokkaido University)
Endre Boros (Rutgers University)
Alessio Conte (National Institute of Informatics, Tokyo)
Nadia Creignou (Aix-Marseille Université)
Fedor Fomin (University of Bergen)
Petr Golovach (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Andrea Marino - PC Chair (University of Pisa)
Arnaud Mary (Laboratoire de Biométrie et Biologie Évolutive, Lyon)
Shin-ichi Minato (Kyoto University)
Lhouari Nourine (University Blaise Pascal, Aubiere)
Romeo Rizzi (University of Verona)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)
Takeaki Uno - PC Chair (National Institute of Informatics, Tokyo)
Kunihiro Wasa (National Institute of Informatics, Tokyo)

LOCAL ORGANIZING COMMITTEE

Alessio Conte
Roberto Grossi - Chair
Shima Moghtasedi
Luca Versari

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

[DMANET] Postdoc in Brno, Czech Rep. (scheduling & planning)

*** Post-doctoral open call FI MU @ Fall 2018

The Faculty of Informatics of Masaryk University (FI MU) in Brno, Czech
Republic <http://www.fi.muni.cz/>, invites applications for
Post-doctoral positions in all areas of Computer Science. See the call

https://www.muni.cz/en/about-us/careers/vacancies/41050

This includes, in particular, the area of

*Scheduling and Planning*

Please contact Hana Rudova <hanka@fi.muni.cz> if you are interested in
these particular topics. You should also send her
- an academic CV, a list of publications
- your three best publications from recent years from above mentioned
areas (references as well as PDF files)
Note that deadline for application is September 30, 2018. However, you
should contact Hana Rudova as early as possible to compare potential
candidates for these areas in advance. More details about corresponding
research topics can be found at

https://www.fi.muni.cz/research/networks/scheduling.html.en

* Offer
The postdoctoral positions are awarded for one year with an extension to
the second year after a review. Gross salary is 50,000 CZK per month
which, with an optional 10% bonus, sums to more than 25,500 EUR per
year. Additional funds of 4,000 EUR per year will be available for
travel and material expenses. Preferred start date of the contract is in
January 2019, but other options can be negotiated.

* Requirements
Candidates must have a Ph.D. degree not older than 4 years at the time
of application, from a university outside of the Czech and Slovak
Republics. In case that the Ph.D. defense is not yet finished, the
candidate must also provide an official letter certifying that his/her
Ph.D. thesis has already been submitted for defense and outlining the
expected schedule of the Ph.D. defense. Candidates with a Ph.D. degree
from a Czech or Slovak university may also be considered if they prove
at least two years of post-doctoral research experience abroad.


--
Hana Rudova, Ph.D.
Associate Professor
Faculty of Informatics, Masaryk University
Botanicka 68a, 602 00 Brno, Czech Republic
hanka@fi.muni.cz
http://www.fi.muni.cz/~hanka
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD Position at TU Hamburg

The Institute of Mathematics at TU Hamburg offers a PhD position
in Discrete Mathematics to work under the supervision of
Prof Anusch Taraz. The focus of our research group lies
on graph theory, probabilistic and extremal combinatorics,
and discrete optimization; and is linked to two of the university's
research centers ("self-organizing wireless networks"
and "logistics and mobility").

We offer a 3-year research assistant position (full time, E13,
and the possibility of extension), with the usual teaching load
of 4 hours per week. The position is available in October 2018,
but a later starting date can be negotiated.

We are looking for an outstanding student with a master's degree in
Mathematics or Computer Science or a closely related field.
Please submit your application as soon as possible, including a
curriculum vitae and an outline of your research interests
to taraz@tuhh.de AND geschaeftsstellepv32@tu-harburg.hamburg.de
(quoting the reference H-18-145).

**********************************************************
*
* 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 position in dynamic graphs at the University of Le Havre Normandy

Postdoctoral position in dynamic graphs at the University of Le Havre Normandy

The work contract should start at the candidate's earliest convenience and will end by September 2019.


Context

The University Le Havre Normandy and LITIS laboratory seek to hire a postdoctoral researcher to join the ASTREOS project (Flows in sociotechnical systems - structure, reliability and control) funded by Normandy region.

Sociotechnical systems are, by their nature, complex systems. Networks are the fundamental model of such systems. Graph theory supported by statistical physics provides tools to characterize and analyze them. But the networks we are interested in are not immutable. They are traversed by flows (of goods, vehicles, money, energy, information and so on) which modify and restructure them all the time. Dynamic graphs (also called time- varying graphs or temporal networks) are therefore the appropriate tool to study the sociotechnical systems.

The postdoctoral researcher will join the RI2C team of LITIS and will work in Le Havre. Most of the team's research activity is structured around dynamic graphs. In particular, the team develops and maintains GraphStream, a software library for modeling and analyzing dynamic graphs.

Job description

Dynamic graphs are relatively new research area and that is why there are many ways to define them. We will retain a description of the dynamics as a stream of discrete elementary events: addition or deletion of a vertex or an edge; change of a value associated to a vertex or an edge. The result of this event stream is a graph that evolves over time.

The research will be guided by the following general question: how to maintain a structure in such a graph? Depending on the problem, this structure could be a spanning tree, a path between two nodes, a community structure, a load distribution between nodes, network flows and so on.

To answer this question, two approaches are considered:
● reoptimization algorithms trying to adapt the structure to the changes in the graph without recomputing from scratch
● distributed heuristic approaches based on agents and swarm intelligence.

The theoretical results of this work will complete the GraphStream library and in particular its dynamic algorithms. They will also feed the applied research within ASTREOS project, particularly in logistics, territorial intelligence and sensor networks.

Desired skills and experience

● PhD in computer science or related field
● Strong background in graph algorithms
● Experience in complex systems and networks
● Background in optimization and/or swarm intelligence
● Good programming skills, especially in Java
● Team spirit and communication skills
● French language is convenient but not required

Contact: stefan.balev@univ-lehavre.fr <mailto:stefan.balev@univ-lehavre.fr>, yoann.pigne@univ-lehavre.fr <mailto:yoann.pigne@univ-lehavre.fr>, eric.sanlaville@univ-lehavre.fr <mailto:eric.sanlaville@univ-lehavre.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] Junior Professor (W1), Mathematics of Uncertainty Quantification (with Tenure Track W2)

Junior Professor (W1) Mathematics of Uncertainty Quantification (with
Tenure Track W2)

at RWTH Aachen University, Faculty of Mathematics, Computer Science and
Natural Sciences

We are seeking qualified applicants for teaching and research in the
area of mathematics related to Uncertainty Quantification. The starting
date is as soon as possible. Candidates are expected to have a visible
research agenda and distinguished expertise in Uncertainty
Quantification with strong competency in at least one of the areas:
mathematical and numerical analysis of stochastic problems, statistics,
applied probability theory or *optimization*. Particular expertise on
data assimilation, molecular dynamics, quantum mechanics, conservation
laws and a posteriori error analysis for stochastic problems will be
specially valued. This position is affiliated with the Chair of
Uncertainty Quantification and the Department of Mathematics. The
successful candidate should on the one hand initiate and develop
interdisciplinary collaborations with other research groups at RWTH, in
particular, engineering and natural sciences. On the other hand, he/she
is expected to further develop the methodological activities within the
Chair of Uncertainty Quantification.

You should have a completed university degree and a special aptitude for
scientific work which is generally verified by means of an outstanding
doctorate. Ability in and commitment to teaching are essential. The
application should include supporting documents regarding success in
teaching. German is not necessary to begin but will be expected as a
teaching language within 5 years.

Please send a cover letter stating research aims and a CV to:

Dekan der Fakultät für Mathematik, Informatik und Naturwissenschaften
der RWTH Aachen University,
Prof. Dr. Stefan Schael,
52056 Aachen, Germany.

You can also send your application via email to
dekan@fb1.rwth-aachen.de. Please note, however, that communication via
unencrypted e-mail poses a threat to confidentiality as it is
potentially vulnerable to unauthorized access by third parties.

The deadline for applications is 21 September 2018.

This position is also available as part-time employment per request.
RWTH Aachen University is certified as a family-friendly university and
offers a dual career program for partner hiring. We particularly welcome
and encourage applications from women, disabled people and ethnic
minority groups, recognizing they are underrepresented across RWTH
Aachen University. The principles of fair and open competition apply and
appointments will be made on merit.

For more information on Mathematics at RWTH Aachen University:
http://www.mathematik.rwth-aachen.de/

--
Prof. Dr. Arie M.C.A. Koster
RWTH Aachen University
Lehrstuhl II für Mathematik
Pontdriesch 10-12, 2.0G, Raum 307
D-52062 Aachen
E: koster@math2.rwth-aachen.de
W: http://www.math2.rwth-aachen.de/~koster/
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct)
F: +49 (0)241 80-92136


**********************************************************
*
* 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, September 6, 2018

[DMANET] [Deadline Extended to Sept 15 2018] FPS 2018, 11th Intl. Symposium on Foundations & Practice of Security, Springer-LNCS Proceedings, Montreal, Canada, 13-14-15 November 2018

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

11th International Symposium on Foundations & Practice of Security
(FPS 2018)

November 13-14-15, 2018 Montreal, Canada

Website: http://fps2018.encs.concordia.ca/

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


Important Dates:
----------------

- Deadline for Short/Position Papers (extended): September 15, 2018
- Deadline for Full Papers (extended): September 15, 2018
- Acceptance Notification (extended): October 15, 2018
- Camera Ready: October 22, 2018
- Conference: November 13-14-15, 2018


Scope:
------

The eleventh edition of FPS will be hosted by Concordia University in
Montreal, Canada, on November 13, 14 and 15 2018. We invite
researchers and practitioners from all countries working in security,
privacy, trustworthy data systems and related areas to participate in
the event.

Protecting the communication and data infrastructure of an
increasingly inter-connected world has become vital to the normal
functioning of all aspects of our world. Security has emerged as an
important scientific discipline whose many multifaceted complexities
deserve the attention and synergy of the mathematical, computer
science and engineering communities.

The aim of FPS is to discuss and exchange theoretical and practical
ideas that address security issues in inter-connected systems. It aims
to provide scientific presentations as well as to establish links,
promote scientific collaboration, joint research programs, and student
exchanges between institutions involved in this important and fast
moving research field.

We also invite papers from researchers and practitioners working in
security, privacy, trustworthy data systems and related areas to
submit their original papers. The main topics, but not limited to,
include:

* Access Control Languages
* Code Reverse Engineering and Vulnerability Exploitation
* Computer and Network Security
* Cryptography & Cryptanalysis
* Data mining & watermarking
* Distributed security protocols & policies
* Formal foundations in information or operational security
* Information theoretic security
* Malware, botnet and advanced persistent threats
* Privacy & sensitive data management
* Policy-based distributed information systems
* Policy-based security architectures
* Security & privacy in digital currencies
* Security & privacy in social networks
* Security in sensor networks and RFIDs
* Security of big-data
* Security of cloud computing, grid computing
* Security of distributed embedded middleware
* Security of P2P systems
* Security of service oriented architectures
* Security management and security policies
* Side channel & physical attacks
* Social engineering
* Threat analysis and trust management


Submissions Guidelines:
-----------------------

All submissions must be written in English. Full papers should be at
most 16 pages, including the bibliography and the appendices.
Committee members are not required to read the appendices, so the
paper should be intelligible without them. Short and Position papers
should be up to 8 pages. Authors should indicate whether their paper
is a 'Position paper' to differentiate them from regular ones
('Position paper' should be mentioned in the title).

Authors must submit their papers by the deadline indicated below,
using the EasyChair web site (using the link
https://easychair.org/conferences/?conf=fps2018) and following the
requirements stated there. All papers will be refereed. The submitted
contribution should be formatted according to Springer's LNCS style
(TeX, Word). Submissions by PhD students as well as surveys and
controversial ideas are encouraged. Case studies (successful or not)
are also encouraged.

Publication:
------------

As in previous editions, proceedings will be published by
Springer-Nature in the Lecture Notes in Computer Science (LNCS)
series. At least one author of each accepted paper must register to
the symposium, by the date indicated by the organizers, and present
the paper.

Committees:
------------

General Chairs:

- Frederic Cuppens (IMT Atlantique, France)

PC Chairs:

- Nur Zincir-Heywood (Dalhousie University, Canada)
- Guillaume Bonfante (Ecole des Mines de Nancy, France)
- Mourad Debbabi (Concordia University, Canada)

Publications & Publicity Chairs:

- Arash Mohammadi (Concordia University, Canada)
- Joaquin Garcia-Alfaro (Telecom SudParis, France)

Organization chair

- Amr Youssef (Concordia University, Canada)

Local Organization Chairs

- Paria Shirani (Concordia University, Canada)
- Jun Yan (Concordia University, Canada)

Steering Committee:

- Frederic Cuppens (Telecom Bretagne, France)
- Nora Cuppens-Boulahia (Telecom Bretagne, France)
- Mourad Debbabi (Concordia University, Canada)
- Joaquin Garcia-Alfaro (Telecom SudParis, France)
- Evangelos Kranakis (Carleton University, Canada)
- Pascal Lafourcade (Universite d'Auvergne, France)
- Jean-Yves Marion (Mines de Nancy, France)
- Ali Miri (Ryerson University, Canada)
- Rei Safavi-Naini (Calgary University, Canada)
- Nadia Tawbi (Universite Laval, Canada)

Program Committee:

- Esma Aimeur (University of Montreal, Canada)
- Jeremy Clark (Concordia University, Canada)
- Nora Cuppens-Boulahia (IMT Atlantique, France)
- Frédéric Cuppens (IMT Atlantique, France)
- Jean-Luc Danger (Télécom Paris-Tech, France)
- Josée Desharnais (Laval University, Canada)
- Samuel Dubus (NOKIA Bell Labs, France)
- Joaquin Garcia-Alfaro (Telecom SudParis, France)
- Dieter Gollmann (Hamburg University of Technology, Germany)
- Sushil Jajodia (George Mason University, USA)
- Bruce Kapron (University of Victoria, Canada)
- Raphaël Khoury (Université du Québec à Chicoutimi, Canada)
- Hyoungshick Kim (Sungkyunkwan University, Republic of Korea)
- Igor Kotenko (SPIIRAS, Russia)
- Evangelos Kranakis (Carleton University Computer Science, Canada)
- Pascal Lafourcade (Université d'Auvergne, France)
- Luigi Logrippo (Université du Québec en Outaouais, Canada)
- Fabio Martinelli (National Research Council of Italy (CNR), Italy)
- Paliath Narendran (University at Albany, USA)
- Guillermo Navarro-Arribas (Universitat Autonoma de Barcelona, Spain)
- Jun Pang (University of Luxembourg, Luxembourg)
- Marie-Laure Potet (VERIMAG, France)
- Silvio Ranise (FBK, Security and Trust Unit, Italy)
- Indrakshi Ray (Colorado State University, USA)
- Michaël Rusinowitch (LORIA-INRIA Nancy, France)
- Natalia Stakhanova (University of New Brunswick, Canada)
- Chamseddine Talhi (École de Technologie Supérieure, Canada)
- Nadia Tawbi (Université Laval, Canada)
- Lingyu Wang (Concordia University, Canada)
- Edgar Weippl (SBA Research, Austria)
- Lena Wiese (Georg-August Universität Göttingen, Germany)
- Xun Yi (RMIT University, Australia)
- Nur Zincir-Heywood (Dalhousie University, Canada)
- Mohammad Zulkernine (Queen's University, Canada)

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

More info at: http://fps2018.encs.concordia.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/
*
**********************************************************

[DMANET] CanaDAM 2019 and Tutte Prize for Best STudent Paper

Dear colleague,

this is to announce the CanaDAM 2019 meeting in Vancouver in May 2019:

https://www.sfu.ca/math/news---events/department-events/canadam-2019.html

as well as the recently created William T. Tutte Prize for Best Student
Paper to be awarded at CanaDAM:

https://www.sfu.ca/content/dam/sfu/math/documents/NewsAndEvents/Events/Canadam2019/TutteAnnouncemnt.pdf


Please circulate, forward and otherwise disseminate both.

Thank you

Gena Hahn
for the Executive Committee of CanaDAM

**********************************************************
*
* 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, September 5, 2018

[DMANET] Two PhD/postdoc positions in proof complexity and logic at the University in Jena, Germany

Two PhD/postdoc positions in theoretical computer science are available at the University of Jena, Germany. Candidates should have an interest and background in one or more of the following areas: proof complexity, algorithms, computional complexity, logic.

The initial duration of the contract will be 3 years with a possibility for an extension. The positions are available from October, the start date is negotiable. The positions carry a modest teaching load which can be delivered in English.

For applications and enquiries please contact Olaf Beyersdorff (olaf.beyersdorff@uni-jena.de<mailto:olaf.beyersdorff@uni-jena.de>).



Prof. Dr. Olaf Beyersdorff
Institut für Informatik
Friedrich-Schiller-Universität Jena
Ernst-Abbe-Platz 2, 07743 Jena
Phone: +49 (0)3641 946321
Email: olaf.beyersdorff@uni-jena.de<mailto:oalf.beyersdorff@uni-jena.de>
https://www.fmi.uni-jena.de/Beyersdorff.html

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

[DMANET] Research Assistant Position on Theoretical Modelling and Verification of Wireless Networked Automatic Assistant Systems

The Computer Science department of the University Koblenz-Landau
  (Campus Koblenz) invites applications for the position of a

                        research assistant
         (wissenschaftlicher Mitarbeiter/Mitarbeiterin)
                        (1,0 EGr. 13 TV-L)

at PhD level, in the research groups ``Formal methods and theoretical
computer science'' (Prof. Dr. Viorica Sofronie-Stokkermans) and
``Computer Networks'' (Prof. Dr. Hannes Frey).

The position is available for 2 years. A further extension is
planned.

The prospective scientific assistant will study theoretical modelling
and verification of wireless networked automatic assistant systems
like driver assistant systems, self-organizing fleet management, air
traffic management, or UAV swarm robotics. We consider systems where
information is incomplete and imprecise due to faulty wireless
communication channels.

The goal is to analyze and compare different system models where
information about own data (e.g. position), communication channels
(e.g. quality of the wireless connection, strength of the received
signal), other systems and the environment is not given precisely but
assumed to be within some analytically described error margin. In
this connection stochastic models and stochastic modeling tools of
systems are to be applied.

We expect to obtain new insights about the links between classical
verification of incompletely specified systems, or systems with
imprecise information on the one hand, and possibilities for
probabilistic verification of stochastically modeled wireless
networked systems (possibly with links to stochastic geometry) on the
other hand.

Besides participation in research the position includes teaching
obligations in theoretical and technical fields of computer science.

Applicants should have a MSc degree (or comparable University degree)
in computer science, mathematics or a related discipline.

Application letters (including a CV) must be sent by e-mail as a
single .pdf file to:

          bewerbung@uni-koblenz-landau.de

*** In the subject line please indicate your name and the position
number 101/2018 ***

To receive full consideration, applications should be received by
September 30, 2018. Applications sent after this date will be
considered until the position is filled.


======================================
Position code number: 101/2018
Application deadline: 30 September 2018
=======================================


--
Prof. Dr. Hannes Frey
AG Rechnernetze
Universität Koblenz-Landau

**********************************************************
*
* 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 theoretical computer science at the University of Warwick, UK

The Theory and Foundations group in the Department of Computer Science at the
University of Warwick, UK, is inviting applications for fully funded PhD
positions in theoretical computer science. The group works on various aspects
of theoretical computer science such as:

* automata and formal languages,
* logic and games,
* algorithmic game theory,
* online and dynamic algorithms,
* sublinear and streaming algorithms,
* parameterized complexity and structural graph theory,
* string algorithms and parallel algorithms, and
* approximation algorithms.

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

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

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

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

If you are interested in this opening, please send an email (with the phrase
"Application for PhD position" in the subject line) by 01 October 2018 to
either Dr Dmitry Chistikov <d.chistikov@warwick.ac.uk> or Dr Sayan
Bhattacharya <S.Bhattacharya@warwick.ac.uk> with a short CV including names
and email addresses of 2 referees. Later applications will be considered
subject to the availability of funding.

You are encouraged to informally contact Dmitry, Sayan and/or other members of
the group you might want to work with prior to that.

We also expect to advertise further positions in the future.

Permanent members of the group:

* Sayan Bhattacharya
* Dmitry Chistikov
* Graham Cormode
* Artur Czumaj (group leader)
* Matthias Englert
* Marcin Jurdzinski
* Dan Kral
* Ranko Lazic
* Mike Paterson
* Ramanujan Sridharan
* Alex Tiskin

https://warwick.ac.uk/fac/sci/dcs/research/focs/people/

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

[DMANET] FOCS 2018 - early registration deadline on Sunday

This is a kind reminder that the deadline for the early rate registration fees for FOCS 2018 is this
Sunday, September 9, 2018.


===================================
FOCS 2018 - Second Call for Participation
===================================


https://www.irif.fr/~focs2018/ <https://www.irif.fr/~focs2018/>


The 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018) will take place in Paris, France, on 7-9 October 2018, with workshops and tutorials on October 6.

The program is now available, together with the list of the workshops/tutorials (as well as a list of a number of co-located events), on the conference webpage.

Early registration rate ends September 9, 2018.

All scientific and local information, and a link to the registration page, can be found at https://www.irif.fr/~focs2018/ <https://www.irif.fr/~focs2018/> .

Looking forward to seeing you in Paris !


**********************************************************
*
* 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, September 4, 2018

[DMANET] CfP: CSR 2019 (14th International Computer Science Symposium in Russia, July 1-5, 2019, Novosibirsk, Russian Federation)

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

First Call for Papers

14th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2019)

July 1-5, 2019, Novosibirsk, Russia

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

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

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. A selection of
accepted papers will be published in a special issue of the Springer journal, "Theory
of Computing Systems".

CSR'19 will be part of the Computer Science Summer in Russia (http://cssr.nsu.ru) which
will also include the Ershov Informatics Conference (PSI'19) and Summer School in
Computer Science for students.


IMPORTANT DATES

Deadline for submissions:      December 23, 2018
Notification of acceptance:    February 13, 2019
Conference dates:              July 1-5, 2019

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

VENUE

Novosibirsk is the 3rd largest city in Russia and a major hub in Western Siberia.
It is easily accessible either via Moscow or Saint Petersburg, or by a direct flight
from Еurope (Frankfurt, Dusseldorf, Prague, Thessaloniki) or Asia (Tokyo, Seoul,
Hongkong, Shanghai, Beijing or Bangkok).
The conference will take place at Novosibirsk University located in Akademgorodok --
a picturesque "academic town" about 30km south from the main city of Novosibirsk.

TOPICS include, but are not limited to:

* algorithms and data structures
* computational complexity
* randomness in computing, approximation algorithms
* combinatorial optimizaiton, constraint satisfaction
* computational geometry
* formal languages and automata
* codes and cryptography
* combinatorics in computer science
* applications of logic to computer science, proof complexity
* fundamentals of machine learning
* theoretical aspects of big data

DISTINGUISHED OPENING LECTURE

Andrew Yao (Tsinghua U, China)

CONFIRMED INVITED SPEAKERS

to be announced

PROGRAM COMMITTEE

Maxim Babenko (Yandex/HSE Moscow, RU)
Petra Berenbrink (U Hamburg, DE)
Olaf Beyersdorff (U Jena, DE)
René van Bevern (Novosibirsk State U, RU)
Manuel Bodirsky (TU Dresden, DE)
Vladimir Braverman (Johns Hopkins U, US)
Holger Dell (Saarland U, DE)
Nachum Dershowitz (Tel Aviv U, IL)
Michael Elkin (Ben-Gurion U, IL)
Pierre Fraigniaud (CNRS & U Paris Diderot, FR)
Anna Frid (Aix-Marseille U, FR)
Pawel Gawrychowski (U Wrocław, PL)
Dora Giammarresi (U Rome, IT)
Elena Grigorescu (Purdue U, US)
Gregory Kucherov (CNRS & U Paris-Est Marne-la-Vallée, FR), chair
Christophe Paul (CNRS & U Montpellier FR)
Valentin Polishchuk (Linköping U, SE)
Artem Pyatkin (Sobolev Inst. of Mathematics & Novosibirsk State U, RU)
Alexander Rabinovich (Tel-Aviv U, IL)
Kunihiko Sadakane (U Tokyo, JP)
Arseny Shur (Ural Federal U, RU)
Igor Walukiewicz (CNRS & U Bordeaux, FR)
Jacobo Torán (U Ulm, DE)
Sergey Yekhanin (Microsoft Research, US)

CONFERENCE CHAIR

René van Bevern (Novosibirsk State U, RU)

ORGANIZING COMMITTEE

Denis Ponomaryov (A.P. Ershov Inst. of Informatics Systems, Novosibirsk, RU)
Anastasia Karpenko (Novosibirsk State U)
Oxana Tsidulko (Sobolev Inst. of Mathematics, Novosibirsk)

STEERING COMMITTEE

Edward A. Hirsch (St. Petersburg Dept. of Steklov Inst. of Mathematics, RU)
Juhani Karhumäki (U Turku, FI)
Alexander Kulikov (St. Petersburg Dept. of Steklov Inst. of Mathematics, RU)
Ernst W. Mayr (Technische Universität München, DE)
Alexander Razborov (U of Chicago, USA and Steklov Inst. of Mathematics, Moscow, RU)
Mikhail Volkov (Ural Federal U, RU)

SUBMISSIONS

Authors are invited to submit papers presenting original research in the conference topics,
in electronic form (pdf format) via EasyChair at https://easychair.org/conferences/?conf=csr19
Submissions must be unpublished, not under review for publication elsewhere,
and provide sufficient information to judge their merits.
Submissions must be in English, and not exceed 12 pages, including the title page, in
Springer's LNCS LaTeX style. Additional material, to be read at the discretion of reviewers and PC
members, may be provided in a clearly marked appendix or by reference to a manuscript on a web site.

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

-- 
Dr. rer. nat. René van Bevern
Head of Algorithmics Laboratory
Department of Mechanics and Mathematics
Novosibirsk State University,
Novosibirsk, Russian Federation
**********************************************************
*
* 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, September 3, 2018

[DMANET] WEPA 2018 EXTENDED DEADLINE

WEPA 2018 EXTENDED DEADLINE

WEPA 2018: Second Workshop on Enumeration Problems and Applications
November 5-8, Department of Computer Science, University of Pisa, Pisa
Submission Deadline: Sep 10, 2018 (AoE)
Notification: Sep 25, 2018

The WEPA 2018 conference is the Second Workshop on Enumeration Problems and
Applications. It will take place at Department of Computer Science of
University of Pisa, in Pisa (Italy). The conference will take place from
Monday November 5 to Tuesday November 8, 2018.


IMPORTANT DATES

Submission of papers: Sep 10, 2018 (AoE)
Acceptance notification: Sep 25, 2018
Registration: Oct 15, 2018
Conference: Nov 5-8, 2018

WEBSITE: wepa2018.di.unipi.it


AIMS AND SCOPE

WEPA is a new 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 Database. 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, this year WEPA will introduce new sessions that are
devoted to ideas, sketches, and open problems: hopefully this will put in
touch senior researchers with junior researchers and graduate students to
investigate problems of theoretical and practical interest. These new
sessions will be informal, with no scheduled presentations, entirely
devoted to the interactions among the participants. The workshop will be
accommodated some 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 (hypergraph dualization, lattices,
functional dependencies,...)
- Input-sensitive algorithms
- Output-sensitive algorithms

There is no registration fee for WEPA this year. However, it is mandatory
to register before 20 October 2018 by sending a message to
wepa2018nov@gmail.com


SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 2 pages
(excluding the references) to be submitted electronically using EasyChair
at the link https://easychair.org/conferences/?conf=wepa2018. Invited
papers and accepted contributions will be invited to contribute to a
special issue in a journal.


INVITED SPEAKERS

Endre Boros (Rutgers University)
Fedor Fomin (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Shin-ichi Minato (Kyoto University)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)


PROGRAM COMMITTEE

Hiroki Arimura (Hokkaido University)
Endre Boros (Rutgers University)
Alessio Conte (National Institute of Informatics, Tokyo)
Nadia Creignou (Aix-Marseille Université)
Fedor Fomin (University of Bergen)
Petr Golovach (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Andrea Marino - PC Chair (University of Pisa)
Arnaud Mary (Laboratoire de Biométrie et Biologie Évolutive, Lyon)
Shin-ichi Minato (Kyoto University)
Lhouari Nourine (University Blaise Pascal, Aubiere)
Romeo Rizzi (University of Verona)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)
Takeaki Uno - PC Chair (National Institute of Informatics, Tokyo)
Kunihiro Wasa (National Institute of Informatics, Tokyo)

LOCAL ORGANIZING COMMITTEE

Alessio Conte
Roberto Grossi - Chair
Shima Moghtasedi
Luca Versari

**********************************************************
*
* 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] Vacancy for faculty position in Discrete Optimization (TU Eindhoven)

Eindhoven University of Technology (the Netherlands) announces a
vacancy for an assistant/associate professor in the field of Discrete
Optimization, or related areas. The vacancy is positioned in the
Discrete Mathematics section, within the group Combinatorial
Optimization, of the Department of Mathematics and Computer Science.

For more information about the vacancy and how to apply, we refer to
https://jobs.tue.nl/nl/vacature/assistant-associate-professor-in-discrete-optimization-351050.html

The deadline for applying is November 1, 2018.
Any additional information can be requested from Frits Spieksma
(f.c.r.spieksma@tue.nl, +31 40 247 5694).
**********************************************************
*
* 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] JELIA 2019 - Preliminary Call for Papers

= PRELIMINARY Call for Papers =

16th European Conference on Logics in Artificial Intelligence (JELIA 2019)
May 8-10, 2019, Rende, Italy


== Aim and Scope ==

The aim of JELIA 2019 is to bring together active researchers interested
in all aspects concerning the use of logics in Artificial Intelligence to
discuss current research, results, problems, and applications of both
theoretical and practical nature. JELIA strives to foster links and
facilitate cross-fertilization of ideas among researchers from various
disciplines, among researchers from academia and industry, and between
theoreticians and practitioners.

Authors are invited to submit papers presenting original and unpublished
research in all areas related to the use of logics in Artificial
Intelligence. Conference topics include, but are not limited to:

Abductive and inductive reasoning
Answer set programming
Applications of logic-based AI systems
Argumentation systems
Automated reasoning including satisfiability checking and its extensions
Computational complexity and expressiveness
Deep learning for rules and ontologies
Deontic logic and normative systems
Description logics and other logical approaches to Semantic Web and
ontologies
Explanation finding
Knowledge representation, reasoning, and compilation
Logic programming, answer set programming, constraint logic programming
Logic-based data access and integration
Logical interpretation of machine learning models
Logics for uncertain and probabilistic reasoning
Logics in machine learning
Logics in multi-agent systems, games, and social choice
Neural networks and logic rules
Non-classical logics, such as modal, temporal, epistemic, dynamic,
spatial, paraconsistent, and hybrid logics
Nonmonotonic logics, default logics, conditional logics
Ontology formalisms and models
Ontology-based query answering
Ontology-based reasoning
Planning and diagnosis based on logic
Preferences
Reasoning about actions and causality
Updates, belief revision and nonmonotonic reasoning


== Submissions ==

JELIA 2019 welcomes submissions of long or short papers in the following
categories:

A. Regular papers: Submissions should contain original research, and
sufficient detail to assess the merits and relevance of the contribution.
Submissions must not have been previously published or be simultaneously
submitted for publication elsewhere.

B. System/Application descriptions: Submissions should describe an
implemented system/application and its application area(s). A
demonstration should accompany a system/application presentation. Papers
describing systems or applications that have already been presented in
JELIA before will be accepted only if significant and clear enhancements
have been implemented and are properly reported.

All submissions should not exceed 13 (resp., 6) pages for long (resp.,
short) papers, including figures etc., but excluding references, and
should be written in English. Submissions must be formatted according to
the standard Springer LNCS style, and are not anonymous. The conference
proceedings of JELIA 2019 will be published by Springer-Verlag in the
Lecture Notes in Artificial Intelligence, a sub-series of Lecture Notes in
Computer Science (Important note: Springer will require all the LaTeX
source files of all accepted submissions).

Policy on Multiple Submission: JELIA 2019 will not accept any paper which,
at the time of submission, is under review or has already been published
or accepted for publication in a journal or another conference. Authors
are also required not to submit their papers elsewhere during JELIA's
review period. However, these restrictions do not apply to previous
workshops with a limited audience and without archival proceedings.

JELIA 2019 (abstract and paper) submissions are handled through the
EasyChair conference management system:
https://easychair.org/conferences/?conf=jelia2019.


== Important Dates ==

(tentative)
November 26th, 2018, 23:59 UTC-12: Abstract submission
December 3rd, 2018, 23:59 UTC-12: Paper submission
January 16th, 2019: Notification of acceptance
February 28th, 2019: Camera-ready due
March 1st, 2019: Online registration opens


== Venue ==

University of Calabria, Rende, Italy


== Further Information ==

WWW: https://jelia2019.mat.unical.it/
Email: jelia2019@mat.unical.it


== Committees ==

=== General Chair ===
Nicola Leone – University of Calabria, Italy

=== Program Chairs ===
Francesco Calimeri – University of Calabria, Italy
Marco Manna – University of Calabria, Italy

=== Organization Chairs ===
Carmine Dodaro – University of Genova, Italy
Valeria Fionda – University of Calabria, Italy

=== Publicity Chair ===
Simona Perri - University of Calabria, Italy

=== Finance Chair ===
TBA

=== Program Committee ===
TBA


**********************************************************
*
* 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] Hausdorff Center for Mathematics: W2-Professorships ("Bonn Junior Fellows")

The Hausdorff Center for Mathematics (HCM) at the University of Bonn
brings together researchers in Theoretical and Applied Mathematics, and
Mathematical Economics. In this framework, the center is looking forward
to filling up to four W2-Professorships ("Bonn Junior Fellows").

These are temporary positions for a period of five years.
http://www.hcm.uni-bonn.de/opportunities/bonn-junior-fellows/official-announcement/

Daniela Schmidt

Administrative Assistant
Hausdorff Center for Mathematics
Endenicher Allee 62, Villa Maria, Room 0.005
53115 Bonn
Tel: +49-228-73-4881, Fax: +49-228-73-62251
E-Mail: daniela.schmidt@hcm.uni-bonn.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Announcement: 2nd Conference on Mathematics of Gas Transport

2nd Conference on Mathematics of Gas Transport
October 10-11, 2018
Zuse Institute Berlin
Takustr. 7, 14195 Berlin, Germany

After the great success of the 1st Mathematics of Gas Transport Conference in 2016, the Research Campus MODAL and the CRC TRR154-2 present the 2nd Conference Mathematics of Gas Transport at ZIB October 10th to 11th 2018.

It is our aim to bring leading experts of different fields together who are interested in today's challenges in gas transport. These include but are not limited to mathematicians, computer scientists, engineers and practitioners. The focus is to offer a platform for discussions between the various disciplines.

One day will point to latest research challenges, in particular related to mathematical issues that are studied in the CRC TRR 154-2. On the other day practitioners in the field of gas transport will address practical issues of their daily business.

Registration is now open at http://mog2.zib.de/content/registration.html

Please stay tuned for more information on the program at the conference website http://mog2.zib.de/

We are looking forward to welcome you in Berlin.

Thorsten Koch, Alexander Martin and the FC MODAL and TRR 154 team


**********************************************************
*
* 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, September 2, 2018

[DMANET] 8th edition of the Winter School on Network Optimization (second announcement)

The 8th edition of the Winter School on Network Optimization will take place at Hotel Estoril-Éden, Monte Estoril, from the 14th to the 18th of January 2019. Its main objective is to provide an opportunity for PhD students to get together and attend high level courses in the field of Network Optimization. Non-PhD students are welcome to attend the school, but the number of participants is limited and priority will be given to PhD students. In this edition of the school, the lecturers and subjects to be addressed are:

Markus Leitner (Univ. of Vienna) - Layered graph approaches for combinatorial optimization problems;

William Cook (Univ. of Waterloo) - The Traveling Salesman Problem and Computational Discrete Optimization;

Thomas Stuetzle (Univ. Libre de Bruxelles - IRIDIA) - Towards Automated Algorithm Design: Advances and Perspectives;

Francisco Saldanha da Gama (Univ. de Lisboa) - Logistics network design: capturing uncertainty and risk;

Tolga Bektas (Univ. of Southampton) - Compact formulations, projections and some polyhedral results for the vehicle routing problem.

The school is part of the activities of the of the ENOG (European Network Optimization Group)? and of

CMAFCIO (Centro de Matemática, Aplicações Fundamentais e Investigação Operacional) University of Lisbon as well as .

The event is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).

Potential participants are invited to submit their CVs to the address NetOpt2019@fc.ul.pt no later than the 31st October .

Further information is available in the webpage (http://netopt2019.campus.ciencias.ulisboa.pt<http://netopt2019.campus.ciencias.ulisboa.pt/>) ???


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

[DMANET] Final CFP- 8th World Congress on ICT ’18 - Springer - India

Final Call for Papers

Due to numerous requests from authors, the paper submission deadline has
been extended to September 30, 2018

Apologies for cross-posting. Kindly help to distribute this final CFP to
your mailing list.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

-- The 8th World Congress on Information and Communication Technologies
(WICT'18) --

http://www.mirlabs.org/wict18
http://www.mirlabs.net/wict18

Indexed by: SCOPUS, Thomson ISI Web of Science, DBLP etc.
History of WICT series: http://www.mirlabs.net/wict18/previous.php

WICT 2018: Scopus & UGC Approved Proceedings
All accepted and registered papers will be published in AISC Series of
Springer, indexed in ISI Proceedings, EI-Compendex, DBLP, SCOPUS, Google
Scholar and Springerlink. (Listed in UGC approved list, please refer List
1- Page 32 - S.No. - 1375) (
http://www.ugc.ac.in/pdfnews/8919877_Journals-1.pdf)

** Important Dates **
-------------------------
Paper submission due: September 30, 2018 (Extended)
Notification of paper acceptance: October 21, 2018
Registration and Final manuscript due: November 10, 2018
Conference: December 17 - 19, 2018

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

About WICT'18:
--------------
WICT'18 aims to provide an opportunity for the researchers from academia
and industry to meet and discuss the latest solutions, scientific results
and methods in the usage and applications of ICT in the real world. The
conference programme includes workshops, special sessions and tutorials,
along with prominent keynote speakers and regular paper presentations in
parallel tracks. In the past century, our society has been through several
periods of dramatic changes, driven by innovations such as transportation
systems, telephone etc. Last few decades have experienced technologies that
are evolving so rapidly, altering the constraints of space and time, and
reshaping the way we communicate, learn and think. Rapid advances in
information technologies and other digital systems are reshaping our
ecosystem. Innovations in ICT allow us to transmit information quickly and
widely, propelling the growth of new urban communities, linking distant
places and diverse areas of endeavor in productive new ways, which a decade
ago was unimaginable. Thus, the theme of this World Congress is "Innovating
ICT For Social Revolutions". All accepted and registered papers will be
included in the conference proceedings expected to be published by Springer.

Topics (not limited to)
----------------------------------------
Bioinformatics and Computational Biology
Computer Graphics and Virtual Reality
Data Mining
e-Learning
e-Business
e-Government
Artificial Intelligence
Web Services and Semantic Web
Grid and Cloud Computing
Ambient Intelligence
Body Sensor Networks
Computational Finance and Economics
Cybercrime (Legal and Technical Issues)
Computer Network Security
Data Mining for Information Security
Academic Integrity, Plagiarism Detection and Software Misuse
Intrusion Detection and Forensics
Scheduling For Large Scale Distributed System
Nature Inspired Optimization Algorithms and Their Applications
The Role of Technology in Education and Health
Data Management
Collaborative Design in Knowledge-based Environment
Software Engineering

~~~~~~~~~~~~~~~~~~~~~~
Submission Guidelines:
----------------------
Submission of paper should be made through the submission page from the
conference web page. Please refer to the conference website for guidelines
to prepare your manuscript.

Paper format templates:
http://www.springer.com/series/11156

WICT'18 Submission:
https://easychair.org/conferences/?conf=wict2018

~~~~~~~~~~~~~~~~~~~~~~~~
* Organizing Committee *
-------------------------
General Chairs:
Ajith Abraham, Machine Intelligence Research Labs, USA
Preethi Thekkath, Toc H Institute of Science &Technology, India

Program Co-Chairs
Simone Ludwig, North Dakota State University, USA
Millie Pant, Indian Institure of Technology - Roorkee, India
Antonio J. Tallón-Ballesteros, University of Seville, Spain
Rasmi P S, Toc H Institute of Science &Technology,India

Technical Committee (Please refer website):
http://www.mirlabs.net/wict18/committees.php

For technical contact:
----------------------
Ajith Abraham
Email: ajith.abraham@ieee.org


--
Sanju Mishra Tiwari
Research Associate
Department of Computer Applications
National Institute of Technology
Kurukshetra

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

Saturday, September 1, 2018

[DMANET] Extended CFP: "Efficient Data Structures" special issue of Algorithms

EXTENDED CALL FOR PAPERS:
"Efficient Data Structures" -- A special issue of Algorithms (ISSN 1999-4893)

For this special issue of Algorithms, we would like to invite articles dealing
with the design, formal analysis, implementation, and experimental evaluation
of efficient data structures for all kinds of computational problems.
Of particular interest are algorithms for constructing data structures and
extracting information from them efficiently.
Articles focusing on complexity aspects of data structures related to
time-space tradeoffs, information-theoretic entropy, and lower bounds in
various models of computation are also welcome.

Guest Editor:
Dr. Jesper Jansson, The Hong Kong Polytechnic University

Keywords:
* Succinct data structures for strings, trees, and graphs
* Probabilistic data structures
* Dynamic data structures
* Geometric data structures
* Distributed data structures
* Classic data structures
* Lower bounds
* Implementations

Submission information:
Research articles, review articles as well as short communications are
invited.
Submitted manuscripts should not have been published previously nor be under
consideration for publication elsewhere, except for in conference proceedings.
All submissions will be thoroughly refereed through a peer-review process.
Manuscripts should be submitted online at www.mdpi.com after registering and
logging in.
Accepted articles will be published continuously in the journal (as soon as
accepted) and will be listed together on the special issue website.
A guide for authors and other information related to the submission of
manuscripts is available on the "Instructions for Authors" page.
The article processing charge for publication in this open access journal is
also listed on the journal's webpage.

Deadline:
The extended deadline for manuscript submissions is 30 November 2018.

About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is an international open access
journal of computer science, theory, methods and interdisciplinary
applications, data and information systems, software engineering, artificial
intelligence, automation, and control systems.
It is published online quarterly by MDPI.

Journal webpage:
http://www.mdpi.com/journal/algorithms

Special issue main webpage:
http://www.mdpi.com/journal/algorithms/special_issues/Efficient_Data_Structures

Instructions for authors:
http://www.mdpi.com/journal/algorithms/instructions

Submission:
http://susy.mdpi.com/user/login


**********************************************************
*
* 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] Developing Countries - Resources online --- IFORS

Dear Colleagues,

The aim of the IFORS Developing Countries On-Line Resources page is to
offer the OR worker all publicly-available materials on the topic of
OR for Development. It also aims to provide a venue for people who are
working in the area to share their completed or in-process work, learn
from others, and stimulate comments and discussions on the work.

Regarding IFORS Developing Countries OR resources website, its regular
updates - and your possible submission of "free" (not copyright protected)
material, you might occasionally visit

[ http://ifors.org/developing_countries/index.php?title=Main_Page | http://ifors.org/developing_countries/index.php?title=Main_Page ] .


"Operational Research" (OR) is the discipline of applying advanced
analytical methods to help make better decisions. By using techniques
such as problem structuring methods and mathematical modelling to
analyze complex situations, Operational Research gives executives the
power to make more effective decisions and build more productive
systems.

The International Federation of Operational Research Societies (IFORS;
[ http://ifors.org/ | http://ifors.org/ ] ) is an almost 60-year old organization which is
currently composed of 51 national societies.

Regional Groups of IFORS are:

ALIO (The Latin American Ibero Association on Operations Research),
APORS (The Association of Asian-Pacific Operational Research Societies),
EURO (The Association of European Operational Research Societies),
NORAM (The Association of North American Operations Research Societies).

IFORS conferences are taking place every three years; IFORS 2017 has been
successfully celebrated in Quebec City, Canada.


Thank you very much for your attention.

With kind regards,
best wishes,


Luciana Buriol, Sue Merchant, Gerhard-Wilhelm Weber


PS: Feedback is welcome via [ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | buriol@inf.ufrgs.br ] , [ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | suemerchant@hotmail.com ] ,
[ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | gerhard.weber@put.poznan.pl ] .

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