Thursday, August 31, 2017

[DMANET] Lectureship in Formal Analysis, Theory and Algorithms, University of Glasgow, School of Computing Science

University of Glasgow
College of Science and Engineering
School of Computing Science

Ref: 018557
Grade 7/8 Salary Range £33,943 - £38,183 / £41,709 - £48,327 per annum

The University of Glasgow seeks to appoint a Lecturer to pursue a world-class research programme in Computing Science within the topics of the Formal Analysis, Theory and Algorithms (FATA) section; to teach related topics in Computing Science at all undergraduate and postgraduate levels; and to carry out allocated administrative tasks.

The School of Computing Science is one of the UK's leading research departments and is expanding its academic staff across a range of areas. Its research is known for strong applications with significant impact, underpinned by rigorous foundations and methodologies. It has a record of successful intra-disciplinary collaboration across the School, and inter-disciplinary collaboration across and beyond the University.

The research topics covered by the Formal Analysis, Theory and Algorithms section include:

- algorithms and complexity;
- formal modelling and model-checking;
- programming language theory.

The School seeks applications from outstanding candidates to develop and lead research of international standard in these or related topics. Academic staff who establish successful research programmes have excellent prospects for career development and promotion.

Further information on the School of Computing Science can be found at:

For over 550 years, UofG has carried out world-changing research and boasts annual research grants and contracts income placing us within the top 10 UK universities. In REF2014, more than 80% of our research was assessed as being world-leading or internationally excellent, placing us 12th in the UK for research power.

Closing date: 29 September 2017. Interviews will be held on 3 November 2017.

Apply online at:

It is the University of Glasgow's mission to foster an inclusive climate, which ensures equality in our working, learning, research and teaching environment.

We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equity.

The University of Glasgow, charity number SC004401

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] CfP: Special Issue on Metaheuristics in ITOR


** Special Issue of International Transactions in Operational Research
(ITOR) **
** **
** Impact factor 2016: 1.745 **

** Subject: Metaheuristics **

This special issue will be dedicated to significantly extended versions
of the best (up to 24) papers that were presented at MIC 2017
(Metaheuristics International Conference). However, submission will also
be open for papers which were not initially presented at MIC. The topics
of interest include all those that were included in the CfP of MIC (see

A note concerning submissions on nature-inspired metaheuristics: the
past has shown that nature can be a rich source of inspiration for
algorithms in optimization and control. However, the last years have
witnessed an abuse of drawing inspiration from natural phenomena. Some
of the published algorithms either re-invent the wheel, or do sometimes
not even make sense. Therefore, algorithms (other than well-established
ones such as evolutionary algorithms) must be described in metaphor-free
language. This facilitates their conceptual comparison to existing
algorithms. Moreover, it facilitates highlighting the algorithmic
contributions to the literature. Papers on such algorithms will only be
published if the provided evidence gives very good reasons to do so.

** Tentative Schedule **

October 31, 2017: strict submission deadline
January 31, 2018: notification of review outcome
March 31, 2018: submission of revised paper versions
June 30, 2018: final notification
Autumn/Winter 2018: publication

** Note **

Papers that cannot be accepted after the second round of reviews will
(if eventually accepted) appear in a regular issue in order not to delay
the publication of the special issue.

** Guest Editors **

Christian Blum, Artificial Intelligence Research Institute (IIIA-CSIC),
Angel A. Juan, Open University of Catalonia, Barcelona
Helena Ramalhinho, Universitat Pompeu Fabra, Barcelona
Thomas Stützle, Free University of Brussels

* Contributions to be spread via DMANET are submitted to
* 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.

Wednesday, August 30, 2017

[DMANET] Distance Geometry workshop at Physikzentrum Bad Honnef 23-24 november 2017

GOR Bad Honnef meeting on Distance Geometry (23-24 november 2017)

The 99th meeting of the Gesellschaft fuer Operations Research (GOR)
working group on "Real World Mathematical Optimization" will take
place at the Physikzentrum Bad Honnef (near Bonn, Germany) on 23-24
november 2017 (thu-fri). This year's workshop is titled

Distance Geometry:
Inverse problems between geometry and optimization

- Alexander Barvinok (University of Michigan, USA)
- Claudia D'Ambrosio (CNRS and Ecole Polytechnique, France)
- Ivan Dokmanic (Univ. of Illinois at Urbana-Champaign, USA)
- Philip Duxbury (Michigan State University, USA)
- Douglas Goncalves (Univ. Federal Santa Catalina, Brazil)
- Carlile Lavor (University of Campinas, Brazil)
- Therese Malliavin (CNRS and Institut Pasteur, France)
- Nelson Maculan (Univ. Federal do Rio de Janeiro, Brazil)
- Antony Man-Cho-So (Chinese University of Hong Kong, China)
- Antonio Mucherino (University of Rennes I, France)
- Maks Ovsjanikov (CNRS and Ecole Polytechnique, France)
- Pierre-Louis Poirion (Huawei Research, France)
- Bernd Schulze (Lancaster University, UK)
- Ky Vu (Chinese University of Hong Kong, China)
- Bradley Worley (Institut Pasteur, France)

Please register at <> if you wish to
attend, and please also drop me an email at
<>. Fitting a talk in the program is not
as easy as attending but if you just made an interesting discovery in
distance geometry and wish to announce it, please let me know -- I'll
make some efforts to try and fit you in (no guarantees).

The organizing committee for this workshop is
- Josef Kallrath (GOR)
- Julia Kallrath (GOR)
- Leo Liberti (CNRS LIX Ecole Polytechnique)
- Jens Schulz (GOR)

Accommodation and meals are provided by the Physikzentrum as a full
accommodation package at the price of 135 Euro for a single-room, or
128 Euro for a double-room, respectively. This is a full board price
for the whole event (including one overnight stay, meals and coffee
breaks, beverages). The Physikzentrum charges an additional
infrastructure fee of 40 Euro from all non-student participants. After
registering, cancellations are subject to a 75 Euro cancellation fee.
* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] 4 funded positions for PhD studies in Computer Science at GSSI in L'Aquila (Italy) - Call for applications

The Gran Sasso Science Institute (GSSI) offers 4 PhD positions in
Computer Science for the academic year 2017/18.

The fellowships are awarded for three years and their yearly amount is €
16.159,91 gross. All PhD students have free accommodation at the GSSI
facilities and use of the canteen.

The application must be submitted through the online form available at by September 18, 2017 at 18.00 (Italian time zone).

For more information, please consult the Call for Applications at or write an email to or call +39 0862 4280262.
* Contributions to be spread via DMANET are submitted to
* 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.

Tuesday, August 29, 2017

[DMANET] ESORICS 2017: Call for Participation

22nd European Symposium on Research in Computer Security
Oslo, Norway — September 11-15, 2017


ESORICS is the annual European research event in Computer Security. The
Symposium started in 1990 and has been held in several European
countries, attracting a wide international audience from both the
academic and industrial communities.
The 22nd European Symposium on Research in Computer Security (ESORICS
2017) will be held in Oslo, Norway.

ESORICS 2017 spans a total of 3 days, featuring:
* 3 keynote speeches
(Cormac Herley, Paul Syverson, Sandro Etalle)
* 54 paper presentations in 3 days (Sep 11-13)
* 8 workshops (Sept 14 - 15)

Presentations Program
The 54 papers of ESORICS 2017 are distributed between **18 sessions**
in **two parallel tracks**.

Following is the list of paper presentations for the main ESORICS
conference. For the workshop programs, please consult their
corresponding websites:

* SECPRE 2017:
* SecSE 2017:
* CBT 2017:
* DPM 2017:
* STM 2017:
* QASA 2017:
* CyberICPS:
* SIoT 2017:

### September 11 - Day 1 ###########
09:30 - 10:30
* Keynote: Cormac Herley
- Justifying Security Measures - a Position Paper

11:00 - 12:30

* Session 1: Security of embedded things
- Shortfall-based Optimal Placement of Security Resources for Mobile
IoT Scenarios
Antonino Rullo, Edoardo Serra, Elisa Bertino and Jorge Lobo
- Analyzing the Capabilities of the CAN Attacker
Sibylle Froeschle and Alexander Stühring
- Boot Attestation: Secure Remote Reporting with Off-The-Shelf IoT
Steffen Schulz, André Schaller, Florian Kohnhäuser, and Stefan

* Session 2: Cryptographic Application I
- Per-Session Security: Password-Based Cryptography Revisited
Gregory Demay, Peter Gazi, Ueli Maurer and Björn Tackmann
- Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime
Generation Algorithm
Fabrice Benhamouda, Houda Ferradi, Rémi Géraud and David
- Tightly Secure Ring-LWE Based Key Encapsulation with Short
Martin Albrecht, Emmanuela Orsini, Kenneth Paterson, Guy Peer and
Nigel Smart

14:00 - 15:30

* Session 3: Documents and Authorship
- Identifying Multiple Authors in a Binary Program
Xiaozhu Meng, Barton Miller and Kwang-Sung Jun
- Verifiable Document Redacting
Herve Chabanne, Rodolphe Hugel and Julien Keuffer
- Source Code Authorship Attribution using Long Short-Term Memory
Based Networks
Bander Alsulami, Edwin Dauber, Richard Harang, Spiros Mancoridis
and Rachel Greenstadt

* Session 4: Analysis of Security Protocols
- Automated analysis of equivalence properties for security protocols
using else branches
Ivan Gazeau and Steve Kremer and Levente Buttyán
- Secure Authentication in the Grid: A formal analysis of DNP3: SAv5
Cas Cremers, Martin Dehnel-Wild and Kevin Milner
- Modular Verification of Protocol Equivalence in the Presence of
Matthew Bauer, Rohit Chadha and Mahesh Viswanathan

16:00 - 17:30

* Session 5: Threat Analysis
- Preventing Advanced Persistent Threats in Complex Control Networks
Juan E. Rubio, Cristina Alcaraz and Javier Lopez
- MTD CBITS: Moving Target Defense for Cloud-Based IT Systems
Alexandru G. Bardas, Sathya C. Sundaramurthy, Xinming Ou and Scott
A. Deloach
- Is my attack tree correct?
Maxime Audinot, Sophie Pinchinat and Barbara Kordy

* Session 6: Side Channels and data leakage
- On-Demand Time Blurring to Support Side-Channel Defense
Weijie Liu, Debin Gao and Mike Reiter
- Acoustic Data Exfiltration from Speakerless Air-Gapped Computers via
Covert Hard-Drive Noise
Mordechai Guri, Yosef Solewicz, Andrey Daidakulov and Yuval
- Practical Keystroke Timing Attacks in Sandboxed JavaScript
Moritz Lipp, Daniel Gruss, Michael Schwarz, David Bidner,
Clémentine Maurice and Stefan Mangard

### September 12 - Day 2 ###########
09:00 - 10:00
* Keynote: Paul Syverson
- The Once and Future Onion

10:30 - 12:00

* Session 7: Vulnerabilities and Malware
- Mirage: Toward a Stealthier and Modular Malware Analysis Sandbox for
Lorenzo Bordoni, Mauro Conti and Riccardo Spolaor
- VuRLE: Automatic Vulnerability Detection and Repair by Learning from
Siqi Ma, Ferdian Thung, David Lo, Cong Sun and Robert Deng
- Adversarial Examples for Malware Detection
Kathrin Grosse, Nicolas Papernot, Praveen Manoharan, Backes
Michael and Patrick McDaniel Russo

* Session 8: Privacy in Systems
- PerfWeb: How to Violate Web Privacy with Hardware Performance Events
Berk Gulmezoglu, Andreas Zankl, Thomas Eisenbarth and Berk Sunar
- SePCAR: A Secure and Privacy-enhancing Protocol for Car Access
Iraklis Symeonidis, Abdelrahaman Aly, Mustafa Asan Mustafa, Bart
Mennink, Siemen Dhooghe and Bart Preneel
- Privacy Implications of Room Climate Data
Philipp Morgner, Christian Müller, Matthias Ring, Björn
Eskofier, Christian Riess, Frederik Armknecht and Zinaida Benenson

13:30 - 15:00

* Session 9: Network security
- Link-Layer Device Type Classification on Encrypted Wireless Traffic
with COTS Radios
Rajib Ranjan Maiti, Sandra Siby, Ragav Sridharan and Nils Ole
- Preventing DNS amplification attacks using the history of DNS
queries with SDN
Soyoung Kim, Sora Lee, Geumhwan Cho, Muhammad Ejaz Ahmed, Jaehoon
Paul Jeong and Hyoungshick Kim
- Zero Round-Trip Time for the Extended Access Control Protocol
Jacqueline Brendel and Marc Fischlin

* Session 10: Controlling Access
- No sugar but all the taste! Memory Encryption without Architectural
Panagiotis Papadopoulos, George Christou, Giorgos Vasiliadis,
Evangelos Markatos and Sotiris Ioannidis
- Tree-based Cryptographic Access Control
James Alderman, Naomi Farley and Jason Crampton
- Securing Data Analytics on SGX With Randomization
Swarup Chandra, Vishal Karande, Zhiqiang Lin, Latifur Khan, Murat
Kantarcioglu and Bhavani Thuraisingham

15:30 - 17:00

* Session 11: Information Flow
- We are Family: Relating Information-Flow Trackers
Musard Balliu, Daniel Schoepe and Andrei Sabelfeld
- A Better Composition Operator for Quantitative Information Flow
Kai Engelhardt
- WebPol: Fine-grained Information Flow Policies for Web Browsers
Abhishek Bichhawat, Vineet Rajani, Jinank Jain, Deepak Garg and
Christian Hammer

* Session 12: Blockchain and social networks
- A Traceability Analysis of Monero's Blockchain
Amrit Kumar, Clément Fischer, Shruti Tople and Prateek Saxena
-RingCT 2.0: A Compact Linkable Ring Signature Based Protocol for
Blockchain Cryptocurrency Monero
Shi-Feng Sun, Man Ho Au, Joseph Liu and Tsz Hon Yuen
- Secure Computation in Online Social Networks
Foteini Baldimtsi, Dimitrios Papadopoulos, Stavros Papadopoulos,
Alessandra Scafuro and Nikos Triandopoulos

### September 13 - Day 3 ###########
09:00 - 10:00
* Keynote: Sandro Etalle
- From Intrusion Detection to Software Design

10:30 - 12:30

* Session 13: Web Security
- DeltaPhish: Detecting Phishing Webpages in Compromised Websites
Igino Corona, Battista Biggio, Matteo Contini, Luca Piras, Roberto
Corda, Mauro Mereu, Guido Mureddu, Davide Ariu and Fabio Roli
- DOMPurify: Client-Side Protection against XSS and Markup Injection
Mario Heiderich, Christopher Späth, and Jörg Schwenk
- Quantifying Web Adblocker Privacy
Arthur Gervais, Alexandros Filios, Vincent Lenders and Srdjan

* Session 14: Cryptographic signatures
- Reusing Nonces in Schnorr Signatures
Marc Beunardeau, Aisling Connolly, Remi Geraud, David Naccache and
Damien Vergnaud
- How to Circumvent the Structure-Preserving Signatures Lower Bounds
MEssam Ghadafi
- Server-Supported RSA Signatures for Mobile Devices
Ahto Buldas, Aivo Kalu, Peeter Laud and Mart Oruaas

13:30 - 15:00

* Session 15: Formal techniques
- Inference-Proof Updating of a Weakened View under the Modification
of Input Parameters
Joachim Biskup and Marcel Preuß
- Verifying Constant-Time Implementations by Abstract Interpretation
Sandrine Blazy, David Pichardie and Alix Trieu
- AVR Processors as a Platform for Language-Based Security
Florian Dewald, Heiko Mantel and Alexandra Weber

* Session 16: Privacy and garbled circuits
- Labeled Homomorphic Encryption: Scalable and Privacy-Preserving
Processing of Outsourced Data
Manuel Barbosa, Dario Catalano and Dario Fiore
- New Way for Privacy-Preserving Decision Tree Evaluation
Raymond K. H. Tai, Jack P. K. Ma, Yongjun Zhao and Sherman S. M.
- Enforcing Input Correctness via Certification in Garbled Circuit
Yihua Zhang, Marina Blanton and Fattaneh Bayatbabolghani

15:30 - 17:00

* Session 17: Intrusion Detection
- Secure IDS Offloading with Nested Virtualization and Deep VM
Shohei Miyama and Kenichi Kourai
- Network Intrusion Detection based on Semi-Supervised Variational
Genki Osada, Kazumasa Omote and Takashi Nishide
- LeaPS: Learning-Based Proactive Security Auditing for Clouds
Suryadipta Majumdar, Yosr Jarraya, Momen Oqaily, Amir
Alimohammadifar, Makan Pourzandi, Lingyu Wang and Mourad Debbabi

* Session 18: Cryptographic Applications II
- Multiple Rate Threshold FlipThem
David Leslie, Chris Sherfield and Nigel Smart
- Stringer: Measuring the Importance of Static Data Comparisons to
Detect Backdoors and Undocumented Functionality
Sam L. Thomas, Tom Chothia and Flavio D. Garcia
- Generic Constructions for Fully Secure Revocable Attribute-Based
Kotoko Yamada, Nuttapong Attrapadung, Keita Emura, Goichiro
Hanaoka and Keisuke Tanaka

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] [DRCN 2018] Call for Papers DRCN 2018 (February 19-20, 2018 - Paris, France)


14th International Conference on the Design of Reliable Communication Networks (DRCN 2018)
February 19-20, 2018
Orange Gardens, Paris area, France

In conjunction with the 21st Conference on Innovations in Cloud, Internet and Networks (ICIN 2018)<>
Technically co-sponsored by IEEE ComSoc

****** Paper submission deadline: October 7, 2017 *******

The International Conference on Design of Reliable Communication Networks (DRCN) is a well-known forum for presenting excellent results and new challenges in the field of reliability and availability of communication networks and services. It brings together experts from industry, governments, and academia.
Co-located with ICIN 2018, 2018 DRCN will focus on a wide range of topics of interest within the fields of Reliability, Availability and Serviceability as listed below.

*** Topics of interests ***

* Survivability and traffic engineering for optical, IP and multi-layer networks

* Robustness of multi-domain network and protocol architectures

* Resilience in Software-Defined Networking (SDN)

* High-availability for Network Functions Virtualization (NFV) infrastructures

* Network dependability in cloud networking

* Dependability of cellular/mobile networks

* Reliability of wireless access and mesh networking

* Survivability in grid and distributed computing

* Resilience of networked critical infrastructures

* Network reliability analysis

* Methods for survivable network and systems design, analysis and operation

* Planning and optimization of reliable networks, systems, and services

* Network coding techniques to improve resilience

* Decomposition techniques for reliable network optimization

* Service differentiation based on recovery methods

* Simulation techniques for network resilience

* Quality of Experience (QoE) and network service availability assessments

* Reliability requirements and metrics for users, businesses, and the society

* Dependability of networked applications

* Survivability of multimedia networks

* Reliability and resiliency of data center networks

* Recovery of overlay and peer-to-peer networks

* Restoration of services under various types of failures

* Application and service-specific survivability techniques

* Robustness of compound services

* Telecommunication networks as an element of critical infrastructures

* Risk and reliability in the Internet and enterprise networks

* Public policy issues for survivability and resilience

* Standardization of network resilience and reliability

* Network resilience combined with economics and commercial issues

* Network robustness to natural disasters

* Robust network design for hostile environments

* Security issues in networks and their relation to survivability

* Network dependability and energy consumption trade-offs

***Submission Instructions***
DRCN 2018 solicits papers of up to 8 pages in IEEE format.
Submissions should be original, unpublished work, not currently under review by other conferences or journals. Papers submitted to DRCN 2018 will be assessed based on originality, technical soundness, clarity and interest to a wide audience.
Only PDF files will be accepted for the review process and all submissions must be done electronically through EDAS:
- Accepted papers will be published in the ICIN Proceedings and presented papers will be submitted to IEEE Xplore Digital Library.
- There will be an overall best paper award.
- Extended versions of best papers will be selected for fast-track publication in the Journal Annals of Telecommunications.

***Important Dates***
- Paper submission deadline: October 7, 2017
- Acceptance notification: November 15, 2017
- Camera ready papers: December 1, 2017
- Authors registration: December 1, 2017

***TPC Co-Chair***
Michael Menth, University of Tübingen, Germany
Eric Gourdin, Orange Labs, France
Jérémie Leguay, Huawei, France

*** Overall Arrangements ***
Aziza Lounis, DNAC, France

For further information, see

We welcome your contributions and look forward to your participation at DRCN 2018.


Ce message et ses pieces jointes peuvent contenir des informations confidentielles ou privilegiees et ne doivent donc
pas etre diffuses, exploites ou copies sans autorisation. Si vous avez recu ce message par erreur, veuillez le signaler
a l'expediteur et le detruire ainsi que les pieces jointes. Les messages electroniques etant susceptibles d'alteration,
Orange decline toute responsabilite si ce message a ete altere, deforme ou falsifie. Merci.

This message and its attachments may contain confidential or privileged information that may be protected by law;
they should not be distributed, used or copied without authorisation.
If you have received this email in error, please notify the sender and delete this message and its attachments.
As emails may be altered, Orange is not liable for messages that have been modified, changed or falsified.
Thank you.

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Second Call for Papers for PMS 2018 in Rome (Italy) - April 17-20, 2018

PMS 2018
16th International Conference on Project Management and Scheduling
April 17-20, 2018
Rome - Italy

PMS is an international conference series initialized by the EURO PMS
Working Group, devoted to project management and scheduling
( The workshop is held every two
years in different locations around Europe. This conference brings
together researchers and practitioners from different disciplines of
Computer Science, Operational Research, Optimization Engineering,
Mathematical Programming and Industrial Engineering. The conference
covers theoretical results and algorithmic developments in the fields
of Project Management and Scheduling, including project management and
scheduling practice and applications to real-life situations.

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

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,

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.

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: 31st October 2017
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:, or
send an email to

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

* Contributions to be spread via DMANET are submitted to
* 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.

Monday, August 28, 2017

[DMANET] Two PhD Positions in Network Analysis

The research group Knowledge & Data Engineering announces
two open

PhD positions (salary scale TV-H E13, 100%)

under the supervision of Prof.Dr. Gerd Stumme. The group's emphasis is
on researching and developing methods and algorithms at the confluence
of Knowledge Discovery, Artificial Intelligence and Mathematics. Of
particular interest is the analysis of (social) networks.

We welcome talented and highly motivated candidates with knowledge in
discrete structures as well as good programming skills in one major
language. Furthermore, a high social competency and a very good command
of the English language are expected.

Applicants to the PhD positions must have a relevant Master's degree (or
equivalent) in Computer Science, Mathematics, Physics or a related field.

The positions are (at first) limited to 3 years (cf.
Qualifikationsstelle gem. § 65 HHG i. V. m. § 2 Abs. 1 Satz 1
WissZeitVG; Promotionsmöglichkeit).

The University of Kassel is an equal opportunity employer. A significant
increase in the proportion of women in research and teaching is being
sought. Qualified women are therefore expressly invited to apply. In
case of equal qualification, persons with disabilities who are severely
handicapped will be given preferential consideration.

Please send your complete application (including all necessary documents
and a letter of intent) to

Applications are accepted as of now until 2017-09-25.

Prof. Dr. Gerd Stumme, Hertie Chair of Knowledge & Data Engineering,
Research Center for Information System Design (ITeG)
University of Kassel & Research Center L3S, Tel. 0561/804-6251, Fax: -6259

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Postdoc position in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for a postdoc position in computer science focused on SAT solving.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH ( offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The postdoctoral researcher will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving.

The research project is financed by a Breakthrough Research Grant and a Consolidator Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at The group currently consists of three postdoctoral researchers and four PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

This postdoc position is a full-time employed position for one year with a possible (and expected) one-year extension. The starting date should preferably be during the autumn semester of 2017 or in early 2018, although this is to some extent negotiable.

The application deadline is September 24, 2017. See for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to .

* Contributions to be spread via DMANET are submitted to
* 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.

Saturday, August 26, 2017

[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

"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

The International Federation of Operational Research Societies (IFORS; 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 just
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,,

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Postdoctoral position in optimization at Los Alamos National Laboratory

Postdoctoral Position
Los Alamos National Laboratory

The Information Sciences group at the Los Alamos National Laboratory has an opening at a postdoctoral level in the area of combinatorial optimization. The selected candidates will be given the opportunity to work with one of the only four commercially available quantum annealing computers worldwide, D-Wave 2X, with more than 1000 qubits. Typical tasks involve formulating an NP-hard optimization problem as a quadratic unconstraint binary optimization (QUBO) problem and designing methods for improving quantum annealing scalability and accuracy.

Quantum annealing is considered as one of the promising exascale and "beyond Moore's law" computing technologies. Quantum annealers such as LANL's D-Wave 2X are designed to natively propose solutions for optimization problems that are known to be challenging for classical computers.

Preliminary knowledge about quantum physics or quantum computing is not a requirement for this position, but strong combinatorial algorithm design and implementation skills are essential.

The successful applicant should have a strong publication record and will be expected to publish results in high impact peer-reviewed journals and conferences. This is a long-term appointment (up to three years), so candidates who can commit to a longer time frame will be preferred. However, candidates available for shorter periods may be considered for internships.


(1) A PhD in Computer Science, Mathematics, or related field within the past five years or soon
to be completed
(2) Research-level expertise in at least one of the following: combinatorial optimization, graph algorithms
(3) Demonstrated ability to publish research in peer-reviewed journals or conference proceedings
(4) Strong programming skills

Applications received before October 31, 2017 will receive a full consideration.

US citizenship is NOT required for this position.

For full details and instructions on how to apply go to<> . For informal inquiries, you can contact Hristo Djidjev,

* Contributions to be spread via DMANET are submitted to
* 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.

Friday, August 25, 2017

[DMANET] Second CfP: MACIS 2017

Second Call for Papers

MACIS 2017
7th International Conference on
Mathematical Aspects of Computer and Information Sciences
November 15-17, 2017 Vienna, Austria.

MACIS is a series of biennial conferences focusing on research in mathematical
and computational aspects of computing and information science.
MACIS 2017 will feature invited presentations and a selective four-track
program of contributed papers describing original and unpublished research.

===== Important Dates =====

Submission deadline (REGULAR/SHORT papers): September 3, Sunday
(SHORT papers are decided on a rolling basis)
Notification deadline for all submissions: October 2, Monday
Registration opens: October 2, Monday
Camera-ready due: October 15, Sunday

Deadlines are firm; late submissions will not be considered.

==== MACIS 2017 Organization ====

General Chair:
Dimitris E. Simos, SBA Research, Austria

PC Chairs:
Johannes Bloemer, Paderborn University, Germany
Temur Kutsia, RISC, Johannes Kepler University, Austria

MACIS Steering Committee:
Ilias Kotsireas (Chair), Wilfrid Laurier University, Canada
Siegfried Rump, Hamburg University of Technology, Germany
Thomas Sturm, Max Planck Institute for Informatics, Germany
Dongming Wang, Beihang University, China
Jinzhao Wu, Guangxi University for Nationalities, China
Chee Yap, New York University, USA

==== Proceedings ====

All accepted SHORT or REGULAR papers (details, below) are planned to appear in
a conference proceedings volume published by Springer LNCS (pending approval).
In addition, REGULAR papers have the opportunity to be considered for
post-conference special issues of the journal Mathematics in Computer Science
(MCS by Birkhauser/Springer.

==== MACIS 2017 Topics ====

MACIS authors are required to choose one of the following tracks:
Track 1:
Foundation of Algorithms in Mathematics, Engineering & Scientific Computation
Track Chairs:
Matthew England (Coventry University, UK),
Jonathan Hauenstein (University of Notre Dame, USA),
Laura Kovacs (Vienna University of Technology, Austria),
Elias Tsigaridas (INRIA, France)
quantifier elimination and decision procedures; global optimization;
differential equations; numeric, symbolic, interval and hybrid solution
techniques; satisfiability modulo theories; combinations of logics and
deductive engines; applications, especially in systems analysis and formal
verification; solving (parametric) polynomial systems
Track 2:
Combinatorics and Codes in Computer Science
Track Chairs:
Daniel Augot (INRIA & Ecole Polytechnique, France),
Alexander May (Ruhr-University Bochum, Germany),
Alfred Wassermann (University of Bayreuth, Germany)
combinatorics, enumerative, combinatorial designs, their analysis and
algorithmic constructions of them, complexity problems in combinatorics;
codes constructions, decoding methods and their complexity, information
theory aspects, Kolmogorov complexity
Track 3:
Data Modeling and Analysis
Track Chairs:
Xiaoyu Chen (Beihang University, China)
Joachim Giesen (Friedrich Schiller University Jena, Germany),
Giorgos Kollias (IBM Research, USA)
knowledge discovery; data mining; differential privacy, pattern recognition;
complex knowledge - representation and management; foundations and theories
for data analysis - systems; design and analysis of machine learning
algorithms, statistical analysis for big data
Track 4:
Mathematical Aspects of Information Security and Cryptography
Track Chairs:
Jan Camenisch (IBM Research, Switzerland),
Stefan Dziembowski (University of Warsaw, Poland),
Guenael Renault (ANSSI, France)
security models; formal methods for security and privacy; design and analysis
of algebraic, elliptic, number theoretical, code-based, lattice-based and
hash-based cryptographic primitives; algebraic cryptanalysis, algebraic
attacks, number theoretical algorithms, mathematical foundations of
post-quantum cryptography; (lattices, codes); algorithms and software for
symbolic computation in cryptography
- For general inquiries regarding MACIS 2017, please send e-mail to
Dimitris Simos <>
- For inquiries regarding MACIS topics, please send e-mail to
Johannes Bloemer <> or to
Temur Kutsia <>

==== Submission Guidelines ====

Authors are invited to submit papers, presenting original and unpublished
- REGULAR papers are up to 15 pages, and SHORT papers are up to 5 pages,
including references.
- Simultaneous submission to other conferences with published proceedings or
journals is not allowed.
- Please use the LNCS format from Springer:
- Submissions should be made to the appropriate track of the conference,
by using the easychair submission system:
- For detailed submission guidelines please see the MACIS website:

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] IPDPS 2018 - Call for papers and workshops

32nd IEEE International Parallel & Distributed Processing Symposium
May 21 – May 25, 2018
Vancouver, British Columbia, Canada
Call release: August 23rd, 2017

For more details see:


Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies and interdisciplinary
work covering multiple IPDPS areas are especially welcome. Topics of
interest include but are not limited to the following re-defined topic

* Parallel and distributed computing theory and algorithms (Algorithms):
Design and analysis of novel numerical and combinatorial parallel
algorithms; protocols for resource management; communication and
synchronization on parallel and distributed systems; parallel algorithms
handling power, mobility, and resilience.

* Experiments and practice in parallel and distributed computing
(Experiments): Design and experimental evaluation of applications of
parallel and distributed computing in simulation and analysis;
experiments in the use of novel commercial or research architectures,
accelerators, neuromorphic architectures, and other non-traditional
systems; algorithms for cloud computing; domain-specific parallel and
distributed algorithms; performance modeling and analysis of parallel
and distributed algorithms.

* Programming models, compilers and runtimes for parallel applications
and systems (Programming Models): Parallel programming paradigms, models
and languages; compilers, runtime systems, programming environments and
tools for the support of parallel programming; parallel software
development and productivity.

* System software and middleware for parallel and distributed systems
(System Software): System software support for scientific workflows;
storage and I/O systems; System software for resource management, job
scheduling, and energy-efficiency; frameworks targeting cloud and
distributed systems; system software support for accelerators and
heterogeneous HPC computing systems; interactions between the OS,
runtime, compiler, middleware, and tools; system software support for
fault tolerance and resilience; containers and virtual machines; system
software supporting scalable data analytics, machine learning, and deep
learning; OS and runtime system specialized for high performance
computing and exascale systems; system software for future novel
computing platforms including quantum, neuromorphic, and bio-inspired

* Architecture: Architectures for instruction-level and thread-level
parallelism; memory technologies and hierarchies; exascale system
designs; data center architectures; novel big data architectures;
special-purpose architectures and accelerators; network and interconnect
architectures; parallel I/O and storage systems; power-efficient and
green computing systems; resilience and dependable architectures;
performance modeling and evaluation.

* Multidisciplinary: Papers that cross the boundaries of the previous
tracks are encouraged and can be submitted to the multidisciplinary
track. During submission of multidisciplinary papers, authors should
indicate their subject areas that can come from any area. Contributions
should either target two or more core areas of parallel and distributed
computing where the whole is larger than sum of its components, or
advance the use of parallel and distributed computing in other areas of
science and engineering.

The program committee will nominate a few papers for recognition. Upon
presentation at a special session, the best papers will be selected by a

A few papers from each area will be selected by the conference chair and
co-chairs and invited for submission to a special issue of JPDC
dedicated to IPDPS. The final paper should have at least 30% extra
material and will be reviewed as any JPDC submission, but fast-tracked
to appear a few months after the conference.

Abstracts must be submitted by October 17th; submitted abstracts may not
exceed 500 words. Manuscripts must be submitted by October 22nd;
submitted manuscripts may not exceed ten (10) single-spaced
double-column pages using 10-point size font on 8.5x11 inch pages (IEEE
conference style), including figures, tables, and references. The
submitted manuscripts should include author names and affiliations.

All submitted manuscripts will be reviewed. Submissions will be judged
on correctness, originality, technical strength, significance, potential
impact, quality of presentation, and interest and relevance to the
conference scope. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal.

Questions may be sent to Abstracts are due October 17,
2017, and full manuscripts must be received by October 22, 2017. This is
a final, hard deadline. To ensure fairness, no extensions will be given.

Preliminary decisions will be sent by December 8, 2017, with a decision
of either accept, revise, or reject. Authors of "revised" papers will
have the opportunity to revise the content according to reviewers'
comments and will submit their final paper (together with a cover letter
explaining the changes) by January 8, 2018. Notification of final
decisions will be mailed by January 22, 2018, and camera-ready papers
will be due February 15, 2018.


• Abstracts due: October 17, 2017
• Submissions due (hard deadline): October 22, 2017
• Author notification (first round): December 8, 2017
• Revisions due: January 8, 2018
• Author notification (final): January 22, 2018
• Camera-ready due: February 15, 2018

CALL FOR WORKSHOPS (close deadline!)

Held on the first and last day of the conference, IPDPS workshops
provide an extended forum that allows the IPDPS community an opportunity
to fully explore special topics and to present work that is more
preliminary and cutting-edge or that has more practical content than the
more mature research presented in the main symposium. Each workshop has
its own requirements and schedule for submissions. Workshop papers'
submission dates typically fall after the notification date for the main
symposium papers. Proceedings of the workshops are distributed at the
conference and are submitted for inclusion in the IEEE Xplore Digital
Library after the conference.

The proposals should contain the following information:

* Description: Provide brief description of the workshop, its scope and
topics; the list of organizers with the confirmed chair(s); the program
committee members (indicate whether the members have been confirmed);
and the important dates.

* Organizers: Provide a short vita of the organizers by listing the
current affiliation, position, and previous experience in organizing
other events including workshops/conferences/panels at IPDPS or other

* History: If re-running (earlier editions were held somewhere other
than IPDPS), provide general information by listing the name of the
workshop, the hosting conference, year, number of papers submitted,
number of papers accepted, number of attendees; if there were
posters/panels, their numbers and topics (for panels), and URL's of the
existing web pages.

Targeted papers and audience: Provide information on targeted papers and
audience: (i) Where are the papers from (government labs, universities,
industry); (ii) What is the expected profile of the participants
(speakers + audience)? (iii) How will the workshop be advertised?

Format of the workshop: Provide a short overview of the format by
indicating if the workshop (i) will have peer reviewed papers in the
proceedings? (ii) will be half day or full day long? (iii) will have a
keynote talk? If yes, provide a tentative list of speakers; (iv) will
have a panel? If yes, provide the topic and the potential panelists? (v)
will have external (e.g., NSF) support for student participants.

What/where to submit: The proposals can be submitted using the link

Submitted proposals may not exceed three (3) single-spaced double-column
pages using 10-point size font on 8.5x11 inch pages (IEEE conference
style), including figures, tables, and references.

***IPDPS Workshops from the preceding year(s) should apply for renewal.
For more information, please contact the workshops chair at***

All submitted proposals and renewal requests will be reviewed by the
workshops committee. Both new workshop proposals and renewal requests
are due 1 September 2017. Notification of final decisions for new
proposals and renewal requests are expected to be mailed on 18 September

Important dates:
September 1st, 2017.......Proposals for New Workshops
September 18th, 2017.....Notifications

IPDPS 2017 Organization

Bora Uçar (CNRS and ENS Lyon, France)

Anne Benoit (ENS Lyon, France) and
Ümit V. Çatalyürek (Georgia Institute of Technology, USA)

Erik Saule (University of North Carolina at Charlotte, USA)
Jaroslaw Zola (University at Buffalo, USA)

Kyle Chard (University of Chicago, USA)
Moustafa AbdelBaky (Rutgers, USA)

Fredrik Manne (University of Bergen, Norway) and
Ananth Kalyanaraman (Washington State University, USA)
Karen Devine (Sandia National Lab, USA) and
Christopher D. Carothers (Rensselaer Polytechnic Institute, USA)
Albert Cohen (Inria, France) and
Cosmin Oancea (University of Copenhagen, Denmark)
Franck Cappello (Argonne National Lab, USA) and
Devesh Tiwari (Northeastern University, USA)
Mahmut Kandemir (Penn State University, USA) and
Gokhan Memik (Northwestern University, USA)
Daniel S. Katz (University of Illinois Urbana-Champaign, USA) and
Wei Tan (IBM T. J. Watson Research Center, USA)

Anu Bourgeois (Georgia State University, USA)

Trilce Estrada (University of New Mexico, USA)
Jay Lofstead (Sandia National Laboratories, USA)

Francesco Silvestri (University of Padova, Italy)

Lena Oden (FZ-Juelich, DE)
Ana Varbanescu (University of Amsterdam, NL)
Hongzi Zhu (Shanghai Jiao Tong University, China)

Eric Aubanel (University of New Brunswick, Canada)

Bill Pitts (Retired, IEEE Volunteer & Computer Society BOG-2012, USA)

Sally Jelinek Westrom (Electronic Design Associates, Inc., USA)

Ümit V. Çatalyürek (Georgia Institute of Technology, USA)

...Follow us on Facebook at
...Follow us on Twitter at
Sponsored by IEEE Computer Society Technical Committee on Parallel
In cooperation with
IEEE Computer Society Technical Committee on Computer Architecture, and
IEEE Computer Society Technical Committee on Distributed Processing
* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Workshop „Recent Advances in Multi-Objective Optimization“, University of Kaiserslautern, October 19-20, 2017

Workshop „Recent Advances in Multi-Objective Optimization"
University of Kaiserslautern, Germany
October 19-20, 2017
Website: <>
Organizers: Stefan Ruzika and Clemens Thielen

This year's iteration of the workshop „Recent Advances in Multi-Objective Optimization" will take place at the University of Kaiserslautern, Germany, on Thursday 19 and Friday 20 October 2017. More information and a preliminary program can be found on the workshop website at <>

The workshop focuses on latest advances in exact methods in multi-objective (mixed) integer optimization. Topics of interest include (but are not limited to):

- Multi-objective discrete/combinatorial problems
- Multi-objective mixed integer (non)-linear problems
- Multi-objective continuous non-linear problems
- Multi-objective branch-and-bound algorithms
- Multi-objective branch-and-cut algorithms
- Column generation and branch-and-price algorithms
- Objective space algorithms
- Stochastic multi-objective optimization
- Robust multi-objective optimization
- Complexity analysis of multi-objective optimization algorithms
- Parallelization of exact algorithms in multi-objective optimization

There will be no registration fee. Please register using the registration form found on the website until October 2.
* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Full-Time PhD Position in Combinatorial Optimization at University Clermont Auvergne, France

The Computer Science, Modeling, and System Optimization research
Laboratory (LIMOS – UMR CNRS 6158) at the University Clermont Auvergne,
Clermont-Ferrand, France, invites applications for a full-time PhD
position in Combinatorial Optimization. 

The position is funded by the French National Research Agency (ANR) for
three years and is related to the research project "Optimal Routing and
Spectrum Assignment of Realistic FlexGrid Elastic Optical Networks"
(FLEXOPTIM) led by Dr. Hervé Kerivin from LIMOS. The FLEXOPTIM project
aims at developing efficient off-line/on-line algorithms for the Routing
and Spectrum Assignment (RSA) problem on large-scale Spectrally Flexible
Optical Networks (SFONs) and at integrating them into a global
Software-Defined Networking (SDN) framework. This interdisciplinary
project brings together experts in mathematical optimization from LIMOS
and experts in optical-network architecture and control from the
Institut Mines-Telecom (IMT-Atlantique, formerly Telecom Bretagne) in
Brest, France. An explicit collaboration with Orange Labs is planned
during the project.

The PhD research project involves investigating the combinatorial and
optimization aspects of the RSA problem, developing algorithms to solve
realistic large-size instances of such a problem, and playing an active
role in the assessment of the functionality and efficiency of the
devised methods on a dedicated Orange-Labs platform. The successful
applicant must have a strong background in applied mathematics and
computer science. We are seeking an exceptionally talented and
motivated student with a good knowledge in theoretical and experimental
mathematical optimization such as combinatorial optimization, polyhedral
combinatorics, decomposition methods for large-scale problems, and
optimization under uncertainty, as well as skills in C/C++ programming
language; some experience with optimization software such as Cplex and
Gurobi would be an asset. Given the field of application of the
research project, a genuine interest in networking is required.  

The PhD candidate will work in the Combinatorial and Continuous
Optimization team of LIMOS under the supervision of Dr. Hervé Kerivin. 
He/she will also work closely with researchers from IMT-Atlantique where
regular meetings will be held. The successful applicant is expected to
carry out cutting-edge research, deliver presentations at international
conferences, and publish in top-tier journals and conference
proceedings.  The PhD scholarship includes a competitive salary and
travel support.  In addition, a teaching assistantship with extra
payment may be available.  Throughout the three years, the PhD candidate
will be provided with specialized scientific and career development
training offered by the Doctoral School of Engineering Sciences at
University Clermont Auvergne.

The earliest start date is November 01, 2017 but the position will
remain open until an appropriate candidate is found.  Applicants must
have earned a master's degree in Operations Research, Applied
Mathematics, Computer Science, or related fields by the start date of
the position.  Besides the aforementioned scientific requirements, the
successful applicant must demonstrate a high level of proficiency in
spoken and written English.  Knowledge of French is not required but
would be an asset.
Review of applications will begin in early October 2017 and will
continue until the position is filled.  Applications received by October
15, 2017 will be given full consideration.  Applications must contain
1) A cover letter,
2) A curriculum vitae or resume,
3) Copies of undergraduate and graduate transcripts,
4) A 1-2 page research statement describing how the applicant's
qualifications and research interests would fit the project,
5) A copy of the applicant's master's thesis,
6) Up to three publications if it applies,
7) The names and contact information of academic references, one of
which should be the applicant's master's thesis supervisor.
All application materials must be submitted in English to Dr. Hervé
Kerivin at with the subject line "FLEXOPTIM PhD
scholarship (applicant's name)", preferably as a single PDF file.  If
the original academic transcripts are not in French or English, the
translated transcripts must have the university's official stamp on

If you have further questions regarding this position, please contact
Dr. Hervé Kerivin at with the subject line "FLEXOPTIM
PhD scholarship".

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] Postdoc positions available at Université libre de Bruxelles (ULB)

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

The positions are for a period of 12 months with the possibility of
renewal and can start as soon as January 2018. Research will be
conducted within the Algorithms Group ( .

Candidates are expected to have expertise in one or more of the
following: algorithms, data structures, algorithm engineering,
algorithms for modern hardware (e.g. GPUs), discrete and computational

Applications (cover letter and CV) should be sent to

Jean Cardinal, John Iacono & Stefan Langerman.
Algorithms Research Group
Computer Science Department
Faculté des Sciences
Université libre de Bruxelles (ULB)

* Contributions to be spread via DMANET are submitted to
* 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.

Thursday, August 24, 2017

[DMANET] Full-Time PhD Position in Combinatorial Optimization at University Clermont Auvergne, France

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] ALGO 2017 Final Call for Participation (normal registration till August 31)

ALGO is the leading annual event on algorithms in Europe combining the premier algorithmic conference European Symposium on Algorithms (ESA) with several specialized conferences and workshops. ALGO 2017 will be held at TU Wien, Vienna, Austria, September 4-8, 2017.

Participating conferences and workshops:

ESA 2017 – The 25th Annual European Symposium on Algorithms
IPEC 2017 – The 12th International Symposium on Parameterized and Exact Computation
WAOA 2017 – The 15th Workshop on Approximation and Online Algorithms
ALGOSENSORS 2017 – The 13th International Symposium on Algorithms and Experiments for Wireless Networks
ATMOS 2017 – The 17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems
ALGOCLOUD 2017 – The 3rd International Workshop on Algorithmic Aspects of Cloud Computing

Keynote speakers:

- Daniel Delling, Apple Inc.
- Babak Falsafi, EcoCloud and EPFL
- Jie Gao, Stony Brook University
- Fabrizio Grandoni, University of Lugano
- David Mount, University of Maryland
- Kirk Pruhs, University of Pittsburgh
- David Woodruff, IBM Almaden

ALGO 2017 will also host a Parameterized Complexity Summer School as a pre-congress event (September 1-3):

Registration is open at

*** Normal registration ends on August 31, after that on-site registration fees apply ***

Further information can be found at the ALGO website

The ALGO 2017 organizing committee:

Stefan Szeider (chair)
Robert Ganian (co-chair)
Martin Nöllenburg (co-chair)
Doris Dicklberger
Wolfgang Dvorak
Ronald de Haan
Fabian Klute
Andreas Müller
Nysret Musliu
Sebastian Ordyniak
Karin Prater
Günther Raidl
Mihaela Rozman
Stefan Woltran

* Contributions to be spread via DMANET are submitted to
* 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.

Wednesday, August 23, 2017

[DMANET] Six full professor positions at the University of Leeds

Six new full professorships are available at the School of Computing of the University of Leeds:

Two of these Chairs are in any area of Computer Science. The School of Computing has five main research themes, among them Algorithms and Complexity (

Closing date is 17 September 2017.

Professor Olaf Beyersdorff
School of Computing
University of Leeds, Leeds, LS2 9JT, UK.
Phone: +44 113 343 8319

* Contributions to be spread via DMANET are submitted to
* 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.

Tuesday, August 22, 2017

[DMANET] ICALP 2018 - First Call for Papers

ICALP 2018 - First Call for Papers

The 45th International Colloquium on Automata, Languages, and
Programming (ICALP) will take place in Prague, Czech Republic, on July
9-13, 2018.

ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). As usual, ICALP
will be preceded by a series of workshops, which will take place on
July 9.

As a new feature, ICALP 2018 will include brief announcements intended
as a venue for short papers, work in progress or work presented
elsewhere. See submission guidelines below.

Important dates

Submission deadline: Friday February 16, 2018
Notification: Sunday April 15, 2018
Final manuscript due: Friday May 4, 2018
Early registration deadline: Thursday May 31, 2018
Workshops: Monday July 9, 2018
Main conference: July 10-13, 2018

Deadlines are firm; late submissions will not be considered.

Invited Speakers

Jaroslav Nesetril (Charles Univ, CZ)
Alexander Schwarzmann (Univ of Connecticut, US)
Sam Staton (Oxford Univ, UK)

Submissions and Proceedings

ICALP proceedings are published in the Leibniz International
Proceedings in Informatics (LIPIcs) series. This is a series of
high-quality conference proceedings across all fields in informatics
established in cooperation with Schloss Dagstuhl - Leibniz Center for
Informatics. LIPIcs volumes are published according to the principle
of Open Access, i.e., they are available online and free of charge.

Submission Guidelines
Authors are invited to submit an extended abstract of no more than 12
pages, excluding references presenting original research on the theory
of computer science. All submissions must be formatted in the LIPIcs
style ( and submitted via
Easychair to the appropriate track of the conference. The use of
pdflatex and the LIPIcs style are mandatory: papers that deviate
significantly from the required format may be rejected without
consideration of merit.

For regular submissions, no prior publication or simultaneous
submission to other publication outlets (either a conference or a
journal) is allowed. All the technical details necessary for a proper
scientific evaluation of a submission must be included in the 12-page
submission or in a clearly-labelled appendix, to be consulted at the
discretion of program committee members. If desired, the authors can
simply attach a copy of the full paper as the appendix. Authors are
encouraged to also make full versions of their submissions freely
accessible in an on-line repository such as ArXiv, HAL, ECCC.

A submission for a brief announcement must be at most 3 pages,
including title, authors' names and affiliations, and references. Such
submissions may describe work in progress or work presented
elsewhere. The title of a brief announcement must begin with the words
"Brief Announcement:".

If requested by the authors at the time of submission, a regular
submission that is not selected for a regular presentation will be
considered for the brief announcement format. This will not affect
consideration of the paper for a regular presentation.

Best Paper Awards
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to be
eligible for a best student paper award, a paper should be authored
only by students and should be marked as such upon submission.


Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:

Track A: Algorithms, Complexity and Games
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Randomness in Computation
* Quantum Computing

Track B: Logic, Semantics, Automata and Theory of Programming
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles and Semantics of Programming Languages
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi

Track C: Foundations of Networked Computation:
Models, Algorithms and Information Management
* Algorithmic Aspects of Networks and Networking
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Should I submit my paper to Track A or Track C?

While the scope of Tracks A and B are generally well understood given
their long history, the situation for Track C may be less obvious. In
particular, some clarifications may be helpful regarding areas of
potential overlap, especially between Tracks A and C.

The aim for Track C is to be the leading venue for theory papers truly
motivated by networking applications, and/or proposing theoretical
results relevant to real networking, certified analytically, but not
necessarily tested practically. The motivation for the track was the
lack of good venues for theory papers motivated by applications in
networking. On the one hand, the good networking conferences typically
ask for extended experiments and/or simulations, while the TCS
community is hardly able to do such experiments or simulations. On the
other hand, the good conferences on algorithms tend to judge a paper
based only on its technical difficulty and on its significance from an
algorithmic perspective, which may not be the same as when judging the
paper from the perspective of impact on networks.

Several areas of algorithmic study of interest to track C have a broad
overlap with track A. Graph algorithmics can belong in either, though
if the work is not linked to networking, it is more appropriate in
track A. Algorithmic game theory is another area of major
overlap. Aspects involving complexity, the computation of equilibria
and approximations, belong more in Track A, while results with
applications in auctions, networks and some aspects of mechanism
design belong in Track C.

Finally, it should be noted that algorithms and complexity of
message-passing based distributed computing belong squarely in track
C, while certain other aspects of distributed computing do not fall
under its scope.


Track A: Algorithms, complexity, and games
Daniel Marx, chair (Hungarian Academy of Sciences, HU)
Alexandr Andoni (Columbia Univ, US)
Nikhil Bansal (Eindhoven Univ of Technology, NL)
Markus Blaser (Saarland Univ, DE)
Glencora Borradaile (Oregon State Univ, US)
Sergio Cabello (Univ of Ljubljana, SI)
Joseph Cheriyan (Univ of Waterloo, CA)
Leah Epstein (Univ of Haifa, IL)
Samuel Fiorini (Univ libre de Bruxelles, BE)
Kasper Green Larsen (Aarhus Univ, DK)
Giuseppe F. Italiano (Univ di Roma "Tor Vergata", IT)
Bart M.P. Jansen (Eindhoven Univ of Technology, NL)
Petteri Kaski (Aalto Univ, FI)
Michal Koucky (Charles Univ, CZ)
Elias Koutsoupias (Oxford, UK)
Robert Krauthgamer (Weizman Inst, IL)
Stephan Kreutzer (TU Berlin, DE)
Troy Lee (Nanyang Technological Univ, SG)
Moshe Lewenstein (Bar-Ilan Univ, IL)
Ankur Moitra (MIT, US)
Seffi Naor (Technion, IL)
Seth Pettie (Univ of Michigan, US)
Michal Pilipczuk (Univ of Warsaw, PL)
Alon Rosen (Herzliya Interdisciplinary Center, IL)
Gunter Rote (Freie Univ Berlin, DE)
Barna Saha (Univ of Massachusetts Amherst, US)
Daniel Stefankovic (Univ of Rochester, US)
Maxim Sviridenko (Yahoo Research, US)
Virginia Vassilevska Williams (MIT, US)
Gerhard Woeginger (RWTH Aachen, DE)
Ronald de Wolf (CWI and Univ of Amsterdam, NL)
Stanislav Zivny (Oxford, UK)

Track B: Logic, semantics, automata and theory of programming
Don Sannella, chair (Univ of Edinburgh, UK)
Nathalie Bertrand (IRISA/INRIA Rennes, FR)
Mikolaj Bojanczyk (Warsaw Univ, PL)
Udi Boker (Interdisciplinary Center Herzliya, IL)
Yuxin Deng (East China Normal Univ, CN)
Floris Geerts (Univ Antwerp, BE)
Dan Ghica (Univ Birmingham, UK)
Alexey Gotsman (IMDEA, ES)
Jan Hoffmann (CMU, US)
Naoki Kobayashi (Univ Tokyo, JP)
Martin Lange (Univ Kassel, DE)
Dirk Pattinson (Australian National Univ, AU)
Femke van Raamsdonk (VU Amsterdam, NL)
Jean-François Raskin (Univ libre de Bruxelles, BE)
Vladimiro Sassone (Univ Southampton, UK)
Thomas Schwentick (TU Dortmund, DE)
Alex Simpson (Univ Ljubljana, SI)
Jiri Srba (Aalborg Univ, DK)
Mirco Tribastone (IMT Lucca, IT)
Tomas Vojnar (Brno Univ of Technology, CZ)
Igor Walukiewicz (CNRS and Univ Bordeaux, FR)
Scott Weinstein (Univ Pennsylvania, US)

Track C: Foundations of networked computation:
Models, algorithms and information management

Christos Kaklamanis, chair (CTI and Univ of Patras, GR)
Susanne Albers (TU Munich, DE)
Luca Becchetti (Sapienza Univ of Rome, IT)
Ioannis Caragiannis (Univ of Patras, GR)
Andrea Clementi (Univ of Rome "Tor Vergata", IT)
Michele Flammini (Gran Sasso Sci Inst and Univ of L'Aquila, IT)
Pierre Fraigniaud (CNRS and Univ Paris Diderot, FR)
Aristides Gionis (Aalto Univ, FI)
Sudipto Guha (Univ of Pennsylvania, US)
Tomasz Jurdzinski (Univ of Wroclaw, PL)
Evangelos Kranakis (Carleton Univ, CA)
Danny Krizanc (Wesleyan Univ, US)
Katrina Ligett (CA Inst of Tech, US and Hebrew Univ,~IL)
Marios Mavronicolas (Univ of Cyprus, CY)
Kobbi Nissim (Georgetown Univ, US)
Marina Papatriantafillou (Chalmers Univ of Tech, SE)
Andrzej Pelc (Univ du Quebec en Outaouais, CA)
David Peleg (Weizmann Inst of Science, IL)
Geppino Pucci (Univ of Padova, IT)
Christian Scheideler (Paderborn Univ, DE)
Roger Wattenhofer (ETH Zurich, CH)

Organizing committee
Jiri Sgall
Anna Kotesovcova (CONFORG)
Andreas Emil Feldmann
Tomas Masarik
Jan Musilek

* Contributions to be spread via DMANET are submitted to
* 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.

[DMANET] OPODIS 2017 Deadline extension - International Conference on Principles of Distributed Systems

========================= *CALL FOR PAPERS* ============================
The 21st International Conference on Principles of Distributed Systems

18-20 Dec, Lisbon


Abstract registration: 28 August 2017
Submission deadline: 04 September 2017
Acceptance notification: 30 October 2017
Final version due: 13 Nov 2017
Conference: 18-20 Dec 2017, Lisbon


OPODIS is an open forum for the exchange of state-of-the-art knowledge on
distributed computing and distributed computer systems. All aspects of
distributed systems are within the scope of OPODIS.
OPODIS solicits papers in all aspects of distributed systems, including
theory, specification, design, performance, and system building.
With a strong background in the theory of distributed systems, OPODIS
has recently expanded its scope to cover the whole range between the
theoretical aspects and practical implementations of distributed systems.


Topics of interest include, but are not limited to:
- Design and analysis of distributed algorithms
- Synchronization, concurrent algorithms, shared and transactional memory
- Design and analysis of concurrent and distributed data structures
- Communication networks (protocols, architectures, services,
- High-performance, cluster, cloud and grid computing
- Mesh and ad-hoc networks (wireless, mobile, sensor), location and
context-aware systems
- Mobile agents, robots, and rendezvous
- Internet applications, social systems, peer-to-peer and overlay networks
- Distributed operating systems, middleware, and distributed database systems
- Programming languages, formal methods, specification and verification
applied to distributed systems
- Embedded and energy-efficient distributed systems
- Distributed event processing
- Distributed storage and file systems, large-scale systems, and big data
- Dependable distributed algorithms and systems
- Self-stabilization, self-organization, autonomy
- Security and privacy, cryptographic protocols
- Game-theory and economical aspects of distributed computing
- Randomization in distributed computing
- Biological distributed algorithms


OPODIS has post-proceedings published by Leibniz International Proceedings in
Informatics (LIPIcs) in gold open access mode. The proceedings become available
online, free of charge, after the conference. Preliminary versions of the
proceedings will be available to participants at the conference electronically.
The camera-ready version of a paper must have the same format and be of the
same length as its submitted version.

Extended and revised versions of selected papers will be considered for a
special issue of Theoretical Computer Science (Elsevier).


Papers are to be submitted electronically through Easychair at the following
Submissions must be in English in PDF format and they must be prepared using the
LaTeX style templates for LIPIcs and choosing the A4 paper option. A submission
must not exceed 16 pages, including the cover page, figures, tables and
references. The cover page should include the title of the paper, the authors'
names, affiliations and e-mails, an abstract, information about the contact
author, and a list of keywords.

Additional details may be included in a clearly marked appendix or as
supplementary material which will be read at the discretion of the reviewers.
Submissions are expected to be intelligible and complete without such additional

A submission must report on original research that has not previously appeared
in a journal or conference with published proceedings. It should not be
concurrently submitted to such a journal or conference. Any overlap with a
published or concurrently submitted paper must be clearly indicated. The
Program Chairs reserve the right to reject submissions that are out of scope,
or of clearly inferior quality, or that violate the submission guidelines.
Each of the remaining papers will undergo a thorough reviewing process.


OPODIS features a best paper award. All accepted papers will be evaluated for
the best paper award. The best paper award aims to encourage work that combines
theory and practice and demonstrates excellence of research in at least one of
these two areas. Such work could be an advance in theory that sheds lights on
an interesting system problem or an advance in system work that builds upon
strong theoretical results.


Alysson Bessani, University of Lisboa, Portugal


Pascal Felber, University of Neuchâtel, Switzerland
James Aspnes, University of Yale, USA


Sara Bouchenak, INSA Lyon, France
Armando Castaneda, UNAM.Mexico
Bogdan Chlebus, University of Colorado, USA
Xavier Defago, Tokyo Institute of Technology, Japan
Oksana Denysyuk, Pure Storage, USA
Carole Delporte, Université Paris Diderot, France
David Doty, University of California, USA
Jim Dowling, SICS/KTH, Swedish
Patrick Eugster, TU Darmstadt, Germany
Chryssis Georgiou, University of Cyprus, Cyprus
Wojciech Golab, University of Waterloo, Canada
Vincent Gramoli, University of Sydney, Australia
David Ilcinkas, LaBRI, CNRS & Bordeaux University, France
Taisuke Izumi, Nagoya Institute of Technology, Japan
Ruediger Kapitza, TU Braunschweig, Germany
Christoph Lenzen, MPI for Informatics, Germany
Rui Oliveira, Universidade do Minho, Portugal
Emanuel Onica, Alexandru Ioan Cuza University of Iasi, Romania
Fernando Pedone, University of Lugano, Switzerland
Sebastiano Peluso, Virginia Tech, USA
Peter Pietzuch, Imperial College London, England
Maria Potop-Butucaru, Université Paris-VI Pierre-et-Marie-Curie, France
Laurent Réveillère, Bordeaux INP/Labri, France
Etienne Rivière, University of Neuchatel, Switzerland
Luis Rodrigues, INESC-ID / IST - University of Lisboa, Portugal
Paolo Romano, INESC-ID / IST - University of Lisboa, Portugal
Romain Rouvoy, University of Lille / Inria / IUF, France
Christian Scheideler, University of Paderborn, Germany
Paul Spirakis, U. Liverpool UK and U. Patras Greece
Jukka Suomela, Aalto University, Finland
Maarteen van Steen, University of Twente, Netherlands
Roman Vitenberg, University of Oslo, Norway
Spyros Voulgaris, VU University Amsterdam, Netherlands
Yukiko Yamauchi, Kyushu University, Japan
Haifeng Yu, National University of Singapore, Singapore


Christian Cachin, IBM Research, Zurich, Switzerland
Panagiota Fatourou, FORTH ICS & University of Crete, Greece
Alessia Milani, University of Bordeaux, France
Fernando Pedone, University of Lugano, Switzerland
Maria Potop-Butucaru, Université Paris-VI Pierre-et-Marie-Curie, France
Giuseppe Prencipe, Università di Pisa , Italy
Etienne Rivière, University of Neuchâtel, Switzerland
Sebastien Tixeuil, IUF & Université Pierre et Marie Curie - Paris 6, France (chair)


Ibéria Medeiros (local arrangements chair), FCUL, University of Lisboa, Portugal
Miguel Matos (publicity chair), INESC-ID / IST, University of Lisboa, Portugal
João Leitão (publication chair), University Nova de Lisboa, Portugal

* Contributions to be spread via DMANET are submitted to
* 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.