Thursday, February 15, 2018

[DMANET] Two recent developments related to reform of journal publishing

Dear users - apologies for the slightly off-topic message, but it is highly relevant to many users and reaching them otherwise is tricky.

I want to draw your attention to two recent developments:

1) Free Journal Network http://freejournals.net  - member journals include several relevant to this list.

2) Online discussion and action forum and file repository for journal publishing reform https://gitlab.com/publishing-reform/discussion/issues
There is no commitment required, but in order to participate in a discussion you will have to register (5 minutes maximum). 

Regards,
Dr Mark C. Wilson || Department of Computer Science, University of Auckland || 303.588 || +6499236643

[DMANET] ISCO 2018, Registration

We are pleased to inform you that Registration for ISCO 2018 and the
Sprin School is now open.

******************************
ISCO 2018
REGISTRATION IS NOW OPEN

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

5th International Symposium on Combinatorial Optimization (ISCO 2018)
April 11-13, 2018 - Marrakesh - Morocco
[+Spring School on "Advanced MIP Formulations and Computations"
on April 9- 10, 2018]
http://isco2018.lip6.fr/

THEME AND SCOPE
ISCO is a biennial symposium whose aim is to bring together researchers from all the
communities related to combinatorial optimization, including algorithms and complexity,
mathematical programming and operations research. It is intended to be a forum for
presenting original research in these areas and especially in their intersections.
Quality papers on all aspects of combinatorial optimization, from mathematical
foundations and theory of algorithms to computational studies and
practical applications, are solicited.

SESSIONS
The conference is organized into plenary and parallel sessions. The conference languages
is English. Each speaker can give only one talk. Proposals for invited sessions
are welcome. Researchers who are interested in organizing an invited session should
contact Ridha Mahjoub (ridha.mahjoub@)lamsade.dauphine.fr).

SPRING SCHOOL
ISCO 2018 will be preceded by a spring school on "Advanced MIP Formulations and
Computations". Juan Pablo Vielma and Joey Huchette from MIT will give 16 hours of
lectures on April 9 and 10, 2018.

SUBMISSION - PUBLICATION
Papers presenting original unpublished results in all areas of combinatorial optimization
and its applications are welcome. The submission deadline is January 10, 2018.
Simultaneous submissions to other conferences with published proceedings or journals
are not allowed.
Two types of submissions:
Regular papers with up to 12 pages
Accepted regular papers will be published by Springer-Verlag in the Lecture Notes in
Computer Science (LNCS) series in a post-conference proceedings volume. The authors will
have to prepare their camera-ready version two weeks after the end of ISCO 2018.
Short papers up to 2 pages. Accepted short papers will be included in a volume
of local proceedings. More information about the submission procedure is available
on the website of the conference.

SPECIAL ISSUE:
A special issue of the journal Discrete Applied Mathematics will be dedicated to ISCO 2018.

IMPORTANT DATES
Submission: January 29, 2018
Notification: February 20, 2018
Early registration: March 6, 2018
Early registration school: March 6, 2018
Camera Ready: April 30, 2018

KEYNOTE SPEAKERS
Friedrich Eisenbrand (EPFL, Lausanne, Switzerland)
Marcia Fampa (Federal University of Rio de Janeiro, Bresil)
Bernard Gendron (University of Montreal, Canada)
Franz Rendl (University of Klagenfurt, Graz, Austria)

CONFERENCE CHAIRS
Abdellatif El Afia (ENSIAS, University Mohammed V, Marroco)
Jon Lee (University of Michigan, USA)
A. Ridha Mahjoub (University Paris-Dauphine, France)
Giovanni Rinaldi (IASI, Roma, 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] 4th STAR Workshop on Random Graphs, 12-13 April, Nijmegen (update)

Dear colleagues,

We hope to welcome you for the 4th STAR Workshop on Random Graphs*. It
takes place in Nijmegen on the 12th and 13th of April 2018.

Our programme features plenary talks by Leslie Ann Goldberg (Oxford), Frank
den Hollander (Leiden), Colin McDiarmid (Oxford), Patrice Ossona de Mendez
(CNRS), Bruce Reed (CNRS/IMPA).

All are welcome, but we ask that you register in reply to this email, with
specific registration details.

Opportunities to contribute short talks will be available to early-career
participants, who are asked to provide details with their registration
email.

**Update**: Thanks to support from Radboud University, a small amount
of funding
is earmarked for partial travel support of young participants (especially
contributed speakers) from abroad. Interested applicants should include an
estimate of their travel costs.

See *http://www.math.ru.nl/~rkang/SWRG2018/
<http://www.math.ru.nl/~rkang/SWRG2018/>* for more information.

Kind regards,

The organisers

(Ross Kang and Tobias Müller)

**********************************************************
*
* 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] EURO 2018: Call for the stream Lot Sizing, Lot Scheduling and Production Planning

Dear colleagues,

we are kindly inviting you to submit an abstract to the stream *Lot
Sizing, Lot Scheduling and Production Planning* (organized by the EURO
Working Group on Lot Sizing - EWG LOT)

at the

*29th European Conference on Operational Research*, Valencia, Spain,
July 8-11, 2018

http://www.euro2018valencia.com/

If you are interested in organizing a special session (consisting of at
least 4 presentations) within this stream, please contact one of the
stream organizers.

Within this stream we seek contributions to cover recent advances in
lot-sizing on the following topics among others:

* Applications of lot sizing in real world cases including
implementation of case-studies discussing organizational challenges
and data issues;
* Lot sizing for smart factories;
* Integration of lot-sizing with other problems, such as: scheduling,
distribution and vehicle routing, procurement, and cutting and packing;
* Extensions of lot sizing models, including (but are not limited
to):  non-triangular setups, period-overlapping setups,
* multiple resource types, blocking, synchronization, multi-level and
multi-machine systems, perishable goods, green lot sizing;
* Solution methods for lot-sizing problems: heuristics,
metaheuristics, exact methods, and hybrid approaches;
* Replanning and rescheduling, especially in the context of stochastic
production environments.
* Stochastic lot-sizing problems

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

In order to submit an abstract, please go to
https://www.euro-online.org/conf/euro29/

and use the session code: 6826e2ce

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

Abstracts: max. 1500 characters;

Submission deadline: March 5th, 2018.

Apologies for cross-postings.

Kind regards,

Nabil Absi(Ecole des Mines de Saint-Etienne) - absi@emse.fr
<mailto:absi@emse.fr>

Bernardo Almada-Lobo (University of Porto) - almada.lobo@fe.up.pt
<mailto:almada.lobo@fe.up.pt>,

Christian Almeder (European University Viadrina) - Almeder@europa-uni.de
<mailto:Almeder@europa-uni.de>,

(Stream organizers)

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

EURO 2018

29th European Conference on Operational Research

Valencia, Spain, July 8-11, 2018

http://www.euro2018valencia.com/ <http://www.euro2016.poznan.pl/>

*Abstract submission - https://www.euro-online.org/conf/euro29/*


SECOND ANNOUNCEMENT AND CALL FOR PAPERS
===========================================

We have the great pleasure of inviting you to take part in the 29th EURO
Conference to be held in Valencia, Spain, on 8-11 July, 2018.

The Scientific and Organization Committees, chaired by Greet Vanden
Berghe, Rubén Ruiz and Ramón Álvarez-Valdés, are preparing a high
quality scientific program and an exciting social program for the
Conference.

We have pleasure in announcing the Plenary Speakers.


*Cynthia Barnhart*  - Chancellor of the Massachusetts Institute of
Technology and IFORS Distinguished Lecturer

https://cee.mit.edu/people_individual/cynthia-barnhart/

*Roger Z. Ríos-Mercado*- Professor of Operations Research, Universidad
Autónoma de Nuevo León (UANL), México

http://yalma.fime.uanl.mx/~roger/work/index.html
<http://yalma.fime.uanl.mx/%7Eroger/work/index.html>

*Gerhard Woeginger*-  Professor at RWTH Aachen University Chair of the
and Algorithms and Complexity Group.

https://algo.rwth-aachen.de/~woeginger/
<https://algo.rwth-aachen.de/%7Ewoeginger/>


Many additional events and speakers will enrich the program, so please
visit the webpage for updates http://www.euro2018valencia.com/
<http://www.euro2016.poznan.pl/>

We are convinced that EURO 29 will be an excellent opportunity for the
OR community to get together again in a pleasant atmosphere, and, thus,
we are looking forward to meeting you in sunny Valencia, in 2018!

CALL FOR PAPERS AND SESSIONS:
=============================

Researchers, academics, practitioners, and students interested in any
branch of Operational Research, mathematical modelling or economic
analysis are invited to submit abstracts or organize sessions.

Invited and contributed papers will be organized in parallel sessions.
In general, sessions will be a part of the Conference streams, and
streams are grouped in 25 Main Areas. The list of main areas and streams
can be followed at _http://euro2018valencia.com/streams_and_areas/_

Each participant may present no more than one paper at the Conference.

Abstract submission system is available online, via the Conference web
page or directly at *https://www.euro-online.org/conf/euro29/*.

Abstracts: max. 1500 characters; submission deadline: March 5, 2018.

Researchers who wish to organize a stream or an invited session or
contribute with a paper within an invited session should contact a
Programme Committee member of the corresponding area.


MAKING AN IMPACT:
==================

"Making an Impact" includes a wide variety of sessions aimed at helping
practitioners to do a better job. It is organized by the EURO Working
Group on Practice of OR, the network for O.R. practitioners in industry,
consultancy, government and beyond. It will be packed with opportunities to:

*Explore the challenges every practitioner faces, and share solutions
*Try out new techniques – are they any good for you
*See case studies showcasing important applications
*Exchange ideas and expertise with people in similar fields
*Meet leading academics and discover what they can do for you – and what
you can do for them
*Build your network amongst like-minded professionals

For more information and to get involved please see the webpage
http://euro2018valencia.com/making-an-impact/

IMPORTANT DATES:
=================

Abstracts:

Abstract submission open: Friday, October 13, 2017

Abstract submission deadline: Monday, March 5, 2018

Registration:

Registration open: Friday, December 1, 2017

Early registration deadline: Friday, April 6, 2018

Author registration deadline: Friday, April 20, 2018

REGISTRATION FEES:
===================

Regular: 400 EUR (early); 500 EUR (late),

Student/Retired: 200 EUR (early); 300 EUR (late),

Accompanying persons: 125 EUR.

Early registration ends April 6, 2018.

Please note that the Conference Gala Dinner on Tuesday is not included
in the registration fee (75 euros).

Registration is available online via the Conference web page
http://euro2018valencia.com/registration/
<http://euro2018valencia.com/registration/>

FURTHER INFORMATION:
=====================

For detailed information about Valencia, please, visit the Conference
webpage http://euro2018valencia.com/aboutvalencia/
<http://euro2018valencia.com/aboutvalencia/>

We look forward to welcoming you to our very exciting conference in
Valencia!

Greet Vanden Berghe, Ramón Álvarez-Valdés, and Rubén Ruiz

For any further information please contact:

CONFERENCE SECRETARIAT:

Address: Plaza Virgen de la Paz, 3, 46001, Valencia, Spain

Phone: (+34) 963 262 600

Email: euro2018valencia@upv.es <mailto:euro2018valencia@upv.es>

>From Monday to Friday 9:00-15:00 CEST


**********************************************************
*
* 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] IRP in Discrete, Combinatorial and Computational Geometry: registration deadline approaching

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

                    Intensive Research Program in
          Discrete, Combinatorial and Computational Geometry
              April 16 – June 8, 2018 - Barcelona, Spain
                      http://dccg.upc.edu/irp2018

                     SECOND CALL FOR PARTICIPATION

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

- Early registration deadline approaching: February 28, 2018.

- Accommodation on campus is running out, book yours soon!

- The preliminary program is online.

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

The program will consist of 8 weeks of activities focused on hot topics
in discrete, combinatorial and computational geometry.
It has been designed to be interesting to researchers at all career
stages, by combining learning opportunities and research collaboration
chances in problems of theoretical nature in combinatorial and discrete
geometry, algorithmic problems from computational geometry, and
implementation issues in specialized software.

*Core of the program (5 weeks)*

April 16-20, 2018
Advanced Course I: Advanced Techniques for Algorithmic Geometry
Lecturers:
    Erin Wolf Chambers (Saint Louis University)
    Nabil Mustafa (ESIEE Paris)

April 23-27, 2018
Inspiring Lectures I: Computational Geometry Towards Applications
Lecturers:
    Sergio Cabello (University of Ljubljana)
    Erik Demaine (Massachusetts Institute of Technology)
    Tamal Dey (The Ohio State University)
    Dan Halperin (Tel Aviv University)
    Marc van Kreveld (Utrecht University)

April 30 - May 4, 2018
Hands-on course on Geometric Software
Lecturers:
    Andreas Fabri (CGAL, Geometry Factory)
    Nicolai Hähnle (OpenGL, AMD)
    Michael Joswig (Polymake, TU Berlin)
    Zoltan Kovács (GeoGebra, Johannes Kepler Universität)

May 7-11, 2018
Advanced Course II: New Results in Combinatorial & Discrete Geometry
Lecturers:
    Bojan Mohar (Simon Fraser University & University of Ljubljana)
    Gelasio Salazar (Univ. Autónoma San Luis Potosí)

May 14-18, 2018
Inspiring Lectures II: Challenges in Combinatorial & Discrete Geometry
Lecturers:
    Karim Adiprasito (Hebrew University of Jerusalem)
    Imre Bárány (Hungarian Academy of Sciences)
    Alexander Barvinok (University of Michigan)
    Vida Dujmovic (University of Ottawa)
    Fabrizio Frati (Università Roma Tre)
    Adam Sheffer (California Institute of Technology)
    Csaba D. Tóth (California State University Northridge)


Scientific Committee
    Oswin Aichholzer (TU Graz, Austria)
    Prosenjit Bose (Carleton U, Canada)
    Erik Demaine (MIT, USA)
    Clemens Huemer (UPC, Spain)
    Joe Mitchell (Stony Brook U, USA)
    János Pach (EPFL, Switzerland & Renyi Inst. Budapest, Hungary)
    Vera Sacristán (UPC, Spain)  (coordinator)
    Rodrigo I. Silveira (UPC, Spain)


This event is organized by
    Centre de Recerca Matemàtica (http://www.crm.cat)
    DCCG Research Group at UPC (http://dccg.upc.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] CFP work shop on computational optimizatin

Call for Papers

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

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

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

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

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

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

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

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

Best paper award

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

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

Submission and Publication

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

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

Important dates:

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

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

Organizing Committee

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

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

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

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

[DMANET] CFP workshop on Numerical search and Optimization

Dear Colleagues,

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

Topics

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

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multi-objective optimization
- optimization in dynamic and/or noisy environments
- large scale optimization
- Scalable search and optimization methods
- Scalable numerical tests
- parallel and distributed approaches in optimization
- random search algorithms
- adaptive search algorithms
- nature inspired optimization methods
- hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
- optimization methods for learning processes and data mining
-classical operational research problems (knapsack, traveling salesman, etc)
-computational biology and distance geometry
-data mining and knowledge discovery
-human motion simulations; crowd simulations
-industrial applications
- computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc


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

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

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

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

Paper submission, notification, and reviews will be realized through
the Springer OCS (Online Conference Service).
OCS for NM&A'18 is already set up on:

https://ocs.springer.com/ocs/home/NMA2018

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

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

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

Wednesday, February 14, 2018

[DMANET] Professorship (W3) in Computer Science at Cologne

The Computer Science Institute at the Faculty of Mathematics and Natural
Sciences of the University of Cologne invites applications for a

Professorship (W3) in Computer Science (Algorithmic Data Analysis),

to be filled as soon as possible.

Due to the new focus "Data Science", we are looking for a scientist (m/f) with
high international reputation for the algorithmic processing of large data sets.
Candidates shall represent areas of algorithmics in research and teaching that
are relevant to "Data Science" – for example randomized, approximation, or
parametrized algorithms. Moreover, we assume experience with the successful
acquisition of competitive third-party funding.

Along with an active cooperation with existing research areas in the Department
of Mathematics and Computer Science, we expect candidates to demonstrate a
strong interest in interdisciplinary applications and a clear willingness to
conduct joint research projects.

The successful candidate is expected to participate in the teaching and
administrative duties of the Computer Science Institute. This includes in
particular an active commitment to the degree programs in mathematics, business
mathematics, and business informatics.

Conditions of employment are in accordance with the North Rhine-Westphalia
University Law and include teaching experience and a PhD degree as well as an
excellent research track record, demonstrated by a Habilitation degree or
equivalent experience. German language proficiency is not initially required;
however, we expect the successful candidate to acquire German language
proficiency within two years after appointment.

The University of Cologne promotes equal opportunities and diversity. Women are
strongly encouraged to apply and will be considered preferential in accordance
with LGG NRW. Applications from disabled candidates are most welcome and are
given preference in case of equal qualification.

Please submit your application with the usual documents (letter of motivation,
academic CV, complete publication and course list, certificates of academic
achievements and appointments) via the Academic Job Portal of the University of
Cologne (https://berufungen.uni-koeln.de) by March 31st, 2018 to Professor Dr.
Guenter Schwarz, Dean of the Faculty of Mathematics and Natural Sciences,
University of Cologne, Albertus-Magnus-Platz, D-50923 Cologne, Germany, email:
mnf-berufungen@uni-koeln.de.

The deadline for applications is March 31st, 2018.


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

[DMANET] 6th SDP Day on Applications of Semidefinite Optimization

Call for participation

We are organizing the 6th SDP Day, a workshop day on Applications of Semidefinite Optimization, at CWI in Amsterdam on April 5, 2018.

The workshop will feature lectures by Daniel Dadush (CWI, Amsterdam), Hamza Fahzi (University of Cambridge), Fernando Oliveira (Technical University Delft),
William Slofstra (University of Waterloo), and Frank Vallentin (Universität zu Köln).
Details can be found at https://homepages.cwi.nl/~monique/SDP_Day_2018/index.html

Participation is free of charge but please register in advance (before Sunday 25 March, 2018)
by sending an email to Susanne van Dam (susanne@cwi.nl).

**********************************************************
*
* 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, Linköping University, Sweden

The research group for algorithms in air traffic management at Linköping University is expanding its research and searches for new staff members.

The group is part of the Division for Communication and Transport Systems, with over 70 staff members studying communication networks in the broadest sense. Many projects aim at developing models and methods for traffic systems, which can be used as decision support tools by infrastructure managers, operators, vehicle drivers and others.

Current air traffic management projects include, for example, scheduling of air traffic controller shifts for remote tower centers, design of the airspace around airports, optimization of airport location, drone traffic, and security of communication networks.

Our research is carried out together with stakeholders and funders from industry and society:
The Swedish Air Service Navigation Provider LFV, the National Transport Agency Trafikverket etc.

We are now looking for people who want to join our group, and work with one or more of the following topics:
Capacity modelling for air traffic controllers, aiming at quantification of workload.
Scheduling of air traffic controller shifts in remote towers, which need to incorporate various operational constraints and should not exceed safe workload levels.

We wish you have a strong background in mathematics, modelling, statistical analysis, optimization and/or programming. You have studied either applied mathematics, computer science, operations research, software engineering or similar. If you also have experience from air traffic management, it is beneficial but not necessary. You should in any case have a keen interest for analytical work, algorithmic development, be fluent in some computer language(s) and English.

We are searching for a person with a master's degree or equivalent for a PhD-position. We hope to fill the position by summer 2018.

For an overview of our projects, see https://tinyurl.com/ktslfv <https://tinyurl.com/ktslfv>
Postdoctoral Researcher Tatiana Polishchuk, tatiana.polishchuk@liu.se, + 46 11 36 3324
Assistant Professor Christiane Schmidt, christiane.schmidt@liu.se, +46 11 36 3212

**********************************************************
*
* 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] Assistant professor position in computer science and health data science [Mines?==?utf-8?q? St-Etienne]

Dear colleagues,
An assistant professeur position in computer science and health data science is available at Mines Saint-Étienne (France). Candidates must be nationals of a country of the European Union. The position is assigned to the Center for Health-Care Engineering (CIS) and LIMOS UMR CNRS 6158 laboratory. For further information, please contact: Stéphane AVRIL (avril@emse.fr, +33(0)477420188, head of the CIS lab) and Xiaolan XIE (xie@emse.fr, +33(0)477426695, head of the I4S department).
Research: the candidate will integrate the new research theme "Health Data" to strengthen skills of the team in medical data analysis: analysis and data mining, process mining, machine learning, and help with medical decision support.

Teaching: the candidate will teach courses for undergrad students ("Ingénieur Civil des Mines" in French), in the Master of Biomedical Engineering, the Master Research in Industrial Engineering in English. The candidate must be able to cover a fairly wide spectrum among the teachings of health data modeling, machine learning, medical decision support, bio-statistics.
Health Data in Mines Saint-Etienne

Mines Saint-Etienne is an engineering school of the Institut Mines Télécom under the supervision of the Ministry of Economy and Finance. The Center for Health-Care Engineering (CIS), one of the 5 training and research centers of the school, brings together professors in industrial engineering / computer science, biomechanics, and in process engineering around health applications: biotechnologies, tissue engineering, e-health, computer assisted surgery, medicine and personalized patient clinical pathway...
The I4S department of the CIS is a research team dedicated to the study of health-care systems and services. The faculty members of this department are members of the Laboratory of Computer Science, Modeling and Optimization of Systems (LIMOS, UMR CNRS 6158). I4S has been working for more than 10 years to provide innovative solutions in industrial engineering and operational research to improve care processes and health services. Thanks to the efforts of its members, I4S has strong partnerships with many hospitals (CLB, ARS-Ile de France, HCL, CHUSE, ...), companies (HEVA, LOMACO, EOVI, CETAF, ...) and has an international mirror team in Shanghai Jiao Tong University.
I4S starts a new research line focused on health data to answer an extraordinary dynamic of industrial demands. Many scientific fields are linked to this axis: (i) analysis and extraction of data / process mining, (ii) machine learning, (iii) medical decision support. I4S aims to combine the fields related to data, learning and support to medical decision in order to create an innovative research
to answer important research questions in health: prediction of care pathways, impact of new technologies on a clinical pathway, taking advantage of big data in health in medical decision support.
Best regards,

Garaix ThierryMines Saint-Étienne
Center for Biomedical and Healthcare Engineering
UMR CNRS 6158 LIMOS
158 cours Fauriel
42023 Saint-Etienne cedex 2, France
Phone : +33 4 77 42 66 41
Fax : +33 4 77 42 02 49

**********************************************************
*
* 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 Papers for AofA 2018

final Call for Papers:

29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms (AofA 2018)

Uppsala, Sweden,  June 25-29, 2018

The 29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms will be held in Uppsala, Sweden, June
25-29, 2018. The website of the event is

http://www.math.uu.se/math.uu.se/department-of-mathematics/AofA2018 .

Program Committee:

    Olivier Bodini, Paris 13, France
    Michael Drmota, TU Vienna, Austria
    James Allen Fill (chair), Johns Hopkins Univ., USA
    Antoine Genitrini, Paris 6, France
    Zbigniew Golebiewski, Wroclaw U. Sci. Tech., Poland
    Cecilia Holmgren, Uppsala U., Sweden
    Hsien-Kuei Hwang, Academic Sinica, Taiwan
    Svante Linusson, KTH, Sweden
    Manuel Lladser, U. Colorado, USA
    Cécille Mailler, Univ. Bath, UK
    Markus Nebel, Bielefeld Univ., Germany
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Daniel Panario, Carleton Univ., Canada
    Bruno Salvy, INRIA Lyon, France
    Robert Sedgewick, Princeton Univ., USA
    Wojciech Szpankowski, Purdue Univ., USA
    Stephan Wagner, Stellenbosch Univ., South Africa
    Mark Daniel Ward, Purdue Univ., USA

Steering Committee:

    Nicolas Broutin, INRIA Rocquencourt, France
    Hsien-Kuei Hwang, Academia Sinica, Taiwan
    Conrado Martinez, UPC Barcelona, Spain
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Robert Sedgewick (chair), Princeton Univ., USA
    Michèle Soria, Paris 6, France

Organization/Contact:

    Cecilia Holmgren, Uppsala University, Sweden
(cecilia.holmgren@math.uu.se)
    Sofie White, Uppsala, Sweden (sofie.c.white@gmail.com)
    James Allen Fill, Johns Hopkins University, USA (jimfill@jhu.edu)

Scope:

Analysis of algorithms is a scientific basis for computation, providing
a link between abstract algorithms and the performance characteristics
of their implementations in the real world. The general effort to
predict precisely the performance of algorithms has come to involve
research in analytic combinatorics, the analysis of random discrete
structures, asymptotic analysis, exact and limiting distributions, and
other fields of inquiry in computer science, probability theory, and
enumerative combinatorics.  See http://aofa.cs.purdue.edu/ .

We invite papers in

    * analytic algorithmics and combinatorics
    * probabilistic analysis of algorithms
    * randomized algorithms

We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.

Keynote speakers (confirmed):

    Louigi Addario-Berry, McGill University, Canada
    Béla Bollobás, Univ. of Cambridge, UK and Univ. of Memphis, USA
    Karen Gunderson, University of Manitoba, Canada
    Olle Häggström, Chalmers University of Technology, Sweden
    Svante Janson, Uppsala University, Sweden
    Mihyun Kang, Graz University of Technology, Austria
    Mark Daniel Ward, Purdue University, USA

Flajolet Award Lecture:

    Luc Devroye, McGill University, Canada

Submissions:

We invite you to submit an extended abstract (12 pages) or a short
abstract for a poster (2 pages) via the EasyChair system:

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

The proceedings will be published electronically.  Authors of selected
accepted extended abstracts will be invited to submit full papers for
peer review to a special AofA issue (published circa late 2019) of the
journal Algorithmica.

Important dates:

    Submission deadline: February 15, 2018
    Notification: April 8, 2018
    Final version: May 8, 2018

If you intend to submit a paper, please consider submitting a title and
a short abstract early.

**********************************************************
*
* 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, February 13, 2018

[DMANET] CP 2018 Call for Workshops

Call for workshops

The CP conference is the premier annual international conference on
constraint programming. It is concerned with all aspects of computing with
constraints, including but not limited to algorithms, environments,
languages, models, systems, theory, and applications such as decision
making, resource allocation, configuration, planning, and scheduling.

We invite proposals for workshops preceding the main conference program of
CP 2018, which will be held in Lille (France) from 27 to 31 August 2018.

The purpose of the CP workshops is to provide an informal venue in which
participants can:

- explore specific research areas in depth,
- discuss new research directions,
- study specific application areas of CP, or
- bring together researchers from different fields with shared interests.

In previous years, workshop topics included data analytics, smart cities,
packing & placement, cloud computing, configuration, teaching, testing &
verification, bioinformatics, constraint-based modelling, CP solvers,
cross-fertilisation with other solving technologies, etc. We encourage
proposals for workshops on new topics, especially multi-disciplinary ones.

We particularly encourage workshops that break away from the tradition of
reviewing ("publishing") and presenting submitted papers: instead, the
better attended workshops tended to foster much more interaction by having
several invited talks, if not introductory or specialist tutorials, and/or
presentations selected only on the basis of brief submitted abstracts. We
encourage any other innovations that are likely to increase the audience
and interaction.

All workshops will take place at the site of the main conference, and
follow either a half-day format or a full-day format.
Incubator Workshop

The Association for Constraint Programming (ACP) will provide a sponsorship
for an Incubator Workshop. An Incubator Workshop should address a promising
novel topic, be multi-disciplinary in nature, and have the aim to broaden
the application of CP or deepen its methodologies. The ACP will make 1,500
euros available for this purpose.
The call for Incubator Workshop will be issued by the ACP. Workshop
organizers who want to apply as an Incubator Workshop should check the ACP
specific call and follow its guidelines, and also submit their Workshop as
described below.Important Dates (for proposers of Workshop)

- April 8 Workshop proposal submission deadline,
- April 15 Workshop acceptance notification,
- May 13 Workshop webpage available on CP website,
- May 13 First call for papers (or abstracts, participation…),
- July 2017 (TBD) Early registration deadline (accepted speakers must
have received notifications),
- August 27 CP 2017 Workshops.

Proposal Format

Each workshop proposal should include the following information, in a
single PDF file or in plain text:

- Title
- Abstract outlining the goals and scope of the workshop
- Description of the target audience
- Motivation for running the workshop at CP 2018
- If the workshop also applies as Incubator workshop, motivation for this
- Estimate of the number/list of (invited) speakers, tutors, and
participants
- History of the workshop (if applicable), with the number of
applications and the number of attendees (if available)
- Tentative duration of the workshop: half day or full day
- Relevant chairing experience of the main organizers (if any)
- Organizing committee members (if already known)
- Contact information of the main organizers

The Workshop Chair will acknowledge receipt of the proposal.
Responsibilities of the Workshop Organizers

The workshop organizers are responsible for:

- Creating several calls for abstracts (or papers) and calls for
participation, and distributing them on specialist channels not used by the
Publicity Chair of CP 2018.
- The call for abstracts (or papers), if any, must clearly describe the
review & selection process and indicate that at least one author of every
accepted abstract (or paper) must attend the workshop and pay the workshop
fee; otherwise the presentation (and paper) will be withdrawn from the
proceedings, if any, and program.
- Creating and publishing, in a timely manner, a webpage at the CP 2018
website, including all the relevant calls and information pertaining to the
workshop.
- Providing a short description for the conference program.
- Reviewing and selecting abstract (or paper) submissions.
- Scheduling the presentations within the workshop.

It should be noted that the conference organization does not budget for
free registration, accommodation, or travel expenses for the workshop
organizers or their invited speakers. The workshop organizers should
therefore secure any source of funding or sponsorship deemed necessary for
their invited speakers (if any).
Responsibilities of the CP 2018 Organizing Committee

The responsibility of the conference organization is to:

- Provide publicity for the workshop program as a whole,
- Provide logistics at the conference venue (meeting room, catering,
etc.),
- Coordinate the allocation of time blocks for each workshop,
- Collect the workshop fees covering the rental and catering costs,
- Publicize the workshop calls with the help of the Publicity Chair.

Submission Process

Please send your proposal of Workshop by email to the CP 2018 Workshop
Chair (Sébastien Tabary - tabary@cril.fr <tabary@cril.fr>).

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

[DMANET] (Updated deadlines, Feb 22+26) Ph.D. and Postdoc positions in Berlin, "Facets of Complexity"

- Several Ph.D. positions, starting April 1, 2018, for three years, *deadline Feb 22*
- One PostDoc position, starting after April 1, 2018, for two years, *deadline Feb 26*
within the Research Training Group (Graduiertenkolleg) FACETS OF COMPLEXITY, whose
scientific program includes
- Complexity of algorithms,
- Complexity of combinatorial structures,
- Complexity of geometric structures,
- Complexity of graphs and networks.
see <http://www.mi.fu-berlin.de/facets/open-positions> for more information.

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

Monday, February 12, 2018

[DMANET] PACE 2018: Second call for participation [announcing prizes & travel awards]

We invite participants to PACE 2018, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the practical applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms.

PACE 2018 is generously sponsored by NETWORKS, an NWO Gravitation project of the University of Amsterdam, Eindhoven University of Technology, Leiden University, and the Center for Mathematics and Computer Science (CWI); see http://thenetworkcenter.nl/ . Through their support, we can hereby announce a total of 4000 euros of sponsoring that will be divided into prizes and travel awards for participants.

The challenge this year consists of three tracks on the Steiner Tree problem:

Given an undirected edge-weighted graph G and a subset T (terminals) of its vertices, find a subgraph of G spanning T with the smallest total edge-weight.

TRACK 1 (Exact with few terminals)

You have 30 minutes per instance.
Win by solving more instances than the other participants.
In all the instances, there are only a few terminals.

TRACK 2 (Exact with low treewidth)

You have 30 minutes per instance.
Win by solving more instances than the other participants.
In this track only, the instances come with a tree decomposition and the treewidth is low.

TRACK 3 (Heuristic)

Here the instances are significantly larger, have many terminals, and high treewidth, but you are not expected to find an optimum solution.
You still have 30 minutes per instance.
Win by finding Steiner trees of smaller weight than the other participants.
We will rank by average approximation ratio.

Detailed instructions about the three tracks, their rules, the instance sets, and the input and output formats: https://pacechallenge.wordpress.com/pace-2018/

You register for the challenge here: https://docs.google.com/forms/d/e/1FAIpQLScHH6lNpUYwLT6GDVMO9ik0s9iwhQTRbxnaJED1wdZOWBtJRg/viewform .
You can also download the public instances on the PACE challenge website and start your implementation.
As for the previous edition, we cooperate with the platform optil.io (https://www.optil.io/optilion/).
You can test your code on this platform now: https://pacechallenge.wordpress.com/2017/12/12/optil-io/ .

TIMELINE:

November 14th, 2017: Announcement of the challenge
December 12th, 2017: PACE 2018 test inputs on optil.io
February 2nd, 2018: Announcement of NETWORKS sponsoring and prizes
May 1st, 2018: Submission of final program
May 10th, 2018: Result are communicated to participants
August 20-24 2018: Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2018) in Helsinki

PROGRAM COMMITTEE:

Track 1, 2, 3:
- Édouard Bonnet (Middlesex University, London)
- Florian Sikora (Paris-Dauphine University)

STEERING COMMITTEE:

- Holger Dell (Saarland University and Cluster of Excellence, MMCI)
- Bart M. P. Jansen (chair) (Eindhoven University of Technology)
- Thore Husfeldt (ITU Copenhagen and Lund University)
- Petteri Kaski (Aalto University)
- Christian Komusiewicz (Friedrich-Schiller-University Jena)
- Frances A. Rosamond (University of Bergen)

Best of luck with your code!

The PACE Committees

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

[DMANET] Post doc position in Graph theory at University of Southern Denmark

The Department of Mathematics and Computer Science at the University of Southern Denmark (Odense Campus) invites applications for a postdoctoral research fellowship in the area of Graph Theory and Graph Algorithms. The proposed starting time is mid August 2018, or as soon as possible thereafter. The position is for a duration of one year and six months. Application deadline: 16 April 2018.

The postdoc is expected to perform high quality research under the supervision of Professors Jørgen Bang-Jensen and Anders Yeo, as part of the research project 'Packing, covering and partitions of digraphs' funded in the period 2018-2020 by the Danish council for independent research.

The project deals with structural and algorithmic aspects of problems related to packing, covering or partitions in digraphs and generalizations of digraphs, such as edge-coloured graphs. Examples are: packing cycles, linkage problems, packing strong subdigraphs, branchings, vertex partitions with prescribed properties in (di)graphs, packing sub(di)graphs in digraphs, edge-coloured graphs, completing partial orientations of graphs to obtain digraphs with prescribed properties.

You are expected to possess a PhD in graph theory or theoretical computer science with a strong background in graph theory, graph algorithms and/or the structure of directed graphs.

Candidates who are preparing their doctoral thesis are eligible to apply; however, they must have obtained their PhD degree before taking up their appointment at SDU. Due to rules from the research council, a candidate is only eligible for the position if the PhD has been obtained at most four years before the application deadline of this position, i.e. the degree must have been obtained after 16 April 2014.

The successful applicant is expected to participate in the teaching and supervision activities within the department.

For further information please contact Jørgen Bang-Jensen at jbj@imada.sdu.dk or Anders Yeo at yeo@imada.sdu.dk.


For the full announcement text and how to apply, see


https://www.sdu.dk/da/service/ledige_stillinger/962092


Med venlig hilsen, with best regards

Jørgen Bang-Jensen, professor in discrete optimization
Department of Mathematics and Computer Science
University of Southern Denmark
Campusvej 55, DK 5230
phone +45 65502335 mobile +45 60112335

**********************************************************
*
* 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 and postdoc openings at Charles University

Dear colleagues,

I am looking for PhD students and postdocs for my ERC Consolidator grant
called "Symmetry in Computational Complexity". Some information about the
grant and calls is at

http://www.karlin.mff.cuni.cz/~barto/cocosym.html

Best,

Libor Barto

**********************************************************
*
* 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] Position in statistical ML and high-dimensional stats at the Ecole Normale Supérieure de Lyon, France

Dear Colleagues,

A Professor position in statistical machine learning and high-dimensional statistics is open at the Ecole Normale Supérieure de Lyon, where the Computer Science and Mathematics department aim at developing this hot topic in Lyon.

The position is advertised there.

https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/ListesPostesPublies/ANTEE/2018_1/0694123G/FOPC_0694123G_4168.pdf

Applications start February 22nd and close March 29th

Please do not hesitate to ask for further information and to forward this message to potentially interested people.

With best regards,

Patrick Baillot, LIP
Alice Guionnet, UMPA
Grégory Miermont, département de mathématiques
Nicolas Trotignon, département d'informatique


**********************
[In French]

Chers collègues,

L'ENS de Lyon ouvre un poste de professeur entre les laboratoires d'informatique et de mathématique, avec un profil "apprentissage statistique, statistiques en grande dimension". Ces laboratoires souhaitent en effet impulser une dynamique en développant ce thème brûlant à Lyon.

Le poste est pré-publié sur Galaxie, et ouvrira à la candidature le 22 février (clôture le 29 mars). Voici la fiche de poste :

https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/ListesPostesPublies/ANTEE/2018_1/0694123G/FOPC_0694123G_4168.pdf

N'hésitez pas à nous demander des renseignements, et à faire suivre ce mail aux personnes potentiellement intéressées.

Bien cordialement,

Patrick Baillot, LIP
Alice Guionnet, UMPA
Grégory Miermont, département de mathématiques
Nicolas Trotignon, département d'informatique

*********

______________________
Nicolas Trotignon
CNRS, LIP, ENS de Lyon
Département d'informatique

______________________
http://perso.ens-lyon.fr/nicolas.trotignon/index.html


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

[DMANET] Modern OnLIne algorithms (MOLI2018) - call for submissions

Modern OnLIne algorithms (MOLI2018) - call for submissions


Modern OnLIne algorithms (MOLI) is a satellite workshop of ICALP2018.
The workshop will take place in Prague, The Czech Republic, on July 9, 2018.
http://math.haifa.ac.il/lea/MOLI.htm

The purpose of this workshop is to bring together researchers
interested in all aspects of online computation and online algorithms.

There will be no published proceedings, and everyone is welcome to
register and attend. In order to be scheduled to give a talk,
submission of an extended abstract is required.

If you are interested in giving a talk, please submit an extended
abstract of 2-4 pages (excluding references) in pdf format by the
deadline.

The submission page is:
https://easychair.org/conferences/?conf=moli2018


IMPORTANT DATES

Submission deadline: April 20, 2018.
Notification: May 11, 2018.
Workshop date: July 9, 2018.

PROGRAM COMMITTEE

József Békési, University of Szeged, Szeged, Hungary
Joan Boyar, University of Southern Denmark, Odense, Denmark
György Dósa, University of Pannonia, Vezsprém, Hungary
Leah Epstein, University of Haifa, Haifa, Israel (chair and organizer)
Elena Kleiman, ORT Braude College of Engineering, Karmiel, Israel
Asaf Levin, The Technion, Haifa, Israel
Danny Segev, University of Haifa, Haifa, Israel

[DMANET] SWAT 2018 - Call for papers

SWAT 2018
16th Scandinavian Symposium and Workshops on Algorithm Theory
Malmö University, Malmö, Sweden
June 18-20, 2018

website: http://csconferences.mah.se/swat2018/index.html

The Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) is
an biannual conference, held on even numbered years, whose goal it is to
provide a forum for scientists to meet, present their work, interact, and
establish collaborations, in order to promote research in the field of
Algorithm Theory. The conference alternates with WADS, the Algorithms and
Data Structures Symposium, held in Canada on odd numbered years.

We invite submissions of papers presenting original research on
algorithms and data structures. Though we welcome experiments, the
theoretical results in the articles will be the main measure for
evaluating their merits. The algorithmic problems considered may be
motivated by applications, e.g. in optimization, geometry and topology,
graph analysis, bioinformatics, visualization, string processing,
information retrieval, machine learning, algorithmic game theory, or
mechanism design.

Submission Deadline: Feb. 18, 2018
Notification Deadline: April 9, 2018

Invited Speakers:
Nancy M. Amato, Texas A&M University
Sorelle Friedler, Haverford College and Data and the Society Research Institute
Ankur Moitra, MIT

--
Joan Boyar Email: joan@imada.sdu.dk
Dept. of Math. and Comp. Sci. URL: http://www.imada.sdu.dk/~joan/
University of Southern Denmark
Campusvej 55 phone: +45 6550 2338
DK-5230 Odense M, Denmark
--8323329-939292290-1518418569=:14277--
**********************************************************
*
* 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, February 10, 2018

[DMANET] CFP: IPDPS ParSocial 2018 Workshop (update: keynote speaker and journal special issue)

[Apologies if you receive multiple postings]
###############################################################################
CALL FOR PAPERS
The 3rd IEEE Workshop on Parallel and Distributed Processing for
Computational Social Systems
May 25 2018, Vancouver, British Columbia, Canada.
Conference Website : http://www.lcid.cs.iit.edu/parsocial
(In conjunction with IEEE International Parallel & Distributed Processing
Symposium (IPDPS))

IMPORTANT DATES
Paper submission deadline : February 21, 2018
Notification of acceptance : March 5, 2018
Camera-ready papers : March 15, 2018
Workshop : May 25, 2018
################################################################################

ABOUT PARSOCIAL
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. We have also seen a
rapid proliferation of sensor technologies, such as smartphones and medical
sensors, for collecting a wide variety of social data, much of it in real
time. Meanwhile, the emergence of parallel architectures, in the form of
multi-core/many-core processors, and distributed platforms, such as
MapReduce, have provided new approaches for large-scale modeling and
simulation, and new tools for analysis. These two trends have dramatically
broadened the scope of computational social systems research, and are
enabling researchers to tackle new challenges. These challenges include
modeling of real world scenarios with dynamic and real-time data, and
formulating rigorous computational frameworks to embed social and
behavioral theories. The IEEE Workshop on Parallel and Distributed
Processing for Computational Social Systems (ParSocial) provides a platform
to bring together interdisciplinary researchers from areas, such as
computer science, social sciences, applied mathematics and computer
engineering, to showcase innovative research in computational social
systems that leverage the emerging trends in parallel and distributed
processing, computational modeling, and high performance computing.

The papers selected for ParSocial will be published in the workshop
proceedings. Proceedings of the workshops are distributed at the conference
and are submitted for inclusion in the IEEE Xplore Digital Library after
the conference.

*Special Issue Journal*
For ParSocial 2017, selected papers were invited to submit extended
versions to a special issue of the IEEE Transactions on Computational
Social Systems (https://goo.gl/s8xQXm). For Par Social 2018, there are also
plans to invite extended versions of selected papers to a special journal
issue.

*Keynote Speaker*
This year the keynote address will be provided by:

V.S. Subrahmanian
The Dartmouth College Distinguished Professor in Cybersecurity, Technology,
and Society
Dept. of Computer Science, Dartmouth College

CALL FOR PAPERS
Areas of research interests and domains of applications include, but are
NOT LIMITED to:

*Large-Scale Modeling and Simulation for Social Systems*
Social network based models
Models of social interactions (e.g. influence spread, group formation,
group stability, and social resilience)
Complex Adaptive System (CAS) models (e.g. modeling emergence in social
systems)
Models incorporating socio-cultural factors
Novel agent based social modeling and simulation
Modeling with uncertain, incomplete social data
Models using real-time social data
Representations of social and behavioral theories in computational models
Simulation methodologies for social processes including numerical and
statistical methods
Models for network dynamism
Modeling human and social elements in cyber systems (e.g. cyber-physical
systems, socio-technical systems, and network centric systems)
Social Computing Algorithms for Parallel and Distributed Platforms

*Analysis of massive social data*
Algorithms for dynamic social data
Algorithms for social network analysis
Analysis methods for incomplete, uncertain social data
Social analysis methods on parallel and distributed frameworks
Social computing for emerging architectures (e.g. cloud,
multi-core/many-core, GPU, and mobile computing architectures)

*Application*
Emergency management (e.g. infrastructure resilience, natural disaster
management)
National security (e.g. political stability, counter-terrorism, and
homeland security)
Health science (e.g. disease spread models, health informatics, and health
care analytics)
Social media analytics (e.g. business analytics, political analysis, and
economic analysis)

PAPER SUBMISSION
Submitted manuscripts may not exceed ten (10) single-spaced double-column
pages using 10-point size font on 8.5x11 inch pages (IEEE conference
style), including figures, tables, and references.
Please visit the workshop website(http://www.lcid.cs.iit.edu/parsocial) for
details on submission.


*Workshop Organization*

**Workshop Co-Chairs**
Eunice E. Santos, Ron Hochsprung Endowed Chair and Professor of
Computer Science, Illinois Institute of Technology, USA
John Korah, Research Assistant Professor, Illinois Institute of
Technology, USA

**Steering Committee**
George Cybenko, Dorothy and Walter Gramm Professor of Engineering,
Dartmouth College, USA
Eugene Santos Jr., Professor of Engineering, Dartmouth College, USA
V. S. Subrahmanian, Distinguished Professor in Cybersecurity, Dartmouth
College, USA
James A. Hendler, Tetherless World Professor of Computer Science,
Rensselaer Polytechnic Institute, USA

<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=icon>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=link>
<#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>

**********************************************************
*
* 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, February 9, 2018

[DMANET] Recent Advances in Algorithms School 2018: May 22-26, St. Petersburg

Recent Advances in Algorithms
International Computer Science Student School
May 22–26, 2018, St. Petersburg, Russia
https://compsciclub.ru/en/raa18


This year, the school is devoted to modern trends in obtaining conditional
hardness of algorithmic problems. In the school will learn about new
developments in complexity theory which allow to derive tight bounds on the
time required to solve computational problems.

The lectures will be taught by the leading researchers in these areas. Each
of the tutorials will provide an introduction to the area and gradually
bring to the current research frontiers. The primarily audience consists of
PhD students interested in Algorithms. Master students, postdocs, young
researchers and even faculty are also very welcome. The school continues
the Recent Advances in Algorithms 2017 school (video recordings of all the
lectures are available at the school webpage: http://raa17.tilda.ws/).


LECTURERS

Ammir Abboud (IBM Research)
Hardness for Polynomial Time Problems

Alexander Golovnev (Columbia University, Yahoo Research)
On Problems as Hard as Satisfiability

Ivan Mihajlin (UCSD)
Non-equivalence of Hardness Assumptions


VENUE

The school is hosted by St. Petersburg Department of V.A. Steklov Institute
of Mathematics of the Russian Academy of Sciences which is located in the
very center of St. Petersburg. St. Petersburg is particularly beautiful in
the late spring — early summer, the white nights season. The city is
surrounded by wonderful tsar parks and palaces; an excursion to one of them
will be a social program of the school.


REGISTRATION

The registration fee is 10000 RUR (approximately 140EUR or 176USD). The fee
includes lectures, coffee breaks, excursion, and school dinner (but does
not include lunches and accommodation). We will process the registrations
on the first-come first-served basis and will close the registration form
when the conference room is fully booked (around 80 participants).
Registration form: http://r.onlinereg.ru/?t_conf=420


ORGANIZERS AND SPONSORS

The school is organized by Fedor Fomin, Alexander S. Kulikov, Alexander
Smal, and Monomax Company with the support by Computer Science Club,
Ministry of Education and Science of the Russian Federation, and Yandex.

**********************************************************
*
* 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, February 8, 2018

[DMANET] (Deadline extension) CTW18 on Graphs and Combinatorial Optimization (18-20 June, Paris)

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

June 18-20, 2018, Paris (France)

Call for papers
---------------
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization
2018 welcomes contributions on theory and applications of discrete
algorithms, graphs and combinatorial optimization in the wide
sense. CTW18 will be organized by CNRS LIX, École Polytechnique, and will
take place at the Conservatoire National d'Arts et Métiers (CNAM), in
the center of Paris.

Contacts
--------
URL: http://ctw18.lipn.univ-paris13.fr/
EMAIL: ctw18paris@gmail.com

Invited speakers
----------------
Thomas Seiller, Univ. de Paris-Nord
Angelika Wiegele, Alpen-Adria-Univ. Klagenfurt

Registration fee
----------------
EUR 250 if the payment is received by May 10, 2018, and EUR 300
afterwards. For PhD/MSC students and/or postdocs, EUR 100 if received
by May 10, 2018, and EUR 125 afterwards (PhD studentship / postdoc status
proof is required). The registration fee includes entry to all technical
sessions, coffee-breaks and the social event.


Important dates
---------------
(Extended) submission deadline: 20th Feb 2018
(Provisional) answer to authors: 18th Apr 2018
Reduced price registration deadline: 10th May 2018
Conference: 18-20 June 2018

Abstract Submission
-------------------
Submit extended abstracts of at most 4 pages using the Easychair link
<https://easychair.org/conferences/?conf=ctw18>, using the templates
available on the website. The scientific committee will select the
presentations for the workshop on the basis of the extended abstracts
received and on the available number of slots. Please check the payment
instructions carefully (on the website).

Proceedings volume
------------------
A special issue of the journal Discrete Applied Mathematics is planned
as a post-conference proceedings outlet.

Scientific committee
--------------------
Ali Fuat Alkaya, Marmara Univ.
Alberto Ceselli, Univ. Milan
Roberto Cordone, Univ. Milan
Ekrem Duman, Ozyegin Univ.
Ulrich Faigle, Univ. Koeln
Johann Hurink, Univ. Twente
Leo Liberti, CNRS & Ecole Polytechnique
Bodo Manthey, Univ. Twente
Gaia Nicosia, Univ. Roma Tre
Andrea Pacifici, Univ. Roma Tor Vergata
Stefan Pickl, Univ. des Bundeswehr Muenchen
Bert Randerath, Technische Hochschule Koeln
Giovanni Righini, Univ. Milan
Heiko Roeglin, Univ. Bonn
Britta Peis, RWTH Aachen
Oliver Schaudt, Univ. Koeln
Rainer Schrader, Univ. Koeln
Rudiger Schultz, Univ. Duisburg-Essen
Frank Vallentin, Univ. Koeln

Local organization
------------------
Fabio Furini, Univ. Paris-Dauphine
Amelie Lambert, CNAM Paris
Lucas Letocart, Univ. Paris-Nord
Leo Liberti, CNRS & Ecole Polytechnique (chair)
Ivana Ljubic, ESSEC Paris
Evelyne Rayssac, Ecole Polytechnique
Emiliano Traversi, Univ. Paris-Nord
Roberto Wolfler Calvo, Univ. Paris-Nord

EMAIL: <ctw18paris@gmail.com>
URL: <http://ctw18.lipn.univ-paris13.fr>

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

[DMANET] CFP: ESORICS 2018, 23rd European Symposium on Research in Computer Security

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

*** Apologies for multiple copies ***

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

ESORICS 2018 : Twenty-third European Symposium on Research in Computer
Security

Barcelona, Spain -- September 3-7, 2018

WWW: https://esorics2018.upc.edu

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

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. Papers offering novel research
contributions in computer security are solicited for submission to the
Symposium. The primary focus is on original, high quality, unpublished
research and implementation experiences. We encourage submissions of
papers discussing industrial research and development.


Important Dates
---------------------
* Paper submission deadline: April 18, 2018
* Notification to authors: June 15, 2018
* Camera ready due: June 25, 2018


Topics of Interest
-----------------------
Topics of interest include, but are not limited to:

* access control
* accountability
* ad hoc networks
* anonymity
* applied cryptography
* authentication
* biometrics
* blockchain and finance security
* data and computation integrity
* database security
* data protection
* deep learning for attack and defense
* digital content protection
* digital forensics
* distributed systems security
* embedded systems security
* inference control
* information hiding
* identity management
* information flow control
* information security governance and management
* intrusion detection
* formal security methods
* language-based security
* network security
* phishing and spam prevention
* privacy
* privacy preserving data mining
* risk analysis and management
* secure electronic voting
* security architectures
* security economics
* security metrics
* security models
* security and privacy for big data
* security and privacy in cloud scenarios
* security and privacy in complex systems
* security and privacy in content centric networking
* security and privacy in crowdsourcing
* security and privacy in the IoT
* security and privacy in location services
* security and privacy for mobile code
* security and privacy in pervasive / ubiquitous computing
* security and privacy policies
* security and privacy in social networks
* security and privacy in web services
* security and privacy in cyber-physical systems
* security, privacy and resilience in critical infrastructures
* security verification
* software security
* systems security
* trust models and management
* trustworthy user devices
* usable security and privacy
* web security
* wireless security


Paper Submission Guidelines
---------------------------------------
Submissions must be made through EasyChair at:
https://easychair.org/conferences/?conf=esorics2018

Submitted papers must not substantially overlap with papers that have
been published or that are simultaneously submitted to a journal or a
conference/workshop with proceedings. The symposium proceedings will be
published by Springer in the Lecture Notes in Computer Science series
(LNCS).

All submissions should follow the LNCS template from the time they are
submitted. Submitted papers should be at most 16 pages (using 10-point
font), excluding the bibliography and well-marked appendices, and at
most 20 pages total. Committee members are not required to read the
appendices, so the paper should be intelligible without them. All
submissions must be written in English. Submissions are to be made to
the submission web site. Only pdf files will be accepted.

Submissions not meeting these guidelines risk rejection without
consideration of their merits. Authors of accepted papers must guarantee
that their papers will be presented at the conference.

Papers must be received by the aforementioned dates, 11:59 p.m. American
Samoa time (UTC-11).


Organisation Committee
--------------------------------

General Chair:

* Miguel Soriano, UPC, Spain

Organization Chair:

* Josep Pegueroles, UPC, Spain

Workshop Chair:

* Joaquin Garcia-Alfaro, Telecom-Sud Paris, France

Program Committee Chairs:

* Javier Lopez, University of Malaga, Spain
* Jianying Zhou, SUTD, Singapore


Program Committee:

Gail-Joon Ahn, Arizona State University, USA
Cristina Alcaraz, University of Malaga, Spain
Elli Androulaki, IBM, Switzerland
Vijay Atluri, Rutgers University, USA
Michael Backes, Saarland University, Germany
Carlo Blundo, Universita' degli Studi di Salerno, Italy
Levente Buttyan, BME, Hungary
Jan Camenish, IBM, Switzerland
Alvaro Cardenas, University of Texas at Dallas, USA
Aldar Chan, University of Hong Kong, HK
Liqun Chen, University of Surrey, UK
Sherman S. M. Chow, Chinese University of Hong Kong, HK
Mauro Conti, University of Padua, Italy
Jorge Cuellar, Siemens A.G., Germany
Frederic Cuppens, TELECOM Bretagne, France
Nora Cuppens-Boulahia, TELECOM Bretagne, France
Marc Dacier, EURECOM, France
Sabrina De Capitani di Vimercati, Universita' degli studi di Milano, Italy
Herve Debar, Telecom SudParis, France
Roberto Di Pietro, Hamad Bin Khalifa University (HBKU), Qatar
Josep Domingo-Ferrer, University Rovira-Virgili, Spain
Haixin Duan, Tsinghua University, China
Jose Fernandez, Polytechnique Montreal, Canada
Josep Lluis Ferrer, UIB, Spain
Simone Fischer-Hübner, Karlstad University, Sweden
Simon Foley, IMT Atlantique, France
Sara Foresti, Universita' degli studi di Milano, Italy
David Galindo, University of Birmingham, UK
Debin Gao, SMU, Singapore
Dieter Gollmann, Hamburg University of Technology, Germany
Dimitris Gritzalis, Athens University of Economics and Business, Greece
Stefanos Gritzalis, University of the Aegean, Greece
Guofei Gu, Texas A&M University, USA
Juan Hernandez, UPC, Spain
Amir Herzberg, Bar-Ilan University & University of Connecticut, Israel
Alejandro Hevia, University of Chile, Chile
Xinyi Huang, Fujian Normal University, China
Sushil Jajodia, George Mason University, USA
Vasilios Katos, Bournemouth University, UK
Sokratis Katsikas, NTNU, Norway
Kwangjo Kim, KAIST, Korea
Steve Kremer, INRIA Nancy-Grand Est, France
Marina Krotofil, FireEye, USA
Costas Lambrinoudakis, University of Piraeus, Greece
Loukas Lazos, University of Arizona, USA
Ninghui Li, Purdue University, USA
Yingjiu Li, SMU, Singapore
Hoon Wei Lim, SingTel, Singapore
Joseph Liu, Monash University, Australia
Peng Liu, Pennsylvania State University, USA
Xiapu Luo, Hong Kong Polytechnic University, HK
Mark Manulis, University of Surrey, UK
Kostas Markantonakis, RHUL, UK
Olivier Markowitch, Université Libre de Bruxelles, Belgium
Fabio Martinelli, IIT-CNR, Italy
Gregorio Martinez, University of Murcia, Spain
Ivan Martinovic, University of Oxford, UK
Sjouke Mauw, University of Luxembourg, Luxembourg
Catherine Meadows, Naval Research Laboratory, USA
Weizhi Meng, DTU, Denmark
Chris Mitchell, RHUL, UK
Refik Molva, EURECOM, France
Haris Mouratidis, University of Brighton, UK
David Naccache, Ecole Normale Suprieure, France
Martin Ochoa, SUTD, Singapore
Eiji Okamoto, University of Tsukuba, Japan
Rolf Oppliger, eSECURITY Technologies, Switzerland
Gunther Pernul, Universität Regensburg, Germany
Christina Popper, NYU Abu Dhabi, UAE
Joachim Posegga, University of Passau, Germany
Jean-Jacques Quisquater, UCL, Belgium
Indrajiti Ray, Colorado State University, USA
Giovanni Russello, University of Auckland, New Zealand
Mark Ryan, University of Birmingham, UK
Peter Y.A. Ryan, University of Luxembourg, Luxembourg
Rei Safavi-Naini, University of Calgary, Canada
Pierangela Samarati, Universita' degli studi di Milano, Italy
Damien Sauveron, XLIM, France
Steve Schneider, University of Surrey, UK
Ozgur Sinanoglu, NYU Abu Dhabi, UAE
Einar Snekkenes, Gjovik University College, Norway
Willy Susilo, University of Wollongong, Australia
Pawel Szalachowski, SUTD, Singapore
Qiang Tang, LIST, Luxembourg
Juan Tapiador, Universidad Carlos III de Madrid, Spain
Nils Ole Tippenhauer, SUTD, Singapore
Aggeliki Tsohou, Ionian University, Greece
Jaideep Vaidya, Rutgers University, USA
Serge Vaudenay, EPFL, Switzerland
Luca Vigano', King's College London, UK
Michael Waidner, Fraunhofer SIT, Germany
Cong Wang, City University of Hong Kong, HK
Lingyu Wang, Concordia University, Canada
Edgar Weippl, SBA Research, Austria
Christos Xenakis, University of Piraeus, Greece
Kehuan Zhang, Chinese University of Hong Kong, HK
Sencun Zhu, Pennsylvania State University, USA


Publicity Chairs:

* Giovanni Livraga - Universita' degli studi di Milano, Italy
* Rodrigo Roman - University of Malaga, 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] 1st International Workshop on Advances in High-Performance Algorithms Middleware and Applications

My apologies for multiple copies.


1st International Workshop on
Advances in High-Performance Algorithms Middleware and Applications
http://sara.unisalento.it/~cafaro/AHPAMA2018/

Held in conjunction with the the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2018), Washington, DC, USA May 1-4 2018


The Workshop on Advances in High-Performance Algorithms Middleware and Applications is an international forum which brings together researchers and practitioners working on different high-performance aspects of algorithms, middleware and technologies enabling novel applications. Middleware technologies include tools to assemble together different resources such as parallel supercomputers, data archives, high-speed storage systems, advanced visualization devices and scientific instruments using high speed networks connecting geographically distributed devices and organizations. Many recent international efforts are actively fostering the development of such applications and technologies. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of algorithms and applications.

Creating breakthrough parallel algorithms for high-performance applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance algorithms middleware and applications, and related topics. For example, the following topics are relevant to the workshop:

- Scalable message-passing parallel algorithms using MPI
- Scalable shared-memory parallel algorithms using OpenMP
- GPGPU parallel algorithms using OpenCL or CUDA
- Green High-Performance Computing
- Exploiting modern parallel architectures including FPGA, many-cores and multi-cores for parallel applications
- Middleware for high-performance computing
- Benchmarking and performance studies of high-performance applications
- Novel programming paradigms to support high-performance computing
- Performance models for high-performance applications and middleware
- Efficient job scheduling for high-performance applications
- Performance-aware resource reservation
- Security-related performance issues
- Programming models, tools, and environments for high-performance computing
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing
- Peer-to-peer systems for high-performance grid and cloud environments
- Optimization techniques for mobile grids

Submission Guidelines


The results presented in the paper must be unpublished and not submitted for publication elsewhere, including the proceedings of other conferences or workshops. Papers will be peer-reviewed by at least three reviewers. Papers are evaluated with respect to originality, significance, clarity, and technical soundness. One author of each accepted paper will be expected to present the paper at the workshop. Authors are invited to submit papers electronically in PDF format. Submitted manuscripts should be structured as technical papers and may not exceed 10 letter-size (8.5 x 11) pages including all figures, tables and references using the IEEE format for conference proceedings. Papers need to be submitted through Easy Chair following this link: https://easychair.org/conferences/?conf=ahpama1

Important Dates

Paper submission: February 23, 2018
Author notification: March 7, 2018
Camera ready: March 15, 2018
Workshop: May 1-4, 2018

Workshop Organizers

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it

Program Committee

Clemente Galdi, University of Naples Federico II, Italy
Giuliano Laccetti, University of Naples Federico II, Italy
Barbara Masucci, University of Salerno, Italy
Umberto Ferraro Petrillo, University of Rome La Sapienza, Italy
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Francesco Versaci, CRS4, Italy
Laurence T. Yang, St. Francis Xavier University, Canada

-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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


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