Friday, April 28, 2017

[DMANET] Deadline Extension: SAGT 2017 - May 5, 2017

SAGT 2017 - Call for Papers


10th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
SAGT 2017
http://cs.gssi.infn.it/sagt2017
L'Aquila, Italy, Sep. 12-14, 2017

IMPORTANT DATES

- Submission: May 5, 2017.
- Notification: June 20, 2017.
- Camera ready: July 6, 2017.


The 10th International Symposium on Algorithmic Game Theory (SAGT) will
take place in L'Aquila, Italy, September 12-14, 2017. 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:

- Michal Feldman, Tel-Aviv University
- Martin Hoefer, Goethe University
- Nicole Immorlica, Microsoft Research


SUBMISSIONS

Authors are invited to submit previously unpublished work for possible
presentation at the conference. Foundational work is solicited on topics
including but not limited to:

- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Repeated Games and Convergence of Dynamics
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Design and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising

Industrial application works and position papers presenting novel ideas,
issues, challenges and directions are also welcome.

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

Submissions must be prepared in LNCS-style and limited to at most 12
pages. Additional material can be added in a clearly marked appendix.
Accepted papers are presented in at most 12 pages in the proceedings.
Alternatively, authors of accepted papers can publish only a one page
abstract in the proceedings, along with a URL pointing to the full paper.

For more detailed submission guidelines and instructions see the
conference webpage at http://cs.gssi.infn.it/sagt2017/cfp.php.

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


PROGRAM COMMITTEE

- Elliot Anshelevich, Rensselaer Polytechnic
- Vittorio Bilò, University of Salento (co-chair)
- Ioannis Caragiannis, University of Patras
- Giorgos Christodoulou, University of Liverpool
- Xiaotie Deng, Shanghai Jiaotong University of China
- Angelo Fanelli, CNRS Caen
- Michele Flammini, University of L'Aquila & GSSI (co-chair)
- Dimitris Fotakis, National Technical University of Athens
- Martin Gairing, University of Liverpool
- Paul Goldberg, University of Oxford
- Tobias Harks, University of Augsburg
- Thomas Kesselheim, Max-Planck-Institut für Informatik
- Elias Koutsoupias, University of Oxford
- Stefano Leonardi, Sapienza University of Rome
- Marios Mavronicolas, University of Cyprus
- Gianpiero Monaco, University of L'Aquila
- Luca Moscardelli, University of Chieti-Pescara
- Giuseppe Persiano, University of Salerno
- Guido Proietti, University of L'Aquila
- Amin Saberi, Stanford University
- Rahul Savani, University of Liverpool
- Guido Schäfer, CWI Amsterdam
- Alexander Skopalik, University of Paderborn
- Nicolas Stier-Moses, Facebook Core Data Science
- Chaitanya Swamy, University of Waterloo
- Vasilis Syrgkanis, Microsoft Research
- Marc Uetz, University of Twente
- Adrian Vetta, McGill University


STEERING COMMITTEE

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


ORGANIZING COMMITTEE

- Vittorio Bilò, University of Salento (co-chair)
- Gianlorenzo D'Angelo, Gran Sasso Science Institute
- Mattia D'Emidio, Gran Sasso Science Institute
- Michele Flammini, University of L'Aquila & GSSI (co-chair)
- Gianpiero Monaco, University of L'Aquila
- Luca Moscardelli, University of Chieti-Pescara
- Cosimo Vinci, Gran Sasso Science Institute

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

[DMANET] 3rd Workshop on Algorithmic Game Theory at IJCAI -- Call for papers

-----------------------------------------------------------------------
AGT@IJCAI 2017 Call for Papers
-----------------------------------------------------------------------

3rd Workshop on Algorithmic Game Theory at IJCAI
Melbourne
August 19-21, 2017 (1 day TBC)
http://agt2017.net.technion.ac.il/

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

Deadlines:

May 4th, 2017 – Submission of contributions to workshops.
June 4th, 2017 – Workshop paper acceptance notification.
June 10th, 2017 – Deadline for final camera ready copy to workshop organizers.

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

Scope:

Over the past fifteen years, research in theoretical computer science,
artificial intelligence, and microeconomics has joined forces to
tackle problems involving incentives and computation. This research
field, commonly named Algorithmic Game Theory, is becoming
increasingly more relevant.

The main aim of this one-day long workshop is to bring together the
rich variety of scientists that IJCAI attracts in order to have a
multidisciplinary forum within which discuss and analyze current and
novel challenges that the research in Algorithmic Game Theory faces.

Submission:

All paper submissions will be peer-reviewed and evaluated on the basis
of the quality of their contribution, originality, soundness, and
significance. Industrial applications and position papers presenting
novel ideas, issues, challenges and directions are also welcome.
Submissions are invited in, but not limited to, the following topics:

- Algorithmic mechanism design
- Auction algorithms and analysis
- Behavioral Game Theory
- Bounded rationality
- Computational advertising
- Computational aspects of equilibria
- Computational social choice
- Convergence and learning in games
- Coalitions, coordination and collective action
- Economic aspects of security and privacy
- Economic aspects of distributed and network computing
- Information and attention economics
- Network games
- Price differentiation and price dynamics
- Social networks

Submission Guidelines:

Authors are invited to submit a paper of no more than 16 pages,
including references, in LNCS style. All submissions will be
electronic via the EasyChair page for the conference at
https://easychair.org/conferences/?conf=agtijcai2017. Submissions must
adhere to the specified format and length. All the technical details
that are necessary for a proper scientific evaluation of a submission
must be included in a clearly-labelled appendix, to be consulted at
the discretion of program committee members. Please note that
reviewing will not be double-blinded.

Proceedings Publication:

To widen participation and encourage discussion, there will be no
formal publication of workshop proceedings. (We will, however, collate
the accepted papers to the benefit of the participants to the
workshop.) Therefore, submissions of preliminary work and papers to be
submitted or in preparation for submission to other major venues in
the field are encouraged.

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

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

[DMANET] 2nd Call for Papers: Graph Drawing and Network Visualization GD 2017

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

2nd Call for Papers

GD 2017

25th International Symposium on
Graph Drawing and Network Visualization

September 25-27, 2017 - Boston, MA, U.S.A.
http://graphdrawing.org/gd2017

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

PDF version:
https://gd2017.ccis.northeastern.edu/files/2017/02/GD2017-CFP.pdf

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

Graph Drawing is concerned with the geometric representation of graphs
and constitutes the algorithmic core of Network Visualization. Graph
Drawing and Network Visualization are motivated by applications where it
is crucial to visually analyze and interact with relational datasets.
Examples of such application areas include data science, social
sciences, Web computing, information systems, biology, geography,
business intelligence, information security and software engineering.

GD has been the main annual event in this area for more than 20 years.
Its focus is on combinatorial and algorithmic aspects of graph drawing
as well as the design of network visualization systems and interfaces.
GD 2017 will take place September 25-27, 2017 at the Northeastern
University in Boston, Massachusetts, USA. Researchers and practitioners
working on any aspects of graph drawing and network visualization are
invited to contribute papers and posters and to participate in the
symposium and the graph drawing contest.

PAPERS
------

We invite authors to submit papers describing original research of
theoretical or practical significance to graph drawing and network
visualization. Regular papers must be submitted explicitly to one of two
distinct tracks. Papers submitted to one track will not compete with
papers submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such
as combinatorial aspects and algorithm design. The range of topics for
this track includes (but is not limited to):

• Design and analysis of graph drawing algorithms
• Geometric graph theory
• Geometric computing
• Planarity and topological graph theory
• Optimization on graphs

Track 2: Experimental, applied, and network visualization aspects
-----------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing,
such as the development of network visualization systems and interfaces
in different application areas. The range of topics for this track
includes (but is not limited to):

• Visualization of graphs and networks in real world applications,
including big data
• Engineering of network visualization algorithms and systems
• Experimental results in graph theory and algorithms
• Benchmarks and experimental studies of network visualization systems
and user interfaces
• Cognitive studies on graph drawing readability and user interaction
• Interfaces and methods for interacting with graphs

Short papers
------------

In addition to the above two tracks, there will be a separate category
for short papers, describing theoretical or applied contributions of
shorter length. Papers in this category will be assigned a shorter time
for presentation during the conference.

Demos
-----

Authors of applied papers will have the opportunity to show a demo of
their software/system during the poster session.

Submission format
-----------------

All submissions must be formatted using the LaTeX style file for the
conference series Lecture Notes in Computer Science (LNCS) provided by
Springer. The default margins and fonts must not be modified; in
particular, the use of packages such as times.sty is not allowed.
Submissions that do not comply with this format risk rejection without
consideration of their merits. The length of regular papers is limited
to 12 pages (excluding references), while the length of short papers is
limited to 6 pages (excluding references). The claims of the paper
should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page
limits, the authors should include it in a clearly marked appendix,
whose length is not constrained and which the reviewers may read at
their own discretion.

POSTERS
-------

Submissions of posters on graph drawing, network visualization, and
related areas are solicited. The poster session will provide a forum
for the communication of late-breaking research results (which may also
appear elsewhere) to the GD community. Authors of posters should prepare
an abstract (up to 2 pages in the LNCS style) that must be submitted
together with the poster itself.

CONTEST
-------

Details about the traditional Graph Drawing Contest held at the
conference will be provided on the conference Web site.

PUBLICATION
-----------

All accepted papers (including the two-page poster abstracts) will
appear in the conference proceedings, published by Springer in the
Lecture Notes in Computer Science (LNCS) series. Twelve pages (excluding
references) will be allocated for regular papers and six pages
(excluding references) for short papers. The LNCS proceedings will be
made freely accessible to the GD community upon publication and openly
accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv
repository, in order to provide immediate and unrestricted open access
to them. The self-archived arXiv papers shall consist of an identical
copy of the LNCS proceedings plus an optional clearly marked appendix,
possibly containing a long version of the entire paper or proofs that
have been omitted from the main text. Subsequent submissions of
different versions of the paper to the arXiv (known as arXiv
``replacements'') are allowed. Upon submission of the camera-ready
version of an accepted paper, the authors will be required to specify
the arXiv identifier associated with the paper for inclusion in a
conference index, which will be also published in the ArXiv repository.
Failure to comply with these guidelines will impede the publication of
the paper.

Each paper must be presented at the conference by an author (baring
unforeseen circumstances), otherwise the paper will not be included in
the proceedings. Should any visa restriction prevent an author from
attending the conference and presenting a paper, he/she will be given
ways to participate and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a
special issue of the Journal of Graph Algorithms and Applications
(JGAA). The authors of the best paper in Track 2 will be invited to
submit a substantially extended and enhanced version of their work to
IEEE Transactions on Visualization and Computer Graphics (TVCG).

AWARDS
------

For each of the two tracks, the Program Committee of GD 2017 will give a
Best Paper Award. In addition, to recognize the effort of participants
to present their work and to prepare their posters in a clear and
elegant way, there will be a Best Presentation Award and a Best Poster
Award voted on by the GD 2017 attendees.

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

• Paper submission deadline: June 11 (23:59 PDT) – Updates
possible until June 13 (23:59 PDT)
• Notification of paper acceptance: July 28
• Poster submission deadline August 17 (23:59 PDT)
• Notification of poster acceptance August 28
• Final versions due September 3
• Contest submission deadline September 13
• Symposium September 25-27

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

Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
Alessandro Vespignani, Northeastern University, US

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

Daniel Archambault, Swansea University, GB
Benjamin Bach, University of Edinburgh, GB
Fabian Beck, Universität Duisburg-Essen, DE
Michael Bekos, Universität Tübingen, DE
Therese Biedl, University of Waterloo, CA
Giordano Da Lozzo, UC Irvine, US
Vida Dujmovic, University of Ottawa, CA
Stephane Durocher, University of Manitoba, CA
Tim Dwyer, Monash University, AU
Fabrizio Frati (co-chair), Università Roma Tre, IT
Martin Gronemann, Universität zu Köln, DE
John Alexis Guerra Gómez, Universidad de los Andes, CO
Michael Hoffmann, ETH Zürich, CH
Yifan Hu, Yahoo Research, US
Takayuki Itoh, Ochanomizu University, JP
Anna Lubiw, University of Waterloo, CA
Kwan-Liu Ma (co-chair), UC Davis, US
Fabrizio Montecchiani, Università degli Studi di Perugia, IT
Martin Nöllenburg, Technische Universität Wien, AT
Arnaud Sallaberry, LIRMM, FR
Andrew Suk, University of Illinois at Chicago, US
Antonios Symvonis, National Technical University of Athens, GR
Ioannis Tollis, University of Crete, GR
Csaba Tóth, California State University Northridge, US
Alexander Wolff, Universität Würzburg, DE
Jian Zhao, FX Palo Alto Laboratory, US

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

Cody Dunne (co-chair), Northeastern University, US
Alan Keahey (co-chair), Conversant, US

CONTEST COMMITTEE
-----------------

Philipp Kindermann, Universität Würzburg, DE
Maarten Löffler (chair), Utrecht University, NL
Ignaz Rutter, Karlsruhe Institute of Technology, DE


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

[DMANET] DCFS 2017 call for participation

CALL FOR PARTICIPATION - DCFS 2017

Descriptional Complexity of Formal Systems 2017
July 3-5, 2017, Milano, Italy

http://dcfs2017.di.unimi.it/ <http://dcfs2017.di.unimi.it/>


*** Early registration deadline: May 15, 2017 ***

The 19th IFIP WG 1.02 International Conference on Descriptional Complexiy of
Formal Systems is organized by the Department of Computer Science, University
of Milano, and by the IFIP Working Group 1.02 "Descriptional Complexity" <http://www.informatik.uni-giessen.de/ifipwg1.2/>.


The scientific program of DCFS 2017 consists of 4 invited lectures
and 20 contributed papers.

Invited lectures by
- Jürgen Dassow (Magdeburg, Germany)
- Dora Giammarresi (Rome, Italy)
- Stavros Konstantinidis (Halifax/NS, Canada)
- Orna Kupferman (Jerusalem, Israel)

The list of accepted papers can be found on the conference web site.

Proceeding will be published on Lecture Notes in Computer Science and will be
available during the conference.

Early registration deadline: May 15, 2017


CONTACT

email: dcfs2017@di.unimi.it <mailto:dcfs2017@di.unimi.it>
http://dcfs2017.di.unimi.it/ <http://dcfs2017.di.unimi.it/>


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

Wednesday, April 26, 2017

[DMANET] ISSAC 2017: FIRST CALL FOR POSTERS AND SOFTWARE PRESENTATIONS

================================================================================
Call for Poster and Software Presentations

ISSAC 2017

International Symposium on Symbolic and Algebraic Computation
University of Kaiserslautern, Germany,
July 25-28 2017.

FIRST CALL FOR POSTERS AND SOFTWARE PRESENTATIONS

http://www.issac-conference.org/2017

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

ISSAC, the International Symposium on Symbolic and Algebraic
Computation, is the
premier annual gathering of the Symbolic Mathematical Computation
community to
present and discuss new developments and original research results in
symbolic
and algebraic computation.

The poster session at ISSAC is a venue to announce early research results or
ongoing projects that might not yet be complete. Posters reporting on
recent work published or accepted or submitted elsewhere are also welcome
(with original publications clearly referenced).

The software presentations at ISSAC are for demonstrating and communicating
about new developments in software for symbolic and algebraic computation.
Presentations are welcome for software based on previously published
algorithms
and mathematics.

Authors are invited to submit an extended abstract in PDF format of no more
than 3 pages. The abstracts will be reviewed by the poster and software
committees
and relevant experts when needed. The review criteria are content,
originality,
style and relevance. The accepted poster and software abstracts will be
printed and
distributed at the conference as well as published in an upcoming issue of
the ACM SIGSAM Communications in Computer Algebra.

Topics:
-------
All areas of computer algebra and symbolic computation are of interest.
For a detailed list, see ISSAC 2017 Call for Papers
http://www.issac-symposium.org/2017/calls_for_papers/CFP2017.txt

Important Dates:
----------------

Posters:

Abstract submission (.pdf) Friday, May 26, 2017
Notification of acceptance/rejection Friday, June 23, 2017
Final version (.tex) due Friday, July 7, 2017

Software:

Abstract submission (.pdf): Friday, May 26, 2017
Notification of acceptance/rejection: Friday, June 23, 2017
Final version (.tex) due: Friday, July 7, 2017

Submission Instructions:
------------------------
Please submit an extended abstract in PDF format via EasyChair at the
following URL:

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

The PDF file should be prepared using the SIGSAM LaTeX style and
the CCA templates (see http://www.sigsam.org/cca/).

Authors are expected to present their work at the symposium.
Distinguished Poster and Software Presentation Awards will be made.

Posters and Software will be judged based on content and presentation.
Posters
for which the work has already been accepted or has appeared at the time of
submission will not be eligible for poster prizes.

Poster Committee:
----------------------
Dan Bates, Colorado State University, USA -- Chair
Marc Moreno Maza, University of Western Ontario, Canada
Vincent Neiger, Technical University of Denmark

Software Presentations Committee:
---------------------------------
William Hart, TU Kaiserslautern, Germany
Bernard Parisse, Université Grenoble Alpes, France

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

[DMANET] PostDoc Position in Developing New Algorithms for Solving Parity Games

We are looking for a motivated and enthusiastic individual to work on
the project Solving Parity Games in Theory and Practice with Sven
Schewe, John Fearnley, and Dominik Wojtczak. The project is in
collaboration with the University of Warwick. Our vibrant team also
includes a number of PhD students and international visitors.

You can enjoy developing theories, algorithms, and/or tools for
solving parity games or related games, such as mean payoff games. You
should have a PhD in Mathematics, Computer Science or relevant subject
and an excellent track record of publications in theoretical computer
science, automata- and game-theory, verification, synthesis, and/or
tool development.

The post is available 1 August 2017 until 31 July 2020, and the
advertisement closes on 5 May.

You can write to Sven (sven.schewe@liverpool.ac.uk), Dominik
(d.wojtczak@liverpool.ac.uk), or John (fearnley@liverpool.ac.uk) for
informal inquiries.

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

[DMANET] PhD position in operations research available at Ecole des Ponts Paristech (Paris, France)

We invite applications for a fully funded PhD position in Operations Research and Machine Learning. The PhD should start no later than October 2017.

Title: demand models and schedule design for airlines

Operations Research has been successfully optimizing airline industry processes for more than sixty years. The topic of "schedule design" provides tools to decide which market to serve, with what frequency, and how to schedule flight legs to meet these frequencies. Mathematically, this requires to model demand and customer preferences, and then find the set of flight legs to operate that maximizes the predicted profit.

Two recent trends challenge the traditional approaches to schedule design. First, the air transportation industry moved from a monopolistic to a very competitive environment, which calls for a new generation of demand models. Second, the amount of data made available by information technologies opens new opportunities to better take into account the uncertainty of demand. These new stochastic models notably enable to evaluate and control risk when optimizing the flight legs schedule.

The objective of this PhD is to set up new approaches to schedule design that responds to these challenges.

* Research supervision and environment
Scientific supervisors: Frédéric Meunier and Axel Parmentier

This PhD takes place in the context of the Operations Research and Machine Learning chair between Air France and the Ecole des Ponts Paristech. The candidate will share its time between the Cermics, the applied mathematics center of the Ecole des Ponts Paristech, and the Operations Research department of Air France.

Ecole des Ponts Paristech is one of the top French universities, and Paris provides a startling research environment in mathematics and computer science.

* Candidate profile
Students are expected to carry out top-level research. They will develop efficient solution algorithms to difficult planning problems. They must have a master degree in Operations Research, Applied Mathematics, Computer Science, or a related field. They should demonstrate good programming skills. Knowledge of mathematical programming is required, experience in stochastic optimization, machine learning, or game theory is an asset. Even though they may learn French during their stay, French knowledge is not mandatory.

* Application procedure
Interested candidates should send their application package electronically to Axel Parmentier (axel.parmentier@enpc.fr). The application should contain the following documents:
- Cover letter explaining the motivation for the PhD, your research/career interests, as well as your preferred starting date
- Detailed curriculum vitae with list of publications (if any)
- Grade records of Bachelor and Master programs
- Reference letters or contact details of references (one of them should be the supervisor of the candidate's Master studies)

Applications are opened from now. The position is limited to three years. If you have further questions regarding this position, please contact Axel Parmentier (axel.parmentier@enpc.fr).
Position will remain available until filled.


**********************************************************
*
* 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] WIVACE 2017: Workshop on Artificial Life and Evolutionary Computation

WIVACE 2017
XII Workshop on Artificial Life and Evolutionary Computation

19-21 September 2017

European Centre for Living Technology
Università Ca' Foscari
Venice (Italy)


http://wivace.org/2017/index2017.html

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

News:
- Invited speakers confirmed
- WIVACE co-located with CINI Infolife workshop on 21 September
- Postproceedings published by Springer (final approval pending)

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


The Workshop on Artificial Life and Evolutionary Computation aims to
bring together researchers working in Artificial Life and Evolutionary
Computation to present and share their research in a multidisciplinary
context. The workshop provides a forum for the discussion of new
research directions and applications in these fields, where different
disciplines could effectively meet.


**** Topics of Interest ****

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

* Bioinformatics and computational biology
* Bioinspired Algorithms
* Bioinspired Robotics
* Complex Systems
* Evolutionary Computation
* Genetic Algorithms
* Modeling and Simulation of Artificial and Biological Systems
* Modeling and Simulation of Social and Economical Systems
* Synthetic and Systems Biology
* Systems Chemistry
* Theories and Applications of Artificial Life


**** Paper submission ****

Contributions are solicited in the form of an abstract (max 4 pages)
or a full paper (max 12 pages) in pdf format (see workshop webpage
for details). Each submission will be refereed by at least three
PC members. The authors of selected contributions will present their
work in a plenary session talk. An electronic book of abstracts will
be provided to the participants.


**** Workshop proceedings ****

The authors of accepted abstracts will be asked to extend their
contribution and submit a full paper. Full papers will be
peer-reviewed by at least three members of the program committee
and selected for a post-conference proceedings volume which is planned
to be published with Springer in their Communications in Computer and
Information Science (CCIS) series (final approval pending).


**** Invited speakers ****

Rudolf M. Fuchslin (Zurich University of Applied Sciences)
Steen Rasmussen (University of Southern Denmark)
Erik A. Schultes (Dutch TechCenter for Life Science)
Roberto Taramelli (Università degli Studi dell'Insubria)


**** Important dates ****

Abstract submission deadline: 26th June 2017
Notification acceptance: 1st August 2017
Early Registration: 1st September 2017
Deadline for submission of the extended work: 31th October 2017


**** WIVACE & CINI InfoLife workshop ****

WIVACE 2017 will be co-loacted with the InfoLife workshop
(21-23 Sept. 2017). The topics of the two events are common, hence the
participation to both workshops is encouraged. Participants to any of
the two workshops will be allowed to attend both events on Thursday 21
without additional fee.


**** Organising committee ****

General Chairs

Marcello Pelillo (University Ca' Foscari of Venice)
Irene Poli (University Ca' Foscari of Venice)
Roberto Serra (University of Modena and Reggio Emilia)

Program Chairs

Andrea Roli (University of Bologna)
Debora Slanzi (University Ca' Foscari of Venice)
Marco Villani (University of Modena and Reggio Emilia)


* Website: http://wivace.org/2017/index2017.html


**********************************************************
*
* 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 Student Position in Algorithms, TU Munich

PhD Student Position in Algorithms
TU Munich

The Department of Computer Science, Technical University of Munich, has a
vacancy for a PhD student position in the area of efficient algorithms. The
position is hosted at the Chair for Theoretical Computer Science, headed
by Prof. Susanne Albers (http://wwwalbers.in.tum.de/index.html.en).
The dissertation work will involve research in the fields of approximation
and online algorithms, algorithmic game theory or algorithm engineering.

The position is paid according to the German public salary scale TVL-13 and
provides a competitive salary with standard benefits. The initial
appointment
is for a period of two years and can be renewed for another two years.

The successful candidate should have a Master's degree in computer
science or
mathematics. The application material should include (1) a cover letter
describing
the interest in the position, (2) a CV, and (3) a copy of the Master's
thesis.
The material should be sent electronically to <albers@in.tum.de>.

Applications will be reviewed starting May 15, 2017.

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

--
Susanne Albers
Chair of Theoretical Computer Science
TUM, Department of Informatics
Boltzmannstr. 3, 85748 Garching
Phone: +49 89 289 17702
Fax: +49 89 289 17707

**********************************************************
*
* 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] Lecturer in Graph Theory, The University of Melbourne, Australia

Lecturer in Graph Theory, The University of Melbourne, Australia

Applications are invited for a continuing Lecturer (Assistant Professor) position in Graph Theory in the School of Mathematics and Statistics, The University of Melbourne, Australia.


The successful applicant is expected to undertake high-level research in graph theory. He or she should also have a strong commitment to teaching and supervision of research students. Teaching will occur within the School of Mathematics and Statistics undergraduate and MSc programs and the applicant will be expected to teach mathematics and its applications to a variety of audiences. The successful applicant is also required to supervise research students at undergraduate, MSc and PhD levels in graph theory.

Classification: Lecturer Level B


Salary: $95,434 - $113,323 (Australian dollar) p.a.


Superannuation: Employer contribution of 17%


More Information: See the following website and the PDF file there for more information about this position, including position description, selection criteria, etc.


http://jobs.unimelb.edu.au/caw/en/job/890424/lecturer-in-graph-theory


How to apply: Online applications are preferred. Go to


http://about.unimelb.edu.au/careers


Select the relevant option ('Current Staff' or 'Prospective Staff'), then find the position by title or number.

Deadline: 15 May 2017

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

_________________________________________________
Sanming Zhou, PhD
President, Combinatorial Mathematics Society of Australasia
Professor, School of Mathematics and Statistics
The University of Melbourne, Parkville, VIC 3010, Australia
T: +61 3 8344 3453
E: sanming@unimelb.edu.au<mailto:sanming@unimelb.edu.au>
W: http://www.ms.unimelb.edu.au/~sanming@unimelb/


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

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

Summer School in Mathematics, Budapest

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

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

Titles of the minicourses:
- Algebraic methods for finite geometric problems
- The Banach-Tarski paradox
- Shannon capacity of graphs
- Complete disorder is impossible
- The power of powers
- Matchmakers
- Random walks and ergodicity
- What is typical behaviour? Examples and counter-examples in analysis

The abstracts of the minicourses are available at
http://bolyai.cs.elte.hu/summerschool/.

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

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

[DMANET] PhD position in Computer Science and Optimization/ University of Avignon, LIA

PhD position in Engineering/Computer Science and Optimization

University of Avignon, France

*/Information Structures in Complex Queueing Systems/*

Strategic decisions in queueing systems are very common in everyday
life. Rooms in hospitals, voting locations, security gates at
international airports and amusements parks are many examples of systems
for which strategic decisions are taken by each customer in order to
join optimally those systems [1].

The analysis methods and techniques for studying such decision processes
in complex queueing systems are mainly described in the book [2]. An
interesting new aspect of these problems is to study the impact of the
information structure onto the strategic decisions and equilibrium of
the customers. Information about the system like the actual queue length
and/or processing rate is an important parameter for customers who face
the decision whether to join or to choose a particular option/system.
Moreover, customers are not all equal faced to the information proposed.
Some of them can have easily access to the information and some not.
Even, the system manager may aim to hide some information to customers.
A recent paper [3] has shown that some simple policies like giving all
the information or nothing are optimal in some particular cases.

The aim of this project is to extend those results for more complex
structure of the system.

*Backgrounds*: The candidate should have good knowledge in Mathematics,
stochastic models and optimization techniques. Some basic skills in
programming and simulations are also welcomed.

*Starting:*September 1^st 2017.

*Location*: University of Avignon, LIA, France.

*Supervisor:*Professor Y. Hayel, CERI/LIA University of Avignon, France.
yezekael.hayel@univ-avignon.fr

[1] H. Rafael, R.-G. Ricky, /Equilibrium in a two dimensional queueing
game: When inspecting the queue is costly/, Working paper.

[2] R. Hassin, M. Haviv, /To queue or not to queue: Equilibrium behavior
in queueing systems/, Vol. 59, Springer Science & Business Media, 2003.

[3] E. Simhon, Y. Hayel, D. Starobinski, Q. Zhu, /Optimal Information
Disclosure Policies in Strategic Queueing Games/, in Operation Research
Letters, vol. 44, no. 1, 2016.


--
Yezekael Hayel
MCF-HdR/Ass. Prof. with tenure
Directeur du CERI/Department Head

LIA/CERI
Univ. Avignon, France
+33490843536
+33783543150
http://lia.univ-avignon.fr/chercheurs/hayel/


--
Yezekael Hayel
MCF-HdR/Ass. Prof. with tenure
Directeur du CERI/Department Head

LIA/CERI
Univ. Avignon, France
+33490843536
+33783543150
http://lia.univ-avignon.fr/chercheurs/hayel/


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

Tuesday, April 25, 2017

[DMANET] CP 2017: Final Call for Papers, only a few days left!

​=================================================
CP 2017: Final Call for Papers, only a few days left!
=================================================

Full details at http://cp2017.a4cp.org/call_for_papers

Workshop, tutorials, tracks and accommodation information to be updated shortly.

The Twenty-Third International Conference on Principles and Practice of
Constraint Programming will take place in Melbourne, Australia, from August 28
to September 1, 2017.

This year, CP is co-located with SAT 2017 and ICLP 2017 and follows IJCAI 2017,
also held in Melbourne.

The CP conference series concerns all aspects of computing with constraints,
including: theory, algorithms, environments, languages, models, systems, and
applications.

The CP 2017 programme will include presentations of high-quality scientific
papers on the theory and applications of constraints technology. A number of
invited talks will also be presented that will describe important topics
relevant to the field.


Thematic tracks
===============

Along with workshops, tutorials, the doctoral program, the main technical paper
track, and an application track, we will adhere to the structure that has been
adopted in the past few years with the following thematic tracks:

- CP & Biology
- CP & Machine Learning
- CP & Operations Research
- CP & SAT
- CP & Testing and Verification

Each track has a dedicated sub-committee to ensure that reviewers have the
relevant domain expertise.


Sister Conferences & Journals Track
===================================

CP 2017 is also calling for submissions of papers that have appeared or been
accepted recently (in the past two years) in relevant journals and sister
conferences but have never been presented at CP or CPAIOR. The selected papers
will be presented at the conference and an abstract will appear in the
proceedings.


Journal Fast Track
==================

As with previous editions of CP, a small number of the submissions will be
invited to the Journal Fast Track for publication of an extended version in the
Constraints journal after a subsequent round of reviewing.

Authors should be aware that (with the exception of the Sister Conferences &
Journal track) CP 2017 follows a double-blind reviewing process.


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

- Abstract Submission: April 27, 2017 (mandatory)
- Paper Submission: April 30, 2017
- Author Feedback: May 29 - June 1, 2017
- Notification: June 12, 2017
- Camera-ready: June 26, 2017


Submission information
======================

Paper submission is via EasyChair
https://www.easychair.org/conferences/?conf=cp2017).

There are two paper categories: long papers (15 LNCS pages + references) and
short papers (8 LNCS pages + references). Short papers are of the same status as
long papers: they will be reviewed to the same standards of quality as full
papers and are eligible for the best paper prizes.

Submission of the paper should be in the form of a PDF file following Springer's
LNCS formatting guidelines
(https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines)
for their submission. Submissions exceeding the respective page limit or not
formatted according to Springer LNCS style will be rejected without review.

Multiple submission
-------------------

Authors must carefully select the track that their paper is submitted to.
Submissions to multiple tracks are not allowed (see below). In rare
circumstances, in the best interest of a submission, the Program Chair may move
a submission to another track.

Multiple submission is not allowed. Submissions should not have appeared
in, be accepted for, or be under review for another track, another
peer-reviewed conference or journal.

Submissions which have appeared at workshops or other meetings of lower status
than a conference are allowed, as are submissions which have only appeared
in conferences in highly shortened form (e.g., abstracts). Reviewers are
instructed that contributions must be treated as new if they have only appeared
in paper(s) by the same authors in acceptable outlets (as defined by the
previous point). The conference proceedings will be published by Springer in
the Lecture Notes in Computer Science (LNCS) series. They will contain the
papers accepted in the technical and thematic tracks, and the abstracts of
invited talks, abstracts of papers accepted in the journal publication fast
track and journal-first and sister conference paper track.

Reviewing process
-----------------

The reviewing is double blind: the authors and the reviewers are both anonymous
to each other. In particular, this means that submissions should not contain
author names, affiliations, or links to web sites.

Rebuttal phase
--------------

There will be an opportunity for authors to respond to reviewers' comments
before decisions are made.

Other information
-----------------

For any queries about the paper submission process, please contact the Program
Chair (J. Christopher Beck) at cp2017@easychair.org.

Full details at http://cp2017.a4cp.org/submission/





Dr Tommaso Urli

Researcher | Optimisation Platforms

DATA61 | CSIRO

E tommaso.urli@data61.csiro.au<mailto:tommaso.urli@data61.csiro.au> T +61 2 6218 3862 M +61 403 464 731

Tower A Level 3, 7 London Circuit, Canberra ACT 2601

www.data61.csiro.au

CSIRO's Digital Productivity business unit and NICTA have joined forces to create digital powerhouse Data61

[Data61 | CSIRO logo]
**********************************************************
*
* 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] SSS 2017 Call for papers

SSS 2017 FIRST CALL FOR PAPERS

19th Annual International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017)
November 5-8, 2017, Boston, Massachusetts, USA
http://bitly.com/SSS-2017

DATES

Submission deadline (firm): July 7, 2017
Acceptance notification: August 18, 2017
Camera-ready copy due: August 25, 2017

SCOPE

SSS is an international forum for researchers and practitioners in the design and development of distributed systems with a focus on systems that are able to provide guarantees on their structure, performance, and/or security in the face of an adverse operational environment.

Research in distributed systems is now at a crucial point in its evolution, marked by the importance and variety of dynamic distributed systems such as peer-to-peer networks, large-scale sensor networks, mobile ad-hoc networks, and cloud computing. Moreover, new applications such as grid and web services, distributed command and control, and a vast array of decentralized computations in a variety of disciplines has driven the need to ensure that distributed computations are self-stabilizing, performant, safe and secure.

The symposium takes a broad view of the self-managed distributed systems area and encourages the submission of original contributions spanning fundamental research and practical applications within its scope, covered by the three symposium tracks: (i) Stabilizing Systems: Theory and Practice, (ii) Distributed Computing and Communication Networks, as well as (iii) Computer Security and Information Privacy.

Topics of interest include, but are not limited to:

Stabilizing Systems:
- Self-stabilizing systems,
- Practically-stabilizing systems,
- Self-* abstractions,
- Stabilization and self-* properties with relation to dependability of hardware, software and middleware,
- Self-stabilizing software defined infrastructure,
- Safety and self-stabilization,
- Self-stabilizing autonomous mobile agents

Distributed Computing and Communication Networks:
- Distributed and concurrent algorithms and data structures,
- Synchronization protocols,
- Shared and transactional memory,
- Formal Methods, validation, verification, and synthesis,
- Game-theory and economical aspects of distributed computing,
- Randomization in distributed computing,
- Biological distributed algorithms,
- Communication networks (protocols, architectures, services, applications),
- High-performance, cluster, cloud and grid computing,
- Mesh and ad-hoc networks (wireless, mobile, sensor),
- Location and context-aware systems,
- Mobile agents, robots, and rendezvous,
- Social systems,
- Peer-to-peer and overlay networks,
- Population protocols,
- Infection dynamics

Computer Security and Information Privacy:
- Network security,
- Privacy,
- Internet-of-Things Security,
- Secure cloud computing,
- Mobile sensor networks / ad-hoc networks security,
- Verifiable/fault-tolerant computing,
- Anomaly and networked malware detection,
- Cryptocurrencies and distributed consensus protocols,
- Secure multi-party computation/applied crypto


ORGANIZATION

General Chairs:
Shlomi Dolev, Ben-Gurion Univ., Israel
Jorge A. Cobb, Univ. of Texas at Dallas, USA

Program Chairs:
Paul Spirakis, U. Liverpool, UK & CTI, Greece
Philippas Tsigas, Chalmers Univ. of Technology, Sweden

Track Chairs:

Stabilizing Systems: Theory and Practice
Chryssis Georgiou, University of Cyprus, Cyprus
Elad M. Schiller, Chalmers Univ. of Technology, Sweden

Distributed Computing and Communication Networks
Panagiota Fatourou, University of Crete, Greece
Sergio Rajsbaum, UNAM, Mexico

Computer Security and Information Privacy
Ari Trachtenberg, Boston University, USA
Arkady B. Yerukhimovich, MIT Lincoln Laboratory, USA

Local Arrangements Chair:
Ari Trachtenberg, Boston University, USA

Publicity Chairs:
Elad M. Schiller, Chalmers Univ. of Technology, Sweden
Joel Rybicki, University of Helsinki, Finland
Iosif Salem, Chalmers Univ. of Technology, Sweden


CONFERENCE PRESENTATIONS

Conference presentations will have two formats:

Regular presentations of 30 minutes accompanied by papers of up to 15 pages in the proceedings. This form is intended for contributions reporting on original research submitted exclusively to this conference.

Brief announcements of 10 minutes accompanied by 5 page abstracts in the proceedings. This format is a forum for brief communications and may be published in other conferences.


SUBMISSION

Papers are to be submitted electronically, following the guidelines available on the conference web page. Authors unable to submit electronically should contact the program co-chairs to receive instructions.

All submission must conform to the formatting instructions of Springer Verlag, LNCS series. Each submission must be in English, in PDF format, and include in the first page: (1) the title, (2) the names and affiliations of all authors, (3) contact author's email, address and telephone number, (4) a brief, one paragraph abstract of the paper, (5) indication whether the paper is a regular submission, or a brief announcement submission, (6) indication whether the submission is eligible to be considered for the best student paper award.

A regular submission must not exceed 15 pages (including the title, authors, abstract, figures, and references). Additional necessary details for an expert to verify the main claims of the submission should be included in a clearly marked appendix if extra space is needed. A brief announcement submission must not exceed 5 pages and should not include appendix. Any submission deviating from these guidelines will be rejected without consideration of its merit.

It is recommended that a regular submission begin with a succinct statement of the problem being addressed, a summary of the main results or conclusions, a brief explanation of their significance, a brief statement of the key ideas, and a comparison with related work, all tailored to a non-specialist. Technical development of the work, directed to the specialist, should follow. Papers outside of the conference scope will be rejected without review.

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


PUBLICATION

Regular papers and brief announcements will be included in the conference proceedings.

Extended and revised versions of selected papers will be considered for a special issue of the journal Information and Computation.


PAPER AWARDS

Prizes will be given to the best paper and best student paper. A paper is eligible for the best student paper if at least one of its authors is a full-time student at submission time. This must be indicated in the cover page. The PC may decline to confer awards or may split awards.

**********************************************************
*
* 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] Vacancies for 6 Assistant Professors in computer science, Utrecht University

The department of Information and Computing Sciences of Utrecht University is looking for (deadline May 14):


6 talented Assistant Professors in Information and Computing Sciences (Tenure Track 0.8 - 1.0 FTE) (Female/Male), including one Westerdijk fellowship (Female)

Job description

We are searching for excellent candidates, preferably on the Assistant Professor level, possibly at the Associate Professor level.

Candidates must have expertise in Computing and Information Sciences, related to our current research groups and teaching programmes. We are looking for outstanding candidates who will invigorate and enrich the scope of expertise of our Department and can enhance its involvement in interdisciplinary research projects within and outside the university. The quality of the candidate is leading, but preferred areas of expertise are Data Science, Programming Languages, Information Science, Computer Graphics and Serious Games.

As teaching is an important and satisfying part of our work we are searching for people with a demonstrable motivation to teach. The preferred candidate has teaching experience, and is actively interested in improving her or his teaching, the courses and the teaching programme. Also candidates largely focusing on teaching will be considered.


Qualifications

Ideally your eligibility is exemplified by:


Research:

- PhD in Computer Science, Information Science or another relevant discipline;

- track record of international publications in leading conferences and journals;

- experience with or good prospects for acquiring external research funds;

- vision on future research directions in own area of expertise;

- experience with or readiness to supervise PhD projects;

- active role in international scientific communities.


Teaching:

- enthusiasm for teaching and student supervision;

- ability to teach in departmental BSc and MSc programmes;

- vision on teaching and your own contribution to teaching.

Please note that we are also interested in candidates with a focus on teaching!


Leadership:

- play an active and cooperative role in the department and the University;

- willingness to organize scientific events, such as research seminars or teaching seminars;

- willingness to partake in departmental committees.

In view of the gender balance we strongly encourage qualified women to apply.


Offer

The candidate is offered a position for 3-5 years, depending on experience (0.8 / 1.0 FTE). Depending on experience and the specific field of expertise a tenure-track position could be offered.

Salary depends on qualifications and experience, and ranges between €3,068 and €5,330 (scale 10 - 12 Collective Labour Agreement Dutch Universities) gross per month for a full-time employment. In case of proven outstanding performance an appointment as associate professor could be considered.

The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. We offer flexible employment conditions (according to a multiple choice model), working-from-home facilities, partially paid parental leave, a pension scheme, and collective insurance schemes.

Facilities for sports and child care are available on our campus, which is only 15 minutes away from the historical city center of Utrecht. More information: working at Utrecht University.


About the organization

A better future for everyone. This ambition motivates our scientists in executing their leading research and inspiring teaching. At Utrecht University, the various disciplines collaborate intensively towards major societal themes. Our focus is on Dynamics of Youth, Institutions for Open Societies, Life Sciences and Sustainability.

The city of Utrecht is one of the oldest cities in the Netherlands, with a charming old center and an internationally oriented culture that is strongly influenced by its century-old university. Utrecht city has been consistently ranked as one of the most livable cities in the Netherlands.

The Faculty of Science consists of six departments: Biology, Pharmaceutical Sciences, Information and Computing Sciences, Physics and Astronomy, Chemistry and Mathematics. The Faculty is home to 5,900 students and nearly 1,600 staff and is internationally renowned for the quality of its research. The Faculty's academic programmes reflect developments in today's society.

The Department of Information and Computing Sciences is nationally and internationally renowned for its research in Computer Science and Information Science. The research of the Department focuses on fundamental aspects of Computing and Information Sciences. Current research groups are Algorithmic Data Analysis, Algorithms and Complexity, Decision Support Systems, Intelligent Systems, Simulation of Complex Systems, Multimedia, Geometric Computing, Organisation and Information, Software Technology, Software Technology of Learning and Teaching. Relevant areas of interdisciplinary research include Game Research and Technology, Foundations of Complex Systems, Applied Data Science and Integrative Bioinformatics. The Department has, among others, close collaborations with the University Medical Center, the Departments of Physics and Mathematics, and the Faculties of Humanities and Geosciences.

The Department offers Bachelor programmes in Computer Science and Information Science, and four English language research Master programmes in Artificial Intelligence, Business Informatics, Computing Science, and Game and Media Technology. The Department is developing Master programmes in Data Science. High enrolment figures and good student ratings make the education very successful. The Department currently comprises 9 full-time chairs and 100 other scientific staff, including postdocs and PhD-students.

Due to our successful teaching programmes and our ambitions in research the Department is expanding. We are therefore actively searching for 6 talented Research and Teaching Assistant Professors in Information and Computing Sciences. Please note that positions offered will vary, depending on experience and expertise.

We offer the number 1 candidate a fully financed PhD position. We offer the number 1 female candidate a Westerdijk fellowship which includes a fully financed PhD student and a 50 KEuro research budget. In case this is the same person the second PhD student will be offered to the second candidate on the list.


Additional information

Additional information about the vacancy can be obtained from: Prof M. van Kreveld, (M.J.vanKreveld@uu.nl), Research Director or Ria van Vlimmeren (M.F.J.vanVlimmeren@uu.nl), Secretary to the Board of the Department.

As part of the selection procedure, the candidate is expected to give an outline of her/his research plans in a written report and/or an oral presentation.


Apply

Application deadline is 14 May 2017.

To apply go tohttps://www.uu.nl/en/organisation/working-at-utrecht-university/jobs and please attach a letter of motivation, curriculum vitae and (email) addresses of two referees.

More information:

https://www.uu.nl/en

https://www.uu.nl/en/organisation/faculty-of-science

https://www.uu.nl/en/organisation/department-of-information-and-computing-sciences

https://www.uu.nl/en/organisation/faculty-of-science/about-us/westerdijk-fellowship

https://www.uu.nl/en/organisation/working-at-utrecht-university/terms-of-employment

https://www.uu.nl/en/organisation/working-at-utrecht-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] Tenure-track Assistant Professor in Algorithms and Optimisation

*Tenure-track Assistant Professor in Algorithms and Optimisation*

*Department of Computer Science*
*University of Copenhagen*

*The position* is open from 1 November 2017 or as soon as possible
thereafter.

The Department of Computer Science (DIKU) is expanding its research and
educational activities and hereby invites applications for a *tenure-track
assistant professor in Algorithms and Optimisation*. The tenure-track
assistant professor will join the department's Algorithms and Programming
Languages Section (http://www.diku.dk/english/research/apl-group/). The
section's research is concerned with a wide range of areas related to
algorithms, programming languages and systems. In the area of algorithms,
our research covers discrete optimization algorithms and theoretical
aspects of algorithms and data structures.

The candidate must have a strong background in at least one of the
following two sub-fields:

- Applications of discrete (optimization) algorithms and data structures
to problems in for example bioinformatics, network design, logistics.
Candidates with publications at top bioinformatics, operations research
conferences and journals will be preferred.
- Theoretical aspects of algorithms and data structures. Candidates with
publications at top algorithms/theory conferences such as STOC, FOCS, SODA,
ICALP will be preferred.Read more about the Department at
http://www.science.ku.dk/english/about-the-faculty/organisation/.

Please find the full job advertisement at http://employment.ku.dk/.

Only electronic applications are accepted.

**********************************************************
*
* 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] UPDATE - CLOSING DATE: Durham Post-doc Position in Graph Algorithms and Complexity / Temporal Graphs

UPDATES on CLOSING DATE:

Since the first advertisement of the Postdoc-position at Durham (grant
"Algorithmic Aspects of Temporal Graphs"), some candidates had a
technical problem during the submission of their application online.

For this reason we extend the closing date until Tuesday 2 May 2016,
noon UK time (12:00pm UK time).

The NEW APPLICATION LINK is here:
http://www.jobs.ac.uk/job/AYX078/post-doctoral-research-associate/

The candidates who already successfully applied do NOT need to apply
again. Their application is already stored in the system.

More details about the position follow below.

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

School of Engineering and Computing Sciences, Durham University, UK

Post-Doctoral Research Associate

Duration: 36 months
Grade 7
Salary: 32000 - 34000 GBP (GB Pounds p.a.)

A 3-year Post-Doctoral Research Associate (PDRA) is sought, with
expertise in graph algorithms and complexity, preferably also in
parameterized algorithms and/or approximation algorithms. The successful
candidate will work at Durham University under the guidance of Dr.
George Mertzios on the EPSRC-funded grant "Algorithmic Aspects of
Temporal Graphs". The research in this grant will investigate various
optimization problems on temporal (i.e. dynamically changing) graphs and
explore the computational complexity landscape of these new problems.
Applicants are expected to have (or be about to receive) a PhD in
Computer Science or a closely related subject (e.g. Mathematics).
Although some previous experience with temporal (i.e. dynamically
changing) graphs may be beneficial, it is *not* a requirement for the
job. This project is in collaboration with the University of Liverpool.
The successful candidate will be part of the Algorithms and Complexity
research group (ACiD) in the School of Engineering and Computing
Sciences at Durham (see
http://community.dur.ac.uk/algorithms.complexity/index.php).

The application deadline is 2 May 2017, noon UK time (12:00 UK time).
The full announcement, including more information and instructions on
how to apply, is available at:

http://www.jobs.ac.uk/job/AYX078/post-doctoral-research-associate/

More details on the project can be found at:
http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/P020372/1

Despite what is stated on the EPSRC web-site, the notional start-date is
1 April 2017 but there is flexibility regarding the actual start-date.

General inquiries about the position, the project and the application
procedure are welcome and should be sent to Dr. George Mertzios:
george.mertzios@durham.ac.uk
(see http://community.dur.ac.uk/george.mertzios/)

--
Dr. George B. Mertzios
Senior Lecturer in Computer Science
School of Engineering and Computing Sciences
Durham University, UK
Tel: +44 (0) 191 33 42 429
Email: george.mertzios@durham.ac.uk
http://community.dur.ac.uk/george.mertzios/

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

Monday, April 24, 2017

[DMANET] CFP: JCDCG^3 2017

JCDCG^3 2017: The 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games --- Celebrating the Works and Contributions of Professors Jin Akiyama, Vasek Chvatal, Mikio Kano, Janos Pach, and Jorge Urrutia

(Apologize for multipule distributions)

---- First Call For Presentations ---

Date: Aug. 29 -- Sept. 1, 2017
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Submission Deadline: June 30th, 2017 (JST)

Web site:
http://www.alg.cei.uec.ac.jp/itohiro/JCDCGG/

Invited Plenary Speakers:
- Jin Akiyama (Tokyo University of Science, Japan)
- Vasek Chvatal (Concordia University, Canada)
- Erik Demaine (MIT, USA)
- David Eppstein (University of California, Irvine, USA)
- Mikio Kano (Ibaraki University, Japan)
- Naoki Katoh (Kwansei Gakuin University, Japan)
- Evangelos Kranakis (Carleton University, Canada)
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Jorge Urrutia (UNAM, Mexico)


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

The collection of abstracts will be distributed in only electric form.

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=jcdcg32017

by June 30th, 2017 (JST).

Note:
- We have not prepared for special rates at hotels. So, please
make accommodation arrangements on your own..
- The official language for presentations and abstracts of talks
in this conference is English.

Special Issue *****
The collection of abstracts will be distributed in electric form.
No formal proceedings will be published (such as LNCS).
However, we plan to edit a special issue of this conference. This
issue will appear in Springer's Graphs and Combinatorics, Springer,
Details on this special issue will be given afterward.


***************************************************************
* Important Dates:
* - Extended-Abstract (at most 2 pages) Submissions Deadline:
* June 30th, 2017 (JST)
* - Notification: (expected to) July 14, 2017
* - Camera-Ready File Submission Deadline: July 28, 2017
* - Conference: Aug. 29 -- Sept. 1, 2017
***************************************************************


Committees:

Conference Chair: Toshinori Sakai (Tokai University, Japan)

Programming Committee:
- Jean Cardinal (ULB, Belgium)
- Ruy Fabila-Monroy (Cinvestav, Mexico)
- Takashi Horiyama (Saitama University, Japan)
- Hiro Ito (UEC, Japan; Chair)
- Matias Korman (Tohoku University, Japan)
- Stefan Langerman (ULB, Belgium)
- Chie Nara (Meiji University, Japan)
- Yoshio Okamoto (UEC, Japan)
- Hirotaka Ono (Kyushu University, Japan)
- Vera Sacristan (UPC, Spain)
- Toshinori Sakai (Tokai University, Japan)
- Tomohiro Tachi (University of Tokyo, Japan)
- Ryuhei Uehara (JAIST, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)
- Aaron Williams (Bard College at Simon's Rock, USA)


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


Contact:
JCDCG^3 2017 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/
*
**********************************************************

[DMANET] Open positions: Two lecturer/senior lecturer positions in algorithms at the University of Sydney

Two lecturer/senior lecturer (assistant professor) positions in algorithms
available at the University of Sydney, Australia.

Closing date: 11:30pm 07 May 2017 (Sydney time)

Full ad: http://bit.ly/2o5V4Ly

The School of Information Technologies at the University of Sydney is
embarking on an exciting growth journey, adding several new positions which
will complement our core areas of strength pushing the frontiers to new
research areas. As part of this plan, the School of Information
Technologies (SIT) invites applications from outstanding candidates for a
continuing Lecturer or Senior Lecturer position (Level B/C) in Algorithms
starting immediately. The level of appointment will be commensurate with
qualifications and experience.

This is an attractive opportunity for candidates with an interest and
passion for high quality excellent research and teaching. Strong candidates
from all areas of algorithmic research are sought, including but not
limited to: algorithm analysis, graph algorithms, algorithmic game theory,
approximation algorithms, combinatorial optimization, and computational
learning theory.

To be successful, you will have a PhD in computer science, or a closely
related discipline. You must show evidence of excellent research
achievements in areas of algorithms and the ability to publish your
research in highly-ranked outlets. You will be expected to teach a range of
computer science courses including algorithms related courses. A strong
commitment to teaching and learning is required as well as evidence of
ability to lecture and prepare new teaching material. The candidate is
expected to teach in a broad range of computer science subjects including
algorithms and computing theory.

Informal enquiries are welcome, and can be made to Joachim Gudmundsson (
joachim.gudmundsson@sydney.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] MIP 2017: last days to register

*** MIP WORKSHOP 2017: REGISTRATION DEADLINE APPROACHING ***

We would like to remind all interested participants that the deadline
to register for the 2017 Mixed Integer Programming workshop
(MIP 2017) is April 30, at the end of this week.

The workshop will be held June 19–22 at HEC Montréal (Quebec, Canada),
and registration is open. MIP 2017 will be the fourteenth in a series
of annual workshops held in North America designed to bring the
integer programming community together to discuss very recent
developments in the field. The workshop consists of a single track of
invited talks and features a poster session that provides an
additional opportunity to share and discuss recent research in MIP.
The conference program is available online.

For more information and registration, see the workshop website at
https://sites.google.com/site/mipworkshop2017/

Confirmed speakers:
- Miguel Anjos, École Polytechnique de Montréal
- Yoshua Bengio, University of Montréal
- David Bergman, University of Connecticut
- Pierre Bonami, IBM ILOG
- Austin Buchanan, Oklahoma State University
- Christoph Buchheim, TU Dortmund
- Philipp Christophel, SAS
- Bill Cook, University of Waterloo
- Daniel Dadush, CWI Amsterdam
- Santanu Dey, Georgia Institute of Technology
- Dinakar Gade, Sabre
- Angelos Georghiou, McGill University
- Hassan Hijazi, Australian National University
- Dorit Hochbaum, UC Berkeley
- Volker Kaibel, Otto von Guericke Universitat Magdeburg
- Thorsten Koch, TU Berlin
- Burak Kocuk, Carnegie Mellon University
- Matthias Koeppe, UC Davis
- Vahab Mirrokni, Google Research
- Pablo Parrilo, MIT
- Michael Perregaard, FICO
- Maurice Queyranne, University of British Columbia
- Francisco Trespalacios, ExxonMobil
- Sven Wiese, University of Bologna
- Sercan Yildiz, University of North Carolina

Program Committee:
- Merve Bodur, Georgia Institute of Technology
- Daniel Espinoza, Gurobi
- Fatma Kılınç-Karzan (chair), Carnegie Mellon University
- Andrea Lodi, École Polytechnique de Montréal
- Giacomo Nannicini, IBM Research

Local Committee:
- Miguel Anjos, École Polytechnique de Montréal
- Jean-François Cordeau, HEC Montréal
- Andrea Lodi, École Polytechnique de Montréal
- Odile Marcotte, Université du Québec à Montréal
- Louis-Martin Rousseau, École Polytechnique de Montréal

**********************************************************
*
* 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] ODS2017 - Reminder: deadline for abstract submission, April 30th, 2017

*******************************************************************************
ODS2017 - International Conference on Optimization and Decision Science
Hilton Conference Center, Sorrento, Italy, September 4-7, 2017
www.airoconference.it/ods2017[1]
*******************************************************************************

Dear Friend,

We remind you that the deadline for the abstract submission has been extended to April 30th, 2017.
Don't miss the date!

To submit an abstract, follow the instructions reported on conference website:
http://www.airoconference.it/ods2017/submissions

Authors will be notified about the acceptance of their contribution with a first-in-first-out rule.

Don't forget that the early registration deadline is May 14th, 2017.

Check ODS2017 website for other information and updates: www.airoconference.it/ods2017[2]

Looking forward to meeting you at ODS2017,

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

Link:
-----
[1] http://www.airoconference.it/ods2017
[2] http://www.airoconference.it/ods2017

**********************************************************
*
* 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] OR 2017 Final Call – Submit your Abstract for Berlin

Final Call for Abstracts: OR 2017

International Conference on Operations Research

Berlin, Sept 6 - Sept 8, 2017

Abstract submission deadline: 30 April 2017

http://www.or2017.de/scientific-program/abstract-submission/index.html

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

We invite practitioners and academics from mathematics, computer science, business/economics and other fields to participate at this year's conference, which is held at Freie Universität in Berlin, Germany. The conference provides ample opportunities to present all OR related topics containing both theoretical as well as application-oriented research. Theoretical contributions mainly deal with developing new mathematical techniques to solve all kind of optimization problems. Practical applications may relate to all relevant fields such as health care, transportation and logistics, finance, etc. The special focus of the conference in 2017 is "Decision Analytics for the Digital Economy", but all other OR related topics are welcome, too. Following the format of recent years, the conference consists of plenary and semi-plenary sessions as well as scientific sessions organized by the streams announced below. Please submit your abstract to one of the streams below. Once your abstract has been accepted, we provide the option to submit an extended abstract for potential acceptance in Springer based conference proceedings.

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

** Plenary and Semi-Plenary Speakers **

Plenary Speakers: Richard Eglese ++ Andrea Lodi

Semi-Plenary Speakers: Martin Bichler ++ Sven Crone ++ Christoph Klingenberg ++ Marco Lübbecke ++ Alexander Martin ++ Dirk Christian Mattfeld ++ Anna Nagurney ++ Panos M. Pardalos ++ Meinolf Sellmann ++ Arne Strauss ++ Dorothea Wagner ++ Hans-Georg Zimmermann

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

** Streams for Abstract Submission **

Business Analytics, Artificial Intelligence and Forecasting ++ Control Theory and Continuous Optimization ++ Decision Theory and Multiple Criteria Decision Making ++ Discrete and Integer Optimization ++ Energy and Environment ++ Finance ++ Game Theory and Experimental Economics ++ Graphs and Networks Health Care Management ++ Logistics and Freight Transportation ++ Metaheuristics Optimization under Uncertainty ++ OR in Engineering ++ Production and Operations Management Project Management and Scheduling ++ Revenue Management and Pricing ++ Simulation and Statistical Modeling Software Applications and Modelling Systems ++ Supply Chain Management ++ Traffic, Mobility and Passenger Transportation

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

** Important Dates **

Abstract submission (English preferred, German possible) closes **April 30, 2017**.

Notification of abstract acceptance until May 30, 2017.

Submission of extended abstracts (six pages) for Springer conference proceedings possible, if abstract is accepted, until July 15, 2017.

Registration is open. Reduced conference fees for early registration until **June 30, 2017**.

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

** Social Program **

Get-Together ++ Welcome Reception ++ Conference Dinner ++ Excursions

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

** Organizers **

Local organizing committee: Natalia Kliewer ++ Ralf Borndörfer ++ Jan Fabian Ehmke ++ Max Klimm ++ Stefan Lessmann ++ Timo Schmid

Program committee: Natalia Kliewer ++ Jan Fabian Ehmke ++ Ralf Borndörfer ++ Andreas Fink ++ Alf Kimms ++ Thorsten Koch ++ Stefan Lessmann ++ Rolf Möhring ++ Anita Schöbel ++ Martin Skutella

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

** Submit your abstract now: http://www.or2017.de **

Detailed information on the content of the plenaries and semi-plenaries, the organizing stream chairs, conference fees, the preliminary schedule, accommodation, conference proceedings and abstract submission can be found on the conference's webpage at http://www.or2017.de.

Reserve your hotel rooms early, since Berlin will be busy due to the IFA exhibition.

Please contact or2017@fu-berlin.de<mailto:or2017@fu-berlin.de> in case of any questions.


OR2017 +++ International Conference on Operations Research +++ Decision Analytics for the Digital Economy www.or2017.de<http://www.or2017.de/>


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

[DMANET] PhD position in operations research available at Le Havre Normandy University (France)

*PhD Thesis opportunity at Le Havre Normandy University.*


Title: *Optimization problems in temporal networks*

Supervisors: Yoann Pigne, Eric Sanlaville

Keywords: graphs, optimization algorithms, temporal networks, dynamic graphs

Funding source: Public funds (French Ministry of Education and Research)

Deadline: *Friday 12th of Mai, 2017 *


A temporal network, also called dynamic graph, is a graph defined on a
time interval, where arcs (resp. vertices) might not be present at any
time, but only occasionally [1]. Temporal networks allow to represent
nodes and arcs presence variability in ad hoc mobile networks or social
networks, as well as transportation networks submitted to traffic
congestion. Hence they are a very interesting model for communication
and logistic problems. [2], [3].

Our goal is to study some classical optimization problems on graphs
within this new framework. Moreover, as the formalism for these networks
is not completely fixed in the literature, a part of the work will
consist in proposing the best adapted one for the tackled problems [4].
Determining for instance flows, particular structures like connected
components valid during the considered time interval, will be
considered. Several solving approaches like meta-heuristics,
mathematical programming, approximation algorithms, will be exploited
according to the treated problem natures.


The thesis subject fits well the research themes of the RIIC team
(Interaction Networks and Collective Intelligence) of the computer
science research department LITIS. Indeed, dynamic graphs are the
backbone of the team work. The in-depth analysis of optimization methods
in temporal networks will find immediate applications in the applied
research funded projects of the team (logistics [3],[6], mobile networks
[7], load balancing [8]). Indeed, temporal networks allow to model and
control the evolution with time of this kind of physical networks.

The RI2C team develops a software platform to manipulate dynamic graphs,
GraphStream [9], [10], this work will enrich the software by the way of
a new model to represent and analyse dynamic graphs.

Work plan:

*

Analysis of the temporal networks models from the literature.

*

Extension of optimization problems to temporal networks

*

Design, analysis of solving algorithms for these problems

*

Implementation of the algorithms and models within GraphStream

*

Scientific valorization

*

Thesis writing


The chosen candidate shall display strong skills in graph theory and
optimization. An excellent technical level in software development is
expected (particularly in Java). The Software engineering basis
techniquesmust be mastered and used (test oriented development, version
management). He/She will organize his/her work and be able to respect
the fixed due dates. Skills in statistic analysis and the knowledge of R
language would be appreciated.


Interested candidates should send by mail CV, motivation letter and any
additional material (master marks, training reports, recommendation
letters,GitHub profile,...)

toEric Sanlaville (eric.sanlaville@univ-lehavre.fr
<mailto:eric.sanlaville@univ-lehavre.fr>) andYoann Pigné
(yoann.pigne@univ-lehavre.fr <mailto:yoann.pigne@univ-lehavre.fr>).


[1] P. Holme et J. Saramäki, « Temporal networks », /Physics Reports/,
vol. 519, no 3, p. 97-125, oct. 2012.

[2] B. B. Xuan, A. Ferreira, et A. Jarry, « Evolving graphs and least
cost journeys in dynamic networks », présenté à /WiOpt'03: Modeling
and Optimization in Mobile, Ad Hoc and Wireless Networks/, 2003, 10 pages.

[3] F. Guinand et Y. Pigné, « Time considerations for the study of
complex maritime networks », in /Maritime Networks Spatial structures
and time dynamics/, César Ducruet, Routledge, 2015, p. 163-189.

[4] D. Kempe, J. Kleinberg, et A. Kumar, « Connectivity and Inference
Problems for Temporal Networks », in /Proceedings of the Thirty-second
Annual ACM Symposium on Theory of Computing/, New York, NY, USA, 2000,
p. 504–513.

[5] O. Michail, « An Introduction to Temporal Graphs: An Algorithmic
Perspective », /Internet Mathematics/, vol. 12, no 4, p. 239-280, juill.
2016.

[6] S. Balev, S. Michel, E. Sanlaville, et X. Schepler, « Global
planning in a multi-terminal and multi-modal maritime container port »,
/Transportation Research Part E/, accepté, déc. 2016.

[7] A. Casteigts, S. Chaumette, F. Guinand, et Y. Pigné, « Distributed
maintenance of anytime available spanning trees in dynamic networks »,
in /International Conference on Ad-Hoc Networks and Wireless/, 2013, p.
99–110.

[8] J. L. J. Laredo, F. Guinand, D. Olivier, et P. Bouvry, « Load
Balancing at the Edge of Chaos: How Self-Organized

Criticality Can Lead to Energy-Efficient Computing », /IEEE Transactions
on Parallel and Distributed Systems/, 2016.

[9] A. Dutot, F. Guinand, D. Olivier, et Y. Pigné, « Graphstream: A
tool for bridging the gap between complex systems and dynamic graphs »,
in /Emergent Properties in Natural and Artificial Complex Systems.
Satellite Conference within the 4th European Conference on Complex
Systems (ECCS'2007)/, 2007.

[10] « GraphStream - A Dynamic Graph Library ». [En ligne]. Disponible
sur: http://graphstream-project.org/. [Consulté le: 06-févr-2017].


--
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Eric Sanlaville
Full professor, Le Havre University

Research department LITIS-EA 41-08
Team RI2C : Interaction Networks, Collective Intelligence

Tel : +33 232 744 548
Fax : +33 232 744 314
http://litis.univ-lehavre.fr/~sanlaville

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