Friday, February 17, 2017

[DMANET] PhD in Advanced Algorithms and Formal Methods for the Design of New Materials

PhD Studentship 2017 (Leverhulme Research Centre for Functional Materials Design)
3.5 years (£14,296 pa in 2016/17)
Closing date for applications: 3rd March 2017

The Computer Science department of the University of Liverpool is offering the PhD
position on the topics of Advanced Algorithms and Formal Methods for the Design of New Materials.
https://www.liverpool.ac.uk/chemistry/postgraduate/postgraduate-opportunities/advanced-algorithms-and-formal-methods-for-the-design-of-new-materials/

The project shall focus on the so-called "Crystals Prediction Problem" aiming to predict
stable and desirable new crystal structures, and will examine the Complexity of the problem
and shall propose advanced algorithms (most possibly approximation techniques) for it.
The problem itself is a very interesting case of non-convex optimization. The project
shall examine formal methods suitable to the problem.

The candidate is expected to interact with computational chemists and also expected
to be able to program some computations in high performance machines.

Eligibility:
The award is primarily available to students resident in the UK/EU and will pay full
tuition fees and a maintenance grant for 3.5 years (£14,296 pa in 2016/17).
Non-EU nationals are not eligible for this position and applications from non-EU candidates
will not be considered unless you have your own funding.


Supervisors: Prof P Spirakis, Prof P Krysta, Dr I Potapov
Qualifications: A BSC degree in Computer Science with emphasis in Algorithms is required.
Some knowledge of Complexity is also required. An MSC in CS-Algorithms is optional.

Starting: October 2017

Closing date for applications: 3rd March 2017
Informal enquiries should be addressed to Prof Paul Spirakis < P.Spirakis@liverpool.ac.uk >
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] 7th ICROR RailLille 2017 - Call for participation

--------------------------------------------------------------------------
7th ICROR RailLille 2017 - Call for Participation
--------------------------------------------------------------------------

--------------------------------------------------------------------------
NEWS
--------------------------------------------------------------------------

- Short courses informations webpage available, see
https://raillille2017.sciencesconf.org/resource/page/id/14
- Registration opened (see the "How to register" webpage)
- Venue webpage modified
- Program available, see
https://raillille2017.sciencesconf.org/program

--------------------------------------------------------------------------
AIMS OF IAROR
--------------------------------------------------------------------------

IAROR was founded in 2005 and has currently more than 250 members. IAROR
combines the expertise of academic and professional railway research with
the aim of enhancing the quality of service for railway passengers and
customers, improving the effectiveness and efficiency of capacity
management, timetabling, traffic management and ensuring the safety of
railway operations. IAROR stimulates innovative theoretical approaches,
high-tech concepts, new technological developments and dynamic decision
support systems that contribute to a higher flexibility, performance and
punctuality of trains operating on single or dedicated lines and in
heterogeneous networks.
IAROR contributes to the development of new international standards for
railway capacity and traffic management by integration of
the state-of-the-art from different scientific disciplines as engineering,
mathematics, physics, economics and computer science. IAROR aims at
becoming the Network of Excellence in the field of railway operations
research and an acknowledged advisor to governments,
railway infrastructure managers, train operating companies and the
industrial suppliers with regard to the development and evaluation of
research programs, innovation strategies, directives and norms for railway
operations.

--------------------------------------------------------------------------
AIM AND SCIENTIFIC ISSUES
--------------------------------------------------------------------------


RailLille2017 is the 7th International Conference on Railway Operations
Modeling and Analysis. It will promote interdisciplinary discussions in
the railway operations research area by combining the expertise of
academics and professionals. RailLille2017 will give researchers and
practitioners the opportunity to meet, to present their latest research,
and to discuss current developments and applications. RailLille2017 solicits
contributions dealing with any aspect of railway planning and operation.
Typical, but not exclusive, topics of interest are:
- Land use, mobility and line planning
- Capacity and robustness in saturated networks
- Optimal network timetabling and maintenance schedules
- Passenger flows in stations, on platform, and dwell time distribution
- Impact of signaling and safety systems on capacity and punctuality
- Validation of stochastic analytical and simulation models
- Timetable stability, punctuality, temporal and spatial distributions of
timetable margins
- Impact of train priorities, dispatching rules and dedicated lines on
network capacity
- Scheduling and routing of passenger and freight trains
- Real-time rescheduling, disturbance and disruption management
- Energy-efficient driving and driver advisory systems
- Prediction of route conflicts, arrival and departure times
- Impact of climate change on future railway operation
- Governance, benchmark analysis and performance evaluation

--------------------------------------------------------------------------
ORGANIZATION COMMITTEE
--------------------------------------------------------------------------

N.Tomii (Chiba Institute of Technology)
I.A.Hansen (Delft University of Technology)
J.Rodriguez (IFSTTAR)
P.Pellegrini (IFSTTAR)
S.Dauzére-Pérès (École des Mines de Saint-Étienne)
D.De Almeida (SNCF - Research department)

--------------------------------------------------------------------------
SCIENTIFIC ADVISORY COMMITTEE
--------------------------------------------------------------------------


G.Abhyuday (Indian Railways)
T.Dick (University of Illinois at Urbana-Champaign)
R.Goverde (Delft University of Technology)
C.Mannino (SINTEF ICT)
A.Marin (Technical University of Madrid)
L.Nie (Beijing Jiaotong University)
A.Oetting (Technische Universität Darmstadt)
D.Pacciarelli (University Roma Tre)
J.Preston (University of Southampton)
S.Ricci (University of Rome "La Sapienza")
T.Schlechte (Zuse Institute Berlin and LBW GbR)
P.Vansteenwegen (University of Leuven)
A.Wardrop (TTG Transportation Technology)
T.White (Transit Safety Management)

--------------------------------------------------------------------------
ABSTRACT AND PAPER SUBMISSION
--------------------------------------------------------------------------

Prospective presenters of contributed papers should submit an extended
abstract emphasizing its innovativeness and relevance. The abstract should
contain a maximum of 1000 words (excluding list of key references). It has
to be uploaded onhttp://raillille2017.sciencesconf.org/user/submissions.
For the accepted abstracts, draft papers of a maximum length of 20 pages
are to be submitted to the same website. They shall be formatted in
accordance with the RailLille2017 templates available on the conference
website in the Submission p rocess page and also with the guidelines of
Journal of Rail Transport Planning & Management
(http://www.elsevier.com/journals/journal-of-rail-transport-planning-and-management/2210-9706/guide-for-authors).
The best papers will be eligible for publication in this journal.

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

March 10th 2017 End of early registration
March 21st 2017 End of online registration
April 4th 2017 Short courses
April 5th to 7th 2017 Conference

--------------------------------------------------------------------------
YOUNG RAILWAY OPERATIONS RESEARCH AWARD
--------------------------------------------------------------------------

Excellent papers on innovative research carried out and presented by
participants not older than 35 years are eligible for the YOUNG RAILWAY
OPERATIONS RESEARCH AWARD sponsored by the Board of IAROR. The Award is
worth € 2,500. Candidates are requested to register separately. The winner
will be announced at the end of the conference.

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

--
_____________________________________________

Dr. Thomas Schlechte

Dres. Loebel, Borndoerfer & Weider GbR
Obwaldener Zeile 19, 12205 Berlin, Germany
url: http://www.lbw-berlin.de
e-mail: schlechte@lbw-berlin.de

Zuse Institute Berlin
Takustrasse 7, 14195 Berlin-Dahlem, Germany
phone: +49-30 841 85 317
fax: +49-30 841 85 269
room: 3008
url: http://www.zib.de/schlechte
e-mail
: schlechte@zib.de
_____________________________________________

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

Thursday, February 16, 2017

[DMANET] Postdoctoral positions in Discrete and Computational Geometry in Israel (ERC Project CombiCompGeom)

Title: Postdoctoral positions in Discrete and Computational Geometry in
Israel (ERC Project CombiCompGeom)


Applicants are sought for postdoctoral positions in Discrete and
Computational Geometry in the group of Dr. Natan Rubin
<https://sites.google.com/site/natanrubinshomepage/> at the Computer
Science Department of Ben Gurion University of the Negev, Israel.
Exceptionally qualified candidacies for a PhD student position will also be
considered.

The positions are in connection with* ERC Starting Project "Combinatorial
Aspects of Computational Geometry" (CombiCompGeom), *supported by the *European
Research Council.* The prime topics of the project include (but are not
restricted to) combinatorial and algorithmic aspects of geometric
intersection graphs and hypergraphs, geometric transversals (inc. epsilon
nets), and Voronoi diagrams. Distinguished researchers are being hosted in
the framework of this project, and several international workshops will be
held.

We are looking for highly qualified candidates with a PhD degree, or
expecting to get one very soon, with particular emphasis on Discrete and
Computational Geometry. Exceptional candidates with an M. Sc. dissertation
in relevant areas of Mathematics and Theoretical Computer Science can also
be considered for a Ph.D. fellowship position.

The postdoctoral positions come with a competitive tax-free fellowship/nett
salary of (the equivalent of) ca. 3000 Euro, and an extensive academic
travel allowance. These positions are for at least 12 months, with a
possible extension; the start date is also flexible and can be negotiated.
There are no teaching obligations. (Candidates interested in a teaching
record can still deliver graduate level mini-courses/block courses.)

Applications will be considered until the positions are filled.
Applications, which include CV with a list of publications,a research
statement, and at least 2 letters of reference (at least 1 for the Phd
position), should be emailed to Dr. Natan Rubin rubinnat@cs.bgu.ac.il.


*About Ben-Gurion University: *BGU is to closely to the North of Beer-Sheva
-- the Southern metropolis of Israel, and is connected to Tel Aviv by a
direct railway (ca. 1 hour commute -- living in Tel Aviv metropolitan area
is a distinct possibility!) Apart from the PI, Discrete and Computational
Geometry is represented at BGU by Profs. Matya Katz, Shakhar Smorodinsky,
and Paz Carmi. Israel is home to numerous high-profile researchers in
Combinatorics, Optimization and Theoretical Computer Science.


Natan Rubin
Department of Computer Science
Ben-Gurion University of The Negev,
Beer-Sheva 84105
Israel
*email:* rubinnat@cs.bgu.ac.il
*webpage: *https://sites.google.com/site/natanrubinshomepage/

**********************************************************
*
* 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] Full Professor (W3) in Applied Mathematics at RWTH Aachen University

At RWTH Aachen University, we have an opening in the broad area of
applied mathematics, including discrete applied mathematics and
optimization:

The Faculty of Mathematics, Computer Science and Natural Science of RWTH
Aachen University invites applications for a

Full Professor (W3) in Applied Mathematics

We are seeking qualified applicants for teaching and research in this
area. The starting date is as soon as possible. Relevant research topics
include numerical analysis, partial differential equations, mathematical
foundation of signal processing, inverse problems and optimization.
Excellent applications from other areas of applied mathematics are
explicitly welcome. The profile of the successful applicant should
complement the
research themes within the department of mathematics and enable a
strengthening of interdisciplinary cooperations. A track record of
successful aquisition of third party funds is required. An adequate
participation in covering the teaching obligations of the department of
mathematics is part of the duties of this professorship

A Ph.D. degree is required; additionally, Habilitation (postdoctoral
lecturing qualification), an exemplary record of research achievement as
an assistant / an associate / a junior professor or university
researcher and/or an outstanding career outside academia are highly
desirable. Ability in and commitment to teaching are essential. The
application should include supporting documents regarding success in
teaching. German is not necessary to begin but will be expected as a
teaching language within the first 5 years.

Please send a cover letter stating research aims and a CV to:

Dekan der Fakultät für Mathematik, Informatik und Naturwissenschaften der
RWTH Aachen,
Stefan Schael,
52056 Aachen
Germany

You can also send your application via email to
dekan@fb1.rwth-aachen.de. Please note, however, that
communication via unencrypted e-mail poses a threat to confidentiality
as it is potentially vulnerable to unauthorized access by third parties.

The deadline for applications is March 31, 2017.

This position is also available as part-time employment per request.
RWTH Aachen University is certified as a family-friendly university and
offers a dual career program for partner hiring. We particularly welcome
and encourage applications from women, disabled people and ethnic
minority groups, recognizing they are underrepresented across RWTH
Aachen University. The principles of fair and open competition apply and
appointments will be made on merit.

This job opening can also be found
http://www.rwth-aachen.de/go/id/crfe/lidx/1

--

Prof. Dr. Arie M.C.A. Koster
RWTH Aachen University
Lehrstuhl II für Mathematik
Pontdriesch 10-12, 2.0G, Raum 307
D-52062 Aachen
E: koster@math2.rwth-aachen.de
W: http://www.math2.rwth-aachen.de/~koster/
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct)
F: +49 (0)241 80-92136

**********************************************************
*
* 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] IFORS 2017 streams on Data Science meets Optimisation, and also Hyperheuristics

Dear all,

A quick last-minute reminder of a few streams/sessions at IFORS
http://ifors2017.ca/ that could be of interest to anyone interested in
the overlap and intersections of statistics/machine learning (within
data science) and optimisation and metaheuristics.

Note, the conference talks place in Quebec City in Canada during July
17-21, 2017.

In particular, abstracts are welcome for work that either

- uses machine learning / statistics to improve optimisation techniques
using a variety of ideas that can appear under many different names
including adaptive or reactive search, hyper-heuristics, data analytics
for search, etc.

or

- uses advanced optimisation/search techniques such as mathematical
programming or heuristics/metaheuristics in order to increase the
performance of methods to solve machine-learning or statistics problems.


Note that the abstract submission process is very lightweight just
requiring a short abstract, not an extended abstract.

Please consider to submit an abstract to one of the following streams,
using the IFORS submission site: http://ifors2017.ca/submit-abstract

Stream: Data Science meets Optimisation Data Science meets Optimisation
At the IFORS website use the code 7eb193df

Stream: Hyperheuristics (which is intended to include any
general-method method to accelerate metaheuristics and not only the
specific meaning of hyperheuristics).
At the IFORS website use the code d47b063f

regards
Andrew


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] KaLP v1.0 -- Karlsruhe Longest Paths

Release of KaLP v1.00
------------------------------------

We are proud to announce the release our framework KaLP (Karlsruhe
Longest Paths) to compute longest paths in undirected weighted networks.
Our optimal algorithm for solving the longest path problem uses dynamic
programming based on partitions of the graph. Our implementation is
significantly faster than other state-of-the-art methods and can solve
more instances. Here we provide the implementation of the algorithm as
easy to use open source software.

The software is released under the GPL 3.0 License.

* open source implementation / website
http://algo2.iti.kit.edu/kalp

We are glad for any comments and error reports (or even bug fixes) that
you send us.

Tomas Balyo, Kai Fieger, and Christian Schulz
Karlsruhe Institute of Technology (KIT) and University of Vienna

**********************************************************
*
* 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] Graphical Models for Security (GraMSec 2017) - CFP

CALL FOR PAPERS - GraMSec 2017

The Fourth International Workshop on Graphical Models for Security
Santa Barbara, CA, USA - August 21, 2017

http://gramsec.uni.lu
Co-located with CSF 2017

SCOPE
Graphical security models provide an intuitive but systematic approach
to analyze security weaknesses of systems and to evaluate potential
protection measures. Cyber security researchers, as well as security
professionals from industry and government, have proposed various
graphical security modeling schemes. Such models are used to capture
different security facets (digital, physical, and social) and address a
range of challenges including vulnerability assessment, risk analysis,
defense analysis, automated defensing, secure services composition,
policy validation and verification. The objective of the GraMSec
workshop is to contribute to the development of well-founded graphical
security models, efficient algorithms for their analysis, as well as
methodologies for their practical usage.

TOPICS
The workshop seeks submissions from academia, industry, and government
presenting novel research on all theoretical and practical aspects of
graphical models for security. The topics of the workshop include, but
are not limited to:

• Graphical models for threat modeling and analysis
• Graphical models for risk analysis and management
• Graphical models for requirements analysis and management
• Textual and graphical representation for system, organizational, and
business security
• Visual security modeling and analysis of socio-technical and
cyber-physical systems
• Graphical security modeling for cyber situational awareness
• Graphical models supporting the security by design paradigm
• Methods for quantitative and qualitative analysis of graphical
security models
• Formal semantics and verification of graphical security models
• Methods for (semi-)automatic generation of graphical security models
• Enhancement and/or optimization of existing graphical security models
• Scalable evaluation of graphical security models
• Evaluation algorithms for graphical security models
• Dynamic update of graphical security models
• Game theoretical approaches to graphical security modeling
• Attack trees, attack graphs and their variants
• Stochastic Petri nets, Markov chains, and Bayesian networks for security
• UML-based models and other graphical modeling approaches for security
• Software tools for graphical security modeling and analysis
• Case studies and experience reports on the use of graphical security
modeling paradigm

INVITED SPEAKER
To be decided.

PAPER SUBMISSION
We solicit two types of submissions:
• Regular papers (up to 15 pages, excluding the bibliography and
well-marked appendices)
describing original and unpublished work within the scope of the workshop.
• Short papers (up to 7 pages, excluding the bibliography and
well-marked appendices)
describing original and unpublished work in progress.

The reviewers are not required to read the appendices, so the papers
should be intelligible without them. All submissions must be prepared
using the LNCS style:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0

Each paper will undergo a thorough review process. All accepted (regular
and short) papers will be included in the workshop's post-proceedings.
As the previous two years, the GraMSec 2017 post-proceedings are planned
to be published in the Lecture Notes in Computer Science (LNCS) series
of Springer (confirmation pending). Submissions should be made using the
GraMSec 2017 EasyChair web site:
https://www.easychair.org/conferences/?conf=gramsec17

IMPORTANT DATES
• Submission deadline: Sunday, May 21, 2017
• Acceptance notification: Friday, July 7, 2017
• Workshop: Monday, August 21, 2017

GENERAL CHAIR
• Sjouke Mauw, University of Luxembourg, Luxembourg

PROGRAM CHAIRS
• Peng Liu, Pennsylvania State University, USA
• Ketil Stølen, SINTEF Digital and University of Oslo, Norway

PC MEMBERS
Mathieu Acher, University Rennes 1, Inria, France
Massimiliano Albanese, George Mason University, USA
Ludovic Apvrille, Télécom ParisTech, France
Thomas Bauereiss, DFKI, Germany
Kristian Beckers, Technical University of Munich, Germany
Giampaolo Bella, University of Catania, Italy
Stefano Bistarelli, Università di Perugia, Italy
Marc Bouissou, EDF RD, France
Frédéric Cuppens, Télécom Bretagne, France
Nora Cuppens-Boulahia, Télécom Bretagne, France
Binbin Chen, Advanced Digital Sciences Center, Singapore
Hervé Debar, Télécom SudParis, France
Harley Eades, Augusta University, USA
Mathias Ekstedt, KTH - Royal Institute of Technology, Sweden

Ulrik Franke, Swedish Institute of Computer Science - SICS, Sweden
Frank Fransen, TNO, The Netherlands
Olga Gadyatskaya, University of Luxembourg, Luxembourg
Paolo Giorgini, University of Trento, Italy
Dieter Gollmann, Hamburg University of Technology, Germany
Joshua Guttman, WPI, USA
René Rydhof Hansen, Aalborg University, Denmark
Maritta Heisel, Universität Duisburg-Essen, Germany
Hannes Holm, Swedish Defence Research Agency, Sweden
Siv Hilde Houmb, Secure-NOK AS, Norway
Sushil Jajodia, George Mason University, USA
Ravi Jhawar, University of Luxembourg, Luxembourg
Henk Jonkers, BiZZdesign, The Netherlands
Cristian Johansen, University of Oslo, Norway
Florian Kammueller, Middlesex University London, UK
Nima Khakzad, TU Delft, The Netherlands
Dong Seong Kim, University of Canterbury, New Zealand
Barbara Kordy, INSA Rennes, IRISA, France
Pascal Lafourcade, Université Clermont Auvergne, LIMOS, France
Jean-Louis Lanet, Inria, France
Per Håkon Meland, SINTEF Digital, Norway
Jogesh Muppala, HKUST, Hong Kong, SAR China
Simin Nadjm-Tehrani, Linköping University, Sweden
Andreas L. Opdahl, University of Bergen, Norway
Xinming Ou, University of South Florida, USA
Stéphane Paul, Thales Research and Technology, France
Wolter Pieters, TU Delft, The Netherlands
Ludovic Piètre-Cambacédès, EDF, FR
Sophie Pinchinat, University Rennes 1, IRISA, France
Vincenzo Piuri, University of Milan, Italy
Marc Pouly, Lucerne University of Applied Sciences and Arts, Switzerland
Nicolas Prigent, Supélec, France
Christian W. Probst, Technical University of Denmark, Denmark
David Pym, UCL, UK
Saša Radomirovic, University of Dundee, UK
Indrajit Ray, Colorado State University, USA
Arend Rensink, University of Twente, The Netherlands
Yves Roudier, Université Côte d'Azur, CNRS, I3S, UNS, France
Guttorm Sindre, NUST, Norway
Mariëlle Stoelinga, University of Twente, The Netherlands
Xiaoyan Sun, California State University, USA
Axel Tanner, IBM Research - Zurich, Switzerland
Alexandre Vernotte, KTH - Royal Institute of Technology, Sweden
Luca Viganò, King's College London, UK
Lingyu Wang, Concordia University, Canada
Jan Willemson, Cybernetica, Estonia

CONTACT
For inquiries please send an e-mail to gramsec17@easychair.org

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

[DMANET] 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

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

Wednesday, February 15, 2017

[DMANET] CSR 2017: Accepted Papers

CSR 2017 Accepted Papers

Gilad Kutiel. Approximation Algorithms for the Maximum Carpool Matching Problem
Viliam Geffert. Capturing PSPACE in Unary ASPACE(loglog n)
Piotr Wojciechowski, R. Chandrasekaran and K. Subramani. On a generalization of Horn constraint systems
Dietrich Kuske and Chris Köcher. The transformation monoid of a partially lossy queue
Alexandr Seliverstov. On probabilistic algorithm for solving almost all instances of the set partition problem
Mozhgan Pourmoradnasseri and Dirk Oliver Theis. The (minimum) rank of typical fooling-set matrices
Cornelius Brand and Marc Roth. Parameterized counting of trees, forests and matroid bases
Meghana Nasre and Amit Rawat. Popularity in the generalized Hospital Residents setting
Marie-Pierre Béal and Pavel Heller. Generalized Dyck shifts
Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas Iliopoulos and Jakub Radoszewski. Palindromic Decompositions with Gaps and Errors
Maxim Babenko, Ignat Kolesnichenko and Ivan Smirnov. Cascade Heaps: Towards Time-Optimal Extractions
Kamil Khadiev and Aliya Khadieva. Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
Alexey Milovanov. On Algorithmic Statistics for space-bounded algorithms
Olivier Bodini, Matthieu Dien, Antoine Genitrini and Frederic Peschanski. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets (extended abstract)
Alexei Miasnikov, Svetla Vassileva and Armin Weiss. The conjugacy problem in free solvable groups and wreath products of abelian groups is in TC^0
Lukas Fleischer and Manfred Kufleitner. Green's Relations in Finite Transformation Semigroups
Oleg Verbitsky and Maksim Zhukovskii. The Descriptive Complexity of Subgraph Isomorphism without Numerics
Elena Khramtcova and Maarten Loeffler. Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
Dmitry Sokolov. Dag-like Communication and Its Applications
Alexander Okhotin and Kai Salomaa. Edit distance neighbourhoods of input-driven pushdown automata
Aida Gainutdinova and Abuzer Yakaryilmaz. Nondeterministic unitary OBDDs
Michael Hochman and Pascal Vanier. Turing degree spectra of minimal subshifts

**********************************************************
*
* 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 14, 2017

[DMANET] PhD positions in Mathematics at LSE

PhD positions in Mathematics at LSE (the London School of Economics and
Political Science)

The Department of Mathematics at LSE has openings for PhD students,
including in the areas of Discrete Mathematics, Operations Research and
Analytics, and Game Theory. We are seeking exceptionally talented and
motivated students with a strong mathematical background and interest in
combinatorics, discrete random structures, mathematical foundations of
operations research, discrete optimisation, algorithms, mathematical and
algorithmic game theory, and related areas.

For further information about the PhD programme, application procedures,
and faculty please see
http://www.lse.ac.uk/maths/Degrees/PhD_and_MPhil.aspx

Applicants will automatically be considered for LSE funding covering
fees and paying GBP 18,000/year (approximately EUR 21,000 or USD 22,000)
for up to 4 years. The award of these scholarships is competitive, based
on academic performance (typically in an MSc or equivalent) and
suitability of the proposed research. The second (and last) application
deadline for funding is 26 April 2017.

Prospective applicants are encouraged to contact the following
department faculty members, well in advance of the deadline, to discuss
their qualifications and research interests before submitting a formal
application:
Discrete Mathematics: Prof Graham Brightwell <G.R.Brightwell@lse.ac.uk>
Operations Research: Prof Gregory Sorkin <g.b.sorkin@lse.ac.uk>
Game Theory: Prof Bernhard von Stengel <stengel@nash.lse.ac.uk>
It is fine if you wish to write to several of us, but then please do so
in a single email.


**********************************************************
*
* 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] Call for Entries for 2017 Human-Competitive Awards at GECCO conference

Call For Entries
for 14th Annual (2017) "Humies" Awards
for Human-Competitive Results
Produced by Genetic and Evolutionary Computation
www.human-competitive.org

To be Held at
Genetic and Evolutionary Computation Conference (GECCO)
July 15-19, 2017 (Saturday-Wednesday)
Berlin
http://gecco-2017.sigevo.org/

Entries are hereby solicited for awards totaling $10,000 for
human-competitive results that have been produced by any form of genetic
and evolutionary computation (including, but not limited to genetic
algorithms, genetic programming, evolution strategies, evolutionary
programming, learning classifier systems, grammatical evolution, gene
expression programming, differential evolution, etc.) and that have been
published in the open literature between the deadline for the previous
competition and the deadline for the current competition.

The competition will be held as part of the Genetic and Evolutionary
Computation (GECCO) conference operated by the Association for
Computing Machinery (ACM) Special Interest Group (SIG) on Genetic and
Evolutionary Computation (SIGEVO). Entries chosen to be finalists will
be made at the conference. The winners of the awards will be announced
during the conference.

IMPORTANT DATES:
• Wednesday June 7, 2017 — Deadline for entries (consisting of one TEXT
file and one or more PDF files). Send entries to koza at
human-competitive dot org

• Wednesday June 21, 2017 — Finalists will be notified by e-mail

• Wednesday July 5, 2017 — Finalists must submit their presentation
(e.g., PowerPoint, PDF) for posting on the competition's web site. Send
presentations to koza at human-competitive dot org

• July 15-19, 2017 (Saturday-Wednesday) — The GECCO conference

• Monday July 17, 2017 (VERY TENTATIVE) — Presentations before judging
committee at public session of the GECCO conference. Finalists should
make a point of checking for the time and date in the conference's final
schedule.

• Wednesday July 19, 2017 (TENTATIVE) — Announcement of awards at
plenary session of the GECCO conference

JUDGING COMMITTEE
• Erik Goodman
• Una-May O'Reilly
• Wolfgang Banzhaf
• Darrell Whitley
• Lee Spector

CALL FOR ENTRIES
Techniques of genetic and evolutionary computation are being
increasingly applied to difficult real-world problems — often yielding
results that are not merely academically interesting, but competitive
with the work done by creative and inventive humans. Starting at the
Genetic and Evolutionary Computation Conference (GECCO) in 2004, cash
prizes have been awarded for human-competitive results that had been
produced by some form of genetic and evolutionary computation in the
previous year.

This prize competition is based on published results. The publication
may be a paper at the GECCO conference (i.e., regular paper, poster
paper, or any other full-length paper), a paper published anywhere in
the open literature (e.g., another conference, journal, technical
report, thesis, book chapter, book), or a paper in final form that has
been unconditionally accepted by a publication and is "in press" (that
is, the entry must be identical to something that will be published
imminently without any further changes). The publication may not be an
intermediate or draft version that is still subject to change or
revision by the authors or editors. The publication must meet the usual
standards of a scientific publication in that it must clearly describe a
problem, the methods used to address the problem, the results obtained,
and sufficient information about how the work was done in order to
enable the work described to be independently replicated.

An automatically created result is considered "human-competitive" if it
satisfies at least one of the eight criteria below.

(A) The result was patented as an invention in the past, is an
improvement over a patented invention, or would qualify today as a
patentable new invention.

(B) The result is equal to or better than a result that was accepted as
a new scientific result at the time when it was published in a
peer-reviewed scientific journal.

(C) The result is equal to or better than a result that was placed into
a database or archive of results maintained by an internationally
recognized panel of scientific experts.

(D) The result is publishable in its own right as a new scientific
result independent of the fact that the result was mechanically created.

(E) The result is equal to or better than the most recent human-created
solution to a long-standing problem for which there has been a
succession of increasingly better human-created solutions.

(F) The result is equal to or better than a result that was considered
an achievement in its field at the time it was first discovered.

(G) The result solves a problem of indisputable difficulty in its field.

(H) The result holds its own or wins a regulated competition involving
human contestants (in the form of either live human players or
human-written computer programs).

Contestants should note that a pervasive thread in most of the above
eight criteria is the notion that the result satisfy an "arms length"
standard — not a yardstick based on the opinion of the author, the
author's own institution (educational or corporate), or the author's own
close associates. "Arms length" may be established in numerous ways. For
example, if the result is a solution to "a long-standing problem for
which there has been a succession of increasingly better human-created
solutions," it is clear that the scientific community (not the author,
the author's own institution, or the author's close associates) have
vetted the significance of the problem. Similarly, a problem's
significance may be established if the result replicates or improves
upon a scientific result published in a peer-reviewed scientific
journal, replicates or improves upon a previously patented invention,
constitutes a patentable new invention, or replicates or improves a
result that was considered an achievement in its field at the time it
was first discovered. Similarly, a problem's significance may be
established if the result holds its own or wins a regulated competition
involving live human players or human-written computer programs. In each
of the foregoing examples, the standard for human-competitiveness is
being established external to the author, the author's own institution,
or the author's close associates. It is also conceivable to rely only on
criterion G ("The result solves a problem of indisputable difficulty in
its field"); however, if only criterion G is claimed, there must be a
clear and convincing argument that the problem's "difficulty" is indeed
"indisputable."

The competition will be held as part of the annual Genetic and
Evolutionary Computation (GECCO) conference. Entries chosen to be
finalists are to be made at the conference. The awards and prizes will
be announced at the conference.

Cash prizes of $5,000 (gold), $3,000 (silver), and bronze (either one
prize of $2,000 or two prizes of $1,000) will be awarded for the best
entries that satisfy one or more of the criteria for
human-competitiveness. The awards will be divided equally among
co-authors unless the authors specify a different division at the time
of submission. Prizes are paid by check in U.S. dollars after the GECCO
conference. The judges may, based on submissions, rearrange the prize
amounts and prize categories within the total amount available for prizes.

DETAILED INSTRUCTIONS FOR ENTERING THE "HUMIES"

If you plan to make an entry into this competition, please check the web
site at www.human-competitive.org for updated information and for
possible changes immediately prior to submitting your entry.

If you make an entry, please re-check the web site prior to the
conference for possible changes in the instructions or the schedule.

All entries are to be sent electronically to koza at human-competitive
dot org. All entries will be promptly acknowledged, so please make an
inquiry if you do not receive a reasonably prompt acknowledgment shortly
after your submission.

An entry must consist of one TEXT file and one or more PDF files. If the
same authors are making multiple entries, please submit separate
e-mails, each containing the required TEXT file and PDF file(s)
supporting the entry.

The TEXT file must contain the following 10 items. Please be very
careful to include ALL required information. Contestants are alerted to
the fact that items 6 and 9 are especially important and will be the
main basis by which entries will be judged. The papers and presentations
from earlier competitions (starting in 2004) are posted at the
competition web site at www.human-competitive.org. These previous
entries may be informative and helpful in crafting your entry.

1. the complete title of one (or more) paper(s) published in the open
literature describing the work that the author claims describes a
human-competitive result;

2. the name, complete physical mailing address, e-mail address, and
phone number of EACH author of EACH paper(s);

3. the name of the corresponding author (i.e., the author to whom
notices will be sent concerning the competition);

4. the abstract of the paper(s);

5. a list containing one or more of the eight letters (A, B, C, D, E, F,
G, or H) that correspond to the criteria (see above) that the author
claims that the work satisfies;

6. a statement stating why the result satisfies the criteria that the
contestant claims (see examples of statements of human-competitiveness
as a guide to aid in constructing this part of the submission);

7. a full citation of the paper (that is, author names; publication
date; name of journal, conference, technical report, thesis, book, or
book chapter; name of editors, if applicable, of the journal or edited
book; publisher name; publisher city; page numbers, if applicable);

8. a statement either that "any prize money, if any, is to be divided
equally among the co-authors" OR a specific percentage breakdown as to
how the prize money, if any, is to be divided among the co-authors;

9. a statement stating why the authors expect that their entry would be
the "best," and

10. An indication of the general type of genetic or evolutionary
computation used, such as GA (genetic algorithms), GP (genetic
programming), ES (evolution strategies), EP (evolutionary programming),
LCS (learning classifier systems), GE (grammatical evolution), GEP (gene
expression programming), DE (differential evolution), etc.

The PDF file(s) are to contain the paper(s). The strongly preferred
method is that you send a separate PDF file for each of your paper(s)
relating to your entry. Both the text file and the PDF file(s) for each
entry will be permanently posted on a web page shortly after the
deadline date for entries (for use by the judges, conference attendees,
and anyone else who is interested) and will remain posted on the web as
a permanent record of the competition. If your paper is only available
on the publisher's web site and your publisher specifically requires
that your published paper may appear only on your own personal page, the
second choice is that you send link(s) to a separate web page on your
web site containing link(s) to the PDF file(s) of the paper(s) that
constitute your entry. This separate web page is to contain nothing
else, so the interested parties may quickly locate your paper(s). If you
use this second-choice option, you must ALSO supply a link to a
permanent web site maintained by your publisher where your specific
paper may be viewed or purchased (that is, not a link merely to the
publisher's general home page, but a link to the specific web page
containing your paper on the publisher's site). The objective, in each
case, is to provide a permanent record of the entries and to make it
easy for anyone to locate your material.

Generally, only one paper should be submitted. Note that this is a
competition involving a result that satisfies the criteria for being
human-competitive (not a competition involving an evaluation of the
author's entire body of work). More than one paper should be submitted
only if no single paper fully describes the specific result or method.

The judging committee will review all entries and identify a short list
for presentation at the GECCO conference. Finalists will be notified by
an e-mail to the corresponding author. Please acknowledge receipt of
this message, so the judges know that you received your notice.
Finalists must then make a short oral presentation to the judging
committee at a public session of the GECCO conference. The presentations
will be held on one of the early days of the conference, and the winners
will be announced a day or two later at the conference.

Finalists must submit their presentation (e.g., a PowerPoint, PDF) by
e-mail to koza at human-competitive dot org. All submissions will be
promptly acknowledged, so please make an inquiry if you do not receive a
reasonably prompt acknowledgment. These presentations will be posted on
the web page for the competition.

At the GECCO conference, there will be 10-minute oral presentations by
the finalists to the judging committee. The presentations will be open
to all conference attendees at a special session of the conference. The
oral presentation should primarily focus on

1. why the result qualifies as being human-competitive and

2. why the judges should consider the entry as "best" in comparison to
other entries that may also be "human-competitive" (because, as
previously mentioned, these are the two main standards by which entries
will be judged by the judges).

In the short oral presentation to the judges, a description of the work
itself is decidedly secondary. By the time of the presentation the
judges will be familiar with the papers. Thus, the focus of the
presentation is on reasons why the work being presented should win a prize
— not an explanation or presentation of the work itself.

In the unlikely event that a presenter is scheduled to make a
presentation elsewhere at the GECCO conference at the same time, please
notify the judging committee, so they can rearrange time slots.

After the oral presentations, the award committee will meet and consider
the presentations.

The presenting author for each entry must register for the GECCO conference.

A judge will recuse himself or herself if he or she is closely
associated with a finalist (e.g., a current academic advisor, current
collaborator, co-author with the finalist of related work).

Additional information is at www.human-competitive.org

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 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/
*
**********************************************************

Monday, February 13, 2017

[DMANET] Postdoctoral position in distributed algorithms at University of Houston

The Algorithms and Distributed Computing group in the Department of
Computer Science at the University of Houston is looking to fill a postdoc
position starting in Fall 2017.
We are currently working on distributed algorithms, large-scale data
computation, and communication networks.
Please see https://sites.google.com/site/gopalpandurangan/papers-by-date for
a list of our recent publications to get an idea of our recent research.
Recent Ph.Ds or those expected to finish soon are encouraged to apply.
Expertise in distributed/parallel algorithms, network/graph algorithms,
randomization/probabilistic analysis, information theory/statistics etc.
will be a plus.

If interested, please contact Gopal Pandurangan (gopalpandurangan@gmail.com).
We require your CV, publication list, a short statement describing your
research interests, and a list of at least 2 research references.


--
Gopal Pandurangan
http://www.cs.uh.edu/~gopal

**********************************************************
*
* 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] INTECH 2017 - Co-located event

Call for Papers

Seventh International Conference on Innovative Computing Technology
(INTECH 2017)
Porto, Portugal
(Satellite event-co-located with INTECH 2017)
July 12-13, 2017
(www.dirf.org/intechporto)


The INTECH 2017 (seventh edition- satellite event) will be held at
Porto, Portugal during July 12-13, 2017 and it offers the opportunity
for institutes, research centers, engineers, scientists and industrial
companies to share their latest investigations, researches, developments
and ideas in area of Innovative Computing Technology, which covers huge
topics.

The INTECH intends to address various innovative computing techniques
involving various applications. This forum will address a large number
of themes and issues. The conference will feature original research and
industrial papers on the theory, design and implementation of computing
technologies, as well as demonstrations, tutorials, workshops and
industrial presentations. This conference (INTECH 2017) will include
presentations of contributed papers by invited keynote speakers.

Conference papers will include innovative computing paradigms in the
following topics:

Network and Information Security Innovative Computing Systems and
Applications in S & T domains such as –
Algorithms Applied Information Systems
Artificial Intelligence and Decision Support Systems
Broadcasting Technology
Cloud Computing
Computational Intelligence
Data and Network mining
Data Stream Processing in Mobile/Sensor Networks
Database Systems
Digital Image/Video Processing
E-Learning, e-Commerce, e-Business and e-Government
Electronics Environmental modeling and precision agriculture
Fault Classification and Pattern Recognition
Green Computing
Grid computing
Human-Computer Interaction
Intelligent Condition
Monitoring Mobile network and systems
Multimedia and Interactive Multimedia Payment Systems
Peer-to-peer social networks
Precision Farming Web Farming Signal Processing Soft Computing: Fuzzy
and Neural Network Systems, optimization algorithms Software Engineering
Intelligent Farming: Web farming, Web irrigation Ubiquitous Computing
User Interfaces,
Visualization and Modeling
Virtual Reality Visualization
Web services
WWW Applications and Technologies
XML and other Extensible Languages
The INTECH proceedings will also be indexed by dblp. All the papers will
be reviewed and the accepted papers in the conference will be submitted
to IEEE Xplore for indexing and will be indexed in many global
databases.In addition, all the accepted papers (for Journals) will be
published in the following special issues journals after substantial
revision and modification.

In addition, selected papers after complete modification and revision
will be published in the following special issues of journals.

Journal of Digital Information Management (JDIM) (Scopus and EI Indexed)
International Journal of Enterprise Information Systems (Scopus and EI
Indexed)
International Journal of Grid and High Performance Computing (IJGHPC)
(Scopus and EI Indexed)
International Journal of Computational Science and Engineering (Scopus
and EI Indexed)
International Journal of Big Data Intelligence
International Journal of Applied Decision Sciences (Scopus/EI)
International Journal of Management and Decision Making (Scopus/EI)
International Journal of Strategic Decision Sciences
International Journal of Enterprise Information Systems (Scopus/EI)
Recent Advances in Electrical & Electronic Engineering (Scopus)

Programme Committees

General Chairs

Ezendu Ariwa, UK IEEE, UK
Paulino Silva, Instituto Superior de Contabilidade e Administraç?o do
Porto,Portugal

Program Chairs

Anabela Mesquita, Instituto Superior de Contabilidade e Administraç?o do
Porto, Portugal
Paula Peres, Instituto Superior de Contabilidade e Administraç?o do
Porto, Portugal
Rui Bertuzi, Instituto Superior de Contabilidade e Administraç?o do
Porto, Portugal

IMPORTANT DATES

Submission of papers: May 01, 2017
Notification of Acceptance/Rejection: June 01, 2017
Camera Ready: July 01, 2017
Registration July 01, 2017
Conference: July 12-13, 2017

Paper submission at http://www.dirf.org/intech/paper-submission/
Contact: intech@dirf.org OR intech@socio.org.uk
--------------------------------------------------------------


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

[DMANET] Call for Nominations: Prize for Innovation in Distributed Computing 2018 (SIROCCO)

*******************************************
Call for Prize Nominations:

Prize for Innovation in Distributed Computing 2018
------------------------------------------------------

Awarded by the Colloquium on Structural Information and Communication
Complexity (SIROCCO).

Deadline for nominations: April 30, 2017.

Nominations are requested for the Prize for Innovation In Distributed
Computing. This prize was established to recognize individuals whose
research contributions expanded the collective investigative horizon in
SIROCCO's area of interest. That is, they formulated new problems, or
identified new research areas, that were at the time of their
introduction, unorthodox and outside the mainstream, but later attracted
the interest of the SIROCCO community.

This community is interested in the relationships between information
and efficiency in decentralized computing. The prize recognizes
originality, innovation, and creativity -- the qualities that reflect
the spirit of the SIROCCO conference.

The winner of the Prize for Innovation in Distributed Computing 2018 is
expected to give an invited talk at SIROCCO 2018. The winner of the 2017
edition of the prize (Shmuel Zaks) will give a talk at SIROCCO
2017 which is going to be held on June 19-22, Porquerolles, France.

Past prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
Roger Wattenhofer, Andrzej Pelc, Pierre Fraigniaud, Michel Raynal,
Masafumi Yamashita, and Shmuel Zaks.

The prize may not necessarily be awarded every year.


Eligibility
------------------------------------------------------

The following conditions must be met by the nominees to be eligible for
the prize. It is requested that a nomination letter explains and
demonstrates how the nominee matches these conditions.

(1) The original innovative contribution was introduced by the
nominee(s) for the first time in a publication at least five years
before the nomination deadline, and the publication must have appeared
in a conference proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the
original paper, or a paper closely related to the innovative
contribution, must have appeared in a SIROCCO proceedings.

A nomination letter should identify the paper(s) that make(s) the
nominee eligible according to conditions (1) and (2) above, as well as
explain the contribution, its originality, and its significance.

Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or
http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.


Selection process
------------------------------------------------------

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference, the PC
chairs, including co-chairs, of the three SIROCCO conferences
immediately preceding the nominations deadline, plus one additional
member of the Advisory Board, or one past winner, selected by the
Steering Committee for the current year.

The Award Committee of the Prize for Innovation in Distributed Computing
2018 consists of: Magnús Halldórsson (Reykjavik University),
Andrzej Pelc - chair (Université du Québec en Outaouais), Christian
Scheideler (University of Paderborn), Paul Spirakis (University of
Liverpool),
Jukka Suomela (Aalto University).

Nominations can be made by any member of the scientific community.

DEADLINE : The deadline for nominations is April 30, 2017.
Please send the nomination to the prize committee chair, Andrzej Pelc,
by e-mail pelc@uqo.ca

Please write SIROCCO Prize Nomination IN THE SUBJECT LINE.

Please help in recognizing the contributions of members of our community.

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

--
------------------
Shantanu DAS
Associate Professor,
Laboratoire d'Informatique Fondamentale (LIF),
Aix-Marseille 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/
*
**********************************************************

Friday, February 10, 2017

[DMANET] Courses in stochastic modelling and simulation

Registration is now open for the 2017 NATCOR courses in Stochastic Modelling, Simulation and Combinatorial Optimisation.

These courses are intended for PhD students or junior researchers working in operational research or related fields,
such as statistics, applied probability, quantitative finance, industrial engineering and computer science.

For more information please consult our website (http://www.natcor.ac.uk).

Professor Adam N. Letchford
NATCOR Director
Lancaster University
United Kingdom

**********************************************************
*
* 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] 7th PhD Summer School in Discrete Mathematics

Dear Colleagues,

We are happy to announce the "7th PhD Summer School in Discrete
Mathematics" to be held on Mt. Rogla, Slovenia, July 23 -- July 29, 2017.

Summer School consist of two mini-courses (10 hours each):

1. Theory of pseudo-Boolean functions and binary optimization
Lecturer: Endre Boros, MSIS and RUTCOR, Rutgers University, New Jersey, USA

2. A hundred years of Graph theory
Lecturer: Robin Wilson, Open University, London, UK

Beside the two mini-courses, there will also be several invited speakers.

Confirmed invited speakers:

- Marston Conder (University of Auckland, New Zealand)
- Joy Morris (University of Lethbridge, Canada)
- Mikhail Muzychuk (Netanya Academic College, Israel)

The number of participants is limited, so please register as
soon as possible. The registration form together with other relevant
information (overview of the mini-courses, accommodation, traveling
information, mode of payment, instructions for students etc.) is available
at

https://conferences.famnit.upr.si/event/2/

Financial support including half-board and the exemption from conference
fee payment is offered to PhD-students.
Deadline for the financial support application is February 28th, 2017.

According to regulations and in view of the amount of work designed for
these courses, the Summer School is credited with 2 ECTS. In order to
collect the assigned credit points, the student must solve a certain number
of problems and tasks, as required by the lecturer.

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

Best regards,

The Scientific Committee of 7th PhD Summer School in Discrete Mathematics:
Scientific Committee:
Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic,
Tomaz Pisanski, Primoz Sparl, Boris Zgrablic

The Organizing Committee of 7th PhD Summer School in Discrete Mathematics:
Bostjan Frelih, Ademir Hujdurovic, Bostjan Kuzman, Rok Pozar

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

[DMANET] Workshop on Deep Learning and Music (Anchorage) - 2nd Call for papers/abstracts

International Workshop on Deep Learning for Music

In conjunction with the 2017 International Joint Conference on Neural
Networks

(IJCNN 2017))

14-19 May (1 day), Anchorage

More info <http://dorienherremans.com/dlm2017/>

There has been tremendous interest in deep learning across many fields of
study. Recently, these techniques have gained popularity in the field of
music. Projects such as Magenta (Google's Brain Team's music generation
project), Jukedeck and others testify to their potential.

While humans can rely on their intuitive understanding of musical patterns
and the relationships between them, it remains a challenging task for
computers to capture and quantify musical structures. Recently, researchers
have attempted to use deep learning models to learn features and
relationships that allow us to accomplish tasks in music transcription,
audio feature extraction, emotion recognition, music recommendation, and
automated music generation.

With this workshop we aim to advance the state-of-the-art in machine
intelligence for music by bringing together researchers in the field of
music and deep learning. This will enable us to critically review and
discuss cutting-edge-research so as to identify grand challenges, effective
methodologies, and potential new applications.


Topics

Papers and abstracts on the application of deep learning techniques on
music are welcomed, including but not limited to:

-

Deep learning applications for computational music research
-

Modeling hierarchical and long term music structures using deep learning
-

Modeling ambiguity and preference in music
-

Software frameworks and tools for deep learning in music

More info <http://dorienherremans.com/dlm2017/>

Invited speakers

Invited speakers include Dr. Oriol Nieto (*Pandora*), Prof. Dr. Douglas Eck
(the Head of the *Google* Magenta team) (tentatively confirmed), and Dr.
Kat Agres (*A*STAR* Institute of High Performance Computing).


Submissions of Papers

Papers of up to 5 pages using the following template are welcomed for a
talk. Submissions will be evaluated according to their originality,
technical soundness, and relevance to the workshop. The guidelines outlined
in the workshop's latex template
<http://dorienherremans.com/dlm2017/dlm17template.zip> should be followed.
Contributions should be in PDF format and submitted to
d.herremans@qmul.ac.uk with the subject line: [DLM17 paper
submission]. Submissions
do not need to be anonymised. Papers will be peer-reviewed and published in
the proceedings of the workshop.


Submissions of Abstracts

Structured abstracts of max 2 pages can be submitted for a shorter talk.
The abstracts should follow the same template as the papers and will be
included in the proceedings. Abstracts should be in PDF format and
submitted to d.herremans@qmul.ac.uk with the subject line: [DLM17 abstract
submission]. Abstracts will be peer-reviewed and included in the
proceedings of the workshop.


Special Issue in Journal

Authors will be invited to submit a full paper version of their extended
abstract for a special issue in an indexed journal (such as Journal of New
Music Research or IEEE Transactions on Neural Networks (btc)). More details
on this will be available soon.


Important Dates

Paper Submission Deadline: February 28th

Acceptance Notification: March 12th

Final versions due: March 23, 2017

Workshop Date: one day during conference May 14-19, 2017

Registration

Workshop registration will be handled by the main conference, please check
IJCNN for more details.

Organizers

Dorien Herremans (Queen Mary University of London, UK)

Ching-Hua Chuan (University of North-Florida, US)

Programme Committee

Dorien Herremans (Queen Mary University of London, UK)

Ching-Hua Chuan (University of North-Florida, US)

Louis Bigo (Université Lille 3, France)

Maarten Grachten (Austrian Research Institute for Artificial Intelligence,
Austria)

Sebastian Stober (University of Potsdam, Germany)

More info
<http://dorienherremans.com/dlm2017/>

<http://dorienherremans.com/dlm2017/>


--
Dorien Herremans, PhD
Marie-Curie Fellow
http://dorienherremans.com

Queen Mary University of London
School of Electronic Engineering and Computer Science
C4DM - Centre for Digital Music, London

Workshop on Deep Learning and Music <http://dorienherremans.com/dlm2017>,
May'17 Anchorage, Alaska.

**********************************************************
*
* 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 9, 2017

[DMANET] 9th Applied OR Conference - ICAOR - Milan 28-30.06.17

9th Applied Operational Research Conference - ICAOR 2017
June, 28th-30th 2017, Milan, Italy
http://orlabanalytics.ca/icaor.htm

The ICAOR conference is an annual forum bringing together
academics and
practitioners from around the world to discuss the most
recent developments in
applied operational research and management science. We
invite you to join
your colleagues for this international meeting.

The conference covers all aspects of OR/MS with particular
emphasis on
applications, including, but not limited to:
- Agriculture and Fisheries
- Data Mining and Forecasting
- Decision Analysis and Optimization
- Defense and Military
- Education, Government and Sports
- Energy, Natural Resources and Environment
- Financial and Business Applications
- Graphs, Networks and Location
- Health and Social Services
- Manufacturing, Maintenance and Services
- Quality, Statistics and Reliability
- Supply Chain Management and Logistics
- Telecommunications and Information Science
- Timetabling, Scheduling and Queuing
- Transportation and Traffic

Thematic workshops are also organized within the
conference
http://orlabanalytics.ca/workshops.htm

KEYNOTE SPEAKERS
================

Prof Daniele Vigo, DEI - University of Bologna, Italy and
Optit srl Imola
(BO), Italy
"Optimization of Design and Operations of District Heating
and Cooling
Networks"

Prof Marco Zaffalon, Dalle Molle Institute for Artificial
Intelligence, IDSIA,
Switzerland
"Harnessing the Twine of Robust Probability and
Optimisation for Theory and
Applications"

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

15-Jan-2017 - Submission opens
28-Feb-2017 - Paper submission deadline
01-Apr-2017 - Notification of decisions
15-Apr-2017 - Registration deadline
25-Apr-2017 - Final manuscript submissions
28-Jun-2017 - Conference starts

PAPER SUBMISSION
===============

The conference will only accept for review and
presentation papers that
contain original material, which neither has been
previously published nor is
current under review by other conferences or journals.
- Manuscripts should be submitted in PDF (*.pdf) and not
more than 8 pages
either as full paper or extended abstract.
- Format for the articles: a template is provided at
http://orlabanalytics.ca/icaor/submission.htm

POST-CONFERENCE PUBLICATION
===========================

Authors of selected accepted papers will be invited to
submit an extended
version of their contributions Lecture Notes in Management
Science
http://orlabanalytics.ca/lnms.htm
**********************************************************
*
* 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] SAGT 2017 -- Preliminary Call for Papers

SAGT 2017 - Preliminary Call for Papers


10th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
SAGT 2017
http://cs.gssi.infn.it/sagt2017
L'Aquila, Italy, Sep. 12-14, 2017

IMPORTANT DATES

- Submission: April 21, 2017.
- Notification: June 20, 2017.
- Camera ready: July 6, 2017.


The 10th International Symposium on Algorithmic Game Theory (SAGT) will take place in L'Aquila, Italy, September 12-14, 2017. The purpose of SAGT is to bring together researchers from Computer Science, Economics, Physics, Biology and Mathematics to present and discuss original research at the intersection of
Algorithms and Game Theory.

The program of SAGT will include both invited talks and presentations for refereed submissions. Confirmed invited speakers are:

- Michal Feldman, Tel-Aviv University
- Martin Hoefer, Goethe University
- Nicole Immorlica, Microsoft Research


SUBMISSIONS

Authors are invited to submit previously unpublished work for possible presentation at the conference. Foundational work is solicited on topics including but not limited to:

- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Repeated Games and Convergence of Dynamics
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Design and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising

Industrial application works and position papers presenting novel ideas, issues, challenges and directions are also welcome.

It is expected that every accepted paper will be presented at the symposium by one of the authors.

Submissions must be prepared in LNCS-style and limited to at most 12 pages. Additional material can be added in a clearly marked appendix. Accepted papers are presented in at most 12 pages in the proceedings. Alternatively, authors of accepted papers can publish only a one page abstract in the proceedings, along with a URL pointing to the full paper.

For more detailed submission guidelines and instructions see the conference webpage at http://cs.gssi.infn.it/sagt2017/cfp.php.

The submission is done via Easychair: https://easychair.org/conferences/?conf=sagt2017.


PROGRAM COMMITTEE

- Elliot Anshelevich, Rensselaer Polytechnic
- Vittorio Bilò, University of Salento (co-chair)
- Ioannis Caragiannis, University of Patras
- Giorgos Christodoulou, University of Liverpool
- Xiaotie Deng, Shanghai Jiaotong University of China
- Angelo Fanelli, CNRS Caen
- Michele Flammini, University of L'Aquila & GSSI (co-chair)
- Dimitris Fotakis, National Technical University of Athens
- Martin Gairing, University of Liverpool
- Paul Goldberg, University of Oxford
- Tobias Harks, University of Augsburg
- Thomas Kesselheim, Max-Planck-Institut für Informatik
- Elias Koutsoupias, University of Oxford
- Stefano Leonardi, Sapienza University of Rome
- Marios Mavronicolas, University of Cyprus
- Gianpiero Monaco, University of L'Aquila
- Luca Moscardelli, University of Chieti-Pescara
- Giuseppe Persiano, University of Salerno
- Guido Proietti, University of L'Aquila
- Amin Saberi, Stanford University
- Rahul Savani, University of Liverpool
- Guido Schäfer, CWI Amsterdam
- Alexander Skopalik, University of Paderborn
- Nicolas Stier-Moses, Facebook Core Data Science
- Chaitanya Swamy, University of Waterloo
- Vasilis Syrgkanis, Microsoft Research
- Marc Uetz, University of Twente
- Adrian Vetta, McGill University


STEERING COMMITTEE

- Elias Koutsoupias, University of Oxford
- Marios Mavronicolas, University of Cyprus
- Dov Monderer, Technion
- Burkhard Monien, University of Paderborn
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, University of Salerno
- Paul Spirakis, University of Liverpool (chair)


ORGANIZING COMMITTEE

- Vittorio Bilò, University of Salento (co-chair)
- Gianlorenzo D'Angelo, Gran Sasso Science Institute
- Mattia D'Emidio, Gran Sasso Science Institute
- Michele Flammini, University of L'Aquila & GSSI (co-chair)
- Gianpiero Monaco, University of L'Aquila
- Luca Moscardelli, University of Chieti-Pescara
- Cosimo Vinci, Gran Sasso Science Institute

————
Prof. Michele Flammini
University of L'Aquila & Gran Sasso Science Institute
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] Highlights of Algorithms (HALG 2017) - Call for Contributed Talks and Posters

-------------------------------------------------------------------
Highlights of Algorithms - HALG 2017
June 9-11, 2017, Berlin, Germany
http://highlightsofalgorithms.org/
-------------------------------------------------------------------

The Highlights of Algorithms conference is designed to be a forum for
presenting the highlights of recent developments in algorithms and for
discussing potential further advances in this area. The conference will
provide a broad picture of the latest research in algorithms through a
series of survey and invited talks, as well as possibility for all
researchers and students to present their recent results through a series
of short talks and poster presentations. Attending the Highlights of
Algorithms conference will also be an opportunity for networking and
meeting leading researchers in algorithms.

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

CALL FOR SUBMISSIONS OF SHORT CONTRIBUTED TALKS AND POSTERS

The HALG 2017 conference (http://highlightsofalgorithms.org/) seeks
submissions for short (5 – 10 minutes) contributed talks and posters. There
will be no conference proceedings. As a result, presenting work already
published at a different venue or journal (or to be submitted there) is
welcome.


If you would like to present your results during the conference please
submit the abstract of the talk or the contribution of the poster via
EasyChair: https://easychair.org/conferences/?conf=halg2017. The abstract
should (if possible) include information about a conference where your
results have been accepted/presented or where they are publicly available.
All proposals will be reviewed by the program committee. The authors of the
contributed talks will also be invited for a poster presentation.


Submissions deadline: March 5th, 2017.
Late submissions will be accepted subject to space constraints.
-------------------------------------------------------------------

**********************************************************
*
* 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 Workshop on Evolutionary Algorithms for Smart Grids

Call for Submissions: Workshop on Evolutionary Algorithms for Smart Grids

at ​GECCO 2017 in Berlin, July 15th-19th 2017


The main goal of this workshop is to promote the research on
evolutionary algorithms in smart grids. We are seeking innovative
research articles including, but not limited to the following areas:
- Energy generation and load forecasting
- Demand side and smart home energy management
- Network Restoration
- Real-time control and optimization
- Smart micro-grids

Submitted work should put an emphasis on modeling of solution spaces, on
finding optimal representations and operators for evolutionary
algorithms, and on employing and developing advanced evolutionary
heuristics, e.g., for step size control, constraint handling, dynamic
solution spaces, and multiple conflicting objectives.

We invite the submissions of two types of paper:
- Research papers (up to 8 pages)
- Position papers (two pages)

We encourage authors to submit early and in- progress work.

All papers should be submitted as PDFs in ACM format to
paul.kaufmann@uni-paderborn.de Papers do not have to be anonymized. For
details, please visit:
http://gecco-2017.sigevo.org/index.html/Call+for+Papers

All accepted papers will appear in the GECCO workshop volume.

Key Dates
Submission: April 1st, 2017
Notification: April 15th, 2017
Conference: July 15-19, 2017

Organizers
Oliver Kramer, Univ. of Oldenburg, DE
Markus Wagner, Univ. of Adelaide, AU
Frank Neumann, Univ. of Adelaide, AU
Paul Kaufmann, Paderborn U, DE
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************