Thursday, December 8, 2016

[DMANET] First announcement: 5th International Combinatorics Conference (5ICC)

#### First announcement ####
5th International Combinatorics Conference (5ICC)
Dates: Dec 4-9 2017
Venue: Monash University, Melbourne, Australia
Web: http://www.monash.edu/5icc/

5ICC is the fifth in a series of major combinatorics conferences that
are run once per decade by the Combinatorial Mathematics Society of
Australasia. Researchers in any area of discrete mathematics and its
applications are warmly invited. Students are also encouraged to attend,
and there will be a prize for the best student talk.

Plenary Speakers:
Bill Chen, Nankai University
Maria Chudnovsky, Princeton University
Charlie Colbourn, Arizona State University
Marston Conder, University of Auckland
David Eppstein, University of California, Irvine
Joanna Fawcett, Cambridge University
Jacob Fox, Stanford University
Daniela Kühn, Birmingham University
Barbara Maenhaut, University of Queensland
Brendan McKay, Australian National University
Alexander Scott, Oxford University
Paul Seymour, Princeton University
Le Anh Vinh, Vietnam National University

In the week prior to 5ICC, the Tutte Centenary Retreat will be held at
The Mathematical Research Institute MATRIX to celebrate 100 years since
the birth of the famous graph theorist Bill Tutte.

**********************************************************
*
* 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/MSc positions in Optimization at UBC

COCANA (Centre for Optimization Convex Analysis and Nonsmooth Analysis, https://ocana.ok.ubc.ca/) invites applications for PhD/MSc positions starting September 2017.

The positions will be based at the UBC Okanagan campus (http://ok.ubc.ca/). The PhD positions are fully funded for 4 years while the MSc positions are fully funded for 2 years (The MSc in Computer Science program mandate a minimum funding of $17,500/year.)

The first project is on road design optimization. The research is industry sponsored and include the opportunity to develop patents. Good programming skills (C/C++ preferred) are required, and optimization or operations research skills are desired.

The second project is on computational convex analysis and involves the creation of new algorithms to compute mathematical objects regularly used in convex analysis. The background required is in algorithms with good programming skills in high level languages (MATLAB, Scilab, or Octave), and a desire to learn convex analysis.

Historically students with a computer science background have been very successful in our program (and found positions at Google, Amazon, or Microsoft), as well as students with a mathematical background and strong programming skills.

Interested candidates should contact Dr. Yves Lucet, Professor, Computer Science, Associate Head Computer Science/Data Science at yves.lucet@ubc.ca. The deadline for funded applications is January 31, 2017.

--
Yves Lucet, PhD
Professor, Computer Science, Arts & Sciences
The University of British Columbia, Okanagan
Phone 250.807.9505 http://people.ok.ubc.ca/ylucet


**********************************************************
*
* 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 Paper – IEEE Computational Intelligence Magazine

Dear Colleague,

this is a gentle reminder that the deadline for submitting your original research paper to the Special Issue on Computational Intelligence in Aerospace Science and Engineering is getting closer.

Journal website: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10207
Special Issue website: http://utopiae.eu/about/utopiae-training/research/ieee-computational-intelligence-in-aerospace-sciences/ieee-activities/special-issue-on-ciase-2017/


Important Dates
• 31st January, 2017: Submission of Manuscripts
• 15th April, 2017: Notification of Review Results
• 15th May, 2017: Submission of Revised Manuscripts
• 15th June, 2017: Submission of Final Manuscripts
• November 2017: Publication

Authors are invited to submit papers on one or more of the following topics:

• Global trajectory optimisation
• Multidisciplinary design of space and aerospace systems
• Formation and constellation design and control
• Autonomous control of spacecraft and rovers
• Planning and scheduling for autonomous systems in space
• Multiobjective optimisation for aerospace applications
• Resource allocation and programmatics
• Evolutionary computation for Concurrent Engineering
• Distributed global optimisation and cloud computing
• Mission planning and control
• Optimisation Under Uncertainty and Uncertainty Quantification
• Intelligent search and optimization methods in aerospace
• Image analysis for Guidance Navigation and Control
• Autonomous exploration of interplanetary and planetary environments
• AI, Artificial Life and Swarm Intelligence in aerospace research
• Intelligent algorithms for fault identification, diagnosis and repair
• Multi-agent systems approach and bio-inspired solutions for system design and control
• Advances in machine learning for space and aerospace applications
• Intelligent interfaces for human-machine interaction
• Knowledge Discovery, Data Mining and presentation of large data sets
• Air Traffic Management and Control
• Computational intelligence for expensive large scale problems
• Analysis and control of Complex aerospace systems


Submission Process
The paper length for the manuscript is typically 20 pages in a single-column double-space format including tables, figures and references (10 pages in a two-column single-space format). Authors of papers should specify in the first page of their manuscripts the corresponding author's contact and up to 5 keywords. Details on the submission process available at the following link

http://cis.ieee.org/component/content/article/7/134-ieee-computational-intelligence-magazine-paper-submission-guidelines-and-information-for-authors.html


Guest Editor

Prof. Massimiliano Vasile
Chairman of the CIS ETTC Task Force on Computational Intelligence in Aerospace Sciences
Aerospace Centre of Excellence
Department of Mechanical & Aerospace Engineering
University of Strathclyde, Glasgow, UK
massimiliano.vasile@strath.ac.uk


Dr. Chit Hong Yam
Co-Chair of the CIS ETTC Task Force on Computational Intelligence in Aerospace Sciences
Institute of Space and Astronautical Science
Japan Aerospace Exploration Agency
Sagamihara, Japan
chithong.yam@ac.jaxa.jp


Dr. Edmondo Minisci
Member of the CIS ETTC Task Force on Computational Intelligence in Aerospace Sciences
Centre for Future Air-Space Transportation Technologies
Department of Mechanical & Aerospace Engineering
University of Strathclyde, Glasgow, UK
edmondo.minisci@strath.ac.uk


Prof Ke Tang
School of Computer Science and Technology
University of Science and Technology of China
Hefei, Anhui, China, 230027
Phone: +86-551-63600547
ketang@ustc.edu.cn

**********************************************************
*
* 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, December 7, 2016

[DMANET] CFP: IPDPS ParSocial 2017 Workshop - 2nd IEEE Workshop on Parallel and Distributed Processing for Computational Social Systems

###############################################################################
CALL FOR PAPERS
The 2nd IEEE Workshop on Parallel and Distributed Processing for
Computational Social Systems
June 2 2017, Orlando, Florida USA.
Conference Website : http://www.lcid.cs.iit.edu/parsocial
(In conjunction with IEEE International Parallel & Distributed Processing
Symposium (IPDPS))

IMPORTANT DATES
Paper submission deadline : January 16, 2017
Notification of acceptance : February 27, 2017
Camera-ready papers : March 13, 2017
Workshop : June 2, 2017
################################################################################

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

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

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

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

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

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

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


*Workshop Organization*

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

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

**********************************************************
*
* 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 Candidate ‘Parameterized complexity of approximate Bayesian inferences’

PhD Candidate 'Parameterized complexity of approximate Bayesian inferences' (1.0 FTE)

Faculty of Social Sciences, U. Nijmegen, the Netherlands
Vacancy number: 24.49.16
Application deadline: 1 February 2017

Responsibilities

The recent Predictive Processing account in neuroscience postulates that the brain continuously predicts its future inputs, using generative models relating hypothesized causes to perceived effects. It entails that the brain actually implements some form of approximate Bayesian inference, combining prior expectations with newly arriving information to make sense of its inputs. Bayesian computations, however, are computationally intractable for situations of real-world complexity, even when approximated. This is in marked contrast to the efficiency of inference and learning as done by the brain in practice. The objective of this project is to resolve this paradox by studying the fundamental properties of approximate Bayesian inferences. The vital question we seek to answer is 'under what biologically plausible situational constraints can approximate Bayesian inference be rendered tractable?' The approach we use to address this question is the mathematical theory of parameterized complexity analysis, algorithm design, and computer simulation.

You will explore the boundaries between tractable and intractable (parameterized) sampling algorithms, contribute to the mathematical tools to assess such algorithms, and analyse the computations postulated in the Predictive Processing account. You will also contribute to our Artificial Intelligence educational programme, in particular by supervision of student projects and assistance in lab courses. In addition, you will be eligible to follow courses at the IPA and SIKS research schools. You will be part of the Donders Graduate School for Cognitive Neuroscience.

Work environment

The Donders Institute for Brain, Cognition and Behaviour focuses on state-of-the-art cognitive neuroscience, using a multidisciplinary approach, and offers excellent lab and neuroimaging facilities, PhD supervision and courses, and technical support.

The project is embedded in the Donders research theme "Perception, Action and Control" and will be supervised by Dr Johan Kwisthout. You will join the Computational Cognitive Science research group, headed by Dr Iris van Rooij, at the Donders Centre for Cognition (DCC). The DCC is part of the Faculty of Social Sciences, one of the largest faculties at Radboud University in Nijmegen. The institute offers excellent research facilities and study programmes that rank among the best in the Netherlands. The candidate will also maintain regular research contacts with the Algorithms and Complexity group, headed by Prof. Hans Bodlaender, at the Department of Information and Computing Sciences at Utrecht University.

The Donders Institute is an equal opportunity employer, committed to building a culturally diverse intellectual community, and as such encourages applications from women and minorities. The Radboud University offers a parental leave scheme and day care on campus.

What we expect from you

an MSc degree in computer science, mathematics, artificial intelligence, cognitive science, cognitive neuroscience, or a related field;
strong motivation to conduct a conceptually challenging theoretical research project in a highly interdisciplinary context;
you have strong formal and analytical skills and are fascinated by the foundations of computation as well as how the brain actually realizes computations;
knowledge of parameterized complexity theory and/or Bayesian networks would be a strong bonus.

What we have to offer

employment: 1.0 FTE;
in addition to the salary: an 8% holiday allowance and an 8.3% end-of-year bonus;
the gross starting salary amounts to €2,191 per month, and will increase to €2,801 in the fourth year;
you will be appointed for an initial period of 18 months, after which your performance will be evaluated. If the evaluation is positive, the contract will be extended by 2.5 years;
this PhD position at the Donders Centre for Cognition is a 0.9 FTE research and 0.1 FTE teaching appointment;
you will be classified as a PhD Candidate (promovendus) in the Dutch university job-ranking system (UFO).

Other Information

The intended start date of the project is April 2017.

For more information about this vacancy, please contact:
Dr. Johan Kwisthout, project leader
Telephone: +31 24 3655977
E-mail: j.kwisthout@donders.ru.nl
Are you interested?

You should upload your application (attn. of Dr. Johan Kwisthout) exclusively our vacancy website: http://www.ru.nl/werken/details/details_vacature_0/?recid=593059# Your application should include (and be limited to) the following attachment(s):

Cover letter
CV, including two references
list of grades

Please make sure that all documents are in English.

**********************************************************
*
* 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] EuroCG 2017 - 2nd Call for Papers

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

Call for Papers

EuroCG 2017:
33rd European Workshop on Computational Geometry

April 5-7, 2017 - Malmö, Sweden

http://csconferences.mah.se/eurocg2017/ <http://www.ibr.cs.tu-bs.de/alg/eurocg13/>
=======================================================================

The 33rd European Workshop on Computational Geometry (EuroCG 2017) will be held on
April 5-7, 2017 at the "Niagara" building at Malmö University, at the southern tip of Sweden.
(As usual, there will be a welcome reception on April 4 to launch the conference.)
EuroCG is an annual workshop that combines a strong scientific tradition with a
friendly and informal atmosphere. The workshop is a forum where researchers can meet, present
their results, discuss their work, and establish scientific collaborations.

Topics of interest cover all aspects of computational geometry, including the following:

* discrete and combinatorial geometry and topology
* design and analysis of geometric algorithms and data structures
* implementation and experimental evaluation of geometric algorithms
* numerical and algebraic issues arising from implementations
* analysis of geometric configurations
* geometric modeling, visualization and simulation
* combinatorial optimization
* graph drawing
* computer-aided design and manufacturing
* structural molecular biology
* geographic information systems
* robotics and virtual worlds

SUBMISSIONS AND PROCEEDINGS
---------------------------

We invite authors to submit extended abstracts (4 pages, two columns) of
original research. Submissions will be handled through EasyChair.

EuroCG does not have formally reviewed proceedings. A booklet
of abstracts, without ISBN, will be accessible online from the webpage for the
benefit of the community and must be regarded as a collection of preprints
rather than a formally reviewed selection of papers. Results presented at
EuroCG are expected to appear in other conferences with formal proceedings
and/or in journals. In particular, papers that have just been submitted to other
formally reviewed conferences are eligible for being presented at EuroCG,
assuming they have not appeared by the time of the conference.

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

* Submission Deadline : January 9, 2017
* Acceptance Notification : February 13, 2017
* Camera-ready version : February 27, 2017
* Early Registration : February 27, 2017

INVITED SPEAKERS
----------------

* Rolf Klein, Universität Bonn
* Joseph Mitchell, Stony Brook University
* Bettina Speckmann, Technische Universiteit Eindhoven

PROGRAM COMMITTEE
-----------------

* Gill Barequet, Technion, Israel
* Prosenjit Bose, Carleton University, Canada
* Kevin Buchin, TU Eindhoven, The Netherlands
* Maike Buchin, Ruhr University Bochum, Germany
* Sergio Cabello, University of Ljubljana, Slovenia
* Éric Colin de Verdière, CNRS and LIGM, Marne-la-Vallée, France
* Mark de Berg, TU Eindhoven, The Netherlands
* Sándor Fekete, TU Braunschweig, Germany
* Fabrizio Frati, Roma Tre University, Italy
* Matt Gibson, University of Texas at San Antonio, USA
* Joachim Gudmundsson, University of Sydney, Australia
* Michael Hoffmann, ETH Zürich, Switzerland
* Bengt J. Nilsson, Malmö University, Sweden (chair)
* Matias Korman, Tohoku University, Japan
* Erik Krohn, University of Wisconsin, USA
* Stefan Langerman, Université Libre de Bruxelles (ULB), Belgium
* Elmar Langetepe, University of Bonn, Germany
* Christos Levcopoulos, Lund University, Sweden
* Andrzej Lingas, Lund University, Sweden
* Maarten Löffler, Utrecht University , The Netherlands
* Alejandro López-Ortiz, University of Waterloo, Canada
* Wolfgang Mulzer, Freie Universität Berlin, Germany
* Valentin Polishchuk, Linköping University, Sweden (organiser)
* Vera Sacristán, Universitat Politècnica de Catalunya (UPC), Spain
* Christiane Schmidt, Linköping University, Sweden (organiser)
* Shakhar Smorodinsky, Ben-Gurion University, Israel
* Kevin Verbeek, TU Eindhoven, The Netherlands
* Birgit Vogtenhuber, TU Graz, Austria
* Carola Wenk, Tulane University , USA
* Pawel Zylinski, University of Gdansk, Poland


ORGANIZING COMMITTEE
--------------------

* Bengt J. Nilsson, Malmö University,
* Valentin Polishchuk, Linköping University
* Christiane Schmidt, Linköping University

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

[DMANET] Open PhD Position in the DFG priority program “Cyber-Physical,Networking (SPP 1914)

The Faculty of Computer Science at the University of Koblenz-Landau, Campus
Koblenz, Computer Networks Group, is inviting applications for a

PhD Position (research fellow)
(3 years, full time)

for working within the DFG priority program "Cyber-Physical Networking
(SPP 1914)". The position is to be filled as soon as possible, limited to 3
years and is subject to the German law on fixed-term contracts in science
(WissZeitVG). Salary will be according to the German public service salary
scale TV-L EGr. 13.


Topic:

The prospective research assistant will be responsible for the project
"analysis and synthesis of combined cooperative control and topology control
over wireless network models". This is a joint project between the Computer
Networks Group at the University of Koblenz-Landau and the Institute of
Control Systems at the Hamburg-Harburg Technical University. At both sites
one PhD student is supposed to work in this project context. The PhD student
employed at the University of Koblenz-Landau will research appropriate
adaptation of the time-varying wireless communication graph in multi-agent
systems. Such multi-agent systems are for example autonomous AUV or UAV
robot swarms. Of particular interest are topology control schemes to
maintain the highest level of algebraic connectivity (a condition for
performance and robustness of cooperative control) while reducing the number
of message losses due to interference (modeled in this project with the SINR
model). Focus is on distributed and local solutions with the goal to support
any system scale.
The effectiveness of the developed topology control schemes and their
interaction with distributed control will be evaluated by simulation studies
on some selected distributed control scenarios (e.g. distributed source
seeking based on robot swarms).


Requirements:

We expect:
- An above-average completed scientific university study, preferably in the
area of computer science or mathematics (M.Sc or Diploma).
- Ability to carry out independent scientific work
- Skills to mathematically proof theoretical claims
- Interests to do research in the area of algorithms and graphs
- Very good proficiency in written and spoken English

It is the policy of the University Koblenz-Landau to increase the percentage
of female employees. If equally qualified, preference will be given to
female applicants in fields where they are underrepresented. Disabled
candidates are given priority, if equally qualified. International
candidates are highly encouraged to apply.

Applicants should send their documents (curriculum vitae, qualifications
etc.) quoting the reference number Ko-44/2016, before Jan-31-2017 either by
regular mail to Universität Koblenz-Landau, Ref. K 21 Personal,
Organisation, Wahlen, Universitätsstr. 1, 56070 Koblenz or by email to
bewerbung-fb4@uni-koblenz.de. Applications after the deadline will be
considered as long as the position is not filled.

We do not send a confirmation of receipt. In accordance to the protection of
data privacy all documents will be destroyed after the application
procedure.

--
Prof. Dr. Hannes Frey
AG Rechnernetze
Universität Koblenz-Landau

**********************************************************
*
* 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, December 6, 2016

[DMANET] Large-Scale Structures in Random Graphs Workshop 2016 – PUBLIC LECTURES -- Tuesday 13 December

* *Large-Scale Structures in Random Graphs Workshop 2016 – PUBLIC LECTURES

*
Tuesday 13 December – 10.00 - The Alan Turing Institute, headquartered
at the British Library

This event is free to attend but *_pre-registration is required via our
Eventbrite page_*
<https://www.eventbrite.co.uk/e/large-scale-structures-in-random-graphs-public-lectures-tickets-29672085005>
*10.00: *Refreshments and networking
*10.30: *Rob Morris (IMPA) - The sharp threshold for making squares
Many of the fastest known algorithms for factoring large integers rely
on finding subsequences of randomly generated sequences of integers
whose product is a perfect square. Motivated by this, at the 1994 ICM
Pomerance posed the problem of determining the threshold of the event
that a random sequence of /N/ integers, each chosen uniformly from the
set /{1,...,x}/, contains a subsequence, the product of whose elements
is a perfect square. In 1996, Pomerance gave good bounds on this
threshold and also conjectured that it is /sharp/.

A few years ago, in a major breakthrough, Croot, Granville, Pemantle and
Tetali significantly improved these bounds, and stated a conjecture as
to the location of this sharp threshold. In the talk we will discuss a
proof of their conjecture, which combines techniques from number theory
and probabilistic combinatorics. In particular, at the heart of the
proof lies a self-correcting random process of non-uniform hypergraphs.
*11.40: *Stefanie Gerke (RHUL) - Matchings in random bipartite graphs
We consider maximum matchings in random bipartite graphs with a fixed
degree distribution. We then introduce an adversary and show for a
simplified model under which conditions a matching exists that covers
the smaller partition class.
Further details:
_http://www.lse.ac.uk/maths/Seminars/Large-Scale-Structures-in-Random-Graphs-Workshop-2016.aspx_
<http://www.lse.ac.uk/maths/Seminars/Research_Seminars.aspx>

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

[DMANET] CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE SCPA 2017 - May 21-25, 2017. Paris, France

-------------------- CALL FOR PAPERS (DEADLINE EXTENDED) -----------------
5th IEEE International Workshop on Smart Communication Protocols and Algorithms (SCPA 2017)
May 21-25, 2017. Paris, France
In conjunction with IEEE ICC 2017
http://scpa.it.ubi.pt/2017/
------------------------------------------------------------------------------------------------

Selected papers will be invited to the Special Issue on Smart Protocols and Algorithms of the International Journal Network Protocols and Algorithms (ISSN: 1943-3581) or to the Special Issue on Recent Advances on Communications and Networking Technology Journal (ISSN: 2215-082X (Online); ISSN: 2215-0811 (Print)).


Communication protocols and algorithms are needed to communicate network devices and exchange data between them. The appearance of new technologies usually comes with a protocol procedure and communication rules that allows data communication while taking profit of this new technology. Recent advances in hardware and communication mediums allow proposing new rules, conventions and data structures which could be used by network devices to communicate across the network. Moreover, devices with higher processing capacity let us include more complex algorithms that can be used by the network device to enhance the communication procedure.
Smart communication protocols and algorithms make use of several methods and techniques (such as machine learning techniques, decision making techniques, knowledge representation, network management, network optimization, problem solution techniques, and so on), to communicate the network devices to transfer data between them. They can be used to perceive the network conditions, or the user behavior, in order to dynamically plan, adapt, decide, take the appropriate actions, and learn from the consequences of its actions. The algorithms can make use of the information gathered from the protocol in order to sense the environment, plan actions according to the input, take consciousness of what is happening in the environment, and take the appropriate decisions using a reasoning engine. Goals such as decide which scenario fits best its end-to-end purpose, or environment prediction, can be achieved with smart protocols and algorithms. Moreover, they could learn from the pas!
t and use this knowledge to improve
future decisions.
In this workshop, researchers are encouraged to submit papers focused on the design, development, analysis or optimization of smart communication protocols or algorithms at any communication layer. Algorithms and protocols based on artificial intelligence techniques for network management, network monitoring, quality of service enhancement, performance optimization and network secure are included in the workshop.
We welcome technical papers presenting analytical research, simulations, practical results, position papers addressing the pros and cons of specific proposals, and papers addressing the key problems and solutions. The topics suggested by the conference can be discussed in term of concepts, state of the art, standards, deployments, implementations, running experiments and applications.

Topics of interest:
------------------------------------------------------------------------------------------------
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal, including, but are not limited to, the following topic areas:
- Smart network protocols and algorithms for multimedia delivery
- Application layer, transport layer and network layer cognitive protocols
- Cognitive radio network protocols and algorithms
- Automatic protocols and algorithms for environment prediction
- Algorithms and protocols to predict data network states
- Intelligent synchronization techniques for network protocols and algorithms
- Smart protocols and algorithms for e-health
- Software applications for smart algorithms design and development
- Dynamic protocols based on the perception of their performance
- Smart protocols and algorithms for Smartgrids
- Protocols and algorithms focused on building conclusions for taking the appropriate actions
- Smart Automatic and self-autonomous ad-hoc and sensor networks
- Artificial intelligence applied in protocols and algorithms for wireless, mobile and dynamic networks
- Smart security protocols and algorithms
- Smart cryptographic algorithms for communication
- Artificial intelligence applied to power efficiency and energy saving protocols and algorithms
- Smart routing and switching protocols and algorithms
- Cognitive protocol and algorithm models for saving communication costs
- Any kind of intelligent technique applied to QoS, content delivery, network Monitoring and network management
- Smart collaborative protocols and algorithms
- Problem recognition and problem solving protocols
- Genetic algorithms, fuzzy logic and neural networks applied to communication protocols and algorithms

Important Dates:
------------------------------------------------------------------------------------------------
Submission Deadline: 16th December, 2016 (Extended deadline)
Acceptance Notification: 17th February, 2016
Camera Ready Deadline: 10th March, 2016

Submission guidelines:
------------------------------------------------------------------------------------------------
All submissions must be full papers in PDF format and uploaded on EDAS: (https://edas.info/newPaper.php?c=22957&track=82208)

All submissions should be written in English with a maximum paper length of five (5) printed pages (10-point font) including figures without incurring additional page charges.

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

General Chairs:
Jaime Lloret Mauri, Universitat Politecnica Val�ncia, Spain
Joel Rodrigues, National Institute of Telecommunications (Inatel), Brazil;
Instituto de Telecomunica��es, Univ. of Beira Interior, Portugal

TPC Chairs:
Sandra Sendra, Universidad de Granada, Spain
Kashif A. Saleem, Kind Saud University, Saudi Arabia
Bruno Silva, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal

Keynote Chairs:
Danda B. Rawat, Georgia Southern University, USA

Panel Chairs:
Raimir Filho, University of Fortaleza, Brazil
Pascal Lorenz, University of Haute Alsace, France

Industry Chair:
Antonio S�nchez-Esguevillas, Telefonica R&D, Spain

Publicity Chairs:
Sofiane Hamrioui, University of Haute Alsace, France
Jose M. Jimenez, Universidad Polit�cnica de Valencia, Spain

Web Chair:
Jo�o N. Isento, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal

[DMANET] Call for Papers - ISNN 2017 (Sapporo, Hokkaido, Japan, June 21-23, 2017), Paper Submission: January 1, 2017

*Call for Papers*


*The 14th International Symposium on Neural Networks (ISNN 2017), Sapporo,
Hokkaido, Japan, June 21-23, 2017 *
https://conference.cs.cityu.edu.hk/isnn/
<https://mail.udc.edu/owa/redir.aspx?REF=bw1boz8lQCQ-mmqyordoQSXEx-wFtjGq46edBpLTCzQ5sOa6VAbUCAFodHRwczovL2NvbmZlcmVuY2UuY3MuY2l0eXUuZWR1LmhrL2lzbm4v>

The 14th International Symposium on Neural Networks (ISNN 2017) will be
held in Sapporo, Hokkaido, Japan during June 21-23, 2017, following the
successes of previous events. Located in northern island of Hokkaido,
Sapporo is the fourth largest Japanese city and a popular summer/winter
tourist venue. ISNN 2017 aims to provide a high-level international forum
for scientists, engineers, and educators to present the state of the art of
neural network research and applications in related fields. The symposium
will feature plenary speeches given by world renowned scholars, regular
sessions with broad coverage, and special sessions focusing on popular
topics.


Authors are invited to submit full-length papers by the submission deadline
through the online submission system. The submission of a paper implies
that the paper is original and has not been submitted under review or is
not copyright-protected elsewhere and will be presented by an author if
accepted. All submitted papers will be refereed by experts in the field
based on the criteria of originality, significance, quality, and clarity.
Papers presented at ISNN 2017 will be published in the EI-indexed
proceedings in the Springer LNCS series and selected good papers will be
included in special issues of several SCI journals.


*Important Dates*

- Paper submission: January 1, 2017

- Notification of acceptance: February 1, 2017

- Camera-ready copy and author registration: March 1, 2017

- Conference: June 21-23, 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] 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/
*
**********************************************************

Monday, December 5, 2016

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

Sunday, December 4, 2016

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