[DMANET] Two PostDoc Positions at FU Berlin

We announce

TWO PostDoc POSITIONS (full)

at Freie Universität Berlin, Germany, at the Department of Computer Science.

Both positions are supported by the ERC starting grant "CGinsideNP:
Complexity inside NP - A Computational Geometry Perspective" that covers
topics from computational geometry and computational complexity theory
and will be supervised by Wolfgang Mulzer.

Both positions are within the theory group at FU Berlin
(http://www.mi.fu-berlin.de/inf/groups/ag-ti/).

We expect that the candidate has a PhD degree in Computer Science or
Mathematics and a solid research track record in algorithms,
computational geometry (also in high dimensions), and/or computational
complexity theory.

Please send your applications consisting of

- a cover letter, indicating the position you are applying for,
- curriculum vitae,
- the PhD thesis (preliminary version, if not finished),
- (optional) a letter of reference (to be directly sent to us),

to mulzer[at]inf.fu-berlin.de. It is also possible to apply via postal
mail. In this case send your application to

Wolfgang Mulzer
Institut für Informatik
Freie Universität Berlin
Takustraße 9
14195 Berlin
Germany

If you have further questions about the positions, please send an email
to mulzer[at]inf.fu-berlin.de .

The application deadline is December 1, 2017.

**********************************************************
*
* 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] PMS 2018: Deadline Extension

******************************************************************
PMS 2018
16th International Conference on Project Management and Scheduling
April 17-20, 2018
Rome - Italy
www.pms2018.ing.uniroma2.it
******************************************************************

Due to many requests, the deadline for submitting extended abstracts
has been postponed to 15th November, 2017.

PMS 2018 (16th International Workshop on Project Management and
Scheduling) is organized by the Department of Enterprise Engineering
of the University of Rome "Tor Vergata" (Rome, Italy). The workshop
will be held in Rome - Italy - on April, 17-20, 2018 at Residenza di
Ripetta, strategically located in the heart of the City - a few steps
away from Piazza del Popolo and Piazza di Spagna.

The workshop website is http://www.pms2018.ing.uniroma2.it

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

The workshop will consist of technical and selected presentations as
well as invited presentations made by esteemed researchers working on
Project Management and Scheduling.

Plenary speakers confirmed are:
- Jacques Carlier - Université de Technologie de Compiègne
- Rolf Möhring - Technische Universität Berlin
- Erwin Pesch - Universität Siegen

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

Best student paper award. See the PMS 2018 website for details
(section Call for papers).

After the workshop, the authors will have the opportunity to submit
full papers to a special issue of Annals of Operations Research (see
the PMS 2018 website).

Important deadlines:
Paper submission: 15th November 2017 (Extended)
Notification of acceptance: 19th January 2018
Final paper presentation: 12th February 2018
Early registration: 15th February 2018

A list of hotels will be made available on the PMS 2018 website soon.
We remind you that Rome is very crowded in the period of the
Conference. Hence, we warmly invite all the participants to reserve
their accommodation as soon as possible in order to find solutions at
best rates.

For detailed information about the conference and the venue, please,
visit the Conference website: http://www.pms2018.ing.uniroma2.it, or
send an email to caramia@dii.uniroma2.it.

On behalf of the Organizing Committee,
Massimiliano Caramia (Conference Chair)

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

[DMANET] [GECCO CFP] [GECCO 2018] Second Call for Proposals for Tutorials, Workshops and Competitions

[Apologies if you receive multiple copies]

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

Important Dates:

Tutorials, Workshops, and Competitions:
Proposals: November 7, 2017
Acceptance Decision: December 5, 2017
Conference: July 15-19, 2018

*** Call for Tutorials ***

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

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

Accepted tutorials' slide sets will be collected by Sheridan/ACM Press,
and published as part of a companion volume to the conference
proceedings in the ACM Digital library.

* Submission Process *

Each tutorial proposal should include:

1. A half-page extended abstract (in plain text) that includes: the
title of the tutorial, the name and affiliation of the instructor(s),
and a description of the tutorial scope and content.
2. Short bio of the instructor(s) (about half page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the tutorial presentation.

* Reviewing *

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

* Information and Submissions *

Tutorials proposals should be submitted to:
Hisao Ishibuchi, GECCO 2018 Tutorials Chair
Osaka Prefecture University, Osaka, Japan
Email: hisaoi@cs.osakafu-u.ac.jp
Webpage: http://gecco-2018.sigevo.org/index.html/Tutorials

*** Call for Workshops ***

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

Workshop organizers are responsible for coordination and publicity. They
collect and review papers, and provide a list of accepted papers and
their authors, if applicable. If required, the GECCO organizers may
provide additional support to the workshop organizers, such as
publicity. Note that organizers, participants and presenters must
register for the conference. Accepted workshop papers will be collected
by Sheridan/ACM Press, and published in a companion volume to the
conference proceedings.

* Submission Process *

Each workshop proposal needs to include:

1. A half-page extended abstract (in plain text) that includes: the
workshop title, the name and affiliation of the organizer(s), and a
description of scope and content. Please refrain from using special
characters in the title.
2. Short bio of the organizer(s) (about half-page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the workshop.
4. A draft schedule of the workshop, including the estimated duration (1
to max 4 sessions) and type of sessions.
5. If this workshop (or a similar event coordinated by the same
organizers or a subset of them) has taken place in previous years,
either at GECCO or at other events, then include URLs to the event pages.

* Reviewing of Proposals *

Workshop proposals will be reviewed by the GECCO 2018 organizing
committee, based on GECCO attendees' likely interest, the breadth and
the depth of the topic(s), and the expertise and credentials of the
organizer(s).

* Information and Proposal Submissions *

Workshops proposals should be submitted to:
Carlos Cotta and Tapabrata Ray, GECCO 2018 Workshops Chairs
Malaga University, Spain
Email: ccottap (at) lcc.uma.es
University of New South Wales, Australia
Email: t.ray (at) adfa.edu.au
Webpage: http://gecco-2018.sigevo.org/index.html/Workshops

*** Call for Competitions ***

Competitions demonstrate how Evolutionary Computation and related
techniques can be utilized in challenging practical, real-world and
gaming settings. They also enable fair comparisons between algorithms
and (for recurrent competitions) provide the possibility to follow the
development of approaches over time.

* Submission process *

Each competition proposal should include:

1. A half-page abstract (plain text) that includes: competition title,
the name and affiliation of the organizer(s), a description of the
competition. If the competition has been held before, then also
provide the web address of last edition and what you will change
in case you plan any changes.
2. In addition, you can voluntarily provide your thoughts on the
following items:
* sourcing of prizes
* judging process
* think about newcomers: can you provide tutorials (incl. videos)
to make the entrance easier?
* think about the eventual sharing of submitted algorithms and
their descriptions

We are currently exploring the possibility of offering the publication
of algorithm descriptions as 2-page contributions to the GECCO
Companion.

* Information and Submissions *

Competition proposals should be submitted by e-mail to:
Markus Wagner, GECCO 2018 Competitions Chair
University of Adelaide, Australia
markus.wagner (at) adelaide.edu.au
Webpage: http://gecco-2018.sigevo.org/index.html/Competitions

********
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] CP 2018 Call for Thematic Tracks

*Call for Thematic Tracks*

*Principles and Practice of Constraint Programming (CP 2018)*

Lille, France, August 27-31

For the third consecutive year, the organizers of CP 2018 are seeking to
extend the scope of the conference through themed tracks. Of particular
interest are topics that are potentially relevant to the CP/AI/computer
science community, even if they do not directly involve constraint
programming. Both repeat tracks and new tracks are welcome. CP 2018 will
also include technical and applications tracks as in previous years.

Tracks at recent meetings have covered biology, machine learning,
operations research & mathematical programming, satisfiability, testing &
verification, music, computational sustainability, and social choice
theory. Proposals for additional topics are enthusiastically encouraged,
whether they involve methodology, software, or specific application areas.

The conference will provide track participants an opportunity to learn
about the latest trends and attend tutorials in constraint programming, a
powerful technology that is rapidly being adopted by industry. Papers
accepted for presentation will be published in the conference proceedings,
which are distributed at the time of the conference.

Proposals are invited from potential track chairs, who will be expected to
recruit a small program committee (5 to 10 individuals) to review
submissions. The chair(s) of the proposed track should reasonably expect
to receive at least a half dozen submissions, some of which can be
individually solicited if desired. They will also serve as members of the
Senior Program Committee, which will discuss final acceptance decisions via
EasyChair in late May 2018.

Potential chairs are encouraged to contact the CP 2018 Program Chair, John
Hooker, by email (jh38@andrew.cmu.edu) to propose a topic or discuss ideas
for topics. We would like to finalize the list of tracks by November 15 so
that a timely call for papers can be issued.

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

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: December 1th, 2017
First round notification: March 1th, 2018
Revised version due: May 1st, 2018
Final notification: June 1st, 2018
Camera-ready due: July 1st, 2018
Publication tentative date: October 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] Algorithms and Computational Complexity in London, UK, July 2018

This is a preliminary announcement of two days of meetings on Algorithms and Computational Complexity in London, on Monday 16th and Tuesday 17th July, 2018. On Monday we celebrate the career of Martin Dyer, with a programme of talks by friends and collaborators. On Tuesday, there will be an Algorithms Day, following the no-frills model that has been established in a sequence of meetings at several sites in the UK. Details will follow later, but at the moment, please save the dates in your diary. The Martin Dyer celebration is co-organised with Colin Cooper (King's College, University of London) and Leslie Goldberg (University of Oxford). The events will take place at Queen Mary, University of London. We look forward to welcoming many of you to London in July.

**********************************************************
*
* 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 - 5th International Symposium on Combinatorial Optimization (ISCO 2018)

CALL FOR PAPERS

ISCO 2018

5th International Symposium on Combinatorial Optimization (ISCO 2018)

April 11-13, 2018

SPRING SCHOOL ON :

"Advanced MIP Formulations and Computations"

on April 9- 10, 2018

Marrakech, Marocco

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.

PSUBMISSION - 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 paperswith 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 papersup to 2 pages.
Acceptedshortpaperswillbeincludedinavolumeoflocal proceedings.

More information about the submission procedure is available on the
website of the conference.

SPECIAL ISSUE

A Special issues of an international journal will be associated with
ISCO2018

IMPORTANT DATES

Submission: January 10, 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

Abdelatif El Afia(ENSIAS, University Mohammed V, Marroco)

Jon Lee (University of Michigan, USA)

A. Ridha Mahjoub (University Paris-Dauphine, France)

Givanni Rinaldi (IASI, Roma, Italy)

STEERING COMMITTEE

M. Baïou (LIMOS, CNRS, University Blaise Pascal, Clermont-Ferrand, France)

P. Fouilhoux (University Pierre and Marie Curie, Paris, France)

L. Gouveia (University of Lisbon, Portugal)

N. Maculan (Universidad Federal do Rio de Janeiro, Brasil)

A. R. Mahjoub (University Paris-Dauphine, France)

V. Paschos (University Paris-Dauphine, France)

Giovanni Rinaldi (IASI, Roma, Italy)

Organizing Committee

Abdelatif El Afia (Mohammed V University, Rabat, Morocco)

Raddouane Chiheb (Mohammed V University, Rabat, Morocco)

Rdouan Faizi (Mohammed V University, Rabat, Morocco)(Chair)

Sanaa El Fkihi (Mohammed V University, Rabat, Morocco)

Pierre Fouilhoux ((University Pierre & Marie Curie, Paris, France)

Rohaifa Khaldi (Mohammed V University, Rabat, Morocco)

A.Ridha Mahjoub (University Paris-Dauphine, Paris, France)

Fatima Ouzayd (Mohammed V University, Rabat, Morocco)

For more information on the Symposium and School, you can consult the
website of the conference*.*

The Organnizing Committee of ISCO 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] CfP: EvoCOP 2018 (EXTENDED submission deadline: November 10, 2017)

NEWS: Due to a large number of requests for late submissions, the EvoStar
submission sites will stay open until Friday 10 November, after which no
further submissions will be accepted. Authors who have already submitted, can
update their work until this time.

************************************************************************
EvoCOP 2018 - The 18th European Conference on
Evolutionary Computation in Combinatorial Optimisation
http://www.evostar.org/2018/cfp_evocop.php
April 4 - April 6, 2018
Parma, Italy

Part of Evo* 2018 (http://www.evostar.org)
************************************************************************

The 18th European Conference on Evolutionary Computation in Combinatorial
Optimisation is a multidisciplinary conference that brings together researchers
working on evolutionary computation methods and other metaheuristics for
solving difficult combinatorial optimisation problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, estimation of distribution
algorithms, swarm intelligence methods such as ant colony and particle swarm
optimisation, local search methods such as simulated annealing, tabu search,
variable neighbourhood search, iterated local search, scatter search and path
relinking, and their hybridisation, such as memetic algorithms. Automatic
algorithm configuration and design, meta-optimisation, model-based methods, and
hyperheuristics are also topics of interest. Successfully solved problems
include, but are not limited to, multi-objective, uncertain, dynamic and
stochastic problems in the context of scheduling, timetabling, network design,
transportation and distribution, vehicle routing, graph problems,
satisfiability, energy optimisation, cutting, packing, and planning problems.

The EvoCOP 2018 conference will be held in the city of Parma, Italy, together
with EuroGP (the 21st European Conference on Genetic Programming), EvoMUSART
(7th European conference on evolutionary and biologically inspired music,
sound, art and design) and EvoApplications (specialist events on a range of
evolutionary computation topics and applications), in a joint event
collectively known as EvoStar (Evo*).

**** Areas of Interest and Contributions ****

Topics of interest include, but are not limited to:

* Applications of metaheuristics to combinatorial optimisation problems
* Representation techniques
* Practical solution of NP-hard problems
* Neighbourhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Theoretical developments
* Constraint-handling techniques
* Parallelisation and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Heuristics
* Genetic programming and Genetic algorithms
* Tabu search, iterated local search and variable neighbourhood search
* Ant colony optimisation
* Artificial immune systems
* Scatter search
* Particle swarm optimisation
* Memetic algorithms
* Hybrid methods and hybridisation techniques
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Automatic algorithm configuration and design
* Metaheuristics and machine learning
* Surrogate-model-based methods
* Estimation of distribution algorithms
* String processing
* Scheduling and timetabling
* Network design
* Vehicle routing
* Graph problems
* Satisfiability
* Packing and cutting problems
* Energy optimisation problems
* Multi-objective optimisation
* Search-based software engineering

**** Publication Details ****

EvoCOP 2018 will accept two types of submissions:

* Regular papers will be presented orally at the conference and printed in the
proceedings published by Springer in the LNCS series (see LNCS volumes 2037,
2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832, 8600,
9026, 9595 and 10197 for the previous proceedings).

* Late-breaking abstracts (LBAs) summarising ongoing research, recent studies
and applications of evolutionary computation and other meta-heuristics to
real-world or academic combinatorial optimisation problems. LBAs will be
presented as posters during the conference.

**** Submission Details ****

Regular paper submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee. The
authors of accepted papers will have to improve their paper on the basis of
the reviewers' comments and will be asked to send a camera ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference, attend the conference and present the work.

The reviewing process will be double-blind, please omit information about the
authors in the submitted paper. Submit your manuscript in Springer LNCS format.

Page limit (Regular papers): 16 pages
Page limit (LBAs): 1 page

Submit your paper via https://myreview.saclay.inria.fr/evocop18/
(Authors->Submit new paper)

**** Important Dates ****

EXTENDED submission deadline (Regular papers): November 10, 2017
Author notification (Regular papers): January 3, 2018
Camera-ready deadline (Regular papers): January 15, 2018
Submission deadline (LBAs): January 15, 2018
EvoStar: April 4-6, 2018

**** EvoCOP Programme Chairs ****

Arnaud Liefooghe
University of Lille, France
arnaud.liefooghe@univ-lille1.fr

Manuel Lopez-Ibanez
University of Manchester, United Kingdom
manuel.lopez-ibanez@manchester.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] Ph.D. Positions in Algorithms at the University of Augsburg

Up to two Ph.D. positions are to be filled in April 2018 or earlier
in the Theoretical Computer Science group of Professor Torben Hagerup
at the University of Augsburg.

The successful applicant(s) will be expected to conduct independent
research in the area of efficient algorithms that fits in well with
existing activities of the group and to work towards obtaining a Ph.D.
degree at the University of Augsburg. A prior master's degree in
computer science, mathematics or a closely related field is required.
In exceptional cases it may be possible to hire a person who already
holds a Ph.D. degree (postdoc).

The positions are paid according to level TVL E13 of the German
salary scale for public employees (the monthly gross salary
depends on an employee's personal situation, but is likely to
exceed 3600 euros). The initial appointment, for three years, can
be extended up to a total of six years.

The positions are associated with teaching obligations that are
typically fulfilled through work as a teaching assistant for
an existing course. Because the language of teaching is German,
applicants should be proficient in German or have a plausible
willingness and ability to learn the language within a short
period of time.

The Theoretical Computer Science group conducts research in algorithms
and data structures with an emphasis on graph algorithms. Current
interests include space-efficient computing, fixed-parameter-tractable
(FPT) algorithms and algorithms for NP-complete problems. A certain
amount of implementation work is also carried out.

Persons interested in applying for the positions are invited to send
an informal indication of their interest and any questions that they
may have to hagerup@informatik.uni-augsburg.de. A formal application
(in English or German) should include a cover letter motivating the
applicant's interest in the positions and indicating the date of his
or her availability, a CV, a copy of the applicant's master's thesis,
and any other material suitable for demonstrating the applicant's
aptitute for the job. Applications may be sent electronically in a
single file or a small number of files in a standard format (such as
PDF) to the address above.

Applications will be reviewed starting on Dec. 1, 2017. Applications
that are received later will be considered if the positions are still
open at that time.

Prof. Torben Hagerup
Institut fuer Informatik
University of Augsburg
86135 Augsburg
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/
*
**********************************************************

[DMANET] IEEE/IFIP Man2Block 2018 - Call for Papers - Submission Deadline: January 5, 2018

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

IEEE/IFIP Man2Block 2018
International Workshop on Managing and Managed by Blockchain

Colocated with IEEE/IFIP NOMS 2018, 27 April 2018, Taipei, Taiwan

https://man2block.inria.fr

Paper submission: January 5, 2018
Notification to authors: February 28, 2018
Camera ready: March 16, 2018
Workshop date: April 27, 2018

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

The blockchain technologies and their ecosystem are growing at a high
pace. Starting from bitcoin, there are now numerous blockchain
technologies and applications, with new ones appearing every month.
Although all these innovations reside in cryptographic research and
developments, blockchain is firstly a distributed system. The
underlying infrastructure is blindly leveraged by blockchain
technologies whereas this arises serious concerns in terms of
scalability, quality-of-service, security and fault tolerance. Indeed,
monitoring and configuring such a distributed system without or with a
loosely control is naturally difficult. Even fully understanding and
predicting expected performance before a real deployment at large
scale is vital from a technical and business operations perspective.

Furthermore, blockchain is also a potential candidate to ease network
and service management. Indeed, many services over Internet rely on
pre-establish trust among entities which is hard to maintain at large
scale and which are thus the sources of many malfunctioning or the
targets of attacks. Among them, we can cite the naming services, the
distributed cloud management, resource sharing, the PKI management, or
even distributed policy management and accountability within a
sofwtarized network architecture.

Man2Block 2018 is a dedicated venue for bringing together students,
researchers and practitioners from academia and industry who share
common interests in the management and the use of the blockchain
infrastructure and smart contracts in network, system, service
operations and management. Theoretical approaches, practical
experimentations and papers highlighting future trends and challenges
are welcomed.

Authors are invited to submit original contributions (full and short
papers) that fall into the following list of topics of interest (not
exhaustive):
- Blockchain infrastructure management
- Security
- Monitoring and configuration
- Anomaly detection
- Resource provisioning
- Blockchain QoS and QoE
- Large-scale experimentation
- Smart contract management
- Auditing
- Threat assessment
- Privacy and anonymity
- PKI for blockchains
- Simulation and evaluation methodologies
- Analytics
- Attack design and mitigation
- Blockchain architectures

======================================================================
Venue: Man2Block will be held in conjunction with IEEE/IFIP Network
Operations and Management Symposium (NOMS) 2018 in Taipei, Taiwan, 27
April 2018

Submission Instructions: Prospective authors are invited to submit
original, unpublished works for publication in the IEEE NOMS 2018
proceedings and for presentation in the workshop. Papers under review
elsewhere must not be submitted to the workshop. Submissions must be
in IEEE 2-column style and have a maximum length of 6 pages (full
paper) or 4 pages (short paper). The accepted papers will be submitted
for publication in the IEEE Xplore Digital Library. Papers will be
withdrawn from IEEE Xplore in case the authors do not present their
paper at the workshop Submissions must be made in PDF format via:
https://jems.sbc.org.br/home.cgi?c=2939

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

Man2Block Workshop co-chairs
Jérôme François, Inria Nancy Grand Est, France
Abdelkader Lahmadi, Université de Lorraine, France
Radu State, University of Luxembourg, Luxembourg
Burkhard Stiller, University of Zurich, Switzerland

**********************************************************
*
* 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] ParLearning 2018: The 7th International Workshop on Parallel and Distributed Computing for Large Scale Machine Learning and Big Data Analytics

****************************************************************************************
The 7th International Workshop on Parallel and Distributed Computing
for Large Scale Machine Learning and Big Data Analytics
http://parlearning.ecs.fullerton.edu
May 21, 2018

In Conjunction with
The 32nd IEEE International Parallel & Distributed Processing Symposium
http://www.ipdps.org
May 21 - May 25, 2018
JW Marriott Parq Vancouver
Vancouver, British Columbia, Canada
****************************************************************************************

Call for Papers

Scaling up machine-learning (ML), data mining (DM) and reasoning algorithms
from Artificial Intelligence (AI) for massive datasets is a major technical
challenge in the time of "Big Data". The past ten years have seen the rise
of multi-core and GPU based computing. In parallel and distributed
computing, several frameworks such as OpenMP, OpenCL, and Spark continue to
facilitate scaling up ML/DM/AI algorithms using higher levels of
abstraction. We invite novel works that advance the trio-fields of ML/DM/AI
through development of scalable algorithms or computing frameworks. Ideal
submissions should describe methods for scaling up X using Y on Z, where
potential choices for X, Y and Z are provided below.

Scaling up

Recommender systems
Optimization algorithms (gradient descent, Newton methods)
Deep learning
Sampling/sketching techniques
Clustering (agglomerative techniques, graph clustering, clustering
heterogeneous data)
Classification (SVM and other classifiers)
SVD and other matrix computations
Probabilistic inference (Bayesian networks)
Logical reasoning
Graph algorithms/graph mining and knowledge graphs
Semi-supervised learning
Online/streaming learning
Generative adversarial networks

Using

Parallel architectures/frameworks (OpenMP, OpenCL, OpenACC, Intel TBB)
Distributed systems/frameworks (GraphLab, Hadoop, MPI, Spark)
Machine learning frameworks (TensorFlow, PyTorch, Theano, Caffe)

On

Clusters of conventional CPUs
Many-core CPU (e.g. Xeon Phi)
FPGA
Specialized ML accelerators (e.g. GPU and TPU)

Proceedings of the Parlearning workshop will be distributed at the
conference and will be submitted for inclusion in the IEEE Xplore Digital
Library after the conference.

Awards

Best Paper Award: The program committee will nominate a paper for the Best
Paper award. In past years, the Best Paper award included a cash prize.
Stay tuned for this year!
Travel awards: Students with accepted papers have a chance to apply for a
travel award. Please find details on the IEEE IPDPS web page.

Important Dates

Paper submission: January 13, 2018 AoE
Notification: February 10, 2018
Camera Ready: February 24, 2018

Paper Guidelines

Submitted manuscripts should be upto 10 single-spaced double-column pages
using 10-point size font on 8.5x11 inch pages (IEEE conference style),
including figures, tables, and references. Format requirements are posted
on the IEEE IPDPS web page.

All submissions must be uploaded electronically.

Organization

General co-chairs: Henri Bal (Vrije Universiteit, The Netherlands) and
Arindam Pal (TCS Research and Innovation, India)
Technical Program co-chairs: Azalia Mirhoseini (Google Brain, USA) and
Thomas Parnell (IBM Research – Zurich, Switzerland)
Publicity chair: Yanik Ngoko (Université Paris XIII, France)
Steering Committee: Sutanay Choudhury (Pacific Northwest National
Laboratory, USA), Anand Panangadan (California State University, Fullerton,
USA), and Yinglong Xia (Huawei Research America, USA)

Technical Program Committee

Indrajit Bhattacharya, TCS Research, India
Vito Giovanni Castellana, Pacific Northwest National Laboratory, USA
Tanmoy Chakraborty, IIIT Delhi, India
Daniel Gerardo Chavarria, Pacific Northwest National Laboratory, USA
Sutanay Choudhury, Pacific Northwest National Laboratory, USA
Zhihui Du, Tsinghua University, China
Anand Eldawy, University of Minnesota, USA
Erich Elsen, Google Brain, USA
Dinesh Garg, IIT Gandhinagar and IBM Research, India
Kripabandhu Ghosh, IIT Kanpur, India
Saptarshi Ghosh, IIT Kharagpur, India
Kazuaki Ishizaki, IBM Research - Tokyo, Japan
Farinaz Koushanfar, UCSD, USA
Gwo Giun (Chris) Lee, National Cheng Kung University, Taiwan
Carson Leung, University of Manitoba, Canada
Animesh Mukherjee, IIT Kharagpur, India
Debnath Mukherjee, TCS Research, India
Francesco Parisi, University of Calabria, Italy
Saurabh Paul, PayPal, USA
Lijun Qian, Prairie View A&M University, USA
Lingfei Wu, IBM T. J. Watson Research Center, USA
Jianting Zhang, City College of New York, USA

Regards,
Arindam Pal, Ph.D.
Research Scientist
TCS Research
http://www.cse.iitd.ac.in/~arindamp/

**********************************************************
*
* 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] computational optimization

Call for Papers

11th International Workshop on Computational Optimization (WCO18)
Poznan, Poland, September 9-12, 2018

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2018

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.

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

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO18 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2018
Position paper submission : May 15th, 2018
Author notification : June 12th, 2018
Final paper submission and registration : July 03, 2018
Conference date : September 9-12, 2018

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2018@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Numerical Search and Optimization

Dear Colleagues,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "Numerical Search and Optimization"
at the
9th Conference on Numerical Methods and Applications NM&A'18,
to be held 20-24 August 2018 in Borovets, Bulgaria.
The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies,
Bulgarian Academy of Sciences
Prof. Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain, and
Prof. Kalin Penev, (kalin.penev@solent.ac.uk) School Media Arts and
Technology, Southampton Solent University, UK.

Topics

The list of topics includes, but is not limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multi-objective optimization
- optimization in dynamic and/or noisy environments
- large scale optimization
- parallel and distributed approaches in optimization
- random search algorithms (simulated annealing, tabu search, free
search and other derivative free optimization methods).
- nature inspired optimization methods (evolutionary algorithms,
ant colony optimization, particle swarm optimization, immune
artificial systems etc.).
- hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
- optimization methods for learning processes and data mining
-classical operational research problems (knapsack, traveling salesman, etc)
-computational biology and distance geometry
-data mining and knowledge discovery
-human motion simulations; crowd simulations
-industrial applications
- computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc

Proceedings
The refereed and presented papers will be published as a special
volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
April 15, 2018
Notification of acceptance of the talks on the basis of the
submitted abstract
April 30, 2018
Deadline for submission of full papers
June 10, 2018
Notification of acceptance of full papers
July 10, 2018
Submission of accommodation forms
July 15, 2018
Final version of paper submission
September 30, 2018

Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http:http://nma18.fmi.uni-sofia.bg/

Special session organizers
Prof. S. Fidanova (stefka@parallel.bas.bg) , Institute of Information
and Communication Technologies, Bulgarian Academy of Science.
Prof. Gabriel Luque (gabriel@lcc.uma.es), University of Malaga, Spain.
Prof. Kalin Penev (penev@solent.ac.uk), School Media Arts and
Technology, Southampton Solent University, UK.

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Odysseus 2018 - Cagliari, June 3-8, 2018 - 2nd call for extended abstracts

Dear colleague,

We kindly invite you to *Odysseus 2018*, the 7th Workshop on Freight
Transportation and Logistics, which will be held on June 3-8, 2018, in
Cagliari, Italy.

Please do not forget that the deadline for the submission of extended
abstracts is *November**10th 2017*. For further information, please
visit the workshop website:

http://convegni.unica.it/odysseus2018/

Technical topics of the conference include (but are not limited to):

• Vehicle Routing
• Fleet and Crew Management
• Modal/Intermodal Transportation
• Terminal Management
• Supply Chain Logistics
• Network Design and Planning
• City Logistics
• Synchromodality
• Physical Internet
• Intelligent Transportation Systems
• Humanitarian Logistics

Submitted extended abstracts should be up to 4 pages length, written in
English and typeset using either the LaTeX or the Word template provided
at http://convegni.unica.it/odysseus2018/submission/. Extended abstracts
will be peer-reviewed and acceptance of the contributions will be based
on originality of the work, suitability regarding the main topic of the
workshop, and overall quality of the submission.

Looking forward to welcoming you next June in Cagliari

/The organizing committee of Odysseus 2018//
/

Note: Please accept our apologies if you receive multiple copies of this
call/
/

**********************************************************
*
* 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] Uni Trier, W3 Nonlinear Optimization, deadline 27.11.2017

The Department of Mathematics at Trier University,
Germany invites applications to a W3-Professorship in

Nonlinear Optimization.

Full details can be found at:
https://www.uni-trier.de/fileadmin/organisation/ABT3/Stellen_Professoren/P5_17_W3_Professur_FB_IV_Mathe_NF_Dür.pdf
(on https://www.uni-trier.de/index.php?id=12072 )

The application deadline is November 27th, 2017.
**********************************************************
*
* 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] 1-week extension for DCC

Dear Colleague,

The chairs of the next *Data Compression Conference* (DCC '18) have
announced a 1-week extension, so the deadline is now November 8th instead
of 1st. Again, we invite you to submit to our special session on
*c**omputation
over compressed data* interesting new results you may have both on *compact
data structures* and on *compression-aware algorithms*.

The DCC '18 session will extend the special sessions at DCC '14 and '16 on
*c**ompact data structures*, which resulted in special issues of the *Journal
of Discrete Algorithms* (published) and *Algorithmica* (in press):
---
http://www.sciencedirect.com/science/journal/15708667/43/supp/C?sdc=1
https://link.springer.com/journal/453/topicalCollection/AC_8
c2552fc6eb1f8e828de642aaeb0f48f/page/1
---
We plan to invite extended versions of selected papers from the DCC '18
session to a special issue of *Information and Computation*.

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

Best regards,
Travis Gagie and Gonzalo Navarro
(session co-chairs)

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

[DMANET] Postdoc positions in Budapest (algorithms & complexity)

Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Consolidator Grant
SYSTEMATICGRAPH: Systematic mapping of the complexity landscape of hard
algorithmic graph problems" held by Dániel Marx. The positions are for
one year, with the possibility of renewal.

http://www.cs.bme.hu/~dmarx/job.html

The goal of the project is to put the search for tractable algorithmic
graph problems into a systematic and methodological framework: instead
of focusing on specific sporadic problems, we intend to obtain a unified
algorithmic understanding by mapping the entire complexity landscape of
a particular problem domain. A dichotomy theorem is a complete
classification result that characterizes the complexity of each member
of a family of problems: it identifies all the cases that admit
efficient algorithms and proves that all the other cases are
computationally hard. Achieving such a complete understanding for a
family of problems requires the joint effort of algorithm design (to
identify all the tractable cases) and computational complexity (to give
lower bounds for the hard cases). While dichotomy theorems are common in
the context of Constraint Satisfaction problems, there is growing
evidence that the theory of algorithmic graph problems have an equally
rich set of classification results waiting to be discovered. The
framework of parameterized complexity and fixed-parameter tractability
seems to be a particularly good source of potential dichotomy theorems,
but the search for polynomial-time exact or approximation algorithms can
be also done in such an exhaustive manner. The project will demonstrate
that complete complexity classifications are feasible for a wide range
of graph problems coming from areas such as finding patterns, routing,
and survivable network design, and novel algorithmic results and new
levels of algorithmic understanding can be achieved even for classic and
well-studied problems.

The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity. Strong background
parameterized complexity, fixed-parameter tractability, graph theory,
combinatorics, or approximation is of advantage.

The review of applicants will begin immediately and continue until the
positions are filled. The ideal starting date is March 1, 2018. A
completed PhD degree is an administrative prerequisite for starting the
position. Applications received by November 15, 2017 will receive full
consideration. To apply, send a CV and a research statement by email to
Dániel Marx ( dmarx at cs dot bme dot hu ) and arrange two letters of
recommendation to be send to this address. Questions and informal
inquiries are welcome.

http://www.cs.bme.hu/~dmarx/job.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] IFORS OR-Resources to Developing Countries

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.

"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/) 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,

Sue Merchant,
Elise del Rosario,
Gerhard-Wilhelm Weber

PS: Feedback is welcome via elise@jgdelrosario.com, suemerchant@hotmail.com,
gerhard.weber@poznan.put.pl.

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

[DMANET] CFP : ICCA18

************C A L L F O R P A P E R S*************

UNDER THE PATRONAGE OF H.H. Abdul Rahim Mrad - Former MINISTER of EDUCATION and MINISTER OF DEFENSE - Lebanon

International Conference on Computer and Applications
Third Edition

July 25-26, 2018, RAMADA RAOUCHEH, Beirut, Lebanon

EDAS NUMBER 24063 - IEEE CONFERENCE NUMBER 43450
In the Memory of Professor Lotfi A. Zadeh Founder of Fuzzy Logic

LATEST NEWS: ICCA'17 Proceedings Published in IEEE XPLORE

AN INDEXED CONFERENCE - SPONSORED BY SPRINGER-VERLAG & IEEE & IEEE COMPUTER SOCIETY (Technical Co-sponsorship)

The International Conference on Computer and Applications ICCA 18 is an annual event focusing
on state of the art technologies pertaining to digital information, communications and multimedia.
It addresses all applications of computing including (but not limited to) connected health,
information security, edutainment and serious games, education, grid computing, transportation,
social computing, natural language processing, knowledge extraction and reasoning, knowledge
extraction, image and pattern processing, virtual reality, cloud computing, robotics, networks
algorithms, web engineering, big data analytics, ontology, constraints satisfaction, cryptography
and steganography, neural networks, artificial intelligence, biometry and bio-informatics, embedded
systems, computer graphics, algorithms and optimization, Internet of things and smart cities. It
is an opportunity for researchers and practitioners to meet together and discuss the recent trends
in computer applications. Young researchers are highly encouraged to submit their work to the
conference.

Technical Committee include
-------------------------------------

Prof. Abdulmutaleb Elsaddik (Chair, IEEE FELLOW, Canada)
Prof. Patrick S. P. Wang (USA)
Dr. Sumaya Al-Maadeed (Qatar)
Dr. Justin varghese (Saudi Arabia)
Prof. Mohamed Jemni (Tunisia)
Prof. Jinana Faidhi (Canada)
Prof. Omara Karam (Dean, Egypt)
Prof. Abed Elsadik (Canada)
Dr. Saudia Subash, (India)
Dr. Nabil Sahli (Oman)
Prof. Jianfeng Ma
Prof. Albert Zomaya (Australia)
Prof. Hassan Ali Artail (Lebanon)
Dr. J. Subash Bose (Saudi Arabia)
Prof. Osman Ibrahim (Egypt)
Prof. Chadi Assi (Canada)
Prof. Ali M. Jaoua (Qatar)
Dr. Jalal Akaichi (Saudi Arabia)
Prof. Ali Haidar (Lebanon)
Prof. Mohammad Khalil (Lebanon)
Prof. Adrian Constantin (Vienna)
Prof. Wenliang Du (USA)
Dr. Majdi Rawashdeh (Jordan)
Dr. Mohamad EID (UAE)
Prof. Peter Mark Athanas
Prof. Sabah Mohammad (Canada)
Prof. Youcef Baghdadi (Oman)
Prof. Moutaz Saleh (Qatar)
Dr. Mohsin Bilal (USA)
Prof. Nima Bari (USA)
Dr. Khaled Khan (Qatar)
Dr. Nader Hossain (Canada)
Dr. Daouad Daouad (Jordan)
Prof. Samir A. Elsaoud (Egypt)
Prof. Mohamed Jemni (Tunisia)
Dr. Abdelaali Hassaine (Qatar)
Prof. Sadok Benyahia (Tunisia)
Dr. Borhan Marzougui (UAE)
Prof. Hassan Ali Artail (Lebanon)
Prof. Fadi Dornaika (Spain)
Prof. Abdul Sadka (UK)
Prof. Med Salim Bouhlel (Tunisia)
Prof. Ali Elzaart (Lebanon)
Prof. A. Vasilakos (Sweden)
Prof. Hany Ammar (USA)
Dr. Islam Taj-Eddin (Egypt)
Dr. Borhan Marzougui (UAE)
Dr. Mohamad EID (UAE)
Dr. Ahmad S. Mashhour (Bahrain)
Prof. ELSayed ElHorbaty (Egypt)
Prof. Mudasser F. Wyne (USA)
Prof. Abdel Badi Salem (Egypt)
Dr. Mohamed M. Yeddes (UAE)
Prof. Ezekiel F. Adebiyi (Nigeria)
Prof. Wald. Koczkodaj (Canada)
Prof. Taleb Obaid (Iraq)
Prof. Sebti Foufou (Qatar)
Prof. Abdelaziz Bouras (Qatar)
Prof. Azlinah Mohamed (Malaysia)
Prof. Zakaria Maamar (UAE)
Dr. Mohamed A. Mellal (Algeria)
Dr. Osama Shata (Qatar)
Prof. Arthur Edwards (Colima)
Prof. Hossam El Sofany (Egypt)
Prof. Arafat Awajan (Jordan)
Dr. Khalid AbualSaud (Qatar)
.............................

Submission Instructions
-------------------------------

Authors are encouraged to submit high quality, original work written in good English that has neither appeared in,
nor is under consideration by other conferences or journals. Paper submission is done through EDAS management
system. A Special privileges will be given to young researchers (i.e., PhDs, Postdoctoral fellow).

Proceedings Publication
-------------------------------

All accepted and registered papers will be submitted to IEEE for publication. ICCA'17 is published recently
in IEEE Digital Library.

Alternatively, the program committee will select the best papers to be published by Springer-Verlag in a book
on "Recent Trends in Computer Applications" and in a special issue of the journal of Complex & Intelligent
Systems (Indexed in Web Of Science).

CIS Springer Journal Special Issue
-------------------------------------------

The scientific committee will select the best presented papers for submission in the journal of Complex
& Intelligent Systems (SPRINGER). This special issue will focus on recent trends in computer applications
including evolutionary systems, data mining, machine learning, data science, multiagent, simulation,
visualization, and knowledge discovery. The deadline for submission is October 22nd, 2018. Please follow
the hyperlink 'Submit Online' on the journal's webpage and upload your manuscript files following the
'Instructions for Authors'. In the journal's electronic submission system, you will find the voice
'ICCA2017' active in the drop-down menu, to be selected when submitting. Any inquiries can be directed
to the leading volume Editor Prof. Jihad Mohamad ALJA'AM (jaam@qu.edu.qa or jaljaam@gmail.com).
Guest Editors are Prof. Abdul Sadka (Brunel University, United Kingdom) and Prof. Abdulmotaleb
El Saddik (Canada).

Springer Book
------------------

The best papers will be selected after a second round of peer review for publications in an edited volume
by SPRINGER after the conference. Interested authors should update their papers based on the ICCA'18
reviewers comments (research work, contribution, English, etc.). The publication of the accepted paper
doesn't require any additional payment from the authors. The focal point for Springer is:

Dr. Nabil Khélifi
Publishing Editor | Middle East & North Africa Program | Springer
Heidelberg | Germany

All the papers will be peer reviewed by the ICCA'18 Technical Program Committee to improve their quality
before their publications as chapters in the SPRINGER Book.

Registration and Visa Information Instructions
-------------------------------------------------------------

The registration fee covers one paper publication, two lunches and the coffee breaks during the conference.
All accepted papers should be registered before by the deadline. Authors should sign the copyright form
fully signed and submit it with their camera-ready.

The conference website: http://www.ijcis.info/icca18ieee.htm

Contact:
Eng. Dana Bandock
icca@ijcis.info
dana.bandock@ijcis.info

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

[DMANET] 2nd CFP: ICAPS 2018 Novel Applications Track

[apologies for multiple copies]

Second Call for Papers

=== ICAPS 2018 NOVEL APPLICATIONS TRACK ===

The 28th International Conference on
Automated Planning and Scheduling (ICAPS 2018)

June 24-29, 2018, Delft, The Netherlands

icaps18.icaps-conference.org
(icaps18.novelapps@gmail.com for inquiries)

Abstracts due: 17 November 2017
Papers due: 21 November 2017
Notification: 29 January 2018

SECOND CALL FOR PAPERS

Following the success of the Special Track on Novel Applications at previous
ICAPS conferences, ICAPS 2018 will host again a Novel Applications Track.

ICAPS 2018, the 28th International Conference on Automated Planning and
Scheduling, will take place in Delft, The Netherlands, 24-29 June 2018. ICAPS
2018 is part of the ICAPS conference series, the premier forum for exchanging
news and research results on theory and applications of intelligent planning and
scheduling technology.

The goal of this special track is to encourage the submission of papers
describing all aspects of the development, deployment, and evaluation of
planning and scheduling systems for real-world problems. Topics addressed in
applications papers may include, but are not limited to:

* Description and modelling of novel application domains
* Engineering issues in using planning and scheduling techniques
* Integration of multiple planning and scheduling techniques, or of planning and
scheduling techniques with techniques from other areas or disciplines
* User interface design, visualization, and explanation for a planning and
scheduling application
* Experiences in development, deployment, and maintenance of planning and
scheduling applications
* Evaluation, testing, and validation of planning and scheduling applications
* Assessment of impact on end users

This track has a separate programme committee consisting of individuals with
experience working on applications of Planning and Scheduling technology to real
world problems. Papers submitted to this track will be evaluated using
different criteria, particularly:

* Significance of the application problem being addressed
* Importance of planning and scheduling technology to solution of the problem
* Novelty of the application and technical approach to the application
* Evaluation of the system and its deployment
* Clarity of the descriptions of the application problem, techniques used, and
results
* Applicability to real-world problems such as by dataset complexity and actual
use in practice

DEADLINES

17 November 2017 - Abstracts (electronic submission) due
21 November 2017 - Papers (electronic submission, PDF) due
29 January 2018 - Notification of acceptance

The reference timezone for all deadlines is UTC-12. That is, as long as there
is still some place anywhere in the world where the deadline has not yet passed,
you are on time.

SUBMISSION INSTRUCTIONS

Authors may submit long papers (8 pages AAAI style plus up to one page of
references) or short papers (4 pages plus up to one page of references). The
type of paper must be indicated at submission time. For more information, see
icaps18.icaps-conference.org.

All papers, regardless of length, will be reviewed against the standard criteria
of relevance, originality, significance, clarity and soundness, and are expected
to meet the same high standards set by ICAPS. Full technical papers are
expected to report on a significant applications effort, emerging or deployed,
while short papers may report on more limited aspects of a particular
application, approach or study.

Authors making multiple submissions must ensure that each submission has
significant unique content. Papers submitted to ICAPS 2018 may not be submitted
to other conferences or journals during the ICAPS 2018 review period nor may
they be already under review or published in other conferences or journals.
Overlength papers will be rejected without review.

All submissions will be made electronically, through the EasyChair conference
system: https://www.easychair.org/conferences/?conf=icaps2018

NOVEL APPLICATIONS TRACK CHAIRS

Hana Rudova (Masaryk University, Czech Republic)
Shirin Sohrabi (IBM Research, USA)

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

[DMANET] EuroCG 2018: First Call for Papers

The 34th European Workshop on Computational Geometry (EuroCG 2018) will
be held on March 21-23, 2018 at the Department of Computer Science at
Freie Universität Berlin, with a welcome reception on March 20 to launch
the conference. EuroCG is an annual workshop that combines a strong
scientific tradition with a friendly and informal atmosphere. The
workshop is a forum where established researchers and students can meet,
discuss their work, present their results, and establish scientific
collaborations.

Topics of interest cover all aspects of computational geometry,
including but not limited to the following:

- discrete and combinatorial geometry and topology
- design and analysis of geometric algorithms and data structures
- implementation and experimental evaluation of geometric algorithms
- numerical and algebraic issues arising from implementations
- analysis of geometric configurations
- geometric modeling, visualization and simulation
- combinatorial optimization
- graph drawing
- computer-aided design and manufacturing
- structural molecular biology
- geographic information systems
- robotics and virtual worlds

Website: https://conference.imp.fu-berlin.de/eurocg18/home

=====
SUBMISSION AND PROCEEDINGS

We invite authors to submit extended abstracts (6 pages, single column)
of original research. Submissions will be handled through EasyChair.

EuroCG does not have formally reviewed proceedings. A booklet of
abstracts, without ISBN, will be accessible online from the webpage for
the benefit of the community and must be regarded as a collection of
preprints rather than a formally reviewed selection of papers. Results
presented at EuroCG are expected to appear in other conferences with
formal proceedings and/or in journals. In particular, papers that have
just been submitted to other formally reviewed conferences are eligible
for being presented at EuroCG, assuming they have not been presented in
a conference or published in a journal by the time of the conference.

=====
INVITED SPEAKERS

Nina Amenta, UC Davis
Prosenjit Bose, Carleton University
Raúl Rojas, Freie Universität Berlin

=====
PROGRAM COMMITTEE

Mikkel Abrahamsen, 3Shape A/S
Helmut Alt, Freie Universität Berlin
Luis Barba, ETH Zürich
Kevin Buchin, TU Eindhoven
Maike Buchin, TU Dortmund
Erin Wolf Chambers, Saint Louis University
Claudia Dieckmann, Freie Universität Berlin
Esther Ezra, Georgia Tech
Panos Giannopoulos, Middlesex University London
Elena Khramtcova, Université libre de Bruxelles (ULB)
Christian Knauer, Universität Bayreuth
Matias Korman, Tohoku University
Irina Kostitsyna, TU Eindhoven
Maarten Löffler, Universiteit Utrecht
Wolfgang Mulzer, Freie Universität Berlin (chair)
Eunjin Oh, POSTECH
Evanthia Papadopoulou, Università della Svizzera italiana
André van Renssen, NII Tokyo
Marcel Roeloffzen, NII Tokyo
Günter Rote, Freie Universität Berlin
Vera Sacristán, Universitat Politècnica de Catalunya
Maria Saumell, The Czech Academy of Sciences
Lena Schlipf, FernUniversität in Hagen
Christiane Schmidt, Linköping University
André Schulz, FernUniversität in Hagen
Fabian Stehn, Universität Bayreuth
Monique Teillaud, INRIA Nancy - Grand Est
Birgit Vogtenhuber, TU Graz
Carola Wenk, Tulane University

====
ORGANIZING COMMITTEE

Helmut Alt, Freie Universität Berlin
Bahareh Banyassady, Freie Universität Berlin
Jonas Cleve, Freie Universität Berlin
Claudia Dieckmann, Freie Universität Berlin
Frank Hoffmann, Freie Universität Berlin
Boris Klemz, Freie Universität Berlin
Katharina Klost, Freie Universität Berlin
Klaus Kriegel, Freie Universität Berlin
Wolfgang Mulzer, Freie Universität Berlin (chair)
Günter Rote, Freie Universität Berlin
Nadja Scharf, Freie Universität Berlin
Max Willert, Freie Universität Berlin

====
IMPORTANT DATES

Submission Deadline: January 09, 2018, 23:59 AoE
Acceptance Notification: February 07, 2018
Camera-ready version: February 19, 2018
Early Registration: February 19, 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] PhD/project position at TU Chemnitz in Discrete and Algorithmic Mathematics

Open Project-Position

At the Department of Mathematics of Technische Universitaet Chemnitz
a position is available (subject to pending official approval)
in the Algorithmic and Discrete Mathematics group for the project

"Mixed Integer and Semidefinite Power Flow Optimization"

within the joint BMBF-project "Consistent Optimization aNd
Stabilization of Electrical NetworkS" (CONSENS)
starting on 01.01.2018 or later at the level

Wissenschaftlicher Mitarbeiter/Wissenschaftliche Mitarbeiterin
(100%, Entgeltgruppe 13 TV-L)

until 31.12.2020. The position is subject to the usual
regulations according to Saxonian law.
The official German announcement is available at

https://www.tu-chemnitz.de/verwaltung/personal/stellen/221033_1_TM.php

Applicants should have completed their studies at least at master
level in a program with strong mathematical background in convex
and discrete optimization.

The project focuses on the scientific development, investigation
and algorithmic implementation of large scale semidefinite
optimization methods for power flow models. The topic is intended
for advancing the scientific qualification of the applicant towards
a PhD or beyond.

Applications should refer to the official announcement
and should be directed electronically or by standard mail
until November 12, 2017 to

Prof. Dr. Christoph Helmberg
Technische Universitaet Chemnitz
Fakultaet fuer Mathematik
Reichenhainer Str. 39/41
09126 Chemnitz

Phone: 0371 531 34122
Email: helmberg@mathematik.tu-chemnitz.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] CTW18 (Paris, 18-20 June 2018)

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

June 18-20, 2018, Paris (France)

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 structures 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 2, 2018, and EUR 300
afterwards. For PhD/MSC students and/or postdocs, EUR 100 if received
by May 2, 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.

Abstract Submission
-------------------
Submit extended abstracts of at most 4 pages using the Easychair link
(not there yet but coming soon) on the workshop website, no later than
Feb 1st, 2018, using the templates (coming soon too) 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
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/
*
**********************************************************