[DMANET] ESORICS 2017: Call for Participation

==============================================================================
ESORICS 2017: CALL FOR PARTICIPATION
22nd European Symposium on Research in Computer Security
Oslo, Norway — September 11-15, 2017
==============================================================================

WWW: https://www.ntnu.edu/web/esorics2017/

Overview
------------------------------------
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: https://samosweb.aegean.gr/secpre2017/
* SecSE 2017: http://secse.org
* CBT 2017: http://www.deic.uab.cat/~jherrera/CBT/
* DPM 2017: http://deic.uab.cat/conferences/dpm/dpm2017/
* STM 2017: http://stm2017.di.unimi.it
* QASA 2017: http://www.iit.cnr.it/qasa2017/
* CyberICPS: http://www.ds.unipi.gr/cybericps2017/
* SIoT 2017: http://siot-workshop.org

### 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
Sensors
Steffen Schulz, André Schaller, Florian Kohnhäuser, and Stefan
Katzenbeisser

* 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
Naccache
- Tightly Secure Ring-LWE Based Key Encapsulation with Short
Ciphertexts
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
Randomness
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
Elovici
- 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
Android
Lorenzo Bordoni, Mauro Conti and Riccardo Spolaor
- VuRLE: Automatic Vulnerability Detection and Repair by Learning from
Examples
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
Provision
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
Tippenhauer
- 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
Support
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
Analyses
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
Capkun

* 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.
Chow
- Enforcing Input Correctness via Certification in Garbled Circuit
Evaluation
Yihua Zhang, Marina Blanton and Fattaneh Bayatbabolghani

15:30 - 17:00

* Session 17: Intrusion Detection
- Secure IDS Offloading with Nested Virtualization and Deep VM
Introspection
Shohei Miyama and Kenichi Kourai
- Network Intrusion Detection based on Semi-Supervised Variational
Auto-Encoder
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
Encryption
Kotoko Yamada, Nuttapong Attrapadung, Keita Emura, Goichiro
Hanaoka and Keisuke Tanaka

**********************************************************
*
* 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] UCC 2017, Austin, Texas, USA: Final Call for Papers

10th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2017)

December 5-8, 2017 – Austin, Texas, USA – Call for Participation

Website: http://ucc-conference.org

Venue

AT&T Hotel & Executive Education Conference Center

1900 University Avenue

Austin, TX 78705

Context & Scope

Cloud Computing delivers computational resources on-demand as services that are commoditized and delivered comfortably analogous to traditional utilities such as electricity, gas, water and telephony. Cloud service offerings for compute, storage and communication resources as well as for hosted software and data are growing at a tremendous rate. It is essential to understand how to effectively transform these services into Utilities that provide value to both users and providers. There is also increasing interest from commercial providers to offer business and revenue models around the services they offer. Understanding how these models could be used to provide utility for users, intermediary brokers (aggregators) and providers is also an area of active research. UCC is the premier IEEE/ACM conference covering all areas related to Cloud Computing as a Utility and provides an international forum for leading researchers and practitioners in this important and growing field. UCC 2017, to be held in Austin, reflects the need to bring academics and industrial researchers together to discuss how to improve existing services and how to bring new applications into the cloud.

History

This will be the 10th UCC in a successful conference series of community-driven events. Previous events were held in Shanghai, China (Cloud 2009), Melbourne, Australia (Cloud 2010 & UCC 2011), Chennai, India (UCC 2010), Chicago, USA (UCC 2012), Dresden, Germany (UCC2013), London, UK (UCC 2014), Limassol, Cyprus (UCC 2015) and Shanghai, China (UCC 2016). BDCAT and predecessor conferences have been co-located with UCC for the past several events.

CALL FOR PAPERS

Authors are invited to submit original unpublished research manuscripts that demonstrate current research in all areas of Cloud and Utility computing including design and analysis of distributed and centralized Cloud systems, data centre design and engineering, economic and market models for cloud systems, revenue and business models and their applications in scientific and commercial deployments.

Topics of interest include but are not limited to:

* Principles and theoretical foundations of Utility Computing, including pricing and service models

* Policy languages and programming models, such as cloud-native and cloud-enabled applications

* Utility-driven models and mechanisms for Cloud federations

* Autonomic techniques for Cloud applications

* Utility-/comfort-driven platforms for Clouds

* Architectural models to achieve Utility in Clouds

* Designs and deployment models for Clouds: private, public, hybrid, federated, aggregated

* Cloud Computing middleware, stacks, tools, delivery networks and services at all layers (XaaS)

* Integration of Cloud systems with edge devices

* Virtualization technologies and other enablers

* Economic models and scenarios of use

* Scalability and resource management: brokering, scheduling, capacity planning, parallelism and elasticity, as well as marketplaces

* Cloud management: autonomic, adaptive, self-*, SLAs, performance models and monitoring

* Applications: games, social networks, scientific computing (e-science) and business, as well as large-scale foundations for Big Data and analytics

* Mobile and energy-efficient use of Clouds

* Cloud business and legal implications beyond technology, such as government regulation, security, privacy, trust and jurisdiction especially in Utility Computing contexts

* Hands-on activities, tutorials, and instructional sessions on new technologies and methods

Important Dates

Paper submissions due

30 Aug 2017

Notification of acceptance

23 Sep 2017

Camera ready papers due

30 September, 2017

Early registration deadline

30 September, 2017

Regular registration deadline

31 October, 2017

* (Separate calls for submissions will be issued by each workshop or tutorial accepted)

Manuscript guidelines

Authors are requested to submit papers electronically. Submitted manuscripts should be structured as technical papers and may not exceed 10 letter size (8.5 x 11) pages including figures, tables and references using the templates available at http://www.acm.org/publications/proceedings-template, which include an optional free collaborative cloud-based LaTeX authoring tool. Papers should be prepared in two-column single-spaced format.

Authors should submit the manuscript in PDF format and make sure that the file will print on a printer that uses letter size (8.5 x 11) paper. The official language of the meeting is English. All manuscripts will be reviewed and will be judged on correctness, originality, technical strength, significance, quality of presentation, and interest and relevance to the conference attendees. Papers conforming to the above guidelines can be submitted through the UCC 2017 paper submission system (https://easychair.org/conferences/?conf=ucc2017).

Submitted manuscripts should be structured as technical papers and need to conform to the ACM conference format guidelines.

Manuscript submissions must be received by the announced submission deadline. All manuscripts will be reviewed by the Program Committee and evaluated on originality, relevance of the problem to the conference theme, technical strength, rigour in analysis, quality of results, and organization and clarity of presentation of the paper.

Submitted papers must represent original unpublished research that is not currently under review for any other conference or journal. Further details on the publication instructions and registration information will be published on the UCC website.

See also the call for posters and the workshop pages on the ucc-conference.org web site.

**********************************************************
*
* 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] Open Positions (ETH, ENS) - Compilation for Heterogenous Systems (Math. Optimization, Polyhedral Compilation, FPGA)

I'm happy to forward this announcement on behalf of Tobias Grosser
(CS, ETHZ) to this audience. These are excellent opportunities for applying integer (non-)linear
optimization techniques to compiler construction, with direct impact on the LLVM compiler family,
from embedded devices to high-performance computing. Links to the Cray EMEA Research Lab
are also possible.

--------
We are glad to announce four open positions at Polly Labs (hosted at ENS
Paris and at ETH Zurich) to work with us towards developing scalable
compilation technology for heterogeneous systems (including FPGAs) and
large-scale real-world programs.

Starting off from the solid foundations the LLVM Polly loop optimizer
and accelerator compiler provides, we aim to scale the underlying
techniques towards larger programs, better (or optimal) transformations,
and modern programming languages (Julia, Javascript, ...). For this
journey we will combine linear and non-linear solvers, integer polyhedra
based program generation techniques, JIT compiler technology, automatic
tuning, accelerator compilation, ... and likely many other ideas.
Emerging platforms such as FPGAs are one of our core focus points. All
of our research results will be published as open source!
Depending on the position, you might work in close collaboration with
one of our industrial partners.

We are looking for excellent candidates for (PRE)DOCTORAL and
POST-DOCTORAL positions!

If you are (or know somebody who is):

- Expert in compilation and code generation (e.g., LLVM, gcc, …)
- Strong mathematical background (e.g., linear programming, (non)-linear
optimization, …)
- Interested in doing theoretically profound research applied in
practice and published as open source

with additionally experience in:

- Polyhedral loop modeling (e.g., Polly, isl, Pluto)
- Accelerators (e.g., CUDA, OpenCL, Vulkan)
- Development high-quality software and interactions with open source
communities

and for the FPGA positions experience in:

- High-level synthesis (e.g., Xilinx Vivado, SDAccel)
- Overlay networks

get in touch!

Our job offers are pretty demanding. Still, we do not hire by ticking
boxes, but look for exceptional candidates. If you are able to write a
non-linear branch-and-bound solver over night, but never heard of GPUs,
please talk with us. Similarly, if you can program FPGAs in and out, but
need a crash course in polyhedra, get in touch!

Detailed job descriptions: http://grosser.es/jobs.html and https://www.inf.ethz.ch/personal/tgrosser/jobs.html

----

--
Dr. Utz-Uwe Haus <uhaus@cray.com>
Cray EMEA Research Lab <http://www.cray.com/cerl>
Hochbergerstrasse 60C, 4057 Basel, Switzerland

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

[DMANET] EVOApplications 2018 Call for Papers

CfP: EVOApplications 2018 - Parma, 4-6 April 2018

Submission Deadline: 1 November, 2017, 16 pages Springer LNCS

Authors of selected publications will be invited to submit an extended
version of their work to Springer's Genetic Programming and Evolvable
Machines (GPEM, impact factor: 1.514, fast track review process).

EvoApplications, the European Conference on the Applications of
Evolutionary Computation brings together researchers in a variety of areas
of application of Evolutionary Computation and other Nature-inspired
techniques.

EvoApplications' 21st edition will be held as part of the EvoStar 2018
event in Parma, Italy, 4-6 April 2018, and co-located within EvoStar with
three related conferences: EuroGP, EvoCOP and EvoMUSART.

*Publication*
- Page limit: 16 pages.
- Accepted papers will be published by Springer Verlag in the Lecture Notes
in Computer Science series.
- The review process is double-blind. Please ensure to anonymize your
submission accordingly.
- Selected papers will be invited to submit extended versions to Genetic
Programming and Evolvable Machines.

*The Venue*
Parma is an elegant city with the refined atmosphere of a "petite
capitale". It is rich in cultural treasures and with its attractive
architecture, shops and restaurants, it is very welcoming. Parma is a
centre of gastronomic heritage, famous for Parma ham and Parmigiano
Reggiano cheese. The conference will be held at the University Campus.

*Tracks*
EvoApplications 2018 is composed of 14 tracks, each focusing on an area of
application of genetic and evolutionary computation and other related
Computational Intelligence fields. The following tracks will be running in
2018. Papers on applications of Evolutionary Computation and related
methods to other fields are also welcome and will be presented within a
"General" track.

- EvoBAFIN - Natural Computing Methods in Business Analytics and Finance.
- EvoBIO - Evolutionary Computation, Machine Learning and Data Mining

for Biology and Medicine.
- EvoCOMNET - Nature-inspired Techniques for Communication Networks and
other Parallel and Distributed Systems.
- EvoCOMPLEX - Evolutionary Algorithms and Complex Systems.
- EvoENERGY - Evolutionary Algorithms in Energy Applications.
- EvoGAMES - Bio-inspired Algorithms in Games.
- EvoIASP - Evolutionary Computation in Image Analysis, Signal
Processing
and Pattern Recognition.
- EvoINDUSTRY - Evolutionary and Bio- Inspired Computational Techniques
within Real-World Industrial and Commercial Environments.
- EvoKNOW - Knowledge Incorporation in Evolutionary Computation.
- EvoNUM - Bio-inspired algorithms for Continuous Parameter
optimization.
- EvoPAR - Parallel Architectures and Distributed Infrastructures.
- EvoROBOT - Evolutionary Robotics.
- EvoSET - Nature-inspired algorithms in Software Engineering and
Testing.
- EvoSTOC - Evolutionary Algorithms and Meta-heuristics in Stochastic
and
Dynamic Environments.

Visit http://www.evostar.org/ or join the EVOstar group on LinkedIn for
more details and updates.

EvoApplications Coordinator
Kevin Sim, Edinburgh Napier University, United Kingdom

EvoApplications Publication Chair
Paul Kaufmann, Paderborn University, Germany

Evo* Coordinator
Jennifer Willies, United Kingdom

Evo* Local Chairs
Stefano Cagnoni, Università degli Studi di Parma, Italy
Monica Mordonini, Università degli Studi di Parma, Italy

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

[DMANET] Stellenausschreibung wiss. Mitarbeiter/in am Institut für Transportlogistik, TU Dortmund (neue Deadline)

Mit über 6.200 Beschäftigten in Forschung, Lehre und Verwaltung und ihrem einzigartigen Profil gestaltet die Technische Universität Dortmund Zukunftsperspektiven: Das Zusammenspiel von Ingenieur- und Naturwissenschaften, Gesellschafts- und Kulturwissenschaften treibt technologische Innovationen ebenso voran wie Erkenntnis- und Methoden fortschritt, von dem nicht nur die 34.200 Studierenden profitieren.

An der Technischen Universität Dortmund ist in der Fakultät Maschinenbau, im Institut für Transportlogistik zum nächstmöglichen Zeitpunkt die Stelle

einer / eines wissenschaftlich Beschäftigten

zunächst befristet bis zum 31. Mai 2019 (Projektlaufzeit) mit der Option auf Verlängerung zu besetzen. Die Vertragslaufzeit wird dem Qualifizierungsziel angemessen gestaltet. Die Entgeltzahlung erfolgt entsprechend den tarifrechtlichen Regelungen nach Entgeltgruppe E 13 TV-L bzw. ggfls. nach dem Übergangsrecht (TVÜ-L). Es handelt sich hierbei um eine Ganztagsstelle. Eine
Beschäftigung in bzw. Reduzierung auf Teilzeit ist grundsätzlich möglich.

In einem interdisziplinären Team forschen und lehren die Mitarbeiterinnen und Mitarbeiter des ITL im Bereich der Verkehrs- und Transportlogistik. Dabei stehen die Optimierung von Verkehrsflüssen oder die Verbesserung der Ressourcenplanung und
-nutzung in logistischen Anlagen im Mittelpunkt der Aktivitäten.

Anforderungsprofil

* Überdurchschnittlich abgeschlossenes wissenschaftliches Hochschulstudium (Diplom/Master) in der Fachrichtung Informatik, (Wirtschafts-)Mathematik, Verkehrsingenieurwesen o. ä.,
* Fundierte Kenntnisse in mathematischer, insbesondere diskreter, Optimierung und Algorithmenentwicklung,
* Interesse an logistischen Fragestellungen, insbesondere im Bereich des ÖPNV
* Programmierkenntnisse (z. B. C++ oder Java) sind wünschenswert,
* Erfahrungen im Umgang mit einer Modellierungssprache (GAMS, Aimms, etc.) sind von Interesse
* Sicherer Umgang mit den gängigen Office-Anwendungen
* Gute Englischkenntnisse,
* Interesse an einer selbstständigen Bearbeitung von wissenschaftlich anspruchsvollen Fragestellungen,
* Fähigkeit zur Zusammenarbeit in einem interdisziplinären Team, soziale Kompetenz und ein hohes Maß an Engagement und Kooperationsbereitschaft.

Aufgabenbereich

Die Deutsche Forschungsgemeinschaft (DFG) hat die Forschergruppe "Integrierte Planung im öffentlichen Verkehr" eingerichtet. In diesem überregionalen Vorhaben ist das Ziel der Forschungsarbeit des Instituts für Transportlogistik der Technischen Universität Dortmund, vorherrschende Unsicherheiten bei verschiedenen Planungsproblemen im öffentlichen Verkehr besser mit Hilfe mathematischer Optimierung und Simulation handhaben zu können und so zu robusteren Lösungen im täglichen Betrieb zu gelangen. Die Technische Universität Dortmund will den Anteil von Frauen in der Wissenschaft in der Fakultät Maschinenbau erhöhen und bittet daher insbesondere Frauen um ihre Bewerbung. Es wird darauf hingewiesen, dass die Bewerbung geeigneter Schwerbehinderter erwünscht ist. Sie sind interessiert? Dann senden Sie uns Ihre Bewerbung mit den üblichen Unterlagen bitte bis zum 05.09.2017 unter Angabe der Referenznummer w46-17 an:

Technische Universität Dortmund
Herrn Univ.-Prof. Dr.-Ing. Uwe Clausen
Institut für Transportlogistik (ITL)
Leonhard-Euler-Straße 2
44227 Dortmund

Für Fragen steht zur Verfügung:
Herr Sven Langkau
Tel.: 0231/755-7329
E-Mail: langkau@itl.tu-dortmund.de<mailto:langkau@itl.tu-dortmund.de>

Dortmund, 09.08.2017

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

[DMANET] Professorship "Sustainable Transportation Logistics (Physical Internet)" at JKU Linz

The Faculty of Social Sciences, Economics & Business at the Johannes
Kepler University Linz (Austria) invites applications for a full-time,
tenured faculty position as a

***
Professor for
Sustainable Transportation Logistics with a focus on "Physical Internet"
http://www.jku.at/content/e213/e152/e141/e14908/e14907/e14896/e307677?showlang=eng
***

Application deadline: August 31, 2017

The successful candidate is expected to support the development and
expansion of research in the field of the "Physical Internet" at the
Johannes Kepler University and will represent this field in research and
teaching in all of its sub-areas. Research activities will focus on the
future-oriented design of a logistical flow of goods and using the
Physical Internet to strive for a sustainable, positive economic,
ecological, and socially relevant impact. Accordingly, the successful
candidate will work equally on conducting application-oriented and
base-knowledge research in both logistical and computer science-related
research topics. In the field of teaching, the successful candidate will
be expected to develop a new area of specialization in conjunction with
existing courses already offered at the Johannes Kepler University. The
successful candidate will also be willing to independently address and
carry out administrative tasks at the university/department as well as
actively take part in academic committees.

The successful candidate must

(a) hold a post-doctorate (venia docendi) degree or a comparable
post-doctorate degree, preferably with a focus on transportation
logistics and/or computer science,
(b) demonstrate past experience in conducting base-knowledge research
with a focus on logistics and/or computer sciences,
(c) possess experience in academia and teaching at all levels,
(d) submit a list of publications on an international level and a list
of all academic lectures, presentations, etc.,
(e) show professional relationships with companies and industries
demonstrated through ongoing projects in collaboration with companies,
(f) show experience in acquiring external funding, and
(g) show international experience and professional contacts.

In addition to the key qualifications as cited above, the successful
candidate is expected to possess a strong social skill set.

The annual gross salary is €90,000 to €110,000; the actual net income
amount can only be negotiated with the Rector.

The Johannes Kepler University wishes to increase the proportion of
academic female faculty members and, for this reason, especially
welcomes applications by qualified women. If applicants are equally
qualified, a woman will be given preference for this position.

The applicant may not have been previously employed at an Austrian
university since 2013.

Prospective applicants interested in the position are requested to
electronically send an application in adherence to the stated criteria,
together with the requested documentation (including all relevant
documents, application form, current CV, list of publications, and a
list of all courses taught, etc.) to the Rector of the Johannes Kepler
University of Linz (bewerbung@jku.at).

Information for Applicants:
http://www.jku.at/Rektorat/content/e6424/e6423/e307677/e307687/StellenprofilSustainableTransportationLogistics_eng.pdf

Application Form:
http://www.jku.at/Rektorat/content/e6424/e6423/e307677/e307688/ApplicationForm_eng.doc

**********************************************************
*
* 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] Open positions: Two lecturer/senior lecturer positions in algorithms at the University of Sydney

Two lecturer/senior lecturer (assistant professor) positions in algorithms
available at the University of Sydney, Australia.

Closing date: 11:30pm, Sunday, 27 August 2017 (Sydney time)

Full ad: http://bit.ly/2wBCOxv

The School of Information Technologies at the University of Sydney is
embarking on an exciting growth journey, adding several new positions which
will complement our core areas of strength pushing the frontiers to new
research areas. As part of this plan, the School of Information
Technologies (SIT) invites applications from outstanding candidates for a
continuing Lecturer or Senior Lecturer position (Level B/C) in Algorithms
starting immediately. The level of appointment will be commensurate with
qualifications and experience.

This is an attractive opportunity for candidates with an interest and
passion for high quality excellent research and teaching. Strong candidates
from all areas of algorithmic research are sought, including but not
limited to: algorithm analysis, graph algorithms, algorithmic game theory,
approximation algorithms, combinatorial optimization, quantum algorithms
and computational learning theory.

To be successful, you will have a PhD in computer science, or a closely
related discipline. You must show evidence of excellent research
achievements in areas of algorithms and the ability to publish your
research in highly-ranked outlets. You will be expected to teach a range of
computer science courses including algorithms related courses. A strong
commitment to teaching and learning is required as well as evidence of
ability to lecture and prepare new teaching material. The candidate is
expected to teach in a broad range of computer science subjects including
algorithms and computing theory.

Informal enquiries are welcome, and can be made to Joachim Gudmundsson (
joachim.gudmundsson@sydney.edu.au).

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

[DMANET] Announcement: [Algorithms] Special Issue "Online Algorithms"

Dear Colleagues,

We cordially invite you to submit a manuscript for consideration and
possible publication in a Special Issue on "Online Algorithms" to be
published in the open access journal Algorithms
(http://www.mdpi.com/journal/algorithms), which is indexed by EI and ESCI.

The submission manuscript deadline is 30 November 2017. The goal of this
Special Issue is to offer a forum for exchanging new ideas about the
design and analyses of online algorithms for various optimization
problems. For more details please visit the website:
http://www.mdpi.com/journal/algorithms/special_issues/Online_Algorithms

You may share this invitation with your team members and colleagues;
co-authors are most welcome.

Please let me know within a month or as soon as possible if you and your
colleagues are interested in submitting a manuscript for this special
issue. Your contribution would be most welcome.

Kind regards,
Ms. Yi Zhang
Assistant Editor

Algorithms CiteScore 2016: 1.15
https://www.scopus.com/sourceid/21100199795

--
MDPI Branch Office, Wuhan
Tel. +86 27 878 086 58;
Fax: +86 27 876 125 88
E-Mail: algorithms@mdpi.com
http://www.mdpi.com/journal/algorithms/

MDPI AG
St. Alban-Anlage 66, 4052 Basel,
Postfach, CH-4020 Basel, Switzerland
Tel. +41 61 683 77 34; Fax +41 61 302 89 18
http://www.mdpi.com/

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

[DMANET] Building Bridges II. registration

Dear Colleague,

We apologoze for the possible multiple posting. The registration for

Building Bridges II.
Conference to celebrate 70th birthday of László Lovász
Budapest, Hungary
July 2 - 6, 2018

is open now. Please go to page

http://www.renyi.hu/conferences/ll70/registration/

for details.

It is hard to believe but true: László (Laci) Lovász will turn seventy in
2018. His contributions to discrete mathematics and theory of algorithms
have been fundamental. He has connected combinatorics and theoretical
computer science with other areas of mathematics in many ways. To celebrate
Laci's birthday and his extraordinary achievements, the János Bolyai
Mathematical Society, the Eötvös University, and the Alfréd Rényi Institute
of Mathematics organize an international conference. Titled "Building
Bridges II", the meeting will be held in Budapest, Hungary, July 2 to 6,
2018. The scientific program will consist of invited lectures and poster
sessions.

Confirmed invited speakers include

Noga Alon László Babai Anders Björner
Béla Bollobás Christian Borgs Sourav Chatterjee
Jennifer Chayes Persi Diaconis Uriel Feige
Tibor Jordán Jacob Fox Jeff Kahn
Gil Kalai Ravi Kannan Peter Keevash
Nathan Linial Jaroslav Nešetřil Alexander Razborov
Lex Schrijver Joel Spencer Balázs Szegedy
Endre Szemerédi Tamás Szőnyi Terry Tao
Éva Tardos Gábor Tardos Santosh Vempala
Vu Ha Van Avi Wigderson Ágnes Backhausz
Endre Csóka Péter Csíkvári László Végh
Hamed Hatami

Best wishes,
Attila Sali
Secretary of the Organizing Committee
**********************************************************
*
* 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] 2-Year Stipend for a PhD Student in Text Algorithms at University of Warsaw, Poland

One stipend position for a PhD student is opening in the "Algorithms for
text processing with errors and uncertainties" project that is carried out
within the HOMING programme of the Foundation for Polish Science. The
project is co-financed by the European Union under the European Regional
Development Fund.

The maximum duration of the stipend is 21 months, starting Oct 2, 2017. The
deadline for applications is *Aug 25, 2017*.

A candidate should have a status of a PhD student on the starting date of
the project. This could include eligibility for PhD studies at the
University of Warsaw in the recruitment during September 2017.

The goal of the project is the design of pattern matching algorithms when
errors and uncertainties occur in the data. The expected developments of
the project are in the scope of computer science while the motivation stems
mainly from computational biology. In pattern matching with errors we are
to report approximate matches with bounded edit or Hamming distance.
Uncertain texts are texts with don't care symbols, indeterminate symbols,
or positions that specify a probability distribution over the alphabet
(so-called Position-Weight Matrices). The scope of problems considered in
the project includes pattern matching in the off-line, on-line, and
streaming setting, text indexing, internal text queries, and computation of
similarity measures.

The key responsibilities include:

- Design and analysis of efficient algorithms for pattern matching in
the presence of errors and uncertainties
- Preparation of manuscripts and presenting them at international
conferences
- Optional: Implementation of selected algorithms

A successful candidate will take part in research on key problems in the
area of text algorithms. The project is conducted at the Faculty of
Mathematics, Informatics and Mechanics, University of Warsaw which is a
leading institution in the field of theoretical computer science. The
official partners of the project are experienced researchers and PhD
students from the UK and France. You will be able to disseminate the
results of your work at international conferences. Your results will be
expected to become the basis of your PhD thesis.
More details can be found at the website:
https://www.mimuw.edu.pl/~jrad/tpeu.html

For further information, feel free to contact me at jrad@mimuw.edu.pl

Best regards,
Jakub Radoszewski
**********************************************************
*
* 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] BigDF 2017: IEEE International Workshop on Foundations of Big Data Computing

************************************************************************************************
CALL FOR PAPERS

IEEE International Workshop on Foundations of Big Data Computing (BigDF
2017)
In conjunction with HiPC 2017 (http://www.hipc.org)
December 18, 2017
Le Meridien, Jaipur, India

http://hipc.org/foundations-of-big-data-computing-workshop/
************************************************************************************************

What constitutes a "Big Data" problem? What application domains are best
suited to benefit from Big Data analytics and computing? What are the
traits and characteristics of an application that make it suited to exploit
Big Data analytics? How can Big Data systems and frameworks be designed to
allow the integration and analysis of complex data sets? How can research
in Big Data Analytics benefit from the latest advances in supercomputing
and High Performance Computing (HPC) architectures? The goal of this
workshop is to address questions like these that are fundamental to the
advancement of Big Data computing, and in the process, build a diverse
research community that has a shared vision to advance the state of
knowledge and discovery through Big Data computing.

Topics of interest include research contributions and innovative methods in
the following areas (but not limited to):

* Scalable tools, techniques and technologies for Big Data analytics (e.g.,
graph and stream data analysis, machine learning and emerging deep learning
methods)
* Algorithms and Programming Models for Big Data
* Big Data applications - Challenges and Solutions (e.g., life sciences,
health informatics, geoinformatics, climate, socio-cultural dynamics,
business analytics, cybersecurity)
* Scalable Big Data systems, platforms, services, and management
* Big Data toolkits, workflows, metrics, and provenance.

We invite paper submissions that describe original research contributions
in the area of Big Data computing, and position papers that highlight the
potential challenges and opportunities that arise in Big Data computing. We
also invite short papers that describe work-in-progress original research.

Regular papers can be up to 8 pages long and short papers can be up to 4
pages long. All submissions will undergo rigorous peer-review by the
technical program committee, and accepted manuscripts will appear in the
HiPC workshop ("HIPCW") proceedings and will be indexed by IEEE digital
library. Authors of the accepted manuscripts will be required to present
their work at the workshop proceedings.

Paper Submission link: The paper submission opens July 1, 2017. Click on
the following link for submitting your papers:
https://www.easychair.org/conferences/?conf=hipcbigdf17

Authors can submit an abstract prior to submitting the full paper for
review. The abstract is not mandatory but is recommended to help organizers
plan the review phase in a timely fashion (i.e., authors can submit a full
paper without having submitted an abstract). However, submissions with only
full papers will be reviewed.

Organizing Committee:

* General Chairs: Dinkar Sitaram (PESIT), Ananth Kalyanaraman (Washington
State University)
* Program Chairs: Madhu Govindaraju (SUNY Binghamton), Saumyadipta Pyne
(IIPH, Hyderabad)
* Publicity Chair: Arindam Pal (TCS Research and Innovation)
* Proceedings Chair: Ren Chen, USC (HiPC proceedings chair)
* Industry Liaison: Vivek Yadav (FullStackNet, India)

Technical Program Committee:

Medha Atre, IIT Kanpur

Ariful Azad, Lawrence Berkeley National Laboratory

Biplab Banerjee, IIT Roorkee

Suren Byna, Lawrence Berkeley National Laboratory

Nabanita Das, Indian Statistical Institute

Oded Green, Georgia Institute of Technology

Manish Kurhekar, Visvesvaraya National Institute of Technology

Suresh Marru, Indiana University

Arindam Pal, TCS Research

Laks Raghupathi, Shell, India

Sudip Seal, Oak Ridge National Laboratory

Gokul Swamy, Amazon

Devesh Tiwari, Northeastern University

Abhinav Vishnu, Pacific Northwest National Laboratory

Yinglong Xia, Huawei Research America

Jaroslaw Zola, University of Buffalo

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

[DMANET] 2017 COIN-OR Cup

Announcing the thirteenth annual "COIN-OR Cup" competition,
sponsored by the COIN-OR Foundation.

Guidelines:
* A submission or nomination must contain:
1. a synopsis of an effective use of COIN-OR or
valuable contribution to COIN-OR (or both!),
2. an explanation of its significance.

* The winner must accept the prize in person at the 2017 INFORMS
Annual Meeting so we can all celebrate appropriately (see "Celebration"
below).

* Submission deadline: Friday, September 22nd, 2017.

* Self-nominations are welcome.

* We especially encourage nominations of effective use of COIN-OR that
the community may not know about.

Celebration: The 2017 COIN-OR Cup will be awarded at a celebration
during the INFORMS Annual meeting in Houston, TX. All entrants,
their supporters, and other interested parties are welcome to join the
celebration and regale, rile, and roast the prize winners. Details
of the event will be announced later.

The winning entry will be announced at this celebration event,
and posted on the COIN-OR website https://www.coin-or.org .

Please e-mail your submissions to coin-cup@coin-or.org in a single
zipped archive, containing a description of your submission and copies
of all relevant papers/documents.

2017 COIN-OR Cup Committee:
Giacomo Nannicini (chair), IBM T.J. Watson
Andrew Conn, IBM T.J. Watson
Thomas Wortmann, Singapore University of Technology and Design
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Final Call for Posters: Graph Drawing and Network Visualization GD 2017

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

Final Call for Posters

GD 2017

25th International Symposium on
Graph Drawing and Network Visualization

September 25-27, 2017 - Boston, MA, U.S.A.
http://graphdrawing.org/gd2017

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

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

GD has been the main annual event in this area for more than 20 years.
Its focus is on combinatorial and algorithmic aspects of graph drawing
as well as the design of network visualization systems and interfaces.
GD 2017 will take place September 25-27, 2017 at the Northeastern
University in Boston, Massachusetts, USA. Researchers and practitioners
working on any aspects of graph drawing and network visualization are
invited to submit posters and to participate in the symposium.

POSTER SUBMISSION INFORMATION
-----------------------------

The submission of posters on graph drawing, network visualization, and
related areas is solicited. The poster session will provide a forum
for the communication of late-breaking research results (which may also
appear elsewhere) to the GD community. Authors of posters should prepare
an abstract (up to two pages in unmodified LNCS style -- no times
package is allowed) that must be submitted together with the poster.
Abstracts of accepted posters will appear in the conference proceedings
(two pages). The maximum size for a poster is A0 (84.1 cm x 118.9 cm).
The posters must be in portrait mode.

Each submission will then consist of two pdf files (the two-page
abstract and the poster) and must include names, email addresses and
contact information of the contributors. Contributions must be submitted
via EasyChair following the link provided on the conference web site.

BEST POSTER AWARD
-----------------

To recognize the effort of the participants in preparing and presenting
their posters in a clear and elegant way, there will be a Best Poster
Award voted on by the GD 2017 attendees.

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

• Poster submission deadline August 17 (23:59 PDT)
• Notification of poster acceptance August 28
• Final versions due September 3
• Symposium September 25-27

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

Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
Alessandro Vespignani, Northeastern University, US

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

Daniel Archambault, Swansea University, GB
Benjamin Bach, University of Edinburgh, GB
Fabian Beck, Universität Duisburg-Essen, DE
Michael Bekos, Universität Tübingen, DE
Therese Biedl, University of Waterloo, CA
Giordano Da Lozzo, UC Irvine, US
Vida Dujmovic, University of Ottawa, CA
Stephane Durocher, University of Manitoba, CA
Tim Dwyer, Monash University, AU
Fabrizio Frati (co-chair), Università Roma Tre, IT
Martin Gronemann, Universität zu Köln, DE
John Alexis Guerra Gómez, Universidad de los Andes, CO
Michael Hoffmann, ETH Zürich, CH
Yifan Hu, Yahoo Research, US
Takayuki Itoh, Ochanomizu University, JP
Anna Lubiw, University of Waterloo, CA
Kwan-Liu Ma (co-chair), UC Davis, US
Fabrizio Montecchiani, Università degli Studi di Perugia, IT
Martin Nöllenburg, Technische Universität Wien, AT
Arnaud Sallaberry, LIRMM, FR
Andrew Suk, University of Illinois at Chicago, US
Antonios Symvonis, National Technical University of Athens, GR
Ioannis Tollis, University of Crete, GR
Csaba Tóth, California State University Northridge, US
Alexander Wolff, Universität Würzburg, DE
Jian Zhao, FX Palo Alto Laboratory, US

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

Cody Dunne (co-chair), Northeastern University, US
Alan Keahey (co-chair), Conversant, US

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

Philipp Kindermann, Universität Würzburg, DE
Maarten Löffler (chair), Utrecht University, NL
Ignaz Rutter, Karlsruhe Institute of Technology, 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/
*
**********************************************************

from Lane A. Hemaspaandra: JOEL I. SEIFERAS RETIREMENT CELEBRATION: JoelFest: A Day of Talks by Zvi Galil, Shafi Goldwasser, Jon Kleinberg, and Muthuramakrishnan Venkitasubramaniam

JOEL I. SEIFERAS RETIREMENT CELEBRATION:
JoelFest: A Day of Talks by
Zvi Galil,
Shafi Goldwasser,
Jon Kleinberg, and
Muthuramakrishnan Venkitasubramaniam

Monday, September 4, 2017 (Labor Day), 9AM—5PM


ANNOUNCEMENT AND REGISTRATION REQUEST

Our dear colleague Joel I. Seiferas retired on December 31, 2016,
after more than 37 years at the University of Rochester's Department
of Computer Science, and became professor emeritus of computer
science.

Joel generously asked that the department make his retirement
celebration be a day of accessible, enjoyable talks by interesting
theoreticians.

So to celebrate Joel's career and recognize his transition to emeritus
status, the department is hosting a day of accessible, enjoyable talks
by interesting theoreticians, namely, we'll have a day of talks from
9AM to 5PM on Monday, Sept. 4 (Labor Day), by:
* Zvi Galil, the John P. Imlay Dean of Computing and Professor
at Georgia Tech's College of Computing,
* Shafi Goldwasser, the RSA Professor of Electrical Engineering
and Computer Science at MIT,
* Jon Kleinberg, Tisch University Professor of Computer Science
at Cornell University, and
* Muthuramakrishnan Venkitasubramaniam, Department of Computer
Science, University of Rochester.

The talks are all free and open to the public, and we very much hope
you will attend them. The web page

http://www.cs.rochester.edu/u/lane/=joelfest/

has the information (schedule, travel, lodging, etc.) on the event,
and on how to register (**please register by August 22nd** so we know
how many will attend and can get right the room size for the talks;
registering is about a 1-minute process), and on how---if you won't be
able to attend but would like to send a message for Joel to be given
on that day---to do so.

Much hoping to see you there!

Cheers,
Lane A. Hemaspaandra, Daniel Stefankovic, and Muthu Venkitasubramaniam

[DMANET] EATCS Bulletin, call for abstracts

EATCS Bulletin, http://eatcs.org/index.php/eatcs-bulletin, has a
section for "Technical contributions." To stimulate this section
further, we have just started publication abstracts of works
that have been accepted by journals and/or conferences or have
appeared in major archives. The topics of interest include all areas
of theoretical computer science (for instance, see topics of the three
Tracks of ICALP, http://www.easyconferences.eu/icalp2016/cfp.html).

Abstracts should be rather detailed, 2-3 pages long in the format
given at http://eatcs.org/index.php/eatcs-bulletin. Submissions
should include the information on the full paper (the name of
conferences, archives, etc) and sufficiently detailed explanation of
its merits, e.g., importance, motivations, clear comparison with
existing results and novelty and/or new ideas of proof techniques.

The Bulletin is published in Feb, Jun and Oct. The deadline for the
abstract submission is 15th of the previous month, for instance, Aug
15, 2017 for the Oct issue of this year. All materials including
tex and pdf files should be sent electrically to bulletin@eatcs.org
and iwama@kuis.kyoto-u.ac.jp. Acceptance/rejection, decided based on
its merit mentioned above, will be notified as soon as possible. The
Bulletin will not require copy-right transfer for accepted abstracts.

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

[DMANET] Postdoctoral position at Queen Mary, University of London

The School of Mathematical Sciences at Queen Mary, University of London is seeking to recruit a Postdoctoral Research Assistant to participate in an EPSRC-funded project "Algorithms that count: exploring the limits of tractability". The Principal Investigator for the project, which runs until the end of October 2018, is Mark Jerrum. The project aims to quantify the inherent computational difficulty of counting problems. Applicants should possess an excellent knowledge of computational complexity, analysis of algorithms and/or relevant areas of mathematics such as applied probability or combinatorics, and have a proven record of conducting research in an area relevant to the project. For further details, visit

https://webapps2.is.qmul.ac.uk/jobs/job.action?jobID=2596

The closing date for applications is Wednesday 13th September 2017.

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

[DMANET] WPTACIS 2017 - Call for Papers

Call for Papers
===================
Workshop on Practical and Theoretical Aspects of Cryptography and
Information Security
http://www.viam.science.tsu.ge/aminse2017/satellite/
Tbilisi, Georgia, December 9, 2017.

Overview
===================
Cryptographic protocols have an important role to achieve information
security concepts in real world. Those are nice applications of number
theory, algebraic geometry, information theory and so on. The aim of this
workshop is to bring together researchers and provide them with a platform
to report on recent developments in the information security and cryptology.

The focus of the workshop is on the foundations, theory and applications of
information security and cryptology.

Abstract Submission
===================
Interested persons are invited to submit one page abstracts prepared in
LaTeX. The abstract must contain title, full name of the authors,
affiliations and e-mail addresses. The accepted abstracts will be made
available electronically on the VIAM webpage before the conference.
Abstracts must be electronically submitted in Tex and PDF via easychair

Important Dates
===================
September 15, 2017 − Deadline for abstract submission
September 30, 2017 − Abstract acceptance notification
November 30, 2017 − Workshop registration deadline
December 9, 2017 − Workshop day

Program Committe
===================
Sedat Akleylek, Ondokuz Mayis University, Turkey (chair)
Besik Dundua, Tbilisi State University, Georgia
Mohamed Saied Emam, Darmstadt University of Technology, Germany
Grigor Giorgadze, Tbilisi State University, Georgia
Baris Bulent Kirlar, Suleyman Demirel University, Turkey
Temur Kutsia, Johannes Kepler University, Austria
Mikheil Rukhaia, Tbilisi State University, Georgia
Muharrem Tolga Sakalli, Trakya University, Turkey
Zulfukar Saygi, TOBB ETU, Turkey
Ion Tutanescu, Pitesti University, Romania
Oguz Yayla, Middle East Technical University, Turkey

Organizing Committe
Sedat Akleylek, Ondokuz Mayis University, Turkey
Besik Dundua, Tbilisi State University, Georgia
Grigor Giorgadze, Tbilisi State University, Georgia
Baris Bulent Kirlar, Suleyman Demirel University, Turkey
Mikheil Rukhaia, Tbilisi State University, Georgia
Zulfukar Saygi, TOBB ETU, Turkey

Contact
Any inquiries about the workshop can be sent to ptacis2017@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] DISC17 Call for Participation

DISC 2017
The 31st International Symposium on Distributed Computing
October 16-20th, 2017, Vienna, Austria
http://www.disc-conference.org/wp/disc2017/

Early registration deadline: August 14th
http://www.disc-conference.org/wp/disc2017/registration/

HIGHLIGHTS

Invited speakers:

Anne-Marie Kermarrec (INRIA, Rennes, France)
Dana Randall (Georgia Tech, USA)
Christian Cachin (IBM Research Zurich, Switzerland)

Accepted papers:

http://www.disc-conference.org/wp/disc2017/accepted-papers/

Workshops:

October 16th:

FRIDA: Formal Reasoning in Distributed Algorithms
Workshop on Blockchain Technology and Theory
TPC: Workshop on the Theory and Practice of Concurrent Data Structures

October 20th:

ADGA: Workshop on Advances in Distributed Graph Algorithms
CoDyn: Workshop on Computing in Dynamic Networks
HDT: Workshop on Hardware Design and Theory

Celebration of Yoram Moses's 60th birthday

The talks in honor of Yoram will be held on the afternoon of October 17th
by Joe Halpern (Cornell University, USA), Moshe Tenenholtz (Technion,
Israel), Moshe Vardi (Rice University, USA), Shafi Goldwasser (MIT, USA),
and Sergio Rajsbaum (UNAM, Mexico).

VENUE AND REGISTRATION

DISC'17 will be held at Austria Trend Hotel Park Royal Palace, at
Schlossallee 8, 1140 Wien (Vienna), in close proximity to the Vienna
Technical Museum, and with views of Schönbrunn Palace.

We cordially invite you to register under

http://www.disc-conference.org/wp/disc2017/registration/

Please note also that the number of rooms guaranteed for DISC
participants drops by 50% after August 14, and by the remaining
50% after September 14.

Since Vienna is busy with many conventions in October, we hence
suggest that you book your room in time!

For information on the venue, hotels, and travelling, please see:

http://www.disc-conference.org/wp/disc2017/local-arrangements/

**********************************************************
*
* 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 positions around data analysis topics at University of Helsinki

Faculty of Science at University of Helsinki, Finland, invites applicants for four Computer Science / Data Science / Data Analysis themed Assistant/Associate Professor (tenure track) or Professor positions in the following areas:

- Software Systems in Data-Intensive Computing in Natural Sciences (full announcement: https://www.helsinki.fi/en/open-positions/assistant-professorassociate-professorprofessor-computer-science-software-systems-for-data-intensive-computing-in-natural-sciences)

- Parallel and Distributed Data Science (full announcement: https://www.helsinki.fi/en/open-positions/assistant-professorassociate-professorprofessor-computer-science-parallel-and-distributed-data-science)

- Spatiotemporal Data Analysis for Sustainability Science (full announcement: https://www.helsinki.fi/en/open-positions/assistant-professorassociate-professorprofessor-computer-science-spatiotemporal-data-analysis-for-sustainability-science)

- Computer Science and Atmospheric Sciences (full announcement: https://www.helsinki.fi/en/open-positions/assistant-professorassociate-professorprofessor-computer-science-and-atmospheric-sciences)

Deadline for applications for all these positions is on August 31st, 2017.

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

[DMANET] professorship “Algorithms and Complexity” at TU Hamburg

The School of Electrical Engineering, Computer Science and Mathematics
at TU Hamburg is currently advertising a full professorship of
"Algorithms and Complexity". Candidates are expected to have an
excellent research record and a strong interest in interdisciplinary
work across the engineering departments at TU Hamburg. We particularly
welcome applications from candidates working in the following areas:

- Complexity and Computability
- Approximation Algorithms
- Algorithms for Big Data
- Algorithm Engineering
- Parallel and Distributed Computing

For more information, please see the official opening (in German) at

https://www.academics.de/jobs/professur_w3_mit_leitungsfunktion_im_bereich_algorithmen_und_komplexitaet_145738.html

Fluency in German is not a formal prerequisite for appointment. However,
applicants should be willing to acquire sufficient knowledge of German
within a couple of years, in order to be able to fully contribute to
teaching and administrative tasks.

The application deadline is 31 August 2017.

---

Anusch Taraz
Institute of Mathematics
TU Hamburg
https://www.mat.tuhh.de/home/ataraz/
taraz@tuhh.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/
*
**********************************************************