DMANET: DISCRETE MATHEMATICS AND ALGORITHMS

Friday, January 22, 2016

dmanet Digest, Vol 95, Issue 20

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. Ph.D. position, School of Computing, Clemson University
(Ilya Safro)
2. School on parameterized algorithms in Osaka (Rémy Belmonte)
3. Postdoc Position in Algorithms, TU Munich (Susanne Albers)
4. CFP: AAAC 2016 (Chung-Shou Liao)
5. Lectureship in Computer Science at Durham U., UK (Andrei Krokhin)
6. CFP: 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of
Algorithms (Mark Daniel Ward)
7. EURO28: Optimization in Public Transport (Leo Kroon)

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

Message: 1
Date: Wed, 20 Jan 2016 17:04:14 -0500
From: Ilya Safro <isafro@g.clemson.edu>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Ph.D. position, School of Computing, Clemson
University
Message-ID:
<CAF3gMM_HUSBzzg0sGeo8oiP4L+dJUA40QvEQsYAstyN8BKjs-w@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

We are looking for an excellent candidate for a Ph.D. position in the
School of Computing at Clemson University beginning Fall 2016. The
candidate will work under the supervision of Dr. Ilya Safro on
combinatorial scientific computing, and large-scale discrete optimization.
Some projects will include collaboration with national labs.

The ideal candidate should have a solid background in
- theoretical computer science, discrete mathematics, algorithms
- numerical methods (in particular, in linear algebra)
- C/C++

Some experience in the following areas will be considered as an advantage
(not mandatory)
- HPC and parallel programming/MPI/OpenMP/Hadoop
- multigrid
- scientific computing libraries (such as PETSc)

Please apply online at
http://www.clemson.edu/graduate/admissions/apply/application.html

The School of Computing has 42 faculty members, more than 400 undergraduate
majors, and over 200 graduate students collectively across its three
divisions: Computer Science, Visual Computing, and Human-Centered
Computing. Clemson University is located in Clemson, South Carolina, a
college town on beautiful Lake Hartwell at the foothills of the Blue Ridge
Mountains, conveniently situated within a 2hr drive from both Atlanta and
Charlotte. Clemson has an enrollment of approximately 20,000. U.S. News &
World Report has ranked Clemson in the Top 20 nationally among public
universities, and Clemson ranks number 5 among U.S. universities in
supercomputing.

--
Ilya Safro
School of Computing
Clemson University
http://www.cs.clemson.edu/~isafro

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

Message: 2
Date: Thu, 21 Jan 2016 14:49:13 +0900
From: Rémy Belmonte <remybelmonte@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] School on parameterized algorithms in Osaka
Message-ID:
<CANoQ38ari_tKi1okN3edJVNqgG752UWet_A09MNqmLzfgVaOCQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear colleagues,

We are glad to invite you to the ELC School on Parameterized Algorithms
which will be held in Osaka, Japan, from March 17th until Sunday 20th,
2016. The lectures will cover introductory notions, accessible to
beginners, as well as more recent and advanced results.
The school is primarily intended for graduate students and young
researchers who wish to get acquainted with and further their knowledge of
this rapidly growing field.

Lecturers:
- Daniel Lokshtanov, University of Bergen, Norway,
- Michał Pilipczuk, University of Warsaw, Poland.

You can find more information at
http://www.al.ics.saitama-u.ac.jp/elc/blog/elc-school-on-parameterized, or
contact us at remybelmonte@gmail.com with any question you may have.

We hope you will be able to accept this invitation and attend the school,
and are looking forward to seeing you in Osaka!

Best regards,

Local organizers:
Rémy Belmonte
Naoki Katoh

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

Message: 3
Date: Thu, 21 Jan 2016 10:46:50 +0100
From: Susanne Albers <albers@in.tum.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc Position in Algorithms, TU Munich
Message-ID: <mailman.2.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=utf-8; format=flowed

Postdoctoral Position in Algorithms
TU Munich

A postdoctoral position in the area of efficient algorithms is available in
the research group of Prof. Susanne Albers, Department of Computer Science,
Technical University Munich (TU Munich).

The postdoc may pursue his/her own line of research but a research interest
in approximation and online algorithms, algorithmic game theory or algorithm
engineering is very welcome. More information about Susanne Albers and
the research group can be found at http://wwwalbers.in.tum.de/index.html.en

The position is supported by a grant of the German Research Foundation and
provides a competitive 12 month salary with standard benefits. The
appointment
is for a period of 12 months. The expected start date of the position is
summer/fall 2016.

The successful candidate should have a PhD degree in computer science or
mathematics. Furthermore, he/she should be interested in collaborating with
PhD students and participating in the teaching activities of the group.
The application material should include (1) a cover letter describing the
interest in the position, (2) a CV and list of publications, (3) a short
research summary, and (4) the names and contact information of at least
two references. The material should be sent electronically to
<albers@in.tum.de>.

Applications will be reviewed starting from February 20, 2016.

Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de

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

Message: 4
Date: Thu, 21 Jan 2016 22:01:27 +0800
From: Chung-Shou Liao <csliao@ie.nthu.edu.tw>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: AAAC 2016
Message-ID:
<CAJHuNBC6aGk3+ZtmdhrxUfd1AbPpfiU0W6-K2CbHVKXdeHvGMA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

AAAC 2016
The 9th Annual Meeting of Asian Association for Algorithms and Computation
May 14-16, 2016, Taipei, Taiwan

FIRST CALL FOR PAPERS
----------------------------------------------------------------------
We invite submissions of abstracts presenting original research or surveys
in theoretical computer science.

TOPICS OF INTEREST
----------------------------------------------------------------------
All areas of theoretical computer science, especially design and analysis
of algorithms and complexity theory

SUBMISSION DETAILS
----------------------------------------------------------------------
Authors are invited to submit one-page (A4) abstracts (in pdf format) that
can be based on original results or survey of existing results. Informal
working notes including the one-page abstracts will be distributed at the
meeting, which does not prevent any form of future publication of the same
work. All submissions should be made electronically. Papers are now being
accepted through the EasyChair Conference System.
http://easychair.org/conferences/?conf=aaac2016

IMPORTANT DATES
----------------------------------------------------------------------
One-page abstract submission due: Feb 26, 2016
Notification: March 25, 2016
Early Registration due: April 1, 2016
Conference Dates: May 14(Sat)-16(Mon), 2016

KEYNOTE SPEECHES & TUTORIALS
----------------------------------------------------------------------
Keynote Speeches:
-------------------
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)
Title: Route Planning Algorithms – New Results and Challenges

Fan Chung Graham (University of California, San Diego, USA)
Title: Higher Cheeger Inequalities and Clustering Algorithms

Tutorials:
-------------------
Ke Yi (The Hong Kong University of Science and Technology)
Title: Random Sampling in Database Systems: Techniques and Applications

Kai-Min Chung (Academia Sinica, Taiwan)
Title: Toward Cryptography for Modern Parallel Architecture

MEETING FORMAT
----------------------------------------------------------------------
The meeting consists of two keynote talks, two tutorials, and parallel
contributed talks, of which possibly 8-10 will be accepted as long talks.
20-30 minutes will be given to each accepted talk. The two tutorials will
be scheduled in the afternoons of May 14 (Saturday) and 16 (Monday),
respectively. Other talks start around 9 a.m. on May 15 (Sunday) and end
around 5 p.m. on 16 (Monday). There will be a welcome reception in the
evening of May 14 and a conference dinner banquet in the evening of May 15.

COMMITTEES
----------------------------------------------------------------------
Conference Chair:
Der-Tsai Lee (Academia Sinica, National Taiwan University)

Program Committee:
Hee-Kap Ahn (Pohang University of Science and Technology)
Leizhen Cai (The Chinese University of Hong Kong)
Mao-Cheng Cai (Institute of Systems Science)
Siu-Wing Cheng (The Hong Kong University of Science and Technology, Chair)
Otfried Cheong (Korea Advanced Institute of Science and Technology)
Francis Chin (The University of Hong Kong)
Kyung-Yong Chwa (Korea Advanced Institute of Science and Technology)
Xiaotie Deng (Shanghai Jiao Tong University)
Wen-Lian Hsu (Academia Sinica, co-Chair)
Xiaodong Hu (Chinese Academy of Sciences)
Kazuo Iwama (Kyoto University)
Sung Kwon Kim (Chung-Ang University)
Der-Tsai Lee (Academia Sinica, National Taiwan University)
Chung-Shou Liao (National Tsing Hua University, co-Chair)
Zhiyong Liu (Institute of Computing Technology)
Chi-Jen Lu (Academia Sinica)
Kazuhisa Makino (The University of Tokyo)
Kunsoo Park (Seoul National University)
Kunihiko Sadakane (The University of Tokyo)
Chuan-Yi Tang (Providence University, co-Chair)
Takeshi Tokuyama (Tohoku University)
Osamu Watanabe (Tokyo Institute of Technology)
Frances Yao (City University of Hong Kong)
Guochuan Zhang (Zhejiang University)
Hong Zhu (Fudan University)

Contact:
Chung-Shou Liao (National Tsing Hua University)

Additional (travel and accommodation) information can be found on the
conference webpage:
http://aaac2016.ie.nthu.edu.tw/

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

Message: 5
Date: Thu, 21 Jan 2016 16:39:57 +0000
From: Andrei Krokhin <andrei.krokhin@durham.ac.uk>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Lectureship in Computer Science at Durham U., UK
Message-ID: <mailman.3.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="utf-8"; format=flowed

The School of Engineering and Computing Sciences at Durham University,
UK, invites applications for a Lectureship in Computer Science.
The School has a strong Algorithms and Complexity research group
(http://community.dur.ac.uk/algorithms.complexity/).

The academic position of Lecturer in the UK is equivalent to Assistant
Professor in the US.

For more information, see the official advert with application link
below (the application deadline is February 19th, 2016):
http://www.jobs.ac.uk/job/AMU711/lecturer-in-computer-science/

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

Message: 6
Date: Thu, 21 Jan 2016 09:20:35 -0500
From: Mark Daniel Ward <mdw@purdue.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms
Message-ID: <mailman.4.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=utf-8; format=flowed

Dear Colleagues,

The CFP for the 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms is
available. The conference takes place July 4-8, 2016, in Krakow, Poland.

The conference website is here: http://www.aofa2016.meetings.pl/

It aims at studying discrete objects that appear as data structures or
algorithms (including graphs, networks etc.) by mathematical methods, in
particular by probabilistic, combinatorial and asymptotic methods.

Important dates:
Submission deadline: February 12, 2016.
Notification: April 22, 2016.
Final version: May 13, 2016.
Early registration: May 13, 2016.

Confirmed keynote speakers:
Jean Bertoin, Zurich Univ., Switzerland
Paweł Błasiak, Polish Academy of Sciences, Krakow, Poland
Hsien-Kuei Hwang, Academia Sinica, Taipeh, Taiwan
Bob Sedgewick, Princeton Univ., USA - FLAJOLET LECTURE
Wojtek Szpankowski, Purdue Univ., USA
Nick Wormald, Monash Univ., Australia

Scope. Analysis of algorithms is a scientific basis for computation,
providing a link between abstract algorithms and the performance
characteristics of their implementations in the real world. The general
effort to precisely predict the performance of algorithms has come to
involve research in analytic combinatorics, the analysis of random
discrete structures, asymptotic analysis, exact and limiting
distributions, and other fields of inquiry in computer science,
probability theory, and enumerative combinatorics. See:
http://aofa.cs.purdue.edu/

We invite papers in
• analytic algorithmics and combinatorics,
• probabilistic analysis of algorithms,
• randomized algorithms.

We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.

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

Message: 7
From: Leo Kroon <lkroon@rsm.nl>
To: "'dmanet@zpr.uni-koeln.de'" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] EURO28: Optimization in Public Transport
Message-ID: <mailman.5.1453460402.5172.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="iso-8859-1"

Second Call for Sessions and Papers within the Stream

===== Optimization in PUBLIC TRANSPORT =====

at the 28th EURO Conference
July 3-6, 2016 in Poznan, Poland

http://www.euro2016.poznan.pl/

Following the success of the Public Transport stream at the previous EURO conferences, EURO 2016 will again offer a stream "Optimization in Public Transport" organized by Leo Kroon and Anita Schöbel.

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

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

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

We are looking forward to a successful Public Transportation stream at EURO 2016 and to meeting you in Poznan!

Anita Schöbel
University of Göttingen
schoebel@math.uni-goettingen.de

Leo Kroon
NS Reizigers, and
Rotterdam School of Management
lkroon@rsm.nl

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 20
**************************************

Thursday, January 21, 2016

dmanet Digest, Vol 95, Issue 19

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. AUTOMATA 2016 Second Call for Papers (Turlough Neary)
2. announcement of ph d and postdoc positions (Francisco Santos)
3. PhD Studentships - University of Nottingham (Per Kristian Lehre)
4. AOC 2016: IEEE WoWMoM Workshop on Autonomic and Opportunistic
Communications (Antonino Masaracchia)
5. Faculty and post-doc positions, ITCS@SUFE (Shanghai, China)
(Pinyan Lu)

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

Message: 1
Date: Wed, 20 Jan 2016 10:09:55 +0100
From: Turlough Neary <tneary@ini.phys.ethz.ch>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] AUTOMATA 2016 Second Call for Papers
Message-ID: <1453280995.3126.13.camel@ini.phys.ethz.ch>
Content-Type: text/plain; charset="UTF-8"

AUTOMATA 2016 Second Call for 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: February 13, 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: February 13, 2016
Notification of acceptance: March 20, 2016
Final versions: March 30, 2016
Submission deadline for exploratory papers: May 1, 2016
Notification of acceptance for exploratory papers: May 10, 2016
AUTOMATA 2016: June 15-17

Invited speakers

Klaus Sutner (Carnegie Mellon University, USA)
Guillaume Theyssier (CNRS and Aix Marseille Université, 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 and exploratory
papers. Full papers should report more complete and denser research,
while the later submission deadline for exploratory papers allows quick
reporting of recent discoveries, work-in-progress and/or partial
results. Submissions in the full paper category are refereed and
selected by the program committee. Papers in the exploratory category
go through a less rigorous evaluation process.

Submission

Authors are invited to submit extended abstracts of no more than 14
pages (for full papers) or 8 pages (for exploratory papers) via the
EasyChair system at

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

Submissions should contain original research that has not previously
been published. Concurrent submissions to other conferences/journals is
not permitted. Supplementary material that exceeds the above mentioned
page limits may be included as an appendix and will be considered at
the committee's discretion (note that appendices will not be published
in the proceedings). 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 and will follow a specific
evaluation process.

Proceedings

Accepted full papers will appear in the proceedings published by
Springer in the LNCS series and will be available at the conference.
Exploratory papers will not be included in the LNCS proceedings;
however, they will be printed locally and given to conference
participants.

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

Message: 2
Date: Wed, 20 Jan 2016 12:14:52 +0100
From: Francisco Santos <francisco.santos@unican.es>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] announcement of ph d and postdoc positions
Message-ID: <B0BC4625-E357-4EE5-9032-847FC267DA48@unican.es>
Content-Type: text/plain; charset="iso-8859-1"

Two PhD scholarships and one postdoc position in Geometric Combinatorics at FU Berlin, Francisco Santos

(Resent due to a mistake in the ending date of positions)

Applications are invited for two PH. D. scholarships and one postdoc position at the Freie
Universität Berlin. Successful candidates will be part of Francisco Santos' Einstein
Group, funded by the Einstein Foundation, and will benefit from the interaction
with FU's Discrete Geometry Group (http://www.mi.fu-berlin.de/en/math/groups/discgeom)
plus the thriving ambience of Berlin's Discrete Math landscape. Research topics include
the combinatorics of polytopes and simplicial and cell complexes, as well as enumerative
questions about lattice polytopes.

The positions are for the period April 2016 to March 2019 (up to three years). Although later
starting dates are possible, extensions are not. Interested candidates should apply by email to
Francisco Santos (francisco.santos@unican.es) with cc to elke.pose@fu-berlin.de, including
a CV, research statement, and one or two letters of recommendation, preferably by February 5.

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

Message: 3
Date: Wed, 20 Jan 2016 14:11:40 +0000
From: Per Kristian Lehre <PerKristian.Lehre@nottingham.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD Studentships - University of Nottingham
Message-ID: <87oacgbaqr.fsf@gamma.cs.nott.ac.uk>
Content-Type: text/plain; charset=iso-8859-1

PhD Studentships - Theoretical Analysis of Evolutionary Processes

Applications are invited for PhD studentships funded by the
School of Computer Science, University of Nottingham.
Studentships are available from October 2016 for a period of
three years and include a stipend of £14,057 per year and tuition
fees, and are available to students of any
nationality. Applicants are expected to have a first-class
Masters or Bachelors degree in Computer Science or related
discipline, and must obtain support from a potential
supervisor. I will support strong applicants interested in the
following topic.

Evolutionary algorithms and other randomised search heuristics
have been successfully applied to various industrial optimisation
domains. However, the theoretical understanding of these methods
has been limited. Recently, there has been significant progress
in analysing the runtime (also called optimisation time) of
randomised search heuristics using rigorous techniques from
probability theory and theoretical computer science including
analysis of randomised algorithm. Results about the runtime give
insights into how the behaviour of a randomised search heuristic
depends on its parameter-settings and on the characteristics of
the underlying optimisation problem.

The successful candidate(s) will contribute to this exciting
research area, which lies at the interface between probability
theory and theoretical computer science. The aim is to develop
theory that aids in predicting and controlling the behaviour of
evolutionary processes, both natural processes as well as
evolutionary algorithms.

The topic is mathematically challenging and requires an excellent
degree in mathematics or computer science. In particular, the
candidate should have a strong background in probability theory,
discrete mathematics, and/or theoretical computer science.

The research will be carried out in the context of the EU-funded
project Speed of Adaptation in Population Genetics and
Evolutionary Computation (SAGE) which brings together researchers
from population genetics and evolutionary computation. The
studentship is locally associated with the Automated Scheduling,
OptimisAtion and Planning (ASAP) research group, one of the
Research Groups within the School of Computer Science at
Nottingham.

For more information, please send me an email, or see

http://nottingham.ac.uk/jobs/currentvacancies/ref/SCI1498

---
Dr. Per Kristian Lehre
Assistant Professor in School of Computer Science
University of Nottingham
Nottingham NG8 1BB
United Kingdom

+44 (0)115 846 8376
PerKristian.Lehre@nottingham.ac.uk
http://www.cs.nott.ac.uk/~pkl
http://www.project-sage.eu
@pklehre on Twitter

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

Message: 4
Date: Wed, 20 Jan 2016 18:32:01 +0100
From: Antonino Masaracchia <aoc2016_publicity@iit.cnr.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] AOC 2016: IEEE WoWMoM Workshop on Autonomic and
Opportunistic Communications
Message-ID: <569fc491.iN+AdW8lc1njeI0l%aoc2016_publicity@iit.cnr.it>
Content-Type: text/plain; charset=us-ascii

Please accept our apologies if you receive multiple copies of this CFP.

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

CALL FOR PAPERS
Tenth IEEE WoWMoM Workshop on
Autonomic and Opportunistic Communications (AOC 2016)
June 21, 2016 - Coimbra, Portugal
http://cnd.iit.cnr.it/aoc2016

in conjunction with IEEE WoWMoM, 2016
http://wowmom2016.uc.pt/

**** Submission Deadline --- March 10, 2016 ****

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

SCOPE AND OVERVIEW

The recent proliferation of sensor-rich portable devices is enabling novel communication paradigms for users and contributing to the implementation of the ubiquitous computing and networking vision. Opportunistic networking represents a key communication paradigm for this vision. Either as a standalone communication mode or as a complement to infrastructure-based communication, opportunistic networking leverages the mobility of end users to enhance their ability to communicate in the absence of reliable end-to-end connectivity. Opportunistic networking opens up many possibilities but also poses countless new challenges. The goal of the AOC 2016 workshop is to serve as a forum for researchers, professionals, application developers, and other experts from both academia and industry to exchange new ideas, discuss new solutions, and share their experiences. As with previous editions, this year's workshop is particularly interested in novel research directions, such as service composition techniques, co-existence with infrastructure networks such solutions based on fog or edge computing, and insights from complex network analysis applied to autonomic and opportunistic communications.

The workshop will solicit original papers addressing theoretical and practical aspects of autonomic and opportunistic communications as well as papers describing prototype implementations and deployments.
Topics of interest for AOC 2016 include, but are not limited to:
- Techniques for data dissemination and replication
- Context and social awareness mechanisms and algorithms
- Autonomous and self-adaptive systems for smart cities
- Autonomous solutions for IoT and cyber-physical systems
- Solutions based on fog or edge computing
- Big data for autonomic and opportunistic systems
- Mobile social networking algorithms and applications
- Co-existence of opportunistic networks with infrastructure mobile wireless networks
- Mobility models and statistical analysis of mobility traces
- Service composition in autonomic and opportunistic networks
- Cognition-driven information processing and decision making
- Performance modelling, scaling laws, and fundamental limits for autonomic and opportunistic communications
- Participatory and urban sensing in autonomic and opportunistic networks
- Game-theoretic insights to the operation of autonomic and opportunistic networks
- Trust, security, and reputation
- Autonomic and opportunistic communication testbeds and prototypes, measurement data from real experiments
- Socio-economic models for autonomic and opportunistic communications
- SNA and graph modeling for autonomic and opportunistic networks
- Autonomic and opportunistic solutions for mobile cloud applications
- Applications and middleware support
- Routing, transport, and reliability issues

PAPER SUBMISSION AND PUBLICATION
--------------------------------

Submission will be managed electronically through EDAS (https://edas.info/newPaper.php?c=21826).

Papers should neither have been published elsewhere nor being currently under review by another conference or journal. Manuscripts are limited to 6 pages, single spacing, double column, and must strictly adhere to the template format.
Accepted papers will appear in the symposium proceedings published by IEEE. There will be no separate workshop registration, as one single registration will cover both conference and workshops participation. At least one author of each accepted paper must register to the workshop and present his/her work.

IMPORTANT DATES
---------------
Full papers due: March 10, 2016
Notification: April 15, 2016
Camera-ready: April 29, 2016
Workshop: June 21, 2016

ORGANISING COMMITTEE
--------------------

Workshop Co-Chairs
Michela Papandrea, SUPSI, Switzerland
Matteo Zignani, University of Milan, Italy
Valerio Arnaboldi, IIT, CNR, Italy

Publicity Chair
Antonino Masaracchia, IIT, CNR, Italy

For further information, please contact the workshop chairs at aoc2016 at iit.cnr.it

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

Message: 5
Date: Wed, 20 Jan 2016 12:30:01 -0800
From: Pinyan Lu <lupinyan@hotmail.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Faculty and post-doc positions, ITCS@SUFE (Shanghai,
China)
Message-ID: <mailman.2.1453374002.31986.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="utf-8"

The Institute for Theoretical Computer Science (ITCS) is a newly established academic unit at Shanghai University of Finance and Economics (SUFE), aimed at creating a world-class environment for research in broad areas of theoretical computer science. Shanghai University of Finance and Economics is a top-ranked research university specializing in economics, finance and business studies. In recent years, SUFE has been earnestly developing fundamental and closely related disciplines besides finance and economics, among which computer science is at the top of its list. ITCS is one of the key priorities of this high-level mission.
We invite applications from highly-qualified candidates for various position levels in broad areas of theoretical computer science including (but not limited to), Algorithms and Complexity, Algorithmic Game Theory, Machine Learning, Information Theory. Salary and compensation packages are attractive and competitive. Initial appointments are typically made for a six years fixed-term. Subsequent contract renewal, promotion and tenure follow standard international practices. Each year, the institute also offers two research fellowship positions. The appointment will be for two years with an annual salary of 300,000 RMB.
If you are interested in joining us, please send your CV to Pinyan Lu ( lu.pinyan@mail.shufe.edu.cn ).

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 19
**************************************

Wednesday, January 20, 2016

dmanet Digest, Vol 95, Issue 18

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. Postdoctoral research position, Ryerson University (Toronto,
Canada) (Pawel Pralat)
2. new doctoral training course in systems dynamics (Letchford, Adam)

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

Message: 1
Date: Tue, 19 Jan 2016 10:10:22 -0500
From: Pawel Pralat <pralat@ryerson.ca>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoctoral research position, Ryerson University
(Toronto, Canada)
Message-ID: <6921E0C4-2736-4270-92B1-B3C418434798@ryerson.ca>
Content-Type: text/plain; charset=utf-8

Applications are invited for one postdoctoral fellow in Graph Theory in the Department of Mathematics at Ryerson University (http://math.ryerson.ca/) to begin on September 1, 2016. The research will be led jointly by Drs. Anthony Bonato and Pawel Pralat. This position provides an opportunity to engage in research in Mathematics, with a limited amount of teaching, and is suited for talented mathematicians who have recently completed their Ph.D. The salary is competitive, with funding provided for a year and with potential for renewal for a second year.

The applicant should have a PhD in Mathematics or Computer Science. The ideal candidate would have expertise in one or more of the areas of complex networks (such as the web graph or on-line social networks), random graphs, or graph searching games (such as Cops and Robbers). The position is open to candidates of any nationality and selection will be based upon the candidate's research record and potential. As the applicant will normally teach, some teaching experience is preferred.

Applicants should provide a cover letter, curriculum vitae, and at least three letters of recommendation. At least one of these letters should report on the candidate's teaching abilities.

Applicants should apply no later than March 1, 2016, and the position will remain open until filled. Please note the position is advertised pending budgetary approval.

Application material and reference letters will be submitted by e-mail to pralat@ryerson.ca

Thank you,
— Pawel Pralat
--
http://www.math.ryerson.ca/~pralat/
Associate Chair for Research
Department of Mathematics
Ryerson University

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

Message: 2
Date: Tue, 19 Jan 2016 16:23:53 +0000
From: "Letchford, Adam" <a.n.letchford@lancaster.ac.uk>
To: "DECISION-ENGINEERING@JISCMAIL.AC.UK"
<DECISION-ENGINEERING@JISCMAIL.AC.UK>, "dmanet@zpr.uni-koeln.de"
<dmanet@zpr.uni-koeln.de>, "opt-net@zib.de" <opt-net@zib.de>,
"ORNET@JISCMAIL.AC.UK" <ORNET@JISCMAIL.AC.UK>,
"allstat@jiscmail.ac.uk" <allstat@JISCMAIL.AC.UK>
Subject: [DMANET] new doctoral training course in systems dynamics
Message-ID:
<06185FC256DE8543BD7F3AF9F51ACC34843B4767@EX-0-MB1.lancs.local>
Content-Type: text/plain; charset="us-ascii"

In 2016, NATCOR will be running a new course in Systems Dynamics, in addition to its courses on Heuristics,
Convex Optimisation and Predictive Analytics.

Although based in the UK, the courses are open to PhD students and post-docs from any country working
in a relevant area, such as Operational Research, Statistics, Industrial Engineering, Computer Science or
Quantitative Finance. For details, see the following web page:

http://www.natcor.ac.uk/courses.asp

Our courses are approved by the UK Research Councils and also by EURO (the European Association of
Operational Research Societies).

Professor Adam N. Letchford
NATCOR Director
Department of Management Science
Lancaster University
United Kingdom

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 18
**************************************

Tuesday, January 19, 2016

dmanet Digest, Vol 95, Issue 17

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. DEADLINE EXTENSION FOR ABSTRACTS - EngOpt 2016. Iguassu
Falls, Brazil - 5th Int. Conf. on Engineering Optimization
(Jose Herskovits)
2. SPAA 2016 - final call for papers (Nodari Sitchinava)
3. AAIM 2016 Call for Papers (Riccardo Dondi)
4. PhD positions at Edinburgh in Algorithms, Network Analysis,
Geometry and others (Rik Sarkar)
5. EURO: Call for the session on Kidney Exchange Programs
(Joao Pedro Pedroso)

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

Message: 1
Date: Mon, 18 Jan 2016 14:30:45 -0300
From: "Jose Herskovits" <jose@optimize.ufrj.br>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] DEADLINE EXTENSION FOR ABSTRACTS - EngOpt 2016.
Iguassu Falls, Brazil - 5th Int. Conf. on Engineering Optimization
Message-ID: <mailman.29.1453222609.2539.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=utf-8

Dear colleague,

Due to many requests received, the deadline for Abstract Submission has been extended
to 31st January 2016.

Please submit your abstract in our site: www.engopt.org

•31st January 2016 - Is the new deadline for the short abstract, to be included in the
proceedings
book of the conference (Up to 3200 characters including spaces, written in plain text,
without mathematical formulas).

•Notification for paper acceptance: 15 days after submission

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

"EngOpt 2016", the 5th International Conference on Engineering Optimization"

will take place at Iguassu Falls, Brazil, from 19th to 23rd June 2016.

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

______________________________________________________________________

UPDATED INFORMATION ABOUT ACOMODATIONS IS NOW AVAILABLE IN OUR SITE

EngOpt 2016 obtained special rates for the participants of the Conference
at Rafain Palace Hotel & Convention.These rates are for a limited number of rooms.

Since Iguassu Falls is a very important touristic destination, we advise participants to

make reservations as soon as possible.

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

About Rafain Palace Hotel & Convention Center:

Featuring tennis and soccer courts, 3 pools and a hot tub, Rafain Palace Hotel &
Convention Center is at 5 km from the Paraguayan border and 20 km
from Iguassu Falls. Itaipu Hydroelectric Plant is 7 km away, and parking is free.

With a rich selection of breads, hot dishes and fruits, buffet breakfast is served
daily at Itamuri Restaurant. À la carte dishes from Brazilian and international
cuisines are served throughout the day. American Bar and the pool bar serve drinks,
snacks and ice-creams.

Children can have fun at the playground or with the entertainment staff. Other hotel
amenities include a gym, sauna and gift shop.

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

About registration fees:

Participant Fees include: Conference proceedings, attendance at all scientific
sessions, coffee breaks, self-service buffet lunch the four days of the conference,
welcome reception and banquet.

Full time Student Fees include: Conference proceedings, attendance at all scientific
sessions, coffee breaks, self-service buffet lunch the four days of the conference and
welcome reception

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

EngOpt: A forum for Engineers, Mathematicians and Computer Scientists to share
research and innovations, promoting interdisciplinary activities in all
fields of Engineering Optimization.
_______________________________________________________________________

Engopt 2016 is organized by:

Federal University of Rio de Janeiro

________________________________________________________________________

As in previous editions, EngOpt is endorsed by:

EUROPT - EURO Working Group on Continuous Optimization

ISSMO - International Society for Structural and Multidisciplinary
Optimization

IFORS - International Federation of Operational Research Societies

MOS - Mathematical Optimization Society

________________________________________________________________________

Please visit our website: www.engopt.org and make yor Fast Pre-registration.

_________________________________________________________________________

With my best wishes,

Jose Herskovits
COPPE/Federal University of Rio de Janeiro
engopt@optimize.ufrj.br

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

Message: 2
Date: Mon, 18 Jan 2016 14:03:38 -1000
From: Nodari Sitchinava <nodari@hawaii.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SPAA 2016 - final call for papers
Message-ID: <569D7D5A.2040909@hawaii.edu>
Content-Type: text/plain; charset=utf-8; format=flowed

======================================================
SPAA 2016 Call for Papers
======================================================

28th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2016)
July 11-13, 2016
Asilomar State Beach, California, USA
http://spaa.acm.org

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

Important Dates:

Submission deadlines:
- Regular papers: February 5, 11:59pm HAST
- Brief announcements: February 26, 11:59pm HAST

Rebuttal period: March 22-25
Notification: April 11

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

Submissions are sought in all areas of parallel algorithms and
architectures, broadly construed, including both theoretical and
experimental perspectives. Topics of interest include, but are not
limited to:

- Parallel and Distributed Algorithms
- Parallel and Distributed Data Structures
- Parallel Complexity Theory
- Scheduling in Parallel Systems
- Specification and Verification of Concurrent Systems
- Parallel and Distributed Architectures
- Multiprocessor and Multicore Architectures
- Transactional Memory Hardware and Software
- Instruction Level Parallelism and VLSI
- Compilers and Tools for Concurrent Programming
- Algorithms for GPUs and Other Alternative Parallel Architectures
- High-Performance Parallel Computing and Architectures
- Green & Power-Efficient Algorithms and Architectures
- Algorithms for Social Networks
- Biological Distributed Algorithms
- Network Algorithms
- Algorithms for Routing and Information Dissemination
- Peer-to-Peer Systems
- Mobile, Ad-Hoc, Wireless and Sensor Networks
- Fault-tolerance and Reliability
- Self-stabilization and Self-organization
- Security and Privacy in Distributed and Parallel Systems
- Parallel/Distributed Computational Learning
- Game Theory and Collaborative Learning
- Parallel/Distributed issues in Big Data
- Resource Management and Awareness

Regular papers:

Regular papers should report on original research, submitted exclusively
to this conference. Submissions may not exceed ten (10) single-spaced
double-column pages. (Papers will be judged based on their quality and
not their length---short papers are welcome.) The title page,
bibliography and designated figure pages (containing only figures) are
not counted toward the ten pages. (Illustrative figures are encouraged.)
All necessary details to substantiate the main claims of the paper
should be included in a clearly marked appendix. Regular papers will be
allotted up to 10 pages in the proceedings.

Brief announcements:

SPAA also solicits brief announcements that raise issues of interest to
the SPAA community. Brief announcements may not exceed two pages.
Examples of good brief announcements include: (i) papers previously
published elsewhere of interest to SPAA, (ii) work in progress, (iii)
announcement of tools/libraries, (iv) challenge problems posed to the
community, (v) corrections to earlier results. Brief announcements may
also include smaller results of interest.

Authors may request that a regular paper be considered as a brief
announcement. As far as possible, the program committee will remain
blind to this request until status as a regular paper has been resolved.
Such a request will not affect the chances of the manuscript to be
accepted as a regular paper.

Submission details:

Papers should be submitted in standard ACM format, i.e., 9-point font on
8.5x11 inch pages. For detailed submission instructions and formatting,
please see http://spaa.acm.org.

Awards:

Every regular paper is eligible for the best paper award.

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

Program Committee:

Dan Alistarh (Microsoft Research)
Yossi Azar (Tel Aviv Univ.)
Michael Bender (Stony Brook Univ.)
Costas Busch (Louisiana State Univ.)
Yuval Emek (Technion)
Antonio Fernández Anta (IMDEA)
Jeremy Fineman (Georgetown Univ.)
Phil Gibbons (CMU)
Seth Gilbert (NUS)
Magnús M. Halldórsson (Reykjavík University)
Stephan Holzer (MIT)
Fabian Kuhn (Univ. of Freiburg)
Yossi Lev (Oracle)
Ishai Menache (Microsoft Research)
Ben Mosely (Wash. Univ. in St. Louis)
Calvin Newport (Georgetown Univ.)
Merav Parter (MIT)
Boaz Patt-Shamir (Tel Aviv Univ.)
Seth Pettie (Univ. of Michigan)
Cynthia Phillips (Sandia Natl. Lab.)
Kirk Pruhs (Univ. of Pittsburgh)
Peter Robinson (Queen's Univ. Belfast)
Thomas Sauerwald (Cambridge)
Stefan Schmid (Aalborg Univ.)
Michael Scott (Univ. of Rochester)
Julian Shun (UC Berkeley)
Aravind Srinivasan (Univ. of Maryland)
Maxwell Young (Mississippi State Univ.)

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

Conference Committee:

Program Chair: Seth Gilbert (NUS)
General Chair: Christian Scheideler (Univ. of Paderborn)
Local Arrangements: Bradley Kuszmaul (MIT)
Treasurer: David Bunde (Knox College)
Publicity Chair: Nodari Sitchinava (Univ. of Hawaii, Manoa)
Secretary: Jeremy Fineman (Georgetown Univ.)

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

Message: 3
Date: Tue, 19 Jan 2016 10:53:07 +0100
From: Riccardo Dondi <riccardo.dondi@unibg.it>
To: undisclosed-recipients:;
Subject: [DMANET] AAIM 2016 Call for Papers
Message-ID:
<CAJMEsUBcK4fxvEhboZ_Zxfr7QsyO6G2xZSTgFaz5Y=0hi_9pBA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

------------------------------------------------------
AAIM 2016 Call for Papers
------------------------------------------------------

AAIM 2016 Conference July 18-20, 2016
Bergamo University, Bergamo, Italy
http://aaim2016.wordpress.com/

The Eleventh International Conference on Algorithmic Aspects of
Information and Management will be hosted by University of Bergamo.
The conference will provide a forum on current trends of research on
algorithms, data structures, operation research, combinatorial
optimization and their applications.
AAIM will bring together international experts at the research
frontiers in these areas to exchange ideas and to present significant
new results.
Interesting new results in all areas of algorithm design, operation
research and combinatorial optimization and their applications are
welcome. Both theoretical and experimental/applied works of general
algorithmic interest are sought. Special considerations will be given
to algorithmic research that is motivated by real-world applications.
Experimental and applied papers are expected to show convincingly the
usefulness and efficiency of the target algorithms in practical
settings.

Typical, but not exclusive, topics of interest include:

Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical
applications;
Biomedical imaging algorithms;
Combinatorial optimization;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.

Important Dates:

Submission Deadline: February 19, 2016 (anywhere on Earth)
Author Notification: April 7, 2016
Final Manuscript Due: April 22, 2016
Conference: July 18-20, 2016

Submissions:
The submission deadline is February 19, 2016 (anywhere on Earth). AAIM
2016 will only accept electronic (PS or PDF) submissions via
easychair:
https://easychair.org/conferences/?conf=aaim2016

E-mails will be sent to the authors to confirm the receipt of their
submissions within 24 hours. For any problem or question on
submissions, please send e-mails to aaim2016@easychair.org

Only previously unpublished new results will be considered for
publication. Papers that have already been published or simultaneously
submitted at another journal or conference (with published
proceedings) will not be considered.

A submission should start with the title of the paper, each author's
name, affiliation, and e-mail address, and a one-paragraph summary of
the results. This should be followed by a scholarly exposition of the
ideas, techniques, and a full description of the results achieved. A
clear indication of the motivation and comparison with prior or
related work should be presented. The paper should not exceed 12
pages, including bibliography, formatted for letter-size paper using
11 point or larger font, with at least one inch margins around.
Additional details can be included in a clearly marked appendix, to be
consulted at the discretion of program committee members. The appendix
is not included in the page limit, and will not be published in the
conference proceedings.

Submissions that deviate significantly from these guidelines or are
unprintable risk rejection without consideration of their merit.

At least one author of an accepted paper is expected to present the
paper at the conference as a registered participant.

The Proceedings of the Conference will be published by Springer in the
Lecture Notes in Computer Science (LNCS) series, and will be available
for distribution at the conference.

Special Issues:
Selected high quality papers will be invited to a special issue of
Theoretical Computer Science. The invited papers will go through the
normal reviewing process.

Invited Speakers:

Roberto Grossi, Università di Pisa
Stéphane Vialette, Université Paris-Est Marne-la-Vallée

Program Committee

Francine Blanchet-Sadri (University of North Carolina)
Laurent Bulteau (University of Paris-Est Marne-la-Vallée)
Cedric Chauve (Simon Fraser University)
Zhi-Zhong Chen (Tokyo Denki University)
Marek Chrobak (University of California, Riverside)
Ferdinando Cicalese (University of Verona)
Pierluigi Crescenzi (Università degli Studi di Firenze)
Peter Damaschke (Chalmers University of Technology)
Bhaskar Dasgupta (University of Illinois at Chicago)
Riccardo Dondi (Università degli Studi di Bergamo) co-chair
Nadia El-Mabrouk (University of Montreal)
Michael R. Fellows (Charles Darwin University)
Guillaume Fertin (University of Nantes) co-chair
Irene Finocchi (University of Rome "La Sapienza")
Pawel Gorecki (University of Warsaw)
Inge Li Gørtz (Technical University of Denmark)
Frederic Havet (INRIA, Sophia-Antipolis)
Danny Hermelin (Ben-Gurion University of the Negev)
Jesper Jansson (Kyoto University)
Minghui Jiang (Utah State University)
Christian Komusiewicz (TU Berlin)
Moshe Lewenstein (Bar Ilan University)
Giancarlo Mauri (University of Milano-Bicocca) co-chair
Martin Milanic (University of Primorska)
Rolf Niedermeier (TU Berlin)
Daniel Paulusma (Durham University)
David Peleg (The Weizmann Institute)
Marcin Pilipczuk (University of Warsaw)
Romeo Rizzi (University of Verona)
Marie-France Sagot (INRIA Grenoble Rhône-Alpes and Université de Lyon 1)
Saket Saurabh (The Institute of Mathematical Sciences, Chennai)
Marinella Sciortino (University of Palermo)
Florian Sikora (University of Paris-Dauphine)
Ioan Todinca (Université d'Orléans)
Leo van Iersel (Delft University of Technology)
Rossano Venturini (Università di Pisa)
Lusheng Wang (City University of Hong Kong)
Binhai Zhu (Montana State University)

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

Message: 4
Date: Tue, 19 Jan 2016 14:16:27 +0000
From: Rik Sarkar <rsarkar@inf.ed.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD positions at Edinburgh in Algorithms, Network
Analysis, Geometry and others
Message-ID: <4C21AAC6-225A-482C-8816-6BFEEACAACEE@inf.ed.ac.uk>
Content-Type: text/plain; charset=us-ascii

Ph.D. positions are available at the University of Edinburgh. Students interested in one or more of the following topics:

* Analysis of large networks, such as social networks, road networks, computer networks and related data
* algorithms
* geometry, topology and geospatial information processing
* distributed computing
* sensor networks and mobile computing

are invited to apply. Contact: rsarkar@inf.ed.ac.uk

More information at http://homepages.inf.ed.ac.uk/rsarkar/positions.html.

Most positions are for EU students; *Deadline Jan 29*. Overseas students can be considered in some circumstances.

Rik Sarkar

Lecturer (Assistant Professor) and
Chancellor's Fellow
School of Informatics
The University of Edinburgh
10 Crichton street, IF 3.45
Edinburgh EH8 9AB
Ph: +44 (0) 131 650 4444
rsarkar@inf.ed.ac.uk
http://homepages.inf.ed.ac.uk/rsarkar/

The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

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

Message: 5
Date: Tue, 19 Jan 2016 14:20:19 +0000 (WET)
From: Joao Pedro Pedroso <jpp@fc.up.pt>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] EURO: Call for the session on Kidney Exchange
Programs
Message-ID: <20160119.142019.1908591498924713647.jpp@fc.up.pt>
Content-Type: Text/Plain; charset=iso-8859-1

Dear colleagues,

We are kindly inviting you to submit an abstract to session on Kidney
Exchange Programs, in the stream Healthcare Logistics, at the 28th
European Conference on Operational Research (EURO XXVIII), Poznan
University of Technology, Poznan, Poland, July 3-6, 2016,
http://www.euro2016.poznan.pl/

Within this session we seek contributions to cover recent advances
related to kidney exchange problems, on the following topics among
others:

- Optimization models and software;
- International issues;
- Market design and game theoretic models;
- Data intelligence and machine learning tools.

**********************************************************************
In order to submit an abstract, please go to
https://www.euro-online.org/conf/euro28
and use the session code: dc6b4a14
**********************************************************************

Abstracts: max. 1500 characters; submission deadline: March 1, 2016.

Kind regards,

Ana Viana (INESC TEC and Polytechnic of Porto) - aviana [@] inescporto.pt
João Pedro Pedroso (University of Porto) - jpp [@] fc.up.pt
(Session organizers)

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 17
**************************************

dmanet Digest, Vol 95, Issue 16

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. Call for Papers: ParLearning 2016 in conjunction with IPDPS
2016 (Arindam Pal)
2. Matheuristics in 2016 (Vittorio Maniezzo)
3. announcement of ph d and postdoc positions (Francisco Santos)

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

Message: 1
Date: Mon, 18 Jan 2016 12:25:26 +0530
From: Arindam Pal <arindamp@gmail.com>
To: DMANET <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Call for Papers: ParLearning 2016 in conjunction
with IPDPS 2016
Message-ID: <mailman.2.1453201201.20676.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=UTF-8

Dear All,

The paper submission deadline for ParLearning 2016 deadline has been
extended to January 22, 2016 AoE. For more details, please look at the
website,

http://parlearning.ecs.fullerton.edu/

Please submit your papers and encourage your colleagues to submit papers.

Regards,
Dr. Arindam Pal
Research Scientist
Innovation Labs Kolkata
TCS Research
http://www.cse.iitd.ac.in/~arindamp/

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

Message: 2
Date: Mon, 18 Jan 2016 09:00:37 +0000
From: Vittorio Maniezzo <vittorio.maniezzo@unibo.it>
To: " dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Matheuristics in 2016
Message-ID: <mailman.3.1453201201.20676.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="utf-8"

This message is to call attention to main events related to matheuristcs in 2016.

- matheuristics international conference
http://iridia.ulb.ac.be/matheuristics2016/
Matheuristics 2016, Sixth International Workshop
September 4-7, 2016, Brussels, Belgium
Deadline for submissions: April 15, 2016

- matheuristics strem at EURO 2016
http://www.euro2016.poznan.pl/
So far two sessions (please, propose other if you feel like)
MIP Based Matheuristics code 770ef760
Other Matheuristics code f7e408bf
Submission deadline: 22nd February 2016.

Hope to meet you there,
Vittorio Maniezzo

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

Message: 3
Date: Mon, 18 Jan 2016 10:32:45 +0100
From: Francisco Santos <francisco.santos@unican.es>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] announcement of ph d and postdoc positions
Message-ID: <F9997841-572F-476F-95EE-36ED272C4103@unican.es>
Content-Type: text/plain; charset="iso-8859-1"

Two PhD scholarships and one postdoc position in Geometric Combinatorics at FU Berlin, Francisco Santos

The positions are for the period April 2016 to March 2018 (up to three years). Although later
starting dates are possible, extensions are not. Interested candidates should apply by email to
Francisco Santos (francisco.santos@unican.es) with cc to elke.pose@fu-berlin.de, including
a CV, research statement, and one or two letters of recommendation, preferably by February 5.

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 16
**************************************

Monday, January 18, 2016

dmanet Digest, Vol 95, Issue 15

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. CFP: COCOON16: International Computing and Combinatorics
Conference 2016 (AI, CHUNYU)
2. Two PhD studentships in Optimization (Strathclyde Business
School, UK) (Kerem Akartunali)
3. ECCO 2016 conference (Tamás Kis)
4. Winter School in Network Optimization - From 5th (2016) to
6th Edition (2017) (Luis Eduardo Neves Gouveia)
5. Assistant Professor Position in Data Analytics (Muller R (KE))

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

Message: 1
Date: Fri, 15 Jan 2016 19:15:17 +0000
From: "AI, CHUNYU" <AIC@uscupstate.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFP: COCOON16: International Computing and
Combinatorics Conference 2016
Message-ID: <D2BEAF71.D16F%aic@uscupstate.edu>
Content-Type: text/plain; charset="us-ascii"

=========================================
COCOON'16: The 22nd International Computing and Combinatorics Conference
August 2-4th, 2016, Ho Chi Minh city, Vietnam.
Submission deadline: Feb. 21, 2016
Web: http://optnetsci.cise.ufl.edu/cocoon16/index.html
=========================================

The 22nd International Computing and Combinatorics Conference (COCOON'16) will be held in Ho Chi Minh city, Vietnam during Aug. 2-4, 2016. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
All the papers will be published to the symposium in Springer-Verlag's Lecture Notes.
Papers of high quality will be invited to special issues of Theoretical Computer Science (TCS), and Journal of Combinatorial Optimization (JOCO), respectively.

THE TOPICS Of INTEREST (include but are not limited to):
Algorithms and Data Structures
Algorithmic Game Theory
Approximation Algorithms and Online Algorithms
Automata, Languages, Logic, and Computability
Complexity Theory
Computational Learning Theory and Knowledge Discovery
Cryptography, Reliability and Security, and Database Theory
Computational Biology and Bioinformatics
Computational Algebra, Geometry, and Number Theory
Graph Drawing and Information Visualization
Graph Theory, Communication Networks, and Optimization
Parallel and Distributed Computing

IMPORTANT DATES:
Paper submission due: Feb. 21, 2016 (Anywhere on Earth)
Notification of Acceptance: Apr. 18, 2015
Camera-ready and Registration: May 01, 2016
Conference Dates: Aug. 2-4, 2016

PC Co-Chairs
My T. Thai, University of Florida
Thang N. Dinh, Virginia Commonwealth University

-
Thang N. Dinh, Assistant professor,
Comp. Sci. Dept., Virginia Commonwealth Univ.
Richmond, VA 23284
Web: http://www.people.vcu.edu/~tndinh/

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

Message: 2
Date: Sun, 17 Jan 2016 09:22:59 +0000
From: Kerem Akartunali <kerem.akartunali@strath.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Two PhD studentships in Optimization (Strathclyde
Business School, UK)
Message-ID: <mailman.114.1453126929.2355.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="Windows-1252"

Two PhD studentshsips are 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 (currently higher than £14,000 per year). Both studentships are open to candidates from any nationality (UK/EU/international), and the project topics are:

1) Data Mining in Social Networks
2) Node Deletion and Edge Deletion Problems in Networks

More details about the projects, funding, expected skills and how to apply are provided below.

ABOUT THE PROJECTS

1) Data Mining in Social Networks: Social data from networks such as Twitter and Facebook can be represented as networks. Similarly, various data about city living obtained through City Observatory housed in the Technology & Innovation Centre (TIC) Future Cities theme can be represented in a similar structure, using individuals as nodes of such a network and their connections as edges of the network. The proposed project will design efficient algorithms to mine opinions and sentiments in such networks, in particular in real-time and when big data is present. The problem of sentiment and opinion analysis involves studying the negative and positive expressions opined in social media on a specific subject matter. We will work on such algorithms that volume and velocity of data accumulated in the context of social media is the most crucial design factor. This will also exploit some of the theoretical insights gained in an ongoing cross-faculty PhD project with Department of Mathematics & Statistics. The project aims to establish both theoretical and computational analysis, using various tools and techniques such as network optimization, design of algorithms and integer programming. As part of the computational work, we plan to use ARCHIE-WeSt, the high performance computing centre housed at University of Strathclyde.

2) Node Deletion and Edge Deletion Problems in Networks: In this project, we plan to develop efficient algorithms to study the node and edge deletion problems on networks. These problems stem from various important applications in energy networks (e.g., how to build a network that can survive failures on particular power lines), epidemic containment (e.g., how to ensure disconnectivity between various populations) and defense operations (e.g., where to focus attacks on enemy to ensure faster victory). The problem involves in effectively identifying a subset of nodes or edges of a network, which on deletion results in a subgraph with desirable properties. Some of the properties of interest include the connectivity in the graph, a restrictive size of the largest component, and denseness of the components formed. As part of the research, we plan to establish theoretical and empirical analysis for two specific network types. The theoretical work might include methods such as complexity analysis, analysis of the hardness of approximation and developing approximation algorithms and polyhedral analysis for the problems. The experimental work might involve designing and implementing exact computational integer programs and efficient heuristics that would be built upon the theoretical foundation.

FUNDING AND ELIGIBILITY

Funding is available to cover 3 years of tuition fees for a UK/EU/international student, plus a tax free stipend higher than £14,000 per year. The student will be given opportunities to attend a conference and/or specialized training every year.

These PhD projects require a highly numerate graduate with skills and interests in computational science. 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 (in particular integer programming) 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 May, 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, a research proposal detailing their 3-year plan, 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 for their intent for studentship application.

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 Ashwin Arulselvan (ashwin.arulselvan@strath.ac.uk).

Enquiries regarding applications to: Ms Alison Kerr (alison.kerr@strath.ac.uk)

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

Message: 3
Date: Sun, 17 Jan 2016 14:46:59 +0100
From: Tamás Kis <kis.tamas@sztaki.mta.hu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ECCO 2016 conference
Message-ID: <569B9B53.2040201@sztaki.mta.hu>
Content-Type: text/plain; charset=iso-8859-2; format=flowed

EURO Working Group on Combinatorial Optimization

CALL FOR PAPERS
The 29th Conference of the European Chapter on Combinatorial Optimization
ECCO XXIX 2016
http://ecco2016.euro-online.org/
May 26-28, 2016.

Eötvös Loránd University, Budapest, Hungary

PAPER SUBMISSION DEADLINE: March 1st, 2016.
PAPER SUBMISSION IS OPEN!

The 29th Conference of the European Chapter on Combinatorial Optimization will be jointly organized by the Institute of Computer Science and Control of the Hungarian Academy of Sciences, and the Eötvös Loránd University in Budapest, Hungary on May 26 - 28, 2016. ECCO (European Chapter on Combinatorial Optimization) is a working group of EURO (Association of European Operational Research Societies) that provides an excellent opportunity to discuss recent and important issues in Combinatorial Optimization and its applications.

The ECCO annual meetings aim to bring together researchers in the field of Combinatorial Optimization to present their work, share experiences, and discuss recent advances in theory and applications. The primary objectives are:
*exchanging results and experiences in solving real-world combinatorial optimization problems
*reporting on development and implementation of appropriate models and efficient solution methods for combinatorial optimization problems
*establishing networking contacts between individuals and research groups working on related topics
*promoting the work on combinatorial optimization (theory and applications) to the broader scientific community
*identifying challenging research problems for the field, as well as promising research outlets (both in theory and applications)
*promoting interactions with researchers in other related fields

We seek submissions in all areas of combinatorial optimization from theory through applications.

The submission is limited to a half to one page abstract.

Confirmed Plenary Speakers

András Frank, Eötvös University, Hungary.
David Pisinger, Technical University of Denmark.
Leo Liberti, CNRS LIX, École Polytechnique, France.
Andrej Brodnik, University of Ljubljana, Slovenia.

Program committee

Jacek Blazewicz, Polish Academy of Sciences Poznán, Poland.
Van-Dat Cung, Grenoble INP, France.
János Csirik, University of Szeged, Hungary,
Gábor Galambos, University of Szeged, Hungary.
Alain Hertz, École Polytechnique Montréal, Canada.
Tibor Jordán, Eötvös Loránd University, Hungary.
Tamás Kis, Institute for Computer Science and Control, Hungary (Chairperson).
Silvano Martello, University of Bologna, Italy.
Paolo Toth, University of Bologna, Italy.

Important Dates

December 1st, 2015: abstract submission starts
March 1st, 2016: deadline for abstract submission
March 17th, 2016: notification of acceptance
April 1st, 2016: deadline for early registration
May 26th-28th, 2016: ECCO XXIX 2016 Conference in Budapest

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

Message: 4
Date: Sun, 17 Jan 2016 18:39:14 +0000
From: Luis Eduardo Neves Gouveia <legouveia@fc.ul.pt>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Winter School in Network Optimization - From 5th
(2016) to 6th Edition (2017)
Message-ID: <1453055954105.4314@fc.ul.pt>
Content-Type: text/plain; charset="iso-8859-1"

The 5th edition of the Winter School on Network Optimization (see http://NetOpt2016.fc.ul.pt<http://netopt2016.fc.ul.pt/>) took place in the Hotel Sana, Estoril, from the 11th to the 15th of January 2016. The school had 41 students of several nationalities and coming from different Universities, Laboratories and Institutes, 2 from Austria, 5 from Belgium, 1 from Canada, 4 from Denmark, 4 from France, 8 from Germany, 9 from Italy, 1 from Mexico, 1 from Norway, 2 from Portugal, 1 from Spain, 2 from The Netherlands and 1 from Turkey.
Five courses were given by well known researchers of the area: Tolga Bektas (Univ of Southampton), Elena Fernandez (UPC), Martine Labbé (ULB), Karen Aardal (Delft Univ.) and Ivana Ljubic (ESSEC).

We have the pleasure to announce that the 6th Winter School on Network Optimization is scheduled for January 2017.
The first formal announcement will be made in June/July of 2016.
Available information, including list of speakers and dates is given below

6th Edition of Winter School on Network Optimization (netopt2017)

The 6th edition of the Winter School on Network Optimization will take place at the Hotel Sana, Estoril, from the 16th to the 20th of January 2017. Its main objective is to provide an opportunity for PhD students to get together and attend high level courses in the field of Network Optimization. Non-PhD students are welcome to attend the school, but the number of participants is limited and priority will be given to PhD students. In this edition of the school, the lecturers and subjects to be addressed are:

Angel Corberan (Univ. Valencia): Arc routing problems with profits
Arie Koster (RWTH Aachen Univ.): Robust optimization for network design and energy supply problems
Gerhard Reinelt (Univ. Heidelberg): Ordering problems
Giovanni Rinaldi (IASI): Maximum weight cuts in graphs and extensions
Jose Valerio de Carvalho (Univ. Minho): Dual feasible functions to construct fast lower bounds

Since the first edition in 2009, the school has been part of the activities of the CIO (Centro de Investigação Operacional) University of Lisbon as well as of the ENOG (European Network Optimization Group).
CIO has been merged with the Centro de Matemática e Aplicações Fundamentais (CMAF). Since the 5th edition the event is part of the activities of the new CMAFCIO and is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).

Webpage and Information about how to apply will be given in June 2016 (http://NetOpt2017.fc.ul.pt<http://netopt2016.fc.ul.pt/> )

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

Message: 5
Date: Sun, 17 Jan 2016 21:26:56 +0000
From: "Muller R (KE)" <r.muller@maastrichtuniversity.nl>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Assistant Professor Position in Data Analytics
Message-ID: <77c1b8a26d5f496ea7703bee43e30b61@UM-MAIL3218.unimaas.nl>
Content-Type: text/plain; charset="iso-8859-1"

(Tenure track) Assistant Professor Position in Data Analytics
The Department Quantitative Economics of Maastricht University School of Business and Economics (SBE) and the Business Intelligence and Smart Services Institute offer a tenure track assistant professorship in Data Analytics.
The newly established Business Intelligence and Smart Services Institute (www.biss-institute.nl<http://www.biss-institute.nl>) is a joint initiative by Maastricht University, Open University, and University of Applied Sciences Zuyd. At the institute, an interdisciplinary research team will perform applied and fundamental research on technological, business and societal aspects of data driven smart services. It will also host educational labs in which students from all three universities work on applied projects on business intelligence and big data in a diversity of functional areas such as Finance, Accounting, Marketing, Health Care and Smart Cities.
The BISS institute is located at the Smart Services Campus (SSC) in Heerlen. The campus is an eco-system in which large enterprises (e.g. APG, Accenture, Conclusion) and SMEs collaborate with researchers and students on technological, business and social innovation.
The assistant professor data analytics will be a member of the BISS institute (4 days/week) and affiliated to the department of Quantitative Economics at Maastricht University (1 day/week). He/she will be working in a cooperative environment where researchers from related fields, e.g. from econometrics, statistics, data mining, operations research, machine learning and computer science will have an opportunity to cooperate with each other.
The data analyst will have a set of tasks related to research, education, and business development. Scientific research in high-dimensional statistics or econometrics for big data, predictive and prescriptive analytics will be some of the main tasks for this position. Experts in the following research areas are especially encouraged to apply:
· Econometric and statistical methods for high-dimensional data sets; preferably with a focus on methodology or theory;
· Intersection of machine learning and statistics/econometrics;
· Intersection of data mining, artificial intelligence and statistics.
The BISS institute is also involved in educational activities in data analytics, business informatics, and business development. Therefore, we ask for experience in teaching related to data analytics in the broad sense. A proof of excellence in teaching is definitely a "pro".
Finally, the data analyst will participate in industrial projects by means of gathering and analyzing data to solve specific business problems. He/she should be able to evaluate possible scenarios, to make predictions on future outcomes, and to support decision making. Thus, he/she should have experience in applying data analytic (e.g. statistics/econometrics or machine learning) techniques to large economic and business data sets. He/she should be an advanced user, or even a developer, of software tools for statistical analysis of high-dimensional data sets.
Typical workload: 40% education and 60% research, of which a significant part might be in collaboration with industry.
Requirements:

* PhD or equivalent advanced degree in a field relevant to data analytics, such as econometrics, statistics, machine learning, artificial intelligence, operations research or computer science;
* Self-motivation;
* Solid track record of scientific publications in international peer-reviewed journals in one of the fields above. Preference will be given to candidates having methodological expertise that goes beyond simple applications of these techniques;
* Excellent interpersonal skills, including the ability to interact with scientists, corporates, SME's, Start-Ups and stakeholders in the public sector, at a variety of levels in a collaborative, effective manner;
* A track record of success in working within teams;
* Experience in acquiring research funding is a pro.
Conditions of employment: The terms of employment of Maastricht University are set out in the Collective Labour Agreement of Dutch Universities (CAO). Furthermore, local UM provisions also apply. For more information look at the website www.maastrichtuniversity.nl/<http://www.maastrichtuniversity.nl/> , employees, A-Z.
Contract type: Tenure track for starting ass. prof.; permanent, when proven to have sufficient experience.
Organisation
Maastricht University is renowned for its unique, innovative, problem-based learning system, which is characterized by a small-scale and student-oriented approach. Research at UM is characterized by a multidisciplinary and thematic approach, and is concentrated in research institutes and schools. Maastricht University has around 16,000 students and 4,000 employees. Reflecting the university's strong international profile, a fair amount of both students and staff are from abroad. The university hosts 6 faculties: Faculty of Health, Medicine and Life Sciences, Faculty of Law, School of Business and Economics, Faculty of Humanities and Sciences, Faculty of Arts and Social Sciences, Faculty of Psychology and Neuroscience.

Applications:

Applications should be received not later than February 14, 2016. They should include a curriculum vitae and copies of some written work. Two letters of reference, assessing the applicant's research potential and personality, should be sent independently by the referees. Applications can, preferably, be sent by e-mail to: recruitment-sbe@maastrichtuniversity.nl<mailto:recruitment-sbe@maastrichtuniversity.nl> (with cc to j.urbain@maastrichtuniversity.nl<mailto:j.urbain@maastrichtuniversity.nl>) or to: Maastricht University School of Business and Economics, Personnel Department, P.O. Box 616, 6200 MD, Maastricht, The Netherlands, and refer to vacancy AT2015.245 on both letter and envelope.

For more information about the position you can contact:

Prof. dr. Jean-Pierre Urbain, phone: +31 43 3883660, email j.urbain@maastrichtuniversity.nl<mailto:j.urbain@maastrichtuniversity.nl>
or
Prof. dr. Rudolf Müller, phone +31 43 3883799, e-mail r.muller@maastrichtuniversity.nl<mailto:r.muller@maastrichtuniversity.nl>

Prof.dr. Rudolf Müller

Scientific Director
Business Intelligence and Smart Services Institute
www.biss-institute.nl<http://www.biss-institute.nl/>

r.muller@maastrichtuniversity.nl <mailto:r.muller@maastrichtuniversity.nl>
www.maastrichtuniversity.nl/web/profile/r.muller.htm

T +31 43 388 3799
M +31 6 41325231

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 95, Issue 15
**************************************

Friday, January 22, 2016

dmanet Digest, Vol 95, Issue 20

Thursday, January 21, 2016

dmanet Digest, Vol 95, Issue 19

Wednesday, January 20, 2016

dmanet Digest, Vol 95, Issue 18

Tuesday, January 19, 2016

dmanet Digest, Vol 95, Issue 17

dmanet Digest, Vol 95, Issue 16

Monday, January 18, 2016

dmanet Digest, Vol 95, Issue 15

About Me