Saturday, April 30, 2016

[DMANET] AUTOMATA 2016:Extension of submission deadline for exploratory papers

The deadline for the submission of exploratory papers to AUTOMATA 2016
has been extended to May 6, 2016.

__________________________________________________________________

AUTOMATA 2016 Call for Exploratory Papers

The 22nd International Workshop on Cellular Automata and Discrete
Complex Systems (AUTOMATA 2016) will be hosted at the University of
Zurich, Switzerland, June 15-17, 2016.

Submission deadline for exploratory papers: May 6, 2016

http://automata2016.ini.uzh.ch


Scope

Papers presenting original and unpublished research on all fundamental
aspects of cellular automata and related discrete complex systems are
sought. Topics of interest include (but are not limited to): dynamics,
topological, ergodic and algebraic aspects, algorithmic and complexity
issues, emergent properties, formal language processing, symbolic
dynamics, models of parallelism and distributed systems, timing
schemes, phenomenological descriptions, scientific modeling and
practical applications.


Important dates

Submission deadline for exploratory papers: May 6, 2016
Notification of acceptance for exploratory papers: May 12, 2016
Early bird registration deadline: May 15, 2016
Online registration deadline: June 6, 2016
AUTOMATA 2016: June 15-17


Invited speakers

Klaus Sutner (Carnegie Mellon University, USA)
Guillaume Theyssier (Université de Savoie, France)
Tommaso Toffoli (Boston University, USA)
Andrew Winslow (Université libre de Bruxelles, Belgium)


Program committee

Matthew Cook (University of Zurich and ETH Zurich, Switzerland)
Nazim Fatès (Inria Nancy, France)
Paola Flocchini (University of Ottawa, Canada)
Enrico Formenti (Université Nice Sophia Antipolis, France)
Anahı́ Gajardo (University of Concepción, Chile)
Eric Goles (Adolfo Ibáñez University, Chile)
Jarkko Kari (University of Turku, Finland)
Martin Kutrib (Universität Gießen, Germany)
Andreas Malcher (Universität Gießen, Germany)
Genaro Martı́nez (University of West England, UK)
Kenichi Morita (Hiroshima University, Japan)
Turlough Neary (University of Zurich and ETH Zurich, Switzerland)
Pedro de Oliveira (Mackenzie Presbyterian University, Brazil)
Nicolas Ollinger (Université d'Orléans, France)
Matthew Patitz (University of Arkansas, USA)
Ivan Rapaport (Universidad de Chile, Chile)
Hiroshi Umeo (Osaka Electro-Communication University, Japan)
Damien Woods (Caltech, USA)
Thomas Worsch (Karlsruher Institut für Technologie, Germany)


Organizing committee

Matthew Cook
Turlough Neary


Paper categories

There are two categories of submission – full papers (submission now
closed) and exploratory papers. The later submission deadline for
exploratory papers allows quick reporting of recent discoveries, work
-in-progress and/or partial results. Submissions in the exploratory
category go through a less rigorous evaluation process than those in
the full paper category. Exploratory papers will not be included in the
LNCS proceedings; however, they will be printed locally and given to
conference participants.

Submission

Authors are invited to submit extended abstracts of no more than 8
pages via the EasyChair system at

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

Submissions should contain original research that has not previously
been published. Submission must be formatted in LaTeX using the LNCS
format (see http://www.springer.com/computer/lncs/lncs+authors) and
submitted in Portable Document Format (PDF). Papers authored or co
-authored by PC members are also welcome.
**********************************************************
*
* 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] JCDCG^3 2016 CFP

The 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2016)


---- Call For Presentations ---

Date: September 2--4, 2016
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Submission Deadline: July 1st, 2016
Web site:
English: ******** Under construction *******
http://www.jcdcgg.u-tokai.ac.jp/e.html
Japanese: ******** Under construction *******
http://www.jcdcgg.u-tokai.ac.jp/

Invited Plenary Speakers:
- Erik Demaine (MIT, USA)
- Nikolai Dolbilin (Steklov Institute of Mathematics, Russia)
- Ruy Fabila-Monroy (Cinvestav, Mexico)
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Vera Sacristan (UPC, Spain)
- Ikuro Sato (Miyagi Cancer Center, Japan)
- Tomohiro Tachi (Univ. Tokyo, Japan)

Scope:
We invite submissions of original researches on, but not restricted to, discrete geometry, computational geometry, graph theory, graph algorithms, complexity and winning strategies of games and puzzles.

The collection of abstracts will be distributed electrically.

Submission format: Authors are required to submit a pdf-file of an extended abstract of at most 2 pages in a standard 10-point font on A4-paper to

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

by July 1st, 2016 (JST).

* Note:
* - Any proceedings (e.g., from Springer) won't be published. But
* - A special issue on the same theme will be published from
* JIP (Journal of Information Processing).
* -- http://www.ipsj.or.jp/english/jip/index.html
* -- The editor is H. Ito (PC chair of this conference)
* -- The deadline of the special issue will be October
* -- (i.e., after the conference).
* -- The detail information will be noticed soon.
* - We have not prepared for special rates at hotels. So, please
* make your hotel reservations for yourself.
* - The official language for presentations and abstracts of talks
* in this conference is English.

Important Dates:
- Extended-Abstract (at most 2 pages) Submissions Deadline: July 1st, 2016 (JST)
- Notification: July 20, 2016
- Camera-Ready File Submission Deadline: July 29, 2016
- Conference: September 2 -- 4, 2016


Committees:

Conference Chair: Jin Akiyama (Tokyo University of Science, Japan)

Programming Committee:
- Takashi Horiyama (Saitama University, Japan)
- Hiro Ito (UEC, Japan; Chair)
- Yasuko Matsui (Tokai University, Japan)
- Yoshio Okamoto (UEC, Japan)
- Toshinori Sakai (Tokai University, Japan)
- Ryuhei Uehara (JAIST, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)

Organizing Committee:
- Hiro Ito (UEC, Japan)
- Takako Kodate (Tokyo Woman's Christian University, Japan)
- Keiko Kotani (Tokyo University of Science, Japan)
- Yasuko Matsui (Tokai University, Japan)
- Atsuki Nagao (UEC, Japan)
- Toshinori Sakai (Tokai University, Japan; Chair)
- Kazuhisa Seto (Seikei University, Japan)
- Xuehou Tan (Tokai University, Japan)
- Shin-ichi Tokunaga (Tokyo Medical and Dental University, Japan)


Contact to:
JCDCG^3 2016 Organizing Committee
jcdcgg@ml.tokai-u.jp

..A A .. ......ITO Hiro, Professor
. ..... School of Informatics and Engineering,
. @ @ .... The University of Electro-Communications
. = x = . .... 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, JAPAN
. . . . Tel/Fax: +81 42 443 5332
.(( (( ( .. E-mail: itohiro@uec.ac.jp
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, April 29, 2016

[DMANET] Research Fellow (Automated Planning in Unpredicted Situations) @ University of Melbourne

====================================================================================
RESEARCH FELLOW IN ARTIFICIAL INTELLIGENCE - AUTOMATED PLANNING IN UNPREDICTED SITUATIONS ====================================================================================

Applications close: 11 May 2016 11:55 PM Aus. Eastern Standard Time

Professor Peter Stuckey & Assoc Professor Adrian Pearce

The University of Melbourne is seeking an outstanding Research Fellow to conduct leading edge research in automated planning. The project is in conjunction with our research partners at Defence Science and Technology Group (DST Group), and forms part of DST Group's Tyche Special Research Initiative (SRI) into trusted autonomy. It concerns distributed multi-agent planning and reasoning in dynamic environments, with a specific focus on automated planning in unpredicted situations.

The position will be located in the Department of Computing and Information Systems within the Melbourne School of Engineering.

Salary $92,654-$110,022 AUD p.a. plus 9.5% superannuation

The successful candidates will conduct leading-edge research and development in the area of automated planning or a related area.

As part of the team, working with Assoc Professor Adrian Pearce, Professor Liz Sonenberg, Dr. Tim Miller, Dr. Nir Lipovetzky and Dr. Michelle Blom, you would be involved in discovering automated reasoning techniques for robustness and distributed adaptability under irreducible uncertainty in a range of applications, including land vehicles and autonomous team tactics discovery.

The role will involve investigation of The candidate should be prepared for occasional interstate travel, as the research is conducted in close collaboration with our research partners. The position is for a fixed term of 2 years.

RESEARCH GROUP

The successful candidate will be part of a team that works collaboratively on all aspects of the project, from concepts, theoretical underpinning and design, through implementation and experimentation, to publication of results and maintenance and refinement of generated software. Primary responsibilities will involve the development of novel planning and reasoning mechanisms in distributed multi-agent environments.

The successful candidate will be located in the Department of Computing and Information Systems in the Melbourne School of Engineering and will be expected to be an active member of the Department, collaborating with other researchers.

APPLICATION PROCEDURE

http://www.jobs.unimelb.edu.au

Research Fellow in Supply Chain Optimisation: position number 0040677 (closes 11 May 2016 11:55 PM Aus. Eastern Standard Time)

Please download the Position Description at the following link:

http://jobs.unimelb.edu.au/caw/en/job/887981/research-fellow-in-artificial-intelligence

Contact: For more information, please contact Adrian Pearce, adrianrp@unimelb.edu.au

**********************************************************
*
* 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] [PSD 2016 CFP] Submission deadline extended to May 8, 2016; LNCS proceedings, Dubrovnik, Croatia, Sep. 14-16, 2016

Due to multiple requests, the deadline for final submission to PSD 2016
has been moved to

** May 8, 2016 (hard deadline)**

Please find attached the updated CFP.
(also available at http://unescoprivacychair.urv.cat/psd2016/)


PRIVACY IN STATISTICAL DATABASES 2016 (PSD 2016)
================================================

** SUBMISSION DEADLINE MAY 8, 2016**

Dubrovnik, Croatia, Sep. 14-16, 2016

http://unescoprivacychair.urv.cat/psd2016


1. AIMS AND GOALS
-----------------

Privacy in statistical databases is about finding tradeoffs to
the tension between the increasing societal and economical demand
for accurate information and the legal and ethical obligation to
protect the privacy of individuals and enterprises which are the
respondents providing the statistical data. In the case of
statistical databases, the motivation for respondent privacy is
one of survival: statistical agencies or survey institutes cannot
expect to collect accurate information from individual or
corporate respondents unless these feel the privacy of their
responses is guaranteed.

Beyond respondent privacy, there are two additional privacy dimensions
to be considered: privacy for the data owners (organizations owning or
gathering the data, who would not like to share the data they have
collected at great expense) and privacy for the users (those who
submit queries to the database and would like their analyses to stay
private). Co-utility has shown to provide sustainable solutions to
user privacy.

"Privacy in Statistical Databases 2016" (PSD 2016) is a conference
sponsored and organized by the UNESCO Chair in Data Privacy
(http://unescoprivacychair.urv.cat) with proceedings published by
Springer-Verlag in Lecture Notes in Computer Science. Generous support
by the Templeton World Charity Foundation is acknowledged. The purpose
of PSD 2016 is to attract world-wide, high-level research in
statistical database privacy.

PSD 2016 is a successor to PSD 2014 (Eivissa, Sep. 17-19, 2014,
http://unescoprivacychair.urv.cat/psd2014/), PSD 2012 (Palermo, Sep.
26-28, 2012, http://unescoprivacychair.urv.cat/psd2012), PSD 2010
(Corfu, Sep. 22-24, 2010, http://unescoprivacychair.urv.cat/psd2010),
PSD 2008 (Istanbul, Sep. 24-26, 2008,
http://unescoprivacychair.urv.cat/psd2008), PSD 2006 (Rome, Dec.
13-15, 2006, http://crises-deim.urv.cat/psd2006) and PSD 2004
(Barcelona, June 9-11, 2004, http://crises-deim.urv.cat/psd2004), all
with proceedings published by Springer in LNCS 8744, LNCS 7556, LNCS
6344, LNCS 5262, LNCS 4302 and LNCS 3050, respectively. Those seven
PSD conferences follow a tradition of high-quality technical
conferences on SDC which started with "Statistical Data
Protection-SDP'98", held in Lisbon in 1998 and with proceedings
published by OPOCE, and continued with the AMRADS project SDC
Workshop, held in Luxemburg in 2001 and with proceedings published in
Springer LNCS 2316.

Like the aforementioned preceding conferences, PSD 2016 originates in
Europe, but wishes to stay a worldwide event in database privacy and
SDC. Thus, contributions and attendees from overseas are welcome.

2. ORGANIZATION
---------------

PROGRAM COMMITTEE

Jane Bambauer (University of Arizona, USA)
Bettina Berendt (KU Leuven, Belgium)
Elisa Bertino (CERIAS, Purdue University, USA)
Aleksandra Bujnowska (EUROSTAT, European Union)
Jordi Castro (Polytechnical University of Catalonia)
Ann Cavoukian (Ryerson University, Canada)
Lawrence Cox (NISS, USA)
Josep Domingo-Ferrer (Universitat Rovira i Virgili, Catalonia)
Joerg Drechsler (IAB, Germany)
Khaled El Emam (University of Ottawa, Canada)
Mark Elliot (Manchester University, UK)
Stephen Fienberg (Carnegie Mellon University, USA)
Sarah Giessing (Destatis, Germany)
Sara Hajian (Eurecat Technology Center, Catalonia)
Alan Karr (CoDA, RTI, USA)
Julia Lane (New York University, USA)
Bradley Malin (Vanderbilt University, USA)
Oliver Mason (National University of Ireland-Maynooth, Ireland)
Laura McKenna (Census Bureau, USA)
Gerome Miklau (University of Massachusetts-Amherst, USA)
Krish Muralidhar (The University of Oklahoma, USA)
Anna Oganyan (National Center for Health Statistics, USA)
Christine O'Keefe (CSIRO, Australia)
Jerry Reiter (Duke University, USA)
Yosef Rinott (Hebrew University, Israel)
Juan Jose Salazar (University of La Laguna, Spain)
Pierangela Samarati (University of Milan, Italy)
David Sanchez (Universitat Rovira i Virgili, Catalonia)
Eric Schulte-Nordholt (Statistics Netherlands)
Natalie Shlomo (University of Manchester, UK)
Aleksandra Slavkovic (Penn State University, USA)
Jordi Soria-Comas (Universitat Rovira i Virgili, Catalonia)
Tamir Tassa (The Open University, Israel)
Vicenc Torra (Skovde University, Sweden)
Vassilios Verykios (Hellenic Open University, Greece)
William E. Winkler (Census Bureau, USA)
Peter-Paul de Wolf (Statistics Netherlands)

PROGRAM CHAIR

Josep Domingo-Ferrer (UNESCO Chair in Data Privacy, Universitat Rovira i
Virgili, Catalonia)

GENERAL CHAIR

Mirjana Pejic-Bach (Faculty of Business & Economics, University of
Zagreb, Croatia)

ORGANIZATION COMMITTEE

Ksenija Dumicic (Faculty of Business & Economics, University of Zagreb,
Croatia)
Joaquin Garcia-Alfaro (Telecom SudParis, France)
Goran Lesaja (Georgia Southern University, USA)
Jesus Manjon (Universitat Rovira i Virgili, Catalonia)
Tamar Molina (Universitat Rovira i Virgili, Catalonia)

3. TOPICS OF INTEREST
---------------------

Topics of interest include but are not limited to:

- New anonymization methods for tabular data
- New anonymization methods for microdata
(including non-conventional microdata types such as trajectories,
graphs, etc.)
- Best anonymization practices for tabular data
- Best anonymization practices for microdata
- Co-utility for privacy preservation
- Big data anonymization
- Streaming data anonymization
- Decentralized anonymization
- Balancing data quality and data confidentiality in SDC
- Differential privacy and other privacy models
- SDC transparency issues
- Onsite access centers - Remote access facilities - SDC software
- Estimating disclosure risk in SDC
- Record linkage methods
- Real-life disclosure scenarios in EU-member states and abroad
- Privacy preserving data mining (both cryptographic and non-cryptographic)
- Private information retrieval
- Privacy in web-based e-commerce
- Privacy in healthcare
- Privacy in official and corporate statistics
- Other data anonymization issues

4. SUBMISSIONS
--------------

Full papers containing either original technical contributions or
high-quality surveys on the above topics or on related topics are
sought.

A submission should be clearly marked either as an original paper or a
survey. Submissions should contain a cover letter indicating:

1) whether the submission is a survey or an original contribution;
2) the title of the submission;
3) keywords classifying the paper topic;
4) the names and affiliations of authors;
5) the e-mail, telephone and facsimile numbers of the contact author.

The submission itself should be sent as an attached PDF file.
Submission and their cover letters should be sent to: psd2016@urv.cat

Camera-ready versions of accepted papers should be prepared using the
LaTeX2e style or the Word template of Springer Verlag Lecture Notes in
Computer Science. For LaTeX2e, a macro package llncs.zip and an
example file typeinst.zip can be downloaded from
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 For
Microsoft Word, a template word.zip can be downloaded from the same
page above.

We encourage authors to use the above formats already for their
submissions.

LENGTH OF SUBMISSIONS.

Using the above format with 11 point font, the paper should be at most
12 pages excluding bibliography and appendices, and at most 16 pages
total. Committee members are not required to read appendices; the
paper should be intelligible without them. Submissions not meeting
these guidelines risk rejection without consideration of their merits.

5. PROCEEDINGS
--------------

Among PSD 2016 accepted papers, a selection will be made based on
quality and coverage and the selected papers will be published in the
Lecture Notes in Computer Science (LNCS) series by Springer. This
follows the tradition of the previous PSD conferences.

The remaining accepted papers will be published in a CD with an ISBN.
It is possible to submit a paper directly for the CD, which benefits
from a later submission deadline (see CD-only dates below).

The form of publication of an accepted paper will be clearly specified
in the acceptance message. Both the LNCS volume and the CD will be
*available at the conference*.

6. IMPORTANT DATES
------------------

Submission deadline: **MAY 8, 2016 (already extended, hard deadline)**
Acceptance notification: June 16, 2016
Proceedings version due: June 26, 2016
Conference: Sep. 14-16, 2016

CD-only submission deadline: June 26, 2016 CD-only acceptance
notification: July 15, 2016 CD-only proceedings version due: July 28,
2016

7. VENUE AND TRAVEL
-------------------

The conference will take place at the Centre for Advanced
Academic Studies of the University of Zagreb
Don Frana Bulica 4
20000 Dubrovnik, Croatia
http://www.caas.unizg.hr/

Further venue, travel and accommodation information will be posted in
due course at http://unescoprivacychair.urv.cat/psd2016

A number of travel grants are made available by the UNESCO Chair in
Data Privacy, especially for authors and delegates from transition
countries. Information on grants is posted in the conference web site.

8. REGISTRATION
---------------

Registration information will be posted no later than June 2016 at:

http://unescoprivacychair.urv.cat/psd2016

**********************************************************
*
* 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 studenship opportunity in the field of Data Analytics and Optimisation

The Department of Mechanical and Aerospace Engineering of Strathclyde University (Glasgow, UK) is looking for a PhD candidate to work on a research topic focused on Robust Data-Driven Optimisation for aerospace engineering applications.

Project Aims and Objective
The recent world has seen an explosion of available data, gathered from sensors, experiments and direct measurements. The engineering world is shifting from model-centred simulations to the assimilation of data into the modelling process. This opens up a wide area of research where large datasets are used to fine tuning engineering models, design uncertainty sets and infer knowledge about unknown parameters. This is particularly true in optimisation under uncertainties where usually simulation code and an apriori knowledge of the uncertainty distribution of the parameters is known or is assumed to be known. Bringing real data into this process will allow to design robust optimal solutions closer to the real industrial needs and more realistic uncertain scenarios. The main challenges in this field of research want to address the problems of efficiently handling and processing large quantity of data while extracting meaningful knowledge about the optimisation problem and uncertainty sets.

Qualifications
Master degree in computer science, applied mathematics, statistics or aerospace engineering

Experience
Experience in the field of optimisation and/or machine learning techniques is desirable

Student eligibility
UK and EU students, International students will also be considered.

Funding
The selected student will be presented as candidate for the John Anderson Research Award, one of the internal studentship scheme of Strathclyde University. https://www.strath.ac.uk/studywithus/scholarships/strathclyderesearchstudentshipscheme-johnandersonresearchawards/

For any enquires please contact

Annalisa Riccardi, PhD
Lecturer in Computational Intelligence
annalisa.riccardi@strath.ac.uk
__________________________________________
Department of Mechanical & Aerospace Engineering
Strathclyde University
James Weir Building, 75 Montrose Street
G1 1XJ Glasgow
+44.141574.5169

**********************************************************
*
* 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 positions at MPII and U. de Chile

A joint postdoctoral fellowship will be available at MPII (Saarbruecken)
and Universidad de Chile (Santiago) starting in August 2016, or by mutual
agreement at any date thereafter. The position is funded by the MPII-UChile
collaborative grant "Fast algorithms for Massive Data Set", therefore we
are looking for applicants with interests in the design and analysis of
algorithms.

The position is for 12 months renewable by mutual agreement. The selected
candidate will spend 6 months at U. de Chile working with Jose Correa, Jose
Soto, Jose Verschae and/or Andreas Wiese and 6 months at MPII working with
researchers from the Algorithms and Complexity group (e.g., Parinya
Chalermsook, and/or Antonios Antoniadis). Travel support is available.

Applicants must hold a recent PhD or be close to finishing their thesis.
Applications including curriculum vitae, list of publications, research
plan (1 page), and names of references with their e-mail addresses, should
be sent electronically to Jose Soto jsoto@dim.uchile.cl . To ensure full
consideration the application should be sent before the deadline of June
1st, 2016. Late applications might be considered on a case by case basis.

The Max-Planck-Institute for Informatics (MPII) is located on the campus of
the Universitaet des Saarlandes in Saarbruecken, Germany. Currently, around
40 researchers of several nationalities work in the Algorithms and
Complexity Department. The working language is English. The group
collaborates with several of the major research institutions in Europe and
the U.S. and has high international visibility.

The University of Chile is the main research institution in Chile. Its
school of Physical and Mathematical Sciences gathers 200+ full time
professors together with a large number of postdocs and researchers. The
school provides one of the very best research environments in Latin America
for exact sciences and technology.

--94eb2c0827ba2929b20531a20aac
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>A joint postdoctoral fellowship will be available at =
MPII (Saarbruecken) and Universidad de Chile (Santiago) starting in August =
2016, or by mutual agreement at any date thereafter. The position is funded=
by the MPII-UChile collaborative grant &quot;Fast algorithms for Massive D=
ata Set&quot;, therefore we are looking for applicants with interests in th=
e design and analysis of algorithms.</div><div><br></div><div>The position =
is for 12 months renewable by mutual agreement. The selected candidate will=
spend 6 months at U. de Chile working with Jose Correa, Jose Soto, Jose Ve=
rschae and/or Andreas Wiese and 6 months at MPII working with researchers f=
rom the Algorithms and Complexity group (e.g., Parinya Chalermsook, and/or =
Antonios Antoniadis). Travel support is available.</div><div><br></div><div=
>Applicants must hold a recent PhD or be close to finishing their thesis. A=
pplications including curriculum vitae, list of publications, research plan=
(1 page), and names of references with their e-mail addresses, should be s=
ent electronically to Jose Soto <a href=3D"mailto:jsoto@dim.uchile.cl">jsot=
o@dim.uchile.cl</a> . To ensure full consideration the application should b=
e sent before the deadline of June 1st, 2016. Late applications might be co=
nsidered on a case by case basis.</div><div><br></div><div>The Max-Planck-I=
nstitute for Informatics (MPII) is located on the campus of the Universitae=
t des Saarlandes in Saarbruecken, Germany. Currently, around 40 researchers=
of several nationalities work in the Algorithms and Complexity Department.=
The working language is English. The group collaborates with several of th=
e major research institutions in Europe and the U.S. and has high internati=
onal visibility.</div><div><br></div><div>The University of Chile is the ma=
in research institution in Chile. Its school of Physical and Mathematical S=
ciences gathers 200+ full time professors together with a large number of p=
ostdocs and researchers. The school provides one of the very best research =
environments in Latin America for exact sciences and technology.</div></div=
>

--94eb2c0827ba2929b20531a20aac--
**********************************************************
*
* 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] Chapter Submission by 15 May 2016 - Security Solutions and Applied Cryptography in Smart Grid Communications

Dear Colleagues,

We could accommodate a few more chapters in our upcoming book on
Security Solutions and Applied Cryptography in Smart Grid
Communications. If you are interested, kindly directly submit your full
chapter by 15 May 2016 (the latest time in earth) at the following URL:

http://www.igi-global.com/submission/submit-chapter/?projectid=6423111c-4d60-4cdc-b4cf-9c9fdecf080c

The CFC (Call for Chapters) is mentioned below for your convenience.

Best Regards,
Mohamed Amine

=====================
[Apologies for multiple copies of the CFC]

"Security Solutions and Applied Cryptography in Smart Grid
Communications"

Edited by: Mohamed Amine Ferrag and Ahmed Ahmim
To be published by: IGI Global, USA

May 15, 2016: Full Chapter Submission

URL1 :
http://www.igi-global.com/publish/call-for-papers/call-details/2020
URL2
: https://sites.google.com/site/smartgridsigiglobal/

Editorial Advisory Board
Nacira Ghoualmi-Zine, Badji Mokhtar- Annaba University, Algeria
Jaime Lloret Mauri, Polytechnic University of Valencia, Spain
Pascal Lorenz, University of Haute Alsace, France
Djamel Djenouri, CERIST Research Center, Algeria
Albena Mihovska, Center for TeleInFrastructur, Aalborg University,
Aalborg, Denmark
Mehdi Nafa, Badji Mokhtar- Annaba University, Algeria
Al-Sakib Khan Pathan, UAP and SEU, Bangladesh/ Islamic University in
Madinah, KSA
Hui Hou, School of Automation, Wuhan University of Technology, China
Hidoussi Faouzi, University Hadj Lakhdar Batna, Algeria
Mubashir Husain Rehmani, COMSATS Institute of Information Technology,
Wah Cantt, Pakistan
Homero Toral Cruz, University of Quintana Roo, México
Makhlouf Derdour, University of Cheikh Laarbi, Tebessa, Algeria
Lynn M. Batten, Deakin University, Australia
Ram Chakka, RGMCET, RGM Group of Institutions, India
Cristina Alcaraz, University of Malaga, Spain
Sumanth Yenduri, Columbus State University, USA
Chi-Yuan Chen, National Ilan University, Taiwan
P. Venkata Krishna, VIT University, India
Alessio Merlo, University of Genova, Italy
Syed Faraz Hasan, Massey University, New Zealand
Farrokh Aminifar, University of Tehran, Iran
Hossein Akhavan-Hejazi, University of California, USA
Danda B. Rawat, Georgia Southern University, USA

Introduction
Electrical energy storage is a key factor for the future. The
consumption of electrical energy (i.e. the use of air conditioning,
audio and video devices or electric heating) is increasing every year
due; firstly to the increase of the population and secondly by the
appearance of new uses of consumption, such as electric cars. With this
increase consumption, how to ensure the balance between supply and
demand for electricity at all times? To address this problem, the idea
of placing the new generation of smart grids to control this energy has
appeared in recent literature in different flavors in order to provide
electric power supply secure, sustainable and competitive to consumers.
In addition, the revolution in smart grid involves a significant change
in side of the consumer where consumers will also become producer with
the ability of energy storage such as in the vehicle battery, or as a
local generation sources such as photovoltaic panels. However, the smart
grid develops modern solutions for the next-generation network and
digital communication in which many systems and subsystems are
interconnected to provide services from end-to-end network between
various actors and between intelligent devices that are deployed there.
Within each network, a hierarchical structure is composed of different
types of networks, such as the HANs (Home Area Networks), the BANs
(Building Area Networks), the IANs (Industrial Area Networks), the NANs
(Neighborhood Area Networks), the FANs (Field Area Networks), and the
WANs (Wide Area Networks). Currently, large societies propose the use of
cloud computing in smart grid applications connected with the electrical
control center. The main problem in the development of a smart grid is
not located at the physical medium but mainly in delivery of reliability
and security. The possibility of fitting with active or passive attacks
in smart grid network is great to divulge privacy and disrupt energy
(e.g. Wormhole Attack, False Data Injection Attack, Black Hole Attack,
Grey Hole Attack, DoS Attack, Physical Layer Attack, Colluding Adversary
Attack, Routing Table Overflow Attack etc.). Therefore, the security
requirements, including authentication, accountability, integrity,
non-repudiation, access control and confidentiality should be paid more
attention in the future for high performance smart grids. This book will
cover the current scope of various methodologies and mechanisms in the
theory and practice of security, privacy, intrusion detection, and
applied cryptography in smart grid communications in one place.

Objective
This comprehensive and timely publication aims to be an essential
reference source, building on the available literature in the field of
smart grid security in developing countries while providing for further
research opportunities in this dynamic field. It is hoped that this text
will provide the resources necessary for policy makers, technology
developers and managers to adopt and implement smart grid platforms in
developing nations across the globe.

Target Audience
Policy makers, academicians, researchers, advanced-level students,
technology developers, and government officials will find this book
useful in furthering their research exposure to pertinent topics in
smart grid security and assisting in furthering their own research
efforts in this field.

Recommended Topics
This book will include (but will not be limited to) the following
topics. Any other related topics in the area of smart grid security are
also welcome :

- Game theoretical models of smart grid security
- SCADA and legacy system security
- Security and Privacy in Mobile Cloud and Grid Computing
- Secure and resilient cyber-physical and communication architectures
- Intrusion Detection System (IDS)/Intrusion Prevention System (IPS)
- Machine learning for security
- Computer security visualization techniques
- Intrusion detection based on data mining techniques
- Online money laundering and underground economy
- Hardware vulnerabilities
- Binary analysis and reverse engineering
- Security risk assessment, measurement and management
- Network exfiltration
- Security, privacy, and resource management in Wireless Access Networks
(WPAN, WLAN, WLL, etc.)
- Security, Privacy, and Resource Management in Broadband Wireless
Technologies (HSDPA, HSUPA, LTE, WiMAX, WiRAN, etc.)
- Hardware security
- Quantum cryptography
- Privacy-preserving systems
- New attacks against computers and networks
- Denial-of-Service Attacks
- Insider attack detection
- Formal models, analysis, and standards
- Deception systems and honeypots
- Vulnerability analysis
- Secure software development
- Security and Privacy in Next Generation Mobile Networks
- Protocol security
- Network & active defenses
- Malware and botnet analysis, detection, and mitigation
- PHY/MAC/Routing/Transport/Application layer Protocols and Security
- Tamper-resistant device technologies
- Smartphone and other embedded systems security
- Fraudulent usage, prevention of traffic analysis
- Cryptography, key management, authorization and access control
- False data injection, detection and mitigation
- Performance evaluation, performance/security tradeoff analysis
- Modern infrastructure for cities(roads, power plants, water treatment
plants, sewage systems, transit systems)
- Energy Efficiency including non-conventional energy management
- Green Environment including E-Waste Management, Hospital Management
etc
- Electro-mobility
- Public key and conventional algorithms and their implementations
- Distributed systems security
- Cyber and Cross-Domain (power to cyber) security event detection,
analysis and response
- DoS/DDoS resiliency
- Cloud security
- Embedded systems security
- Security design and verification tools

Submission Procedure
Researchers and practitioners are invited to submit on or before March
5, 2016 (Extended), a 2-3 page chapter proposal clearly explaining the
mission and concerns of his or her proposed chapter. Authors of accepted
proposals will be notified by March 10, 2016 about the status of their
proposals and sent chapter guidelines. Full chapters are expected to be
submitted by May 15, 2016. All submitted chapters will be reviewed on a
double-blind review basis. Contributors may also be requested to serve
as reviewers for this project. Chapters with multiple authors are
welcome, even encouraged.

Propose a Chapter :
http://www.igi-global.com/publish/call-for-papers/submit/2020
Submit your full chapter:
http://www.igi-global.com/submission/submit-chapter/?projectid=6423111c-4d60-4cdc-b4cf-9c9fdecf080c


Publisher
This book is scheduled to be published by IGI Global (formerly Idea
Group Inc.), publisher of the "Information Science Reference" (formerly
Idea Group Reference), "Medical Information Science Reference,"
"Business Science Reference," and "Engineering Science Reference"
imprints. For additional information regarding the publisher, please
visit www.igi-global.com. This publication is anticipated to be released
in 2016.


Important Dates
March 5, 2016: Proposal Submission Deadline (Extended)
March 10, 2016: Notification of Acceptance
May 15, 2016: Full Chapter Submission
July 30, 2016: Review Results Returned
September 01, 2016: Final Acceptance Notification
September 15, 2016: Final Chapter Submission

Editors

Mohamed Amine Ferrag (Ph.D.)
Department of Computer Science
Faculty of Mathematics, Computer Science, and Material Science
Guelma University
BP 401 Guelma 24000 – Algeria
Tel.: +2137 96 96 14 53
E-mail: mohamed.amine.ferrag@gmail.com

Ahmed Ahmim (Ph.D.)
Department of Mathematics and Computer Science,
Faculty of Exact Sciences and Sciences of Nature and Life
University of Larbi Tebessi,
Route of Constantine, Tebessa 12000 – Algeria
Tel.: + 213 5 55 86 70 65
E-mail: a.ahmim@gmail.com

__________________________________________________
Dr. Mohamed Amine Ferrag
Assistant Professor
Department of Computer Science
Guelma University
BP 401 Guelma 24000, Algeria
Tel. : +213 796 961 453
E-mails: maferrag@outlook.fr / mohamed.amine.ferrag@gmail.com
maferrag@lrs-annaba.net
HomePage : https://sites.google.com/site/mohamedamineferrag/
____________________________________________________
**********************************************************
*
* 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] Copenhagen Summer School on Maritime Management, August 1-9 2016

Summer school:
Quantitative decision support in maritime shipping
at
Technical University of Denmark.
1st to 9th of August 2016


The focus of the course is on liner shipping and covers the areas Hinterland transport, pre-marshalling, berth scheduling, stowage, routing of containers, empty container repositioning, vessel repositioning, speed optimization, bunker purchasing and network design. The course will have presenters from Maersk and Optivation presenting their decision problems and decision support tools.

Presentation and exercises from the 1st of August to the 5th of August and the 8th and 9th of August. The course is finalized by a report by choice on a research article in the research area or on an assignment provided. The course is 5 ECTS and there is no registration fee. The course is limited to 15 participants.

Please contact Line Blander Reinhardt LBRE @ dtu.dk to sign up for the course.

**********************************************************
*
* 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] WABI 2016 - Final Call for Papers - Deadline extended to May 5

==================================================================
WABI 2016 - Final Call for Papers - Deadline extended to May 5

16th Workshop on Algorithms in Bioinformatics

August 22-24, 2016. Aarhus, Denmark

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

Submission deadline extended to: May 5, 23:59, 2016 (any timezone)

http://conferences.au.dk/algo16/wabi
===================================================================

Scope:

All research in algorithmic work in bioinformatics, computational biology and systems biology. The emphasis is mainly on discrete algorithms and machine-learning methods that address important problems in molecular biology, that are founded on sound models, that are computationally efficient, and that have been implemented and tested in simulations and on real datasets. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research.

Topics:

Original research papers (including significant work-in-progress) or state-of-the-art surveys are solicited in all aspects of algorithms in bioinformatics, computational biology and systems biology - including, but not limited to:

* Exact and approximate algorithms for sequence analysis, gene and signal recognition, alignment and assembly, molecular evolution, structure determination or prediction, gene expression, molecular pathways and networks, proteomics, functional and comparative genomics, and drug design.

* Methods, software, and data repositories for development and testing of such algorithms and their underlying models, as well as high-performance computing approaches to hard learning and optimization problems.

* Novel approaches to analyzing and modeling next-generation sequence data, including sequence assembly, population genomics, metagenomics, metatranscriptomics and small RNA sequencing.

Important Dates:

Submission deadline: May 5, 2016
Author notification: May 30, 2016
Final version due: June 13, 2016
Workshop: August 22-24, 2016

Keynote Speaker:

Kiyoshi Asai, University of Tokyo, Japan.

Details on submitting manuscripts:

See http://conferences.au.dk/algo16/wabi under 'Paper Submission' for details.

Proceedings:

Proceedings will be published in the Springer series Lecture Notes in
Bioinformatics, where accepted papers will be allotted 12 pages.
Selected papers will also be invited for an extended publication in a
thematic series in Algorithms for Molecular Biology (AMB).

Program Committee:

Tatsuya Akutsu, Kyoto University
Timothy L. Bailey, University of Queensland
Jan Baumbach, University of Southern Denmark
Anne Bergeron, Universite du Quebec a Montreal
Paola Bonizzoni, Universita di Milano-Bicocca
Alessandra Carbone, Universite Pierre et Marie Curie
Rita Casadio, University of Bologna
Nadia El-Mabrouk, University of Montreal
Martin Frith (co-chair), AIST
Anna Gambin, Warsaw University
Raffaele Giancarlo, Dipartimento di Matematica Universita di Palermo
Michiaki Hamada, Waseda University
Thomas Hamelryck, University of Copenhagen
Fereydoun Hormozdiari, University of California Davis
Katharina Huber, University of East Anglila
Carl Kingsford, Carnegie Mellon University
Hisanori Kiryu, The University of Tokyo
Gregory Kucherov, University Paris-Est Marne-la-Vallee
Timo Lassmann, Telethon Kids Institute
Ming Li, University of Waterloo
Zsuzsanna Liptak, University of Verona
Stefano Lonardi, University of California Riverside
Gerton Lunter, University of Oxford
Thomas Mailund, Aarhus University
Paul Medvedev, Pennsylvania State University
Daniel Merkle, University of Southern Denmark
Istvan Miklos, Rnyi Institute, Budapest
Bernard Moret, EPFL
Burkhard Morgenstern, University of Goettingen
Vincent Moulton, University of East Anglia
Veli Mäkinen, University of Helsinki
Luay Nakhleh, Rice University
William Noble, University of Washington
Christian Nørgaard Storm Pedersen (co-chair), Aarhus University
Nadia Pisanti, Universita di Pisa
Mihai Pop, University of Maryland
Teresa Przytycka, NIH
Sven Rahmann, University of Duisburg-Essen
Marie-France Sagot, INRIA
Kengo Sato, Keio University
Michael Schatz, Cold Spring Harbor Laboratory
Russell Schwartz, Carnegie Mellon University
Kana Shimizu, AIST
Anish Man Sing Shrestha, University of Tokyo
Peter F. Stadler, Leipzig University
Jens Stoye, Bielefeld University
Krister Swenson, Universite de Montpellier
Hélène Touzet, University of Lille
Lusheng Wang, City University of Hong Kong
Siu Ming Yiu, The University of Hong Kong
Louxin Zhang, National University of Singapore
Michal Ziv-Ukelson, Ben Gurion University of the Negev

--
Christian Nørgaard Storm Pedersen
Bioinformatics Research Center (BiRC), Aarhus University
http://www.birc.au.dk/~cstorm


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

[DMANET] Deadline extension: 10th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF) New York, USA, during July 9-11, 2016 in conjunction with IJCAI-16.

The submission deadline of the 10th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF) at IJCAI 2016 has been
extended by one week. The new deadline is now *May 8th*.

M-PREF is a non-archival venue and there will be no published
proceedings. However, informal proceedings will be provided at the
workshop and the papers will be posted on the website. Therefore it
will be possible to submit to other conferences and journals both in
parallel and subsequent to M-PREF 2016.

======================================================================
CALL FOR PAPERS:

10th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF)
New York, USA, during July 9-11, 2016
in conjunction with IJCAI-16.

http://www.mpref-2016.preflib.org
======================================================================

Preference handling has become a flourishing topic. There are many
interesting results, good examples for cross-fertilization between
disciplines, and many new questions.

Preferences are a central concept of decision making. As preferences
are fundamental for the analysis of human choice behavior, they are
becoming of increasing importance for computational fields such as
artificial intelligence, databases, and human-computer interaction as
well as for their respective applications. Preference models are
needed in decision-support systems such as web-based recommender
systems, in automated problem solvers such as configurators, and in
autonomous systems such as Mars rovers. Nearly all areas of artificial
intelligence deal with choice situations and can thus benefit from
computational methods for handling preferences. Preference handling is
also important for machine learning as preferences may guide learning
behavior and be subject of dedicated learning methods. Moreover,
social choice methods are also of key importance in computational
domains such as multi-agent systems.

This broadened scope of preferences leads to new types of preference
models, new problems for applying preference structures, and new kinds
of benefits. Preferences are studied in many areas of artificial
intelligence such as knowledge representation & reasoning, multi-agent
systems, game theory, social choice, constraint satisfaction, decision
making, decision-theoretic planning, and beyond. Preferences are
inherently a multi-disciplinary topic, of interest to economists,
computer scientists, operations researchers, mathematicians and more.

This workshop promotes this broadened scope of preference handling and
continues a series of events on preference handling at AAAI-02,
Dagstuhl in 2004, IJCAI-05, ECAI-06, VLDB-07, AAAI-08, ADT-09,
ECAI-2010, ECAI-2012, IJCAI-13, AAAI-14, and IJCAI-15. At the
previous edition of ADT-15 and LPNMR-15, which were co-located, one of
the conclusions was that collaboration between the two areas can be
very fruitful and should be fostered.

The workshop will provide a forum for presenting advances in
preference handling and for exchanging experiences between researchers
facing similar questions, but coming from different fields. The
workshop builds on the large number of AI researchers working on
preference-related issues, but also seeks to attract researchers from
databases, multi-criteria decision making, economics, etc.


======================================================================
TOPICS OF INTEREST
======================================================================

The workshop on Advances in Preference Handling addresses all
computational aspects of preference handling. This includes methods
for the elicitation, learning, modeling, representation, aggregation,
and management of preferences and for reasoning about preferences. The
workshop studies the usage of preferences in computational tasks from
decision making, database querying, web search, personalized
human-computer interaction, personalized recommender systems,
e-commerce, multi-agent systems, game theory, social choice,
combinatorial optimization, planning and robotics, automated problem
solving, perception and natural language understanding and other
computational tasks involving choices. The workshop seeks to improve
the overall understanding of and best methodologies for preferences in
order to realize their benefits in the multiplicity of tasks for which
they are used. Another important goal is to provide
cross-fertilization between the numerous sub-fields that work with
preferences.

* Preference handling in artificial intelligence
* Preference handling in database systems
* Preference handling in multiagent systems
* Applications of preferences
* Preference elicitation
* Preference representation and modeling
* Properties and semantics of preferences
* Practical preferences


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

*May 8th*, 2016: Workshop paper submission deadline.
May 20th, 2016: Notification on workshop paper submissions.
June 1st, 2016: Camera-ready copy due to organizers.
July 9th, 10th, or 11th, 2016: M-PREF'16 Workshop.


=====================================================================
SUBMISSION
=====================================================================

Researchers interested in preference handling from AI, OR, DB, CS or
other computational fields may submit a paper formatted according to
the IJCAI Formatting Instructions and up to 6 pages in length + 1 page
for references in PDF format. Workshop submissions and camera ready
versions will be handled by EasyChair. Feel free to submit either
anonymized or non-anonymized versions of your work. We have enabled
anonymous reviewing so EasyChair will not reveal the authors unless
you chose to do so in your submission.

At least one author from each accepted paper must register for the
workshop. Please see the IJCAI 2016 Website for information about
accommodation and registration.

Link to the paper submission page on EasyChair:

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


======================================================================
WORKSHOP CHAIRS
======================================================================

Markus Endres, University of Augsburg (Germany)
Nicholas Mattei, Optimization Research Group, Data 61 (NICTA) and
University of
New South Wales (Australia)
Andreas Pfandler, TU Wien (Austria) and University of Siegen (Germany)

======================================================================
PROGRAM COMMITTEE
======================================================================

Thomas Allen, University of Kentucky
Stefano Bistarelli, Università di Perugia
Sylvain Bouveret, LIG - Grenoble INP
Darius Braziunas, Kobo Inc.
Jan Chomicki, University at Buffalo
Paolo Ciaccia, University of Bologna
James Delgrande, Simon Fraser University
Matthias Ehrgott, Lancaster
Gabor Erdelyi, Universitaet Siegen
Johannes Fürnkranz, TU Darmstadt
Judy Goldsmith, University of Kentucky
Ulrich Junker
Souhila Kaci, LIRMM
Jérôme Lang, LAMSADE
Nicolas Maudet, Université Pierre et Marie Curie
Vincent Mousseau, LGI, Ecole Centrale Paris
Patrice Perny, LIP6
Maria Silvia Pini, University of Padova
Francesca Rossi, University of Padova and Harvard University
Scott Sanner, University of Toronto
Alexis Tsoukias, CNRS - LAMSADE
Kristen Brent Venable, Tulane University and IHMC
Paolo Viappiani, CNRS and LIP6, Univ Pierre et Marie Curie
Toby Walsh, UNSW and Data61/NICTA
Antonius Weinzierl, Vienna University of Technology
Paul Weng, SYSU-CMU JIE
Lirong Xia, RPI
Neil Yorke-Smith, American University of Beirut
Yong Zheng, DePaul 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] Horst Sachs 1927-2016

Dear colleagues:

Many of you will be saddened to hear that Horst Sachs has died. He passed away on 25 April 2016, having turned 89 only a few weeks before, on 27 March. - Sachs founded the graph theory school in Ilmenau, which served as an important link between east and west during the iron curtain time and afterwards. More than a hundred scientific papers, among them the seminal book on graph spectra (with Doob and Cvetkovic), established his excellent international reputation. After his retirement in 1992 until his last months he continued his research and showed up regularly at the institute.

Thomas Böhme - Jochen Harant - Matthias Kriesell - Michael Stiebitz

**********************************************************
*
* 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] META'2016 Special Session CfP (Optimization methods for the design of production systems)



*Special Session Call for Papers*

*META'2016 Special Session on *
Optimization methods for the design of production systems

*International Conference on Metaheuristics and Nature Inspired
Computing (META'2016)*

*27-31 Oct 2016 Marrakech, Morocco*

​*SCOPE*

Getting the highest performances with the lowest costs while respecting
environmental constraints is one of the most important concerns of the
designers of production and assembly systems. In addition to that, numerous
sub-problems may be considered in the design procedure such as: buffers
sizing, equipment selection, line balancing, etc. The aim of this session
is to introduce heuristic and metaheuristic optimization methods developed
to get an efficient design of production systems. We will focus on studies
that propose approached optimization techniques to solve various design
problems. Regarding the optimization approaches, single criterion and multi
criteria optimization approaches could be presented.

The topics of this session, but are not limited to, are:


- Manufacturing systems design: buffers sizing, equipment selection,
line balancing, reliability, eco-design, etc
- New heuristic and metaheuristic approaches for manufacturing systems
- Single criterion and multi-criteria optimization methods.



​*IMPORTANT DATES*
- *May 6, 2016*: Paper submission deadline

- *June 3, 2016*: Notification to the authors​

​*SUBMISSION GUIDELINES*

This special session will be held as part of the META'16 conference. Please
submit your paper using the online submission system, as described in the
instructions for authors. During the submission process you should indicate
that the paper is for a special session, which is: '*Metaheuristics for
software engineering*'. Detailed instructions for submitting the papers are
provided on the conference home page at:
http://meta2016.sciencesconf.org/

*​CATEGORIES OF SUBMISSIONS *
Several categories of submissions may be accepted:

- *S1*: Extended abstracts of work-in-progress and position papers
of a maximum of 3 pages
- *S2*: Original research contributions of a maximum of 10 pages
- *S3*: High-quality manuscripts that have recently, within the
last year, been submitted or accepted for journal publication

*CONFERENCE PROCEEDINGS *
​​
Accepted papers in categories *S1* and *S2* will be published in the
proceedings that will be available at the conference. In addition, a
post-conference Springer book and special issue of Journals is planned to
be published. Participants will be invited to submit extended versions of
their work for consideration.

*SPECIAL SESSION ORGANIZERS:*
*​​*

- Dr. Taha Arbaoui (ICD-LOSI, University of Technology of Troyes, France.
taha.arbaoui@utt.fr)
- Prof. Farouk Yalaoui
(
​ICD-LOSI, ​
University of Technology of Troyes,
​ France.​
farouk.yalaoui@utt.fr
)
- Prof. Mustapha Nourelfath (
Department of Mechanical Engineering, Laval University, Quebec, Canada
​.
mustapha.nourelfath@gmc.ulaval.ca
​)

**********************************************************
*
* 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] Final CfP: Matheuristics 2016

Matheuristics 2016
---
Sixth International Workshop on Model-based Metaheuristics


EXTENDED DEADLINE: May 4, 2016

4-7 September, 2016. Brussels, Belgium

More details and up-to-date information at
iridia.ulb.ac.be/matheuristics2016


Scope of the Workshop
======================


The Matheuristics workshop series is proposed as a primary forum for
researchers working on exploiting mathematical programming techniques
in a (meta)heuristic framework, granting to mathematical programming
approaches the problem robustness and time effectiveness that
characterize heuristics, or exploiting the mathematical programming
model formulation in the customization of a heuristic for specific or
general problems.

Metaheuristics such as tabu search, simulated annealing, GRASP, VNS,
genetic algorithms and ant colonies, have been originally proposed and
developed when the available Mixed Integer Programming (MIP)
algorithms and software or Constraint Programming methods were not an
efficient or even feasible alternative for solving real-world problem
instances, or significant subproblems thereof.

However, research on mathematical programming, and in particular on
discrete optimization, has led to a state of the art where MIP solvers
or customized MIP codes can be effective even in a heuristic context,
both as primary solvers or as subprocedures.

Matheuristics 2016 aims at collecting contributions that define the
state of the art for the computational effectiveness and efficiency or
the theoretical properties of matheuristics, which are algorithms
and codes that integrate metaheuristics and MIP strategies and
software. The workshop will be entirely devoted to this subject of
research and its applications. The conference program will consist of
plenary presentations, enriched by a couple of keynote or tutorial
lectures. Topics of interest include (but are not limited to):

- Model-based metaheuristics,
- Hybridizing (meta)heuristics and exact methods,
- MIP techniques used for defining heuristic solvers (such as local branching and RINS),
- Problem relaxations to guide (heuristic) search,
- Information from exact algorithms to develop heuristics,
- Decompositions and lower/upper bounds in matheuristic codes,
- Stochastic programming and heuristic search,
- Metaheuristics for stochastic problems,
- Design and configuration of matheuristic algorithms,
- Experimental analysis and modeling of algorithms,
- Real world case histories of matheuristic applications, and
- Automatic configuration of matheuristics and algorithm selection among others.

Although we do not discard their importance, Matheuristics 2016 is not
interested in heuristics tailored to a specific problem that have no
element which can be generalized to other problems (no matter how
mathematically sophisticated they are) nor in metaheuristics variants
or implementations that are not justified by a mathematical model.


Submission Instructions
========================

Submissions to Matheuristics 2016 should be comprehensive and self-contained,
and relevant to the topic of the workshop.

Submissions can be done in one of three categories:

* Contributed article of up to 12 pages. These will be distributed in
informal proceedings for the workshop.
* Short abstracts of up to 4 pages. Abstracts should be extensive enough
to let referees judge the quality and relevance of the work.
* Work that has recently been published or submitted elsewhere (journal or
high-quality conferences) and is relevant for the workshop for oral
presentation only (free format).

The submission site is open and submissions can be done at
https://easychair.org/conferences/?conf=matheuristics2016


Publication Details
====================

The workshop will have informal proceedings that are distributed
through the Matheuristics 2016 webpage.

The post-conference publication will happen through a special issue
in the journal International Transactions in Operational Research (ITOR).


Further Information
====================

Up-to-date information will be published on the web site
iridia.ulb.ac.be/matheuristics2016. For information about local
arrangements, registration forms, etc., please refer to the
above-mentioned web site or contact the local organizers at the
address below.

Matheuristics 2016 will be organized back-to-back with ANTS 2016,
http://iridia.ulb.ac.be/ants2016/ and the two conferences will
share an invited talk and coffee breaks.


Workshop Address
================

Matheuristics WORKSHOP
IRIDIA, CP 194/6 Tel +32-2-6502729
Universite' Libre de Bruxelles Fax +32-2-6502715
Av. F. D. Roosevelt 50 iridia.ulb.ac.be/matheuristics2016
1050 Bruxelles, Belgium email: matheuristics@iridia.ulb.ac.be


Workshop Location
=================

Universite Libre de Bruxelles, Brussels, Belgium.


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

Submission deadline May 4, 2016
Notification of acceptance June 12, 2016
Camera ready copy June 30, 2016
Early registration June 30, 2016
Workshop September 4-7, 2016
ITOR special issue October 15, 2016


Matheuristics Committee
============================

General Chair

Thomas Stuetzle, IRIDIA, CoDE, ULB, Brussels, Belgium

Programme Chairs

Thomas Stuetzle, IRIDIA, CoDE, ULB, Brussels, Belgium
Vittorio Maniezzo, Universita di Bologna, Italy

Organisation Committee

Alberto Franzin, IRIDIA, ULB, Brussels, Belgium
Federico Pagnozzi, IRIDIA, ULB, Brussels, Belgium
Leslie Perez Caceres, IRIDIA, ULB, Brussels, Belgium

**********************************************************
*
* 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] KaHiP v1.0 -- Karlsruhe High Quality Graph Partitioning

Release of KaHiP v1.00
------------------------------------

We are proud to announce the release of a major update of our graph
partitioning framework KaHiP (Karlsruhe High Quality Graph
Partitioning). KaHiP is a family of high quality graph partitioning
programs. It contains various graph partitioning algorithms that can be
configured to either achieve the best known partitions for many standard
benchmark instances or to be a good tradeoff between partition quality
and running time. Since our first major release we added:

- advanced multilevel node separator algorithms based on max-flow
min-cut computations
- better support for social networks and web graphs by using
clustering-based contractions
- size-constraint label propagation
- a java interface as well as some bug fixes

The software is released under the GPL 3.0 License.

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

* github
https://github.com/schulzchristian/KaHIP

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

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

Thursday, April 28, 2016

[DMANET] RTIS 2016

First International Conference on Real Time Intelligent Systems (RTIS
2016)
Beijing, China
September 01-03, 2016)
http://www.socio.org.uk/rtis/
http://www.dirf.org/rtis/

The Proceedings will be published in the Proceedings of the First
International Conference on Real-Time Intelligent Systems, Volume 1 RTIS
2016. (http://www.springer.com/series/11156)

About the Conference

Real-Time Computing covers a broad spectrum of the intensively
developing area of low-latency priority-driven system responsiveness
under certain time constrains to essential and decisive human-computer
interactions with constantly incoming data stream. Research on real-time
intelligent systems is of a multi-disciplinary nature, exploiting
concepts from the areas as diverse as signal processing technologies,
computational intelligence, location systems, data processing, digital
document processing and embedded system design. To accomplish its
real-time performance, systematic analysis is carried out when the
systems are working.

Therefore, over the last few years real-time intelligent computing has
radically transformed human life style. In the today's competitive and
highly dynamic environment, analyzing data in real time is a must to
understand in detail how the systems are processing the data and to
reason the outputs and anticipate the trends in intelligent computing,
has become critical.

To leverage the full potential of the opportunity build complex real
time systems, intense research is required and this conference will
serve as one such platform to manifest the ongoing research in the real
time intelligence system.
The conference welcomes theoretically grounded, methodologically sound
research papers from academia and industry that address variety of
aspects and innovations related to real-time computing systems.

The scope of the conference includes, but is not limited to the
following areas:

Streaming data, streaming engines
Big Data systems and applications for high-velocity data
Analysis in advanced domains such as energy, sensors, etc
Artificial Intelligence
Broadband Intelligence
Cloud Computing and Intelligence
Collaborative Intelligence
Crowdsourcing and crowd intelligence
Data capture in real-time
Intelligent Database Systems
Data mining
Intelligent Data Analysis
OLAP for real-time decision support
Data quality and cleansing
Intelligent Fuzzy Systems
Event-driven analytics
Visualizing real-time data and information
Intelligent Soft Computing
Privacy and security in Intelligence
Architectures for Intelligence
Internet of Things
Intelligent Robotic Systems
Smart Services and Platforms
Intelligent Transportation Systems
Mobile Smart Systems
Trace-based intelligent real-time services (eye-tracking, image
tracking)
Real-time intelligent alert systems
Machine translation in real time
Multilingual information access
Multiagent Intelligent Systems
Intelligent Information Systems
Adaptive vision algorithms
Real-time Intelligent Network solutions
Real-time distributed coding
Real-time modelling user's information needs
Real-time noise removal systems
Real-time intelligent communication
Real-time remote access systems
Decision support systems in real time
Real-time multiprocessor systems

Submissions at: http://www.socio.org.uk/rtis/paper-submission/

The Proceedings will be published in the Proceedings of the 1st
International Conference on Real-Time Intelligent Systems, Volume 1 RTIS
2016. (http://www.springer.com/series/11156)

Important Dates

Paper Submission: June 15, 2016
Paper Notification: July 05, 2016
Camera ready: August 01, 2016
Registration: August 15, 2016
Conference Dates: September 01-03, 2016

The RTIS will have Doctoral Consortium, DEMO Session, Journal Track,
Mentorship Programme, Ph.D. Dissertation Competition, Proofread
translation program
and Virtual Presentation (Video Conferencing)

The following journals will accommodate the extended versions of the
papers.

-Artificial Intelligence in Medicine
-Engineering Applications of Artificial Intelligence – The International
Journal of Intelligent Real-Time Automation
-Computers in Human Behaviour
-Virtual Reality
-The Journal of Intelligent Systems
-Journal of Digital Information Management (JDIM)
-International Journal of Imaging & Robotics
-International Journal of Tomography & Simulation

Submissions at: http://www.socio.org.uk/rtis/paper-submission/
CONTACT: rtis at socio.org.uk
-------------------------------------------------------------------------------------------------------------------------------------------------


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

[DMANET] SAGT 2016 - Second Call for Papers

9th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY

SAGT 2016

http://sagt16.csc.liv.ac.uk/

Liverpool, UK, September 19-21, 2016

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

IMPORTANT DATES

- Submission: May 13, 2016.
- Notification: July 1, 2016.
- Camera ready: July 15, 2016.

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

The 9th International Symposium on Algorithmic Game Theory (SAGT) will
take place in Liverpool, UK, September 19-21, 2016. The purpose of SAGT
is to bring together researchers from Computer Science, Economics,
Physics, Biology and Mathematics to present and discuss original
research at the intersection of Algorithms and Game Theory.

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

- Constantinos Daskalakis, MIT
- Olivier Gossner, LSE and École Polytechnique
- Kurt Mehlhorn, MPI Informatik


SUBMISSIONS
-----------

Authors are invited to submit previously unpublished work on any aspects
of algorithmic game theory for possible presentation at the conference.
For more detailed call for papers, submission guidelines and
instructions see http://sagt16.csc.liv.ac.uk/cfp.html.

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

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


STUDENT SUPPORT
---------------

We are delighted to announce that funding for students is available for
SAGT 2016. The purpose is to enable graduate students to travel and
participate in the conference.

For eligibility and registration details of travel support see
http://sagt16.csc.liv.ac.uk/studentsupport.php


PROGRAM COMMITTEE
-----------------
- Yakov Babichenko, Technion
- Umang Bhaskar, TIFR
- Yang Cai, McGill
- Xi Chen, Columbia U.
- Paul Duetting, ETH Zürich
- Edith Elkind, U. Oxford
- Martin Gairing, U. Liverpool (co-chair)
- Gagan Goel, Google
- Paul Goldberg, U. Oxford
- Tobias Harks, Augsburg U.
- Max Klimm, TU Berlin
- Kostas Kollias, Google
- Sebastien Lahaie, MSR New York City
- Pascal Lenzner, HPI Potsdam
- Stefano Leonardi, Sapienza U.
- Troels Bjerre Lund, ITU Copenhagen
- David Manlove, U. Glasgow
- Ruta Mehta, U. Illinois Urbana-Champaign
- Vangelis Markakis, AUEB
- Britta Peis, RWTH Aachen U.
- Ron Peretz, Bar-Ilan U.
- Georgios Piliouras, SUTD
- Maria Polukarov, U. Southampton
- Rahul Savani, U. Liverpool (co-chair)
- Marco Scarsini, LUISS Rome
- Alexander Skopalik, Paderborn U.
- Eric Sodomka, Facebook
- Orestis Telelis, U. Piraeus


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


ORGANIZING COMMITTEE
--------------------
- Eleftherios Anastasiadis, U. Liverpool
- Giorgos Christodoulou (chair), U. Liverpool
- Argyrios Deligkas, U. Liverpool
- Tobenna Peter Igwe, U. Liverpool
- Grammateia Kotsialou, U. Liverpool
- Alkmini Sgouritsa, U. Liverpool

**********************************************************
*
* 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] SIROCCO 2016 final call for papers - one week to deadline

SIROCCO 2016
23rd International Colloquium on Structural Information and
Communication Complexity
19-21 July 2016, Helsinki, Finland
http://sirocco2016.hiit.fi/


CALL FOR PAPERS


DATES

- Submission deadline: 6 May 2016 (Friday), at 23:59, anywhere on earth

- Notification of acceptance: 9 June 2016 (Thursday)

- Conference: 19-21 July 2016 (Tuesday-Thursday)


THEME

SIROCCO is devoted to the study of the interplay between communication
and knowledge in multi-processor systems from both the qualitative and
quantitative viewpoints. Special emphasis is given to innovative
approaches and fundamental understanding, in addition to efforts to
optimize current designs.

SIROCCO has a tradition of interesting and productive scientific
meetings in a relaxed and pleasant atmosphere, attracting leading
researchers in a variety of fields in which communication and knowledge
play a significant role.


SCOPE

Original papers are solicited from all areas of study of local
structural knowledge and global communication and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, and communication complexity. Keeping with the tradition of
SIROCCO, new areas are always welcome.


PAPER SUBMISSION

Papers are to be submitted electronically through EasyChair at

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

Authors are invited to submit their work in one of the three acceptable
formats: novel research contributions, position papers, and surveys.
Original research papers must contain results that have not previously
appeared and have not been concurrently submitted to a journal or
conference with published proceedings. In all cases, any partial overlap
with any published or concurrently submitted paper must be clearly
indicated.

All submissions must be in English, in PDF format. You can use either of
the following layouts for your submissions:

- Cover page + 10 pages + references, letter or A4 paper, single column,
at least 11-point font, at least 1-inch margins, reasonable line spacing.

- 12 pages + references, LIPIcs or LNCS style.

Additional details may be included in an appendix, to be read at the
programme committee's discretion.


PROCEEDINGS

The post-proceedings of SIROCCO 2016 will be published by Springer in
the Lecture Notes in Computer Science series (LNCS) after the conference.

We will also prepare an informal pre-proceedings volume with
author-prepared versions of the papers. The pre-proceedings will be
freely available online on the conference web page before the conference.


SPECIAL ISSUE

Selected papers from SIROCCO 2016 will be invited to a special issue of
the Theoretical Computer Science journal.


BEST PAPER AWARD

The authors of the best paper will be awarded a prize of 1000 EUR (in
total, to be split among the authors), sponsored by Springer. The
program committee may choose to split the award among multiple papers.


PROGRAMME COMMITTEE

- Leonid Barenboim, Open University of Israel, Israel
- Jeremie Chalopin, LIF, CNRS & Aix Marseille Universite, France
- Yuval Emek, Technion, Israel
- Paola Flocchini, University of Ottawa, Canada
- Pierre Fraigniaud, CNRS & Universite Paris Diderot, France
- Janne H. Korhonen, Reykjavik University, Iceland
- Evangelos Kranakis, Carleton University, Canada
- Christoph Lenzen, MPI for Informatics, Germany
- Friedhelm Meyer auf der Heide, Heinz Nixdorf Institute & University of
Paderborn, Germany
- Danupon Nanongkai, KTH Royal Institute of Technology, Sweden
- Calvin Newport, Georgetown University, USA
- Gopal Pandurangan, University of Houston, USA
- Merav Parter, MIT, USA
- Peter Robinson, Queen's University Belfast, UK
- Thomas Sauerwald, University of Cambridge, UK
- Stefan Schmid, Aalborg University, Denmark
- Jukka Suomela, Aalto University, Finland, chair
- Przemyslaw Uznanski, ETH Zurich, Switzerland


CONFERENCE HIGHLIGHTS

- Keynote speaker: Yoram Moses

- Invited speakers: Keren Censor-Hillel, Adrian Kosowski, Danupon
Nanongkai, Thomas Sauerwald

- Award lecture: Masafumi (Mark) Yamashita, the recipient of the 2016
SIROCCO Prize for Innovation in distributed computing


MORE INFORMATION

Please refer to the conference web page at http://sirocco2016.hiit.fi/
for more information on SIROCCO 2016.
**********************************************************
*
* 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] Multiple Lecturer Positions at University of Rochester

Dear Colleagues,

The University of Rochester Dept. of Computer Science is recruiting for two full-time Lecturer in Computer Science positions. The short version of the ad is below, and the full version can be found by scrolling down on the page http://www.cs.rochester.edu/about/recruit.html <http://www.cs.rochester.edu/about/recruit.html>

Also, separately, the University of Rochester's Institute for Data Science (which is a close partner to the CS department, and we'll share a new building both will move into in 2017) is recruiting for one full-time Lecturer in Data Science and Computer Science. The ad for that can be found at https://www.rochester.edu/data-science/jobs.html

If these fit you and are of interest to you, please rush to your browser and apply!! (And in case after reading the long versions of the ads you have questions about these positions, fyi the chairs of the CS department and the data science institute are, respectively, Prof. Sandhya Dwarkadas (dwarkadas@cs.rochester.edu) and Prof. Henry Kautz (kautz@cs.rochester.edu).)

Sincerely,
Lane A. Hemaspaandra, URCS (the short version of the CS ad is included below)

Lecturer Positions in Computer Science

The University of Rochester Department of Computer Science seeks applicants for two full time lecturer positions. Candidates must have a PhD in computer science or a related discipline and/or significant teaching experience. The preferred candidate will have college teaching experience, a strong commitment to working with students, the ability and passion to help develop new courses along with any necessary labs, and high personal motivation and responsibility. The position may start as early as July 1, 2016.

Candidates should supply a letter of interest, curriculum vitae, and the names of 3 references. Apply online at https://www.rochester.edu/faculty-recruiting/login

For more information about the University of Rochester Computer Science Department, please visit: http://www.cs.rochester.edu


**********************************************************
*
* 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] WAOA 2016 - First Call for Papers

=================================================================
WAOA 2016 - First Call for papers

14th Workshop on Approximation and Online Algorithms
http://conferences.au.dk/algo16/waoa/

August 25-26, 2016. Aarhus, Denmark
=================================================================
Important Dates

Submission deadline: June 12th, 2016
Notification: July 17th, 2016
Workshop: August 25-26, 2016
Camera Ready: October 16th, 2016

====================================================================
Invited Speakers:

Marek Cygan, University of Warsaw, Poland.

Ronald de Wolf, CWI and University of Amsterdam, Netherlands.

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

Scope:

Algorithms have become a fundamental tool in several fields outside of Computer Science,
and in several applications algorithms have to cope with computationally hard problems
and problems in which the input is gradually disclosed over time.
The workshop focuses on the design and analysis of approximation and online algorithms.

WAOA 2016 will be part of ALGO 2016 (http://conferences.au.dk/algo16/home/),
which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, IPEC, WABI and MASSIVE.
ALGO 2016 will take place 22-26 August 2016 in Aarhus, Denmark.

Topics
Papers are solicited in all research areas related to approximation and online algorithms,
including, but not limited to:

-algorithmic game theory
-algorithmic trading
-coloring and partitioning
-competitive analysis
-computational advertising
-computational finance
-cuts and connectivity
-geometric problems
-graph algorithms
-inapproximabilty results
-mechanism design
-network design
-packing and covering
-paradigms for the design and analysis of approximation and online algorithms
-parameterized complexity
-real-world applications
-scheduling problems

====================================================================
Publication:

Proceedings will be published after the workshop takes place in the
Springer series Lecture Notes in Computer Science.
Instructions for authors can be found at Springer web site (www.springer.com/lncs).

Submission guidelines:

Authors are invited to submit an extended abstract or full paper of at most 12 pages
in Springer's LNCS style (please add page numbers) describing original unpublished research.
Simultaneous submission to other conferences with published proceedings is not permitted.
The title page of the submission should include the authors' full names, addresses, e-mail addresses,
and an abstract summarizing the results in roughly 100-200 words; the remainder of the submission
should contain a description of the main results and an explanation of their importance.
The submission must include a full proof of the results, part of which can be placed in the appendix,
whose length is not constrained.
Papers should be submitted electronically via the EasyChair submission system at:

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

The WAOA proceedings will be published in the Lecture Notes in Computer Science series by Springer-Verlag.
Each accepted paper will be allotted 12 pages in the proceedings.

By submitting a paper the authors acknowledge that in case of acceptance
at least one of the authors must register at ALGO 2016 or WAOA 2016,
attend the conference, and present the paper.


====================================================================
Program Committee

Per Austrin, KTH Sweden
Nikhil Bansal, Eindhoven University of Technology
Jose Correa, Universidad de Chile
Marek Cygan, University of Warsaw
Mike Fellows, University of Bergen
Samuel Fiorini, Université libre de Bruxelles
Naveen Garg, IIT Delhi
Fabrizio Grandoni, IDSIA Switzerland
Luciano Gualà, University of Rome "Tor Vergata"
Jochen Koenemann, University of Waterloo
Klaus Jansen (co-chair), University of Kiel
Monaldo Mastrolilli (co-chair), IDSIA Switzerland
Nicole Megow, TU München
Ben Moseley, Washington University
Vangelis Paschos, University Paris-Dauphine
Andreas S. Schulz, TU München
Roberto Solis-Oba, Western University
Rob van Stee, University of Leicester
Leen Stougie, Vrije Universiteit & CWI Amsterdam
Ola Svensson, EPFL Switzerland


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