Thursday, November 30, 2017

[DMANET] Tenure-track positions at the University of Victoria in Canada

The Department of Computer Science at the University of Victoria is seeking applications for up to four tenure track faculty positions at the assistant professor level with an expected start date of July 1, 2018. Focus areas for these positions include optimization and cyber security. Deadline for application is December 15, 2017.

Website: https://www.uvic.ca/engineering/computerscience/assets/docs/employment/CSC-Faculty-Posting-ResearchTrack-final2.pdf
Email: search@csc.uvic.ca<mailto:search@csc.uvic.ca>

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

Wednesday, November 29, 2017

[DMANET] Workshop "Words and Complexity", Lyon, February 2018

*** Apologies for multiple copies ***
*** Please kindly forward to those who may be interested ***


Dear colleagues,

You will find below the second call for participation to our workshop on words and Complexity.
Note that the deadline for grant applications is this*Friday, December 1st. *
*************************************************************************


Workshop on Words and Complexity

February 19-23, 2018
Lyon, France

https://wordscomplexity.sciencesconf.org/

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

Dear Colleagues,

We are pleased to announce the workshop "Words and Complexity" to be
held at University de Lyon, February 19-23, 2018. It will focus on
combinatorics on words and its interactions with other areas of
mathematics and theoretical computer science. Note that this workshop is
part of the thematic semester "Graphs, Groups and Dynamics
<http://milyon.universite-lyon.fr/recherche/semestres-et-mois-thematiques/2017-2/groupes-graphes-et-dynamique/>"
(September, 2017 to February, 2018) sponsored by the Milyon Labex
<http://milyon.universite-lyon.fr/>.

Registration is free of charge but compulsory and must be done
before*January 10, 2018*.

The workshop will offer both invited and short talks, as well as time
for working sessions. The list of the invited speakers can be found here
<https://wordscomplexity.sciencesconf.org/resource/page/id/4>. Slots for
short talks (approx. 20 min) are available. If you wish to give such a
talk, please submit an abstract on submission page before *January 10,
2018*.

In addition, we are offering a limited number of grants for doctoral
students, postdoctoral fellows and young researchers. Deadline to apply
is *December 1, 2017*. Refer to the section "Student grants" of the
conference web-page for instructions on how to apply.

For registration, abstract submission, grant application and further
information please visit the corresponding webpages :
https://wordscomplexity.sciencesconf.org/

Looking forward to seeing you in Lyon,

The organising committee
Nathalie Aubrun
Eric Duchene
Aline Parreau
Michaël Rao
Luca Zamboni

**********************************************************
*
* 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: Last Deadline Extension

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

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: 6th December 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/
*
**********************************************************

Tuesday, November 28, 2017

[DMANET] SPAA 2018 Call for Papers

==================================================================
SPAA 2018 Call for Papers
==================================================================

30th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2018)
July 16 - 18, 2018
Vienna, Austria
https://spaa.acm.org/

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

Important Dates:

Submission deadlines:
- Abstract registration: Feb 6, 11:59pm EST
- Regular papers: February 13, 11:59pm EST
- Brief announcements: February 13, 11:59pm EST

These are firm deadlines. No extensions will be granted.

- Rebuttal period: April 2-4, 11:59pm EST
- Notification: April 18

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

Submissions are sought in all areas of parallel algorithms and
architectures, broadly construed, including both theoretical and
experimental perspectives. Topics of interest include, but are not
limited to:

- Parallel and Distributed Algorithms
- Parallel and Distributed Architectures
- Parallel and Distributed Data Structures
- Multiprocessor and Multicore Architectures
- Parallel Complexity Theory
- Transactional Memory Hardware and Software
- Scheduling in Parallel Systems
- Instruction Level Parallelism and VLSI
- Compilers and Tools for Concurrent Programming
- Specification and Verification of Concurrent Systems
- Mobile, Ad-Hoc, Wireless and Sensor Networks
- Algorithms for GPUs and Heterogeneous Hardware
- Fault Tolerance and Reliability
- High-Performance Computing and Architectures
- Self-Stabilization and Self-Organization
- Green and Power-Efficient Algorithms and Architectures
- Algorithms for Social Networks
- Security and Privacy in Parallel/Distributed Systems
- Game Theory and Collaborative Learning
- Biological Distributed Algorithms
- Network Algorithms
- Algorithms for Routing and Information Dissemination
- Resource Management and Awareness
- I/O Algorithms and Architectures
- Parallel and Distributed Issues in Big Data
- Peer-to-Peer Systems

Regular papers:

Regular papers should report on original research, submitted exclusively
to this conference. Submissions may not exceed ten (10) single-spaced
double-column pages, in addition to references and an optional appendix.
Papers will be judged based on quality, not their lengthâ€"shorter
papers are welcome. All necessary details to substantiate the main
claims of the paper should be included either in the body of the paper
or in a clearly marked appendix.

Brief announcements:

SPAA also solicits brief announcements that raise issues of interest to
the SPAA community. Brief announcements may not exceed two (2)
single-spaced double-column pages, in addition to references and an
optional appendix. Examples of good brief announcements include: (i)
papers previously published elsewhere of interest to SPAA, (ii) work in
progress, (iii) announcement of tools/libraries, (iv) challenge problems
posted to the community, (v) corrections to earlier results. Brief
announcements may also include smaller results of interest.

Authors may request that a regular paper be considered as a brief
announcement. As far as possible, the program committee will remain
blind to this request until status as a regular paper has been resolved.
Such a request will not affect the chances the manuscript be accepted as
a regular paper.

Submission details:

Manuscripts submitted for review must use a single-spaced double-column
format for 8.5x11-inch paper, use at least a 9-point font size, and have
reasonable margins and spacing throughout. Submissions may, but are not
required to, adopt the final ACM sigconf format from
https://www.acm.org/publications/proceedings-template. Regular papers
may not exceed ten (10) pages and brief announcements may not exceed two
(2) pages. References and the appendix do not count toward the limit,
but everything else does. Visit this link for submission details.

Awards:

Every regular paper is eligible for the best paper award.

==================================================================
Program Committee:

PC Chair: Jeremy Fineman (Georgetown University)

Ittai Abraham (VMware)
Kunal Agrawal(Washington University in St Louis)
Grey Ballard(Wake Forest University)
Michael Bender(Stony Brook University)
Guy Blelloch(Carnegie-Mellon University)
Aydın Buluç(Lawrence Berkeley National Lab)
Rezaul Chowdhury(Stony Brook University)
Pierre Fraigniaud(SNRS and University Paris Diderot)
Seth Gilbert(National University of Singapour)
Sungjin Im(University of California, Merced)
Peter Kling(University of Hamburg)
I-Ting Angelina Lee(Washington Universtiy in St Louis)
Victor Luchangco(Oracle Labs)
Ryan Newton(Indiana University)
Gopal Pandurangan(University of Houston)
Erez Petrank(Technion – Israel Institute of Technology)
Vijaya Ramachandran(University of Texas, Austin)
Peter Sanders(Karlsruhe Institute of Technology)
Thomas Sauerwald(University of Cambridge)
Oded Schwartz(Hebrew University)
Julian Shun(Massachusetts Institute of Technology)
Nodari Sitchinava(University of Hawaii at Manoa)
Edgar Solomonik(University of Illinois, Urbana-Champaigne)
Michael Spear(Lehigh University)
Denis Trystram(University of Grenoble-Alpes)
==================================================================

Conference Committee:

General Chair
Christian Scheideler, University of Paderborn

Secretary
Jeremy Fineman, Georgetown University

Treasurer
David Bunde, Knox College

Publicity Chair
Nodari Sitchinava, University of Hawaii at Manoa

Local Arrangements Chair
Jesper Larsson Träff, TU Wien (Vienna University of Technology)

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

--
Nodari Sitchinava
Assistant Professor
AlgoPARC - Algorithms and Parallel Computing Group
Department of ICS
University of Hawaii at Manoa

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

Monday, November 27, 2017

[DMANET] CPAIOR 2018: Submission deadline extended with one week

By popular demand, the paper submission deadline has been extended with one
week. The new submission deadlines are December 8 (abstract) and December
15 (full paper).

--
CPAIOR 2018: Call for Papers (deadline extended by one week)
https://sites.google.com/view/cpaior2018/

The 15th International Conference on the Integration of Constraint
Programming, Artificial Intelligence, and Operations Research will be held
in Delft, The Netherlands, June 26-29, 2018. It will be co-located with
ICAPS, the International Conference on Automated Planning and Scheduling.

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

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

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

Submissions are of two types: regular papers (submitted for publication and
presentation) and extended abstracts (submitted for presentation only).
Outstanding regular paper submissions may be invited to be published
directly in the journal Constraints through a 'fast track' process.

This year's conference will also introduce a distinguished paper award and
a student paper award.


INSTRUCTIONS FOR REGULAR PAPERS

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

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

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

The conference proceedings will be published in the Springer Lecture Notes
in Computer Science series. All regular papers should be prepared in the
format used for that series (http://www.springer.de/comp/lncs/authors.html
).

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

Abstracts: December 8, 2017
Full papers: December 15, 2017
Rebuttal Phase: January 22-24, 2018
Notification: January 31, 2018
Camera-ready version: March 1, 2018


INSTRUCTIONS FOR EXTENDED ABSTRACTS

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

Submission schedule for extended abstracts:

Abstract: March 2, 2018
Notification: March 16, 2018


INSTRUCTIONS FOR JOURNAL FAST TRACK

A selection of outstanding submissions to the technical program will be
offered the opportunity to be published exclusively through a 'fast track'
process in the journal Constraints. Authors of these papers can opt to
extend their paper from 15 to 20 pages plus references (subject to a minor
second round of review) and be accepted directly in the journal by the time
of the conference. Invited authors who select to fast track their paper
will receive a 1-page extended abstract in the conference proceedings and
will be invited to present at the conference on the same ground as any
other accepted submission. Fast Track Journal papers should be formatted
according to the Journal Guidelines (
http://www.springer.com/computer/ai/journal/10601). The important dates for
fast track papers are:

Author opt-in decision: February 7, 2018
Extended abstract submission (for LNCS proceedings): March 1, 2018
Journal version submission: March 1, 2018
Notification: April 1, 2018
Camera-ready version: April 8, 2018

Submission Process

All papers are to be submitted electronically in PDF format by following
the instructions at the URL
https://easychair.org/conferences/?conf=cpaior2018 .


QUESTIONS

For any queries on the submission process, please contact the Program Chair
(Willem-Jan van Hoeve) using cpaior2018@easychair.org .

**********************************************************
*
* 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] Annual meeting DMV: Session on Discrete Mathematics and Computer Algebra

The annual meeting of the "Deutsche Mathematiker Vereinigung"
takes place March 5-9, 2018, at the University of Paderborn.

There will be a session on "Discrete Mathematics and Computer Algebra",
chaired by Florian Hess (Oldenburg) and Alexander Pott (Magdeburg).
Submissions of contributed talks is possible until December 10, 2017 through
the web page http://www.gdmv2018.de/

Alexander Pott (alexander.pott@ovgu.de)

--
Prof. Dr. Alexander Pott
Faculty of Mathematics
Otto-von-Guericke-University Magdeburg
Postfach 4120
39016 Magdeburg
Germany

phone (+49) 391 6758322 (direct), -6758321 (secretary)
fax (+49) 391 6711213
mobile (+49) 177 2375622

alexander.pott@ovgu.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] Faculty Positions in Combinatorics & Optimization [2nd Call]

The Department of Combinatorics and Optimization
<https://uwaterloo.ca/combinatorics-and-optimization/> at the University of
Waterloo <https://uwaterloo.ca/> invites applications for two tenure-track
faculty positions at the rank of Assistant Professor. Associate or Full
Professors with tenure will be considered in special cases that enhance the
research and teaching needs of the Department. Applicants should have
research interests in one of the following areas: Algebraic Combinatorics,
Continuous Optimization, Cryptography, Discrete Optimization, and Graph
Theory. Emphasis will be given to candidates in the areas Continuous
Optimization and Cryptography.

A Ph.D. degree and evidence of excellence in research and teaching are
required. Successful applicants are expected to maintain an active program
of research, to attract and supervise graduate students, and to participate
in undergraduate and graduate teaching. The salary range for the position
is $105,000 to $155,000. Negotiations beyond this salary range will be
considered for exceptionally qualified candidates. The effective date of
appointment is July 1, 2018.

Interested individuals should apply using the MathJobs
<https://www.mathjobs.org/jobs/jobs/10660> site. Applications should
include a curriculum vitae, research and teaching statements, and up to
three reprints/preprints. In addition, at least three reference letters
should be submitted.

Inquiries may be addressed to combopt@uwaterloo.ca or to Jochen Koenemann,
Chair, Department of Combinatorics and Optimization, University of
Waterloo, Waterloo, Ontario, Canada N2L 3G1. Closing date for receipt of
applications is December 1, 2017.

The University of Waterloo respects, appreciates and encourages diversity
and is committed to accessibility for persons with disabilities. We welcome
applications from all qualified individuals including women, members of
visible minorities, Aboriginal peoples and persons with disabilities. All
qualified candidates are encouraged to apply; however, Canadian citizens
and permanent residents will be given priority in the recruitment process.

Three reasons to apply: https://uwaterloo.ca/faculty-
association/why-waterloo
.

**********************************************************
*
* 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] PhD studentships in Mathematical Models and Algorithms for Allocating Scarce Airport Resources

http://www.eecs.qmul.ac.uk/phd/research-topics/funded#phd-studentships-in-mathematical-models-and-algorithms-for-allocating-scarc

PhD studentships in Mathematical Models and Algorithms for Allocating
Scarce Airport Resources
------------------------------
Application closing date: 01/02/2018
Start date: 02/04/2018
Research group: Operational Research
<http://www.eecs.qmul.ac.uk/research/view/operational-research-group>
Duration: 3 years YearsFunding available

The project, Mathematical models and algorithms for allocating scarce
airport resources, aims to develop new mathematical models and algorithms
for solving complex, large-scale airport resource allocation problems. We
will seek to combine aspects of airport operations, air traffic flow
management, and large-scale, deterministic, stochastic and dynamic
optimization to develop and evaluate advanced models and exact, meta- and
hyper-heuristic solution algorithms. Our ultimate goal is to develop
decision support capabilities for airport capacity allocation and
management.

The Programme represents a strong partnership between academia, the air
transport industry and policy makers. Over the six years of the Programme,
OR-MASTER will involve close collaboration with a host of international
organisations that will support the project, providing real-world data,
insights and expertise. Our partners are National Air Traffic Services
(NATS) in the UK; Eurocontrol (managing air traffic across Europe); Park
Air Systems; KLM Air France; Zurich Airport and Athens International
Airport; the research organisations linked to the national air navigation
services for Italy and Spain (SICTA and CRIDA); SESAR (Single European Sky
research body); the Airport Services Association; Goldair Handling; ACI
Europe (Airports Council International); the HALA! SESAR network of leading
researchers in Europe working in the area of Air Traffic Management
automation; NEXTOR II (National Centre of Excellence for Aviation
Operations Research); the MIT International Centre for Air Transport
Research (MIT-ICAT) in the USA; and DLR, the German Airspace Research
Centre.

All nationalities are eligible to apply for this studentship. Applications
are invited for a 3-year PhD Studentship at Queen Mary University of
London. Students are normally expected to have a 2.1 or 1st class honours
degree in Computer Science or Mathematics from a UK University or an
equivalent standard from an overseas university. The successful candidate
must have strong programming background, good analytical and communication
skills. Furthermore, a good understanding of optimization techniques,
heuristic and hyper-heuristic search is required. The student is expected
to be a team player with the ability to work as part of a team and
independently, and to prepare clear reports and research papers. The
studentship will cover EU/Home fees or International fees. The post will be
funded for 3 years.

To apply, please follow the on-line process (
www.qmul.ac.uk/postgraduate/apply) by selecting 'Computer Science in the
'A-Z list of research opportunities' and following the instructions on the
right-hand side of the web page. Please note that instead of the 'Research
Proposal' we request a 'Statement of Research Interests'. Your statement
(no more than 500 words) should answer two questions: (i) Why are you
interested in the topic described above? (ii) What relevant experience do
you have? In addition, we would also like you to send a sample of your
written work. This might be a chapter of your dissertation, or a published
paper. More details can be found at:
http://www.eecs.qmul.ac.uk/phd/apply.php

For further information, please contact: Professor Edmund Burke (
se-vp-pa@qmul.ac.uk)

Closing date for receipt of applications: 31 December 2017. Interviews
expected early January 2018.

Starting date: 01 February 2018

(please excuse terse response - sent from mobile device)
----thank you,
John.R.Woodward@gmail.com
*http://www.cs.stir.ac.uk/~jrw/ <http://www.cs.stir.ac.uk/~jrw/> *
*https://www.linkedin.com/in/johnrwwoodward
<https://www.linkedin.com/in/johnrwwoodward>*
*https://orcid.org/0000-0002-2093-8990
<https://orcid.org/0000-0002-2093-8990> *
*http://www.transitproject.co.uk/ <http://www.transitproject.co.uk/> *
*http://daase.cs.ucl.ac.uk <http://daase.cs.ucl.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] post-doc on Robust Combinatorial Optimization at Montpellier

Dear all.

We are recruiting a postdoctoral researcher to work on approximation and
complexity of robust combinatorial optimization problems, such as robust
scheduling, robust bin packing, robust min max min, ...

The postdoc will work at the LIRMM laboratory (Montpellier) with Marin
Bougeret and Michael Poss. The duration of the position is one year, with a
possible extension of 4-6 months. The salary is roughly 2000€ per month.
The candidate could start anytime.

Interested candidates should send their CV (including submitted papers) and
at least one letter of recommendation to michael.poss@lirmm.fr.


--
====================================
Michael Poss, HdR
CNRS researcher in computer science.
www.lirmm.fr/users/utilisateurs-lirmm/michael-poss
LIRMM UMR CNRS 5506
Université de Montpellier
FRANCE
====================================

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

Saturday, November 25, 2017

[DMANET] Reminder: Simons-Berkeley Research Fellowships for Fall 2018 and Spring 2019

The Simons Institute for the Theory of Computing invites applications for
Simons-Berkeley Research Fellowships for the Fall 2018 and Spring 2019
semesters. Simons-Berkeley Research Fellowships are intended for
exceptional young scientists to participate in at least one of the
semester-long programs at the institute. The Institute will host programs
on "Foundations of Data Science" and "Lower Bounds in Computational
Complexity" in Fall 2018 and "Data Privacy: Foundations and Applications"
and "Geometry of Polynomials" in Spring 2019. The deadline for receipt of
applications is December 15, 2017. For more information, see the call for
applications: https://simons.berkeley.edu/fellows2018.

--
Peter Bartlett
Associate Director, Simons Institute for the Theory of Computing
Professor, Computer Science and Statistics
UC Berkeley

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

Thursday, November 23, 2017

[DMANET] CFP DATA 2018 - 7th Int.l Conf. on Data Science, Technology and Applications (Porto/Portugal)

SUBMISSION DEADLINE

7th International Conference on Data Science, Technology and Applications

Submission Deadline: March 13, 2018

http://www.dataconference.org/

July 26 - 28, 2018
Porto, Portugal.

DATA is organized in 4 major tracks:

- Business Analytics
- Data Management and Quality
- Big Data
- Databases and Data Security



With the presence of internationally distinguished keynote speakers:
João Gama, LIAAD - INESC TEC, University of Porto, Portugal
Carsten Binnig, TU Darmstadt, Germany
Tova Milo, Tel Aviv University, Israel


A short list of presented papers will be selected so that revised and extended versions of these papers will be published by Springer.

All papers presented at the congress venue will also be available at the SCITEPRESS Digital Library (http://www.scitepress.org/DigitalLibrary/).

Should you have any question please don't hesitate contacting me.

Kind regards,
DATA Secretariat

Address: Av. D. Manuel I, 27A, 2º esq.
2910-595 Setubal, Portugal
Tel: +351 265 520 185
Fax: +351 265 520 186
Web: http://www.dataconference.org/
e-mail
: data.secretariat@insticc.org


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

[DMANET] PhD positions in Algorithms and Complexity (Durham University, UK)

A number of funded PhD positions (subject to eligibility) starting in October 2018 are available in the Algorithms and Complexity Group (ACiD) of the Department of Computer Science at Durham University.

ACiD is a broad-based theoretical computer science research group working in computational complexity, proof complexity, descriptive complexity, graph theory, exact algorithms, randomised algorithms, approximation algorithms, parameterized algorithms, finite model theory, constraint satisfaction, interconnection networks, universal algebra and mathematical logic, see http://community.dur.ac.uk/algorithms.complexity/ for further details.

Details of the application process can be found at https://www.dur.ac.uk/computer.science/postgraduate/research/. As part of the application process, interested candidates should first email to algorithms.complexity@dur.ac.uk or contact a member of ACiD directly in order to discuss a possible PhD project. For a list of ACiD members see http://community.dur.ac.uk/algorithms.complexity/people.html, and for a list of examples of possible PhD projects see http://community.dur.ac.uk/algorithms.complexity/projects.html.

Applications are admitted until 14 January 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] Fully funded PhD positions in Discrete Mathematics at University of Hamburg

We invite applications for two fully funded PhD positions in Discrete
Mathematics in the group of Professor Mathias Schacht at University of
Hamburg.

The position is fully funded through the ERC Consolidator Grant
"Problems in extremal and porbabilistic combinatorics". The salary grade
is according to 100% TV-L 13 (the standard rate for junior scientific
staff at German universities) and there are no teaching obligations.

Research within the project concerns extremal problems for hypergraphs
and for sparse random and pseudorandom discrete structures. A solid
background and knowledge in extremal and probabilistic combinatorics is
therefore desirable. But we are also inviting applications of
candidates working in related fields in Discrete Mathematics or
Theoretical Computer Science.

The starting date is negotiable and we are interested to fill the
position as soon as possible.

Applications containing at least a cover letter, a cv and a list of
references should be submitted by December 15, 2017 preferably
electronically in one PDF-file to

sekr.dm@math.uni-hamburg.de

or

Prof. Mathias Schacht
Universität Hamburg
Fachbereich Mathematik
Bundesstr. 55
20146 Hamburg

For any further questions and inquiries please contact
schacht@math.uni-hamburg.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/
*
**********************************************************

Wednesday, November 22, 2017

[DMANET] Call for Nominations for Invited Talks: 3rd Highlights of Algorithms conference (HALG 2018)

Call for Nominations for Invited Talks

3rd Highlights of Algorithms conference (HALG 2018)
Amsterdam, June 4-6, 2018
http://2018.highlightsofalgorithms.org/

The HALG 2018 conference seeks high-quality nominations for invited
talks that will highlight recent advances in algorithmic research.
Similarly to previous years, there are two categories of invited talks:
A. survey (60 minutes): a survey of an algorithmic topic that has seen 
exciting developments in last couple of years.
B. paper (30 minutes): a significant algorithmic result appearing in a
paper in 2017 or later.

To nominate, please email  halg2018.nominations@gmail.com  the following
information:
1. Basic details: speaker name + topic (for survey talk) or paper's
title, authors, conference/arxiv + preferable speaker (for paper talk).
2. Brief justification: Focus on the benefits to the audience, e.g.,
quality of results, importance/relevance of topic, clarity of talk,
speaker's presentation skills. Pay attention to potentially non-obvious
information, e.g., the topic might seem out of scope, or the material
seems inadequate for one talk.

All nominations will be reviewed by the Program Committee (PC) to select
speakers that will be invited to the conference.

Nominations deadline: December 12, 2017 (for full consideration).

Please keep in mind that the conference does not provide financial
support for the speakers.

Best regards,
Robert Krauthgamer
HALG 2018 PC 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] Tenure-track and term positions in computer science and statistics (Data Science)

The Irving K. Barber School of Arts and Sciences at the University of British Columbia, Okanagan Campus, invites applications for the following three positions in Data Science:

1) Assistant Professor (Tenure Track)
2) Assistant Professor (Limited Term)
3) Instructor (Limited Term)

Each appointment is expected to start on July 1, 2018, or soon thereafter. The successful candidates will be members of the data science cluster in the Department of Computer Science, Mathematics, Physics, and Statistics (http://cosc.ok.ubc.ca/graduate/data-science.html http://cosc.ok.ubc.ca/prospective/data-science.html).

1) Assistant Professor (Tenure Track) [Job ID#: 28243]
https://mycareers.adm.ubc.ca/psc/erecruit/EMPLOYEE/HRMS/c/HRS_HRAM.HRS_CE.GBL?Page=UBC_CE_JOB_DTL&JobOpeningId=28243
This is a tenure track appointment. Applicants must have a PhD in Computer Science or a closely related field with a focus area related to data science. Candidates must have a demonstrated record of research productivity and proven ability to obtain external funding in support of a successful program of research. They must also demonstrate commitment to student mentoring and supervision, excellence in undergraduate and graduate teaching appropriate to career stage, and an interest in graduate supervision. Preference will be given to candidates specializing in any of the following broad areas: (i) cloud computing and distributed systems, preferably with networking and service architecture knowledge; (ii) machine learning, data analytics, and big data, particularly with a focus on neural networks; (iii) cyber security and networking; or (iv) data visualization, especially in AR/VR/MR.

2) Assistant Professor (Limited Term) [Job ID#: 28242]
https://mycareers.adm.ubc.ca/psc/erecruit/EMPLOYEE/HRMS/c/HRS_HRAM.HRS_CE.GBL?Page=UBC_CE_JOB_DTL&JobOpeningId=28242
This is a limited-term position. The appointment is for a maximum duration of 3-years, renewable annually. Applicants must have a PhD in Computer Science or a closely related field with a focus area related to data science. Candidates must have a demonstrated record of research productivity and proven ability to obtain external funding in support of a successful program of research. They must also demonstrate commitment to student mentoring and supervision, excellence in undergraduate and graduate teaching appropriate to career stage, and an interest in graduate supervision. Preference will be given to candidates specializing in any of the following broad areas: (i) cloud computing and distributed systems, preferably with networking and service architecture knowledge; (ii) machine learning, data analytics, and big data, preferably with a focus on neural networks; (iii) cyber security and networking; or (iv) data visualization, especially in AR/VR/MR.

3) Instructor (Limited Term) [Job ID#: 28239]
https://mycareers.adm.ubc.ca/psc/erecruit/EMPLOYEE/HRMS/c/HRS_HRAM.HRS_CE.GBL?Page=UBC_CE_JOB_DTL&JobOpeningId=28239
This is a limited-term position. The appointment is for a maximum duration of 3-years, renewable annually. Applicants must have a PhD in Statistics or a closely related field; with a strong record of relevant university-level teaching; demonstrable commitment to teaching excellence; and promise of education leadership. Knowledge of analytics techniques (including modelling, uncertainty quantification, and modern simulation methods) is essential, as is familiarity with tools such as. Hadoop, R, Python, Tableau, and SAS.

The appointee is required to keep abreast of current developments in the field of data science and related pedagogy, but there is no requirement to undertake research activities. Nevertheless, the ability to integrate one's expertise into ongoing scholarly activities in the department and on the campus and to enhance existing strengths in Computer Science, Data Science, Mathematics, Optimization, and/or Engineering is desirable and will be a significant asset.

**********************************************************
*
* 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 optimization/renewable energy, Strathclyde Business School (Glasgow, UK)

A PhD studentship in optimization is available at the Dept. of Management Science, University of Strathclyde Business School, Glasgow, UK, for the project topic entitled "Optimization of Offshore Renewable Energy Arrays for Minimal Life-Cycle Costs".

Funding is available to cover 3 years of tuition fees plus a tax free stipend (£14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20). The studentship is open to candidates from any nationality (UK/EU/international), and the fees will be fully covered at the international level.

The application deadline is 7th December 2017. The successful candidate will need to start their PhD on 1st March 2018 at the latest (there is unfortunately no flexibility to delay the start date due to funding constraints). Only complete applications (including a successful IELTS score for non-native English speakers) from excellent candidates will be accepted, please see eligibility below.

ABOUT THE PROJECT

A fundamental difficulty in developing offshore renewable energy (ORE) sites is that the uncertain environmental conditions make accurately assessing the life-cycle costs of a site a challenging problem. In particular, logistical operations throughout the life of a site are subject to uncertain operating conditions, and it is therefore difficult to plan and schedule these operations, and to estimate the resulting durations and costs. Similarly, the generating potential throughout the operation of a given site is dependent on the realised weather as well as the availability of each asset, and uncertainties in each of these make it difficult to accurately predict the profits to be gained from energy production. Decisions on aspects such as the size, layout and composition of a site are therefore difficult to accurately quantify and compare.

This project will aim to develop optimisation models to identify the best strategy for designing an ORE site. A complimentary PhD project in the Dept. of Naval Architecture, Ocean and Marine Engineering at Strathclyde will take an alternative approach to the problem, and as both projects progress in parallel, mutual developments will feed into both projects. This will provide a cross-disciplinary approach to a challenging research problem with potential industry impact.

FUNDING AND ELIGIBILITY

Funding is available to cover 3 years of tuition fees at the UK/EU/international level, plus a tax free stipend of £14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20. The student will be given opportunities to attend a conference and/or specialized training (such as NATCOR courses) every year.

The PhD project requires a highly numerate graduate with interests in renewable energy. Candidates should have at least a strong Honours degree or equivalent (a strong 2:1 Honours degree, or a B.Sc. degree with 3.3 GPA in a 4.0 system), and/or preferably a Master's degree in a quantitative discipline such as industrial engineering, operations research, mathematics or computer science (amongst others). Experience in programming and fundamental knowledge in optimization are not essential but highly desirable. Candidates who are not native English speakers will be required to provide evidence for their English skills (such as by IELTS or similar tests that are approved by UKVI, or a degree completed in an English speaking country - please note that this is essential for visa applications of non-EU candidates. If you have a scheduled test before 15th December 2017, also feel free to submit your application).

Applications are admitted until 7th December 2017, or until a suitable candidate is found thereafter.

HOW TO APPLY

Please submit your complete applications at:

http://www.strath.ac.uk/studywithus/scholarships/strathclydebusinessschoolscholarships/managementsciencescholarships/simulationandoptimisationofoffshorerenewableenergyarraysforminimallife-cyclecosts/

Candidates are expected to submit a cover letter, CV, any university degree certificates and transcripts, English test results (if applicable), two recommendation letters (or contact details of two referees, if letters are not available to them), and any other supporting documents.

More information about the department can be found here: http://www.strath.ac.uk/business/managementscience/

Informal enquiries about the project to Dr Kerem Akartunali (kerem.akartunali@strath.ac.uk) or Dr Euan Barlow (euan.barlow@strath.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/
*
**********************************************************

Tuesday, November 21, 2017

[DMANET] PhD Fast Track Stipends, Algorithmic Optimization, Trier Univ, Germany

The Research Training Group (RTG) Algorithmic Optimization, funded
by the Deutsche Forschungsgemeinschaft (DFG), is accepting
applications for Fast Track Stipends (800 EUR per month)
at the University of Trier for a period of one year beginning April 1, 2018.

The fast track stipends require the attendance of lectures or seminars in
the mathematical Master program of Trier University in the amount of at
least 40 credits as preparation for a PhD project. Upon positive evaluation
after completion of the stipend year, the successful candidate will be directly
accepted into the ALOP PhD program (83% TV-L E12, duration 3 years).
The ALOP research topics are devoted to all mathematical aspects of
algorithmic optimization with an emphasis on applications, in particular
in large and big data, as well as systems models from economics. The doctoral
research positions after the stipend phase do not involve teaching duties.

At the time of hiring, applicants must hold a BSc degree (or equivalent)
in mathematics or a closely related field. They should be able to
communicate in English and document their interest in the scientific goals
of the research program of the Research Training Group. Excellent programming
skills are a plus.

Applications should include:
- letter of motivation (no more than 2 pages)
- curriculum vitae
- a recent letter of reference to be sent directly to the address below
- contact information of at least one additional reference
- copies of degrees earned (in German or English translation)
- the bachelor thesis

Applications from researchers of all nationalities are welcome. Trier
University strives to increase the proportion of women in research and
strongly encourages women to apply. The university is certified as a
family-friendly employer. Provided equal qualifications are demonstrated,
applicants with disabilities will be preferred.

Please send all application materials as a single pdf-file via e-mail to:
alop@uni-trier.de
referencing the subject: RTG ALOP Fast Track

For full consideration, applications must be received no later than
Sunday, January 7, 2018; however, late applications will be considered
until the positions are filled.

For more information see: http://www.alop.uni-trier.de and
https://alop.uni-trier.de/job-opening/
**********************************************************
*
* 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. Position at TU Berlin

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

Call for applications

Ph.D. position (Wiss. Mitarbeiter)
TVL E13 -- 5 years

in the Discrete Mathematics group of TU Berlin.
The position comes with teaching obligations that are typically
fulfilled through work as a teaching assistant. Because the main
language of teaching is German, applicants should be proficient
in German or be willing to learn the language within
a short period of time.

Applicants should have a solid background in combinatorics
and graph theory. Candidates with an interest in
discrete geometry, planar graphs or posets
are particularly encouraged to apply.

A prior master's degree in mathematics or a closely related field is
required. It may also be possible to hire a person with a
Ph.D. degree. The position is paid according to level TVL E13 of the
German salary scale for public employees (the monthly gross salary is
likely to exceed 3500 euros).

The deadline for applications is December 1.

For the complete announcement see
http://tub.stellenticket.de/en/offers/42869 (English)
http://tub.stellenticket.de/de/offers/42866 (German)

For further informations
Stefan Felsner (felsner[at]math.tu-berlin.de)

----
Stefan Felsner
Institut fuer Mathematik, Sekr. MA 5-1
Technische Universitaet Berlin
Strasse des 17. Juni 136
10623 Berlin, 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/
*
**********************************************************

Monday, November 20, 2017

[DMANET] SAT 2018 - Call for papers

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

CALL FOR PAPERS

Twenty-first International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2018 ---

Oxford, UK, 9 - 12 July 2018

http://sat2018.azurewebsites.net/

Abstract submission deadline: 31 January 2018, 23:59 AoE
Paper submission deadline: 07 February 2018, 23:59 AoE

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


The International Conference on Theory and Applications of Satisfiability
Testing (SAT) is the premier annual meeting for researchers focusing on the
theory and applications of the propositional satisfiability problem, broadly
construed. In addition to plain propositional satisfiability, it also includes
Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints),
Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and
Constraint Programming (CP) for problems with clear connections to
Boolean-level reasoning.

Many hard combinatorial problems can be tackled using SAT-based techniques
including problems that arise in Formal Verification, Artificial Intelligence,
Operations Research, Computational Biology, Cryptography, Data Mining, Machine
Learning, Mathematics, etc. Indeed, the theoretical and practical advances in
SAT research over the past twenty years have contributed to making SAT
technology an indispensable tool in a variety of domains.

SAT 2018 aims to further advance the field by soliciting original theoretical
and practical contributions in these areas with a clear connection to
satisfiability. Specifically, SAT 2018 invites scientific contributions
addressing different aspects of SAT interpreted in a broad sense, including
(but not restricted to) theoretical advances (such as exact algorithms, proof
complexity, and other complexity issues), practical search algorithms,
knowledge compilation, implementation-level details of SAT solvers and
SAT-based systems, problem encodings and reformulations, applications
(including both novel application domains and improvements to existing
approaches), as well as case studies and reports on findings based on rigorous
experimentation.

SAT 2018 will take place as part of the Federated Logic Conference (FLoC) in
Oxford, http://www.floc2018.org. As in previous years, SAT and FLoC host
several competitive events which run before the conference and whose results
are disclosed during FLoC. A list of affiliated workshops can be found on the
websites.

SCOPE
-----

SAT 2018 welcomes scientific contributions addressing different aspects of the
satisfiability problem, interpreted in a broad sense. Domains include MaxSAT
and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF),
Satisfiability Modulo Theories (SMT), as well as Constraint Satisfaction
Problems (CSP). Topics include, but are not restricted to:

- Theoretical advances (including algorithms, proof complexity, parameterized
complexity, and other complexity issues);
- Practical search algorithms;
- Knowledge compilation;
- Implementation-level details of SAT solving tools and SAT-based systems;
- Problem encodings and reformulations;
- Applications (including both novel applications domains and improvements to
existing approaches);
- Case studies and reports on insightful findings based on rigorous
experimentation.

OUT OF SCOPE
------------

Papers claiming to resolve a major long-standing open theoretical question in
Mathematics or Computer Science (such as those for which a Millennium Prize is
offered), are outside the scope of the conference because there is insufficient
time in the schedule to referee such papers; instead, such papers should be
submitted to an appropriate technical journal.

PAPER CATEGORIES
----------------

Submissions to SAT 2018 are solicited in three paper categories, describing
original contributions.

- Long papers (9 to 15 pages, excluding references)
- Short papers (up to 8 pages, excluding references)
- Tool papers (up to 6 pages, excluding references)

Long and short papers should contain original research, with sufficient detail
to assess the merits and relevance of the contribution. For papers reporting
experimental results, authors are strongly encouraged to make their data and
implementations available with their submission. Submissions reporting on case
studies are also encouraged, and should describe details, weaknesses, and
strengths in sufficient depth. Long and short papers will be evaluated with the
same quality standards, and are expected to contain a similar contribution per
page ratio.

The authors should choose between a long or a short paper depending on the
space they need to fully describe their contribution. The classification
between long and short papers is mainly a way to balance the workload of the
reviewing process among PC members. It also impacts the duration of the
presentation of the work during the conference. It is the responsibility of the
authors to make sure that their paper is self-contained in the chosen limit of
pages. There will be no requalification of the submissions by the PC.

Tool papers must obey to a specific content criteria. A tool paper should
describe the implemented tool and its novel features. Here "tools" are
interpreted in a broad sense, including descriptions of implemented solvers,
preprocessors, etc., as well as systems that exploit SAT solvers or their
extensions for use in interesting problem domains. A demonstration is expected
to accompany a tool presentation. Papers describing tools that have already
been presented previously are expected to contain significant and clear
enhancements to the tool.

SUBMISSIONS
-----------

Submissions should not be under review elsewhere nor be submitted elsewhere
while under review for SAT 2018, and should not consist of previously published
material.

Submissions not consistent with the above guidelines may be returned without
review.

Besides the paper itself, authors may submit a supplement consisting of one
file in the format of a gzipped tarball (.tar.gz or .tgz) or a gzipped file
(.gz) or a zip archive (.zip). Authors are encouraged to submit a supplement
when it will help reviewers evaluate the paper. Supplements will be treated
with the same degree of confidentiality as the paper itself. For example, the
supplement might contain detailed proofs, examples, software, detailed
experimental data, or other material related to the submission. Individual
reviewers may or may not consult the supplementary material; the paper itself
should be self-contained.

All papers submissions are done exclusively via EasyChair in Springer's LaTeX
llncs2e style.

One author of each accepted paper is expected to present it at the conference.

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

All deadlines are 23.59 AoE (anywhere on earth)

31 Jan 2018: Abstract submission
7 Feb 2018: Paper submission
12-14 Mar 2018: Author response period
31 Mar 2018: Notification
9-12 Jul 2018: Conference

PROCEEDINGS
-----------

All accepted papers are expected to be published in the proceedings of the
conference, which will be published within the Springer LNCS series.

TRAVEL SUPPORT AND BEST PAPER AWARDS
------------------------------------

Long and short papers may be considered for a best paper award. If the main
author is a student, both in terms of work and writing, the paper may be
considered for a best student-paper award. Use the supplement to your
submission to state (in a brief cover letter) if the paper qualifies as a
student paper. Both the best paper award and the best student paper award are
sponsored by Springer.

The SAT association will provide partial travel support to students with
accepted papers to attend SAT 2018.


ORGANIZATION
------------

Program Chairs
--------------
- Olaf Beyersdorff, University of Leeds
- Christoph Wintersteiger, Microsoft

Workshop Chair
--------------
- Martina Seidl, Johannes Kepler University Linz

Program Committee
-----------------
- Gilles Audemard, CRIL
- Fahiem Bacchus, University of Toronto
- Armin Biere, Johannes Kepler University Linz
- Nikolaj Bjorner, Microsoft
- Nadia Creignou, Aix-Marseille Université
- Uwe Egly, TU Wien
- John Franco, University of Cincinnati
- Vijay Ganesh, University of Waterloo
- Serge Gaspers, UNSW Sydney and Data61, CSIRO
- Marijn Heule, The University of Texas at Austin
- Matti Järvisalo, University of Helsinki
- Mikolas Janota, University of Lisbon
- George Katsirelos, MIAT, INRA
- Oliver Kullmann, Swansea University
- Massimo Lauria, Sapienza University of Rome
- Daniel Le Berre, Université d'Artois
- Florian Lonsing, TU Wien
- Ines Lynce, INESC-ID, Universidade de Lisboa
- Joao Marques-Silva, University of Lisbon
- Ruben Martins, Carnegie Mellon University
- Stefan Mengel, CNRS, CRIL
- Alexander Nadel, Intel
- Jakob Nordström, KTH Royal Institute of Technology
- Markus N. Rabe, UC Berkeley
- Martina Seidl, Johannes Kepler University Linz
- Laurent Simon, Labri, Bordeaux Institute of Technology
- Carsten Sinz, Karlsruhe Institute of Technology
- Friedrich Slivovsky, TU Wien
- Takehide Soh, Kobe University
- Stefan Szeider, TU Wien
- Jacobo Torán, University of Ulm
- Ralf Wimmer, Albert-Ludwigs-Universität Freiburg
- Xishun Zhao, Sun Yat-Sen University


CONTACT
-------
sat2018@easychair.org<mailto:sat2018@easychair.org>

**********************************************************
*
* 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] ORBEL 32 - Call for Abstracts

ORBEL 32, 32nd annual conference of the Belgian Operational Research
Society

Liège, Belgium, February 1 – 2, 2018

https://www.orbel.be/orbel32/

We invite all researchers, practitioners, and students interested in
quantitative methods for decision making to attend the 32nd annual
conference of the Belgian Operational Research Society (ORBEL 32
<https://www.orbel.be/orbel32/index.php> ) on February 1 – 2, 2018 in
Liège.

ORBEL is the annual conference of the Belgian Operational Research (OR)
Society <https://www.orbel.be/> , a member of EURO
<http://www.euro-online.org/> , the association of European OR Societies,
and Belgian representative of IFORS <http://www.ifors.org/>
(International Federation of OR Societies). ORBEL 32 is organized by the
research centre QuantOM <http://www.quantom.hec.ulg.ac.be/> (Quantitative
Methods and Operations Management) of HEC Liège
<http://www.hec.ulg.ac.be/en/home> - Management School of the University
of Liège <https://www.uliege.be/cms/c_8699436/en/portail-uliege> .

The conference is intended as a meeting place for researchers and users of
OR, statistics, computer science, and related fields. It provides
managers, practitioners, and researchers with a unique opportunity to
exchange information on quantitative techniques for decision making. ORBEL
welcomes every year more than one hundred participants from Belgium and
from France, Germany, Luxembourg, and the Netherlands.

The confirmed keynote speakers of this edition are:

* Prof. Michel Bierlaire, EPFL Ecole Polytechnique Fédérale de
Lausanne
Title: Modeling advanced disaggregate demand as MILP
* Prof. Dominique Feillet, Ecole des Mines de Saint-Etienne and
LIMOS

Title: Vehicle routing problems with road-network information

* Prof. Martin Savelsbergh, H. Milton Stewart School of Industrial &
Systems Engineering, Georgia Tech

Title: Recent advances in criterion space search algorithms for
multi-objective mixed integer programming

TOPICS OF INTEREST:

We invite contributions in all fields of methodology and application:

* continuous, discrete or stochastic optimization, graphs and
networks, multicriteria decision making, decision theory, game theory,
simulation, queueing theory, complexity theory, data mining, ...;
* supply chain management, production planning, scheduling, project
management, transportation and traffic management, energy management, DEA
and performance management, financial modelling, ...;
* applications in industry, in the energy sector, in life sciences
and in bioinformatics, in public services, in engineering, in health care,
in banking, in telecommunications, in sports, in media and entertainment,
...;

IMPORTANT DATES:

ORBEL 32: February 1 – 2, 2018

Abstract submission deadline: December 22, 2017

End of early registration: January 22, 2018

SCIENTIFIC COMMITTEE:

* Aghezzaf, El Houssaine
* Arda, Yasemin
* Beliën Jeroen
* Bisdorff, Raymond
* Blondeel, Wouter
* Caris, An
* Chevalier, Philippe
* Crama, Yves
* David, Benoît
* De Baets, Bernard
* De Causmaecker, Patrick
* De Smet, Yves
* Fortz, Bernard
* Goossens, Dries
* Janssens, Gerrit
* Kunsch, Pierre
* Labbé, Martine
* Leus, Roel
* Mélot, Hadrien
* Pirlot, Marc
* Sartenaer, Annick
* Schyns, Michaël
* Sörensen, Kenneth
* Spieksma, Frits
* Vanden Berghe, Greet
* Vansteenwegen, Pieter
* Van Utterbeeck, Filip
* Van Vyve, Matthieu
* Wittevrongel, Sabine

ORGANISING COMMITTEE:

* Arda, Yasemin (Chair)
* Bay, Maud
* Crama, Yves
* Hoffait, Anne-Sophie
* Limbourg, Sabine
* Michelini, Stefano
* Paquay, Célia
* Pironet, Thierry
* Rodriguez Heck, Elisabeth
* Schyns, Michaël
* Smeulders, Bart

CONFERENCE VENUE:

The conference will take place in the main building of HEC Liège, in the
heart of the City of Liège, Belgium's third largest city and the largest
agglomeration of the French-speaking Walloon region. Liège is home to the
third inland port of Europe and the eighth freight airport in Europe.
Recognized for its quality of life and its rich historical patrimonium,
Liège is ideally situated within the Meuse-Rhin Euregio, 40 kilometers
from Maastricht (the Netherlands) and 60 kilometers from Aachen (Germany).
It is less than 1.5 hours away from Köln, 2.5 hours from Paris, and 4
hours from London by high-speed train (TGV) starting from the new
magnificent train station designed by the renowned architect Santiago
Calatrava.

In the name of the organizing committee,

Yasemin ARDA & Yves CRAMA


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

*Call for Papers – CP 2018*

The Twenty-Fourth Conference on Principles and Practice of Constraint
Programming <http://cp2018.a4cp.org/> will take place in Lille, France,
27-31 August 2018.

The CP conference series concerns all aspects of computing with
constraints, including: theory, algorithms, environments, languages,
models, systems, and applications.

The CP 2018 programme will include presentations of high-quality scientific
papers and tutorials on both theory and applications. Invited talks will
describe important topics relevant to the field. There are also workshops
and a doctoral program for students.

*Tracks*

The conference features a main Technical Track, an Applications Track, and
various thematic tracks, which include:

-

CP & Data Science
-

CP & Operations Research
-

CP & Music
-

Testing and Verification
-

Multiagent and Parallel CP
-

CP, Optimization, & Power System Management

Papers are submitted to individual tracks. They would normally relate to CP
technology, but submissions that deal with constraint solving and are of
potential interest to the CP community are also invited. The thematic
tracks, in particular, are intended to reach out to researchers beyond the
CP community. Each track has a dedicated chair and subcommittee to ensure
that reviewers have the relevant domain expertise.

*Submission*

Paper submission is via EasyChair, and reviewing is double blind. Please
see the conference website <http://cp2018.a4cp.org/> for further details
and a complete list of tracks.

*Important Dates*

-

*10 April 2018 - *Abstract submission
-

*16 April 2018 - *Paper submission
-

*15-19 May 2018 - *Author response period
-

*1 June 2017* - Notification
-

*15 June 2018 - *Camera-ready

**********************************************************
*
* 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] Conference "Tropical varieties and amoebas in higher dimension", KTH and IML Stockholm, April 16-20, 2018

This is the first announcement for the conference "Tropical varieties
and amoebas in higher dimension" which will take place at the KTH
Stockholm April 16-20, 2018. This is the final conference of the
programme "Tropical geometry, amoebas and polytopes" which will take
place at the Institute Mittag Leffler in spring 2018. As final
conference, it is intended to cover a broad range of topics that will
be of interest during the programme, in particular tropical algebra
and applications; combinatorics, polytopes, and complexity; moduli
spaces of curves and mirror symmetry; and tropical geometry and
amoebas in higher dimension.

Participation in the conference is open to everyone (and in particular
not restricted to participants in the programme).

Speakers include Dan Abramovich, Anders Björner (TBC), Erwan Brugallé,
Melody Chan, June Huh, Kiran Kedlaya (TBC), Diane Maclagan, Grigory
Mikhalkin, Johannes Nicaise, Sam Payne, Kristin Shaw, Frank Sottile,
Bernd Sturmfels, August Tsikh, Annette Werner, Jonathan Wise. More
speakers will be announced soon.

For more information, please check
http://www.mittag-leffler.se/Workshop-on-Tropical-varieties-and-amoebas-in-higher-dimension

To register, please use
https://docs.google.com/forms/d/e/1FAIpQLSe-7IzWvSktFJOLK6OSk4qtEAys3HK7gd9PXQpdOfNZxF6LHQ/viewform

For hotel booking, travel questions or any other administrative
matters please contact Ann-Britt Isaksson Öhman (annbritt@kth.se).

Please forward to potential participants.

Sandra Di Rocco, Jan Draisma, Anders Jensen, Hannah Markwig, Benjamin Nill

**********************************************************
*
* 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] European Chapter on Combinatorial Optimization (ECCO) 2018

*************************
European Chapter on Combinatorial Optimization (ECCO) 2018

To be held at the University of Fribourg, Switzerland
From June 14th to June 16th, 2018

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

The 31st Conference of the European Chapter on Combinatorial Optimization (ECCO) will be held at the University of fribourg (Switzerland) on June 14th to June 16th 2018.

ECCO is a working group of EURO (Association of European Operation Research Societies) that provides an excellent opportunity to discuss recent and important issues in Combinatorial Optimization and its applications.

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

Topics of interest

- theory and applications of combinatorial optimization
- exact solution algorithms, approximation algorithms, heuristics and meta-heurtistics for combinatorial optimization problems
- integer programming, global optimzation, stochastic integer programming, multi-objective programming, graph theory and network flows
- application areas include logistics and supply chain optimization, manufacturing, energy production and distribution, land consolidation, telecommunications, bioinformatics, finance, dicrete
  tomography, discrete and hybrid dynamical systems and other fields

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

Invited speakers

Yves Crama, HEC Liège
John B. Gauci, University of Malta
Christos H. Papadimitriou, University of California at Berkeley
Daniel Kuhn, Ecole Polytechnique Fédérale de Lausanne

************************
Important dates

Submissions: from January 15th to March 16th 2018
Notification of acceptance: April 9th 2018
Deadline for early registration: April 30th 2018
Deadline for author registration (for inclusion in the program): May 15th 2018
Deadline for late registration: May 31st 2018
Conference: From June 14th to June 16th 2018

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

Website: https://ecco2018.euro-online.org/index.html


----------------------------------------------------------------------------------
Bernard Ries - Associate Professor

University of Fribourg - Department of Informatics
Decision Support & Operations Research Group
Bd. de Pérolles 90, 1700 Fribourg

Phone : +41 26 300 83 33 - Fax: +41 26 300 97 26
Email: bernard.ries@unifr.ch
Homepage: http://diuf.unifr.ch/ds/bries
----------------------------------------------------------------------------------

**********************************************************
*
* 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: 4th ACM Cyber‐Physical System Security Workshop (ACM CPSS’18)

*** Apologies for multiple copies ***

C a l l F o r P a p e r s

4th ACM Cyber‐Physical System Security Workshop (ACM CPSS'18)

Incheon, Korea, June 4, 2018 (in conjunction with ACM AsiaCCS'18)

http://jianying.5gbfree.com/cpss/CPSS2018/

Submission due: Jan 20, 2018 (GMT) – firm


Conference Outline:

Cyber-Physical Systems (CPS) consist of large-scale interconnected
systems of heterogeneous components interacting with their physical
environments. There are a multitude of CPS devices and applications
being deployed to serve critical functions in our lives. The security of
CPS becomes extremely important. This workshop will provide a platform
for professionals from academia, government, and industry to discuss how
to address the increasing security challenges facing CPS. Besides
invited talks, we also seek novel submissions describing theoretical and
practical security solutions to CPS. Papers that are pertinent to the
security of embedded systems, IoT, SCADA, smart grid, and critical
infrastructure networks are all welcome. Topics of interest include, but
are not limited to:

• Attack detection for CPS
• Authentication and access control for CPS
• Autonomous vehicle security
• Availability, recovery and auditing for CPS
• Data security and privacy for CPS
• Embedded systems security
• EV charging system security
• Industrial control system security
• IoT security
• Key management in CPS
• Legacy CPS system protection
• Lightweight crypto and security
• Maritime cyber security
• Risk assessment for CPS
• SCADA security
• Security architectures for CPS
• Security by design for CPS
• Smart grid security
• Threat modeling for CPS
• Urban transportation system security
• Vulnerability analysis for CPS
• Wireless sensor network security

Important Dates:

• Submission due: Jan 20, 2018 (GMT) - firm
• Notification: Mar 10, 2018
• Camera-ready due: Mar 31, 2018

Steering Committee:

• Dieter Gollmann (Hamburg University of Technology, Germany)
• Ravishankar Iyer (UIUC, USA)
• Douglas Jones (ADSC, Singapore)
• Javier Lopez (University of Malaga, Spain)
• Jianying Zhou (SUTD, Singapore) - Chair

Program Chairs:

• Dieter Gollmann (Hamburg University of Technology, Germany & NTU,
Singapore)
• Jianying Zhou (SUTD, Singapore)

Publicity Chair:

• Cristina Alcaraz (University of Malaga, Spain)

Publication/Web Chair:

• Ying Qiu (I2R, Singapore)

Program Committee:

• Kemal Akkaya (Florida International University, USA)
• Cristina Alcaraz (University of Malaga, Spain)
• Alvaro Cardenas (UT Dallas, USA)
• Lorenzo Cavallaro (RHUL, UK)
• Aldar Chan (University of Hong Kong, HK)
• Sudipta Chattopadhyay (SUTD, Singapore)
• Chen-Mou Cheng (Osaka University, Japan)
• Raymond Choo (UT San Antonio, USA)
• Mauro Conti (University of Padua, Italy)
• Marc Dacier (EURECOM, France)
• Herve Debar (Telecom SudParis, France)
• Yuval Elovici (Ben-Gurion University, Israel)
• Afonso Ferreira (IRIT, France)
• Aurelien Francillon (EURECOM, France)
• Jonathan Goh (ST Electronics, Singapore)
• Stefanos Gritzalis (University of the Aegean, Greece)
• Huaqun Guo (I2R, Singapore)
• Jinguang Han (University of Surrey, UK)
• Shao-Fei Huang (LTA, Singapore)
• Harshan Jagadeesh (IIT Delhi, India)
• Zbigniew Kalbarczyk (UIUC, USA)
• Sokratis Katsikas (NTNU, Norway)
• Huy Kang Kim (Korea University, Korea)
• Robert Kooij (TU Delft, Netherland)
• Marina Krotofil (FireEye, USA)
• Qi Li (Tsinghua University, China)
• Hoon Wei Lim (SingTel, Singapore)
• Xiapu Luo (Hong Kong Polytechnic University, HK)
• Michail Maniatakos (NYU-Abu Dhabi, UAE)
• Konstantinos Markantonakis (RHUL, UK)
• Ivan Martinovic (University of Oxford, UK)
• Weizhi Meng (DTU, Denmark)
• Martín Ochoa (SUTD, Singapore)
• Axel Poschmann (NXP, Germany)
• Rodrigo Roman (University of Malaga, Spain)
• Vinay Sachidananda (SUTD, Singapore)
• Biplab Sikdar (NUS, Singapore)
• Martin Strohmeier (University of Oxford, UK)
• Pawel Szalachowski (SUTD, Singapore)
• Qiang Tang (LIST, Luxembourg)
• William Temple (ADSC, Singapore)
• Nils Ole Tippenhauer (SUTD, Singapore)
• Ngoc Hong Tran (Vietnamese German Uni, Vietnam)
• Yi Wang (Continental Automotive, Singapore)
• Daphne Yao (Virginia Tech, USA)
• David Yau (SUTD, Singapore)
• Xin Ye (Ford Motor, USA)
• Chan Yeob Yeun (KUSTAR, UAE)
• Peng Zhou (CSIRO, Australia)
• Sencun Zhu (Pennsylvania State University, USA)
• Saman Zonouz (Rutgers University, USA)

Submission Instructions:

Submitted papers must not substantially overlap papers that have been
published or that are simultaneously submitted to a journal or a
conference with proceedings. All submissions should be appropriately
anonymized (i.e., papers should not contain author names or
affiliations, or obvious citations). Submissions must be in
double-column ACM SIG Proceedings format, and should not exceed 12
pages. Position papers and short papers of 6 pages describing the work
in progress are also welcome. Only pdf files will be accepted. Authors
of accepted papers must guarantee that their papers will be presented at
the workshop. At least one author of the paper must be registered at the
appropriate conference rate. Accepted papers will be published in the
ACM Digital Library. There will also be a best paper award.

Paper submission site: https://easychair.org/conferences/?conf=cpss18.

Contact:

Email: cpss2018@easychair.org
CPSS Home: http://jianying.5gbfree.com/cpss/
**********************************************************
*
* 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/
*
**********************************************************