Monday, April 30, 2018

[DMANET] 30th Cumberland Conference - Abstract Deadline Extended to Wednesday

================================================================================
30th Cumberland Conference on Combinatorics, Graph Theory and Computing (3nd Announcement)
Abstract Deadline Extension - This Wednesday
================================================================================

The 30th Cumberland Conference will take place at Marshall University in Huntington, West Virginia,
on Saturday May 19th and Sunday May 20th, 2018. Please see our website:

http://www.marshall.edu/math/cumberland2018

* Featured speakers:
Charles Colbourn, Arizona State University
Patricia Hersh, North Carolina State University
Greg Warrington, University of Vermont
Michael Young, Iowa State University

* Contributed 20-minute talks on all areas of combinatorics and graph theory and associated areas of
computer science are welcome.

* Deadlines: The deadline for abstracts is extended until this Wednesday, May 2, 2018. There is no registration fee but participants need to register, either online or at the conference, provided that we receive NSF support as expected. We encourage participants to register online by May 9, 2018.

* Organizing committee (Marshall University):
JiYoon Jung
Elizabeth Niese
Carl Mummert
Michael Schroeder

If you have any questions, please contact the organizers at cumberland2018@marshall.edu<mailto:cumberland2018@marshall.edu>.

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

[DMANET] Vienna Graph Clustering

Release of VieClus v1.00
------------------------------------

We are proud to announce the release of our memetic graph clustering
framework VieClus (Vienna Graph Clustering). It includes several
heuristics to compute a clustering of a graph. We provide it as easy to
use open source software. A key component of our contribution are
natural recombine operators that employ ensemble clusterings as well as
multi-level techniques. We combine these techniques with a scalable
communication protocol, producing a system that is able to compute
high-quality solutions in a short amount of time.

* open source implementation / website
http://vieclus.taa.univie.ac.at/

* GitHub
https://github.com/schulzchristian/VieClus/

**********************************************************
*
* 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] IPEC 2018: Second Call for Papers

==== IPEC 2018 Second Call for Papers ====

The 13th International Symposium on Parameterized and Exact Computation (
IPEC 2018) covers research in all aspects of parameterized and exact
algorithms and complexity.

Conference website: http://algo2018.hiit.fi/ipec/

--- Topics ---

Papers presenting original research in the area are sought, including but
not limited to:
- new techniques for the design and analysis of parameterized and exact
algorithms,
- fixed-parameter tractability and kernelization results;
- parameterized complexity theory;
- relationship between parameterized complexity and traditional complexity
classifications,
- applications of parameterized and exact computation; and
- implementation issues of exact, parameterized, and kernelization
algorithms.
In particular, theoretically grounded studies on parameterized and exact
computations and kernelization for real-world applications and algorithmic
engineering are especially encouraged.

--- Conference ---

IPEC 2018 will be part of ALGO 2018, which also hosts ESA 2018 and a number
of more specialized conferences and workshops. IPEC 2018 will take place
August 22-24, 2018, in Helsinki, Finland.

Accepted papers will be published in the symposium proceedings in the
Leibniz International Proceedings in Informatics (LIPIcs) series, based at
Schloss Dagstuhl. Authors of accepted papers are expected to present their
work at the symposium, and to incorporate the comments from the program
committee. A journal special issue is planned for selected papers presented
at IPEC 2018.

--- Important dates ---

Title and short abstract registration deadline: May 14, 2018, 23:59 AoE
Full paper submission deadline: May 17, 2018, 23:59 AoE
Notification: July 1, 2018
Conference: August 22-24, 2018

--- Awards ---

The program committee may award a Best Paper Award and a Best Student Paper
Award, both of which may be exceptionally split between two or more papers.
A student is someone who has not received a PhD degree before the full
paper submission deadline. A paper accepted to the conference is eligible
for the Best Student Paper Award if either all its authors are students, or
besides student co-author(s) there is one non-student co-author that
confirms, at the moment of submission, that a clear majority of conceptual
work on the paper was done by the student co-author(s). In the latter case,
it is moreover expected that a student gives a presentation at the
conference. Papers co-authored by members of the programme committee are
eligible neither for the Best Paper Award nor for the Best Student Paper
Award.

--- Special Events ---

An invited talk will be given by the 2018 EATCS-IPEC Nerode Prize winner.
In addition, Radu Curticapean will give an invited tutorial on counting
problems in parameterized complexity and there will be a session presenting
the results of the 3rd Parameterized Algorithms and Computational
Experiments Challenge (PACE 2018).

--- Submission guidelines ---

Authors are invited to submit an extended abstract of up to 12 pages
(excluding references) in LIPIcs style, in English, describing original
unpublished research. Results previously published in another conference
proceedings or journal (or scheduled for publication prior to IPEC) will
not be considered. Simultaneous submission of the results to another
conference with published proceedings is not allowed. However, the authors
are encouraged to make full versions of their submissions freely accessible
in an on-line repository such as ArXiv or ECCC.

The extended abstract should contain a summary of the main results, their
motivation and importance, and evidence of their correctness. All claims
made in the extended abstract must be fully justified in a clearly marked
appendix that will be read at the discretion of the program committee. The
authors may choose to either present in the appendix only the material
excluded from the extended abstract or to attach a full version of the
paper as the appendix. In either case, the authors should take a particular
notice that the extended abstract should present their work in a
comprehensible and self-contained way and the quality of the presentation
in the extended abstract will be taken into account by the programme
committee.

Authors must submit their papers electronically via easychair:

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

The use of the LIPIcs 2018 style file (see
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ )
is mandatory; no changes to font size, page margins, etc., are permitted.
Note that the style file has been very recently updated, so please make
sure that you are using the latest version. Program committee members
(except the co-chairs) are allowed to submit papers.

--- Program Committee ---

David Coudert : Université Côte d'Azur, Inria, CNRS, I3S
Serge Gaspers : UNSW Sydney and Data61, CSIRO
Fedor Fomin : University of Bergen
Petteri Kaski : Aalto University
Christian Knauer : Universität Bayreuth
Stephan Kreutzer : TU Berlin
Michael Lampis : Lamsade, Université Paris Dauphine
Sebastian Ordyniak : TU Wien
Sang-il Oum : KAIST
Christophe Paul (co-chair) : LIRMM, CNRS
Daniël Paulusma : Durham University
Geevarghese Philip : Chennai Mathematical Institute
Michał Pilipczuk (co-chair) : University of Warsaw
Hisao Tamaki : Meiji University
Till Tantau : Universität zu Lübeck
Meirav Zehavi : Ben-Gurion University

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

Sunday, April 29, 2018

[DMANET] ICTAC 2018 final call for papers

CALL FOR PAPERS

15th International Colloquium on Theoretical Aspects of Computing
ICTAC 2018
Stellenbosch, South Africa, 16-19 October 2018
https://www.ictac.org.za/


COLOCATED EVENTS

* ICTAC tutorials, 12-14 October 2018
* ICTAC workshop(s), 15 October 2018
* 14th African Conference on Research in Computer Science and Applied
Mathematics / 14eme Colloque Africain sur la Recherche en Informatique
et en Mathématiques Appliquées, CARI 2018, 14-16 October 2018

IMPORTANT DATES

* Abstracts 4 May 2018
* Papers 11 May 2018
* Notification 6 July 2018
* Camera-ready 3 August 2018


BACKGROUND

Established in 2004 by the International Institute for Software
Technology of the United Nations University (UNU-IIST), the ICTAC
conference series aims at bringing together researchers and
practitioners from academia, industry and government to present
research and exchange ideas and experience addressing challenges in
both theoretical aspects of computing and the exploitation of theory
through methods and tools for system development. ICTAC also aims to
promote research cooperation between developing and industrial
countries.


SCOPE

The topics of the conference include, but are not limited to:

* Languages and automata
* Semantics of programming languages
* Logic in computer science
* Lambda calculus, type theory and category theory
* Domain-specific languages
* Theories of concurrency and mobility
* Theories of distributed, grid and cloud computing
* Models of objects and components
* Coordination models
* Models of software architectures
* Timed, hybrid, embedded and cyber-physical systems
* Static analysis
* Software verification
* Software testing
* Program generation and transformation
* Model checking and automated theorem proving
* Interactive theorem proving
* Verified software, formalized programming theory


SUBMISSION OF CONTRIBUTIONS

We solicit full-length research papers reporting original research
contributions. Submissions must adhere to the LNCS format and must
not exceed 18 pages (excluding bibliography of maximum 2 pages).

Submissions must not have been published or be under consideration for
publication elsewhere. All submissions will be judged on the basis of
originality, contribution to the field, technical and presentation
quality, and relevance to the conference.

Submission is through Easychair:
https://easychair.org/conferences/?conf=ictac2018

One author of each accepted paper must attend the conference to present
it, having paid the regular registration fee.


PROCEEDINGS

The proceedings will be published by Springer in the Lecture Notes in
Computer Science series.


BEST PAPER AWARD

Springer is sponsoring a best paper award.


SPECIAL ISSUE

After the conference, authors of the best contributions are invited to
submit a revised and extended version to a special issue, to be
published in Elsevier's Theoretical Computer Science.


GENERAL CHAIR

Bernd Fischer (Stellenbosch University, ZA)


PROGRAMME CHAIRS

Bernd Fischer (Stellenbosch University, ZA)
Tarmo Uustalu (Reykjavik University, IS)


PROGRAM COMMITTEE

June Andronick (Data61, AU)
Éric Badouel (IRISA, FR)
Eduardo Bonelli (Universidad Nacional de Quilmes, AR)
Ana Cavalcanti (University of York, UK)
Uli Fahrenberg (LIX, FR)
Anna Lisa Ferrara (University of Southampton, UK)
Adrian Francalanza (University of Malta, MT)
Edward Hermann Haeusler (Pontificia Universidade Católica do Rio de
Janeiro, BR)
Ross Horne (Nanyang Technological University, SG)
Dang Van Hung (VNU University of Engineering and Technology, VN)
Atsushi Igarashi (Kyoto University, JP)
Jan Kretinsky (Technische Universität München, DE)
Martin Leucker (Universitaet zu Lübeck, DE)
Zhiming Liu (Southwest University, CN)
Radu Mardare (Aalborg Universitet, DK)
Tobias Nipkow (Technische Universität München, DE)
Maciej Piróg (Wroclaw University, PL)
Sanjiva Prasad (IIT Delhi, IN)
Camilo Rueda (Pontificia Universidad Javeriana Cali, CO)
Murali Krishna Ramanathan (Uber, US)
Augusto Sampaio (Universidade Federal de Pernambuco, BR)
Ina Schaefer (Technische Universität Braunschweig, DE)
Natarajan Shankar (SRI International, US)
Georg Struth (University of Sheffield, UK)
Cong Tian (Xidian University, CN)
Lynette van Zijl (Stellenbosch University, ZA)


ICTAC STEERING COMMITTEE

Ana Cavalcanti (University of York, UK)
Martin Leucker (Universität zu Lübeck, DE)
Zhiming Liu (Southwest University, CN)
Tobias Nipkow (Technische Universität München, DE)
Augusto Sampaio (Universidade Federal de Pernambuco, BR)
Natarajan Shankar (SRI International, US)


HOST INSTITUTION AND CITY

The conference will be hosted by the Division of Computer Science of
Stellenbosch University.

The city of Stellenbosch, founded 1685, is the second oldest European
settlement in South Africa after Cape Town. It is situated about 50 km
to the east of Cape Town. It is the place to admire Cape Dutch
architecture and the heart of the Cape Winelands, South Africa's prime
wine region. Stellenbosch University is one of the leading universities
in Africa.


FURTHER INFORMATION

Please contact Bernd Fischer, bfischer(at)cs.sun.ac.za.

--296529664-1706229796-1525054095=:26429--
**********************************************************
*
* 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] SPIRE 2018 3rd Call for Papers

THIRD CALL FOR PAPERS

SPIRE 2018
25th International Symposium on
String Processing and Information Retrieval
October 9-11, 2018, Lima, Peru

http://eventos.spc.org.pe/spire2018/

Paper submission: May 18, 2018 (anywhere on Earth)
Notification: July 9, 2018

**********************************************
LOCATION
**********************************************

SPIRE 2018 will take place in Lima, the capital of Peru.
The area around Lima had already been inhabited for centuries
when Spanish troops founded the city in 1535. In 1542 it was
made the seat of the Viceroyalty of Peru, which contained most
of Spanish-ruled South America, and in 1551 the oldest
continuously-functioning university in the Americas was founded
there. Lima is located on the Pacific coast and is famed for
its beaches and cuisine. October is early spring and the
temperatures are usually around 20 degrees Celsius or 68 degrees
Fahrenheit, both highs and lows. There are direct flights from
New York, Los Angeles, Toronto, Mexico City, Madrid, Paris,
Amsterdam and many major cities in South America, and visitors
from Asia and Oceania can arrive via Santiago de Chile, for example.
The conference venue will be the Universidad de Ingeniería y Tecnología
(UTEC), winner of the inaugural RIBA International Prize for
architecture and described by The Guardian as "Peru's modern-day
Machu Picchu", across the street from the Museum of Modern Art
and a 15-minute walk from the beach.

**********************************************
SCOPE
**********************************************

SPIRE 2018 covers research in all aspects of string processing,
information retrieval, computational biology, and related applications.
Typical topics of interest include (but are not limited to):

- String Processing: string pattern matching, text indexing, data
structures for string processing, text compression, compressed data
structures, compressed string processing, text mining, 2D pattern
matching, automata-based string processing.

- Information Retrieval (IR): retrieval models, indexing, evaluation,
algorithms and data structures for IR, efficient implementation of IR
systems, interface design, text classification and clustering, text
analysis and mining, collaborative and content-based filtering, topic
modeling for IR, search tasks (Web search, enterprise search, desktop
search, legal search, cross-lingual retrieval, federated search, (micro)
blog search, XML retrieval, multimedia retrieval), digital libraries.

- Computational Biology: high-throughput DNA sequencing (assembly, read
alignment, read error correction, metagenomics, transcriptomics,
proteomics), evolution and phylogenetics, gene and regulatory element
recognition, motif finding, protein structure prediction.

**********************************************
SUBMISSION
**********************************************

SPIRE 2018 invites submissions in two categories: long papers (up to 12
pages, excluding references and optional appendices) and short papers
(up to 6 pages, excluding references and optional appendices). The
reviewing process of SPIRE 2018 will be single-blind, meaning submissions
should not be anonymous. The submission server will be EasyChair
(https://easychair.org/conferences/?conf=spire18).
The proceedings will be published in the LNCS series of Springer-Verlag.
The use of either LaTeX or Word LNCS templates is mandatory.
Suitable templates are available at the Springer Website
(https://www.springer.com/gp/computer-science/lncs/conferenc
e-proceedings-guidelines
).
Do not change the margin size or the font, do not make a separate title
page, etc.: use the LNCS style file as given.
Simultaneous submission to other conferences with published proceedings
is not permitted.

**********************************************
BEST PAPER
**********************************************

A Best Paper Award, worth 1000 euros and sponsored by Springer, will
be given to the author(s) of the most outstanding work included in the
proceedings of SPIRE 2018 and presented at the event.

**********************************************
STUDENT TRAVEL GRANTS
**********************************************

Thanks to sponsorship by eBay and Google, we will be able to offer ten $500
US
student travel grants. Priority will be given to presenters, women and
minorities
in STEM. Applications for the grants will be due in early August.

**********************************************
SISAP AND WORKSHOPS
**********************************************

SPIRE 2018 will be co-located with SISAP 2018, the 11th
International Conference on Similarity Search and Applications
(http://www.sisap.org/2018), which will run October 7th-9th.

There will be a StringMasters workshop on Monday October 8th,
immediately before the conference.
The Workshop on Compression, Text and Algorithms (WCTA) will be held
on Friday October 12th, chaired by José Fuentes Sepúlveda,
Paweł Gawrychowski and Nicola Prezza and sponsored by the
BIRDS MSCA RISE 2015 project.
The venue for both workshops will be the same as for SPIRE.

**********************************************
IMPORTANT DATES
**********************************************

Paper deadline: May 18th, 2018 (anywhere on Earth)
Notification: July 9th, 2018
Camera-ready due: July 23rd, 2018
Early bird registration: July 23rd, 2018
Main conference: 9th-11th October, 2018
Workshops: 8th and 12th October, 2018

**********************************************
INVITED SPEAKERS
**********************************************

- Philip Bille, Technical University of Denmark
- Natasa Przulj, University College London
- Rossano Venturini, University of Pisa

The invited talks are sponsored by eBay, CeBiB (cebib.cl) and Google.

**********************************************
REGISTRATION
**********************************************

Registration will include a copy of the proceedings, a welcome cocktail,
coffee breaks, the conference excursion to Pachacamac and the conference
dinner.
Registration fees will be in line with previous years.

**********************************************
SPONSORSHIP
**********************************************

Many thanks to our sponsors:
eBay and Google will each contribute $5000 US for the invited talks and
travel grants;
CeBiB (cebib.cl) will contribute $2500 US for the invited talks;
Springer will contribute 1000 euros for the Best Paper Award;
BIRDS will sponsor WCTA.

**********************************************
COMMITTEES
**********************************************

Program Committee Chairs:
- Travis Gagie, Diego Portales University
- Alistair Moffat, University of Melbourne
- Gonzalo Navarro, University of Chile

Program Committee:
- Diego Arroyuelo, Universidad Técnica Federico Santa María
- Ricardo Baeza-Yates, NTENT and Universitat Pompeu Fabra
- Hideo Bannai, Kyushu University
- Ilaria Bordino, UniCredit R&D
- Christina Boucher, University of Florida
- Broňa Brejová, Comenius University
- Nieves Brisaboa, Universidade da Coruña
- Ruey-Cheng Chen, RMIT University
- Shane Culpepper, RMIT University
- Fabio Cunial, MPI-CBG
- Antonio Fariña, Universidade da Coruña
- David Fernández-Baca, Iowa State University
- Allyx Fontaine, Université de Guyane
- Simon Gog, Karlsruhe Institute of Technology
- Roberto Grossi, Universita' di Pisa
- Inge Li Gørtz, Technical University of Denmark
- Cecilia Hernandez, Universidad de Concepción
- Wing-Kai Hon, National Tsing Hua University
- Tomohiro I, Kyushu Institute of Technology
- Katharina Jahn, ETH Zürich
- Dominik Kempa, University of Helsinki
- Roberto Konow, eBay
- Gregory Kucherov, University Paris-Est Marne-la-Vallée
- Susana Ladra, Universidade da Coruña
- Gad M. Landau, University of Haifa and NYU
- Yiqun Liu, Tsinghua University
- Veli Mäkinen, University of Helsinki
- Matthias Petri, University of Melbourne
- Cinzia Pizzi, Universita' di Padova
- Giovanna Rosone, Universita' di Pisa
- Leena Salmela, University of Helsinki
- Diego Seco, Universidad de Concepción
- Julian Shun, Massachusetts Institute of Technology
- Jouni Sirén, University of California Santa Cruz
- Wing-Kin Sung, National University of Singapore
- Sharma Thankachan, University of Central Florida
- Andrew Trotman, University of Otago
- Przemysław Uznański, ETH Zürich
- Michal Ziv-Ukelson, Ben Gurion University of the Negev
- Guido Zuccon, Queensland University of Technology

Organizing Committee Chair:
Ernesto Cuadros-Vargas, Universidad de Ingeniería y Tecnología (UTEC)

Steering Committee:
- Ricardo Baeza-Yates, NTENT and Universitat Pompeu Fabra
- Gabriele Fici, Universita' di Palermo
- Costas Iliopoulos, King's College London
- Shunsuke Inenaga, Kyushu University
- Simon Puglisi, University of Helsinki
- Berthier Ribeiro-Neto, Google Inc. and Federal University of Minas Gerais
- Kunihiko Sadakane, University of Tokyo
- Tetsuya Sakai, Waseda University
- Marinella Sciortino, Universita' di Palermo
- Rossano Venturini, Universita' di Pisa
- Emine Yilmaz, University College London
- Nivio Ziviani, Universidade Federal Minas Gerais

**********************************************************
*
* 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] Principles of Distributed Computing Doctoral Dissertation Award - deadline for nominations 7 May 2018

We are soliciting nominations for the 2018 Principles of Distributed Computing Doctoral Dissertation Award.

Please nominate excellent dissertations in the area of Distributed Computing that were successfully defended
(or, in lieu of a defense, obtained final approval) in the period January 1st, 2016 through December 31st, 2017.

The award will be presented at DISC 2018, which will take place October 16-18 in New Orleans.

The deadline for nominations is: 7 May 2018 (extended).
More information about the award is available on the award web page https://www.podc.org/dissertation/

Submission site: https://easychair.org/conferences/?conf=podcdda18

Sincerely,

The 2018 Award Committee:
Lorenzo Alvisi
Idit Keidar, Chair
Andrea Richa
Alex Schwarzmann


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

[DMANET] Deadline Extension: ICCL 2018 - 9th International Conference on Computational Logistics

The submission deadline of full papers has been extended to May 14,
2018.

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

ICCL 2018 - 9th International Conference on Computational Logistics
CONFERENCE ANNOUNCEMENT
October 1-3, 2018 - Vietri sul Mare (Salerno) - Italy
www.iccl2018.it

THEME AND SCOPE
Computational Logistics comprises the planning and implementation of
large/complex logistics tasks using computations and advanced decision
support. It is applied in various areas, such as the flow and storage of
goods or services as well as related information from their source to
their destination. Typically, optimization models and algorithms are
developed, verified and applied for planning and executing complex
logistics tasks, e.g., for finding the most efficient scheduling/plan
for the transport of passengers or goods. The models and algorithms are
integrated with advanced computer technology to get satisfactory results
in appropriate time even for large scale problem instances and providing
interactivity, visualization etc., for a better understanding and
problem solution. Computational Logistics also involves the use of
information systems and modern communication and information technology
(IT) for the design, planning and control of logistics networks as well
as the complex tasks within them.

SUBMISSIONS
Authors are kindly invited to submit their contributions in the area of
logistics management, operations, control, and information systems,
relevant to all types of logistics activities and on any mode of
transportation, with a particular focus on practical cases providing
insight and real-world experience.
Submissions are invited in one of the two following forms:
(a) Full papers for publication in Springer's Lecture Notes in Computer
Science (LNCS)
(b) Abstracts for presentation only.

SESSIONS
The conference is organized into plenary and parallel sessions. The
conference language is English.
Each speaker can give only one talk.
Proposals for invited sessions are welcome. Researchers who are
interested to organize an invited session should contact Raffaele
Cerulli (raffaele@unisa.it).

CONFERENCE IMPORTANT DATES
Extended Submission Deadline of full papers: May 14, 2018
Submission of abstracts: June 15, 2018
Notifications of acceptance: June 30, 2018
Early Registration: July 20, 2018

CONFERENCE CHAIRS
Raffaele Cerulli, University of Salerno, Fisciano, Italy
Stefan Voß, University of Hamburg, Hamburg, Germany

ORGANIZING COMMITTEE
Francesco Carrabs (University of Salerno, Italy)
Raffaele Cerulli (University of Salerno, Italy)
Carmine Cerrone (University of Molise, Italy)
Ciriaco D'Ambrosio (University of Salerno, Italy)
Federica Laureana (University of Salerno, Italy)
Monica Gentili (University of Louisville, USA)
Rosa Pentangelo (University of Salerno, Italy)
Andrea Raiconi (University of Salerno, Italy)


KEYNOTE SPEAKERS AND FURTHER UPDATES WILL BE ADDED SOON TO THE OFFICIAL
WEBSITE: PLEASE STAY TUNED

CONTACTS: info@iccl2018.it

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

Saturday, April 28, 2018

[DMANET] SoCS 2018 - deadline extension

SoCS 2018 - deadline extension


11th Annual Symposium on Combinatorial Search
https://sites.google.com/view/socs18/

IMPORTANT DATES

* Abstract submission: April 29, 2018
* Paper submission: May 8, 2018 (extended by 1 week)

* Notification: June 1, 2018
* Symposium: July 14-15, 2018

SUBMISSIONS
Submissions have to be made via EasyChair.
All submissions must be formatted in AAAI Style.
Accepted papers will be included in the SoCS proceedings.

We welcome the following kinds of submissions:

* Original Papers (Long or Short)

Original papers are technical papers that report on substantial research or position papers discussing ideas and concepts related to search. Long papers may be up to 8 pages in length, plus an additional page for references only. Short papers may be up to 4 pages, plus an additional page for references only. Long and short original papers should be new work which has not been published in (nor is currently simultaneously under review at) any other archival publication venue,

* Previously Published Papers

In order to foster the exchange of ideas at SoCS, we encourage authors to submit extended abstracts of papers describing new research which has been published in other venues in the last year. These abstracts may be up to 2 pages, plus an additional page for references only. The abstract should reference the original paper.

TOPICS OF INTEREST
Topics of interest include but are not limited to the following:

* Analysis of search algorithms

* Automated synthesis of lower bounds

* Automatic algorithm selection and parameter tuning

* Bounding and pruning techniques

* Combinatorial puzzles

* Continuous problem solving

* External-memory and parallel search

* Incremental and active learning in search

* Meta-reasoning and search

* Methodology and critiques of current practice

* Model-based search

* Random versus systematic search strategy selection

* Portfolios of search algorithms

* Real-time search

* Search in goal-directed problem solving

* Search space discretization for continuous state-space problems

* Self-configuring and self-tuning algorithms

* Symmetry handling

* Time, memory, and solution quality trade-offs

* Search in big data

* Constraint search

* Search in robotics

* Search-based diagnosis

* Real-life applications


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

[DMANET] PhD positions at Technical University of Munich (Doctoral Program in Optimization and Networks)

PhD positions at Technical University of Munich (Doctoral Program in Optimization and Networks)

The doctoral program in Operations Research with focus on "Advanced Optimization in a Networked Economy" funded by the German Science Foundation (DFG) offers several positions for PhD students.

The challenges of a networked economy are fundamental and necessitate new theoretical and applied research. New computational techniques are needed to solve large-scale optimization problems and to handle large data sets; incentive structures have to be considered in situations with multiple decision makers; uncertainties and other dynamics in the parameters of resource allocation problems require new modeling tools and solution strategies. The research program focuses on important application-motivated projects that would benefit from new mathematical and analytical insights, including shared mobility, resource pooling, retail coordination, sales and operations planning, IT management, and airport operations.

Outstanding applicants with a background in mathematics, computer science, operations research, industrial engineering, or a related field will be offered a comprehensive study, training and research program. Specifically designed interdisciplinary projects will help to develop the ability to model, analyze, solve, and implement solutions for challenging real-world problems. A detailed description of the projects, participating researchers and further information regarding the application process is available at our website:

http://www.gs.tum.de/adone/

Application Process

Candidates are expected to hold a Master of Science degree (or, in exceptional cases, an excellent Bachelor degree) in one of the subject matters mentioned above and to have some experience with Operations Research methods. Excellent written and verbal communication skills in English are required.

We specifically encourage applications by qualified female researchers. Applicants with disabilities are treated with preference given comparable qualification.

For further information, please contact the RTG's coordinator

Dr. Yoshimi von Felbert (adone@tum.de<mailto:adone@tum.de>)

Please submit your complete application documents (as one pdf file) to adone@tum.de<mailto:adone@tum.de> by June 1st, 2018.


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

Friday, April 27, 2018

[DMANET] Position of full-time researcher in Computer Science

---
We apologize if you receive multiple copies of this text.
---

CINVESTAV-IPN
One position in Computer Science

http://www.cs.cinvestav.mx/sites/default/files/file/convocatoria2018_E.pdf


The Centro de Investigación y de Estudios Avanzados (Center for Research
and Advanced Studies, Cinvestav after its name in Spanish), which is the
top public research center in Mexico, has one position for full-time
researcher in Computer Science to be filled for the Computer Science
Department located at Mexico City.

Candidates are required to have a PhD in Computer Science (or a related
field) and an outstanding research record, or a very good potential to
develop an outstanding research career. Candidates from all areas of
computer science are welcome to apply.

Both junior and senior researchers are encouraged to apply for a position.
The type of appointment in turn could be as an Assistant or as an
Associate Professor. The salary is competitive and varies depending on the
curriculum of the candidate (note that research experience is emphasized
over teaching experience).

The candidate is expected to have a light teaching load (one
graduate-level class per term), so that he/she can concentrate mostly on
research activities. Candidates do not need to be fluent in Spanish, as
they can teach in English.

CINVESTAV-IPN is the most important public research center in Mexico, with
645 full-time researchers and the second highest scientific productivity
(per researcher) of the country (only after UNAM, which is the largest
university in Mexico). The Computer Science Department offers both a MSc
and a PhD program in Computer Science (CINVESTAV-IPN only offers graduate
programs). Both programs are included in the National Graduate Program
certification from CONACyT, which means that all our Mexican full-time
students receive a stipend scholarship from the Federal Government (no
tuition is required for Mexican students).The Computer Science Department
of CINVESTAV-IPN currently has 16 full-time researchers and about 70
graduate students.

Interested candidates must send (via email to: jobs2018@cs.cinvestav.mx)
the following information (as a single PDF file):

1) A detailed curriculum vitae that clearly indicates the publications in
international journals (highlighting the papers in journals included in
the Journal Citations Report), and a list of MSc and PhD graduates (if
any). The
candidate should also include a copy of the three papers that he/she
considers as the most representative of his/her research.
Note that papers published in the Lecture Notes series from Springer will
not be considered as JCR papers.

2) A research statement that briefly (no more than 1 page) describes the
sort of research that the candidate has done so far and his/her research
plan in case of being hired.

3) A teaching statement that briefly (no more than 1 page) describes the
sort of graduate-level courses (in computer science) that the candidate
can teach
(and has taught in the past, in case of having teaching experience).

4) The names and contact information (postal address, phone and fax
number, and email) of 3 references.

The screening of candidates will start at the end of June and the position
is expected to be filled by September of 2018.

For further information, please contact:

Dr. Francisco Rodriguez-Henriquez
Chair, Computer Science Department
CINVESTAV-IPN
Av. IPN No. 2508
Col. San Pedro Zacatenco.
07300 Mexico City
MEXICO
Tel: +52 (55) 5747 3800 x 6564
Fax: +52 (55) 5747 3757
URL: http://www.cs.cinvestav.mx
email: francisco@cs.cinvestav.mx

--001a114a5db250a062056add88a3
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir="ltr"><span style="font-size:12.800000190734863px">---</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">We apologize if you receive multiple copies of this text.</span><div><span style="font-size:12.800000190734863px">---</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">CINVESTAV-IPN</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">One position in Computer Science</span><div><br></div><div><a href="http://www.cs.cinvestav.mx/sites/default/files/file/convocatoria2018_E.pdf">http://www.cs.cinvestav.mx/sites/default/files/file/convocatoria2018_E.pdf</a><br></div><div><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">The Centro de Investigación y de Estudios Avanzados (Center for Research</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">and Advanced Studies, Cinvestav after its name in Spanish), which is the</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">top public research center in Mexico, has one position for full-time</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">researcher in Computer Science to be filled for the Computer Science</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Department located at Mexico City.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Candidates are required to have a PhD in Computer Science (or a related</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">field) and an outstanding research record, or a very good potential to</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">develop an outstanding research career. Candidates from all areas of</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">computer science are welcome to apply.</span><div><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Both junior and senior researchers are encouraged to apply for a position.</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">The type of appointment in turn could be as an Assistant or as an</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Associate Professor. The salary is competitive and varies depending on the</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">curriculum of the candidate (note that research experience is emphasized</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">over teaching experience).</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">The candidate is expected to have a light teaching load (one</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">graduate-level class per term), so that he/she can concentrate mostly on</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">research activities. Candidates do not need to be fluent in Spanish, as</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">they can teach in English.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">CINVESTAV-IPN is the most important public research center in Mexico, with</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">645 full-time researchers and the second highest scientific productivity</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">(per researcher) of the country (only after UNAM, which is the largest</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">university in Mexico). The Computer Science Department offers both a MSc</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">and a PhD program in Computer Science (CINVESTAV-IPN only offers graduate</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">programs). Both programs are included in the National Graduate Program</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">certification from CONACyT, which means that all our Mexican full-time</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">students receive a stipend scholarship from the Federal Government (no</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">tuition is required for Mexican students).</span><span style="font-size:12.800000190734863px">The Computer Science Department of CINVESTAV-IPN currently has 16 </span><span style="font-size:12.800000190734863px">full-time researchers and about 70 graduate students.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Interested candidates must send (via email to: </span><a href="mailto:jobs2018@cs.cinvestav.mx" style="font-size:12.800000190734863px">jobs2018@cs.cinvestav.mx</a><span style="font-size:12.800000190734863px">)</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">the following information (as a single PDF file):</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">1) A detailed curriculum vitae that clearly indicates the publications in</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">international journals (highlighting the papers in journals included in</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">the Journal </span><span style="font-size:12.800000190734863px">Citations Report), and a list of MSc and PhD graduates (if any). The</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">candidate should also include a copy of the three papers that he/she</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">considers as the most representative of his/her research.</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Note that papers published in the Lecture Notes series from Springer will</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">not be considered as JCR papers.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">2) A research statement that briefly (no more than 1 page) describes the</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">sort of research that the candidate has done so far and his/her research</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">plan in case of being hired.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">3) A teaching statement that briefly (no more than 1 page) describes the</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">sort of graduate-level courses (in computer science) that the candidate</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">can teach</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">(and has taught in the past, in case of having teaching experience).</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">4) The names and contact information (postal address, phone and fax</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">number, and email) of 3 references.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">The screening of candidates will start at the end of June and the position</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">is expected to be filled by September of 2018.</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">For further information, please contact:</span><br style="font-size:12.800000190734863px"><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Dr. Francisco Rodriguez-Henriquez</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Chair, Computer Science Department</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">CINVESTAV-IPN</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Av. IPN No. 2508</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Col. San Pedro Zacatenco.</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">07300 Mexico City</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">MEXICO</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Tel: +52 (55) 5747 3800 x 6564</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">Fax: +52 (55) 5747 3757</span><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">URL: </span><a href="http://www.cs.cinvestav.mx/" rel="noreferrer" target="_blank" style="font-size:12.800000190734863px">http://www.cs.cinvestav.mx</a><br style="font-size:12.800000190734863px"><span style="font-size:12.800000190734863px">email: </span><a href="mailto:francisco@cs.cinvestav.mx" style="font-size:12.800000190734863px">francisco@cs.cinvestav.mx</a><br></div></div></div></div>

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

[DMANET] PhD Position in Parameterized Algorithms (Deadline Extended)

The Algorithms and Complexity Group at the Vienna University of Technology
(TU Wien) is offering a fully funded PhD position within the research
project "New Frontiers for Parameterized Complexity". The project investigates
the complexity of problems not only in the traditional graph setting, but
also in areas such as Artificial Intelligence and Integer Linear
Programming. The candidate will be supervised by Robert Ganian (Project PI).

Applicants are expected to have excellent mathematical skills as well as an
interest in discrete algorithms.

The position should start in the second half of 2018 and is for up to three
years (the expected duration of the PhD program). The salary is according
to the FWF standard contracts for PhD candidates (approx. EUR 38,000.00
gross, p.a.), which allows for a convenient life in Vienna close to the
city center.

The application should include the candidate's CV, an abstract of the
diploma/masters
thesis, a short motivation letter, and two letters of recommendation (all
five items in a single pdf file; alternatively, letters of recommendation
may be sent directly by their authors). The application should also mention
possible starting dates and should be sent to rganian@gmail.com by 14 May
2018 (extended from 30 April).

Enquiries and questions about the position are welcome and may also be sent
to rganian@gmail.com.

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

[DMANET] WADT 2018 - Extension to abstract submission deadline!

======================================================================
FOURTH CALL FOR PAPERS - Extension to abstract submission deadline!

WADT 2018
24th International Workshop on Algebraic Development Techniques
http://wadt18.cs.rhul.ac.uk
July 2–5, 2018, Royal Holloway University of London, Egham, UK
======================================================================

AIMS AND SCOPE

The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends.

TOPICS OF INTEREST

Typical, but not exclusive topics of interest are:
– Foundations of algebraic specification
– Other approaches to formal specification, including process calculi and models of concurrent, distributed, and cyber-physical systems
– Specification languages, methods, and environments
– Semantics of conceptual modelling methods and techniques
– Model-driven development
– Graph transformations, term rewriting, and proof systems
– Integration of formal specification techniques
– Formal testing and quality assurance, validation, and verification
– Algebraic approaches to cognitive sciences, including computational creativity

WORKSHOP FORMAT AND LOCATION

The workshop will take place over four days, Monday to Thursday, at Royal Holloway University of London in Egham, UK (https://www.royalholloway.ac.uk).
Presentations will be selected on the basis of submitted abstracts.

This occurrence of the ADT workshop will be preceded by the Leverhulme School on Graph Transformation Techniques. The school will take place over three days, from Friday, June 29th, to Sunday, July 1st, and will comprise a self-contained series of invited lectures on graph transformation to be given by Reiko Heckel (University of Leicester, UK), Fernando Orejas (Technical University of Catalonia, Spain), and Detlef Plump (University of York, UK).

INVITED SPEAKERS

Artur d'Avila Garcez (City, University of London, UK)
Rolf Hennicker (LMU Munich, Germany)
Kai-Uwe Kühnberger (Osnabrück University, Germany)
Fernando Orejas (Technical University of Catalonia, Spain)

IMPORTANT DATES

Submission deadline for abstracts: May 11th, 2018
Notification of acceptance: May 25th, 2018
Early registration: June 1st, 2018
Final abstract due: June 8th, 2018
Leverhulme School on Graph Transformation Techniques: June 29–July 1, 2018
ADT Workshop: July 2–5, 2018

SUBMISSIONS

The scientific programme of the workshop will include presentations of recent results or ongoing research as well as invited talks. The presentations will be selected by the Steering Committee on the basis of submitted abstracts according to originality, significance and general interest. Abstracts must not exceed two pages including references; if a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract.

Abstracts have to be submitted electronically via the EasyChair system at https://easychair.org/conferences/?conf=wadt18.

PROCEEDINGS

After the workshop, authors will be invited to submit full papers for the refereed proceedings. All submissions will be reviewed by the Programme Committee. Selection will be based on originality, soundness, and significance of the presented ideas and results. The proceedings will be published as a volume of Lecture Notes in Computer Science (Springer).

The deadline for submissions will be September 3, 2018, with notifications by October 29. Camera-ready versions will be required by November 11.

SPONSORSHIP

The workshop takes place under the auspices of IFIP WG 1.3, while the series of graph-transformation lectures is supported by a Leverhulme Trust Visiting Professorship.

WADT STEERING COMMITTEE

Andrea Corradini (Italy)
José Fiadeiro (UK) [co-chair]
Rolf Hennicker (Germany)
Hans-Jörg Kreowski (Germany)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Markus Roggenbach (UK)
Grigore Roșu (United States)

PROGRAMME COMMITEE

Paolo Baldan (Italy)
Andrea Corradini (Italy)
Artur d'Avila Garcez (UK)
Răzvan Diaconescu (Romania)
José Fiadeiro (UK) [co-chair]
Fabio Gadducci (Italy)
Reiko Heckel (UK)
Rolf Hennicker (Germany)
Alexander Knapp (Germany)
Barbara König (Germany)
Antónia Lopes (Portugal)
Narciso Marti-Oliet (Spain)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Leila Ribeiro (Brazil)
Markus Roggenbach (UK)
Pierre-Yves Schobbens (Belgium)
Lutz Schröder (Germany)
Pawel Sobocinski (UK)
Ionuț Țuțu (UK) [co-chair]
Martin Wirsing (Germany)

ORGANIZING COMMITTEE

Claudia Chiriță (UK)
José Fiadeiro (UK)
Ionuț Țuțu (UK)

CONTACT INFORMATION

Email: wadt18@cs.rhul.ac.uk<mailto:wadt18@cs.rhul.ac.uk>
Homepage: http://wadt18.cs.rhul.ac.uk

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

Thursday, April 26, 2018

[DMANET] RSFF'18: Deadline Extension

The submission deadline is extended until Sunday, May 6th, 2018!


======================================================================
RSFF'18: Deadline Extension
======================================================================

International workshop on
ROBUST SOLUTIONS FOR FIRE FIGHTING

July 19-20, 2018, L'Aquila, Italy

http://geosafe.univaq.it

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

RSFF (Robust Solutions for Fire Fighting), is an international workshop
that intends to be a platform of exchange between researchers and
practitioners interested in emergency management, in particular bushfires.
The workshop welcomes participation of researchers from the area of
algorithms and practitioners both working on emergency management issues.

The main focus of the workshop is robustness, seen as an approach
to simplifying and securing solutions with the aim of making processes
less affected by disruptions.

The workshop is organized within the Work Package WP3 of the European
Project GEOSAFE (H2020-MSCA-RISE project n. 691161).

Registration is free for all GEOSAFE members and for authors of the
accepted papers.


TOPICS
===================

Solicited contributions cover a variety of topics including but not limited to:

Analysis of Algorithms
Approximation Algorithms
Combinatorial Optimization
Diffusion and Propagation Models
Disaster Management
Distributed and Parallel Algorithms
Emergency OR
Evacuation Models
Exact and Parameterized Algorithms
Heuristics and Metaheuristics
Integer Programming
Inverse Combinatorial Optimization
Mathematical Programming
Multiple Criteria Decision Making
Network Algorithms
Online Algorithms
Probabilistic Combinatorial Optimization
Randomized Algorithms
Robust Optimization
Simulation
Stochastic Optimization
Wildfire Management

SUBMISSION
===================

Submitting papers:

RSFF papers must be formatted according to the CEUR-WS one column style,
with a maximum length of 12 pages, including figures and references.
All proposed papers must be submitted in electronic form, in PDF format,
via the submission.geosafe@univaq.it mail.


Review process:

RSFF welcomes the submission of original research papers not published
elsewhere relevant to the topics listed in the call for papers. All
submitted papers will undergo a thorough review process.
Each contribution will be refereed by at least two experts in the field.


Publication:

Accepted papers will be included in the RSFF Proceedings published on
the CEUR-WS website. At least one of the authors will be required to
register and attend RSFF to present the paper in order to have it
included in the workshop proceedings.

IMPORTANT DATES
===================

Paper submission deadline : May 6th, 2018

Notification of acceptance : June 1st, 2018

Camera ready papers : June 15th, 2018

Registration : June 22nd, 2018


Workshop dates : July 19-20th, 2018

PROGRAM COMMITTEE
===================

Christian Artigues - LAAS-CNRS - FRANCE
Serafino Cicerone - University of L'Aquila - ITALY
Marc Demange - RMIT - AUSTRALIA
Gabriele Di Stefano - University of L'Aquila - ITALY (co-Chair)
Leszek Gasieniec - University of Liverpool, UNITED KINGDOM
Cecile Murat - Paris Dauphine University - FRANCE
Alfredo Navarra - University of Perugia - ITALY (co-Chair)
Petrica Pop Sitar - Technical University of Cluj-Napoca, ROMANIA
Pierpaolo Vittorini - University of L'Aquila - ITALY

CONTACTS
===================

Gabriele Di Stefano - University of L'Aquila - ITALY
Alfredo Navarra - University of Perugia - ITALY
Pierpaolo Vittorini - University of L'Aquila - ITALY

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

[DMANET] Workshop on Proof Complexity in Oxford

FLoC workshop on proof complexity - Call for Presentations
----------------------------------------------------------

Oxford, 7-8 July 2018
https://easychair.org/smart-program/FLoC2018/PC-index.html

The workshop will be part of FLoC and will be affiliated with the conferences SAT'18 and LICS'18.


=== Important Dates ===

1 May 2018 ......... Abstract submission
15 May 2018 ......... Notification to authors
7-8 July 2018 ....... Workshop in Oxford

=== Scope ===

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P? Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT/QBF solving.

=== Invited Speakers ===

Christoph Berkholz (Humboldt University Berlin)
Samuel R. Buss (University of California, San Diego)
Nicola Galesi (Sapienza University Rome)
Meena Mahajan (IMSc Chennai)

=== Submissions ===

We welcome 1-2-page abstracts presenting (finished, ongoing, or if clearly stated even recently published) work on proof complexity. Particular topics of interest are

* Proof Complexity
* Bounded Arithmetic
* Relations to SAT/QBF solving
* Relations to Computational Complexity

=== Submission Guidelines ===

Abstracts are invited of ongoing, finished, or (if clearly stated) even recently published work on a topic relevant to the workshop.

The abstracts will appear in electronic pre-proceedings that will be distributed at the meeting.

Abstracts (at most 2 pages, in LNCS style) are to be submitted electronically in PDF via EasyChair

http://www.easychair.org/conferences/?conf=pc2018

Accepted communications must be presented at the workshop by one of the authors.


=== Program Committee ===

Olaf Beyersdorff (University of Leeds) - chair
Ilario Bonacina (KTH Royal Institute of Technology)
Leroy Chew (University of Leeds)
Yuval Filmus (Technion – Israel Institute of Technology)
Jan Johannsen (Ludwig Maximilian University of Munich) - chair
Martina Seidl (Johannes Kepler University Linz)

=== Organizers ===

Olaf Beyersdorff (University of Leeds)
Leroy Chew (University of Leeds)
Jan Johannsen (LMU Munich)


**********************************************************
*
* 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 PhD position (Network Algorithms) @University of Vienna (Deadline: May 16)

We have an open Phd position in Network Algorithms at the University of
Vienna, in the Research Group Communication Technologies with Stefan Schmid
( http://ct.cs.univie.ac.at/ ).

Duration of employment: 4 years

The salary is competitive, in accordance with the collective bargaining
agreement: §48 VwGr. B1 Grundstufe (praedoc) with relevant work experience
determining the assignment to a particular salary grade, see
http://personalwesen.univie.ac.at/en/jobs-recruiting/job-center/salary-schem
e/
.

Applications including a letter of motivation (German or English) should be
submitted via the Job Center to the University of Vienna
(http://jobcenter.univie.ac.at) no later than 16.05.2018, mentioning
reference number 8551.

For more details please see:
https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung
-flow?_flowExecutionKey=_cCBA71C1C-08F1-FAE4-37B2-3EA02D5010E9_kCBA3511D-1DD
2-5A8C-1697-4C651E9695D9

<https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibun
g-flow?_flowExecutionKey=_cCBA71C1C-08F1-FAE4-37B2-3EA02D5010E9_kCBA3511D-1D
D2-5A8C-1697-4C651E9695D9&tid=67492.28
> &tid=67492.28


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

[DMANET] EATCS 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 recently 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, May
15, 2018 for the Jun issue of 2018. 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/
*
**********************************************************

Wednesday, April 25, 2018

[DMANET] 1 Stelle als Wissenschaftliche/r Mitarbeiter/in mit Chance zur Promotion

STELLENAUSSCHREIBUNG

Am Institut für Theoretische Informatik der Leibniz Universität Hannover ist eine Stelle als

Wissenschaftliche/r Mitarbeiter/in
(EntgGr. 13 TV-L, 100 %)

zu sofort zu besetzen. Die Stelle ist auf 3 Jahre befristet.

Aufgaben
Sie bearbeiten Aufgabenstellungen, die im Rahmen des DFG-Projektes „Nicht-klassische Logiken: Parametrisierte Komplexität und Enumeration" formuliert sind. Darunter befassen Sie sich mit Problemen aus der Logik, der Theorie der parametrisierten Komplexität sowie der Enumeration. Ihre Ergebnisse publizieren Sie in hochqualitativen peer-review Zeitschriften und präsentieren sie auf nationalen wie internationalen Konferenzen.

Einstellungsvoraussetzungen
Voraussetzung für die Einstellung ist ein abgeschlossenes wissenschaftliches Hochschulstudium (MSc oder äquivalent) im Bereich Informatik oder Mathematik. Erwartet werden exzellente Studienleistungen sowie gute Fachkenntnisse im Bereich der theoretischen Informatik. Darüber hinaus verfügen Sie über eine gute Bereitschaft zu Reisetätigkeit und sehr gute Kenntnisse der englischen Sprache in Wort und Schrift.

Im Rahmen Ihrer Tätigkeit am Institut für Theoretische Informatik besteht die Möglichkeit, eine Promotion zur/zum Dr. rer. nat. mit diesem anspruchsvollen Thema abzuschließen.

Auf Wunsch kann eine Teilzeitbeschäftigung ermöglicht werden.

Die Leibniz Universität Hannover will die berufliche Gleichberechtigung von Frauen und Männern besonders fördern und fordert deshalb qualifizierte Frauen nachdrücklich auf, sich zu bewerben. Schwerbehinderte Bewerberinnen und Bewerber werden bei gleicher Qualifikation bevorzugt.

Für Auskünfte steht Ihnen Herr Dr. rer. nat. Arne Meier (Tel. +49 511 762-19768,
E-Mail: meier@thi.uni-hannover.de) gerne zur Verfügung. Weitere Informationen über das Projekt und Institut finden Sie unter: https://www.thi.uni-hannover.de/213.html

Bitte richten Sie Ihre Bewerbung (Lebenslauf, mindestens zwei Referenzen, Zeugnissen sowie einem Motivationsschreiben) bis zum 06.05.2018 elektronisch als zusammenhängendes PDF-Dokument an obige E-Mail-Adresse.

Gottfried Wilhelm Leibniz Universität Hannover
Institut für Theoretische Informatik
Herrn Dr. Arne Meier
Appelstrasse 4
30173 Hannover

http://www.uni-hannover.de/jobs

**********************************************************
*
* 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] 8th PhD Summer School in Discrete Mathematics, 1-7 July 2018, Rogla, Slovenia

Dear Colleagues,

We would like to remind you that it is still possible to register for "8th
PhD Summer School in Discrete Mathematics" to be held on Mt. Rogla,
Slovenia, July 1 -- July 7, 2018.

Summer School consist of the following two courses (8 hours each):

1. Finite permutation groups
Colva Roney-Dougal, University of St Andrews, St Andrews, United Kingdom

2. Vertex-transitive graphs and their local actions
Gabriel Verret, The University of Auckland, Auckland, New Zealand

In addition, there will be a session of invited speakers.

Confirmed invited speakers are:

Wilfried Imrich (Montanuniversitat Leoben, Leoben, Austria)

Arnold Neumaier (University of Vienna, Vienna, Austria)

Sanja Rukavina (University of Rijeka, Rijeka, Croatia)

Primož Šparl (University of Ljubljana, Ljubljana, Slovenia)

Paul Terwilliger (University of Wisconsin–Madison, Madison, United States)


Students and other participants will have the opportunity to give short 15
minutes presentations.
Abstracts and further questions should be sent to sygn@upr.si by June 10,
2018.


The registration form together with other relevant information (overview of
the mini-courses, accommodation, traveling information, mode of payment,
instructions for students etc.) is available at

https://conferences.famnit.upr.si/e/rogla2018


Please feel free to forward this message to your colleagues and students.
For further questions please contact sygn@upr.si.

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

[DMANET] PhD studentship in random graphs, Goethe University Frankfurt

Supported by a joint DFG-FWF project on "Random graphs: cores, colourings and contagion", there is a

PhD studentship (3 years, E13 grade at 75%)

available at Goethe University Frankfurt in the group of Prof Amin Coja-Oghlan.

The project, which is in cooperation with Prof Mihyun Kang of TU Graz, deals with several topics
of current interest, including

- random graph colouring
- cores on random graphs
- contagion problems such as bootstrap percolation
- random systems of linear equations
- connections between combinatorics and statistical physics

The successful candidate will have a MSc degree in mathematics or a related discipline.
A strong background in probability as well as combinatorics is expected.

(Proficiency in German is not a requirement as the position does not come with
teaching obligations.)

If you are interested, please apply by email to

Michele Fellinghauer <fellingh@math.uni-frankfurt.de>

by May 23rd and include a CV, academic transcripts and a copy of your MSc thesis.


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

Tuesday, April 24, 2018

[DMANET] CFP: IEEE DS-RT 2018 (October 15-17, 2018 - Madrid, Spain)

------------------------------------------------------------
------------------------
Please accept our apologies if you have received multiple copies.
------------------------------------------------------------
------------------------
Call for Papers - DS-RT 2018

22nd IEEE/ACM* International Symposium on
Distributed Simulation and Real Time Applications
http://ds-rt.com/
October 15-17, 2018 - Madrid, Spain

*IEEE/ACM Pending Upon Approval
-----------------------------------------------------------------------
IMPORTANT: Submission deadline: May 20th, 2018

*** The Symposium ***

The 2018 IEEE/ACM International Symposium on Distributed Simulation and
Real Time Applications (DS-RT 2018) promises to be a grand affair and will
take place in Madrid, Spain.

DS-RT 2018 serves as a platform for simulationists from academia, industry
and research labs for presenting recent research results in Distributed
Simulation and Real Time Applications. DS-RT 2018 targets the growing
overlap between large distributed simulations and real-time applications,
such as collaborative virtual environments, pervasive and ubiquitous
application scenarios, motor-, controller-, sensor- and actuator systems.

The conference features prominent invited speakers as well as papers by top
researchers in the field. DS-RT 2018 will include contributed technical
papers, invited papers, and panel discussions. The proceedings will be
published by IEEE-CS press.


*** Call for Papers ***

DS-RT provides an international forum for the discussion and presentation
of original ideas, recent results and achievements by researchers, research
students, and systems developers on issues and challenges related to
distributed simulation and real-time applications.

Authors are encouraged to submit both theoretical and practical results of
significance. Demonstration of new tools/applications is enlivened.

The scope of the symposium includes, but is not limited to:


Paradigms, Methodology, Algorithms and Software Architectures for Large
Scale Distributed and Real-Time Simulations (e.g. Parallel and Distributed
Simulation, Multi-Agent Based Distributed Simulation, HLA/RTI, Web, Grid
and cloud-based Simulation, hardware-software co-design for extreme-scale
simulations)

Paradigms, Modelling, Architecture and Environments for Large Scale
Real-time Systems and Concurrent Systems with hard and soft Real-Time
Constraints

Non-functional Properties of Distributed Simulation and Real-Time Systems
(e.g. Dependability, Availability, Reliability, Maintainability, Safety,
Security, Trustworthiness, QoS)

Theoretical Foundations of Large-Scale Real-Time and Simulation Models
(e.g. Event Systems, Causality, Space-Time Models, Notions of Time,
Discrete and Continuous Systems, Simulator Coordination)

Advances in Modelling and Simulation Studies and Technologies (Reuse of
Models, New Modelling Languages, Agent-based M&S, Spatial M&S, Cognitive
Modelling, Neural Network Models, Artificial Intelligence in Simulation,
Discrete Events, Continuous Simulation, Service-oriented Computing and
Simulation, Web-based Modelling and Simulation, Simulation of Multimedia
Applications and Systems, etc.)

Pervasive and Ubiquitous Computing Architectures and Applications that
involve Simulations and/or adhere to Real-Time Constraints

Languages and Tools, Development Environments, Data Interfaces, Network
Protocols and Model Repositories that address Very Large Simulations

Data Management and Distribution Issues, Interest Management, Semantic
Modelling, Multi-resolution Modelling, Dead-Reckoning Mechanisms

Simulation Studies at Large and Very Large Scale (e.g. Industrial,
Commercial, Ecological and Environmental, Societal, Power and Energy)

Environmental and Emerging Simulation Challenges (e.g. Growth of Human
Population, Climate Change, CO2, Health Care, Ecosystems, Sustainable
Development, Water and Energy Supply, Human Mobility, Traffic Modelling,
World Stock Markets, Food Supply Chains, Megacities, Smart Cities, Smart
Networks, Disaster Planning, etc.)

Performance and Validation of Large-Scale and Distributed Simulations
(e.g., benchmarking and analytical results, empirical studies DIS, HLA/RTI
studies)

Visual Interactive Simulation Environments (e.g., Generic Animation, Visual
Interactive Modelling, Interactive Computer Based Training and Learning,
Scientific Visualization, High-End Computer Graphics)

Simulation-based Virtual Environments and Mixed Reality Systems (e.g.
Interactive Virtual Reality, Human Communication through Immersive
Environments)

Collaborative Virtual and Augmented Reality, Shared Interaction Spaces,
Telepresence Systems and Shared Workspaces, 3D Video and Acoustic
Reconstruction, Shared Object Manipulation

Design Issues, Interaction Designs, Human Computer Interaction Issues
raised by Large Scale DS-RT Systems

Serious Gaming and Massive Multiplayer Online Games (MMOG) applications,
architectures and scalability issues

Technologies for Living Labs (e.g. Mirror World Simulation,
Interoperability, Large Scale Multi-Sensor Networks, Global Wireless
Communication, Multi-Stakeholder Understanding and Innovation)

Innovative Styles of Interactions with Large Scale DS-RT Systems (e.g.
Implicit, Situative and Attentive Interaction, Tangible Interaction,
Embedded Interaction, etc.)

Media Convergence (e.g. New Technologies, Media Theory, Real-Time
considerations of Multi-Modality, etc.)


*** Important Dates ***

Paper Submission Deadline: May 20th, 2018
Notification of Acceptance: July 1st, 2018
Camera Ready version due: July 31st, 2018
Symposium presentation: October 15-17, 2018


*** Submission ***

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active in
the field to ensure high quality and relevance to the conference.


Accepted papers will appear in the conference proceedings to be published
by IEEE-CS press. Authors of selected papers will be invited to submit
extended versions of their papers to the Journal of Simulation.

General information regarding submission can be found at
http://ds-rt.com/2018/.


Questions from authors may be directed to the Program Co-Chairs.

IMPORTANT: CONFERENCE ATTENDANCE BY AT LEAST ONE AUTHOR OF ACCEPTED PAPERS
IS MANDATORY

*** ORGANIZING COMMITTEE***

General Chair
José Luis Risco Martín, Complutense University of Madrid, Spain

Program Co-Chairs
Eva Besada, Complutense University of Madrid, Spain
Floriano De Rango, University of Calabria, Italy

Posters Chair
Peppino Fazio, University of Calabria, Italy

Demo Chair
Amilcare F. Santamaria, University of Calabria, Italy

Special Sessions Chair
Robson De Grande, Brock University, Canada

Publicity Chair
Lucas Potter, Old Dominion University, VA, USA

Finance Chair
Guillermo Botella, Complutense University of Madrid, Spain

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

[DMANET] CFP Computational Optimization

Call for Papers

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

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

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

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

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

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

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

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

Best paper award

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

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

Submission and Publication

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

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

Important dates:

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

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

Organizing Committee

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

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

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************