Wednesday, January 18, 2017

[DMANET] Revenue Management and Pricing Stream, IFORS 2017

Call for Presentations and Sessions

Revenue Management and Pricing Stream
IFORS 2017 - 21st Conference of the International Federation of
Operational Research Societies

Quebec City, July 17 - 21 2017
---------------------------------------------------------------------------

We invite you and any interested colleagues to organize a session (at
least 3 abstracts/presentations) or a contributed presentation for the
Revenue Management and Pricing Stream at the IFORS 2017 in Quebec City.

The focus of the Revenue Management and Pricing stream is broad and encompasses

applied and theoretical work in computer science, operations research, management science,

information systems, … applied to the field of Pricing and Revenue Management.

If you would like to organize a session, please contact Luce Brotcorne ( Luce.Brotcorne@inria.fr ) as soon as possible.

If you would like to submit a single presentation, please email the title and authors to Luce Brotcorne ( Luce.Brotcorne@inria.fr ) and

you will be sent information on what to enter in the IFORS conference abstract submission system. The deadline for entry into that system for the conference is
February 10th, 2017, but you should send us the information before
February 3rd, 2017.

Please submit your abstracts as soon as possible to help in the scheduling
process.

We look forward to seeing you in Quebec City!


**********************************************************
*
* 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] Doctoral Scholarships in Leipzig

Two Doctoral Scholarships

at the Center for Advanced Studies in Management (CASiM, HHL Leipzig)

The Center for Advanced Studies in Management (CASiM), the international
and interdisciplinary research center of HHL Leipzig Graduate School of
Management for business administration in the 21st century invites
applications for competitive doctoral scholarships. The scholarships are
founded by the Friede Springer Foundation that continues supporting
excellence in research at the CASiM Graduate School since 2013.

The successful candidate addresses innovative research in the fields of Management Science, Logistics, Operations Management
and/or (Algorithmic) Game Theory. Applicants hold a MSc degree (or equivalent) with a quantitative economic or managerial focus,
e.g., in Operations Research, Industrial Engineering, Business Mathematics, Economics, Management Information Science, or
in Mathematics or Computer Science with a profound knowledge in business administration. Fluency in English and excellent
programming skills as well as experience in using OR standard solvers (CPLEX or Gurobi) are of advantage.

We offer the unique opportunity to pursue a doctoral project under the
guidance of internationally renowned scholars and to be part of our
dynamic team.

The scholarship is open to applicants of any nationality and provides a
monthly grant of € 1,750, a yearly budget for visiting international
conferences as well as a waiver of the tuition fee for the doctoral
program. The maximum length of the scholarship is two years.

Applications include a completed application form, CV, motivation
letter, copies of certificates, a recommendation letter from a previous
academic advisor, and the names and contact information of at least two
additional referees. A short research proposal is welcome but not
required. Please send all application material as PDF by email to
<casim@hhl.de> and to the director of CASiM, Prof. Dr. Erwin Pesch,
<erwin.pesch@hhl.de>. The scholarships are expected to start in Spring/
Summer 2017. For further information on the application process and the
application form, go to www.hhl.de/friede-springer-doctoral-scholarships.

**********************************************************
*
* 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 CFP - Int. Conf. on Optimization and Decision Science - Sorrento, 4-7 September

================================================================================
ODS2017 – International Conference on Optimization and Decision Science
XLVII Annual Meeting of AIRO – Italian Operations Research Society
Hilton Conference Center, Sorrento, Italy
September 4-7, 2017
www.airoconference.it/ods2017[1]
================================================================================
Dear colleague,

ODS2017, international conference on Optimization and Decision Science, is organized by AIRO, Italian Operations Research Society, in cooperation with DIETI (Department of Information Technology and Electrical Engineering) of University "Federico II" of Naples.

It will be held at Hilton Conference Center, September 4-7, 2017, in Sorrento, one of the beautiful places in the Gulf of Naples, strategically placed to visit Amalfi, Positano and Capri, and the historical sites of Pompei and Ercolano.

The scope of the conference is presenting ideas and experiences, sharing knowledge and creating a point of contact among researchers and practitioners from various sectors (applied mathematics, computer science, engineering, economics), private and public companies, industries and policy makers. The theme is open in the wide field of optimization, decisions science and problem solving methods, and their application in industrial and territorial systems.

All researchers, academics, phd students and practitioners working on the conference themes are invited to participate to ODS2017 submitting a short paper or an abstract, and organizing sessions.

Please find below the first announcement and call for papers, and visit the conference website www.airoconference.it/ods2017 for further information.

WE KINDLY ASK YOU TO WIDELY DISSEMINATE IT ACROSS YOUR NEAR RESEARCHERS AS WELL AS AMONG ALL COLLEAGUES INTERESTED IN THE CONFERENCE TOPICS, INVITING THEM TO SEND US AN EMAIL TO BE INCLUDED IN ODS2017 MAILING LIST.

We look forward to working with you to make ODS2017 a great success.

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

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

ODS2017 participants will have two ways of submission, (a) short paper, (b) abstract:

(A) SHORT PAPER (6 – 8 PAGES, INCLUDING FRONT MATTER AND REFERENCES)
Short papers will undergo a review process by anonymous referees. Accepted papers will be included in a special volume of the Springer Conference Proceedings in Mathematics and Statistics (PROMS), indexed in main scientific databases (Scopus, Thomson Reuters, Google Scholar, etc.). They should be prepared in LaTeX or Word using the PROMS template and submitted via Springer's Online Conference Service, OCS, (https://ocs.springer.com/prom/).

(B) ABSTRACT (MAX 2000 CHARACTERS SPACE INCLUDED)
Abstracts will be selected by Programme Committee to be included in the conference e-book of abstracts.
They should be prepared using the ODS2017 Word template which is available on the conference website (www.airoconference.it/ods2017).

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

CALL FOR SESSIONS

Session proposals are welcome and have to be sent to ods2017.airo@unina.it at the earliest convenience of the proponent, but in any case within January 28th. Proposals have to report:

/ Title of the session and first attempt title, authors, and kind (short paper or abstract) of each contribution. /

================================================================================
SPECIAL ISSUES

Information about post-conference special issues on indexed international journals will be given in the following announcements.

================================================================================
IMPORTANT DATES, DEADLINES AND INFORMATION

For deadlines and detailed information about the conference and the venue, please, visit the Conference website: www.airoconference.it/ods2017[2] , or send an email to ods2017.airo@unina.it.

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] [Final CFP] IEEE CEC Special Session & Competition on: Niching Methods for Multimodal Optimization

** FINAL DEADLINE: Paper Submission: 30 January 2017 **

################
Call for Papers
################

2017 IEEE Congress on Evolutionary Computation Special Session and
Competition on: "Niching Methods for Multimodal Optimization"

June 5-8, 2017, at Donostia - San Sebastián, Spain
URL: http://www.epitropakis.co.uk/cec17-niching/
URL: http://www.epitropakis.co.uk/cec17-niching/competition/

** FINAL DEADLINE: Paper Submission: 30 January 2017 **
In the Main research topics drop-down menu please select: *SS36:
Niching Methods for Multimodal Optimization*

============
Objectives
============

Population or single solution search-based optimization algorithms (i.e.
{meta,hyper}-heuristics) in their original forms are usually designed for
locating a single global solution. Representative examples include among others
evolutionary and swarm intelligence algorithms. These search algorithms
typically converge to a single solution because of the global selection scheme
used. Nevertheless, many real-world problems are "multimodal" by nature, i.e.,
multiple satisfactory solutions exist. It may be desirable to locate many such
satisfactory solutions, or even all of them, so that a decision maker can
choose one that is most proper in his/her problem domain. Numerous techniques
have been developed in the past for locating multiple optima (global and/or
local). These techniques are commonly referred to as "niching" methods. A
niching method can be incorporated into a standard search-based optimization
algorithm, in a sequential or parallel way, with an aim to locate multiple
globally optimal or suboptimal solutions. Sequential approaches locate optimal
solutions progressively over time, while parallel approaches promote and
maintain formation of multiple stable subpopulations within a single
population. Many niching methods have been developed in the past, including
crowding, fitness sharing, derating, restricted tournament selection, clearing,
speciation, etc. In more recent times, niching methods have also been developed
for meta-heuristic algorithms such as Particle Swarm Optimization, Differential
Evolution and Evolution Strategies.

Most of existing niching methods, however, have difficulties that need to be
overcome before they can be applied successfully to real-world multimodal
problems. Some identified issues include: difficulties to pre-specify some
niching parameters; difficulties in maintaining found solutions in a run; extra
computational overhead; poor scalability when dimensionality and modality are
high. This special session aims to highlight the latest developments in niching
methods, bringing together researchers from academia and industries, and
exploring future research directions on this topic. We invite authors to submit
original and unpublished work on niching methods. Topics of interest include
but are not limited to:

- Theoretical developments in multimodal optimization
- Niching methods that incurs lower computational costs
- Handling the issue of niching parameters in niching methods
- Handling the scalability issue in niching methods
- Handling problems characterized by massive multi-modality
- Adaptive or parameter-less niching methods
- Multiobjective approaches to niching
- Multimodal optimization in dynamic environments
- Niching methods applied to discrete multimodal optimization problems
- Niching methods applied to constrained multimodal optimization problems
- Niching methods using parallel or distributed computing techniques
- Benchmarking niching methods, including test problem design and performance
metrics
- Comparative studies of various niching methods
- Niching methods applied to engineering and other real-world multimodal
optimization problems

Please note that we are NOT interested if the adopted task is to find
a single solution of a multimodal problem.

Furthermore, a companion competition on Niching Methods for Multimodal
Optimization will also be organized in conjunction with our special
session. See further information at:

http://www.epitropakis.co.uk/cec17-niching/competition/

The aim of the competition is to provide a common platform that encourages fair
and easy comparisons across different niching algorithms. The competition
allows participants to run their own niching algorithms on 20 benchmark
multimodal functions with different characteristics and levels of difficulty.
Researchers are welcome to evaluate their niching algorithms using this
benchmark suite, and report the results by submitting a paper to the associated
niching special session (i.e., submitting via the on-line submission system of
CEC'2017). In case it is too late to submit the paper (i.e., passing the
CEC'2017 submission deadline), author may submit their results in a report
directly to the special session organizers, in order to be counted in the
competition.

These events are supported by the newly established IEEE CIS Task Force on
Multi-modal Optimization (http://www.epitropakis.co.uk/ieee-mmo/)

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

- Paper Submission: 30 January 2017
- Notification of Acceptance: 6 March 2017

Paper Submission:

Manuscripts should be prepared according to the standard format and
page limit of regular papers specified in CEC'2017 and submitted
through the CEC'2017 website: CEC 2017 submissions. Special session
papers will be treated in the same way as regular papers and included
in the conference proceedings.

In the Main research topics drop-down menu please select:
*SS36: Niching Methods for Multimodal Optimization*

==========================
Organizers
==========================

Michael G. Epitropakis, Lancaster University, UK.
Xiaodong Li, RMIT University, Australia
Andries Engelbrecht, University of Pretoria, South Africa

**********************************************************
*
* 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 Sessions within the Stream OPTIMIZATION FOR PUBLIC TRANSPORT at IFORS 2017

Call for Sessions within the Stream

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

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

http://www.ifors2017.ca/

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

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

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

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

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


Anita and Marie

Marie Schmidt Anita Schöbel
Erasmus University Rotterdam University of Göttingen
schmidt2@rsm.nl schoebel@math.uni-goettingen.de
*********************************

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

[DMANET] Invitation to submit abstract or organize session in "Optimization for public transportation" stream at IFORS

Dear colleagues,
The deadline for abstract submission at IFORS is approaching (Feburary 10), but there is still time to submit an abstract, and even to organize a session on a public transportation optimization topic of your choice!

If you are interested in submitting an abstract or organizing a session in the stream "Optimization for public transportation", then please let us know, and we will send you an invitation code for the submission system. See also the attached call and the IFORS website http://ifors2017.ca/ for details!

Hope to see you at IFORS 2017!
Anita Schoebel and Marie Schmidt

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

[DMANET] Workshop on Algorithms and Structure for Sparse Graphs, Call for Participation

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

CALL FOR PARTICIPATION

Workshop on Algorithms and Structure for Sparse Graphs

July 14, 2017

University of Warsaw, Poland

URL: http://sparsity2017.mimuw.edu.pl/

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


The Workshop on Algorithms and Structure for Sparse Graphs

will take place on Friday, July 14, 2017 at University of Warsaw,

Poland as a satellite event of ICALP 2017 (July 10-13, 2017).


The goal of the workshop is to provide an opportunity to

present research, exchange ideas and foster collaboration

among researchers interested in algorithmic graph structure

theory, structure theory of sparse graphs and logic in

computer science.


The scientific program will consist of three invited lectures,

three contributed presentations and an open problem session.


Invited Lectures:


Dan Král', University of Warwick, England

Stephan Kreutzer, Technical University Berlin, Germany

Felix Reidl, North Carolina State University, USA


Registration is via the conference website of ICALP

http://icalp17.mimuw.edu.pl/


The registration fee will be about 50Eur, and covers

lunch and coffee breaks.



The organizers,


Michał Pilipczuk, University of Warsaw (michal.pilipczuk@mimuw.edu.pl)

Sebastian Siebertz, University of Warsaw (siebertz@mimuw.edu.pl)

**********************************************************
*
* 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, January 17, 2017

[DMANET] DICE-FOPARA 2017: Call for Papers

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

8th Workshop on Developments in Implicit Computational complExity and
5th Workshop on Foundational and Practical Aspects of Resource
Analysis
(DICE-FOPARA 2017)

Affiliated with ETAPS 2017
April 22 - 23, 2017, Uppsala, Sweden
http://cbr.uibk.ac.at/events/dice-fopara

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

OBJECTIVES

The first joint international workshop on Developments in Implicit
Computational complExity (DICE) and
FOundational and Practical Aspects of Resource Analysis (FOPARA) will be
held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS.

The DICE workshop explores the area of Implicit Computational Complexity
(ICC), which grew out from several proposals to use logic and formal
methods to provide languages for complexity-bounded computation (e.g.
Ptime, Logspace computation). It aims at studying the computational
complexity of programs without referring to external measuring
conditions or a particular machine model, but only by considering
language restrictions or logical/computational principles entailing
complexity properties.

The FOPARA workshop serves as a forum for presenting original research
results that are relevant to the analysis of resource (e.g. time, space,
energy) consumption by computer programs. The workshop aims to bring
together the researchers that work on foundational issues with the
researchers that focus more on practical results. Therefore, both
theoretical and practical contributions are encouraged. We also
encourage papers that combine theory and practice.

Given the complementarity and the synergy between these two communities,
and following the successful experience of co-location of DICE-FOPARA
2015 in London at ETAPS 2015, we will hold
the 8th Workshop on DICE and the 5th Workshop on FOPARA together at
ETAPS 2017.


TOPICS

The joint international DICE-FOPARA workshop serves as a forum for
presenting original and established research results that are relevant
to the implicit computational complexity theory and to the analysis of
resource (e.g. time, space, energy) consumption by computer programs.
The workshop aims to bring together the researchers that work on
foundational issues with the researchers that focus more on practical
results. Therefore, both theoretical and practical contributions are
encouraged, as well as papers that combine theory and practice.

Areas of interest to the workshop include, but are not limited to,
the following:

* type systems for controlling/inferring/checking complexity
* logical and machine-independent characterisations of complexity classes
* logics closely related to complexity classes
* linear logic
* semantics of complexity-bounded computation
* rewriting and termination orderings
* interpretation-based methods for implicit complexity
* programming languages for complexity-bounded computation
* theoretical foundations of program complexity analysis
* application of implicit complexity to security
* resource static analysis for embedded or/and critical systems;
* semantic methods to analyse resources, including quasi-interpretations;
* practical applications of resource analysis;
* resource analysis by term and graph rewriting.


SUBMISSIONS

We ask for submission of *regular papers* describing original work
(10--15 pages) or *extended abstracts* (2--6 pages) presenting already
published work or work in progress.

With respect to regular papers, submissions will be in particular
verified for
originality and novelty and the manuscript must not have been published,
nor is presently submitted, elsewhere. With respect of submissions of
extended abstracts already published manuscripts are acceptable, but
have to be within the scope of the workshop and potentially give rise to
lively discussions during the meeting.

After the workshop we plan to edit a special issue of DICE-FOPARA 2017
in a renown journal in conjunction with the 7th Workshop on Developments
in Implicit Computational complExity (DICE 2016).

Regular papers must be prepared using the LaTeX EPTCS class (see
http://eptcs.org/). Accepted regular papers will appear in an EPTCS
volume (application pending). Papers should be submitted electronically
via the submission page:

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


IMPORTANT DATES

Paper submission February 19, 2017
Notification March 19, 2017
Final versions due March 26, 2017
Workshop date April 22-23, 2017


CONFERENCE VENUE

The workshop will be held as a satellite workshop of European Joint
Conferences on Theory and Practice of Software 2017 (ETAPS 2017) which
takes place in Uppsala, Sweden.

PROGRAM COMMITTEE

Beniamino Accattoli (Paris)
Guillaume Bonfante (Nancy, co-chair)
Marko van Eekelen (Nijmegen)
Marco Gaboardi (Buffalo)
Dan Ghica (Birmingham)
Clemens Grelck (Amsterdam)
Charles Grellois (Bologna)
Nao Hirokawa (JAIST)
Jan Hoffmann (CMU)
Thomas Jensen (Rennes)
Björn Lisper (Mälardalen)
Hans-Wolfgang Loidl (Edinburgh)
Georg Moser (Innsbruck, co-chair)
Kazushige Terui (Kyoto)
Simon Wegener (Saarbrücken)
Florian Zuleger (Vienna)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

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

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

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

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


Topic:

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


Requirements:

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

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

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

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

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

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

[DMANET] Special issue of Discrete Applied Mathematics: CTW 2016 (deadline 31st March 2017)

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

Discrete Applied Mathematics

Special Issue: 14th Cologne-Twente Workshop on
Graphs and Combinatorial Optimization (CTW 2016)

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

The 14th edition of the Cologne-Twente Workshop on Graphs and
Combinatorial Optimization (CTW 2016, http://http://ctw16.di.unimi.it/)
was held on June 6-8, 2016 at Palazzo Feltrinelli in Gargnano, Italy,
a historical building belonging to the University of Milan.

Following the tradition of previous CTWs, a special issue of
Discrete Applied Mathematics will be devoted to a selection of papers
on topics related to the themes of the workshop (graph theory,
combinatorial optimization and the design and analysis of algorithms).

All interested researchers are invited to contribute to this special issue.
Submissions of contributions not presented at the workshop are also welcome.

All articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.

The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify
that the paper is a contribution for the Special Issue of CTW 2016,
so that your paper is assigned to the guest editors. Please see the
Author Instructions on the site if you have not yet submitted a paper
through this web-based system. Be sure to note that your work is intended
for the Special Issue and to select the article type SI: CTW 2016.

The deadline for submission is March 31, 2017.

Accepted papers will be published online individually, before print
publication.
We are looking forward to receiving your contribution.

The Guest Editors,

Alberto Ceselli
Roberto Cordone


**********************************************************
*
* 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] Position in extremal graph theory in Prague

Position in Extremal Graph Theory


We are seeking researchers/postdocs or PhD-intershipsto complement the
team for the junior project "Extremal graph theory and its applications"
funded by the Czech Science Foundation. We are looking for strong
candidates with background in extremal graph theory, theory of random
graphs, or theory of graph limits. The position isfromFebruary2017, or
later, till December 2017.There are no teaching duties. Among the
conditions imposed by the Czech Science Foundation there is an age limit
of 35 (with possible exceptions for well-documented maternity/parental
leave or long lasting illness).


The project takes place in Prague at the Institute of Computer Science
http://www.ustavinformatiky.cz/?id_jazyk=en&id_stranky=of the Czech
Academy of Sciences. The web-pages of the group can be found under the
following link http://uivty.cs.cas.cz/ExtrA.


Please send your application with your CV and proof of education to
ics@cs.cas.cz <mailto:ics@cs.cas.cz>. Informal inquires can be sent to
Diana Piguet (piguet@cs.cas.cz <mailto:piguet@cs.cas.cz>) or to Tuan
Tran (tran@cs.cas.cz <mailto:tran@cs.cas.cz>). The position isopen 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] [GECCO 2017] SIGEVO SUMMER SCHOOL S3

*S I G E V O S U M M E R S C H O O L *

For GECCO students!
We have grants to ease your participation!

.......... *Held along with ACM GECCO 2017 Conference* ..........

July 14-20-21 (plus activities in July 15-19) BERLIN


>>> *Only 30 positions are available for students*: tell us on your
participation during the registration process of GECCO 2017 <<<

*Call for Participation*


SIGEVO is a special interest group of ACM always looking for new ways to
improve the research and learning on genetic and evolutionary computation.

In this quest for disseminating the knowledge and making activities in
this domain we will organize, for the first time, a Summer School around
GECCO 2017 in Berlin: S3 (Sigevo Summer School).


We seek for PhD students to participate in this great event, offering:

1. One day before GECCO (July 14th), with lectures and interactions to
world class researchers in this domain.

2. Two days after GECCO (July 20th and 21st) of discussions,
presentations, and joint works.

3. Oriented interactions and learning in tutorials and sessions of GECCO.

4. Great networking opportunities and up to 6 awards to recognize
outstanding performance.


The many appealing activities during S3 will include:

- A first day (get together) where students will meet each other, form
groups, and listen to short lessons. An assignment will be done to
students and links for a close interaction to mentors will be created
for the whole school and conference duration.

- Questions, competitions and awards (economic plus diploma prizes) will
be offered to the students who perform the best, granted at the end of
the summer school. We have up to 6 awards in different categories: come
and participate!

- Opportunities to attend a big number of high quality GECCO tutorials
plus continuous interaction to the summer school staff and mentors, what
will raise the abilities and vision of students: don't miss this.

- The first day after GECCO, students will discuss with mentors, so as
to finish their assignments. Also, the staff in S3 will evaluate during
this day the solution to the questions made the first day and offer, on
the very last day, the results and winners.

- The last day of the summer school (two days after GECCO) students will
present their assignments to the whole board of mentors. Enjoy this
boosting to your knowledge, your PhD thesis, and your networking to this
community!


*STUDENTS ARE EXPECTED TO:*

- Attend *ALL* the 1+2 days of S3, plus attending some tutorials and
sessions of GECCO 2017.

- Have a valid registration to GECCO itself, plus a small fee of 100
euros to participate in the school.

- Fulfill an assignment, participate in the school challenges, and
follow the standards of proper social and research behavior.


Students of the S3 will be eligible for travel, register and lodging
grants of GECCO.

See the special section on S3 that will appear soon in the web page of
GECCO: http://gecco-2017.sigevo.org/index.html/Summer+School

Any comments or questions on the school organization, please contact
Prof. Enrique Alba (eat@lcc.uma.es).

Cheers,

Prof. Enrique Alba
University of Malaga
SPAIN

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 2017
*********************************


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

Monday, January 16, 2017

[DMANET] Final Call for Papers: ISSAC 2017

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

ISSAC 2017

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

FINAL CALL FOR PAPERS

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


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

The International Symposium on Symbolic and Algebraic Computation is
the premier conference for research in symbolic computation and
computer algebra. ISSAC 2017 will be the 42nd meeting in the series,
which started in 1966 and has been held annually since 1981. The
conference presents a range of invited speakers, tutorials, poster
sessions, software demonstrations and vendor exhibits with a
centerpiece of contributed research papers.

ISSAC 2017 is held on 25-28 July 2017 at the University of
Kaiserslautern, Germany. Tutorial Sessions will be held on July 25-th
2017.

Important Dates: (DEADLINES EXTENDED!)
----------------

Abstract submission: January, 28 2017
Paper submission: February, 4 2017
Notification of acceptance/rejection: April 13, 2017
Camera-ready copy due: May 2, 2017.


Invited Speakers
----------------

Mark van Hoeij (Florida State University, USA)
Gabriele Nebe (RWTH Aachen, Germany)
James Worrell (University of Oxford, UK)


Submission Instructions
-----------------------

ISSAC 2017 invites the submission of original research contributions
to be considered for publication and presentation at the conference.
Papers should not duplicate work published or submitted for
consideration elsewhere.

Papers must be in English and should not exceed 8 pages in either the
(old) ACM
sig-alternate.cls style or the (new) ACM acmart style file (with option
"sigconf"), found at
http://www.acm.org/publications/proceedings-template


Submissions in other article styles are also accepted, but the final
version must be at most 8 pages when compiled in sig-alternate.cls
style (equivalent to about 17 pages of letter size paper, typeset in
12pt with normal spacing and reasonably large margins). Extended
abstracts are not allowed. Papers may have an appendix that may be
read by the reviewers and PC members at their discretion, but will
not be included in the published version of the paper. At least one
author of each accepted paper must register for the conference and
present the paper.

Submission is via EasyChair, at the web site
https://www.easychair.org/conferences/?conf=issac2017

Topics
---------

All areas of computer algebra and symbolic mathematical computation
are of interest. These include, but are not limited to:

Algorithmic aspects:

* Exact and symbolic linear, polynomial and differential algebra
* Symbolic-numeric, homotopy, perturbation and series methods
* Computational algebraic geometry, group theory and number theory
* Computer arithmetic
* Summation, recurrence equations, integration, solution of ODEs & PDEs
* Symbolic methods in other areas of pure and applied mathematics
* Complexity of algebraic algorithms and algebraic complexity


Software aspects:

* Design of symbolic computation packages and systems
* Language design and type systems for symbolic computation
* Data representation
* Considerations for modern hardware
* Algorithm implementation and performance tuning
* Mathematical user interfaces


Application aspects:

* Applications that stretch the current limits of computer algebra
algorithms or systems, use computer algebra in new areas or new
ways, or apply it in situations with broad impact.


Conference Organization
-----------------------

General Chair: Chee Yap (Courant Institute, New-York University, USA)
Program Committee Chair: Mohab Safey El Din (University Pierre and Marie
Curie, France)
Local Arrangement Chair: Wolfram Decker and Claus Fieker (University of
Kaiserslautern, Germany)
Publicity Chair/Webmaster: Michael Sagraloff (MPI fur Informatics)

Program Committee
-----------------

Hirokazu Anai (Fujitsu Laboratories Ltd and Kyushu University, Japan)
Christian Eder (University of Kaiserslautern, Germany)
Ioannis Emiris (National Kapodistrian University of Athens, Greece)
Xiao-Shan Gao (Chinese Academy of Sciences, China)
Mark Giesbrecht (University of Waterloo, Canada)
Jaime Gutierrez (University of Cantabria, Spain)
Mioara Joldes (LAAS-CNRS, France)
Pierre Lairez (Inria Saclay Ile-de-France, France)
Anton Leykin (Georgia Tech, USA)
Erich Kaltofen (North Carolina State University, USA)
Gregor Kemper (Technical University of Munich, Germany)
Christoph Koutschan (RICAM, Austrian Academy of Sciences, Austria)
Daniel S. Roche (United States Naval Academy, USA)
Mohab Safey El Din (University Pierre and Marie Curie)
Eric Schost (University of Waterloo, Canada)
Vikram Sharma (Institute of Mathematical Sciences, India)
Pierre-Jean Spaenlehauer (Inria Nancy-Grand Est, France)
Adam Strzebonski (Wolfram Research, USA)
Caroline Uhler (Massachussets Institute of Technology, USA)
Lihong Zhi (Chinese Academy of Sciences, China)

**********************************************************
*
* 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] ICMMI 2017: 5th International Conference on Man-Machine Interactions

___________________________________________________________________________________
ICMMI 2017 CALL FOR PAPERS
THE 5th INTERNATIONAL CONFERENCE ON MAN-MACHINE INTERACTIONS ICMMI 2017
October 3-6, 2017
Cracow, Poland
http://icmmi.polsl.pl

Organised by the [Please accept apologies if you get multiple copies
of this message]
[Please feel free to forward this call to any parties and link the
conference website to your own website]

___________________________________________________________________________________
ICMMI 2017 CALL FOR PAPERS
THE 5th INTERNATIONAL CONFERENCE ON MAN-MACHINE INTERACTIONS ICMMI 2017
October 3-6, 2017
Cracow, Poland
http://icmmi.polsl.pl

Organised by the Institute of Informatics, the Silesian University of
Technology, Gliwice, Poland (http://inf.polsl.pl/) and the Institute
of Theoretical and Applied Informatics, Polish Academy of Sciences,
Gliwice, Poland (https://iitis.pl/en).
__________________________________________________________________________________________

It's our pleasure to invite you to submit a paper to ICMMI 2017
Conference! The conference submission website via Easy Chair has been
opened. Please, use the following link to submit your paper to the
ICMMI Conference: https://easychair.org/conferences/?conf=icmmi2017

ABOUT THE CONFERENCE
The aim of the Conference is to bring together scientists interested
in all aspects of theory and practice of Man-Machine Interactions,
providing an international forum for exchanging ideas, setting
questions for discussion, and sharing the experience and knowledge
among wide community of scientists.

SCOPE
Novel and innovative work in areas including but not limited to tracks:

- Computational intelligence
fuzzy set,
rough sets,
near sets,
intelligent systems,
evolutionary computation,
neural networks,
deep learning,
soft computing,
soft control.

- Data mining and decision support
machine learning,
knowledge discovery,
big data analysis,
advances in expert systems,
autonomous agents,
support vector machines,
man-machine automation.

- AI and simulations in biosciences
bioinformatics,
computer modelling in biology,
perceptual systems,
telemedicine and e-health,
mechatronics and bio-mechatronics,
bio-sensors.

- Assistive technologies
e-learning for disabled,
accessible computer hardware,
computer software for disabled,
robots and devices for disabled,
accessible Internet,
adaptive and intuitive interfaces.

- Data processing, storage and transfer
data warehouses,
data storage and retrieval,
data mining,
knowledge engineering,
computer networks and communication systems,
microcontrollers and microsystems,
multimedia systems,
compression techniques,
system integration,
signal processing and analysing,
Internet of Things.

- Pattern recognition
computer vision,
image recognition,
image processing,
topology of images,
voice recognition and processing.

IMPORTANT DATES
Full paper submission: February 15, 2017
Notification of acceptance/rejection: April 16, 2017
Final paper submission, registration and fee due: April 30, 2017
Conference: October 3-9, 2017

SOLICITED PAPERS
Authors are encouraged to submit technical papers describing original,
previously unpublished research work in the area of Man-Machine
Interactions, not currently under review by another conference or
journal. Both theoretical and applied papers are of interest for the
conference.
Full papers (up to 10 pages) should describe results and original
research work not submitted or published elsewhere in one of the main
categories listed above. The papers should properly place the work
within the field, cite related work and clearly indicate the
innovative aspects of the work and the contribution to the field.

SUBMISSION OF PAPERS
Papers must be submitted electronically via EasyChair conference
management system. The submission Web page for ICMMI 2017 is
https://easychair.org/conferences/?conf=icmmi2017.
Only papers in PDF will be accepted for reviewing. All papers must
include title, complete contact information of all the authors,
abstract and keywords on the cover page. The corresponding author must
be clearly identified. Further information is available at the
conference web site. Final versions of manuscripts must be prepared
with LaTex2e (use Springer class llncs.cls).

PUBLICATION
All accepted papers will be published in the Conference Proceedings by
Springer-Verlag in Advances in Intelligent Systems and Computing
** AISC Series is indexed by ISI Proceedings (Web of Science), DBLP.
Ulrich's, EI-Compendex, SCOPUS, Zentralblatt Math, MetaPress,
Springerlink **

CONTACT
ICMMI 2017 Secretariat
Institute of Informatics
Faculty of Automatic Control, Electronics and Computer Science
Silesian University of Technology
Akademicka 16
44-100 Gliwice, Poland
E-mail: icmmi@polsl.pl
fax: (+48) 32 237 27 33

If you feel you are qualified to be our reviewer, please contact us.

The Organisers invite you to visit the Conference website and submit a
paper to the ICMMI 2017 Conference!

--
Mobile: +48 506 851 036
Skype: jarekadam
WWW: https://iitis.pl/~miszczak Gliwice, Poland and the Institute of
Theoretical and Applied Informatics, Polish Academy of Sciences,
Gliwice, Poland (https://iitis.pl).
**********************************************************
*
* 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] Spring School "Optimization and Data Science" in Novi Sad, March 13-17, 2017

Dear colleagues,

We would like to announce that the COST Action TD1207 on "Mathematical
Optimization in Decision Support Systems for Efficient and Robust Energy
Networks", http://www.energy-opt.eu/, will be holding a

Spring School on Optimization and Data Science

Date: March 13-17, 2017
Location: Novi Sad, Serbia
Website: http://www.optdata-springschool.com

The training school will highlight the strong algorithmic connections
between the fields of optimization and machine learning and showcase
innovative applications at their interface. The goal is to equip
students both with a theoretical understanding and hands-on programming
experience.

Topics:
- Convex optimization in machine learning
- Mixed-integer programming and exact ML models
- Adaptive general regression and classification in the big data context
- Deep learning software packages: CNTK, Tensorflow, Theano, ...
- Applications in transportation, logistics, and healthcare
- Artificial neural networks in theory and practice
- Genetic algorithms in neural network optimization
- Traditional data analysis techniques: seriation, regression, frequent
itemsets, and their combinatorial structure
- Parallelization methods and their bottlenecks
- Optimization and cloud computing
- ...

Confirmed speakers:
- Tim Conrad, Freie Universität Berlin
- Maria Pia Fanti, Politecnico di Bari
- Robert Gower, Ecole Normale Superieure
- Utz-Uwe Haus, Cray EMEA Research Labs
- Daniel Hulme, SATALIA
- Philipp Hungerländer, Univ. Klagenfurt
- Filip Kulić, University of Novi Sad
- Milan Rapaić, University of Novi Sad
- ...


Registration is FREE and closes on Monday, February 20th, or when all
places are filled. The registration form will open soon.

A limited amount of travel support for students is available. In order
to apply, please send your CV, a brief motivation letter, and a
recommendation of your supervisor to optdata@optdata-springschool.com.


We are looking forward to welcoming you in Novi Sad!

The main organizers:

Milena Petković, Željko Kanović, Zoran Jeličić
Faculty of Technical Sciences, University of Novi Sad

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

[DMANET] Workshop Women in Optimization

Liebe Kolleginnen und Kollegen,

vom 20. - 22. Maerz 2017 findet in Trier der zweite Workshop „Women in
Optimization" statt. Der Workshop richtet sich an
Nachwuchswissenschaftlerinnen, Doktorandinnen und Studentinnen der
Mathematik mit dem Schwerpunkt Optimierung. Das Ziel des Workshops liegt
sowohl in der fachlichen Weiterbildung als auch in der Vernetzung
innerhalb der Optimierungscommunity.

Neben Fachvortraegen eingeladener Referentinnen bietet der Workshop viel
Raum fuer wissenschaftliche Diskussionen und Erfahrungsaustausch. Im
Rahmen von Postersessions wird Nachwuchswissenschaftlerinnen
die Moeglichkeit zur aktiven Teilnahme gegeben.

Detaillierte Informationen finden Sie auf der Workshop-Homepage:

http://alop.uni-trier.de/event/women-in-optimization/

Es wuerde uns freuen, wenn Sie diese Information an
Nachwuchswissenschaftlerinnen (fortgeschrittenes Master-Level bi
Postdoc-Level) der mathematischen Optimierung weiterleiten wuerden.

Mit freundlichen Gruessen

Luise Blank, Universitaet Regensburg
Debora Clever, ABB AG, Forschungszentrum Ladenburg
Mirjam Duer, Universitaet Trier
Barbara Kaltenbacher, Universitaet Klagenfurt
Katja Mombauer, Universitaet Heidelberg
Sonja Steffensen, RWTH Universitaet Aachen
Andrea Walther, Universitaet Paderborn

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

[DMANET] CfP&S Telecommunications Stream - IFORS 2017

Call for Presentations and Sessions

Telecommunications Stream
IFORS 2017 - 21st Conference of the International Federation of
Operational Research Societies

Quebec City, July 17 - 21 2017
--------------------------------------------------------------------------------------------------------------------

We invite you and any interested colleagues to organize a session (at
least 3 abstracts/presentations) or a contributed presentation for the
Telecommunications Stream at the IFORS 2017 in Quebec City.

The focus of the Telecommunications Stream is broad and encompasses
applied and theoretical work in computer science, operations research,
management science, information systems, etc. Example topics are, but not
limited to: telecommunications modeling, policy, and technology, network
economics, network design, algorithms and optimization, sensor networks,
wireless and broadband networks, vehicle and mobile computing, semantic
networks, network survivability and reliability, information security and
privacy, quality of service, internet and multimedia, data mining
applications in telecommunications networks.

If you would like to organize a session, please contact Fabio
D'Andreagiovanni, Stan Dimitrov, or Ivana Ljubic (see below) as soon as
possible. If you would like to submit a single presentation, please email
(see below) the title and authors to either of us and you will be sent
information on what to enter in the IFORS conference abstract submission
system. The deadline for entry into that system for the conference is
February 10th, 2017, but you should send us the information before
February 3rd, 2017.

Please submit your abstracts as soon as possible to help in the scheduling
process.

We look forward to seeing you in Quebec City!

The Stream Organizers

Fabio D'Andreagiovanni
CNRS, Sorbonne University - UTC
d.andreagiovanni@hds.utc.fr

Stanko Dimitrov
University of Waterloo
sdimitrov@uwaterloo.ca

Ivana Ljubic
ESSEC Business School
ivana.ljubic@essec.edu


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

[DMANET] Stellenausschreibung Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM

S T E L L E N A U S S C H R E I B U N G Die Abteilung Optimierung des
Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM in
Kaiserslautern entwickelt individuelle Lösungen zur Planung und
Entscheidungsunterstützung für Probleme der Logistik,
Ingenieurwissenschaften und Lebenswissenschaften in Zusammenarbeit mit
Wissenschaftlern und Industriekunden. Dabei wird eine enge Integration
von Modellierung, Simulation, Optimierung und Entscheidungsunterstützung
realisiert. Wir suchen zum nächstmöglichen Zeitpunkt *WISSENSCHAFTLICHE
MITARBEITERINNEN / WISSENSCHAFTLICHE MITARBEITER IM BEREICH
„MODELLIERUNG, SIMULATION, OPTIMIERUNG VON KONTINUIERLICHEN
PRODUKTIONSPROZESSEN" *WISSENSCHAFTLICHE MITARBEITERINNEN /
WISSENSCHAFTLICHE MITARBEITER IM BEREICH „MODELLIERUNG, SIMULATION,
OPTIMIERUNG VON DISKRETEN PRODUKTIONS- UND PLANUNGSPROZESSEN"
Voraussetzungen sind * ein überdurchschnittlicher Hochschulabschluss in
(Techno-/ Wirtschafts-) Mathematik, Physik, Statistik oder Informatik, *
eine starke Neigung zu angewandter Mathematik im gewählten
Themenbereich, * Programmierkenntnisse (Matlab, C++, C#, oder Java) oder
die Bereitschaft sich diese eigenverantwortlich anzueignen, * sichere
Sprach- und Präsentationskompetenz in Deutsch und Englisch. Die genauen
Themenbeschreibungen können Sie unseren Stellenausschreibungen
entnehmen. Was Sie erwarten können Die Tätigkeit wird in einem kreativen
Team stattfinden, das unterschiedlichste Probleme aus der Praxis
hochmotiviert und innovativ löst. Die Ergebnisse der Arbeit können mit
Industriepartnern direkt in der Praxis erprobt und umgesetzt werden.
Anstellung, Vergütung und Sozialleistungen basieren auf dem Tarifvertrag
für den öffentlichen Dienst (TVöD). Zusätzlich kann Fraunhofer
leistungs- und erfolgsabhängige variable Vergütungsbestandteile
gewähren. Die Stelle ist zunächst auf zwei Jahre befristet. Die
wöchentliche Arbeitszeit beträgt 39 Stunden. Schwerbehinderte Menschen
werden bei gleicher Eignung bevorzugt eingestellt. Die
Fraunhofer-Gesellschaft legt Wert auf die berufliche Gleichstellung von
Frauen und Männern. Das Fraunhofer-ITWM zeigt ein außerordentliches
Engagement für ein familienfreundliches Arbeitsumfeld seiner
Mitarbeiterinnen und Mitarbeiter: *Flexible Arbeits- und Elternzeiten,
*Kindertagesstätte, *die Möglichkeit zum Homeoffice, *die Organisation
von Gesundheitstagen und Sportangeboten *sowie ein Eltern-Kind-Büro
machen das Fraunhofer ITWM in Kaiserslautern zu einem attraktiven
Arbeitgeber. Fraunhofer ist die größte Organisation für
anwendungsorientierte Forschung in Europa. Unsere Forschungsfelder
richten sich nach den Bedürfnissen der Menschen: Gesundheit, Sicherheit,
Kommunikation, Mobilität, Energie und Umwelt. Wir sind kreativ, wir
gestalten Technik, wir entwerfen Produkte, wir verbessern Verfahren, wir
eröffnen neue Wege. Die detaillierten Stellenausschreibungen finden Sie
unter

https://recruiting.fraunhofer.de/Vacancies/29505/Description/1
https://recruiting.fraunhofer.de/Vacancies/29765/Description/1

Bitte wenden Sie sich mit Fragen an:

Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM

Abteilung Optimierung

Prof. Dr. Karl-Heinz Küfer

Fraunhofer-Platz 1

D-67663 Kaiserslautern

https://www.itwm.fraunhofer.de/abteilungen/optimierung/mitarbeiter/prof-dr-karl-heinz-kuefer.html
<http://www.itwm.fraunhofer.de/en/departments/optimization/employees/prof-dr-karl-heinz-kuefer.html>

Weitere Informationen finden Sie außerdem auf unserer Webseite

- Fraunhofer ITWM: https://www.itwm.fraunhofer.de/
<http://www.itwm.fraunhofer.de/>

- Abteilung Optimierung
https://www.itwm.fraunhofer.de/abteilungen/optimierung.html
<http://www.itwm.fraunhofer.de/en/departments/optimization.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] CP2017: Call for Workshops

CP2017: Call for Workshops
--------------------------

The CP conference is the premier annual international conference on constraint
programming. It is concerned with all aspects of computing with constraints,
including but not limited to algorithms, environments, languages, models,
systems, theory, and applications such as decision making, resource allocation,
configuration, planning, and scheduling.

We invite proposals for workshops associated to the main conference program of
CP 2017, which will be held in Melbourne (Australia) from August 28 to
September 1, 2017, colocated with SAT 2017 (http://sat2017.github.io) and ICLP
2017 (http://iclp2017.a4lp.org), and following IJCAI 2017
(http://ijcai-17.org).

The purpose of the CP workshops is to provide an informal venue in which
participants can:

- explore specific research areas in depth,
- discuss new research directions,
- study specific application areas of CP, or
- bring together researchers from different fields with shared interests.

In previous years, workshop topics included data analytics, smart cities,
packing & placement, cloud computing, configuration, teaching, testing &
verification, bioinformatics, constraint-based modelling, CP solvers,
cross-fertilisation with other solving technologies, etc. We encourage
proposals for workshops on new topics, especially multi-disciplinary ones.

Based on successful experiments made in the last three years, we particularly
encourage workshops that break away from the tradition of reviewing
("publishing") and presenting submitted papers: instead, the better attended
workshops tended to foster much more interaction by having several invited
talks, if not introductory or specialist tutorials, and/or presentations
selected only on the basis of brief submitted abstracts. We encourage any other
innovations that are likely to increase the audience and interaction.

All workshops will take place at the site of the main conference, and follow
either a half-day format or a full-day format.

Incubator Workshop
------------------

The Association for Constraint Programming (ACP) will provide a sponsorship for
an Incubator Workshop. An Incubator Workshop should address a promising novel
topic, be multi-disciplinary in nature, and have the aim to broaden the
application of CP or deepen its methodologies. The ACP will make 1,500 euros
available for this purpose.

The call for Incubator Workshop will be issued by the ACP. Workshop organizers
who want to apply as an Incubator Workshop should check the ACP specific call
and follow its guidelines, and also submit their Workshop as described below.

Important Dates (for proposers of Workshop)
-------------------------------------------

- March 27, Workshop proposal submission deadline
- April 10, Workshop acceptance notification
- May 13, Workshop webpage available on CP website
- May 13, First call for papers (or abstracts, participation...)
- July 2017, Early registration deadline (accepted speakers must have received
notifications)
- August 28, CP 2017 Workshops

The exact schedule for workshops will be confirmed in due time.

Proposal Format
---------------

Each workshop proposal should include the following information, in a single
PDF file or in plain text

- Title
- Abstract outlining the goals and scope of the workshop
- Description of the target audience
- Motivation for running the workshop at CP 2017
- If the workshop also applies as Incubator workshop, motivation for this
- Estimate of the number/list of (invited) speakers, tutors, and participants
- History of the workshop (if applicable), with the number of applications and
the number of attendees (if available)
- Tentative duration of the workshop: half day or full day
- Relevant chairing experience of the main organizers (if any)
- Organizing committee members (if already known)
- Contact information of the main organizers

The Workshop Chair will acknowledge receipt of the proposal.

Responsibilities of the Workshop Organizers
-------------------------------------------

1. Creating several calls for abstracts (or papers) and calls for
participation, and distributing them on specialist channels not used by the
Publicity Chair of CP 2017.
2. The call for abstracts (or papers), if any, must clearly describe the review
& selection process and indicate that at least one author of every accepted
abstract (or paper) must attend the workshop and pay the workshop fee;
otherwise the presentation (and paper) will be withdrawn from the
proceedings, if any, and program.
3. Creating and publishing, in a timely manner, a webpage at the CP 2017
website, including all the relevant calls and information pertaining to the
workshop.
4. Providing a short description for the conference program.
5. Reviewing and selecting abstract (or paper) submissions.
6. Scheduling the presentations within the workshop.

It should be noted that the conference organization does not budget for free
registration, accommodation, or travel expenses for the workshop organizers or
their invited speakers. The workshop organizers should therefore secure any
source of funding or sponsorship deemed necessary for their invited speakers
(if any).

Responsibilities of the CP 2017 Organizing Committee
----------------------------------------------------

- Provide publicity for the workshop program as a whole.
- Provide logistics at the conference venue (meeting room, catering, etc.).
- Coordinate the allocation of time blocks for each workshop.
- Collect the workshop fees covering the rental and catering costs.
- Publicize the workshop calls with the help of the Publicity Chair.

Submission Process
------------------

Please send your proposal of Workshop by email to the CP 2017 Workshop Chair
(Charlotte Truchet, Charlotte.Truchet@univ-nantes.fr).


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

Sunday, January 15, 2017

[DMANET] 8th International Network Optimization Conference (INOC2017) ( 2nd announcement for extended abstracts)

International Network Optimization Conference 2017, INOC 2017

February 26-28, Lisboa, Portugal

[http://inoc2017.fc.ul.pt<http://inoc2017.fc.ul.pt/]http://inoc2017.fc.ul.pt<http://inoc2017.fc.ul.pt/>


Call for papers:
The paper submission for the Electronic Notes in Discrete Mathematics (ENDM) number is now closed but the authors are invited to submit 1-2 pages Extended Abstracts. The accepted Extended Abstracts will be available in the conference material.

Important dates:
- ENDM (full) paper submission deadline: (closed)
- Extended abstract submission deadline: January 20, 2017
- Acceptance Notification: January 25, 2017
- Early Registration: January 31, 2017


The 8th International Network Optimization Conference will take place in Lisbon, Portugal, February 26-28, 2017. The aim of this conference is to provide researchers from different areas of Operations Research, with the opportunity to present and discuss their results and research on the field of Network Optimization, in an inspiring and bridge building environment where fruitful ideas may flow freely.

INOC is the conference of the European Network Optimization Group (ENOG), a working group of EURO and the previous editions were held in Warsaw (2015), Tenerife (2013), Hamburg (2011), Pisa (2009), Spa (2007), Lisboa (2005) and Paris (2003). The conference is also part of the activities of the CMAFCIO (the Centro de Matemática e Aplicações Fundamentais e Centro de Investigação Operacional), University of Lisbon.

Conference Chairs:
Luis Gouveia (Faculty of Sciences, University of Lisbon-CMAFCIO)
Pedro Moura (Faculty of Sciences, University of Lisbon-CMAFCIO)

Keynote speakers:
W. Cook, University of Waterloo (Canada)
A. Martin, Friedrich-Alexander-Universität (Germany)
R. Möhring, TU Berlin (Germany)
A. Schrijver, Univ. of Amsterdam (The Netherlands)

Contact email: contactinoc2017@fc.ul.pt<mailto:contactinoc2017@fc.ul.pt>


Looking forward to seeing you in Lisboa,

Luís Gouveia and Pedro Moura

**********************************************************
*
* 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] TTCS - First CFP

=========================================
Topics in Theoretical Computer Science (TTCS 2017)
http://www.ttcs.ir/

Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
September 12-14, 2017

*** Abstract Submission Deadline: May 1, 2017 ***
=========================================

TTCS is a bi-annual conference series, serving as a forum for novel
and high-quality research in all areas of Theoretical Computer
Science. The proceedings will be published in Springer LNCS
series. The conference is sponsored by EATCS and IEEE (Iran section).

------------------------------
Keynote Speakers
------------------------------

- Mahdi Cheraghchi, Imperial College, UK
- Jaco van de Pol, University of Twente, The Netherlands
- Stefano Leonardi, Sapienza University of Rome, Italy

------------------------------
Important Dates
------------------------------

- Abstract Submission: May 1, 2017
- Full Paper Submission: May 8, 2017
- Author notification: June 26, 2017
- Camera ready paper: July 31, 2017
- Conference: September 12-14, 2017

------------------------------
Submissions
------------------------------

For the main conference, we solicit research papers in all areas of
theoretical computer science. All papers will undergo a rigorous
review process and will be judged based on their originality,
soundness, significance of the results, and relevance to the theme of
the conference.

Papers should be written in English. Research papers should not exceed
15 pages in the LNCS style format. All technical details necessary
for a proper evaluation of a submission must be included in the
submission or in a clearly-labelled appendix, to be consulted at the
discretion of program committee members. Multiple and/or concurrent
submission to other scientific venues is not allowed and will result
in rejection as well as notification to the other venue. Any case of
plagiarism (including self-plagiarism from earlier publications) will
result in rejection as well as notification to the the authors'
institutions.

Papers should be submitted to the appropriate track through our EasyChair
submission website:
https://www.easychair.org/conferences/?conf=ttcs2017 .
The web site is open for submissions.

------------------------------
Scope
------------------------------

TTCS is organized in 2 tracks. Topics of interest include but are not
limited to:

Track A: Algorithms and Complexity

- algorithms and data structures,
- algorithmic coding theory,
- algorithmic graph theory and combinatorics,
- approximation algorithms,
- computational complexity,
- computational geometry,
- computational learning theory,
- economics and algorithmic game theory,
- fixed parameter algorithms,
- machine learning,
- optimization,
- parallel and distributed algorithms,
- quantum computing,
- randomness in computing,
- theoretical cryptography.

Track B: Logic, Semantics, and Programming Theory

- algebra and co-algebra in computer science,
- concurrency theory,
- coordination languages,
- formal verification and model-based testing,
- logic in computer science,
- methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems,
- stochastic and probabilistic specification and reasoning,
- theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking,
- theory of programming languages,
- type theory and its application in program verification.

------------------------------
Program Committee
------------------------------

Track A: Algorithms and Complexity

- Amitabha Bagchi, IIT Delhi, India
- Samuel R. Buss, University of California, San Diego, USA
- Jaroslaw Byrka, University of Wroclaw, Poland
- Amir Daneshgar, Sharif University of Technology, Iran
- Anna Gal, University of Texas at Austin, USA
- Mohammad T. Hajiaghayi, University of Maryland, USA
- Amit Kumar, IIT Delhi, India
- Mohammad Mahmoody, University of Virginia, USA
- Rolf Niedermeier, TU Berlin, Germany
- Giuseppe Persiano, University of Salerno, Italy
- Jorg-Rudiger Sack, Carleton University, Ottawa, Canada
- Rahul Santhanam, University of Oxford, United Kingdom
- Jiri Sgall, Charles University, Prague, Czech Republic (Co-Chair)
- Vijay Vazirani, Georgia Institute of Technology, Atlanta, USA
- Gerhard Woeginger, RWTH Aachen, Germany
- Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran

Track B: Logic, Semantics, and Programming Theory

- Farhad Arbab, CWI and Leiden University, The Netherlands
- Ilaria Castellani, INRIA Sophia Antipolis, France
- Fatemeh Ghassemi, University of Tehran, Iran
- Hossein Hojjat, Rochester Institute of Technology, USA
- Mohammad Izadi, Sharif University of Technology, Iran
- Sung-shik Jongmans, Open University, The Netherlands
- Ramtin Khosravi, University of Tehran, Iran
- Jan Kretinsky, Munich University of Techology, Germany
- Bas Luttik, Eindhoven University of Technology, The Netherlands
- Larry Moss, Indiana University, USA
- Mohammad Reza Mousavi, Halmstad University, Sweden (Co-Chair)
- Mehrnoosh Sadrzadeh, Queen Mary University of London, UK
- Gerardo Schneider, Chalmers and University of Gothenburg, Sweden
- Subodh Sharma, IIT Delhi, India
- Mirco Tribastone, IMT Institute for Advanced Studies, Itay
- Kazunori Ueda, Waseda University, Japan
**********************************************************
*
* 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/
*
**********************************************************

Several associate and assistant professorships in CS (including TCS) at KTH Royal Institute of Technology

​The School of Computer Science and Communication at KTH Royal Institute of Technology invites applications for a tenured associate professorship in computer science with a broad profile, covering all research areas currently represented at the school including theoretical computer science.

 

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general. It might also be worth mentioning that Sweden routinely scores at the absolute top in rankings of quality of life such as, e.g., the OECD Better Life Index (http://www.oecdbetterlifeindex.org/).

 

The application deadline is February 17, 2017. See http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:96024/where:4/ for the full announcement with more information and instructions how to apply. Informal enquiries about this position (and possibly about how to navigate the application procedure at KTH) are welcome and may be sent to Johan Hastad at johan@kth.se or Jakob Nordstrom at jakobn@kth.se.

 

It should also be pointed out that this is only one of several openings in computer science at KTH, including also, for instance:

 

- One tenured associate professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118880/where:4/

 

- One tenure-track assistant professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118874/where:4/

 

- One tenure-track assistant professorship in computer science with a specialization in machine learning http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118778/where:4/

 

All of these positions have an application deadline of February 17, 2017.​


[DMANET] [GECCO 2017] Two weeks left CFP - Genetic and Evolutionary Computation Conference 2017

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

*Call for Papers *

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

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

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

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

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

*Important Dates:*

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


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

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 2017
*********************************


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

Saturday, January 14, 2017

Job: Associate Professor/Professor of Automated Verification, with Tutorial Fellowship at St. John's College, University of Oxford

[Please forward to anyone interested. Apologies for multiple mailing.]

-----------------
Associate Professorship & Tutorial Fellowship of Automated Verification
Department of Computer Science, University of Oxford

Salary from: £45,562 p.a. (plus substantial benefits)

http://www.cs.ox.ac.uk/news/1237-full.html

Applications are invited for the post of Associate Professor (or
Professor) of Automated Verification to be held in the Department of
Computer Science starting as soon as possible. The successful candidate
will also be appointed as Fellow and Tutor in Computer Science at St.
John's College.

The Department of Computer Science is a vibrant and growing academic
department, which has a research profile across the entire spectrum of
contemporary computing. The Department is seeking to recruit an
Associate Professor in Computer Science, with a research specialism in
automated verification and synthesis, ideally complementing existing
expertise. This is an area of fundamental importance in the design,
evaluation and construction of software and systems (design flaws in
applications such as autonomous vehicles can have devastating
consequences, for example). The Associate Professor's research will
focus on developing theories and techniques to ensure system correctness
and employing them in novel application domains. The appointee will also
contribute to teaching on the Department's highly successful
undergraduate and graduate programmes.

The Associate Professor will be a member of both the University and the
St John's College community. They will be part of a lively and
intellectually stimulating research community which performs to the
highest international levels in research and publications and will have
access to the excellent research facilities which Oxford offers. They
will have a role to play in the running of the College as a member of
the Governing Body and a trustee of the College as a charity.

The successful candidate will hold a doctorate in Computer Science or a
cognate discipline. They will have the ability to teach across a range
of computer science subjects, and will also have a proven research
record of high quality at international level in the area of Automated
Verification and experience of research collaborations at both national
and international level.
Closing date for applications:
*** 12.00 noon on 3 March 2017. ***
Interviews will be held on 18 April – please allow a full day for these.
Further details:

http://www.cs.ox.ac.uk/news/1237-full.html

--
Professor Marta Kwiatkowska
Fellow of Trinity College
Department of Computer Science
University of Oxford
Wolfson Building, Parks Road
Oxford, OX1 3QD

Tel: +44 (0)1865 283509
Email: Marta.Kwiatkowska@cs.ox.ac.uk
URL: http://www.cs.ox.ac.uk/people/marta.kwiatkowska/

Personal Assistant: Jordan Summers Young
Email: Jordan.Summers@cs.ox.ac.uk
Tel: +44 (0)1865 610650

Friday, January 13, 2017

Recent Advances in Algorithms School: St. Petersburg, May 22=?UTF-8?Q?=E2=80=9326=2C_?=2017

Recent Advances in Algorithms
International Computer Science Student School
May 22–26, 2017, St. Petersburg, Russia


AIM OF THE SCHOOL

The school offers the unique opportunity to learn about recent breakthroughs 
in several domains of algorithms: from classical areas like network flow algorithms 
and longest paths in graphs to recently emerged areas like streaming algorithms 
and algorithms for high dimensional data. The lectures will be taught by the leading
researchers in these areas. Each of the tutorials will provide an introduction to the 
area and gradually bring to the current research frontiers.

The primarily audience consists of PhD students interested in Algorithms. 
Bright master students, postdocs, young researchers and even faculty 
are also very welcome.


LECTURERS

Michael Kapralov (EPFL)
Streaming Algorithms

Aleksander Mądry (MIT)
Graph Algorithms and Continuous Optimization

Ilya Razenshteyn (MIT)
Algorithms for High-Dimensional Data

Saket Saurabh (IMSc)
Longest Paths in Graphs: Parameterized Algorithms


VENUE

The school is hosted by St. Petersburg Department of V.A. Steklov Institute of Mathematics 
of the Russian Academy of Sciences which is located in the very center of St. Petersburg. 
St. Petersburg is particularly beautiful in the late spring — early summer, the white nights 
season. The city is surrounded by wonderful tsar parks and palaces; an excursion to one 
of them will be a social program of the school.


STAY TUNED

More details will be available soon. Please subscribe to the mailing list to receive the updates: