Monday, February 20, 2017

[DMANET] 1st CALL FOR PAPERS (CCQ'17)

1st CALL FOR PAPERS (CCQ'17)


Workshop on computation and cryptography with qu-bits (CCQ'17)

Kazan, Russia, June 7, 2017 (Satellite event to CSR 2017)

http://ccq2017.kpfu.ru/


Outline:


The workshop should be devoted to discussions on classical and quantum
computation and cryptography. Submissions including non-finished ideas
to raise discussion are possible and indeed welcomed. Also,
well-written tutorials on specific topics can be accepted as
contributions. The main topics include, but are not limited to:


Algorithms

Computational complexity

Cryptography

Quantum and random walks

Automata theory

Submission:


Authors are cordially welcomed to send their contributions to Farid
Ablayev (fablayev@gmail.com) or Andris Ambainis
(andris.ambainis@lu.lv) in PDF format.


There is no page limit but each submission should start with a title
page consisting of the title of the paper; each author's name,
affiliation, and email address; and an abstract of 1-2 paragraphs
summarizing the paper's contributions. All contributions will be
peer-reviewed.


Simultaneous submissions to other workshop/conferences are allowed.


All accepted papers will be available as a printed book during the workshop.


The accepted papers eligible to a journal submission will be invited
to a special issue of the journal Lobachevskii Journal of Mathematics.


There is no registration fee.


Schedule:


Submission deadline: April 02, 2017

Author notification: May 05, 2017

Final version due: May 20, 2017


Invited Speaker(s): To be announced soon


Program committee:

Farid Ablayev (Kazan Federal University), co-chair

Andris Ambainis (University of Latvia), co-chair

Aleksandrs Belovs (University of Latvia)

Julien Degorre (Università della Svizzera italiana)

Kamil Khadiev (University of Latvia)

François Le Gall (Kyoto University)

Maris Ozols (University of Cambridge)

Renato Portugal (National Laboratory of Scientific Computing)

A. C. Cem Say (Bogazici University)

Dominique Unruh (University of Tartu)

Marcos Villagra (Universidad Nacional de Asunción)

Abuzer Yakaryilmaz (University of Latvia)


Workshop information:

Organized by Kazan Federal university (Volga region)


Organizing committee:

Farid Ablayev

Andris Ambainis

Rishad Ibrahimov

Kamil Khadiev

Abuzer Yakaryilmaz

Mansur Ziyatdinov

**********************************************************
*
* 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] Reminder: Submission deadline for MIPLIB 2017 coming up!

Dear colleagues,

This is a brief reminder that contributions to MIPLIB 2017 are still
possible until

February 28, 2017!

at the website

https://miplibsubmissions.zib.de/

More information on MIPLIB and its role in computational mixed-integer
programming is available at http://miplib.zib.de/.

We are looking forward to your contributions!

Thanks and best regards,

Ambros Gleixner
on behalf of the MIPLIB team.


**********************************************************
*
* 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] DICE-FOPARA 2017: Deadline Extended

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

8th Workshop on Developments in Implicit Computational complExity and
5th Workshop on Foundational and Practical Aspects of Resource Analysis
(DICE-FOPARA 2017)

Affiliated with ETAPS 2017
April 22 - 23, 2017, Uppsala, Sweden
http://cbr.uibk.ac.at/events/dice-fopara

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

OBJECTIVES

The first joint international workshop on Developments in Implicit
Computational complExity and
FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA)
will be held in Uppsala, Sweden, from April 22-23, 2017 as part of the
European Joint Conferences on Theory and Practice of Software 2017
(ETAPS 2017).

DICE-FOPARA serves as a forum for presenting results relevant to the
implicit computational complexity theory *and* to the analysis of
resource consumption by computer programs (e.g. time, space, energy).
The workshop brings together researchers that work on foundational
issues with researchers that focus more on practical results. For
further information, kindly see the workshop's website.


INVITED SPEAKERS

Elvira Albert (Complutense University of Madrid)
Kerstin I. Eder (University of Bristol)
Lars Kristiansen (University of Oslo)
Jan Reinecke (Universität Saarland)


SUBMISSIONS

We ask for submission of *regular papers* describing original work
(10-15 pages) or *extended abstracts* (2-6 pages) presenting already
published work or work in progress. Regular papers must be prepared
using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular
papers will appear in an EPTCS volume. Papers should be submitted
electronically via the submission page:

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


IMPORTANT DATES

Paper submission *March 5, 2017* (extended)
Notification March 19, 2017
Final versions due March 26, 2017
Workshop date April 22-23, 2017


PROGRAM COMMITTEE

Beniamino Accattoli (Paris)
Guillaume Bonfante (Nancy, co-chair)
Marko van Eekelen (Nijmegen)
Marco Gaboardi (Buffalo)
Dan Ghica (Birmingham)
Clemens Grelck (Amsterdam)
Charles Grellois (Bologna)
Nao Hirokawa (JAIST)
Jan Hoffmann (CMU)
Thomas Jensen (Rennes)
Björn Lisper (Mälardalen)
Hans-Wolfgang Loidl (Edinburgh)
Georg Moser (Innsbruck, co-chair)
Kazushige Terui (Kyoto)
Simon Wegener (Saarbrücken)
Florian Zuleger (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] ODS2107 Second CFP - Sorrento

================================================================================
ODS2017 - International Conference on Optimization and Decision Science
XLVII Annual Meeting of AIRO - Italian Operations Research Society
Hilton Conference Center, Sorrento, Italy
September 4-7, 2017
<http://www.airoconference.it/ods2017> www.airoconference.it/ods2017
================================================================================

ODS2017 SECOND CALL FOR PAPERS

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

Dear colleague,

please below the Second Call for Papers of ODS2017
International Conference on Optimization and Decision Science
Hilton Conference Center, September 4 – 7, 2017, Sorrento, Italy.

The Program and Organizing Committees, chaired by Antonio Sforza and Claudio Sterle, are preparing a high quality scientific program for the Conference.

We kindly ask you to widely disseminate it across the members of your operations research society, as well as among all colleagues interested in the conference topics.

We are convinced that ODS2017 will be a great event for the OR community to get together again in a beautiful place and a pleasant and friendly atmosphere, and your presence can give an important contribution to the success of the conference.

We really look forward to meeting you at ODS2017 to live together this event, enjoying it with friends and researchers from all over the world!

Antonio Sforza (Programme Committee Chair)
Claudio Sterle (Organizing Committe Chair)


PLENARY SPEAKERS
===================
- Daniel Bienstock - Columbia University, New York, USA
- Patrick De Causmaecker - University of Leuven, Belgio (EURO Sponsored plenary)
- Matteo Fischetti – Università of Padova, Italy


CALL FOR PAPERS
=================
Participants will have two ways of submission, a short paper or an abstract:

• Short paper (6 – 8 pages, including front matter and references) - deadline March 3rd, 2017
Short papers will undergo a review process by anonymous referees.
Accepted papers will be included in a special volume of the Springer Conference Proceedings in Mathematics and Statistics (PROMS), indexed in main scientific databases (Scopus, Thomson Reuters, Google Scholar, etc.).
They have to be prepared in LaTeX or Word using the PROMS template and submitted via Springer's Online Conference Service, OCS, (https://ocs.springer.com/prom/).

• Abstract (min 1000 characters space included, max 1 page including front matters and references)- deadline April 15th, 2017
Abstracts to be included in the conference e-book of abstracts will be selected by ODS2017 Programme Committee.
They should be prepared using the ODS2017 Word template available on the conference website (www.airoconference.it/ods2017) and submitted via the on-line procedure activated on the same website.
No participant can present more than one contribution (short paper or abstract) at the Conference.


CALL FOR SESSIONS
==================
Session proposals are welcome and have to be sent to ods2017.airo@unina.it within February 26th. Proposals have to report:
Title of the session and first attempt title, authors, and kind (short paper or abstract) of each contribution.

Contributions of invited sessions will undergo the same review process of regular short paper and abstract.

IMPORTANT DATES
=================
Early registration opens: February 1st, 2017
Deadline for short paper submission: March 3rd, 2017
Deadline for abstract submission: April 15th, 2017
Contribution (short paper or abstract) acceptance notification: Within April 30th, 2017
Deadline for early registration: May 14th, 2017
Due date for camera-ready paper: May 31st, 2017


REGISTRATION FEES
===================
AIRO Member
- Regular: 380 EUR (early) - 450 EUR (late)
- Honorary member: 280 EUR (early) - 280 EUR (late)
- Graduates/PhD student/Post-Doc under 30 years: 200 EUR (early) - 250 EUR (late)

NON AIRO Member
- Regular: 480 EUR (early) - 550 EUR (late)
- Graduates/PhD student/Post-Doc under 30 years: 250 EUR (early) - 300 EUR (late)

Early registration ends on May 14th, 2017
Registration Fees include: Participation to all sessions and access to the exhibition area; conference materials; publication of accepted papers in Springer PROMS; Participation in Welcome Cocktail, Coffee breaks, Social events and Social dinner.

The fee for the Accompanying persons is 75 EUR. It includes: Participation to Welcome Cocktail and Coffee breaks. The additional fee for the Social Dinner is 60 €.

FURTHER INFORMATION
======================
Sorrento has a great hospitality offer, but it is very crowded in the period of the Conference. All the participants are warmly invited to reserve their accommodation as soon as possible in order to find solutions at best rates. The reservation form for Hilton Hotel (venue of the conference) and for several accommodation options are available on conference website.

For other information please, visit the Conference website: <http://www.airoconference.it/ods2017> www.airoconference.it/ods2017 or contact ods2017.airo@unina.it.


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

[DMANET] Higher mathematics through problem solving - Budapest, June 6 - 10

First Announcement

The Institute of Mathematics of the Eotvos Lorand University, Budapest is
organizing a one week long summer school in mathematics entitled "Higher
mathematics through problem solving".

The program will consist of problem solving sessions in algebra, number
theory, combinatorics, geometry, analysis, and probability theory, each of
them concentrating on one or two special topics. Participants will get a
brief introduction into the basic notions and results and then individual
work will follow, with the guidance of the lecturers and their assistants.

http://bolyai.cs.elte.hu/summerschool/

Kristof Berczi
Egervary Research Group
Eotvos University, Budapest
berkri@cs.elte.hu

**********************************************************
*
* 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, February 19, 2017

[DMANET] PhD and postdoc in probabilistic/extremal combinatorics in Nijmegen, the Netherlands

Department of Mathematics, Radboud University Nijmegen
Application deadline: 16 March 2017

We seek outstanding, highly motivated researchers for the NWO VIDI
project, 'On the edge: theory and techniques at the frontiers of
edge-colouring', under the direction of Dr Ross Kang.

The PhD position is four years. The postdoc position is one year, with
a possible renewal. Both positions offer competitive salary and
benefits, including generous support for travel. There is a light
teaching duty that may be carried out in English if necessary. For
both, the expected starting date is 1 September 2017 (negotiable).

The project is in probabilistic and extremal combinatorics, and the
goal is to develop and apply novel methods in the context of
edge-colourings of graphs. The research has links with the theory of
communication networks, random graphs and algorithms.

The city of Nijmegen, with its Roman foundation, stakes a claim to
being the oldest in the Netherlands. It is surrounded by lush green
countryside and at the same time is conveniently connected to Schiphol
airport and larger Dutch cities like Amsterdam and Utrecht.

For more information, including details on the requirements and
application procedure:

http://www.ru.nl/werken/details/details_vacature_0/?recid=596205
(PhD position)

http://www.ru.nl/werken/details/details_vacature_0/?recid=596203
(postdoc position)

For informal inquiries, please contact Ross Kang (http://www.math.ru.nl/~rkang/)
**********************************************************
*
* 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] PLS 11 Second CFP

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

PLS11: THE ELEVENTH PANHELLENIC LOGIC SYMPOSIUM

July 12-16, 2017, Delphi, Greece

The National and Kapodistrian University of Athens and

the National Technical University of Athens.

The University of Cyprus will help in the organization.

http://pls11.cs.ntua.gr/

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

IMPORTANT DATES

Deadline for submission: Wednesday, April 12, 2017

Notification: Friday, May 12, 2017

Final copy due: Friday, June 2, 2017

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

INVITED TALKS

- Zoé Chatzidakis, ENS, Paris

- Hannes Leitgeb, LMU, Munich

- Yiannis Moschovakis, UCLA

- Andrea Sorbi, Siena University

- Wolfgang Thomas, RWTH, Aachen

- Timothy Williamson, Oxford University

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

TUTORIALS

- Valentina Harisanov, George Washington University,

"Computable Model Theory"

- Ya'acov Peterzil, University of Haifa, "O-minimality"

- Anand Pillay, Notre Dame, "Model theory"

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

SPECIAL SESSIONS:

Computability Theory (Organizer: Alexandra Soskova)

- Damir Dzhafarov, University of Connecticut

- Ekaterina Fokina, Vienna University of Technology

- Andy Lewis-Pye, London School of Economics

- Joseph Miller, University of Wisconsin, Madison

- Antonio Montalban, UC Berkeley

- Paul Shafer, University of Gent

Model Theory (Organizers: Pantelis Eleftheriou, Rizos Sklinos)

- Artem Chernikov, UCLA

- Amador Martin-Pizarro, Lyon 1

- Sergei Starchenko, University of Notre Dame, TBC

- Frank Wagner, Lyon 1

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

SECOND CALL FOR PAPERS

The Scientific Committee cordially invites all researchers in the

area of the conference to submit their papers until April 12, 2017

(in PDF-format, in English, at most 6 pages) for presentation at

PLS11 to htps://www.easychair.org/conferences/?conf=pls11.

Papers should be prepared using the EasyChair class style

from http://www.easychair.org/publications/?page=1594225690).

All submitted papers will be reviewed by the Scientific Committee

of the symposium, who will make final decisions on acceptance.

During the symposium, each accepted paper will be presented

(a twenty minutes talk) by one of its authors, with five extra

minutes for questions.

If possible, each submitted paper should be classified in one of

the following areas:

- Ancient Logic

- Computability Theory

- History and Philosophy of Logic

- Logic in Computer Science

- Model Theory

- Nonclassical and Modal Logics

- Proof Theory

- Set Theory

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

POSTER SESSION

Graduate students and young researchers are invited to submit a short

abstract on work in progress. Authors of accepted abstracts will have

an opportunity to present their results in poster form in a special

poster session. Interested students and young researchers should

submit abstracts of no more than one page in PDF form by June 2, 2017,

by sending them by e-mail to: pls11@softlab.ntua.gr

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

GRANTS

ASL Student Travel Grants:

PLS11 is sponsored by the Association for Symbolic Logic. All student

members of the ASL can apply for travel funding. To be considered for

a Travel Award, please (1) send a letter of application, and (2) ask

your thesis supervisor to send a brief recommendation letter. The

application letter should be brief (preferably one page) and should

include: (1) your name; (2) your home institution; (3) your thesis

supervisor's name; (4) a one-paragraph description of your studies and

work in logic, and a paragraph explaining why it is important to

attend the meeting; (5) your estimate of the travel expenses you will

incur; (6) (for citizens or residents of the USA) citizenship or visa

status; and (7) (voluntary) indication of your gender and minority

status. Women and members of minority groups are strongly encouraged

to apply. Applications should be sent to asl@vassar.edu before April

12, 2017.

EMS grants for Young Researchers:

Thanks to the generous support from European Mathematical Society,

PLS11 is glad to be able to offer free registration for Masters and

PhD students in Logic and young early career researchers for

participating at PLS 11. In order to apply for grants please send a CV

to pls11@softlab.ntua.gr until April 12, 2017.

Preference will be given to researchers who submitted a paper.

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

SCIENTIFIC COMMITTEE

- Costas Dimitracopoulos, National and Kapodistrian University of Athens

- Pantelis Eleftheriou, University of Konstanz

- Vassilis Gregoriades, Università di Torino, Italy

- Antonis Kakas, University of Cyprus

- Lefteris Kirousis, National and Kapodistrian University of Athens

- Nikolaos Papaspyrou, National Technical University of Athens

- Athanasios Pheidas, University of Crete

- George Tourlakis, York University, Canada

- Rizos Sklinos, Université Lyon 1

- Alexandra Soskova, Sofia University, Chair

- Stathis Zachos, National Technical University of Athens

ORGANIZING COMMITTEE

- Antonis Kakas, University of Cyprus, Chair

- Nikolaos Papaspyrou, National Technical University of Athens

- Panos Rondogiannis, National and Kapodistrian University of Athens

- Petros Stefaneas, National Technical University of Athens

- Yannis Stephanou, National and Kapodistrian University of Athens

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

SYMPOSIUM WEBPAGE: http://pls11.cs.ntua.gr/

E-MAIL: pls11@softlab.ntua.gr

CONTACTS:

- Alexandra Soskova <asoskova@fmi.uni-sofia.bg>

Chair of the Scientific Committee

- Antonis Kakas <antonis@ucy.ac.cy>

Chair of the Organizing Committee


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

Saturday, February 18, 2017

[DMANET] Fully funded doctoral student positions in Helsinki

Helsinki ICT network: Fully Funded Positions for Exceptional Doctoral
Students

The Helsinki Doctoral Education Network in Information and
Communications Technology (HICT) is a joint initiative by Aalto
University and the University of Helsinki, the two leading universities
within this area in Finland. The network involves at present 62
professors and over 200 doctoral students, and the participating units
graduate altogether more than 40 new doctors each year.

The activities of HICT are structured along five research area specific
tracks:
- Algorithms and machine learning
- Life science informatics
- Networks, networked systems and services
- Software and service engineering and systems
- User centered and creative technologies

The participating units of HICT have currently funding available for
exceptional doctoral students. The supervising professors of HICT, whose
research groups one can apply to join via this call, are listed at
"http://www.hict.fi/supervisors".

For more information on the call, go to "http://www.hict.fi/spring2017".

The online application form closes March 5, 2017 at midnight Finnish
time. For more information and application instructions, see
"http://www.hict.fi".
**********************************************************
*
* 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] BCTCS2017

Announcement of the 33rd British Colloquium for Theoretical Computer Science
============================================================================

Dear all,

The 33rd BCTCS will be hosted by the School of Computer Science, University of
St Andrews, from the 26th to the 28th of April 2017.
The purpose of BCTCS is to provide a forum in which researchers in theoretical
computer science can meet, present research findings, and discuss developments
in the field. It also aims to provide an environment in which PhD students can
gain experience in presenting their work, and benefit from contact with
established researchers.
The scope of the colloquium includes all aspects of theoretical computer
science, including algorithms, complexity, cryptography, formal methods, game
theory, machine learning, languages, logics and quantum computation.
Both computer scientists and mathematicians are welcome to attend, as are
participants from outside of the UK.


This year the colloquium will feature the following invited speakers

LMS Keynote Lecture in Discrete Mathematics
-------------------------------------------

Professor László Babai, University of Chicago

Confirmed Speakers
------------------

Perdita Stevens, University of Edinburgh
Conor McBride, University of Strathclyde
Felix Fischer, University of Glasgow
Edwin Brady, University of St Andrews
Mehrnoosh Sadrzadeh, Queen Mary University of London

Registration is *now open*, and you can find more information at the following
web address

https://bctcs2017.cs.st-andrews.ac.uk/

PhD students are especially encouraged to offer a talk.

As an additional event, there will be a Scottish Combinatorics Meeting at the
School of Mathematics in St Andrews on the 24th and 25th of April. If you would
like to take part in the meeting, please contact the organisers directly.

The organisers hope to welcome you to St Andrews in April.

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

[DMANET] VeRoLog 2017 - Abstract Submission Deadline

Dear colleagues,

The sixth meeting of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog) is taking place in Amsterdam from 10 to 12 July 2017. The deadline for abstract submission is approaching fast, being February 28.

We look forward to receiving your contribution to the parallel sessions and your participation to the plenary and semi-plenary sessions. In particular, we have organized plenary talks from Prof. Guy Desaulniers and Prof. David Pisinger, tutorials from Prof. Michael Schneider and Dr. Güneş Erdoğan, and brainstorming sessions led by international companies working on optimization problems in transportation and logistics.

Although the 3 day programme is quite packed, we have explicitly made room for several social activities, such as boat and city tours to help you fully enjoy Amsterdam, its rich history, and, last but not least, the large variety of local cheese and beers!

For the abstract submission and all the relative information, please see the conference website:

verolog2017.sciencesconf.org

We are looking forward to welcoming you in Amsterdam!

The VU VeRoLog2017 local organizing committee

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

[DMANET] Smart Cities (MIC 2017) deadline fast approaching Feb 22nd

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

* Special Session on "Smart Cities" *

* Metaheuristic International Conference (MIC 2017) *

* Barcelona, Spain, July 4th-7th 2015 *

*

* *http://mic2017.upf.edu/special-sessions/
<http://mic2017.upf.edu/special-sessions/>* *

*

* Submission deadline: *February **22**, 2017 *

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

Smart Cities represent a new community of researchers, developers and
innovators where new intelligent applications are continuously seek. As a
way of creating these intelligent products and services, metaheuristics
appear as a way of developing scalable, highly restricted and data driven
applications.

This special session provides a forum for the exchange of ideas and results
among researchers, developers, and practitioners working on the application
of heuristic and metaheuristic methods to address problems related to smart
cities.

As a key point to distinguish old applications and the new smart city
environment, potential authors are requested to attack several edges of a
problem (holistic vision, e.g. routes and pollution), use real data, deal
with the actual city problem (not with a very abstract model of it) and
consider business plans, users or real restrictions.

The goal of this special session is to present high-quality research papers
that contain novel contributions addressing both practical applications and
theoretical issues, including smart governance, smart energy, smart
building, smart mobility, smart infrastructure, technology, smart
healthcare, and smart citizens.

Topics of interest include (but are not limited to) metaheuristics in:

-

Energy, water, waste and green power management
-

Environmental, social and economic sustainability
-

Smart mobility, ITS, electric vehicles, fleet of vehicles
-

Open data and big data
-

City planning and operations
-

Modeling human demands
-

Healthcare management in cities, social inclusion, education
-

Sustainable urban grow, planning, and economic development
-

Social (crowding), living labs, cloud applications for cities
-

Safety and emergency systems
-

Web services, mobile apps, urban platforms
-

Internet of things, cyber-physical systems, holistic integration

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

* Submission deadline: *February **22*
* Notification of acceptance: February 27, 2017
* Camera-ready papers: March 6, 2017
* Early registration due date: *March 31, 2017*

* Conference: July 4-7 2017

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

SHOULD YOU NEED SOME MORE TIME, PLEASE ASK US


Session Chairs:

* Prof. Enrique Alba (University of Malaga, Spain, e-mail: *eat@lcc.uma.es
<eat@lcc.uma.es>*)

* Dr. Jamal Toutouh (University of Malaga, Spain, e-mail: *jamal@lcc.uma.es
<jamal@lcc.uma.es>*)

**********************************************************
*
* 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] BDA 2017 --- call for presentations

=======================================================
The 5th Workshop on Biological Distributed Algorithms (BDA 2017)
July 28, 2017 in Washington, DC, USA. Co-located with PODC 2017
http://www.snl.salk.edu/~navlakha/BDA2017/
=======================================================

We are excited to announce the 5th workshop on Biological Distributed
Algorithms (BDA). The aim of the workshop is to foster collaborative
research
between biologists and distributed computing theory researchers, with the
hope
of producing better understanding of the behavior of distributed biological
systems, as well as new ideas for design of algorithms for engineered or
computational networks.

BDA 2017 will include presentations on distributed algorithms related to a
variety of biological systems, with special attention to communication and
coordination in insect colonies (e.g. foraging, navigation, task allocation,
construction) and networks in the brain (e.g. learning, decision-making,
attention).

This is a one-day workshop.

===========
SUBMISSIONS
===========
We solicit submissions of extended abstracts describing recent results
relevant to biological distributed computing. We especially welcome extended
abstracts describing new insights and / or case studies regarding the
relationship between distributed computing and biological systems even if
these are not fully formed. Since a major goal of the workshop is to explore
new directions and approaches, we especially encourage the submission of
ongoing work. Selected contributors would be asked to present, discuss and
defend their work at the workshop. By default, the submissions will be
evaluated for either oral or poster presentation, though authors may
indicate
in their submission if it should be only considered for one of the
presentation types. Submissions should be in PDF and include title, author
information, and a 4-page extended abstract. Shorter submissions are also
welcome, particularly for poster presentation.

Please use the following EasyChair submission link:
https://easychair.org/conferences/?conf=bda17

Note: The workshop will not include published proceedings. In particular, we
welcome submissions of extended abstracts describing work that has appeared
or
is expected to appear in other venues.

===============
IMPORTANT DATES
===============
April 28, 2017 – Extended abstract submission deadline
May 28, 2017 – Decision notifications
July 28, 2017 – Workshop

================
INVITED SPEAKERS
================
To be announced soon

=================
PROGRAM COMMITTEE
=================
Ziv Bar-Joseph - CMU
Anna Dornhaus - University of Arizona
Yuval Emek - Technion (co-chair)
Amos Korman - CNRS and University of Paris Diderot
Nancy Lynch - MIT
Melanie Moses, University of New Mexico
Saket Navlakha - Salk Institute (co-chair)
Merav Parter, MIT
Andrea Richa, Arizona State University
Nir Shavit, MIT


--
Yuval Emek, Ph.D.
Assistant Professor
Industrial Engineering and Management
Technion - Israel Institute of Technology
https://yemek.net.technion.ac.il/ <http://ie.technion.ac.il/~yemek/>

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