Wednesday, March 22, 2017

[DMANET] Open permanent position

Dear readers of DMANET,

At the institute of Mathematics and Computer Science at the University
of Greifswald (Germany), we have an open permanent position (50 %,
TVL-13) as a teaching and research assistant with teaching obligations
of 7 hours per week. The application deadline is the 1st of April. The
aspired research area is not restricted, so we are open to interested
applicants of all areas of mathematics as long as he or she fits into
the general research areas of our institute. Note that the main focus of
this position is teaching. For more details on the position, please
visit our website:
https://www.uni-greifswald.de/universitaet/information/stellenausschreibungen/oeffentliche-stellenausschreibungen/wissenschaftliches-personal/institut-fuer-mathematik-und-informatik-17sa05/

Note that the website also contains an English version (you just need to
scroll down).

We accept applications via mail or via email (one single PDF please).

Greifswald is a beautiful town located at the Baltic Sea, a popular
holiday region. Student life here is vibrant, and the university has a
long tradition - in fact, it is one of the oldest universities of
Europe. Our institute is one of only a few places in Germany where
students can study biomathematics already at an undergraduate level,
which is why this study program attracts students from all over Germany.
Therefore, the majority of our institute's students study
biomathematics, but we also have pure mathematics students as well as
students who want to become maths teachers. However, our institute also
does a lot of teaching for students of other subjects that are not
directly linked to our institute, e.g. students of natural sciences.

Kind regards,

Mareike Fischer

--

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

Prof. Dr. Mareike Fischer

Biomathematics and Stochastics

Ernst-Moritz-Arndt-University Greifswald
Institute for Mathematics and Computer Science
Walther-Rathenau-Str. 47
17487 Greifswald
Germany

Tel: +49 (0) 3834 864643

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

**********************************************************
*
* 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] Computability and Complexity in Analysis (CCA 2017): Final Call for Papers

______________________________________________________________

Final Call for Papers
Fourteenth International Conference on

Computability and Complexity in Analysis (CCA 2017)
http://cca-net.de/cca2017/

July 24-27, 2017, Daejeon, Republic of Korea (South Korea)

Submission deadline: April 3, 2017
______________________________________________________________


Topics

* Computable analysis
* Complexity on real numbers
* Constructive analysis
* Domain theory and analysis
* Effective descriptive set theory
* Theory of representations
* Computable numbers, subsets and functions
* Randomness and computable measure theory
* Models of computability on real numbers
* Realizability theory and analysis
* Reverse analysis
* Real number algorithms
* Implementation of exact real number arithmetic


Invited Speakers

* Hee-Kap Ahn (Pohang, Republic of Korea)
* Verónica Becher (Buenos Aires, Argentina)
* Anders Hansen (Cambridge, UK)
* Takayuki Kihara (Berkeley, USA)
* Amaury Pouly (Max Planck Institute, Germany)
* Linda Brown Westrick (Connecticut, USA)


Funding

Funding opportunities for student members of the Association for
Symbolic Logic (ASL) are available. Applications should be directed to
the Association for Symbolic Logic three months prior to the meeting,
following the instructions here:
http://www.aslonline.org/studenttravelawards.html


Scientific Programme Committee

* Johanna Franklin (Hempstead, USA)
* Daniel Graça, chair (Faro, Portugal)
* Vassilios Gregoriades (Turin, Italy)
* Peter Hertling (Munich, Germany)
* Gyesik Lee (Anseong, Republic of Korea)
* Alexander Melnikov (Auckland, New Zealand)
* Takako Nemoto (Ishikawa, Japan)
* Arno Pauly (Brussells, Belgium)
* Cristóbal Rojas (Santiago, Chile)
* Frank Stephan (Singapore)
* Klaus Weihrauch (Hagen, Germany)


Organising Committee

* Sunyoung Kim (Yonsei University, Republic of Korea)
* Sewon Park (KAIST, Republic of Korea)
* Martin Ziegler, chair (KAIST, Republic of Korea)


Submissions

Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:

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

If full versions of papers are already available as technical report
or arXiv version, then corresponding links should be added to the
reference list. Final versions of abstracts might be distributed to
participants in hardcopy and/or in electronic form.


Dates

* Submission deadline: April 3, 2017
* Notification of authors: May 1, 2017
* Final version: May 29, 2017


Conference Web Page

http://cca-net.de/cca2017/

A co-located "Workshop on Real Verification" will take place on
Friday, July 28, jointly organized by:

* Gyesik Lee (Hankyong National University, Republic of Korea)
* Martin Ziegler (KAIST, Republic of Korea)

https://complexity.kaist.edu/CCA2017/workshop.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/
*
**********************************************************

Tuesday, March 21, 2017

[DMANET] 2nd CfP, IAM 2017, GECCO Workshop on Industrial Applications of Metaheuristics

IAM 2017

2nd GECCO Workshop on Industrial
Applications of Metaheuristics

Aims and Scope
================

Metaheuristics have been applied successfully to many aspects of applied mathematics and science, showing their capabilities to deal effectively with problems that are complex and otherwise difficult to solve. There are a number of factors that make the usage of metaheuristics in industrial applications more and more interesting. These factors include the flexibility of these techniques, the increased availability of high-performing algorithmic techniques, the increased knowledge of their particular strengths and weaknesses, the ever increasing computing power, and the adoption of computational methods in applications. In fact, metaheuristics have become a powerful tool to solve a large number of real-life optimization problems in different fields and, of course, also in many industrial applications such as production scheduling, distribution planning, and inventory management.

This workshop proposes to present and debate about the current achievements of applying these techniques to solve real-world problems in industry and the future challenges, focusing on the (always) critical step from the laboratory to the shop floor. A special focus will be given to the discussion of which elements can be transferred from academic research to industrial applications and how industrial applications may open new ideas and directions for academic research.

Topic areas include (but are not restricted to):

- Success stories for industrial applications of metaheuristics
- Pitfalls of industrial applications of metaheuristics.
- Metaheuristics to optimize dynamic industrial problems.
- Multi-objective optimization in real-world industrial problems.
- Meta-heuristics in very constrained industrial optimization problems.
- Reduction of computing times through parameter tuning and surrogate modelling.
- Parallelism and/or distributed design to accelerate computations.
- Algorithm selection and configuration for complex problem solving.
- Advantages and disadvantages of metaheuristics when compared to other techniques.
- New research topics for academic research inspired from industrial applications.


Submission
============

Authors can submit:
- Short contributions including position papers of up to 4 pages - and/or
- Regular contributions of up to 8 pages.

In both cases, it is mandatory to follow the official GECCO paper formatting guidelines. Please see the GECCO 2017 information for authors for further details, accessible through http://gecco-2017.sigevo.org/index.html/HomePage. Papers do not need to be anonymised. Software demonstrations will also be welcome.

Please submit your paper in pdf format to iam2017@iridia.ulb.ac.be.


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

Submission deadline: March 27, 2017
Authors notification: April 15, 2107
Camera-ready submission: May 1, 2017
Workshop dates July 15 or 16, 2017
GECCO Conference, Berlin, Germany: July 15-19, 2017


Workshop Chairs
=================

Silvino Fernandez Alzueta (ArcelorMittal)
Pablo Valledor Pellicer (ArcelorMittal)
Thomas Stuetzle (Universite Libre de Bruxelles, ULB)

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

[DMANET] Special issue of Discrete Applied Mathematics: CTW 2016 (deadline March 31th, 2017)

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

Discrete Applied Mathematics

Special Issue: 14th Cologne-Twente Workshop on
Graphs and Combinatorial Optimization (CTW 2016)

--------------------ic.eatcs@di.unipi.it------------------------------------------------


The 14th edition of the Cologne-Twente Workshop on Graphs and
Combinatorial Optimization (CTW 2016, http://http://ctw16.di.unimi.it/)
was held on June 6-8, 2016 at Palazzo Feltrinelli in Gargnano, Italy,
a historical building belonging to the University of Milan.

Following the tradition of previous CTWs, a special issue of
Discrete Applied Mathematics will be devoted to a selection of papers
on topics related to the themes of the workshop (graph theory,
combinatorial optimization and the design and analysis of algorithms).

All interested researchers are invited to contribute to this special issue.
Submissions of contributions not presented at the workshop are also
welcome.

All articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.

The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify
that the paper is a contribution for the Special Issue of CTW 2016,
so that your paper is assigned to the guest editors. Please see the
Author Instructions on the site if you have not yet submitted a paper
through this web-based system. Be sure to note that your work is intended
for the Special Issue and to select the article type SI: CTW 2016.

The deadline for submission is March 31, 2017.

Accepted papers will be published online individually, before print
publication.
We are looking forward to receiving your contribution.

The Guest Editors,

Alberto Ceselli
Roberto Cordone

**********************************************************
*
* 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] CG: YRF---second call for papers

Computational Geometry: Young Researchers Forum -- Second Call
==============================================================

The 33rd Symposium on Computational Geometry (SoCG) will take place July 4-7,
2017 in Brisbane, Australia. It brings together the global community of
researchers who work on a large variety of aspects that combine geometry,
algorithms and applications. To allow a broad audience to actively participate
in the community's major scientific event, this year SoCG will again be
accompanied by a series of satellite events, which together constitute "CG Week
2017". See http://socg2017.smp.uq.edu.au/ for details.

One of these satellite events will be the "Computational Geometry: Young
Researchers Forum" (CG:YRF), which is aimed at current and recent students. The
active involvement by students and recent graduates in research, discussions,
and social events has been longstanding tradition in the CG community.
Participation in a top-level event such as SoCG can be educating, motivating,
and useful for networking, both with other students and with more senior
scientists.

The YRF presents young researchers (defined as not having received a formal
doctorate before 2015) an opportunity to present their work (in progress as
well as finished results) to the CG community in a friendly, open setting. Just
like in the main event, presentations will be given in the form of talks. A
pre-screening (but no formal review process) will ensure appropriate quality
control.

Submission guidelines:
----------------------
- The idea of the event is for young researchers to present new and ongoing
work. Therefore, the work should not have appeared in print in a formally
reviewed proceedings volume or journal by the time of submission, and at least
one author must be young researcher.
- Topics must fit into the general context of SoCG, as described in the call
for SoCG submissions.
- A submission must be in the form of a 2-page abstract, formatted according to
a style file provided at the SoCG web page and submitted via easychair at
https://easychair.org/conferences/?conf=cgyrf2017
- Accepted abstracts will be compiled in a booklet of abstracts that will be
distributed among the participants; this should not be considered a formal
publication. In particular, participants are encouraged to submit (an extended
version of) their presented work to a conference with formal proceedings and/or
to a journal.
- The work must be presented at CG:YRF by an author who is a young researcher,
else it will be removed from the program.

We will employ a two-phase screening process. After the first review phase,
there will be a notification of either rejection (if the result is clearly out
of context, or technically incorrect), or conditional acceptance, accompanied
with a description of required changes to be made (either with respect to
content or format). In the second phase, we will check whether the changes have
been implemented satisfactorily. The screening process is intended to ensure
the technical quality of the presented work. Submissions that are not well
written risk rejection, irrespective of correctness. Authors are requested to
have their submissions proofread by their advisor or another experienced
scientist.

Important dates (deadlines are 23:59 Honolulu time):
----------------------------------------------------
- April 17, 2017: Deadline for submissions - May 12, 2017: Notification of
conditional acceptance
- May 19, 2017: Deadline for revisions
- May 26, 2017: Notification of acceptance
- July 3-7, 2017: CG-Week 2017

YRF Program Committee
---------------------
Therese Biedl, University of Waterloo, Canada (chair)
Arijit Bishnu, Indian Statistical Institute, India
Stephane Durocher, University of Manitoba, Canada
Seok-hee Hong, University of Sydney, Australia
John Iacono, New York University, USA
Clement Maria, University of Queensland, Australia
David Mount, University of Maryland, USA
Yoshio Okamoto, The University of Electro-Communications, Japan

**********************************************************
*
* 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] GECCO 2017 Workshop CFP: Ensemble Methods for Optimisation

********************************************************
GECCO 2017 Workshop CFP: Ensemble Methods for Optimisation
********************************************************
Workshop @ GECCO 2017, Berlin

Organisers: Emma Hart and Kevin Sim, Edinburgh Napier University

http://www.rollproject.org/ensembles-methods-for-optimisation-workshop-gecco-2017/

In the field of machine-learning, ensemble-methods that combine decisions from multiple learning algorithms to make accurate predictions have been the focus of intense research for well over a decade, with a broad range of empirical results underpinned by a sound theoretical understanding. Ensemble methods have also found favour within the constraint satisfaction and satisfiability domains where they are commonly referred to as portfolio methods. In the latter case, portfolios tend to be composed from exact solvers, and are evaluated according to run-time metrics.

On the other hand, research in ensemble-methods using meta-heuristic algorithms - in which solution quality rather than run-time is the driving factor - lags behind machine-learning and satisfiability research in both theory and practice. Many fundamental questions remain with respect to how to construct, and design ensembles that will be addressed during the workshop:

* How should we select algorithms to form an ensemble?
* How large should the selection pool be - and where do we find algorithms to form the pool?
* Are automated algorithm generation techniques required to design new algorithms to provide a large enough pool?
* Machine-learning theory suggests that diversity between components is a key factor - what diversity measures can be used to successfully distinguish between meta-heuristic algorithms?
* How should the ensemble operate? Algorithms might collaborate, i.e. the computational budget is divided between algorithms within the ensemble, or cooperate, in that different algorithms solve different instances?
* What domains are ensemble methods best suited to?

************
Submissions
************

We invite paper submissions describing technical work as well as conceptual/visionary short papers. Demos accompanied by short papers are also welcomed. The workshop encourages presentation of work in early stages in order to encourage discussion amongst participants.

Technical papers have a limit of 8 pages.
Conceptual and Demo papers have a limit of 2 pages.

All papers should be in ACM (Association for Computing Machinery) format. Please see GECCO 2017 http://gecco-2017.sigevo.org for details. Papers should not be anonymised. All papers should be submitted in PDF format.

All accepted papers will be presented at GECCO-2017 and will appear in the GECCO workshop volume.

Submissions should be emailed to e DOT hart AT napier.ac.uk with the subject heading: EfO Submission


**********
Key Dates
**********
Paper submission deadline: March 29, 2017 (no extensions permitted)

This message and its attachment(s) are intended for the addressee(s) only and should not be read, copied, disclosed, forwarded or relied upon by any person other than the intended addressee(s) without the permission of the sender. If you are not the intended addressee you must not take any action based on this message and its attachment(s) nor must you copy or show them to anyone. Please respond to the sender and ensure that this message and its attachment(s) are deleted.

It is your responsibility to ensure that this message and its attachment(s) are scanned for viruses or other defects. Edinburgh Napier University does not accept liability for any loss or damage which may result from this message or its attachment(s), or for errors or omissions arising after it was sent. Email is not a secure medium. Emails entering Edinburgh Napier University's system are subject to routine monitoring and filtering by Edinburgh Napier University.

Edinburgh Napier University is a registered Scottish charity. Registration number SC018373


**********************************************************
*
* 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] Lecturer in Theoretical Computer Science at Loughborough University

Loughborough University is seeking to appoint two dedicated and ambitious academics to Lectureship in Computer Science. Appointees will become a member of the Department of Computer Science within the School of Science. The appointed candidates will collaborate effectively in a team atmosphere; will have an intellectually challenging research agenda in one or more of the areas: Networks, Internet/Cloud Computing, Cybersecurity, Formal Aspects of Software Engineering, Theoretical Computer Science and a commitment to research-led teaching at all levels of undergraduate and postgraduate education.

Computer Science is a vibrant community of researchers who are committed to supporting each other deliver outstanding research: http://www.lboro.ac.uk/departments/compsci/ <http://www.lboro.ac.uk/departments/compsci/>
Candidates should possess a degree in Computer Science, have an emerging track record of outstanding research with impact and the potential to attract external funding. They will initiate and participate in collaborative activity with School members and across the University.

For informal discussions about this role please contact Dr Iain Phillips, Acting Head of the Computer Science and Director of Academic Staffing for the School of Science, I.W.Phillips@lboro.ac.uk <mailto:I.W.Phillips@lboro.ac.uk>

Application Closing Date: 19 April 2017

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

[DMANET] CIAC 2017: Call for participation

CALL FOR PARTICIPATION

10th International Conference on Algorithms and Complexity (CIAC 2017)
May 24-26, 2017, Athens, Greece
http://www.corelab.ntua.gr/ciac2017

The 10th International Conference on Algorithms and Complexity (CIAC 2017)
is intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and experimentation
of efficient algorithms and data structures.

Principal topics of interest include (but are not limited to): sequential,
parallel and distributed algorithms and data structures; approximation and
randomized algorithms; graph algorithms and graph drawing; online and
streaming algorithms; analysis of algorithms and computational complexity;
algorithmic engineering; web algorithms; exact and parameterized
computation;
algorithmic game theory; computational biology; foundations of communication
networks; computational geometry; discrete optimization.

The scientific program of CIAC 2017 includes 3 invited lectures and
presentations of 36 contributed papers. A celebration for the 70th birthday
of Stathis Zachos will take place as part of the conference. The conference
will take place at the campus of the National Technical University of
Athens.

INVITED SPEAKERS
Giuseppe Italiano (Universita di Roma "Tor Vergata", Italy)
Klaus Jansen (University of Kiel, Germany)
Christos Papadimitriou (University of California at Berkeley, USA)

ACCEPTED PAPERS: http://www.corelab.ntua.gr/ciac2017/#accepted

REGISTRATION
Registration is now open at https://www.corelab.ntua.gr/ciac2017/register/
Early registration deadline: April 10, 2017
Regular: 380 Euro, Student: 280 Euro

To register for CIAC 2017 or for any further information, please go to
http://www.corelab.ntua.gr/ciac2017 or email us to ciac2017@corelab.ntua.gr

We look forward to seeing you in Athens!

**********************************************************
*
* 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, March 20, 2017

[DMANET] Third CFP: ADT 2017 -- the 5th International Conference on Algorithmic Decision Theory, Luxembourg, 25--27 October 2017

Dear colleagues,

I'm pleased to announce the third and final CFP for ADT 2017 and I apologize for
cross-postings:

======================================================================
Call for Papers: ADT 2017 Third Announcement

The International Research Group on Algorithmic Decision Theory
(CNRS/GDRI ALGODEC) in collaboration with the EURO working group on
preference handling and the Computer Science and Communications
Research Unit (CSC) of the University of Luxembourg is proud to
announce

ADT 2017, the 5th International Conference on
Algorithmic Decision Theory
Luxembourg, 25--27 October 2017
http://sma.uni.lu/adt2017

The ADT 2017 conference seeks to bring together researchers and
practitioners coming from diverse areas such as Artificial
Intelligence, Database Systems, Operations Research, Discrete
Mathematics, Theoretical Computer Science, Decision Theory, Game
Theory, Multiagent Systems, Computational Social Choice, Argumentation
Theory, and Multiple Criteria Decision Aiding in order to improve the
theory and practice of modern decision support. Some of the scientific
challenges facing the Algorithmic Decision Theory (ADT) community
include big preference data, combinatorial structures, partial and/or
uncertain information, distributed decision making, and large user
bases. Such challenges occur in real-world decision making in domains
like electronic commerce, recommender systems, argumentation tools,
network optimization (communication, transport, energy), risk
assessment and management, and e-government.

ADT 2017 provides a multi-disciplinary forum for sharing knowledge in
this area with a special focus on algorithmic issues in Decision
Theory. The first four International Conferences on Algorithmic
Decision Theory (ADT 2009 Venice, ADT 2011 Rutgers (DIMACS), ADT 2013
Brussels, ADT 2015 Lexington (Kentucky US)) brought together
researchers and practitioners from diverse areas of computer science,
economics, and operations research from around the globe.

Important Dates:

Title and abstract submission: April 2, 2017 (23:59 GMT)
Full paper submission: April 9, 2017 (23:59 GMT)
Notification: May 14, 2017
Final version of accepted papers: June 2, 2017
ADT 2017 Tutorial and Doctoral Consortium day: October 24, 2017
ADT 2017 Conference: October 25--27, 2017

Keynote Speakers:

Eleni Pratsini, Lab Director, IBM Research -- Ireland
Tentative title: Algorithmic Decision Theory and IoT

Carmine Ventre, Teesside University, Middlesbrough, UK
Tentative title: Novel Mechanism Design Paradigms

Toby Walsh, Data61 and University of New South Wales, Sydney, Australia
Tentative title: Deceased Organ Matching in Australia

Submission (according to one of the following two types):

1. Submissions for proceedings: Submissions are invited on
significant, original, and previously unpublished research on all
aspects of Algorithmic Decision Theory. Papers must be at most 15
pages long in the LNCS format (including references). The formal
proceedings of ADT 2017 will be published by Springer Verlag in the
Lecture Notes in Artificial Intelligence (LNAI) series:
http://www.springer.com/lncs
Papers of this type will be accepted for either oral or poster
presentation, or both. However, no distinction will be made
between accepted papers in the conference proceedings.

2. Submissions without proceedings: Submissions are invited on
significant recent results on Algorithmic Decision Theory. Papers
must be at most 15 pages long (including references). They will not
appear in the proceedings and can be submitted elsewhere. Selected
papers in this category will be accepted for either oral or poster
presentation, or both. Authors are required to write "submission
without proceedings" into the author field of their paper (instead
of author names) if they choose this category; otherwise, it will
be assumed by default that their paper is submitted in the first
category (submissions for proceedings).

For both types of submission, please use Springer's guidelines and
technical instructions for the preparation of contributions that can
be downloaded from:
http://www.springer.com/de/it-informatik/lncs/conference-proceedings-guidelines
and note that at least one author of each accepted paper is required
to attend the conference to present the work. Authors will be required
to agree to this requirement at the time of submission.

All papers will be peer-reviewed by a double-blind procedure. Therefore,
papers must be submitted *anonymously* as pdf via the EasyChair system:
https://easychair.org/conferences/?conf=adt2017
Note that you will need to give the author names in the EasyChair system,
but reviewers will not be able to get any information about the authors.
Therefore, it is important and required that authors do not reveal their
identities in submitted papers.

Program Committee:

Raymond Bisdorff (University of Luxembourg)
Sylvain Bouveret (Université Grenoble-Alpes, France)
Simina Brânzei (The Hebrew University of Jerusalem, Israel)
Robert Bredereck (TU Berlin, Germany)
Katarína Cechlárová (P.J. Safárik University, Kosice, Slovakia)
Jiehua Chen (TU Berlin, Germany)
Gabrielle Demange (EHESS, Paris School of Economics, France)
Paul Goldberg (University of Oxford, UK)
Judy Goldsmith (University of Kentucky, Lexington, KY, USA)
Edith Hemaspaandra (RIT, Rochester, NY, USA)
Sébastien Konieczny (CRIL -- CNRS, Université d'Artois, France)
Jérôme Lang (LAMSADE, Université Paris-Dauphine, France)
Nicholas Mattei (Data61 and University of New South Wales, Sydney, Australia)
Brice Mayag (LAMSADE, Université Paris-Dauphine, France)
Joana Pais Ribeiro (Lisbon School of Economics & Management, Portugal)
Hans Peters (Maastricht University, The Netherlands)
Gabriella Pigozzi (LAMSADE, Université Paris-Dauphine, France)
Eve Ramaekers (Université catholique de Louvain, Louvain-la-Neuve, Belgium)
Anja Rey (TU Dortmund, Germany)
Federica Ricca (Università di Roma La Sapienza, Italy)
Francesca Rossi (University of Padova, Italy)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany, Chair)
Ildikó Schlotter (Budapest University of Technology and Economics, Hungary)
Claudia Schulz (Imperial College London, UK)
Piotr Skowron (University of Oxford, UK)
Marija Slavkovik (University of Bergen, Norway)
Leon van der Torre (University of Luxembourg)
Alexis Tsoukiàs (LAMSADE, Université Paris-Dauphine, France)
Brent Venable (Tulane University, New Orleans, LA, USA)
Angelina Vidali (Teesside University, Middlesbrough, UK)
Toby Walsh (Data61, University of New South Wales, Sydney, Australia)
Gerhard Woeginger (TU Eindhoven, The Netherlands)
Stefan Woltran (TU Wien, Austria)
Ying Zhu (University of Kentucky, Lexington, KY, USA)

Organizing Committee:

Raymond Bisdorff (University of Luxembourg, Chair)
Brice Mayag (LAMSADE, Université Paris-Dauphine, France)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany)
Alexis Tsoukiàs (LAMSADE, Université Paris-Dauphine, France)

Doctoral Consortium Committee:

Nicholas Mattei (Data61 and University of New South Wales, Sydney, Australia)
Anja Rey (TU Dortmund, Germany, Chair)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany)

Conference Venue:

The Conference venue is located at the Conference Centre of the Hotel
Parc-Belle-Vue, 5, Avenue Marie-Thérèse L in 2132 Luxembourg.
Luxembourg can easily be reached by train from all major European
cities. In particular, a TGV connects Paris to Luxembourg in
approximatively 2 hours. Luxembourg also has an international airport
which can be reached from Vienna, Paris, Milan, Copenhagen, London,
Frankfurt, Munich, Amsterdam, Rome, Barcelona, Madrid, Porto, Lisbon,
Nice, Dublin, ...
======================================================================

Best regards,
Jörg Rothe (Program Chair of ADT 2017)

********************************************************************
Prof. Dr. Jörg Rothe
Universität Düsseldorf, Institut für Informatik, Department Chair
rothe@cs.uni-duesseldorf.de http://ccc.cs.uni-duesseldorf.de/~rothe

Check out my new book:
Economics and Computation. An Introduction to Algorithmic
Game Theory, Computational Social Choice, and Fair Division
http://www.springer.com/de/book/9783662479032
********************************************************************

**********************************************************
*
* 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] [CP 2017] Last call for workshops

CP 2017: Call for Workshops
--------------------------

Information also available online at http://cp2017.a4cp.org/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 associated to the main conference program of
CP 2017 (http://cp2017.a4cp.org/), which will be held in Melbourne (Australia)
from August 28 to September 1, 2017, colocated with SAT 2017
(http://sat2017.gitlab.io/) and ICLP 2017 (http://iclp17.a4lp.org/), and
following IJCAI 2017 (http://ijcai-17.org).

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.

Based on successful experiments made in the last three years, 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)
-------------------------------------------

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

The exact schedule for workshops will be confirmed in due time.

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 2017
- 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
-------------------------------------------

1. 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 2017.
2. 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.
3. Creating and publishing, in a timely manner, a webpage at the CP 2017
website, including all the relevant calls and information pertaining to the
workshop.
4. Providing a short description for the conference program.
5. Reviewing and selecting abstract (or paper) submissions.
6. 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 2017 Organizing Committee
----------------------------------------------------

- 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 2017 Workshop Chair
(Charlotte Truchet, Charlotte.Truchet@univ-nantes.fr).

Dr Tommaso Urli

Researcher | Optimisation Platforms

DATA61 | CSIRO

E tommaso.urli@data61.csiro.au<mailto:tommaso.urli@data61.csiro.au> T +61 2 6218 3862 M +61 403 464 731

Tower A Level 3, 7 London Circuit, Canberra ACT 2601

www.data61.csiro.au

CSIRO's Digital Productivity business unit and NICTA have joined forces to create digital powerhouse Data61

[Data61 | CSIRO logo]

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

[DMANET] [Call for Participation] The 5th Gdansk Workshop on Graph Theory (GWGT 2017)

Dear Colleagues,

We cordially invite you to attend the fifth GDAŃSK WORKSHOP ON GRAPH
THEORY that will take place on September 13-15 (2017) in Sopot, one of the
three cities (Gdansk, Sopot, Gdynia) forming a metropolitan area on the
Baltic coast called Tricity (Trojmiasto). The aim of the workshop is to
bring together academic specialists in graph theory and combinatorics to
exchange ideas and identify new directions of research. The workshop
program will consist of a number of contributed talks and three invited
talks during the three days of sessions.

INVITED SPEAKERS

Jaroslaw Grytczuk (Poland)
Andrzej Lingas (Sweden)
Ingo Schiermeyer (Germany)

DEADLINE for early registration: May 15, 2017

Please visit the conference web page http://www.gwgt.mif.pg.gda.pl for
more details and feel free to pass this announcement on to anyone you
think might be interested in.

ACCOMPANYING EVENT

Just before the workshop, from September 5 till 12, 2017, Department of
Algorithms and System Modeling of the ETI Faculty at the Gdansk University
of Technology organizes the Gdańsk Summer School of Advanced Science on
Algorithms for Discrete Optimization, see
http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/summer-school-2017
for more details.


Best regards,
GWGT Team

--------------------------------------------------------------------------
The Fifth Gdansk Workshop on Graph Theory
http://www.gwgt.mif.pg.gda.pl
e-mail: graphs@mif.pg.gda.pl
--------------------------------------------------------------------------

**********************************************************
*
* 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] ISAAC 2017 - call for papers

---------------------------------------------------------------
Call for Papers

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017)
December 9-12, 2017, Phuket, Thailand
http://aiat.in.th/isaac2017/

Submission Deadline: June 29, 2017 11:59PM (PDT)
---------------------------------------------------------------

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017) will be held in Phuket, Thailand on December 9-12,
2017. The symposium is intended to provide a forum for
researchers working in algorithms and theory of computation.
Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant
applied areas are also welcomed. The topics include, but are
not limited to:
Algorithmic game theory
Algorithms and data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithms
Graph drawing and graph algorithms
Internet algorithms
Online algorithms
Parallel and distributed algorithms
Quantum computing
Randomized algorithms.

---------------------------------------------------------------
Important Dates

June 29, 2017: Submission Deadline
August 31, 2017: Notification
October 3, 2017: Camera-Ready Version Due
December 9-12, 2017: ISAAC

---------------------------------------------------------------
Submission Guidelines

Authors are invited to submit an extended abstract or full
paper of at most 12 pages with an optional appendix. The
submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear
comparison with related work. They must not be submitted
simultaneously to another conference with refereed proceedings
or to a journal. Drafts which contain essentially the same
results as papers under review in other conferences or
journals cannot be submitted to ISAAC 2017. Exempted are
workshops and conferences without formal proceedings, but
possibly with handouts containing short abstracts. At least
one author of an accepted paper is required to present the
paper at the conference as a registered participant.

Papers must be formatted in LaTeX, using the LIPIcs style file,
which is available at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ .
The maximum length of the paper (including title, the list of
authors, abstract, references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the
font, do not make a separate title page, etc.: use the LIPIcs
style file as given.

Proofs omitted due to space constraints must be placed in an
appendix that is to be read by the program committee members
at their discretion and will not be published as part of the
proceedings. Thus the paper without the appendix should be
able to stand on its own.

Submissions are due on June 29, 2017 11:59PM (PDT). Only
electronic submission will be allowed via the easychair
submission server
http://www.easychair.org/conferences/?conf=isaac2017 .

These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LIPIcs format) will
be rejected without consideration of their merits.

---------------------------------------------------------------
Availability of Full Versions

Polished full versions are expected to be published in refereed
journals after the ISAAC conference. Upon acceptance, if there
is an omitted detail in the camera-ready version for ISAAC,
authors are encouraged to upload a full version of the accepted
paper to a preprint server, e.g., arXiv, ECCC, or an
e-repository at universities/institutes, so that interested
readers can access the full proofs that are omitted in ISAAC
proceedings. When authors refer to omitted proofs in ISAAC
proceedings, citation to the accessible full version is
desired. However, uploading a full version is not mandatory
for authors.

---------------------------------------------------------------
Special Issues

Special issues in Algorithmica and International Journal of
Computational Geometry and Applications are planned for
selected papers from ISAAC 2017.

---------------------------------------------------------------
Awards

The Best Paper and the Best Student Paper will be awarded. A
paper is eligible for the Best Student Paper if all authors are
full-time students at the time of submission. To indicate that
a submission is eligible, please mark the checkbox ``Eligible
for best student paper'' in the web form on the submission
server.

---------------------------------------------------------------
Invited Speakers

Satoru Iwata (University of Tokyo, Japan)
Suresh Venkatasubramanian (University of Utah, USA)

---------------------------------------------------------------
Program Committee

Isolde Adler (University of Leeds, UK)
Patrizio Angelini (University of Tübingen, Germany)
Markus Bläser (Saarland University, Germany)
Yixin Cao (Hong Kong Polytechnic University, Hong Kong)
Jean Cardinal (Université Libre de Bruxelles, Belgium)
Parinya Chalermsook (Aalto University, Finland)
Erin Wolf Chambers (Saint Louis University, USA)
Kun-Mao Chao (National Taiwan University, Taiwan)
Sevag Gharibian (Virginia Commonwealth University, USA)
Keiko Imai (Chuo University, Japan)
Taisuke Izumi (Nagoya Institute of Technology, Japan)
Jesper Jansson (Kyoto University, Japan)
Naoyuki Kamiyama (Kyushu University, Japan)
Akinori Kawachi (Tokushima University, Japan)
Chung-Shou Liao (National Tsing Hua University, Taiwan)
Yoshio Okamoto (The University of Electro-Communications, Japan) Co-Chair
Dömötör Pálvölgyi (University of Cambridge, UK)
C. Pandu Rangan (Indian Institute of Technology Madras, India)
Laura Sanità (University of Waterloo, Canada)
Daniel Stefankovic (University of Rochester, USA)
Takeshi Tokuyama (Tohoku University, Japan) Co-Chair
Kei Uchizawa (Yamagata University, Japan)
Marc van Kreveld (Utrecht University, the Netherlands)
Haitao Wang (Utah State University, USA)
Yajun Wang (Microsoft, USA)
Wei Xu (Tsinghua University, P.R. China)
Guochuan Zhang (Zhejiang University, P.R. China)
Martin Ziegler (KAIST, Republic of Korea)

---------------------------------------------------------------
Local Arrangement Committee

Thanaruk Theeramunkung (Sirindhorn International Institute of Technology,
Thammasat University)
Jittat Fakcharoenphol (Kasetsart University)
Natsuda Kaothanthong (Sirindhorn International Institute of Technology,
Thammasat University)
Pokpong Songmuang (Thammasat 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/
*
**********************************************************

[DMANET] PhD position at LMU Munich - Algorithmic Bioinformatics

The Canzar lab at the Gene Center of the University of Munich (LMU) is
recruiting a PhD student in algorithmic bioinformatics, to start in
spring 2017. The position provides a competitive salary for a period
of 4 years.

The successful applicant will develop and engineer efficient
algorithms for analyzing biological high-throughput sequencing data.
Supporting the lab's agenda, the successful candidate will employ
tools and techniques from combinatorial optimization and machine
learning to leverage large numbers of publicly available data sets.
Translated into scalable and usable software, they will facilitate the
systematic exploration of important biological or biomedical
questions.

The Canzar lab is embedded in the stimulating, interdisciplinary
environment of the Graduate School for Quantitative Biosciences Munich
(QBM), which integrates approaches ranging from bioinformatics and
theoretical biophysics to molecular systems biology. The lab is housed
in the new Research Center for Molecular Biosystems (BioSysM) at the
life sciences campus Grosshadern/ Martinsried, with excellent access
to other parts of Munich via public transport.

We are seeking motivated candidates with an excellent Master's degree
(or equivalent) in computer science, (applied) mathematics, or
bioinformatics to join our lab. We expect the candidate to have a
solid background in algorithm design and good programming skills as
well as an interest in interdisciplinary work (biology, medicine).

To apply, send your application materials, including a motivation
letter, your CV, and names of two referees in a single pdf file to
Stefan Canzar (stefan.canzar@lmu.de), who can also supply further
information about this position. For more information about the lab at
LMU, please visit our website at https://canzarlab.github.io/.

Applications will be reviewed starting from April 17, 2017.

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

[DMANET] JOB: KTP Associate - Software Research Engineer

KTP Associate - Software Research Engineer

http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI046717

University of Nottingham - Computer Science

Location: Jubilee Campus

Salary: £22,000 – £28,000 per annum depending on skills, qualifications
and experience. Plus significant training package

Closing Date: Wednesday 29 March 2017

Reference: SCI046717

This is an exciting opportunity for an ambitious individual to kick-start
their career in industry as part of a Knowledge Transfer Partnership (KTP).
The Associate will be working with EventMAP to develop new visualisation
tools for their software products and to further their work in the emerging
area of 'fairness' measures in timetabling and scheduling. The project aims
to demonstrate that introducing the concept of subjective 'fairness' into
academic timetabling and scheduling software is an important step to
improving the overall satisfaction levels across all participants.

The position is funded through the acclaimed Knowledge Transfer Partnerships
(KTP) scheme which is a government-supported initiative, enabling graduates
(KTP Associates) to work on exciting and challenging projects in a
partnership between a business and a university. This is an opportunity to
fast track your career by managing a strategic project that has the
potential to transform the business.

You will be employed by the University of Nottingham (School of Computer
Science) but will be based at EventMAP (Belfast), working directly with
senior company staff, as well as receiving additional mentoring support from
expert University staff.

EventMAP (www.eventmapsolutions.com) develop cutting-edge software and
consultancy packages for timetabling, scheduling, resourcing and space
planning for academia and large-scale organisations. Our solutions are
designed to provide powerful, flexible tools that can help create
significant increases in operational efficiency and our clients include a
number of the world's leading universities, as well as an ever-expanding
number of large commercial and public sector organisations.

The post holder should:

· Possess a degree in Computer Science or a similar science /
engineering discipline.

· Be proficient in developing software applications in C#, ASP.NET,
MS-SQL Server, JavaScript, and common frontend JavaScript libraries such as
React, Backbone and Angular.

· Have experience in object-oriented software design principles, a
working knowledge of Continuous Integration and experience writing unit
tests and using TDD.

· Experience in scheduling, timetabling or optimisation is
desirable but not essential.

· Have excellent analytical and problem solving skills.

· Be able to work independently, prioritise tasks and work to tight
deadlines.

· Have good project management skills.

. Have good interpersonal and communication skills, and the ability
to deal with a variety of people at different levels.

The post will be offered on a full-time fixed-term contract for a period of
two years.

Knowledge Transfer Partnerships is a government funded knowledge transfer
initiative that supports partnerships between business and universities,
placing graduates on challenging, high profile projects. Further information
is available at: www.facebook.com/uonktp

Informal enquiries may be addressed to Ender Ozcan, tel: 0115 9515544 or
email ender.ozcan [ATT] nottingham.ac.uk. Please note that applications sent
directly to this email address will not be accepted.

The University of Nottingham is an equal opportunities employer and welcomes
applications from all sections of the community.

Further details - Job Description/Role Profile:
https://jobs.nottingham.ac.uk/Upload/vacancies/files/13633/SCI046717.pdf

This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.

Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.

This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.


**********************************************************
*
* 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] computational optimization

Call for Papers

10th International Workshop on Computational Optimization (WCO17)
Prague, Czech Republic, September 4-7, 2017

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

IEEE CS is a technical co-sponsor of FedCSIS 2017

https://fedcsis.org/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 WCO17 paper will be awarded during the social dinner of FedCSIS2017.
The best paper will be selected by WCO17 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 (Position paper will only appear in the
conference proceedings).
* Extended versions of selected papers presented at WCO17 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2017
Position paper submission : May 31th, 2017
Author notification : June 14th, 2017
Final paper submission and registration : June 28, 2017
Conference date : September 4-7, 2017

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

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 :
wco2017@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/
*
**********************************************************

Sunday, March 19, 2017

[DMANET] Durham Post-doc Position in Graph Algorithms and Complexity / Temporal Graphs

School of Engineering and Computing Sciences, Durham University, UK

Post-Doctoral Research Associate

Duration: 36 months
Grade 7
Salary: 32000 - 34000 GBP (GB Pounds p.a.)

A 3-year Post-Doctoral Research Associate (PDRA) is sought, with
expertise in graph algorithms and complexity, preferably also in
parameterized algorithms and/or approximation algorithms. The successful
candidate will work at Durham University under the guidance of Dr.
George Mertzios on the EPSRC-funded grant "Algorithmic Aspects of
Temporal Graphs". The research in this grant will investigate various
optimization problems on temporal (i.e. dynamically changing) graphs and
explore the computational complexity landscape of these new problems.
Applicants are expected to have (or be about to receive) a PhD in
Computer Science or a closely related subject (e.g. Mathematics).
Although some previous experience with temporal (i.e. dynamically
changing) graphs may be beneficial, it is *not* a requirement for the
job. This project is in collaboration with the University of Liverpool.
The successful candidate will be part of the Algorithms and Complexity
research group (ACiD) in the School of Engineering and Computing
Sciences at Durham (see
http://community.dur.ac.uk/algorithms.complexity/index.php).

The application deadline is 21 April 2017. The full announcement,
including more information and instructions on how to apply, is
available at:

http://www.jobs.ac.uk/job/AXW261/post-doctoral-research-associate/

More details on the project can be found at:
http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/P020372/1

Despite what is stated on the EPSRC web-site, the notional start-date is
1 April 2017 but there is flexibility regarding the actual start-date.

General inquiries about the position, the project and the application
procedure are welcome and should be sent to Dr. George Mertzios:
george.mertzios@durham.ac.uk
(see http://www.dur.ac.uk/george.mertzios/)

--
Dr. George B. Mertzios
Senior Lecturer in Computer Science
School of Engineering and Computing Sciences
Durham University, UK
Tel: +44 (0) 191 33 42 429
Email: george.mertzios@durham.ac.uk
http://community.dur.ac.uk/george.mertzios/

**********************************************************
*
* 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: Reachability Problems, RP 2017, London, UK

The 11th International Workshop on Reachability Problems (RP'17)

7 - 9 September 2017 | Royal Holloway, University of London, UK | http://rp17.cs.rhul.ac.uk

The 11th Workshop on Reachability Problems will be hosted at
Royal Holloway, University of London.

The Reachability Workshop is specifically aimed at gathering together scholars
from diverse disciplines interested in reachability problems that appear in
algebraic structures, computational models, hybrid systems, logic and
verification.

Invited Speakers:

Hana Chockler, King's College London
Laurent Doyen, LSV - ENS Cachan
Raphaël Jungers, Université catholique de Louvain
Andreas Podelski, University of Freiburg

Submissions:

Authors are invited to submit a draft of a full paper with at most 12 pages (in
LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted
due to space constraints must be put into an appendix to be read by the program
committee members at their discretion. Submissions deviating from these
guidelines risk rejection. Electronic submissions should be formatted in pdf.
Simultaneous submission to other conferences or workshops with published
proceedings is not allowed.

Submission link: https://easychair.org/conferences/?conf=rp2017

Topics of interest include (but are not limited to): reachability problems in
infinite state systems, rewriting systems, dynamical and hybrid systems;
reachability problems in logic and verification; reachability analysis in
different computational models, counter timed/cellular/communicating automata;
Petri nets; computational aspects of algebraic structures (semigroups, groups
and rings); frontiers between decidable and undecidable reachability problems;
predictability in iterative maps and new computational paradigms.

Important Dates

Submission deadline: 10 May 2017 (AoE)
Notification to authors: 21 June 2017
Final version: 30 June 2017
Workshop: 7 - 9 September 2017

Presentation-Only Track

In addition to regular papers that will appear in our LNCS proceedings, we
invite researchers to apply to give a presentation at RP'17 without an
accompanying paper. Such presentations can be based on work that has appeared
(or which is going to appear) in the proceedings of another conference, or which
has not yet been submitted. These contributions will be judged solely on the
basis of their attractiveness to the workshop.

To apply to give such a presentation please submit a PDF file containing a short
abstract (up to two pages) by e-mail [ rp2017@easychair.org ] by August 2st
2017, with subject "RP2017 Informal Presentations". This abstract will not be
published in the conference proceedings. Notification for the presentation-only
track will be August 9th 2016.

Proceedings

The Conference Proceedings will be published as the volume of the Springer
Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the
Conference. We plan also to publish selected papers in a special issue of a high
quality journal following the regular referee procedure.

RP'16 Program Committee:

Igor Potapov, University of Liverpool (co-chair)
Matthew Hague, Royal Holloway, University of London (co-chair)

Paul Bell, Liverpool John Moores University
Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan
Aiswarya Cyriac, Chennai Mathematical Institute
Giorgio Delzanno, Universita Degli Studi Di Genova
Piotrek Hofman, University of Warsaw
Peter Lammich, Institut fuer Informatik, TU Munich
Martin Lange, University of Kassel
Salvatore La Torre, Università degli Studi di Salerno
Ranko Lazic, University of Warwick
Ondřej Lengál, Brno University of Technology
Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique
Rupak Majumdar, Max Planck Institute for Software Systems
Ahmed Rezine, Linköping University
Tachio Terauchi, Japan Advanced Institute of Science and Technology
Hsu-Chun Yen, National Taiwan University

Previous Workshops :

2016: RP'16 in Aalborg, Denmark
LNCS proceedings, Volume 9899/2016, Springer Verlag
2015: RP'15 in Warsaw, Poland
LNCS proceedings, Volume 9328/2015, Springer Verlag
2014: RP'14 in Oxford, UK
LNCS proceedings, Volume 8762/2014, Springer Verlag
2013: RP'13 in Uppsala, Sweden
LNCS proceedings, Volume 8169/2013, Springer Verlag
2012: RP'12 in Bordeaux, France
LNCS proceedings, Volume 7550/2012, Springer Verlag
2011: RP'11 in Genova, Italy
LNCS proceedings, Volume 6945/2011, Springer Verlag
2010: RP'10 in Brno, Czech Republic
LNCS proceedings, Volume 6227/2010, Springer Verlag
2009: RP'09 in Palaiseau, France
LNCS proceedings, Volume 5797/2009, Springer Verlag
2008: RP'08 in Liverpool, UK
ENTCS proceedings, Volume 223, Elsevier
2007: RP'07 in Turku, Finland
TUCS General Publication Series, Volume 45,
Turku Centre for Computer Science

DBLP Reachability Problems: http://dblp.uni-trier.de/db/conf/rp/

**********************************************************
*
* 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, March 17, 2017

[DMANET] IMA and OR Society Conference on Mathematics of Operational Research

IMA and OR Society Conference on
Mathematics of Operational Research
Innovating Mathematics for New Industrial Challenges
20 - 21 April 2017, Aston University, Birmingham, UK


The conference will aim to draw together the considerable community of researchers and practitioners who develop new mathematics of relevance to and which underpin applications in Operational Research (OR). It will take a comprehensive view, will showcase activity from across OR, and will welcome both contributions which have a clear application focus as well as those which are theoretically driven.

Contributions will be expected to showcase both significant new mathematics and OR relevance. The conference will host plenaries from leading international experts.


Invited Speakers
Professor Jacek Gondzio (University of Edinburgh)
Professor Edward Kaplan (Yale School of Management)
Guillermo Ortega (European Space Agency)
Professor Bert Zwart (CWI Amsterdam)

Call for Papers: Please note that the deadline for oral and poster presentations has now passed.

Conference Fees - registration is open via https://my.ima.org.uk/ *

Early Bird Fees
IMA/OR Society Member £245
IMA/OR Society Student £160
Non IMA/OR Society Member £325
Non IMA/OR Society Student £170

Early Bird fees will be available until Monday 27 March 2017, after which the fees will be:

IMA/OR Society Member £265
IMA/OR Society Student £180
Non IMA/OR Society Member £345
Non IMA/OR Society Student £190

Early Bird Fees must be paid by Monday 27 March 2017 otherwise the higher price will be implemented.

Residential Fee £240 including 2 nights single B&B accommodation at the university with the conference dinner
Conference Dinner £40 for non-residents

*If you are an IMA Member or you have previously registered for an IMA conference, then you are already on our database. Please "request a new password" using the email address previously used, to log in.

Organising Committee
Kevin Glazebrook (Lancaster University)
Joerg Fliege (University of Southampton)
Andy Harrison (FICO)
John Hopes (EY)
Djamila Ouelhadj (University of Portsmouth)
Dan Tilley

Conference webpage:
http://www.ima.org.uk/conferences/conferences_calendar/maths_of_operational_research.html

Further information
For general conference queries please contact Lizzi Lake, Conference Officer
E-mail: conferences@ima.org.uk<mailto:conferences@ima.org.uk> Tel: +44 (0) 1702 354 020
Institute of Mathematics and its Applications, Catherine Richards House, 16 Nelson Street, Southend-on-Sea, Essex, SS1 1EF, UK.


______________________________________________________________________
The Institute of Mathematics and its Applications is a not for profit organisation registered as a charity in the UK.
This email has been scanned by the MessageLabs Email Security System before onward transmission.
For more information please visit http://www.symanteccloud.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] Call for Abstracts: OR 2017

** Call for Abstracts: OR 2017 ++ International Conference on Operations Research ++ Berlin, Sept 6 - Sept 8, 2017 ++ hosted by GOR and Freie Universität Berlin **

We invite practitioners and academics from mathematics, computer science, business/economics and other fields to participate at this year's conference, which is held at Freie Universität in Berlin, Germany. The conference provides ample opportunities to present all OR related topics containing both theoretical as well as application-oriented research. Theoretical contributions mainly deal with developing new mathematical techniques to solve all kind of optimization problems. Practical applications may relate to all relevant fields such as health care, transportation and logistics, finance, etc. The special focus of the conference in 2017 is "Decision Analytics for the Digital Economy", but all other OR related topics are welcome, too. Following the format of recent years, the conference consists of plenary and semi-plenary sessions as well as scientific sessions organized by the streams announced below. Please submit your abstract to one of the streams below. Once your abstract has been accepted, we provide the option to submit an extended abstract for potential acceptance in Springer based conference proceedings.

===================================================================
** Plenary and Semi-Plenary Speakers **

Plenary Speakers: Richard Eglese ++ Andrea Lodi

Semi-Plenary Speakers: Martin Bichler ++ Sven Crone ++ Christoph Klingenberg ++ Marco Lübbecke ++ Alexander Martin ++ Dirk Christian Mattfeld ++ Anna Nagurney ++ Panos M. Pardalos ++ Meinolf Sellmann ++ Arne Strauss ++ Dorothea Wagner

===================================================================
** Streams for Abstract Submission **

Business Analytics, Artificial Intelligence and Forecasting ++ Control Theory and Continuous Optimization ++ Decision Theory and Multiple Criteria Decision Making ++ Discrete and Integer Optimization ++ Energy and Environment ++ Finance ++ Game Theory and Experimental Economics ++ Graphs and Networks Health Care Management ++ Logistics and Freight Transportation ++ Metaheuristics Optimization under Uncertainty ++ OR in Engineering ++ Production and Operations Management Project Management and Scheduling ++ Revenue Management and Pricing ++ Simulation and Statistical Modeling Software Applications and Modelling Systems ++ Supply Chain Management ++ Traffic, Mobility and Passenger Transportation

===================================================================
** Important Dates **

Abstract submission (English preferred, German possible) closes April 30, 2017.
Notification of abstract acceptance until May 30, 2017.
Submission of extended abstracts (six pages) for Springer conference proceedings possible, if abstract is accepted, until July 15, 2017.
Registration opens in May 2017. Reduced conference fees for early registration until June 30, 2017.

===================================================================
** Social Program **

Get-Together ++ Welcome Reception ++ Conference Dinner ++ Excursions

===================================================================
** Organizers **

Local organizing committee: Natalia Kliewer ++ Ralf Borndörfer ++ Jan Fabian Ehmke ++ Max Klimm ++ Stefan Lessmann ++ Timo Schmid

Program committee: Natalia Kliewer ++ Jan Fabian Ehmke ++ Ralf Borndörfer ++ Andreas Fink ++ Alf Kimms ++ Thorsten Koch ++ Stefan Lessmann ++ Rolf Möhring ++ Anita Schöbel ++ Martin Skutella

===================================================================
** Submit your abstract now: http://www.or2017.de <http://www.or2017.de/> **

Detailed information on the content of the plenaries and semi-plenaries, the organizing stream chairs, conference fees, the preliminary schedule, accommodation, conference proceedings and abstract submission can be found on the conference's webpage at http://www.or2017.de <http://www.or2017.de/>. Reserve your hotel rooms early, since Berlin will be busy due to the IFA exhibition.

Please contact or2017@fu-berlin.de <mailto:or2017@fu-berlin.de> in case of any questions.
**********************************************************
*
* 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] WPDM 2017 International Workshop on Parallel and Distributed Data Mining

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

The first International Workshop on Parallel and Distributed Data Mining (WPDM 2017)

CALL FOR PAPERS

As part of The International Conference on High Performance Computing & Simulation (HPCS 2017)
http://hpcs2017.cisedu.info or http://cisedu.us/rp/hpcs17

July 17 – July 21, 2017
Genoa, Italy


Submission Deadline: April 3, 2017 (extended)

Submissions could be for full papers, short papers, poster papers, or posters


SCOPE AND OBJECTIVES

The Workshop on Parallel and Distributed Data Mining is an international forum which brings together researchers and practitioners working on different high-performance aspects of data mining algorithms, enabling novel applications.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

Therefore, there is an increasing interest in the design and implementation of parallel data mining algorithms. On parallel computers, by exploiting the vast aggregate main memory and processing power of processors and accelerators, parallel algorithms can easily address both the running time and memory requirement issues. Anyway, parallelising existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organisation and decomposition strategy in order to balance the workload while minimising data dependences. Another concern is related to minimising synchronisation and communication overhead. Finally, I/O costs should be minimised as well.

The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of data mining algorithms and applications.

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

The WPDM Workshop topics include (but are not limited to) the following:

- Scalable message-passing parallel data mining algorithms using MPI
- Scalable shared-memory parallel data mining algorithms using OpenMP
- Scalable hybrid MPI + OpenMP parallel data mining algorithms
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Exploiting modern parallel architectures including FPGA for parallel data mining applications
- Map-reduce based parallel data mining algorithms
- Middleware for high-performance data mining on grid and cloud environments
- Benchmarking and performance studies of high-performance data mining applications
- Novel programming paradigms to support high-performance computing for data mining
- Performance models for high-performance data mining applications and middleware
- Programming models, tools, and environments for high-performance computing in data mining
- Caching, streaming, pipelining, and other optimisation techniques for data management in high-performance computing for data mining


INSTRUCTIONS FOR PAPER SUBMISSIONS

You are invited to submit original and unpublished research works on above and other topics related to synergy between parallel computing, optimisation and simulation. Submitted papers must not have been published or simultaneously submitted elsewhere. For Regular papers, please submit a PDF copy of your full manuscript, not to exceed 8 double-column formatted pages per template, and include up to 6 keywords and an abstract of no more than 400 words. Additional pages will be charged additional fee. Submission should include a cover page with authors' names, affiliation addresses, fax numbers, phone numbers, and all authors email addresses. Please, indicate clearly the corresponding author(s) although all authors are equally responsible for the manuscript. Short papers (up to 4 pages), poster papers and posters (please refer to http://hpcs2017.cisedu.info/1-call-for-papers-and-participation/call-for-posters for posters submission details) will also be considered. Please spe!
cify the type of submission you have. Please include page numbers on all preliminary submissions to make it easier for reviewers to provide helpful comments.

Submit a PDF copy of your full manuscript to the workshop EasyChair paper submission site at https://easychair.org/conferences/?conf=wpdm2017. Acknowledgement will be sent within 48 hours of submission.

Only PDF files will be accepted, uploaded to the submission link above. Each paper will receive a minimum of three reviews. Papers will be selected based on their originality, relevance, significance, technical clarity and presentation, language, and references. Submission implies the willingness of at least one of the authors to register and present the paper, if accepted. At least one of the authors of each accepted paper will have to register and attend the HPCS 2017 conference to present the paper at the workshop.

PROCEEDINGS

Accepted papers will be published in the Conference proceedings. Instructions for final manuscript format and requirements will be posted on the HPCS 2017 Conference web site. It is our intent to have the proceedings formally published in hard and soft copies and be available at the time of the conference. The proceedings is projected to be included in the IEEE or ACM Digital Library and indexed in all major indexing services accordingly.

SPECIAL ISSUE

Plans are underway to have the best papers, in extended version, selected for possible publication in a journal as special issue. Detailed information will soon be announced and will be made available on the conference website.

If you have any questions about paper submission or the symposium, please contact the symposium organisers.

IMPORTANT DATES

Paper Submissions: ------------------------------------------- April 3, 2017
Acceptance Notification: -------------------------------------- April 21, 2017
Camera Ready Papers and Registration Due by: --------------- May 03, 2017
Conference Dates: -------------------------------------------- July 17 – 21, 2017


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

International Program Committee:

All submitted papers will be reviewed by the workshop technical program committee members.

Committee formation is pending and will be finalised shortly. Current TPC members:

Gianfranco Bilardi, University of Padova, Italy
Ronald Brightwell, Sandia National Laboratories, USA
Matteo Ceccarello, University of Padova, Italy
Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Bronis R. de Supinski, Lawrence Livermore National Laboratory, USA
Kenli Li, Hunan University, China
Donato Malerba, Università degli Studi di Bari Aldo Moro, Italy
Pablo Moscato, University of Newcastle, Australia
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA
Renato Vimieiro, Universidade Federal de Pernambuco, Brazil
Laurence T. Yang, St Francis Xavier University, Canada

For information or questions about Conference's paper submission, tutorials, posters, workshops, special sessions, exhibits, demos, panels and forums organisation, doctoral colloquium, and any other information about the conference location, registration, paper formatting, etc., please consult the Conference's web site at URL: http://hpcs2017.cisedu.info or http://cisedu.us/rp/hpcs17 or contact one of the Conference's organisers.


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