[DMANET] updated Call for Papers for AofA 2018

Update: Authors of selected accepted extended abstracts will be invited
to submit full papers for peer review to a special AofA issue (published
circa late 2019) of the journal /Algorithmica/.

=====

Call for Papers

29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms (AofA 2018)

Uppsala, Sweden,  June 25-29, 2018

The 29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms will be held in Uppsala, Sweden, June
25-29, 2018. The website of the event is

http://www.math.uu.se/math.uu.se/department-of-mathematics/AofA2018 .

Program Committee:

    Olivier Bodini, Paris 13, France
    Michael Drmota, TU Vienna, Austria
    James Allen Fill (chair), Johns Hopkins Univ., USA
    Antoine Genitrini, Paris 6, France
    Zbigniew Golebiewski, Wroclaw U. Sci. Tech., Poland
    Cecilia Holmgren, Uppsala U., Sweden
    Hsien-Kuei Hwang, Academic Sinica, Taiwan
    Svante Linusson, KTH, Sweden
    Manuel Lladser, U. Colorado, USA
    Cécille Mailler, Univ. Bath, UK
    Markus Nebel, Bielefeld Univ., Germany
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Daniel Panario, Carleton Univ., Canada
    Bruno Salvy, INRIA Lyon, France
    Robert Sedgewick, Princeton Univ., USA
    Wojciech Szpankowski, Purdue Univ., USA
    Stephan Wagner, Stellenbosch Univ., South Africa
    Mark Daniel Ward, Purdue Univ., USA

Steering Committee:

    Nicolas Broutin, INRIA Rocquencourt, France
    Hsien-Kuei Hwang, Academia Sinica, Taiwan
    Conrado Martinez, UPC Barcelona, Spain
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Robert Sedgewick (chair), Princeton Univ., USA
    Michèle Soria, Paris 6, France

Organization/Contact:

    Cecilia Holmgren, Uppsala University, Sweden
(cecilia.holmgren@math.uu.se)
    Sofie White, Uppsala, Sweden (sofie.c.white@gmail.com)
    James Allen Fill, Johns Hopkins University, USA (jimfill@jhu.edu)

Scope:

Analysis of algorithms is a scientific basis for computation, providing
a link between abstract algorithms and the performance characteristics
of their implementations in the real world. The general effort to
predict precisely the performance of algorithms has come to involve
research in analytic combinatorics, the analysis of random discrete
structures, asymptotic analysis, exact and limiting distributions, and
other fields of inquiry in computer science, probability theory, and
enumerative combinatorics.  See http://aofa.cs.purdue.edu/ .

We invite papers in

    * analytic algorithmics and combinatorics
    * probabilistic analysis of algorithms
    * randomized algorithms

We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.

Keynote speakers (confirmed):

    Louigi Addario-Berry, McGill University, Canada
    Béla Bollobás, Univ. of Cambridge, UK and Univ. of Memphis, USA
    Karen Gunderson, University of Manitoba, Canada
    Olle Häggström, Chalmers University of Technology, Sweden
    Svante Janson, Uppsala University, Sweden
    Mihyun Kang, Graz University of Technology, Austria
    Mark Daniel Ward, Purdue University, USA

Flajolet Award Lecture:

    Luc Devroye, McGill University, Canada

Submissions:

We invite you to submit an extended abstract (12 pages) or a short
abstract for a poster (2 pages) via the EasyChair system:

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

The proceedings will be published electronically.  Authors of selected
accepted extended abstracts will be invited to submit full papers for
peer review to a special AofA issue (published circa late 2019) of the
journal Algorithmica.

Important dates:

    Submission deadline: February 8, 2018
    Notification: April 8, 2018
    Final version: May 8, 2018

If you intend to submit a paper, please consider submitting a title and
a short abstract early.

**********************************************************
*
* 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] OR in the Physical Internet at EURO 2018

Dear colleague,

You are invited to submit an abstract for the 29th European Conference on Operational Research in session OR in the Physical Internet organized by Elsa Silva, António Ramos and José Fernando Oliveira.

The 29th European conference on Operational Research, will be held from 8 ‑ 11 July 2018, in Valencia. Details can be found at <http://euro2018valencia.com/> http://euro2018valencia.com/.

The new Physical Internet paradigm for supply chain management represents a real and viable alternative to meet the challenges posed. Physical Internet relies on collaborative management models and the extension of the normalized containerization paradigm to all levels of cargo movement and handling to provide a fast, productive, reliable and sustainable supply chain.

This approach introduces new challenges to the majority of operation research problems addressed within a supply chain scope like the vehicle routing problem or the container loading problem, whether by introducing new constraints or by modifying the current ones.

SUBMISSION GUIDELINES

To be considered for presenting an invited abstract in the OR in the Physical Internet stream, submit an abstract (1500 characters maximum, text only ‑ no formulas) summarising the research. You may submit through the euro-online website ( <https://www.euro-online.org/conf/euro29/> https://www.euro-online.org/conf/euro29/). You will need a euro account and can create one here if you do not have one.

Use the option to submit an abstract in an organised stream.
Enter code 5f700f69 and click submit invited abstract.

Important Dates

Abstract Submission deadline: 5th March 2018

Notification of Acceptance: 30th March 2018

Elsa Silva
Centro de Engenharia e Gestão Industrial
Centre for Industrial Engineering and Management

INESC TEC
Campus da FEUP
Rua Dr Roberto Frias
4200-465 Porto
Portugal

T +351 22 2094365
F +351 22 209 4050
<mailto:elsa.m.silva@inesctec.pt> elsa.m.silva@inesctec.pt
<http://www.inesctec.pt/> www.inesctec.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] [DEADLINE EXTENDED] The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)

The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)
http://sara.unisalento.it/~cafaro/WPDM2018/

CALL FOR PAPERS

As part of The 18th International Conference on Computational Science and Its Applications (ICCSA 2018), http://www.iccsa.org

July 2 - 5 2018, Melbourne, Australia

Submission Deadline: March 8, 2018

SPECIAL ISSUE

Selected extended versions of workshop papers will be invited to a Special Issue to appear in the Algorithms journal (see http://www.mdpi.com/journal/algorithms/special_issues/Parallel_Distributed_Data_Mining)

SCOPE AND OBJECTIVES

The Workshop on Parallel and Distributed Data Mining is an international forum which brings together researchers and practitioners working on different high-performance aspects of data mining algorithms, enabling novel applications. Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications. Therefore, there is an increasing interest in the design and implementation of parallel data mining algorithms. On parallel computers, by exploiting the vast aggregate main memory and processing power of processors and accelerators, parallel algorithms can easily address both the running time and memory requirement issues. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of data mining algorithms and applications. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance data mining algorithms and applications, and related topics.

The WPDM Workshop topics include (but are not limited to) the following:

- Parallel data mining algorithms using MPI and/or OpenMP
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Parallel data mining applications exploiting FPGA
- Distributed data mining algorithms
- Benchmarking and performance studies of high-performance data mining applications
- Novel programming paradigms to support high-performance computing for data mining
- Performance models for high-performance data mining applications and middleware
- Programming models, tools, and environments for high-performance computing in data mining
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

INSTRUCTIONS FOR PAPER SUBMISSIONS

You are invited to submit original and unpublished research works on above topics. Submitted papers must not have been published or simultaneously submitted elsewhere. The submitted paper must be between 10 to 16 pages long and formatted according to the Springer LNCS (Lecture Notes in Computer Science) rules, Guidelines and templates can be found at the url http://www.springer.com/it/computer-science/lncs/conference-proceedings-guidelines

To submit a paper, please connect to the Submission site from the link available at the ICCSA 2018 web site: http://ess.iccsa.org.
Only papers submitted through the electronic system and strictly adhering to the relevant format will be considered for reviewing and publication. Please pay attention, when submitting your contribution to the workshop, to select the right entry in the listbox shown in the submission form.

CONFERENCE POLICY

By submitting the paper to ICCSA conference, all authors agree to abide by all ICCSA conference paper submission, publication and presentation policies. Namely, authors confirm that the work is original, has not appeared in literature in any form in the past and will not be submitted to any other venue concurrently with ICCSA submission or until it appears in ICCSA proceedings (in the case of acceptance). Furthermore, upon paper acceptance, authors agree to transfer copyright on the accepted paper to ICCSA, and one of the authors will register the paper and present the paper at the event. No paper withdrawals can be accepted after Conference pre-registration date or within three months of the actual event, whichever date comes first. Paper withdrawal request can be only accepted in writing through email, letter or fax to conference organizers. The conference has no responsibility for any intentional or accidental misuse, misinterpretation, or failure to follow above rules and conditions and holds no legal, civil or other responsibility for opinions, content or utilization of any methods/algorithms expressed in the Conference Proceedings.

If you have any questions about paper submission or the workshop, please contact the workshop organisers.

IMPORTANT DATES

March 8, 2018: Deadline for paper submission
April 8, 2018: Notification of Acceptance.
May 6, 2018: Early-bird Registration ends.
May 6, 2018: Submission deadline for the final version of the Papers
July 2-5, 2018: ICCSA 2018 Conference

WORKSHOP ORGANIZERS

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it

International Program Committee:

All submitted papers will be reviewed by the workshop technical program committee members.
Program Committee formation is pending and will be finalised shortly. Current TPC members:

Gianfranco Bilardi, University of Padova, Italy
Matteo Ceccarello, University of Padova, Italy
Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Giuseppe Di Fatta, University of Reading, UK
Ann Gordon-Ross, University of Florida, USA
Giuliano Laccetti, University of Naples, Italy
Pablo Moscato, University of Newcastle, Australia
Mitsunori Ogihara, University of Miami, USA
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA

-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

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

[DMANET] Deadline approaching: Workshop on Optimization, Machine Learning, and Data Science

Workshop on Optimization, Machine Learning, and Data Science
     April 12 - 13, 2018
at Technische Universität Carolo-Wilhelmina zu Braunschweig.

*Deadline for Submission*
  February 12, 2018.

*Keynote Speakers*
  Jeffrey T. Linderoth, University of Wisconsin-Madison, USA,
  Andrea Lodi, École Polytechnique de Montréal, Canada,
  Bernd Sturmfels, Max-Planck-Institut für Mathematik in den
    Naturwissenschaften, Leipzig, Germany,
  Stephen J. Wright, University of Wisconsin-Madison, USA.

*Further information*
  http://mo.tu-bs.de/workshop/

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

The positions are for a period of 12 months with the possibility of
renewal. 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] Postdoc position in algorithms for big data, University of Warwick UK

We are seeking to recruit a Post-doctoral Research Fellow to work in the
area of algorithms for analysing large data sets. The position is based
at the University of Warwick, in the United Kingdom (UK).

You will be expected to perform high quality research under the
supervision of Professor Graham Cormode, as part of the ERC funded
project 'Small Summaries for Big Data'. This can encompass streaming
algorithms, sketching and dimensionality reduction, distributed
monitoring and mergable summaries, verification of outsourced
computation, or other related topics. The expectation is that you will
produce breakthough research results in the summarisation of large
volumes of data, and publish these results in top rated venues.

You will possess a PhD or an equivalent qualification in Computer
Science or a very closely related discipline (or you will shortly be
obtaining it). You should have a strong back ground in one of the
following areas: algorithm design and analysis; randomised and
approximation algorithms; communication complexity and lower bounds;
streaming or sublinear algorithms. The post is based in the Department
of Computer Science at the University of Warwick, but collaborations
with closely related research organisations such as the Centre for
Discrete Mathematics and its Applications (DIMAP), the Warwick Institute
for the Science of Cities (WISC) and the newly formed Alan Turing
Institute (ATI) will be strongly encouraged.

Candidates should provide with their application form a CV, a list of
publications and a research statement.

Closing date: 14th February 2018

More information and to apply:
https://atsv7.wcn.co.uk/search_engine/jobs.cgi?owner=5062452&ownertype=fair&jcode=1710356&vt_template=1457&adminview=1

--
Prof. Graham Cormode, University of Warwick
http://www2.warwick.ac.uk/fac/sci/dcs/people/Graham_Cormode
**********************************************************
*
* 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 nominations: Prize for Innovation in Distributed Computing 2019

Call for Prize Nominations:
Prize for Innovation in Distributed Computing 2019
---------------------------------------------------------------------

Awarded by the Colloquium on Structural Information and Communication
Complexity (SIROCCO).

Deadline for nominations: April 30, 2018.

Nominations are requested for the Prize for Innovation In Distributed
Computing. This prize was established to recognize individuals whose
research contributions expanded the collective investigative horizon in
SIROCCO's area of interest. That is, they formulated new problems, or
identified new research areas, that were at the time of their introduction,
unorthodox and outside the mainstream, but later attracted the interest of
the SIROCCO community.

This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of the
SIROCCO conference.

The winner of the Prize for Innovation in Distributed Computing 2019 is
expected to give an invited talk at SIROCCO 2019. The winner of the 2018
edition of the prize (Zvi Lotker) will give a talk at SIROCCO 2018 which is
going to be held on June 18-21, Ma'ale HaHamisha, Israel.

Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, Pierre Fraigniaud, Michel Raynal, Masafumi
Yamashita, Shmuel Zaks and Zvi Lotker.

The prize may not necessarily be awarded every year.

Eligibility
------------

The following conditions must be met by the nominees to be eligible for the
prize. It is requested that a nomination letter explains and demonstrates
how the nominee matches these conditions.

(1) The original innovative contribution was introduced by the nominee(s)
for the first time in a publication at least five years before the
nomination deadline, and the publication must have appeared in a conference
proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper closely related to the innovative contribution, must have
appeared in a SIROCCO proceedings.

A nomination letter should identify the paper(s) that make(s) the nominee
eligible according to conditions (1) and (2) above, as well as explain the
contribution, its originality, and its significance.

Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/inde
x.html.

Selection process
-------------------------

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference, the PC
chairs, including co-chairs, of the three SIROCCO conferences immediately
preceding the nominations deadline, plus one additional member of the
Advisory Board, or one past winner, selected by the Steering Committee for
the current year.

The Award Committee of the Prize for Innovation in Distributed Computing
2019 consists of: Shantanu Das (Aix-Marseille Université), Pierre
Fraigniaud (CNRS and Paris Diderot), Andrzej Pelc - chair (Université du
Québec en Outaouais), Christian Scheideler (University of Paderborn), Jukka
Suomela (Aalto University) and Sébastien Tixeuil (Sorbonne Université).

Nominations can be made by any member of the scientific community.

DEADLINE : The deadline for nominations is April 30, 2018.
Please send the nomination to the prize committee chair, Andrzej Pelc, by
e-mail pelc@uqo.ca

Please write SIROCCO Prize Nomination IN THE SUBJECT LINE.

Please help in recognizing the contributions of members of our community.

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

[DMANET] Call For Papers: IEEE Transactions on Evolutionary Computation: Special Issue on Theoretical Foundations of Evolutionary Computation

[Apologies for multiple copies]

====================================================
IEEE Transactions on Evolutionary Computation:
Special Issue on Theoretical Foundations of Evolutionary Computation
====================================================

CALL FOR PAPERS

================
I. AIM AND SCOPE
================
Evolutionary computation (EC) methods such as evolutionary algorithms,
ant colony optimization and artificial immune systems have been
successfully applied to a wide range of problems. These include classical
combinatorial optimization problems and a variety of continuous, discrete
and mixed integer real-world optimization problems that are often hard to
optimize by traditional methods (e.g., because they are non-linear, highly
constrained, multi-objective, etc.). In contrast to the successful
applications, there is still a need to understand the behaviour of these
algorithms. The achievement and development of a solid theory of
bio-inspired
computation techniques is important as it provides sound knowledge on their
working principles. In particular, it explains the success or the failure
of
these methods in practical applications. Theoretical analyses lead to the
understanding of which problems are optimized (or approximated) efficiently
by a given algorithm and which ones are not. The benefits of theoretical
understanding for practitioners are threefold.

1) Aiding algorithm design,
2) guiding the choice of the best algorithm for the problem at hand and
3) determining optimal parameter settings.

The aim of this special issue is to advance the theoretical understanding
of
evolutionary computation methods. We solicit novel, high quality scientific
contributions on theoretical or foundational aspects of evolutionary
computation. A successful exchange between theory and practice in
evolutionary
computation is very desirable and papers bridging theory and practice are
of
particular interest. In addition to strict mathematical investigations,
experimental studies strengthening the theoretical foundations of
evolutionary
computation methods are very welcome.

=========
II. THEMES
=========
This special issue will present novel results from different sub-areas of
the
theory of bio-inspired algorithms. The scope of this special issue includes
(but is not limited to) the following topics:

-Exact and approximation runtime analysis
-Black box complexity
-Self-adaptation
-Population dynamics
-Fitness landscape and problem difficulty analysis
-No free lunch theorems
-Theoretical Foundations of combining traditional optimization techniques
with EC methods
-Statistical approaches for understanding the behaviour of bio-inspired
heuristics
-Computational studies of a foundational nature

All classes of bio-inspired optimization algorithms will be considered
including
(but not limited to) evolutionary algorithms, ant colony optimization,
artificial
immune systems, particle swarm optimization, differential evolution, and
estimation
of distribution algorithms. All problem domains will be considered
including discrete
and continuous optimization, single-objective and multi-objective
optimization,
constraint handling, dynamic and stochastic optimization, co-evolution and
evolutionary learning.

=============
III. SUBMISSION
=============
Manuscripts should be prepared according to the "Information for Authors"
section of the journal found at http://ieee-cis.org/pubs/tec/authors/ and
submissions should be made through the journal submission website:
http://mc.manuscriptcentral.com/tevc-ieee/, by selecting the Manuscript
Type
of "TFoEC Special Issue Papers" and clearly adding "TFoEC Special Issue
Paper"
to the comments to the Editor-in-Chief.

Submitted papers will be reviewed by at least three different expert
reviewers.
Submission of a manuscript implies that it is the authors' original
unpublished
work and is not being submitted for possible publication elsewhere.

Each submission will contain at least one paragraph explaining why the
paper is
(potentially) relevant to practice.

==================
IV. IMPORTANT DATES
==================
Submission open: February 1, 2018
Submission deadline: October 1, 2018
Tentative publication date: 2019

Papers will be assigned to reviewers as soon as they are submitted.
Papers will be published online as soon as they are accepted.

For further information, please contact one of the following Guest Editors.

===============
V. GUEST EDITORS
===============
Pietro S. Oliveto
Department of Computer Science
University of Sheffield
United Kingdom
p.oliveto@sheffield.ac.uk

Anne Auger
INRIA
Ecole Polytechnique Paris
France
anne.auger@jnria.fr

Francisco Chicano
Department of Languages and Computing Sciences
University of Malaga
Spain
chicano@lcc.uma.es

Carlos M. Fonseca
Department of Informatics Engineering
University of Coimbra
Portugal
cmfonsec@dei.uc.pt

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

*Fully funded PhD studentships available now* in time complexity analysis
of bio-inspired computation. Enquiries by excellent candidates can be sent
to me by email. Applications will be accepted until the posts are filled.
Further details are here
<http://staffwww.dcs.shef.ac.uk/people/P.Oliveto/PhDStudentships.html>.
Applicants should apply using the online application form here
<http://www.shef.ac.uk/postgraduate/online>

**********************************************************
*
* 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] Abstract submission open for "Graphs, groups, and more"

Abstract submission is now open for

"Graphs, groups, and more:
celebrating Brian Alspach's 80th and Dragan Marušič's 65th birthdays"
to be held from 28 May until 1 June, 2018 at UP FAMNIT in Koper, Slovenia.

Conference web-site:
https://conferences.famnit.upr.si/event/4/

Confirmed Invited Speakers:
Darryn Bryant, The University of Queensland, Australia
Danny Dyer, Memorial University of Newfoundland, Canada
Donovan Hare, University of British Columbia - Okanagan, Canada
Ademir Hujdurović, University of Primorska, Slovenia
Klavdija Kutnar, University of Primorska, Slovenia
Aleksander Malnič, University of Ljubljana & University of Primorska,
Slovenia
Joy Morris, University of Lethbridge, Canada
Primož Potočnik, University of Ljubljana, Slovenia
Mateja Šajna, University of Ottawa, Canada
Primož Šparl, University of Ljubljana & University of Primorska, Slovenia
Boris Zgrablić, University of Primorska, Slovenia
Cui Zhang, Sweden
Cun-Quan Zhang, West Virginia University, USA

It is our great pleasure to remind you of the conference "Graphs, groups,
and more: celebrating Brian Alspach's 80th and Dragan Marušič's 65th
birthdays" that will take place in Koper, Slovenia, from 28 May to 1 June,
2018.
The conference is dedicated to our colleagues Brian Alspach, on the
occasion of his 80th birthday, and Dragan Marušič, on the occasion of his
65th birthday.

Brian Alspach has had a distinguished career, primarily at Simon Fraser
University in Canada.
Since his retirement in 1999 he has held adjunct positions at the
Universities of Regina (Canada) and Newcastle (Australia).
He supervised 13 PhD students and has been a keen advocate and mentor for
young mathematicians, and for establishing innovative programs of study.
His research interests have included permutation groups and their actions
on graphs; tournaments and digraphs; decompositions and factorizations of
graphs; Hamilton cycles and other cycles in graphs, and more.

As one of the first mathematicians from the former Yugoslavia with a PhD
obtained abroad, Dragan Marušič returned home to take a teaching position
at the University of Ljubljana after having spent ten years at various
universities in England and USA.
He then moved to the University of Primorska where he now serves as the
third rector.
He has had a profound influence on mathematics in Slovenia, and is regarded
as the founder of the Slovenian school of algebraic graph theory.
He has been passionately involved in the promotion of mathematics and
mathematicians in Slovenia, having supervised 7 PhD students and mentored
many other young mathematicians.
His research interests focus on the concept of symmetry in the broadest
sense, with permutation groups and their actions on graphs as a primary
"point of interest".

You may now submit your abstracts at
https://conferences.famnit.upr.si/event/4/call-for-abstracts/.
Abstract submission will close on 30 April 2018.

The conference will take place at UP FAMNIT in Koper, Slovenia.

Organizing Committee:
Klavdija Kutnar, Joy Morris, Mateja Šajna

Organized by:
· Slovenian Discrete and Applied Mathematics Society
In Collaboration with:
· UP FAMNIT - University of Primorska, Faculty of Mathematics,
Natural Sciences and Information Technologies
· UP IAM - University of Primorska, Andrej Marušič Institute
· Centre for Discrete Mathematics, UL PeF (University of Ljubljana,
Faculty of Education)

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

[DMANET] Call for a workshop collocated with SODA

Dear colleagues,

On behalf of the SODA Steering committee, I would like to bring to your
attention the call for a workshop collocated with SODA, which is enclosed
below.

Kind regards,

Dan Kral

The SODA Steering Commmittee will be accepting proposals for additional
workshops to run concurrent to SODA. If you are interested in organizing
such a workshop, please submit a short proposal describing the workshop.
Please be sure to address the following points:

1) Describe some background on the topic as a research area and how it
would fit with SODA/ALENEX/ANALCO?

2) What is the goal and the target audience for this workshop?

3) How will papers/speakers be selected and/or submissions received?

Please email submissions to cliff@ieor.columbia.edu.

Deadline: February 15, 2018.

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

[DMANET] Call for Papers: Graph Drawing and Network Visualization GD 2018

Sorry if you have received multiple copies of this email
===========================================================================

Call for Papers

GD 2018

26th International Symposium on
Graph Drawing and Network Visualization

September 26-28, 2018 - Barcelona, Spain
http://dccg.upc.edu/gd2018/

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

PDF version: http://bit.ly/gd18-cfp

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

Graph Drawing is concerned with the geometric representation of graphs and
constitutes the algorithmic core of Network Visualization. Graph Drawing and
Network Visualization are motivated by applications where it is crucial to
visually analyze and interact with relational datasets. Examples of such
application areas include data science, social sciences, web computing,
information systems, biology, geography, business intelligence, information
security, or software engineering.

GD has been the main annual event in this area for more than 20 years. Its
focus is on combinatorial and algorithmic aspects of graph drawing as well as
the design of network visualization systems and interfaces. GD 2018 will take
place September 26-28, 2018 at the Universitat Politècnica de Catalunya in
Barcelona, Spain. Researchers and practitioners working on any aspects of graph
drawing and network visualization are invited to contribute papers and posters
and to participate in the symposium and the graph drawing contest.

PAPERS
------------

We invite authors to submit papers describing original research of theoretical
or practical significance to graph drawing and network visualization. Regular
papers must be submitted explicitly to one of two distinct tracks. Papers
submitted to one track will not compete with papers submitted to the other
track. All papers in all tracks will undergo single-blind reviewing.

Track 1: Combinatorial and algorithmic aspects
---------------------------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to):

* Design and analysis of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs

Track 2: Experimental, applied, and network visualization aspects
---------------------------------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing, such as
the development of network visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to):

* Visualization of graphs and networks in real world applications, including
big data
* Engineering of network visualization algorithms and systems
* Experimental results in graph theory and algorithms
* Benchmarks and experimental studies of network visualization systems and user
interfaces
* Cognitive studies on graph drawing readability and user interaction
* Interfaces and methods for interacting with graphs

Authors of applied papers will have the opportunity to show a demo of their
software/system during the poster session.

Short papers
-----------------

In addition to the above two tracks, there will be a separate category for
short papers, describing theoretical or applied contributions of shorter
length. Papers in this category will be assigned a shorter time for
presentation during the conference.

Submission format
-------------------------

All submissions must be formatted using the LaTeX style file for the conference
series Lecture Notes in Computer Science (LNCS) provided by Springer. The
default margins and fonts must not be modified; in particular, the use of
packages such as times.sty or mathptmx.sty is not allowed. Submissions that do
not comply with this format risk rejection without consideration of their
merits. The length of regular papers is limited to 12 pages (excluding
references), while the length of short papers is limited to 6 pages (excluding
references). The claims of the paper should be fully substantiated. If this
information does not fit within the page limits, the authors should include it
in a clearly marked appendix, whose length is not constrained and which the
reviewers may read at their own discretion. Authors must submit the complete
paper (including the appendix) by the deadline. Minor updates will be allowed
for 2 days following the deadline.

All submissions will be handled through EasyChair at the web site
https://easychair.org/conferences/?conf=gd18

POSTERS
--------------

Submissions of posters on graph drawing, network visualization, and related
areas are solicited. The poster session will provide a forum for the
communication of late-breaking research results (which may also appear
elsewhere) to the GD community. Authors of posters should prepare an abstract
(up to 2 pages in the LNCS style) that must be submitted together with the
poster itself.

CONTEST
--------------

Details about the traditional Graph Drawing Contest held at the conference are
provided on the conference web site at
http://graphdrawing.de/contest2018/contest.html

PUBLICATION
--------------------

All accepted papers (including the two-page poster abstracts) will appear in
the conference proceedings, published by Springer in the Lecture Notes in
Computer Science (LNCS) series. Twelve pages (excluding references) will be
allocated for regular papers and six pages (excluding references) for short
papers. The copyright to these proceedings will be held by Springer. The LNCS
proceedings will be made freely accessible to the GD community upon publication
and openly accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv
repository, in order to provide immediate and unrestricted open access to them.
The self-archived arXiv papers shall consist of the LNCS proceedings version
(identical, except for possibly changed references to the appendix resp. the
arXiv version) plus an optional clearly marked appendix. This appendix could
contain a long version of the entire paper or proofs that have been omitted
from the main text. Subsequent submissions of different versions of the paper
to the arXiv (known as arXiv ``replacements'') are allowed. Upon submission of
the camera-ready version of an accepted paper, the authors will be required to
specify the arXiv identifier associated with the paper for inclusion in a
conference index, which will be also published in the arXiv repository.
Failure to comply with these guidelines will impede the publication of the
paper.

Each paper or poster must be presented at the conference by an author (barring
unforeseen circumstances), otherwise the paper/poster will not be included in
the proceedings. Should any visa restriction prevent an author from attending
the conference and presenting a paper, he/she will be given ways to participate
and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a special
issue of the Journal of Graph Algorithms and Applications (JGAA). The authors
of the best paper in Track 2 will be invited to submit a substantially extended
and enhanced version of their work to IEEE Transactions on Visualization and
Computer Graphics (TVCG).

AWARDS
-------------

For each of the two tracks, the Program Committee of GD 2018 will give a Best
Paper Award. In addition, to recognize the effort of participants to present
their work and to prepare their posters in a clear and elegant way, there will
be a Best Presentation Award and a Best Poster Award voted on by the GD 2018
attendees.

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

* Paper submission deadline: June 10 (23:59 PDT)
Minor updates possible until June 12 (23:59 PDT)
* Notification of paper acceptance: July 20
* Poster submission deadline: August 12 (23:59 PDT)
* Notification of poster acceptance: August 24
* Final versions due: September 3
* Contest submission deadline: September 15 (23:59 PDT)
* Symposium: September 26-28

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

Bojan Mohar, Simon Fraser University
Alexandru Telea, University of Groningen

PROGRAM COMMITTEE
-----------------------------------

Patrizio Angelini, University of Tübingen
Daniel Archambault, Swansea University
David Auber, University of Bordeaux
Therese Biedl, University of Waterloo (co-chair)
Carla Binucci, University of Perugia
Erin Chambers, Saint Louis University
Steven Chaplick, University of Würzburg
Giuseppe Di Battista, Roma Tre University
Tim Dwyer, Monash University
Radoslav Fulek, IST Austria
Christophe Hurter, Ecole Nationale de l'Aviation Civile
Andreas Kerren, Linnaeus University (co-chair)
Karsten Klein, University of Konstanz
Guy Melançon, University of Bordeaux
Debajyoti Mondal, University of Saskatchewan
Petra Mutzel, TU Dortmund University
Yoshio Okamoto, The University of Electro-Communications
Sergey Pupyrev, Facebook
Helen Purchase, University of Glasgow
Marcus Schaefer, DePaul University
Gerik Scheuermann, University of Leipzig
Darren Strash, Colgate University
Shigeo Takahashi, University of Aizu
Tatiana Von Landesberger, TU Darmstadt
Sue Whitesides, University of Victoria
David R. Wood, Monash University
Hsu-Chun Yen, National Taiwan University

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

Vera Sacristan, UPC Barcelona (co-chair)
Rodrigro I. Silveira, UPC Barcelona (co-chair)

CONTEST COMMITTEE
---------------------------------

Will Devanny, UC Irvine
Philipp Kindermann, FernUniversität in Hagen
Maarten Löffler, Utrecht University (chair)
Ignaz Rutter, TU Eindhoven

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

[DMANET] PhD studentship in Algorithmic Game Theory

We have a fully funded PhD position in Algorithmic Game Theory, within
the Centre for Computational Finance and Economic Agents at the
University of Essex.

Application deadline is Friday 23 February 2018.

Details on the scholarship and how to apply can be found at
http://www.jobs.ac.uk/job/BHF243/phd-studentship-algorithmic-and-computational-aspects-of-economics-and-finance/.

Informal enquiries can be sent to either Maria Kyropoulou
(maria.kyropoulou@essex.ac.uk) or Carmine Ventre
(c.ventre@essex.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [GECCO CFP] [GECCO 2018] Final Call for Papers - Genetic and Evolutionary Computation Conference 2018

[Apologies if you receive multiple copies]

** Final Call for Papers **

---------------------------------------------------------------------------
2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July 15th-19th, 2018, Kyoto, Japan
http://gecco-2018.sigevo.org/

*** NOTE ***
We kindly suggest booking your accommodations as soon as possible. The
Gion festival, which occurs simultaneously with GECCO, may impact the
availability of hotels during the month of July.
---------------------------------------------------------------------------

*NON-EXTENSIBLE* Abstract Deadline: January 30, 2018.

Submission site for abstracts and papers:
https://ssl.linklings.net/conferences/gecco/

The Genetic and Evolutionary Computation Conference (GECCO 2018) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper-heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and
more.

The GECCO 2018 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Full papers of at most 8 pages are aimed to present
original new work that meets the high-quality standards of
GECCO. Accepted full papers appear in the ACM digital library as part
of the MAIN PROCEEDINGS of GECCO. For full papers, a separate
abstract needs to be submitted first by January 30, 2018. Full papers
are due by the non-extensible deadline of February 6, 2018.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. Evaluation is done on a per-track basis,
ensuring high interest and high expertise of the reviewers. Review
criteria include the significance of the work, technical soundness,
novelty, clarity, writing quality, relevance, and sufficiency of
information to permit replication, if applicable.

Besides the traditional GECCO full papers, poster-only papers of at
most 2 pages can be submitted. These are aimed to present original and
new work that has not yet reached the stage of the more mature,
complete research results that are typically published in full papers
at GECCO. The review of poster-only papers follows the same
double-blind process described above. However, accepted poster-only
papers appear in the ACM digital library as part of the COMPANION
PROCEEDINGS of GECCO. Poster-only papers are due by the non-extensible
deadline of February 6, 2018, and no abstract needs to be submitted
first.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:
- Submit a final, revised, camera-ready version to the publisher on
or before the camera-ready deadline
- Register at least one author to attend the conference on or before
the advance registration deadline
- Attend the conference (at least one author)
- Present the accepted paper at the conference

If an author has more than one paper to present at the conference,
there are NO additional registration fees. The author registers one
time (pays for 1 registration) and presents as many papers as have
been accepted. If a paper has more than one author, and more than one
author will attend the conference, then each author in attendance must
pay for a separate registration.

Important Dates:

Full papers (traditional category)
Abstract Deadline: ** January 30, 2018 **
Submission of Full Papers: ** February 6, 2018 **

Poster-only papers
Submission of Poster-only papers: ** February 6, 2018 **

Conference: ** July 15-19, 2018 **

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

--
Tomohiro Yoshikawa
Associate Professor
Dept. of Information and Communication
Nagoya University

Andrew M. Sutton
Assistant Professor
Department of Computer Science
University of Minnesota Duluth

*********************************
Publicity Chairs GECCO 2018
*********************************
**********************************************************
*
* 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] VEROLOG PHD SCHOOL, Cagliari (Italy), 1-2 June 2018

Owing to the presence of many brilliant researchers attending Odysseus
2018 in Cagliari (Italy), VeRoLog will organize a two-day school just
before the beginning of the workshop: Friday 1st and Saturday 2nd of
June 2018. Four lectures will be given by Teodor Gabriel Crainic, Guy
Desaulniers, Ola Jabali, Thibaut Vidal on different methodologies for
Vehicle Routing Problems. The school will be introduced by Daniele
Vigo. Titles and abstracts are reported below:

Teodor Gabriel Crainic: Parallel Computing and Vehicle Routing
Parallel computing speeds up algorithmic work. When meta and
matheuristics are involved, which is quite often the case for vehicle
routing problems, parallel-computing strategies may also yield a more
thorough exploration of the search space and better solutions compared
to those of sequential methods. The lecture will present an overview of
the main parallel-computing strategies for combinatorial optimization,
with illustrations from the vehicle-routing problem class, identifying
algorithmic concepts and discussing behaviour and performance.

Guy Desaulniers: Branch-price-and-cut for vehicle routing
Branch-price-and-cut is one of the leading methodologies for solving a
wide variety of vehicle routing problems. In this talk, we will go
through the basics of this solution method as well as some of its most
recent enhancements: Dantzig-Wolfe decomposition, lower bounds, column
generation, elementary shortest path pricing problem with resource
constraints, labeling algorithms (mono-directional, bidirectional, with
decremental state space relaxation), ng-route relaxation, branching,
capacity cuts, limited-memory subset row cuts, variable fixing, and
route enumeration. We will use throughout the talk the vehicle routing
problem with time windows as a typical example and present the most
recent computational results for this problem.

Ola Jabali: Stochastic Vehicle Routing Problems
In recent years there has been a notable interest in both formulating
and solving stochastic vehicle routing problems. This interest stems
from the fact that the majority of vehicle routing problem (VRP) models,
used to plan fundamental logistics operations, are subject to various
uncertainties when applied in practice. In particular, in VRP models it
is assumed that the problem parameters are deterministic. Uncertainties
in these parameters entail additional feasibility and cost
considerations, and therefore necessitate models and solution methods
that explicitly handle uncertainty rather than simply react to it. In
this talk, we will cover uncertainty in three sets of parameters
commonly considered in the literature: stochastic demands, stochastic
customers and stochastic times. These parameters are typically modeled
using suitable random variables or through the use of scenarios. We will
review the main modeling paradigms that have been used to formulate the
related problems, and present the main existing exact and approximate
solution methods that have been proposed to tackle them. In particular,
we will use the VRP with stochastic demands as an example to present
state-of-the-art solution algorithms. Finally, we will conclude with a
discussion of how the expression of stochastic phenomena can be improved
in light of the ever growing availability of data in the VRP context.

Thibaut Vidal: Heuristics for vehicle routing problems: Structural
problem decompositions and unified search
Vehicle Routing Problems (VRP) involve designing least-cost delivery
routes to visit a geographically-dispersed set of customers. Over the
past 60 years, this class of problems has been the subject of
considerable work, summing up to thousands of articles. In 2017, we can
reasonably say that the classical "capacitated" VRP (with only capacity
constraints) is fairly well solved by metaheuristic techniques. Yet, the
research on VRPs keeps on expanding even further, as a consequence of
the increasing diversity of applications, which bring forth new
difficult constraints, objectives, and combined decisions to account for
customer's needs, vehicle and network restrictions, and to better
integrate VRP optimization in the decision chains. Moreover, with the
advent of collaborative logistics, green initiatives, smart cities,
multi-modal transport, in contexts where multiples stakeholders and
conflicting objectives have to be considered jointly, or in the presence
of dynamic problems with a short response time, the efficient resolution
of these problems becomes even more critical. In this mini-course, we
will review some challenging VRP variants and examine the heuristic
solution techniques which are developed to tackle them. We will study
the close connections between the structure of the problem decision
sets, and the associated solution methods, showing how modern heuristics
can effectively perform a search in a reduced space, defined by fewer
groups of decision variables, while a decoder is in charge of producing
complete solutions. Finally, a key challenge is to progress towards
"unified" solution methods, which are not tailored for one single
problem, but instead designed to solve a wide collection of problem
variants with different constraints and objectives. For this purpose, we
expose some of the main principles of the Unified Hybrid Genetic Search
(UHGS), which has obtained state-of-the-art results –in a single code
base– for more than 50 difficult variants of vehicle routing and arc
routing problems.

The school will be offered free of charge to Phd Students attending
Odysseus 2018. Moreover, it is also possible to attend only the school
by a registration fee of €150.00. Participants have to be enrolled in a
PhD program and, preferably, in an early stage of their studies. A
maximum number of 20 participants will be accepted.

Didactic material and coffee breaks will be provided during the PhD
school. If required, a certificate of attendance will be provided to
participants.

VeRoLog will also give partial financial support in the registration fee
for some PhD students selected by the organizers.
To apply, students are requested to send their CV to mdifrance@unica.it
within January 31st, 2018.

**********************************************************
*
* 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] ACRI 2018 - Call for Papers

*****************************************************************************
ACRI 2018 - Call for Papers

13th International Conference on CELLULAR AUTOMATA FOR RESEARCH AND INDUSTRY

September 17 - 21, 2018

Villa del Grumello - Lake Como School Of Advanced Studies
Como, Italy

http://acri2018.disco.unimib.it

The conference is organised by the University of Milano-Bicocca
*****************************************************************************

SCOPE

Cellular Automata (CA) present a very powerful approach for the study of
complex emergent phenomena built up out of many simple local interactions.
Because of this, CA are very popular for studying real applications and
have generated a great deal of interest both in academia and industry
by researchers working in different scientific fields and dealing with
theoretical aspects as well as practical applications.

Since its first edition in 1994, the ACRI conference focused on challenging
problems and new research on Cellular Automata (CA). Its primary goal is
to offer both scientists and engineers in academies and industries an
opportunity to enforce international collaborations on Cellular Automata
and express their views on current trends, challenges, and state-of-the art
solutions to various problems in several scientific fields:
biology, computer science, chemistry, ecology, economy, engineering, geology,
medicine, physics, sociology, etc.

This 13th edition of ACRI Conference aims at enlarging the classical topics
to include other areas related to or extending Cellular Automata. This will
offer a larger community the opportunity to discuss their work in various
related fields as for instance: complex networks, games on networks,
bio-inspired computing, cryptography, biological network modelling,
multiagent models, etc.

Papers presenting original and unpublished research on theoretical and
computational aspects of Cellular Automata as well as applications of
CA-based models are sought/welcomed.

Topics of interest include (but are not limited to):
- Tools and Theory: new algorithms based on CA, theory of computation,
CA environments,
- Theoretical aspects of CA: algebraic, dynamics, and topological issues
- Dynamical Complex Systems and Emergent Phenomena,
- Image Processing and Pattern Recognition,
- Natural Computing and Unconventional Computing,
- Quantum Cellular Automata,
- Complex Networks, Games on Networks,
- Bio-Inspired Computing,
- Cryptography,
- Lattice Gas and Lattice Boltzmann Models,
- Agent-Based Models,
- Mathematical Systems Theory: analysis, optimization and control,
identification,
- Biological and Ecological Modelling: metabolic networks, species evolution,
immune systems, contamination processes, infectious diseases, biodiversity,
- Modelling of Physical or Chemical Systems: hydrodynamics, reaction diffusion,
systems, complex flows,
- Environmental Modelling: Pollution models, biomass evolution, desertification,
- Socio-Economical Models: vehicular and pedestrian traffic, urbanism, market.

WORKSHOPS

The ACRI-2018 Organizing Committee invites proposals for the Workshops Program.
Workshops will provide an informal setting where participants will have the
opportunity to discuss specific technical topics in an atmosphere that fosters
the active exchange of ideas.
In the past editions of ACRI the number of ACRI Workshops and satellite Workshop
has grown: C&CA (Crowds & Cellular Automata), T&CA (Traffic & Cellular
Automata), ACA (Asynchronous Cellular Automata and Asynchronous Discrete Models),
CACGI (Cellular Automata of Cancer Growth and Invasion), IWNC (International
Workshop of Natural Computing), ABSim&CA (Agent-Based Simulation & Cellular
Automata).
Details on how to send Workshop proposals will be announced soon.

VENUE

The Conference will take place at the Villa del Grumello (Como, ITALY), within
the Como Lake School of Advanced Studies, see http://www.villadelgrumello.it .
Villa del Grumello is looking the first basin of Como Lake. It is framed by
century-old trees and enchants its visitors with its delicate atmospheres
and its harmonious setting. Driving force of the development of the Lariano
area, Villa del Grumello is a reference point for culture, science and the
business community.

IMPORTANT DATES

- Submission deadline: March 8, 2018
- Notification of acceptance: May 3, 2018
- Final versions: June 8, 2018
- ACRI 2018: September 17-21, 2018

CHAIRS
- Giancarlo Mauri (chair), University of Milano-Bicocca
- Samira El Yacoubi (co-chair), University of Perpignan

CHAIR OF WORKSHOPS
- Stefania Bandini, University of Milano-Bicocca

INVITED SPEAKERS to be announced

PROGRAM COMMITTEE
- Andy Adamatzky, University of the West of England, UK
- Jan Baetens, Ghent University, Belgium
- Franco Bagnoli, University of Florence, Italy
- Stefania Bandini, Università degli Studi di Milano-Bicocca, Italy
- Bernard De Baets, Ghent University, Belgium
- Pedro de Oliveira, Universidade Presbiteriana Mackenzie, Brazil
- Alberto Dennunzio, Università degli Studi di Milano-Bicocca, Italy
- Andreas Deutsch, TU Dresden, Germany
- Salvatore Di Gregorio, University of Calabria, Italy
- Witold Dzwinel, AGH University of Science and Technology, Poland
- Samira El Yacoubi, Université de Perpignan, France
- Nazim Fates, LORIA - INRIA Nancy, France
- Enrico Formenti, Nice Sophia Antipolis University, France
- Ioakeim Georgoudas, Democritus University of Thrace, Greece
- Rolf Hoffmann, TU Darmstadt, Germany
- Toshihiko Komatsuzaki, Kanazawa University, Japan
- Krzysztof Kułakowski, AGH University of Science and Technology, Poland
- Martin Kutrib, Institut für Informatik, Universität Giessen, Germany
- Anna T. Lawniczak, University of Guelph, Canada
- Laurent Lefevre, LCIS, Univ. Grenoble Alpes, France
- Luca Manzoni, Università degli Studi di Milano-Bicocca, Italy
- Sara Manzoni, Università degli Studi di Milano-Bicocca, Italy
- Luca Mariot, Università degli Studi di Milano-Bicocca, Italy
- Genaro J. Martínez, National Polytechnic Institute, Mexico
- Giancarlo Mauri, Università degli Studi di Milano-Bicocca, Italy
- Angelo B Mingarelli, Carleton University, Canada
- Shin Morishita, Yokohama National University, Japan
- Katsuhiro Nishinari, RCAST, The University of Tokyo, Japan
- Dipanwita Roy Chowdhury, IIt kharagpur, India
- Biplab K. Sikdar, Indian Institute of Engineering Science and Technology, India
- Georgios Ch. Sirakoulis, Democritus University of Thrace, Greece
- Domenico Talia, University of Calabria, Italy
- Marco Tomassini, University of Lausanne, Switzerland
- Paweł Topa, AGH University of Science and Technology, Poland
- Leen Torenvliet, Amsterdam, Netherlands
- Hiroshi Umeo, Univ. of Osaka Electro-Communication, Japan
- Giuseppe Vizzari, Università degli Studi di Milano-Bicocca, Italy
- Gabriel Wainer, Carleton University, Canada
- Jaroslaw Was, AGH University of Science and Technology, Poland
- Thomas Worsch, Karlsruhe Institute of Technology, Germany
- Radouane Yafia, Ibn Zohr University, Morocco

ORGANIZING COMMITTEE

- Giancarlo Mauri (chair)
- Stefania Bandini
- Alberto Dennunzio
- Luca Manzoni
- Luca Mariot
- Giuseppe Vizzari

SUBMISSION

Authors are invited to submit papers of no more than 10 pages
via the EasyChair system.

Submissions should contain original research that has not previously
been published. Concurrent submissions to other conferences/journals are
not allowed. Supplementary material that exceeds the above mentioned
page limits may be included as an appendix and will be considered at
the committee's discretion (note that appendices will not be published
in the proceedings). Submission must be formatted in LaTeX using the
LNCS format (see http://www.springer.com/computer/lncs/lncs+authors)
and submitted in Portable Document Format (PDF). Papers authored or
co-authored by PC members are also welcome.

PROCEEDINGS

Accepted papers will appear in the proceedings published by
Springer in the LNCS series.

JOURNAL SPECIAL ISSUE

As for the previous editions, we are planning special issues of journals like
Natural Computing (already confirmed) and Journal of Cellular Automata for
the publication of selected papers from the conference and workshops.

**********************************************************
*
* 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] CTW18 on Graphs and Combinatorial Optimization (18-20 June, Paris)

16th Cologne-Twente Workshop (CTW18) on Graphs and Combinatorial Optimization

June 18-20, 2018, Paris (France)

Submission deadline extension to 10th Feb 2018

Call for papers
---------------
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization
2018 welcomes contributions on theory and applications of discrete
algorithms, graphs and combinatorial optimization in the wide
sense. CTW18 will be organized by CNRS LIX, École Polytechnique, and will
take place at the Conservatoire National d'Arts et Métiers (CNAM), in
the center of Paris.

Contacts
--------
URL: http://ctw18.lipn.univ-paris13.fr/
EMAIL: ctw18paris@gmail.com

Invited speakers
----------------
Thomas Seiller, Univ. de Paris-Nord
Angelika Wiegele, Alpen-Adria-Univ. Klagenfurt

Registration fee
----------------
EUR 250 if the payment is received by May 10, 2018, and EUR 300
afterwards. For PhD/MSC students and/or postdocs, EUR 100 if received
by May 10, 2018, and EUR 125 afterwards (PhD studentship / postdoc status
proof is required). The registration fee includes entry to all technical
sessions, coffee-breaks and the social event. Please check the payment
instructions carefully (on the website).

Important dates
---------------
(Extended) submission deadline: 10th Feb 2018
(Provisional) answer to authors: 18th Apr 2018
Reduced price registration deadline: 10th May 2018
Conference: 18-20 June 2018

Abstract Submission
-------------------
Submit extended abstracts of at most 4 pages using the Easychair link
<https://easychair.org/conferences/?conf=ctw18>, using the templates
available on the website. The scientific committee will select the
presentations for the workshop on the basis of the extended abstracts
received and on the available number of slots.

Proceedings volume
------------------
A special issue of the journal Discrete Applied Mathematics is planned
as a post-conference proceedings outlet.

Scientific committee
--------------------
Ali Fuat Alkaya, Marmara Univ.
Alberto Ceselli, Univ. Milan
Roberto Cordone, Univ. Milan
Ekrem Duman, Ozyegin Univ.
Ulrich Faigle, Univ. Koeln
Johann Hurink, Univ. Twente
Leo Liberti, CNRS & Ecole Polytechnique
Bodo Manthey, Univ. Twente
Gaia Nicosia, Univ. Roma Tre
Andrea Pacifici, Univ. Roma Tor Vergata
Stefan Pickl, Univ. des Bundeswehr Muenchen
Bert Randerath, Technische Hochschule Koeln
Giovanni Righini, Univ. Milan
Heiko Roeglin, Univ. Bonn
Britta Peis, RWTH Aachen
Oliver Schaudt, Univ. Koeln
Rainer Schrader, Univ. Koeln
Rudiger Schultz, Univ. Duisburg-Essen
Frank Vallentin, Univ. Koeln

Local organization
------------------
Fabio Furini, Univ. Paris-Dauphine
Amelie Lambert, CNAM Paris
Lucas Letocart, Univ. Paris-Nord
Leo Liberti, CNRS & Ecole Polytechnique (chair)
Ivana Ljubic, ESSEC Paris
Evelyne Rayssac, Ecole Polytechnique
Emiliano Traversi, Univ. Paris-Nord
Roberto Wolfler Calvo, Univ. Paris-Nord

EMAIL: <ctw18paris@gmail.com>
URL: <http://ctw18.lipn.univ-paris13.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] EATCS-IPEC Nerode Prize. Nominate by March 1, 2018

CALL FOR NOMINATIONS — EATCS-IPEC Nerode Prize — Due March 1, 2018

The Nerode Prize is an annual prize for outstanding work in multivariate
algorithmics and parameterized complexity, published in a recognized
refereed journal by an individual or a team of authors. This year,
Daniel Marx is the Chair of the prize committee, and will be collecting
nominations by email until the deadline of March 1, 2018. Please think
of any past work in this area that deserves to be recognized by this
prize, and send him your nominations.

Nominations should contain a brief summary of the technical content of
the nominated paper and a brief explanation of its significance. Send
copies to the members of the committee. The Subject line of the
nomination E-mail should contain the group of words "Nerode Prize
Nomination". The nomination deadline is March 1, 2018.

The award will be presented at ALGO/IPEC 2018 which will be held on
22–24 August 2018 in Helsinki, Finland.

COMMITTEE
Daniel Marx <dmarx@cs.bme.hu>
Award Committee Chair (Hungarian Academy of Sciences)

Jianer Chen <chen@cse.tamu.edu>
(Texas A&M)

Hans L. Bodlaender <h.l.bodlaender@uu.nl>
(Utrecht University)

--
Frances Rosamond, Professor
Department of Informatics
University of Bergen
Editor: Parameterized Complexity Newsletter
Editor: Parameterized Complexity wiki (www.fpt.wikidot.com)
Program Chair: Parameter Implementation PACE
(https://pacechallenge.wordpress.com)
President and CEO: Rosamond Computer Science Research and Education
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Special Issue on Parallel and Distributed Data Mining

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier

Submission deadline: February 1st, 2018

The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.

The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud environments

Benchmarking and performance studies of high-performance data mining applications

Novel programming paradigms to support high-performance computing for data mining

Performance models for high-performance data mining applications and middleware

Programming models, tools, and environments for high-performance computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.

A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.

IMPORTANT DATES

Submission deadline: February 1st, 2018
First round notification: May 1st, 2018
Revised version due: July 1st, 2018
Final notification: August 1st, 2018
Camera-ready due: September 15th, 2018
Publication tentative date: December 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy

-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

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

[DMANET] ISCO 2018, deadline extended

Due to the pressing requests of many contributors, we extend the deadline for submission
to ISCO 2018 to January 29, 2018.

*************************
ISCO 2018
Submissions are open
New Deadline: January 29.

*************************
5th International Symposium on Combinatorial Optimization (ISCO 2018)
April 11-13, 2018 - Marrakesh - Morocco
[+Spring School on "Advanced MIP Formulations and Computations"
on April 9- 10, 2018]
http://isco2018.lip6.fr/

THEME AND SCOPE
ISCO is a biennial symposium whose aim is to bring together researchers from all the
communities related to combinatorial optimization, including algorithms and complexity,
mathematical programming and operations research. It is intended to be a forum for
presenting original research in these areas and especially in their intersections.
Quality papers on all aspects of combinatorial optimization, from mathematical
foundations and theory of algorithms to computational studies and
practical applications, are solicited.

SESSIONS
The conference is organized into plenary and parallel sessions. The conference languages
is English. Each speaker can give only one talk. Proposals for invited sessions
are welcome. Researchers who are interested in organizing an invited session should
contact Ridha Mahjoub (ridha.mahjoub@)lamsade.dauphine.fr).

SPRING SCHOOL
ISCO 2018 will be preceded by a spring school on "Advanced MIP Formulations and
Computations". Juan Pablo Vielma and Joey Huchette from MIT will give 16 hours of
lectures on April 9 and 10, 2018.

SUBMISSION - PUBLICATION
Papers presenting original unpublished results in all areas of combinatorial optimization
and its applications are welcome. The submission deadline is January 10, 2018.
Simultaneous submissions to other conferences with published proceedings or journals
are not allowed.
Two types of submissions:
Regular papers with up to 12 pages
Accepted regular papers will be published by Springer-Verlag in the Lecture Notes in
Computer Science (LNCS) series in a post-conference proceedings volume. The authors will
have to prepare their camera-ready version two weeks after the end of ISCO 2018.
Short papers up to 2 pages. Accepted short papers will be included in a volume
of local proceedings. More information about the submission procedure is available
on the website of the conference.

SPECIAL ISSUE:
A special issue of the journal Discrete Applied Mathematics will be dedicated to ISCO 2018.

IMPORTANT DATES
Submission: January 29, 2018
Notification: February 20, 2018
Early registration: March 6, 2018
Early registration school: March 6, 2018
Camera Ready: April 30, 2018

KEYNOTE SPEAKERS
Friedrich Eisenbrand (EPFL, Lausanne, Switzerland)
Marcia Fampa (Federal University of Rio de Janeiro, Bresil)
Bernard Gendron (University of Montreal, Canada)
Franz Rendl (University of Klagenfurt, Graz, Austria)

CONFERENCE CHAIRS
Abdellatif El Afia (ENSIAS, University Mohammed V, Marroco)
Jon Lee (University of Michigan, USA)
A. Ridha Mahjoub (University Paris-Dauphine, France)
Giovanni Rinaldi (IASI, Roma, Italy)

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

[DMANET] PhD/PostDoc in mathematical optimization at TU Braunschweig

PhD/PostDoc in mathematical optimization at TU Braunschweig

The Institute of Mathematical Optimization at Braunschweig Technical University, Germany invites applications for a research position (TV-L EG 13, 100%) in the area of optimization for renewable energy systems starting

April 1, 2018 <http://airmail.calendar/2018-04-01%2012:00:00%20CEST>.

It is possible to obtain a PhD; Applications of postdocs will be given full consideration. The position is limited to three years, and does not require teaching.

We are looking for excellent candidates with

- an outstanding degree in mathematics or computer science
- in-depth knowledge of discrete optimization or nonlinear optimization, and an interest in working at the interface of both fields
- good programming skills in Python, C, C++, Java or a related high-level language
- Interest in active collaboration with industry

Knowledge of the German language is not required.

Applicants with special needs will be given preference if otherwise equally qualified. Braunschweig Technical University is committed to increase the percentage of female researchers and encourages suitably qualified women to apply.

Applications will be given full consideration

until February 28, 2018 <http://airmail.calendar/2018-01-10%2012:00:00%20CET>,

or any later time until the position is filled.

Applicants send a curriculum vitae, a list of publications, their MSc/PhD thesis, as well as names and addresses of thesis referees preferably by e-mail to:

mo@tu-bs.de <mailto:mo@tu-bs.de>

Applicants should also arrange for a letter of recommendation to be sent to this e-mail address. Mail applications should be addressed to:

Technische Universität Braunschweig
Institut fuer Mathematische Optimierung
Universitaetsplatz 2
38106 Braunschweig
Germany
**********************************************************
*
* 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/
*
**********************************************************