[DMANET] Call for papers 1st AIROYoung workshop

Dear colleagues,

We are pleased to invite you to attend the first AIROYoung Workshop on

"*Emerging Optimization Problems in Complex Networks"*

which will take place at the Statistical Department of the University of
Rome, Sapienza on 16th-17th February 2017.

AIROYoung* (**http://www.airoyoung.org <http://www.airoyoung.org>*) is the
youth chapter of AIRO, the Italian Operational Research Society. Its aim is
to foster collaboration between students and early-career researchers
interested in the field of OR, and to provide them with new opportunities
to advance their carreer and expand their network. It also strives to
connect the demand and the offer in the OR job market, both in academia and
in the industry.

*Participation* to the workshop is *free* of charge and it is possible to
reserve your *accommodation at a special rate* booking via AIROYoung.
Furthermore, AIROYoung members can request a *travel grant *(for more
details see the workshop web site *http://workshop.airoyoung.org
<http://workshop.airoyoung.org>*).

We invite contributions from *all researchers* in the area of
Network Optimization. Young researchers (PhD students, recent PhD
graduates) can also contribute their work on other areas. These works will
be presented in a special «Young Researchers» session.

Important Dates
===============
Deadline for submissions: January 15th, 2017
Workshop: February 16th-17th, 2017

Submissions
===========
Interested applicants can send a short abstract (max 1 page) to
airo.young.researchers@gmail.com
<airo.young.researchers@gmail.com?subject=AIROYoung%20Workshop%20Submission>

Invited Speakers
===============
Justo Puerto, University of Sevilla, Spain.
Maria Grazia Scutellà, University of Pisa, Italy.

We hope you will be able to attend this exciting workshop!

The event and further info are available on the workshop web site:
*http://workshop.airoyoung.org
<http://workshop.airoyoung.org>*

Looking forward to hearing from you.

The organizing committee:

Lavinia Amorosi (University of Rome, Sapienza)
Alberto Maria Santini (University of Bologna)

**********************************************************
*
* 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] LSD & LAW 2017 (9th & 10th Feb, 2017): Second call for participation

Dear all,

We will be hosting the 25th LSD & LAW (London Stringology Days & London Algorithmic Workshop 2017) at King's College London on the 9th and 10th of February 2017 (http://www.inf.kcl.ac.uk/events/LSD&LAW17/). The LSD&LAW meetings are organised annually by the Algorithms and Bioinformatics research group at King's College London.

Please let us know if you would like to give a contributing talk and provide a tentative title and abstract by 15 January 2017. Contributing talks can present recent results or work in progress with directions for future research, in the areas of discrete algorithms, stringology and graph/network algorithms. We particularly encourage talks with relevance to the additional theme of the 2017 LSD & LAW meeting - "Advances in Mathematical Aspects of Uncertain Data".

There won't be a formal registration, but to help us with preparations, kindly inform us if you are planning to attend the workshop.

We hope to seeing you in London!

Best Regards,

Ritu Kundu and Manal Mohamed

on behalf of the LSD & LAW 2017 organising 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] Extended Deadline: ICFCA'17 — 14th International Conference on Formal Concept Analysis

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

NOTE: Extended deadlines, please see below!

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

ICFCA 2017

14th International Conference on Formal Concept Analysis

June 12—16, 2017, Rennes, France

Web: <http://icfca2017.irisa.fr/>
Mail: icfca2017@inria.fr

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

* Overview

Formal Concept Analysis emerged in the 1980's from attempts to restructure
lattice theory in order to promote better communication between lattice
theorists and potential users of lattice theory. Since its early years, Formal
Concept Analysis has developed into a research field in its own right with a
thriving theoretical community and a rapidly expanding range of applications in
information and knowledge processing including visualization, data analysis
(mining) and knowledge management and discovery.

The ICFCA conference series aims at bringing together researchers and
practitioners working on theoretical or applied aspects of Formal Concept
Analysis within major related areas such as Mathematics and Computer and
Information Sciences and their diverse applications to fields like Software
Engineering, Linguistics, Life and Social Sciences, etc.

All accepted submissions will be refereed, and the conference proceedings will
be published by Springer in the LNCS/LNAI series.

* Topics

Main topics of interest include, but are not limited to:

** Fundamental aspects of FCA

- FCA theory
- Lattice theory
- Lattice drawing
- Philosophical foundations
- Algorithms and complexity theory

** Bridging FCA to information sciences and artificial intelligence

- FCA and logic, e.g., semantic web, description logics
- FCA and conceptual structures, e.g., concept graphs, knowledge spaces
- FCA and data analysis, e.g., hierarchical classification, data organization
- FCA and data mining, e.g., pattern mining
- FCA and information retrieval, e.g. exploratory search, navigation, querying
- FCA and machine learning, e.g., learning with hypothesis, feature selection
- FCA and database theory, e.g., dependencies, rules, data cubes
- FCA and software engineering
- FCA and morphological mathematics

** Understanding, modelling real-world data and phenomena with FCA

- Analysis of "big data" with FCA, e.g., sampling, parallel computing
- Analysis of social networks and their dynamics
- Applications for scientific data analysis, e.g., in biology or health care
- Applications for sensors data and user interactions traces
- Other FCA applications

* Submission Details

We invite scientific publications on theory and applications of Formal Concept
Analysis. Papers of up to sixteen pages may be submitted in the PDF format via
the Easychair system

<https://easychair.org/conferences/?conf=icfca2017>.

Authors are requested to follow the formatting instructions for the Springer
LNCS style.[1] Submissions in LaTeX2e are preferred. Authors are encouraged to
provide an ORCID alongside their submission.[2]

Accepted papers have to be presented at the conference. Therefore, at least one
author per paper has to register timely.

[1]: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
[2]: https://www.springer.com/gp/authors-editors/orcid

* Important Dates

Submission of abstract: *December 19, 2016* (EXTENDED!)
Submission of full paper: *January 2, 2017* (EXTENDED!)
Notification of acceptance: February 6, 2017
Camera ready due: February 27, 2017
Conference: June 12—16, 2017

* Organization

The conference will be hosted by IRISA[3] and Centre de Recherche Inria Bretagne
Atlantique[4].

[3]: https://www.irisa.fr/en
[4]: https://www.inria.fr/centre/rennes

** Conference Chairs

Peggy Cellier, IRISA, INSA Rennes, France
Sébastien Ferré, IRISA, University Rennes 1, France

** Program Chairs

Karell Bertet, L3I, Université de La Rochelle, France
Daniel Borchmann, Technische Universität Dresden, Germany

** Editorial Board

Jaume Baixeries, Polytechnic University of Catalonia, Catalonia
Peggy Cellier, IRISA lab, Rennes, France
Florent Domenach, Akita International University, Japan
Peter Eklund, IT University of Copenhagen, Denmark
Sebastien Ferré, Université de Rennes 1, France
Bernhard Ganter, Technische Universität Dresden, Germany
Cynthia Vera Glodeanu
Mehdi Kaytoue, INSA-Lyon, LIRIS, France
Sergei Kuznetsov, Higher School of Economics, Moscow, Russia
Leonard Kwuida, Bern University of Applied Sciences
Rokia Missaoui, Université du Québec en Outaouais (UQO), Canada
Amedeo Napoli, LORIA, Nancy, France
Sergei Obiedkov, Higher School of Economics, Moscow, Russia
Manuel Ojeda-Aciego, University of Malaga, Spain
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany
Sebastian Rudolph, Technische Universität Dresden, Germany
Christian Sacarea, Babes-Bolyai University of Cluj-Napoca, Romania
Stefan E. Schmidt, Technische Universität Dresden, Germany
Gerd Stumme, Universität Kassel, Germany
Petko Valtchev, Université du Québec à Montréal, Canada
Karl Erich Wolff, University of Applied Sciences, Darmstadt, Germany

** Honorary Members

Vincent Duquenne, ECP6-CNRS, Université Paris 6, France
Rudolf Wille, Technische Universität Darmstadt, Germany

** Program Committee

Simon Andrews, Sheffield Hallam University, United Kingdom
François Brucker, Centrale Marseille, France
Claudio Carpineto, Fondazione Ugo Bordoni, Italy
Pablo Cordero, University of Málaga, Spain
Jean Diatta, Université de la Réunion, France
Felix Distel, d-fine GmbH, Germany
Christophe Demko, L3I lab, Université de La Rochelle, France
Stephan Doerfel, MICROMATA GmbH, Germany
Alain Gély, Université Paul Verlaine, Metz, France
Robert Godin, Université du Québec à Montréal, Canada
Marianne Huchard, LIRMM, Université Montpellier, France
Dmitry Ignatov, Higher School of Economics, Moscow, Russia
Robert Jäschke, University of Sheffield, England
Michal Krupka, Palacky University, Olomouc, Czech Republic
Marzena Kryszkiewicz, Warsaw University of Technology, Poland
Wilfried Lex, Universität Clausthal, Germany
Jesús Medina, Cadiz University, Spain
Engelbert Mephu Nguifo, LIMOS, Université de Clermont Ferrand 2, France
Lhouari Nourine, LIMOS, Université de Clermont Ferrand 2, France
Jan Outrata, Palacky University of Olomouc, Czech Republic
Jean-Marc Petit, LIRIS, INSA Lyon, France
Sandor Radeleczki, University of Miskolc, Hungary
Barış Sertkaya, Frankfurt University of Applied Sciences
Laszlo Szathmary, University of Debrecen, Hungary
Andreja Tepavčević, University of Novi Sad, Serbia
Jean-François Viaud, L3I lab, Université de La Rochelle, France

--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. rer. nat. Daniel Borchmann
Postdoctoral Research Associate

Technische Universität Dresden
Fakultät Informatik
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie
01062 Dresden
Tel.: +49 351 463-38351
E-Mail: daniel.borchmann@tu-dresden.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/
*
**********************************************************

[DMANET] SEA CFP

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

Call for Papers

16th International Symposium on Experimental Algorithms (SEA 2017)

June 21-23, 2017, London, United Kingdom

http://www.dcs.kcl.ac.uk/events/SEA2017/

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

SEA (Symposium on Experimental Algorithms), previously known as WEA
(Workshop on Experimental Algorithms), is an international forum for
researchers in the area of design, analysis, and experimental evaluation
and engineering of algorithms, as well as in various aspects of
computational optimization and its applications. The preceding symposia
were held in Riga, Monte Verità, Rio de Janeiro, Santorini, Menorca Island,
Rome, Cape Cod, Dortmund, Ischia Island, Crete, Bordeaux, Rome, Copenhagen,
Paris, and St. Petersburg.

SEA aims to attract papers from both the CS and the OR/Mathematical
Programming communities.

The main theme of the symposium is the role of experimentation and
of algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present significant
contributions supported by experimental evaluation, methodological
issues in the design and interpretation of experiments, the use of
(meta-) heuristics, or application-driven case studies that deepen
the understanding of the complexity of a problem.

In 2017 the proceedings of SEA will be published for the first time
in the Leibniz International Proceedings in Informatics (LIPIcs)
open-access series.

IMPORTANT DATES

Times AoE (Anywhere on Earth):
Abstract submission: 6 February, 2017.
Full paper submission: 13 February, 2017.
Acceptance notification: 27 March, 2017.
Camera-ready version: 6 April, 2017.
Conference dates: June 21-23, 2017.

TOPICS
Contributions solicited cover a variety of topics including but not
limited to:

Algorithm Engineering
Algorithmic Libraries
Algorithmic Mechanism Design
Analysis of Algorithms
Algorithms for Memory Hierarchies
Approximation Techniques
Bioinformatics
Branch-and-Bound Algorithms
Combinatorial and Irregular Problems
Combinatorial Structures and Graphs
Communication Networks
Complex Networks
Computational Geometry
Computational Learning Theory
Computational Optimization
Computer Systems
Cryptography and Security
Data Streams
Data Structures
Distributed and Parallel Algorithms
Evaluation of Algorithms for Realistic Environments
Experimental Techniques and Statistics
Graph Drawing
Heuristics for Combinatorial Optimization
Implementation, Testing, Evaluation and Fine-tuning
Information Retrieval
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Metaheuristic Methodologies
Multiple Criteria Decision Making
Network Analysis
Novel Applications of Algorithms in Other Disciplines
Online Problems
Parallel Algorithms and Computing
Railway Optimization using Algorithmic Methods
Randomized Techniques
Robotics
Semidefinite Programming
Simulation
Software Repositories and Platforms for using Algorithms
Telecommunications and Networking
World-Wide-Web Algorithms

INVITED SPEAKERS

Graham Cormode (University of Warwick)
Martin Farach-Colton (Rutgers University)
Ruth Misener (Imperial College London)

PROGRAM COMMITTEE

Maike Buchin, Ruhr University Bochum, Germany
Christina Burt, University of Melbourne, Australia
Sandor Fekete, TU Braunschweig, Germany
Irene Finocchi, University of Rome - La Sapienza, Italy
Ambros Gleixner, Zuse Institute Berlin, Germany
Dominik Kempa, University of Helsinki, Finland
Nicole Megow, Technical University of Munich, Germany
Ulrich Meyer, Goethe-Universitat Frankfurt am Main, Germany
Shin-Ichi Minato, Hokkaido University, Japan
Petra Mutzel, Technical University of Dortmund, Germany
Gonzalo Navarro, University of Chile, Chile
Giuseppe Ottaviano, Facebook, USA
Panos Pardalos, University of Florida, USA
Solon Pissis, King's College London, UK - co-chair
Simon J. Puglisi, University of Helsinki, Finland - co-chair
Rajeev Raman, University of Leicester, UK - co-chair
Barna Saha, University of Massachusetts Amherst, USA
Alassandra Sala, Nokia Bell Labs, Ireland
Sabine Storandt, University of Wuerzburg, Germany
Rossano Venturini, University of Pisa, Italy
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Renato Werneck, Amazon, USA
Christos Zaroliagis, University of Patras, Greece

SUBMISSIONS

Authors are invited to submit an extended abstract not exceeding
12 single-spaced pages, including references, figures, title, authors,
affiliations, e-mail addresses, and a short (one paragraph) abstract.
Authors are strongly advised to use the LaTeX style file supplied for
the LIPIcs style here:

https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/

Final proceedings papers must be camera-ready in this format. A clearly
marked Appendix, which will not count toward the 12 page submission
limit, can be included and will be read at the referees' discretion.

All submissions have to be made via the EasyChair submission page for
the conference at:

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

Papers submitted for review should present original, previously
unpublished work or surveys of important results. At the time the
extended abstract is submitted to SEA, and for the entire review period,
the paper (or essentially the same paper) should not be under review by
any other conference with published proceedings or by a scientific
journal. At least one author of each accepted paper will be expected to
attend the conference and present the paper.

FURTHER INFORMATION AND CONTACTS

Web: http://www.dcs.kcl.ac.uk/events/SEA2017/

**********************************************************
*
* 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] 2 PhD/Postdoc Positions in Combinatorial Optimization

2 PhD/Postdoc positions
University of Bremen, Germany

Two Phd and/or Postdoc positions in combinatorial optimization are
available in the group of Prof. Nicole Megow at the University of Bremen
in the department of mathematics and computer science. The group's
research focus is on combinatorial optimization, efficient algorithms,
approximation algorithms, scheduling, network design and algorithms,
optimization under uncertainty such as online, stochastic, and robust
optimization, and their application in practice.

Candidates should have an excellent academic degree in mathematics,
theoretical computer science or a related area, and must have good
knowledge in combinatorial optimization and algorithm theory. A
background in some of the other above-mentioned topics is desirable.
Good communication skills and solid English writing skills are
necessary. In addition, the successful candidate will be highly
self-motivated, passionate about his/her work, and have good ability to
work both independently as well as in a team.

Both positions are full-time positions, involve teaching, and they are
paid according to the Federal German Payment scale TV-L 13.

Applications will be reviewed starting from January 15, 2017, until the
position is filled. The envisioned starting date is as soon as possible
but may be negotiable.

Please send your application (including cover/motivation letter,
curriculum vitae, list of publications, and the names and contact
information of at least two references) to the address below. Electronic
submissions are highly encouraged (please attach relevant documents as
*a single pdf*).

Prof. Nicole Megow
Universität Bremen
FB 3: Mathematik/Informatik
Bibliothekstr. 1, MZH
28359 Bremen
Germany

Email: nicole.megow@uni-bremen.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/
*
**********************************************************

[DMANET] CFPs Search-Based Software Engineering (SBSE) Track @ Genetic and Evolutionary Computation Conference (GECCO) 2017

CALL FOR PAPERS
Search-Based Software Engineering (SBSE) Track @ Genetic and Evolutionary Computation Conference (GECCO) 2017
http://gecco-2017.sigevo.org

Dear Colleague,

We invite you to contribute high quality papers to the Search-Based Software Engineering (SBSE) track of the Genetic and Evolutionary Computation Conference (GECCO 2017). After a few years as part of a combined track, SBSE is once again the subject of its own dedicated track at GECCO and thus we welcome your support for the track in this new form. Note also this year GECCO invites shorter "poster-only" papers in addition to full-length technical papers; see: http://gecco-2017.sigevo.org/index.html/Papers for details.

KEY INFORMATION

Paper Submission: 6 February 2017 (non-extensible; abstracts by 30 January)

Conference: 15-19 July 2017, Berlin, Germany

Track Details: http://gecco-2017.sigevo.org/index.html/Program+Tracks#id_SBSE%20-%20Search-Based%20Software%20Engineering

Paper Submission Details: http://gecco-2017.sigevo.org/index.html/Papers

SBSE TRACK DESCRIPTION
Search-Based Software Engineering (SBSE) is the application of search algorithms to the solution of software engineering tasks. Evolutionary computation is a foundation of SBSE, and since 2002 the SBSE track at GECCO has provided an opportunity to present SBSE research to the evolutionary computation community, and for SBSE to be informed by advances in evolutionary computation.
We invite papers that address problems in the software engineering domain through the use of heuristic search techniques. We particularly encourage papers demonstrating novel search strategies or the application of SBSE techniques to new problems in software engineering. Papers may also address the use of methods and techniques for improving the applicability and efficacy of search-based techniques when applied to software engineering problems. While empirical results are important, papers that do not contain results - but instead present new approaches, concepts, or theory - are also very welcome.

SCOPE
As an indication of the wide scope of the field, search techniques include, but are not limited to:
Ant Colony Optimization, Automatic Algorithm configuration and Parameter Tuning, Estimation of Distribution Algorithms,
Evolutionary Computation, Hybrid and Memetic Algorithms, Hyper-heuristics, Iterated Local Search,
Particle Swarm Optimization, Simulated Annealing, Tabu Search, Variable Neighbourhood Search.

The software engineering tasks to which they are applied are drawn from throughout the engineering lifecycle and include, but are not limited to:
Automated Software Design and Hyper-Heuristics
Automatic Algorithm Selection and Configuration
Configuring Cloud-Based Architectures
Creating Recommendation Systems to Support Software Development
Developing Dynamic Service-Oriented Systems
Enabling Self-Configuring/Self-Healing/Self-Optimizing Systems
Network Design and Monitoring
Optimizing Functional and Non-Functional Software Properties (Genetic Improvement)
Predictive Modelling for Software Engineering Tasks
Project Management and Organization
Regression Test Optimization
Requirements Engineering
Software Maintenance, Program Repair, Refactoring and Transformation
Software Security
System and Software Integration
Test Data Generation

REVIEW PROCESS
Each paper submitted to the track will be rigorously evaluated in a double-blind review process. Paper evaluation at GECCO occurs on a per-track basis, ensuring high interest and expertise of the reviewers. Review criteria include significance of the work, technical soundness, novelty, clarity, writing quality, and sufficiency of information to permit replication, if applicable. All accepted papers will be published in the ACM Digital Library.

Yours,
Federica Sarro (f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>), Senior Research Associate, CREST, University College London, United Kingdom
and
Simon Poulding (simon.poulding@bth.se<mailto:simon.poulding@bth.se>), Assistant Professor, SERL, Blekinge Institute of Technology, Sweden

GECCO is sponsored by the Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

--
Dr. Federica Sarro
Senior Research Associate
CREST, Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
http://www0.cs.ucl.ac.uk/staff/F.Sarro/

**********************************************************
*
* 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 Multilevel Optimization

Call for Participation
----------------------

Workshop on

"MULTILEVEL OPTIMIZATION"

16th of December 2016, Zuse Insitute Berlin (ZIB), Berlin, Germany

Description
------------
Traditional mathematical optimization models are premised on the assumption
that there is a single decision to be made at a fixed point in time with a
fixed objective and that the decision-maker (DM) has deterministic
knowledge of all problem inputs. Multilevel/multistage optimization is a
generalized framework that allows for multiple (possibly competing) DMs
acting at multiple points in time. The framework subsumes both game
theoretic models, in which multiple DMs with competing objectives make
decisions sequentially, and recourse models, in which a single DM must make a sequence
of decisions over time in order to react to changing conditions.

In this workshop, we'll discuss the basic concepts underlying this approach
to modeling real-world optimization problems, focusing particularly on the
challenging case in which the models involve discrete decisions. We'll
first discuss the modeling framework itself, what types of applications
it's appropriate for, and what makes solution of these problems inherently
challenging. We'll then discuss the underlying theory, especially the
duality theory that lies at the heart of solution algorithms. Finally,
we'll discuss practical solution algorithms.

Speaker
------------

This workshop is held by Ted Ralphs.

Ted Ralphs received his Ph.D. in Operations Research from Cornell
University in 1995. He is currently a professor in the Department of
Industrial and Systems Engineering (ISE) at Lehigh University, where he
is director of the Laboratory for Computational Optimization Research at
Lehigh (COR@L) and chair of Lehigh's Research Computing Steering
Committee. He is a co-founder of the COIN-OR Foundation, a non-profit
foundation promoting the development of open source software for
operations research and is currently chair of the Technical Leadership
Council and a member of the Strategic Leadership Board, as well as
project manager of a number of projects hosted in the COIN-OR open
source software repository. His research interests include development
of methodology for solving discrete optimization problems, including
those with multiple levels or multiple objectives; development of
parallel search algorithms; development of open source software; and
applications of discrete optimization.

Organization
------------
The workshop will take place in the main lecture hall of ZIB (www.zib.de),
start at 9:30 am, and finish around 2:00 pm. There will be a
break around noon.

Registration
------------
The number of participants is limited, so please send an E-Mail with the
subject "Registration Multilevel Optimization Workshop" to hennig@zib.de
containing your name and your affiliation.

**********************************************************
*
* 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] 3 tenurable positions at UNSW, Sydney, Australia

Job Title: Lecturer/Senior Lecturer (3 Positions)

Location: School of Mathematics and Statistics, University of New South Wales, Sydney, Australia

One of Australia's leading research & teaching universities
Vibrant campus life with a strong sense of community & inclusion
Enjoy a career that makes a difference by collaborating & learning from the best
At UNSW, we pride ourselves on being a workplace where the best people come to do their best work.

The School of Mathematics and Statistics is a major centre of research and teaching in the mathematical sciences. The School has notable strengths in fundamental research right through to cutting edge applications. It is seeking appointments at a Lecturer or Senior Lecturer level for candidates whose teaching and research interests align with one or more of its existing teaching and research programs (http://www.maths.unsw.edu.au).

About the role:
A$98K - A$137K per year (plus 17% superannuation and leave loading)
3 tenure track positions (5 years) with one position being in the area of Statistics

Applicants should have:
-PhD or equivalent qualification in a relevant mathematical science
-Demonstrated research ability in Applied Mathematics, Pure Mathematics, or Statistics, which align with the research strengths in the School
-Evidence of effective teaching experience
-Strong publication record in top, peer-reviewed journals
-A capacity to continue productive research at the international level
-A record of, or demonstrated potential for, success in external research funding
-Strong commitment to independent research and research leadership
-Additional criteria apply for the Senior Lecturer (Level C) position, please refer to the selection criteria in the position description.

Applicants may be required to undergo pre-employment checks prior to appointment to these roles. Applications should be made on-line and should systematically address the selection criteria in their applications. Women and people from EEO groups are particularly encouraged to apply.

Having read the documentation, you may direct any enquiries to:

Professor Bruce Henry

Email: b.henry@unsw.edu.au

Applications close 13 January 2017 (AEST)

For full details of this position and application procedure, go to http://www.jobs.unsw.edu.au/

Find out more about working at UNSW at https://www.maths.unsw.edu.au

UNSW is an equal opportunity employer committed to diversity

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

[DMANET] PhD studentship in optimization, Strathclyde Business School (Glasgow, UK)

A PhD studentship in optimization is available at the Dept. of Management Science, University of Strathclyde Business School, Glasgow, UK. Funding is available to cover 3 years of tuition fees plus a tax free stipend (£14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20).

The studentship is open to candidates from any nationality (UK/EU/international), and the project topic is entitled "Optimization of Offshore Renewable Energy Arrays for Minimal Life-Cycle Costs".

The application deadline is 31st January 2017 Tuesday.

ABOUT THE PROJECT

A fundamental difficulty in developing offshore renewable energy (ORE) sites is that the uncertain environmental conditions make accurately assessing the life-cycle costs of a site a challenging problem. In particular, logistical operations throughout the life of a site are subject to uncertain operating conditions, and it is therefore difficult to plan and schedule these operations, and to estimate the resulting durations and costs. Similarly, the generating potential throughout the operation of a given site is dependent on the realised weather as well as the availability of each asset, and uncertainties in each of these make it difficult to accurately predict the profits to be gained from energy production. Decisions on aspects such as the size, layout and composition of a site are therefore difficult to accurately quantify and compare.

This project will aim to develop optimisation models to identify the best strategy for designing an ORE site. A complimentary PhD project in the Dept. of Naval Architecture, Ocean and Marine Engineering at Strathclyde will take an alternative approach to the problem, and as both projects progress in parallel, mutual developments will feed into both projects. This will provide a cross-disciplinary approach to a challenging research problem with potential industry impact.

FUNDING AND ELIGIBILITY

Funding is available to cover 3 years of tuition fees for a UK/EU/international student, plus a tax free stipend of £14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20. The student will be given opportunities to attend a conference and/or specialized training every year.

The PhD project requires a highly numerate graduate with interests in renewable energy. Candidates should have at least a strong Honours degree or equivalent (a strong 2:1 Honours degree, or a B.Sc. degree with 3.3 GPA in a 4.0 system), or preferably a Master's degree in a quantitative discipline such as industrial engineering, operations research, mathematics or computer science (amongst others). Experience in programming and fundamental knowledge in optimization are not essential but highly desirable. Candidates who are not native English speakers will be required to provide evidence for their English skills (such as by IELTS or similar tests that are approved by UKVI, or a degree completed in an English speaking country).

Applications are admitted until 31st January 2017 Tuesday, or until a suitable candidate is found thereafter.

HOW TO APPLY

All PhD applications are to be made online at http://pgr.strath.ac.uk/. All documents (including scans of original documents) can be uploaded during the online application process. Candidates are expected to submit a cover letter, CV, any university degree certificates and transcripts, English test results (if applicable), two recommendation letters (or contact details of two referees, if letters are not available to them), and any other supporting documents. In order to be considered for this studentship, candidates should specifically note the title of this project in their online application when prompted about funding and their source of finance, and they should notify Ms Alison Kerr via email (see below for details) when they have submitted their online application, noting that they are willing to apply to this specific studentship.

More information about the department can be found here: http://www.strath.ac.uk/business/managementscience/

Informal enquiries about the projects to Dr Kerem Akartunali (kerem.akartunali@strath.ac.uk) or Dr Euan Barlow (euan.barlow@strath.ac.uk).

Enquiries regarding applications (including notifying your scholarship application) to: Ms Alison Kerr (alison.kerr@strath.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] SPAA 2017 and PODC 2017 Call for Workshops and Tutorials

CALL FOR WORKSHOPS AND TUTORIALS

SPAA 2017 and PODC 2017
July 24-27, 2017, Washington, D.C., USA
http://spaa.acm.org/
http://www.podc.org/

The 29th ACM Symposium on Parallelism in Algorithms and Architecture (SPAA 2017) and the 36h Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2017) invites proposals for half-day and full-day workshops and tutorials that are closely related to the current scope of the conference or are new emerging research fields complementing or extending it, including but not restricted to:

- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, architectures, services, protocols, applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, synchronization protocols, concurrent programming
- fault-tolerance, reliability, availability, self-organization, self-stabilization
- codes and reliable communication
- Internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning based distributed algorithms
- distributed operating systems, middleware platforms, databases
- game-theoretic approaches to distributed computing
- distributed mechanisms design
- peer-to-peer systems, overlay networks, distributed data management
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents and robots
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- distributed cryptocurrencies and blockchain protocols
- quantum and optics based distributed algorithms
- nanonetworks
- biological distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems

Workshops and tutorials will be held in conjunction with SPAA and PODC on Sunday, July 23, 2017 and on Friday, July 28, 2017. Interested members of the community are invited to send proposals for workshops and tutorials by email to the workshops and tutorials coordinator:

Leonid Barenboim <leonidb@openu.ac.il>

The following are required in a workshop or a tutorial proposal:

- Title of the workshop or tutorial;
- An abstract describing the main focus of the workshop or tutorial and why it would be of interest to the SPAA and PODC community;
- Names and contact information of the organizers;
- The duration of the workshop or tutorial;
- For the workshops, we need the estimated number of submitted and accepted papers, and a brief description of the review process.
- Declare, if any, your preference regarding the date (Sunday, July 23, 2017 or Friday, July 28, 2017).

The proposals should be submitted to the workshops and tutorial coordinator as soon as possible, but no later than

Friday, January 6, 2017.

Decision on the proposals will be made no later than January 15, 2017. The organizers may opt to review and decide on the proposals on a first-come-first-served basis.

We are happy to announce that the following workshops have been already accepted to be collocated with PODC 2017.

- The 5th Workshop on Biological Distributed Algorithms (BDA 2017)
- The 4th Workshop on Adaptive Resource Management and Scheduling for Cloud Computing (DeMIST 2017)

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

[DMANET] PODC 2017 Call for Papers

PODC 2017
36th ACM Symposium on Principles of Distributed Computing
July 25-27, 2017, Washington, D.C., USA
http://www.podc.org/

FIRST CALL FOR PAPERS

DATES

Submission of papers: 23:59 EST, February 9th, 2017
Notification of acceptance: April 26th, 2017
Camera ready copy due: May 20th, 2017
Conference: July 25th - 27th, 2017

SCOPE

The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The common goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to, the following:

- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, protocols, applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, concurrency, synchronization
- fault-tolerance, reliability, self-organization, self-stabilization
- Internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning distributed algorithms
- distributed operating systems, middleware, databases
- biological distributed algorithms
- game-theoretic approaches to distributed computing
- peer-to-peer systems, overlay networks
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- quantum and optics based distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems

PAPER SUBMISSION

Papers are to be submitted electronically, following the guidelines on the conference web page (www.podc.org). Submission must be in English, in pdf format. The papers must be formatted as follows: letter-size paper (8.5x11 inch), single-column, using at least 1 inch margins, 11-point font. Submissions not conforming to these rules as well as the papers outside of the scope of the conference will be rejected without consideration.

A regular paper submission must report on original research that has not been previously or concurrently published; concurrent submissions to journals or conferences are not permitted. A regular submission must begin with a cover page containing: 1) title, with the subtitle "Regular Submission", 2) author names and affiliations, 3) contact author's email, address, and telephone number, 4) one paragraph abstract of the paper, 5) indication of whether at least one author is a full-time student and the paper is eligible for best student paper award. The paper must not exceed 10 pages (excluding cover page and references). All of the ideas necessary for an expert to verify fully the central claims in the paper should be included, some of which may be placed in a clearly marked appendix that will be read at the discretion of the program committee. If desired, the authors can simply attach a copy of the full paper as the appendix.

A submission for a brief announcement must be at most 3 pages, including title, authors' names and affiliations, and references. Such submissions may describe work in progress or work presented elsewhere. The title of a brief announcement must begin with the words "Brief Announcement:".

If requested by the authors on the cover page, a regular submission that is not selected for a regular presentation will be considered for the brief announcement format. This will not affect consideration of the paper for a regular presentation.

PUBLICATION

Regular papers of up to 10 pages and brief announcements of up to 3 pages will be included in the conference proceedings. Extended and revised versions of selected papers will be considered for a special issue of the Distributed Computing journal. Two papers will be considered for publication in JACM.

ORGANIZATION

Program Committee:

Lorenzo Alvisi - University of Texas Austin and Cornell University, USA
Hagit Attiya - The Technion, Israel
Michael Bender - Stony Brook University, USA
Borzoo Bonakdarpour - McMaster University, Canada
Silvia Bonomi - Sapienza Universita di Roma, Italy
Christian Cachin - IBM Research, Switzerland
Irina Calciu - VMware Research, USA
Bogdan Chlebus - University of Colorado Denver, USA
Carole Delporte-Gallet - Universite Paris Diderot, Paris 7, France
Shlomi Dolev - Ben-Gurion University, Israel
Greg Eisenhauer - Georgia Tech, USA
Faith Ellen - University of Toronto, Canada
Panagiota Faturu - University of Crete, Greece
Antonio Fernandez Anta - IMDEA, Spain
Paola Flocchini - University of Ottawa, Canada
Chryssis Georgiou - University of Cyprus, Cyprus
Andreas Haeberlen - University of Pennsylvania, USA
Magnus Halldorsson - Reykjavik University, Iceland
Anne-Marie Kermarrec - INRIA, Rennes, France
Aggelos Kiayias - Edinburgh University, UK
Kishori Konwar - MIT, USA
Nancy Lynch - MIT, USA
Calvin Newport - Georgetown University, USA
Cristina Nita-Rotaru - Northeastern Univ, USA
Merav Parter - Weizmann Institute, Israel
Andrzej Pelc - University of Quebec, Canada
Franck Petit - Universite Pierre-et-Marie-Curie, Paris 6, France
Maria Potop-Butucaru - Universite Pierre-et-Marie-Curie, Paris 6, France
Michel Raynal - IRISA, Rennes, France
Andrea Richa - Arizona State University, USA
Luis Rodrigues - IST, ULisboa, Portugal
Elad Schiller - Chalmers University Tech., Sweden
Alexander Schwarzmann, Chair - University of Connecticut, USA
Robert Soule - USI, Lugano, Switzerland
Paul Spirakis - University Liverpool, UK & CTI, Greece
Gadi Taubenfeld - IDC Herzliya, Israel
Nitin Vaidya - University of Illinois, USA
Robbert van Renesse - Cornell University, USA
Jennifer Welch - Texas A&M University, USA

Conference Committee:

Leonid Barenboim (Workshop Coordinator) - Open University of Israel, Israel
Bapi Chatterjee (Travel Grant Coordinator) - Chalmers University of Technology, Sweden
Jeremy Fineman (Organizing Chair) - Georgetown University, USA
Theo Hadjistasi (Proceedings Coordinator) - University of Connecticut, USA
Calvin Newport (Treasurer) - Georgetown University, USA
Elad Schiller (General Chair) - Chalmers University of Technology, Sweden
Alexander Schwarzmann (PC Chair) - University of Connecticut, USA
Jukka Suomela (Communication Chair) - Aalto University, Finland
Mark Tuttle (Publicity Chair) - Amazon, USA

Steering Committee:

Nitin Vaidya, Chair (2015-2018) - University of Illinois, USA
Pierre Fraigniaud (2015-2017) - CNRS, Universite Paris-Diderot, France
Calvin Newport (2016-2018) - Georgetown University, USA
Andrzej Pelc (2015-2018) - Universite du Quebec en Outaouais, Canada
Alexander Schwarzmann (2016-2019) - University of Connecticut, USA
Paul Spirakis (2014-2017) - University of Liverpool, UK
Elad Schiller (2015-2017) - Chalmers University of Technology, Sweden

**********************************************************
*
* 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: Special Issue on "Customized Assembly Systems" - OMEGA - The International Journal of Management Science

Dear Colleague,

We are pleased to announce the Call for Papers for the Special Issue on
***********************************
Customized Assembly Systems
***********************************
in OMEGA - The International Journal of Management Science (SNIP: 3.198; SJR: 4.533; IF: 4.376).

The submission deadline is December 31, 2016 and the special issue is scheduled to publication in 2017.

This special issue aims to provide a forum for the latest developments in Management Science on the design, optimization, and management of highly customized assembly systems, taking into account the accelerating evolution of technology, management practices, and production strategies. The objective of the special issue is to disseminate the fundamental theoretical knowledge necessary to support comprehensive decision making in the industry. Topics should focus on mass customization, discuss possible applications, and include, but not be limited to, the use of analytical and optimization approaches as well as of empirical research to address significant theoretical and practical issues in the following areas:

• Assembly systems as a part of integrated decision making
• Performance analysis for assembly systems
• Forecasting methods for mass customization in assembly systems
• Value-driven, uncertainty-aware data processing in assembly lines
• Robust assembly systems
• Sustainability issues in assembly systems, including environmental impact assessment and reduction as well as ergonomics issues and human factors
• Multiple-criteria decision making and multi-objective optimization in assembly systems
• Design of assembly systems and equipment selection
• Logistics and part feeding in assembly systems
• Inventory management and production planning in assembly systems
• Assembly line balancing
• Lot sizing and sequencing of workpieces in assembly systems
• Job scheduling and job rotation in assembly systems

All manuscripts should be submitted via the online editorial system of OMEGA, at http://www.journals.elsevier.com/omega/. Please submit only papers that have not been previously published and are not currently under consideration for publication elsewhere. Manuscripts will be refereed according to OMEGA's normal standards and procedures.

The full call for papers can be downloaded on the publisher's website:
http://www.journals.elsevier.com/omega/call-for-papers/call-for-papers-customized-assembly-systems

Special Issue Guest Editors:
Olga Battaïa (ISAE-SUPAERO,France); Alena Otto & Erwin Pesch (University of Siegen, Germany); Fabio Sgarbossa (University of Padua, Italy).

--
Dr. Alena Otto
Department of Management Information Science
Faculty III
University of Siegen
Kohlbettstraße 15
57068 Siegen, Germany

Tel.: +49 (0) 271-740-2986
Mobil: +49 (0) 17759 77144
Email: alena.otto@uni-siegen.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/
*
**********************************************************

[DMANET] 9th International Conference on Computational Collective Intelligence (ICCCI 2017): Second Call for Papers and Special Sessions & Workshops Proposals

*** Second Call for Papers and Special Sessions & Workshops Proposals ***

9th International Conference on Computational Collective Intelligence

ICCCI 2017

Hilton Cyprus, Nicosia, Cyprus

27 - 29 September, 2017

http://www.cs.ucy.ac.cy/~george/lm/lm.php?tk=ZG1hbmV0CQkJZG1hbmV0QHpwci51bmkta29lbG4uZGUJOXRoIEludGVybmF0aW9uYWwgQ29uZmVyZW5jZSBvbiBDb21wdXRhdGlvbmFsIENvbGxlY3RpdmUgSW50ZWxsaWdlbmNlIChJQ0NDSSAyMDE3KTogU2Vjb25kIENhbGwgZm9yIFBhcGVycyBhbmQgU3BlY2lhbCBTZXNzaW9ucyAmIFdvcmtzaG9wcyBQcm9wb3NhbHMJOTgJTGlzdHMJMjMzCWNsaWNrCXllcwlubw==&url=http%3A%2F%2Fcyprusconferences.org%2Ficcci2017%2F

Computational Collective Intelligence is most often understood as an AI
subfield dealing with soft computing methods which enable making group
decisions or processing knowledge among autonomous units acting in
distributed environments. Web-based systems, social networks and
multi-agent systems very often need these tools for working out consistent
knowledge states, resolving conflicts and making decisions. ICCCI 2017 is
the 9th edition of the conference organized by the University of Cyprus and
Wroclaw University of Science and Technology in Poland, in cooperation with
the IEEE SMC Technical Committee on Computational Collective Intelligence.
The aim of the conference is to provide an internationally respected forum
for scientific research in the computer-based methods of collective
intelligence and their applications in (but not limited to) such fields as
group decision making, consensus computing, knowledge integration,
semantic web, social networks and multi-agent systems.

Instructions to Authors

Prospective authors of papers are invited to submit contributions for
presentations at ICCCI 2017. The submissions should present the results
of original research or innovative practical applications relevant to the
conference topics. Practical experiences with state-of-the-art in CCI
methodologies are also acceptable to reflect lessons of unique value for
the conference attendees. Contributions should be original and not
published elsewhere or intended to be published during the review process.

The conference language is English.

The conference proceedings of ICCCI 2017 will be published in the
prestigious Lecture Notes in Artificial Intelligence series by Springer and
indexed by ISI(CPCI-S), Web of Science, EI, Scopus, DBLP, ACM Digital
Library. All submissions should follow the LNCS/LNAI style and not
exceed 10 pages. At least one full registration is required for each
accepted paper in order to be included in the ICCCI 2017 proceedings.

Each paper is to be submitted electronically as a single PDF file through
EasyChair at http://www.cs.ucy.ac.cy/~george/lm/lm.php?tk=ZG1hbmV0CQkJZG1hbmV0QHpwci51bmkta29lbG4uZGUJOXRoIEludGVybmF0aW9uYWwgQ29uZmVyZW5jZSBvbiBDb21wdXRhdGlvbmFsIENvbGxlY3RpdmUgSW50ZWxsaWdlbmNlIChJQ0NDSSAyMDE3KTogU2Vjb25kIENhbGwgZm9yIFBhcGVycyBhbmQgU3BlY2lhbCBTZXNzaW9ucyAmIFdvcmtzaG9wcyBQcm9wb3NhbHMJOTgJTGlzdHMJMjMzCWNsaWNrCXllcwlubw==&url=https%3A%2F%2Feasychair.org%2Fconferences%2F%3Fconf%3Diccci2017 .
To ensure high quality, all papers will be thoroughly reviewed by the ICCCI
2017 International Program Committee. Referees will be asked to nominate
papers for a Best Paper award to be announced at the conference.
All accepted papers must be presented by one of the authors who must
register for the conference and pay the author registration fee.
A selected number of accepted and personally presented papers, will be
expanded and revised for possible inclusion in special issues of high
quality scientific journals.

Topics of Interest

We welcome all submissions in the subjects of CCI related (but not limited)
to the following topics:

· Agent Theory and Application
· Automated Reasoning
· Cognitive Modeling of Agent Systems
· Collective Intelligence
· Collective Processing
· Computational Biology
· Computer Vision
· Computational Intelligence
· Computational Security
· Consensus Computing
· Cooperative Systems and Control
· Cybernetics for Informatics
· Data Integration
· Data Mining for Social Networks
· Distributed Intelligence
· Evolutionary computing
· Fuzzy Systems
· Geographic Information Systems
· Grey Theory
· Group Decision Making
· Hybrid Systems
· Information Retrieval and Integration
· Information Hiding
· Intelligent Architectures
· Intelligent Applications
· Intelligent Buildings
· Intelligent Control
· Intelligent E-learning/Tutoring
· Intelligent Image Processing
· Intelligent Networks
· Intelligent Transportation Systems
· Knowledge Integration
· Knowledge Representation
· Knowledge-Based Systems
· Logic in Intelligence
· Machine Learning
· Mobile Intelligence
· Multicriteria Decision Making
· Natural Language Processing
· Optimization and Swarm Intelligence
· Pattern Recognition
· Probabilistic and Uncertain Reasoning
· Rough Sets
· Semantic Web
· Smart Living Technology
· Smart Sensor Networks
· Soft Computing
· Social Networks
· Ubiquitous Computing
· Web Intelligence and Interaction

Call for Special Sessions and Workshops Proposals

ICCCI 2017 invites proposals for Special Sessions and Workshops to be
held during the conference. They intend to provide researchers in focused
areas the opportunity to present and discuss their work, as well as to
offer a forum for interaction among a broader community of researchers.
A Special Session or Workshop will consist of a group of papers in a
sub-discipline of Computational Collective Intelligence related to the
main topics of ICCCI 2017.

The papers will be required to meet the same standards as ICCCI 2017
papers and will be published in the conference proceedings, in a bound
volume by Springer in their Lecture Notes in Artificial Intelligence series.
All the Special Sessions and Workshops will be centralized as tracks in the
same conference submission and reviewing system (EasyChair) as the
regular papers.

Please send the Special Session and Workshop proposals with the following
information:
· Title & acronym of the special session
· Brief profiles of special session organizers
· General description of the special session scope
· List of topics
· Proposed Session Program Committee (to be invited)

The format for the Special Session or Workshop proposal should follow
the pattern of the template available on the conference web site.

The organizers will be responsible for the advertisement and promotion of
the Special Sessions or Workshops and the conference including the Special
Sessions and Workshops webpage preparation. The management of papers
review will be achieved by Special Session and Workshops Committees, using
the Conference System (a separate EasyChair track will be provided for each
Special Session and Workshop). The organizers are responsible for managing
the review process. All the reviews should be submitted through EasyChair.
Each paper should obtain at least two reviews.

For Special Sessions and Workshops Issues please contact:
Bogdan Trawinski
Wroclaw University of Science and Technology, Poland
bogdan.trawinski@pwr.edu.pl

Important Dates

· Special Session & Workshop Proposals: February 15, 2017
· Special Session & Workshop Acceptance: February 22, 2017
· Submission of Papers: April 1, 2017
· Notification of Acceptance: May 1, 2017
· Camera-ready Submission: May 15, 2017
· Registration and Payment for Authors: June 15, 2017
· Conference Dates: September 27-29, 2017

Organization

Honorary Chairs
· Costas Christophides, Rector of University of Cyprus, Cyprus
· Pierre Lévy, University of Ottawa, Canada
· Cezary Madryas, Rector of Wroclaw University of Technology, Poland

General Chairs
· Ngoc Thanh Nguyen, Wroclaw University of Science and Technology, Poland
· George A. Papadopoulos, University of Cyprus, Cyprus

Program Chairs
· Costin Badica, University of Craiova, Romania
· Piotr J?drzejowicz, Gdynia Maritime University, Poland
· Kazumi Nakamatsu, University of Hyogo, Japan

Organising Chair
· Georgia Kapitsaki, University of Cyprus, Cyprus

Special Sessions and Workshops Chairs
· Achilleas Achilleos, University of Cyprus, Cyprus
· Bogdan Trawinski, Wroclaw University of Science and Technology, Poland

Doctoral Track Chair
· George Pallis, University of Cyprus, Cyprus

Publicity Chair
· Christos Mettouris , University of Cyprus, Cyprus

Local Organising Committee
· Marios Komodromos, University of Cyprus, Cyprus
· Christos Mettouris, University of Cyprus, Cyprus
· Rafa? Kern, Wroclaw University of Science and Technology, Poland
· Marcin Pietranik, Wroclaw University of Science and Technology, Poland
· Zbigniew Telec, Wroclaw University of Science and Technology, Poland

Steering Committee
· Ngoc Thanh Nguyen (chair), Wroclaw University of Science and Technology,
Poland
· Piotr J?drzejowicz, Gdynia Maritime University, Poland
· Shyi-Ming Chen, National Taiwan University of Science and Technology,
Taiwan
· Kiem Hoang, University of Information Technology, VNU-HCM, Vietnam
· Lakhmi C. Jain, University of South Australia, Australia
· Geun-Sik Jo, Inha University, Korea
· Janusz Kacprzyk, Polish Academy of Sciences, Poland
· Ryszard Kowalczyk, Swinburne University of Technology, Australia
· Toyoaki Nishida, Kyoto University, Japan
· Manuel Núñez, Universidad Complutense de Madrid, Spain

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

[DMANET] ORBEL - call for abstracts

ORBEL31
Call for abstracts
KU Leuven campus Brussels
2-3 February 2017
http://www.orbel.be/orbel31/
 
The next ORBEL conference, the yearly conference of the Belgian Operational Research Society, will take place at the KU Leuven campus Brussels on 2 and 3 February 2017.
This conference is the meeting point of the Operational Research Community in Belgium and its neighboring countries. It is an excellent opportunity for researchers, young and old, to present their work and make contact with people working on related subjects.
Conference topics include (but are not limited to):
. continuous, discrete or stochastic optimization, graphs and networks, multicriteria decision making, decision theory, game theory, simulation, queueing theory, complexity theory, data mining, ...;
. supply chain management, production planning, scheduling, project management, transportation and traffic management, energy management, DEA and performance management, financial modelling, ...;
. applications in industry, in the energy sector, in life sciences and in bioinformatics, in public services, in engineering, in sports, in health care institutions, in banking, in telecommunications, ...
 
Plenary speakers
Prof. Marco Lübbecke (RWTH Aachen University, Chair of Operations Research)
Prof. James Cochran (University of Alabama)
 
To present your work at ORBEL31, we invite you to submit an abstract through the conference website (http://www.orbel.be/orbel31/).
 
Important dates:
. Abstract submission: December 16, 2016.
. Abstract acceptance: December 23, 2016.
. Early registration: January 13, 2017.
. Conference: February 2-3, 2017.
 
For more information, registration or abstract submission, go to the conference website:
http://www.orbel.be/orbel31/

We look forward to meeting you in Brussels, on 2 and 3 February 2017!

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

[DMANET] POSTDOC POSITION AVAILABLE

Postdoctoral Position in Multiple Facility Location
PSL Research University (École normale supérieure Paris and University
Paris-Dauphine)

A one year (12 months) postdoctoral position is currently open in the AGaPe
group of the LAMSADE, University Paris-Dauphine and the TALG group, École
normale supérieure.

The successful candidate should have a PhD degree in computer science or
mathematics and should have a strong publication record in Theoretical
Computer Science.

Applications will be reviewed starting from December 5, 2016 until the
position is filled. The starting date is flexible but on September 1, 2017
at the latest.

Applications (including a cover letter, a curriculum vitae, a list of
publications, and the names and contact information of at least two
references) must be sent to Vangelis Paschos, paschos@lamsade.dauphine.fr

--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine and CNRS
http://www.lamsade.dauphine.fr/~paschos/

**********************************************************
*
* 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] Third Call for Papers - Genetic and Evolutionary Computation Conference 2017

** Call for Papers **

2017 Genetic and Evolutionary Computation Conference (GECCO 2017)
July, 2017, Berlin, Germany
http://gecco-2017.sigevo.org/

The Genetic and Evolutionary Computation Conference (GECCO 2017) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include: genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and more.

The GECCO 2017 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Abstracts need to be submitted by January 30, 2017. Full
papers are due by the non-extensible deadline of February 6, 2017. Note
that the submission system will be online from November, 14 on the
official site.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. The evaluation is on a per-track basis,
ensuring high interest and expertise of the reviewers. Review criteria
include significance of the work, technical soundness, novelty, clarity,
writing quality, and sufficiency of information to permit replication,
if applicable. All accepted papers will be published in the ACM Digital
Library. Researchers are invited to submit abstracts of their work
recently published in top-tier conferences and journals to the Hot Off
the Press track. Contributions will be selected based on quality and
interest to the GECCO community.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:

- Submit a final, revised, camera-ready version to the publisher on or
before the camera ready deadline
- Register at least one author to attend the conference on or before
the advance registration deadline
- Attend the conference (at least one author)
- Present the accepted paper at the conference

Important Dates:

Abstract Deadline: **January 30, 2017**
Submission of Full Papers: **February 6, 2017**
Conference [tentative]: **15-19 July, 2017**

********
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

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

[DMANET] 2nd call for the Special Track Game AI at IEA/AIE 2017 (abstract Dec. 08, paper Dec. 15)

Special Track Game AI at IEA/AIE 2017, June 27-30, 2017 Arras (near
Paris, France)

Context

Among numerous possibles applications of Artificial Intelligence, games
are convenient and efficient testbeds to develop innovating techniques
and methods. By games, we mean every game playable through a computer:
video games, board games, serious games, etc.

Behind the fun side, games propose a simplified environment regarding to
the real world, while remaining rich enough to also propose
scientifically pertinent problems: understanding of a dynamic
environment, knowledge extraction, decision-making upon incomplete
information, planning, cooperation, learning or mimicking credible
behaviors, optimization, path-finding, etc.

Many of these problems are common to others research fields such as
robotics, but games offer a greater flexibility: thanks to their
dematerialized nature, these environments are inexpensive,
transportable, need no physical maintenance and propose a highly
controllable time flow (accelerated, paused, etc).

Scope

Topics of interest for this special track on Game AI include, but are
not limited to:

* Planning;
* Decision-making in a dynamic and/or incomplete information environment;
* Data-mining;
* CSP/SAT, combinatorial optimization;
* Cooperative or competitive multi-agent systems;
* Game rules and/or behaviors learning;
* Spacial and temporal reasoning;
* Credible behaviors (emotion, personality), player immersion;
* Storytelling generation;
* User experience;
* Path-finding;
* Game play programming;
* Engine programming;
* Serious games/applications, Game with A Purpose (GWAP).

To submit:

Please submit your abstract and paper on easychair:
https://easychair.org/my/conference.cgi?conf=ieaaie2017

Important dates

*

Abstract Submission Deadline: December 8th, 2016

*

Paper Submission Deadline: December 15th, 2016

*

Notification of acceptance: February 6th, 2017

Preliminary Program Committee

Carole Adam (Universite de Grenoble)
Stephane Cardon (Saint-Cyr Coetquidan)
Tristan Cazenave (Universite Paris Dauphine), Chair
Mike Cook (Goldsmiths University of London)
Eric Jacopin (Saint-Cyr Coetquidan)
Mehdi Kaytoue (Insa Lyon)
Arnaud Lallouet (Huawei Technologies Ltd.)
Philippe Mathieu (Universite Lille 1)
Santiago Ontañòn (Drexel University)
Eric Piette (Universite d'Artois)
Chedy Raissi (Inria Nancy Grand-Est)
Florian Richoux (Universite de Nantes), Chair
Abdallah Saffidine (University of New South Wales)
Ruck Thawonmas (Ritsumeikan University)

--
Florian RICHOUX - Associate Professor
www.richoux.fr | LINA - Université de Nantes
florian.richoux@univ-nantes.fr | 2 chemin de la Houssinière, BP92208
+33 (0)2 51 12 58 44 | 44322 NANTES cedex 3, FRANCE

**********************************************************
*
* 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] Postdoc Position in Network Optimization and Energy Applications

Sent of behalf of Dr Richard Middleton.

Dr Jesse O'Hanley
University of Kent

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

We have just posted an advert for a postdoc position in "Network
Optimization
and Energy Applications"
(https://jobszp1.lanl.gov:443/OA_HTML/OA.jsp?OAFunc=IRC_VIS_VAC_DISPLAY&OAMC=R&p_svid=53566&p_spid=2434275&p_lang_code=US).

We seek someone with a background in OR/network optimization, that can
code, could develop a heuristic or other efficient solutions for network
problems, and has a background or interest in energy application such as
CO2
capture and storage (CCS). The chosen candidate would be involved in
several
exciting projects including applications in both in the United States
and China.
Los Alamos National laboratory (LANL) is a great place to work, the
salary is
competitive, and New Mexico is a special place to live.

Please feel free to contact me (rsm@lanl.gov) regarding any enquirers.

Sincerely,
Richard Middleton

-----------------------------------------
Dr. Richard S. Middleton
Senior Scientist and Team Leader (Applied Terrestrial, Energy, and
Atmospheric
Modeling; ATEAM)
Earth and Environmental Sciences
Los Alamos National Laboratory
MS T003
Los Alamos, NM 87545, USA
Office: +1-505-665-8332
Email: rsm@lanl.gov
**********************************************************
*
* 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] Postdoctoral research fellowship in probability and combinatorics at Birmingham

Applications are invited for a postdoctoral Research Fellow position at the
School of Mathematics at the University of Birmingham (UK) in probability,
combinatorics, and algorithms funded by an EPSRC project (PI: Will
Perkins) "New
approaches to Gibbs measures at the interface of probability and
computational complexity."

http://www.jobs.ac.uk/job/AVX780/research-fellowship-in-
probability-and-combinatorics/

This post is available for a period of one year, with a starting date
between 1 May 2017 and 1 October 2017.

The successful candidate will join the Combinatorics, Probability, and
Algorithms group in the School of Mathematics at the University of
Birmingham. The profile and research interests of this group may be found
at:

http://web.mat.bham.ac.uk/combinatorics/main.html
<http://www.jobs.ac.uk/job/AVX780/research-fellowship-in-probability-and-combinatorics/%20http%3A/web.mat.bham.ac.uk/combinatorics/main.html>

Applicants should have a PhD in mathematics awarded or submitted at the
time of taking up the position, a strong record of research and
publications, and familiarity with (some of) probability theory,
combinatorics, computational complexity, optimisation, or statistical
physics.

Informal enquiries about the position, the research programme, or
applications are very welcome and should be directed to Will Perkins (
w.f.perkins@bham.ac.uk).

The closing date is 1 January 2017. To download the details and submit an
electronic application online, visit www.hr.bham.ac.uk/jobs<http://
www.hr.bham.ac.uk/jobs> and search current vacancies using job # 56284.

**********************************************************
*
* 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] One Year Postdoctoral Position in Algorithms and Complexity

Application Deadline: 05-Dec-2016
Salary: £36,001 to £40,523 per annum
Location: Computer Science Department, University of Bristol, UK
Application link: http://bit.ly/2gdawB1

Based in the Department of Computer Science of the University of
Bristol you will carry out research within a project concerned with
the development of new algorithms as well as provable time and space
lower bounds. Our current work focuses on pattern matching in
dynamically changing data however we also have a broader interest in
other aspects of algorithms/theory research.

The post will require a high level of expertise in areas which may
include but not be limited to data structures and algorithms, discrete
probability, discrete mathematics and combinatorics.

Candidates with interests in both lower bounds and algorithms or only
one of the two are strongly encouraged to apply.

Algorithms and upper bounds

The emphasis will be on developing algorithms and data structures with
provable performance bounds. Depending on your interests, you may also
at times implement and test algorithms related to the proposal. A
particular focus will be on faster and/or more space efficient
algorithms for combinatorial pattern matching in dynamically changing
as well as streaming data.

Lower bounds

This part will have as its main focus the development of time and
space lower bounds. As a team we have in recent years shown new time
and space lower bounds for streaming problems as well as time-space
trade-offs for the element distinctness problem. This part of the role
will be to extend this work in this exciting area of research.

You will have a Ph.D. in theoretical computer science ("Track A") or
closely related area together with a strong track record of
international publications in algorithms or theoretical computer
science ("Track A") venues. This may include for example,
ICALP/SODA/STOC/FOCS. We also welcome applications from talented
computer scientists whose main interest has been in mainstream "Track
A" theory rather than specifically pattern matching.

In addition you will have excellent written and spoken communication
skills including the ability to explain and share deep concepts. You
will also have a strong mathematical background.

Please clearly state why you are interested in this post and how your
previous track record makes you suitable for the role.

The post is being offered on a full time, fixed term contract with
funding up to December 31 2017.

Informal enquiries to Raphael Clifford at clifford@cs.bris.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] Workshop "Extremal Combinatorics" at Warwick, 18-22 Sep 2017

This is the first announcement for the workshop "Extremal Combinatorics",
to take place at the University of Warwick, UK, on 18-22 September 2017.
The workshop aims to explore recent exciting developments in this active
research area.

Plenary speakers
================

Zoltán Füredi (UIUC and Rényi)
Penny Haxell (Waterloo)
Peter Keevash (Oxford)
Dan Král' (Warwick)
Daniela Kühn (Birmingham)
Imre Leader (Cambridge)
Deryk Osthus (Birmingham)
Tibor Szabó (FU Berlin)

Invited speakers (former group members)
================

Endre Csóka (Rényi)
&#321;ukasz Grabowski (Lancaster)
Hong Liu (Warwick)
Konstantinos Tyros (Koç)

We plan to include contributed talks by participants; if you would like to
propose a talk, please email your title and abstract to
excomb2017@warwick.ac.uk by 1 August 2017.

Registration closes on 17 August 2017. For more information, including
further details about registration and accommodation, see the webpage
http://go.warwick.ac.uk/excomb2017

Oleg Pikhurko
Katherine Staden
excomb2017@warwick.ac.uk
(organisers)

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

[DMANET] call for participation: PACE challenge 2017

Dear Colleagues,

We are happy to announce the second iteration of PACE, the Parameterized
Algorithms and Computational Experiments Challenge. The goal of PACE is
to investigate the applicability of algorithmic ideas studied and
developed in the subfields of multivariate, fine-grained, parameterized,
or fixed-parameter tractable algorithms. The challenge consists of two
separate tracks.

TRACK A (Treewidth Challenges)

1) Compute a tree-decomposition of minimum width. You have 30 minutes
per instance. Win by solving more instances than the other participants.

2) Compute some tree-decomposition. You have 30 minutes per instance.
Win by printing solutions of smaller width than the other participants.

Detailed instructions and fresh instance sets:
<https://pacechallenge.wordpress.com/pace-2017/track-a-treewidth/>

TRACK B (Minimum Fill-In Challenge)

Given an undirected graph G, compute a smallest set of edges E such that
adding E to G results in a chordal graph. You have 30 minutes per
instance. Win by solving more instances than the other participants.

Detailed instructions and an instance set:
<https://pacechallenge.wordpress.com/pace-2017/track-b-minimum-fill-in/>

TIMELINE

- December 1st, 2016: Announcement of the challenges
- March 1st, 2017: Submission of preliminary version for bugfixing and
leaderboard
- May 1st, 2017: Submission of final version
- June 1st, 2017: Announcement of the results
- September 4-8, 2017: Award ceremony at the International Symposium on
Parameterized and Exact Computation (IPEC 2017) in Vienna

PROGRAM COMMITTEE

Track A (tree width):
- Holger Dell (Saarland University and Cluster of Excellence (MMCI))

Track B (min fill-in):
- Christian Komusiewicz (chair) (Friedrich-Schiller-University Jena)
- Nimrod Talmon (Weizmann Institute of Science)
- Mathias Weller (Laboratory of Informatics, Robotics, and
Microelectronics of Montpellier (LIRMM))

STEERING COMMITTEE

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

Best,
The PACE Steering 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] IFORS 2016: Optimization for Public Transport: Call for sessions and papers

Call for Sessions within the Stream

===== OPTIMIZATION FOR PUBLIC TRANSPORT =====

at the 21st IFORS Conference
July 17-21, 2017 in Quebec, Canada

http://www.ifors2017.ca/

Following the success of the Public Transport stream on previous EURO
conferences, IFORS 2017 will again offer a stream "Optimization for Public Transport"
organized by Marie Schmidt and Anita Schöbel.

We are now looking both for session organizers and for papers fitting in this stream!

Would you be interested to organize a session of 4 talks on some particular
topic within this stream?
This task involves choosing the specific topic, contacting speakers and handling their
submission in the online system of the conference, to which you will then get access.
Usually, but not necessarily, the session organizer is also session speaker and/or chair.
If you are interested, please let us know.

In case you plan to present a paper within the stream, but do not want to organize
a full session, please let us know as well. We are glad to send you a session code
such that you may submit your paper in an invited session.

We are looking forward to a successful Public Transportation stream at IFORS 2017
and to meeting you in Quebec!

Anita and Marie

Marie Schmidt Anita Schöbel
Erasmus University Rotterdam University of Göttingen
schmidt2@rsm.nl schoebel@math.uni-goettingen.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/
*
**********************************************************

[DMANET] Funded PhD studentship in graph theory

School of Computing, University of Leeds is funding up to 6 PhD projects,

one of them in

Structure of hereditary graph classes and its algorithmic consequences.

Application deadline: January 6, 2017

For further information please see:

https://engineering.leeds.ac.uk/research-opportunity/201323/research-degrees/614/funded-studentships-in-the-school-of-computing-

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