Thursday, December 14, 2017

[DMANET] CFP: COMSOC-2018 (Seventh International Workshop on Computational Social Choice)

First Call for Papers: Seventh International Workshop on Computational
Social Choice

(COMSOC-2018)
Troy, NY, USA, June 25--27, 2018

Webpage: www.cs.rpi.edu/~xial/COMSOC18/main.html

***********************************************************
MISSION
***********************************************************

Computational social choice is a rapidly growing discipline at the
interface of social choice theory and computer science. It is concerned
with the application of computational techniques to the study of social
choice mechanisms, and with the integration of social choice paradigms into
computing. The aim of the workshop is to bring together different
communities: computer scientists interested in computational issues in
social choice; people working in artificial intelligence and multiagent
systems who are using ideas from social choice to organize societies of
artificial software agents; logicians interested in the logic-based
specification and analysis of social procedures; and last but not least,
researchers coming from social choice theory itself: economists,
mathematicians and computer scientists.

***********************************************************
PAPER SUBMISSION
***********************************************************

Submissions of papers describing original or recently published work on all
aspects of computational social choice are invited. Topics of interest
include, but are not limited to computational issues that arise in the
analysis of

- Preference elicitation
- Preference representation languages
- Restricted preference domains
- Voting rules
-- axiomatic properties
-- manipulation, control and bribery
-- voting equilibria and dynamics
- Judgement aggregation
- Fair division and allocation
- Matching and coalition formation
- Opinion diffusion and aggregation on social networks
- Recommendation systems
- Software for collective decision-making

We welcome both theoretical and empirical work on these topics, including,
in particular, research on algorithms (exact, approximate, parameterized,
online and distributed), learning, logic, uncertainty and simulations in
the context of social choice.

Papers will have to be submitted electronically via Easychair. All
submitted papers will be reviewed by the program committee. Accepted
papers will be collected in informal workshop notes; however, the workshop
has no formal proceedings and the authors retain their copyright. Each
accepted paper will have to be presented by one of the authors, with the
constraint that each workshop participant gives at most one talk
(exceptions can be made due to unforeseen circumstances).

COMSOC-2018 will also include a poster session. Posters will be selected
based on abstracts. Unlike regular submissions, they will not be reviewed
by the program committee; the intention is to accept all posters that fall
within the scope of the workshop subject to space constraints. The details
of the poster session will be announced later.

Please contact either one of the program chairs in case of any questions:

o Edith Elkind (elkind@cs.ox.ac.uk)
o Lirong Xia (xialirong@gmail.com)


***********************************************************
IMPORTANT DATES
***********************************************************

o Paper submission deadline: March 1, 2018
o Notification of authors: early April, 2018
o Workshop dates: June 25-27, 2018

**********************************************************
*
* 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] 8 Postdoc Positions in Mathematics at TU Darmstadt, Germany

The department of mathematics at TU-Darmstadt offers 8 two year Postdoc
positions in any mathematical research field connected to the existing
research groups. Eligible are candidates that have international
experience, e.g., by a Ph.D. from a foreign university.

TU Darmstadt is a university with around 27,000 students. It features
many strong research fields, in particular, mechanical and electrical
engineering and mathematics. It is located in the middle-sized town
Darmstadt, near to Frankfurt in the attractive Main-Rhein area.

The Department of Mathematics at TU Darmstadt is very active and
involved in many scientific collaborations. The department is organized
into the working groups Algebra, Analysis, Applied Geometry, Didactics
of Mathematics, Logic, Numerical Analysis and Scientific Computing,
Optimization, and Stochastics. The positions are open to any research
topic, in particular, Mathematical Optimization.

For more information about the department, see

http://www3.mathematik.tu-darmstadt.de/index.php?id=5&L=1

For the application process, see

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

Wednesday, December 13, 2017

[DMANET] FAW 2018: Last Call For Papers

FAW 2018 Call for Papers

The 12th International Frontiers of Algorithmics Workshop (FAW 2018 , http://itcs.shufe.edu.cn/FAW2018) will be held on May 8-10, 2018 at Guangzhou, Guangdong Province, China. FAW 2018 will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

Keynote Speaker
Andrew Chi-Chih Yao (Tsinghua University)

Invited Speakers:
Yijia Chen (Fudan University)
Ran Duan (Tsinghua University)
Nick Gravin (Shanghai University of Finance and Economics)
Mingji Xia (Chinese Academy of Sciences)

Important Dates
Submission deadline Dec. 29, 2017 (23:59 Beijing Time)
Author Notification of acceptance Feb. 1, 2018
Final version due Feb. 19, 2018
Conference Dates May 8-10, 2018

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

Program Committee

Jianer Chen, co-chair
Pinyan Lu, co-chair
Hee-Kap Ahn
Georgios Barmpalias
Xiaohui Bei
Wenbin Chen
Yukun Cheng
Radu Curticapean
Ran Duan
Fedor Fomin
Mordecai J. Golin
Heng Guo
Xin Han
Iyad Kanj
Bundit Laekhanukit
Lap-Kei Lee
Minming Li
Bingkai Lin
Tian Liu
Neeldhara Misra
Kim Thang Nguyen
Pan Peng
Venkatesh Raman
Dominik Scheder
Dimitrios Thilikos
Changjun Wang
Ge Xia
Boting Yang
Chee Yap
Deshi Ye
Chihao Zhang
Jialin Zhang

Submission Guidelines and Publication Information

The submission deadline is December 29, 2017 (23:59 Beijing Time). All submissions are electronic via EasyChair, and the submission server is now available at https://easychair.org/conferences/?conf=faw2018.
Submissions must adhere to the following guidelines: Papers must be formatted using the LNCS style, file without altering margins or the font point. A submission should not exceed 12 pages, including references, but excluding the optional appendix. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Papers that deviate from these guidelines risk being rejected without consideration of their merits.
The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS), Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.

**********************************************************
*
* 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] Several Funded Doctoral Studentships in Oxford University's Department of Computer Science

Several Funded Doctoral Studentships in Computer Science at Oxford University

Several funded PhD positions are available in Oxford University's Department of Computer Science, supported by an ERC Starting Grant and a Royal Society Grant held by Standa Zivny. The goal of these projects is to understand the mathematics and computational complexity of constraint satisfaction problems (CSPs), mostly via the lens of convex relaxations (such as linear programming and semidefinite programming). The positions are available from 1 October 2018 and will be for 3 years (with the possibility of extension). The positions come with a travel support and no teaching duties (but the possibility of doing some teaching). The students will be members of Oxford's Algorithms and Complexity Theory Group. The candidates should have a first-class degree in mathematics or theoretical computer science. While there is no general deadline, applications received by 8 January will also be eligible for other sources of funding from Oxford's Department of Computer Science and thus will receive full consideration. Informal inquiries by email (standa.zivny@cs.ox.ac.uk <mailto:standa.zivny@cs.ox.ac.uk>) are welcome.

To apply, proceed as described in the link below and mention Standa Zivny in your application as the primary supervisor.

http://www.cs.ox.ac.uk/news/1371-full.html <http://www.cs.ox.ac.uk/news/1371-full.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] CSR 2018: Last Call for Papers

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

Last Сall for Papers
The 13th International Computer Science Symposium in Russia, CSR-2018
Moscow, Russia
June 6-10, 2018


---------------------------------
CSR is an annual conference that intends to reflect the broad scope of
international cooperation in computer science. The topics covered vary
from year to year, but in general try to cover as much of the
contemporary computer science as possible.

TOPICS

include, but are not limited to:

algorithms and data structures
combinatorial optimization
constraint solving
computational complexity
cryptography
combinatorics in computer science
formal languages and automata
algorithms for concurrent and distributed systems, networks
proof theory and applications of logic to computer science


---------------------------------
Important dates

Deadline for submissions: December 16, 2017 (23:59 anywhere on Earth).
Notification of acceptance: February 11, 2018.
Final Version: February 26 2018
Conference dates: June 6-10, 2018.


---------------------------------
Opening lecture

Noga Alon (Tel Aviv University, Israel)


---------------------------------
Invited lectures

Markus Bläser (Saarland University, Germany)
Vladimir Gurvich (Rutgers University, USA)
Alexander Kulikov (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Kurt Mehlhorn (Max-Planck-Institut für Informatik, Germany)
Michael Saks (Rutgers University, USA)
Rahul Santhanam (University of Oxford, UK)
László A. Végh (London School of Economics, UK)


---------------------------------
Submission and publication

Authors are invited to submit papers presenting original research in the
conference topics, in electronic form (pdf format) via EasyChair.

Submission server: https://easychair.org/conferences/?conf=csr2018

Submissions must be unpublished, not under review for publication
elsewhere, and provide sufficient information to judge their merits.

Submissions must be in English, and not exceed 12 pages, including the
title page, in Springer's LNCS LaTeX style (instructions available
here). Additional material, to be read at the discretion of reviewers
and PC members, may be provided in a clearly marked appendix or by
reference to a manuscript on a web site.

Accepted papers will be published in an LNCS volume by Springer.
Instructions for formatting camera-ready versions will be communicated
to the authors of accepted papers.
At least one of the authors must commit to presenting the paper at the
conference.

---------------------------------
Support

There is a funding to reduce the registration fee for students authoring
a paper in the conference.

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

Maxim Babenko (HSE and Yandex, Russia)
René van Bevern (Novosibirsk State University, Russia)
Mikołaj Bojańczyk (University of Warsaw, Poland)
Holger Dell (Saarland University, Germany)
Edith Elkind (Oxford, UK)
Fedor V. Fomin (University of Bergen, Norway), chair
Fabrizio Grandoni (IDSIA, Switzerland)
Dmitry Itsykson (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Mikko Koivisto (University of Helsinki, Finland)
Antonina Kolokolova (Memorial University of Newfoundland, Canada)
Alexander S. Kulikov (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Jakob Nordström (KTH Royal Institute of Technology, Sweden)
Alexander Okhotin  (St. Petersburg State University, Russia)
Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia)
Ilya Razenshteyn (Columbia University, USA)
Saket Saurabh (IMSC, India and University of Bergen, Norway)
Alexander Shen (LIRMM, France and IITP, Russia)
Arseny Shur (Ural Federal University, Russia)
Dirk Oliver Theis (University of Tartu, Estonia)
Meirav Zehavi (Ben-Gurion University of the Negev, Israel)

—————————————

Organizers

Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia),
conference chair
Alexey Milovanov (HSE, Russia)
Alexander Rubtsov (HSE, Russia)


---------------------------------
Steering Committee for the CSR series

Edward A. Hirsch (St.Petersburg, RU)
Juhani Karhumaki (Turku, FI)
Alexander S. Kulikov (St. Petersburg, RU)
Ernst W. Mayr (Munich, DE)
Alexander Razborov (Chicago, US and Moscow, RU)
Mikhail Volkov (Ekaterinburg, RU)


---------------------------------
Further information and contacts

Web: http://logic.pdmi.ras.ru/csr2018/
Email: csr2018@googlegroups.com.

---------------------------------
Previous CSR conferences


The list of previous CSR webpages can be found at
http://logic.pdmi.ras.ru/~csr/
**********************************************************
*
* 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 Scholarship on Multi-criteria Decision-Making and Optimisation at the University of Manchester, UK

***
PhD Scholarship on Multi-criteria Decision-Making and Optimisation at the
University of Manchester, UK
***

This PhD scholarship offers three years' funding, including tuition fees and
annual stipend of approximately £15,000 for candidates commencing their studies
in September 2018. The successful candidate will receive a generous research
support and conference allowance, and have access to a robust doctoral research
training programme, dedicated research resources, training in transferable
skills, visiting speaker seminar programme, and associate with existing
research centres and groups. Students are encouraged to undertake training and
development in teaching and deliver teaching/research assistantship duties on a
paid basis to further enhance their experience in preparation for their future
careers.

The Project
===========

In many strategic problems in logistics, managements, planning, and
manufacturing, a Decision Maker (DM) must find solutions that optimise
multiple, conflicting criteria and decide among them, which nowadays often
involves the DM interacting with some automated process implemented as a
Multi-criteria Decision-Making and Optimisation (MCDMO) algorithm. In reality,
decision-making is influenced by human factors (cognitive biases, fatigue,
mistakes) that have been thoroughly studied in behavioural economics and
psychology. The design of algorithms able to cope with these human factors
remains an open challenge.

This project aims to devise realistic, general "simulations" of DMs (machine
DMs) that explicitly model these human factors as configurable parameters,
independent of specific preferences. Machine DMs will enable the empirical
analysis of algorithms with respect to particular human factors. Parameters of
machine DMs may be explicitly set to mimic human behaviours (e.g. risk-averse
vs. risk-seeking). The ultimate goal is the development of the next generation
of data analytics and decision support methods that adapt to the human factors
prominent on particular problem scenarios, thus helping humans to make better
decisions.

Entry Requirements
==================

Applications are sought from exceptional UK, EU and international students with
an outstanding academic background, ideally in Computer Science, Mathematics,
Operations Research, Data Science, Business Analytics, Industrial Engineering,
Economics, or other discipline within business and operations management. The
successful candidate must have a strong programming background
(C/C++/Java/R/Python) and good analytical and communication skills. An
understanding of multi-criteria decision-making and/or mathematical and
heuristic multi-objective optimization techniques is highly desirable.


More information:
=================

http://www.jobs.ac.uk/job/BGK717/phd-scholarship-quantitative-models-of-realistic-human-decision-makers-for-data-analytics-and-optimisation

--
Dr Manuel López-Ibáñez | Lecturer at the Decision and Cognitive Sciences
Research Centre | Alliance Manchester Business School | The University of
Manchester | F29, Booth St East, Manchester M13 9SS, UK | +44 (0) 16130 68996 |
http://lopez-ibanez.eu

**********************************************************
*
* 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 2018 : second announcement, poster details

We are pleased to announce that the 2018 workshop in Mixed Integer
Programming (MIP 2018) will be held June 18 – 21 at Clemson University
(Greenville, South Carolina). The 2018 Mixed Integer Programming
workshop will be the fifteenth 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.

All workshop participants are invited to submit a poster abstract
before March 1, 2018. There will be an award for the best poster
presented by a student. To submit an abstract, please email a detailed
abstract of the poster (using 11pt font, at most two pages) to:

mip2018poster@gmail.com

Space for posters is limited, and the submitted poster abstracts will
be used to select the accepted posters. Therefore, it is important
that the abstract provides a good description of the research to be
presented. We expect to send out acceptance notifications around March
15.

For more information and updates, please see the workshop website at:
https://or.clemson.edu/mip-2018/

Program Committee

* Philipp Christophel, SAS
* Simge Küçükyavuz, University of Washington
* Ruth Misener, Imperial College London
* Giacomo Nannicini (chair), IBM Research
* Alejandro Toriello, Georgia Institute of Technology

Local Committee

* Akshay Gupte (chair), Clemson University
* Matthew Saltzman, Clemson University
* Cole Smith, Clemson University

Confirmed Speakers

* Bob Bixby, Gurobi
* Chen Chen, Ohio State University
* Gérard Cornuéjols, Carnegie Mellon University
* Yuri Faenza, Columbia University
* Ricardo Fukasawa, University of Waterloo
* Matthew Galati, SAS
* Andres Gomez, University of Pittsburgh
* Aida Khajavirad, Carnegie Mellon University
* Pierre Le Bodic, Monash University
* Quentin Louveaux, Université de Liège
* Marco Lübbecke, RWTH Aachen
* Miles Lubin, Google
* Stephen Maher, Lancaster University
* Enrico Malaguti, Università di Bologna
* Jim Ostrowski, University of Tennessee
* Joe Paat, ETH Zurich
* Annie Raymond, University of Washington
* Suvrajeet Sen, University of Southern California
* David Shmoys, Cornell University
* Cole Smith, Clemson University
* Wolfram Wiesemann, Imperial College

**********************************************************
*
* 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] CiE 2018 - 2nd Call for Papers

Apologies for multiple postings.

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

CiE 2018: Sailing Routes in the World of Computation
Kiel, Germany
July 30 - August 3, 2018
http://cie2018.uni-kiel.de
http://www.computability.org.uk

IMPORTANT DATES:
============================

Deadline for abstract submission: January 17, 2018
Deadline for article submission: February 1, 2018
Notification of acceptance: April 6, 2018
Final versions due: April 20, 2018

Deadline for informal presentations submission: April 20, 2018
(The notifications of acceptance for informal presentations will be
sent a few days after submission.)

Early registration before: May 30, 2018


CiE 2018 is the fourteenth conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others interested in
new developments in computability and their underlying significance
for the real world.

Previous meetings have taken place in Amsterdam (2005), Swansea
(2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada
(2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014),
Bucharest (2015), Paris (2016), and Turku (2017).


TUTORIAL SPEAKERS:
==================

Pinar Heggernes (Bergen, Norway)
Bakhadyr Khoussainov (Auckland, NZ)


INVITED SPEAKERS:
=================

Kousha Etessami (Edinburgh, UK)
Johanna Franklin (Hempstead, US)
Mai Gehrke (Paris, France)
Alberto Marcone (Udine, Italy)
Alexandra Silva (London, UK)
Jeffrey O. Shallit (Waterloo, Canada)

ORGANIZED BY:
=============

Department of Computer Science, Kiel University

For questions please contact the organisers at the e-mail address
cie2018@email.uni-kiel.de


SPECIAL SESSIONS (and organisers):
==================================

Approximation and Optimisation — Organisers: Leah Epstein (Haifa),
Klaus Jansen (Kiel)
Bioinformatics and Bio-inspired Computing — Organisers: Andre Franke
(Kiel), Victor Mitrana (Bucharest)
Computing with Imperfect Information — Organisers: Tim McNicholl
(Iowa), Mariya Soskova (Wisconsin-Madison)
Continuous Computation — Organisers: Ulrich Berger (Swansea), Dieter
Spreen (Siegen)
History and Philosophy of Computing — Organisers: Liesbeth de Mol
(Lille), Giuseppe Primiero (Middlesex)
SAT-Solving — Organisers: Vijay Ganesh (Waterloo), Olaf Beyersdorff (Leeds)

The speakers of the special sessions will be announced soon.


PROGRAMME COMMITTEE:
====================

Eric Allender (Rutgers), Arnold Beckmann (Swansea), Marco Benini
(Insubria), Olaf Beyersdorff (Leeds), Patricia Bouyer (Paris),
Alessandra Carbone (Paris), Barbara Csima (Waterloo), Anuj Dawar
(Cambridge), Henning Fernau (Trier), Ekaterina Fokina (Vienna), Peter
Høyer (Calgary), Georgiana Ifrim (Dublin), Lila Kari (Waterloo), Elham
Kashefi (Edinburgh), Karen Lange (Wellesley), Benedikt Löwe
(Amsterdam), Barnaby Martin (Durham), Florin Manea (Kiel), Klaus Meer
(Cottbus), Russell Miller (New York, co-chair), Angelo Montanari
(Udine), Andrey Morozov (Novosibirsk), Anca Muscholl (Bordeaux), Dirk
Nowotka (Kiel, co-chair), Arno Pauly (Bruxelles), Isabella Peters
(Kiel), Giuseppe Primiero (Middlesex), Henning Schnoor (Kiel), Monika
Seisenberger (Swansea), Shinnosuke Seki (Tokyo), Mariya Soskova
(Wisconsin–Madison), Raymond Turner (Essex), Peter Van Emde Boas
(Amsterdam), Heribert Vollmer (Hannover).

CONTRIBUTED PAPERS:
===================

The CiE conferences serve as an interdisciplinary forum for research
in all aspects
of computability, foundations of computer science, logic, and
theoretical computer science, as well as the interplay of these areas
with practical issues in computer science and with other disciplines
such as biology, mathematics, philosophy, or physics.

The PROGRAMME COMMITTEE cordially invites all researchers (European
and non-European) to submit their papers in all areas related to the
above for presentation at the conference and inclusion in the
proceedings at https://easychair.org/conferences/?conf=cie2018 .

Papers must be submitted in PDF format, using the LNCS style
(available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip)
and should have a maximum of 10 pages, including references but
excluding a possible appendix in which one can include proofs and
other additional material. Papers building bridges between different
parts of the research community are particularly welcome.

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

INFORMAL PRESENTATIONS:
=======================

Continuing the tradition of past CiE conferences, in addition to the
formal presentations based on the LNCS proceedings volume, CiE 2018
will host a track of informal presentations, that are prepared very
shortly before the conference and inform the participants about
current research and work in progress. The deadline for the submission
of abstracts for informal presentations is May 1st, 2018.

WOMEN IN COMPUTABILITY:
=======================

We are very happy to announce that within the framework of the Women
in Computability programme, sponsored by ACM-Women, we are able to
offer four grants of up to 250 EUR for junior female researchers who
want to participate in CiE 2018. Applications for this grant should be
sent to Liesbeth De Mol, liesbeth.demol@univ-lille3.fr, before 15 May
2018 and include a short cv (at most 2 pages) and contact information
for an academic reference. Preference will be given to junior female
researchers who are presenting a paper (including informal
presentations) at CiE 2018.

HaPoC Grants | Commission for the History and Philosophy of Computing
=====================================================================

The HaPoc Council is happy to announce the availability of two HAPOC
travel grants of 250USD each to support participation to the
conference. To be eligible for a grant, a paper or informal
presentation in the area of history and/or philosophy of computing
accepted at CiE 2018 is required. In order to apply for a grant,
please send the following details to info@hapoc.org: cv, the paper or
informal presentation submitted, accompanied by the acceptance email,
a detailed budget indicating any other funding possibilities (if
available).

Association CiE:
http://www.computability.org.uk

CiE Conference Series:
http://www.computability.org.uk/index.php/cie-conference-series/

**********************************************************
*
* 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 postdoc position on Approximation Algorithms, Quantum Information and Semidefinite Optimization at CWI, Amsterdam, The Netherlands

***********************************************
CWI, Amsterdam, The Netherlands

Open postdoc position

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

Centrum Wiskunde & Informatica (CWI) has a vacancy in the Network & Optimization research group for a
postdoc in the research project

"Approximation Algorithms, Quantum Information and Semidefinite Optimization".

This research project aims to explore the limits of efficient computation within classical and quantum computing, using semidefinite optimization as a main unifying tool. The position involves research into the mathematical and computer science aspects of approximation algorithms for discrete optimization, quantum entanglement in communication, and complexity of fundamental problems in classical and quantum computing.
We especially welcome applicants with a solid background and interest in algebraic methods for optimization.
The project will be carried out in collaboration between Monique Laurent from the CWI Networks & Optimization research group, Ronald de Wolf from the CWI Algorithms & Complexity research group, and Nikhil Bansal from the department of mathematics and computer science of the Technical University Eindhoven. The position is funded through an NWO-TOP grant.
More background information about the project can be found at the website:

http://projects.cwi.nl/quantumdsp/

For details about the application procedure please visit the website:

https://www.cwi.nl/jobs/vacancies/postdoc-in-the-research-project-approximation-algorithms-quantum-information-and-semidefinite-optimization

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

Tuesday, December 12, 2017

[DMANET] CCA 2018: First call for papers

First Call for Papers for the

Fifteenth International Conference on
Computability and Complexity in Analysis (CCA 2018)

http://cca-net.de/cca2018/

Held in Honour of Klaus Weihrauch's 75th Birthday

August 5-8, 2018, Lake Kochel, Germany
______________________________________________________________


Venue

The conference takes place at the Georg-von-Vollmar Academy
in Kochel, Germany. Kochel am See is beautifully located at
Lake Kochel at the edge of the Bavarian Alps, approximately
70 km south of Munich, from where it can easily be reached.

The conference CCA 2018 is preceded by the conference
Computability in Europe (CiE 2018) that takes place in Kiel,
in the north of Germany, from July 30 to August 3, 2018.


Topics

- Computable analysis
- Complexity on real numbers
- Constructive analysis
- Domain theory and analysis
- Effective descriptive set theory
- Theory of representations
- Computable numbers, subsets and functions
- Randomness and computable measure theory
- Models of computability on real numbers
- Realizability theory and analysis
- Reverse analysis
- Real number algorithms
- Implementation of exact real number arithmetic


Invited Speakers
- Daniel Graca (Faro, Portugal)
- Neil Lutz (Piscataway, USA)
- Florian Steinberg (INRIA, France)
- Pieter Collins (Maastricht, Netherlands)
- Ludovic Patey (Lyon, France)
- Diogo Pocas (Hamilton, Canada)
- Rupert Hölzl (Munich, Germany)
- Matthias Schröder (Darmstadt, Germany)


Scientific Programme Committee

- Laurent Bienvenu (Montpellier, France)
- Hannes Diener (Christchurch, New Zealand)
- Denis Hirschfeldt (Chicago, USA)
- Rupert Hölzl (Munich, Germany)
- Zvonko Iljazovic (Zagreb, Croatia)
- Takayuki Kihara (Nagoya, Japan)
- Elvira Mayordomo (Zaragoza, Spain)
- Norbert Müller (Trier, Germany)
- Ning Zhong (Cincinnati, USA)
- Martin Ziegler, chair (Daejeon, Republic of Korea)


Organising Committee

- Vasco Brattka, chair (Munich, Germany)
- Peter Hertling (Munich, Germany)
- Rupert Hölzl (Munich, Germany)
- Philip Janicki (Munich, Germany)


Submissions

Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:

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

If full versions of papers are already available as technical report
or arXiv version, then corresponding links should be added to the
reference list. Final versions of abstracts might be distributed to
participants in hardcopy and/or in electronic form.


Dates

* Submission deadline: April 2, 2018
* Notification of authors: May 7, 2018
* Final version: June 4, 2018
* Registration deadline: June 18, 2018
* Conference: August 5-8, 2018


Conference Web Page

http://cca-net.de/cca2018/
--8323329-1036883327-1513106442=:27813--

**********************************************************
*
* 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] 6th Student Conference on Operational Research (SCOR 2018)

To Phd Supervisors:

*6th Student Conference on Operational Research(SCOR 2018)*

*April 6-8 2018, University of Nottingham, UK*

We are pleased to announce the official launch of the PhD Student
Conference on Operational Research (SCOR 2018), now back for its sixth
instalment. We invite you to join us once again, at the beautiful
University of Nottingham campus the 6-8 April 2018.

PhD students from all Universities studying Operational Research,
Management Science or a related field are kindly invited to submit an
abstract for presentation at the conference. As some presenters may still
be on an early stage of in their careers, the work presented does not need
to be fully developed or thoroughly explored as of yet. The purpose of SCOR
2018 is to provide a friendly environment for the next generation of
Operational Researchers to receive constructive feedback on their work and
to meet people with similar interests.

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

Big Data & Analytics * Data Mining * Energy * Forecasting * Graphs /
Networks * Healthcare * Heuristics * Inventory * Mathematical Programming *
Multicriteria Decision Analysis * Neural Networks / Machine Learning *
Optimisation and Applications * Reliability / Risk Assessment * Scheduling
/ Timetabling * Stochastic Modelling * Supply Chain Management * Simulation
/ System Dynamics * Transport /Logistics.

Plenary talks will be given by various OR professionals undertaking a wide
range of exciting careers. This will give students an opportunity to
consider the many career paths available to them after completing their
doctorate.

Please note that abstract submission is now open.

Deadline for abstract (250 words) submission: Friday 2nd February 2018

A notification of acceptance will be sent shortly after this deadline. In
order to encourage a wide range of students to attend, an affordable
conference fee will cover accommodation, a full social program and full
catering provided.

Presenters are also invited to submit a paper (no more than 10 pages) on
their work to be published electronically as part of the SCOR 2018
proceedings. This will be available in the Dagstuhl OpenAccess Series in
Informatics (OASIcs). Paper submissions will undergo a selection process
based on refereeing by the Committee. This gives doctoral candidates a
chance to experience the peer-review process and to enhance their technical
writing skills. Although it is not mandatory, it is again, highly
recommended. To get an idea on the paper standards please visit the
SCOR2016 proceedings.

Deadline for PAPERS submission: Friday 30th March 2018

For latest news, follow us at Twitter, Facebook or Instagram @scor2018 .

www.scor18.com

See you in Nottingham!!!

--

Informativa sulla Privacy: http://www.unibs.it/node/8155

**********************************************************
*
* 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 Algorithms and Complexity at IDSIA, University of Lugano, Switzerland

The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in algorithms and
complexity, with a special focus on approximation algorithms.
This position is supported by the
Swiss National Foundation Grant "Approximation Algorithms for Network Problems".

The appointment is for one year with the possibility of extension.
The position is already available, and there is some flexibility on
the starting date.

The gross salary is roughly 80.000 CHF per year (low taxes, around 15%).
There are no teaching duties and there is generous travel support.
The ideal candidate should hold (or be close to obtaining) a Ph.D. in
Computer Science or related fields, and should have a solid
publication record in the area of algorithms and complexity (possibly
in approximation algorithms). Top conferences in this area include
STOC, FOCS, SODA, ICALP, and ESA.

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently counts 7
researchers.

IDSIA offers an international working environment. Lugano is a tidy
and lively town, with a wonderful view on Ceresio lake and mountains
around. Ticino Canton offers many opportunities for hiking, biking,
skiing, etc. Local restaurants serve very good (Italian style!) food.

Further details about the project can be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

The interested candidates should email
- a detailed CV, including a list of publications and 2-3 references, and
- a short summary of past and current research interests
to:
fabrizio@idsia.ch

The deadline for the application is 31st of January 2018.
For any question, do not hesitate to contact:

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

Monday, December 11, 2017

[DMANET] BCTCS 2018 Announce bursaries and registration (fwd)

Registration and Bursaries for BCTCS 18

We are happy to announce that BCTCS will fund 10 bursaries of £210 for
PhD. students who are giving a presentation. To apply for a bursary,
please contact bctcs18@cs.rhul.ac.uk with a brief letter of support
from your PhD. supervisor.

The call for presentations is repeated below. Apologies for multiple
postings.


BRITISH COLLOQUIUM FOR THEORETICAL COMPUTER SCIENCE 2018: CALL FOR
PRESENTATIONS
Royal Holloway, University of London
March 26-28, 2018
bctcs18.cs.rhul.ac.uk

BCTCS is the UK's foremost venue bringing together researchers in
theoretical computer science to present their research and discuss
future directions. In addition to the submitted presentations, there
will be five invited talks, given by world-leading researchers in TCS.

The meeting aims to provide an environment in which PhD
students can present their work, and get into contact with their peers
and experienced researchers. The scope of the colloquium includes all
aspects of theoretical computer science, including automata theory,
algorithms, complexity theory, semantics, formal methods, concurrency,
types, languages and logics.

The event will form part of the 50th anniversary celebrations of the
department of computer science at RHUL.

SUBMISSION

BCTCS welcomes presentation proposals. These talks should last for
30 minutes, including questions. Work need not be original and is
not formally published: the goal is to encourage discussion and
networking.

Titles and abstracts should be submitted to

bctcs18@cs.rhul.ac.uk

IMPORTANT DATES

Presentation submission: 1 Feb 2018
Registration with accommodation: 1 March 2018
Registration without accommodation: 8 March 2018
Meeting: 26-28 March 2018

REGISTRATION AND BURSARIES

Registration information is available at http://bctcs18.cs.rhul.ac.uk.

BCTCS will fund 10 bursaries of £210 for PhD. students who are giving a
presentation. To apply for a bursary, please contact bctcs18@cs.rhul.ac.uk
with a brief letter of support from your PhD. supervisor.

LONDON MATHEMATICAL SOCIETY INVITED SPEAKER

John E. Hopcroft - Cornell University
Research in Deep Learning

INVITED SPEAKERS

Agata Ciabattoni - TU Wien
Marta Kwiatkowska - University of Oxford
Alexandra Silva - University College London
Thomas Sauerwald - University of Cambridge


---2146799616-2025413674-1513032284=:19820--
**********************************************************
*
* 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 Optimization, Machine Learning, and Data Science

Workshop on Optimization, Machine Learning, and Data Science
      April 12 - 13, 2018
at Technische Universität Carolo-Wilhelmina zu Braunschweig.

To advance research and collaboration between these fields the workshop
aims at bringing together scientists working at the intersection of the
fields and scientists interested in contributing to the collaboration of
the fields.

We are very glad to announce the
*Keynote Speakers*
    Jeffrey T. Linderoth, University of Wisconsin-Madison, USA,
    Andrea Lodi, École Polytechnique de Montréal, Canada,
    Bernd Sturmfels, Max-Planck-Institut für Mathematik in den
Naturwissenschaften, Leipzig, Germany,
    Stephen J. Wright, University of Wisconsin-Madison, USA.

*Call for Contributions*
Besides the keynote talks we encourage young researchers to present
their work. We either seek work from the intersection of the fields, or
presentations on new, pivotal questions of one field for the other.
Submissions will be chosen for presentation based on an internal review
of the submitted extended abstracts.

*Deadline*
Please submit and apply for participation before February 12, 2018.

Further information can be found at http://mo.tu-bs.de/workshop/.

Looking forward to seeing you there!
    Imke Joormann, Christian Kirches, Dirk Lorenz, Sebastian Stiller,
Andreas Tillmann


**********************************************************
*
* 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 PASA 2018

-------------------------------------------------------------
CALL FOR PAPERS

13th Workshop on Parallel Systems and Algorithms

PASA 2018

https://www.cs12.tf.fau.de/conf/pasa2018/

in conjunction with
ARCS 2018 – 31st International Conference on Architecture of Computing Systems
Braunschweig, Germany, 9-10 April 2018

organized by
GI/ITG-Fachgruppe 'Parallel-Algorithmen, -Rechnerstrukturen und
-Systemsoftware' (PARS) and
GI-Fachgruppe 'Algorithmen' (ALGO)
-------------------------------------------------------------

The PASA workshop series has the goal to build a bridge between theory and
practice in the area of parallel systems and algorithms. In this context
practical problems which require theoretical investigations as well as the
applicability of theoretical approaches and results to practice shall be
discussed. An important aspect is communication and exchange of experience
between various groups working in the area of parallel computing, e.g.,
in computer science, electrical engineering, physics or mathematics.

Topics of Interest include, but are not restricted to:

- scheduling and load balancing
- parallel and distributed algorithms
- parallel embedded systems
- models of parallel computation
- ubiquitous and pervasive systems
- parallel architectures & storage systems
- reconfigurable parallel computing
- parallel programming languages
- data stream-oriented computing
- software engineering for parallel systems
- interconnection networks
- parallel design patterns
- network and grid computing
- performance evaluation of parallel systems
- distributed and parallel multimedia systems

PASA 2018 Webpage: https://www.cs12.tf.fau.de/conf/pasa2018/

The workshop will comprise invited talks on current topics by leading
experts in the field as well as submitted papers on original and
previously unpublished research. Accepted papers will be published in
the ARCS Workshop Proceedings as well as in the PARS Newsletter
(ISSN 0177-0454). The conference languages are English (preferred)
and German. Papers are required to be in English.

A prize of 500 € will be awarded to the best contribution presented
personally based on a student's or Ph.D. thesis or project. Co-authors
are allowed, the PhD degree should not have been awarded at the time
of submission. Candidates apply for the prize by e-mail to the organizers
when submitting the contribution. We expect that candidates are or become
members of one of the groups ALGO or PARS.

Important Dates
12th January 2018: Deadline for submission of full papers
under: https://easychair.org/conferences/?conf=pasa2018

6 pages in English, formatted according to IEEE CIS template in
"conference mode" (see
http://www.ieee.org/conferences_events/conferences/publishing/templates.html).
More details depend on the requirements given by the ARCS organizers
and will be provided here as soon as possible

31st January 2018: Notification of authors

7th February 2016: Final version for workshop proceedings


Program Committee
M. Dietzfelbinger (Ilmenau), A. Doering (Zurich), N. Eicker (Jülich),
T. Fahringer (Innsbruck), D. Fey (Erlangen), T. Hagerup (Augsburg),
V. Heuveline (Heidelberg), R. Hoffmann (Darmstadt), K. Jansen (Kiel),
B. Juurlink (Berlin), W. Karl (Karlsruhe), J. Keller (Hagen),
Ch. Lengauer (Passau), E. Maehle (Lübeck), U. Margull (Ingolstadt),
E. W. Mayr (Munich), U. Meyer (Frankfurt), F. Meyer auf der Heide (Paderborn),
J. Mottok (Regensburg), W. Nagel (Dresden), M. Philippsen (Erlangen),
K. D. Reinartz (Höchstadt), Ch. Scheideler (Paderborn), B. Schnor (Potsdam),
U. Schwiegelshohn (Dortmund), P. Sobe (Dresden), C. Trinitis,
T. Ungerer (Augsburg), R. Wanka (Erlangen)


Organisation
Prof. Dr. Wolfgang Karl, Karlsruhe Institute of Technology (KIT),
Institute of Computer Engineering (ITEC), 76129 Karlsruhe,
Phone/Fax +49-721-608-43771, E-Mail: wolfgang.karl@kit.edu

Prof. Dr. Rolf Wanka, Univ. Erlangen-Nuremberg, Dept. of Computer Science,
91058 Erlangen, Germany, Phone/Fax +49-9131-8525-152/149,
E-Mail: rolf.wanka@fau.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] Post Doc position on Graph Kernels

Good morning,

We offer a post position in Rouen, France, to work on the definition of
new graph kernels dealing with electronic characteristics of molecules.

Contact postdoc-graphkernel@litislab.fr for any questions.


Best regards,

Benoit Gaüzère.

Brief Description of the position


Graph kernels have already been applied to chemoinformatics and are
based on structural information encoded within molecular
graphs. However, intrinsic properties of atoms and theirs
interactions induce some electronic properties which are not
explicitly encoded within classic molecular graphs
representations. The main purpose of this post doctoral position
is to include this information into a new augmented kernel and
apply it on some chemoinformatics datasets. The two main steps
will be i) to define a new molecular representation encoding
local electronic information and ii) to define a new similarity
measure as a kernel to compare two molecules encoded in the new
proposed representation.

This project will be supervised in close collaboration by
LITIS (Rouen, France) and GREYC (Caen, France) laboratories which
have a strong expertise on graph kernels for
chemoinformatics. The chemical part will be supervised by COBRA
laboratory (Rouen, France) which has proposed various atomic
descriptors encoding some electronical information. Their
expertise will be essential to be able to encode additional
information into a new representation for chemical compounds.

Salary: This position will be granted with about 2280 euros/month
net salary.

Application domains: machine learning on graphs, chemoinformatics,
graph kernels, graph representations

Further details:

Place: The research will be conducted at LITIS Laboratory (Rouen, France)
in Normandy. The LITIS (EA 4108) is affiliated to Normandie
University, University of Rouen and INSA Rouen Normandie.

Start date: January/ February 2018

Duration: 20 months according to discussions with the candidate.

Topics: Graph kernels, graph representation, machine learning

Contact:

You can contact the team via : postdoc-graphkernel@litislab.fr

Required skills:

• PhD or Master in Applied Mathematics or computer science,
• experience in C++, Python or Matlab programming,
• knowledge in kernel methods, graph based approach constitutes an
advantage.

Required documents: Please send the following documents:

• up to date CV,
• Any recommendation letter
• A short document on research experience and interests

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

Sunday, December 10, 2017

[DMANET] ISCO 2018 second call, submissions are open

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

ISCO 2018 Second Call

Submissions are now open

*************************
5th International Symposium on Combinatorial Optimization (ISCO 2018)
April 11-13, 2018 - Marrakech - Morocco
[+Spring School on "Advanced MIP Formulations and Computations"
on April 9- 10, 2018]
http://isco2018.lip6.fr/

THEME AND SCOPE
ISCO is a biennial symposium whose aim is to bring together researchers from all the
communities related to combinatorial optimization, including algorithms and complexity,
mathematical programming and operations research. It is intended to be a forum for
presenting original research in these areas and especially in their intersections.
Quality papers on all aspects of combinatorial optimization, from mathematical
foundations and theory of algorithms to computational studies and
practical applications, are solicited.

SESSIONS
The conference is organized into plenary and parallel sessions. The conference languages
is English. Each speaker can give only one talk. Proposals for invited sessions
are welcome. Researchers who are interested in organizing an invited session should
contact Ridha Mahjoub (ridha.mahjoub@)lamsade.dauphine.fr).

SPRING SCHOOL
ISCO 2018 will be preceded by a spring school on "Advanced MIP Formulations and
Computations". Juan Pablo Vielma and Joey Huchette from MIT will give 16 hours of
lectures on April 9 and 10, 2018.

SUBMISSION - PUBLICATION
Papers presenting original unpublished results in all areas of combinatorial optimization
and its applications are welcome. The submission deadline is January 10, 2018.
Simultaneous submissions to other conferences with published proceedings or journals
are not allowed.
Two types of submissions:
Regular papers with up to 12 pages
Accepted regular papers will be published by Springer-Verlag in the Lecture Notes in
Computer Science (LNCS) series in a post-conference proceedings volume. The authors will
have to prepare their camera-ready version two weeks after the end of ISCO 2018.
Short papers up to 2 pages. Accepted short papers will be included in a volume
of local proceedings. More information about the submission procedure is available
on the website of the conference.

SPECIAL ISSUE:
A special issue of the journal Discrete Applied Mathematics will be dedicated to ISCO 2018.

IMPORTANT DATES
Submission: January 10, 2018
Notification: February 20, 2018
Early registration: March 6, 2018
Early registration school: March 6, 2018
Camera Ready: April 30, 2018

KEYNOTE SPEAKERS
Friedrich Eisenbrand (EPFL, Lausanne, Switzerland)
Marcia Fampa (Federal University of Rio de Janeiro, Bresil)
Bernard Gendron (University of Montreal, Canada)
Franz Rendl (University of Klagenfurt, Graz, Austria)

CONFERENCE CHAIRS
Abdelatif El Afia (ENSIAS, University Mohammed V, Marroco)
Jon Lee (University of Michigan, USA)
A. Ridha Mahjoub (University Paris-Dauphine, France)
Giovanni Rinaldi (IASI, Roma, Italy)

**********************************************************
*
* 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, December 9, 2017

[DMANET] Tenure track faculty position in Computer Science (Big Data Analytics)

Dear colleagues,

Please feel free to forward this call for applications for a tenue track faculty position in our department.

http://informatique.umons.ac.be/index.php?p=jobs <http://informatique.umons.ac.be/index.php?p=jobs>

Best regards,

Hadrien

--
Prof. Hadrien Mélot
Algorithms Lab - UMONS
http://informatique.umons.ac.be/algo <http://informatique.umons.ac.be/algo>
**********************************************************
*
* 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 Algorithms & Optimisation (Univ. of Liverpool, UK)

PhD position in Algorithms & Optimisation (Univ. of Liverpool, UK)


A fully funded PhD position:

A fully funded 3-year PhD position is available at the Computer Science Department of the University of Liverpool, UK.
The Department is the world-leading research centre in Computer Science with a particular strength in theoretical computer science and artificial intelligence. The department offers a strong research environment, spanning a wide range of research topics such as complexity theory and algorithms, distributed computing and computer networks, verification and formal methods, automata and computability theory, computational game theory, data mining, machine learning and natural language processing.

The successful candidate will do research in the areas of algorithms, optimisation and machine learning, designing new approaches and their analyses for simulation-based planning techniques with applications to online retail. This project will be in cooperation with Shop Direct, the second largest retailer in the UK. The candidate will be supervised by Professor Piotr Krysta ( https://www.csc.liv.ac.uk/~piotr/ ) and will become a member of the Algorithms and Optimisation research group at the Department of Computer Science: https://intranet.csc.liv.ac.uk/research/optimisation/people.html.

This PhD project will study a Loan Pricing Problem (LPP), in which a customer browses pages of an online retailer and is interested to purchase a new product. The retailer offers the customer payment options: a list of appropriately priced loans. These offers are based on the customer's past history, and are carefully chosen and personalised, to maximise the customer's lifetime value. How can we model and efficiently solve this problem based on the customer's history? LPP can be approached by simulation-based planning techniques via Markov decision processes. We will use our expertise in this area and in combinatorial pricing and the design and analysis of algorithms to build a learning model for LPP based on data from Shop Direct. Our goal is to develop a novel framework of meta-algorithms which would automatically generate efficient algorithms to solve LPP based on the historic data. We will use both experimental and theoretical analysis of the performance of our algorithms. Our toolkit will involve state of the art techniques in simulation-based planning, machine learning, approximation algorithms and optimisation.

This PhD project is an exciting opportunity to delve into an important and timely research area on a border of algorithms, optimisation and data analysis with a renowned team of researchers and a modern high-tech internet retailer Shop Direct based in Liverpool. The project will help expose the PhD candidate to contemporary theoretical developments in these research areas as well as their direct deployment in industrial practice. A PhD within this project will prepare the candidate to undertake academic research career and industrial research and development IT career.

The position will be based in University of Liverpool's Department of Computer Science and supervised by Professor Piotr Krysta, and co-supervised by Dr. Rahul Savani (Economics and Computation group) and Dr. Frans Oliehoek (Data Mining and Machine Learning group), with a close cooperation with Shop Direct's Data Science Department.

Prior Experience:
We look for ambitious and highly motivated candidates with good first degree (BSc or MSc) in Computer Science, Mathematics or closely related subject, and with a strong interest and background in algorithms and optimisation, and programming skills. A mathematically oriented mind is desired. The applicant must have good communication skills, both verbal and in writing (English), be self-motivated and helpful team member.

How to Apply:
Applications should be made formally by following the University of Liverpool's standard process. Details can be found
here: https://www.liverpool.ac.uk/computer-science/postgraduate/phdstudy/applications/ Applications should list
Prof. Piotr Krysta as the potential supervisor and choose the option "School funded PhD" when asked how you will
fund the PhD. Applications must contain a cover letter, a curriculum vitae or resume, copies of undergraduate and
graduate transcripts, a 1-2 page research statement describing how the applicant's qualifications and research
interests would fit the project, a copy of the applicant's bachelor or master's thesis and the names and contact
information of academic references.

Funding Notes:
This PhD studentship will be for 3 years at GBP 20,000 (tax-free) per year.
a) If UK/EU this will relate to Full Fees & Maintenance (current fee £4,195)
b) If overseas/international applicants this will relate to Full Fee and a small maintenance (current fee is £18,900).

Applications are admitted until 31 January 2018, or until a suitable candidate is found thereafter. The selected candidate can start this position immediately, but the latest starting date for this fully-funded PhD position is 1 March 2018. Please send your informal inquiries to Prof. Piotr Krysta (pkrysta@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/
*
**********************************************************

Friday, December 8, 2017

[DMANET] 2nd CFP - VIII Latin-American Workshop on Cliques in Graphs (LAWCG 2018)

---------------------
LAWCG 2018
VIII Latin-American Workshop on Cliques in Graphs
August 9-11, 2018
Rio de Janeiro-RJ, Brazil
http://lawcg2018.icomp.ufam.edu.br/

We are very pleased to announce that the 8th Latin American Workshop on Cliques
in Graphs will be held on August 9-11, 2018 in Rio de Janeiro, Brazil.
Following the previous workshops at (2002) Rio de Janeiro, Brazil; (2006)
La Plata, Argentina; (2008) Guanajuato, Mexico; (2010) Itaipava, Brazil;
(2012) Buenos Aires, Argentina; (2014) Pirenópolis, Brazil and (2016) La
Plata, Argentina, the workshop is meant to foster interaction between the
Latin American Graph Theory and Combinatorics researchers, whose research
interests include cliques, clique graphs, the behavior of cliques and other
topics in Graph Theory.

The LAWCG 2018 is supported by the Special Committee on Algorithms,
Combinatorics
and Optimization (CE-ACO) of the Brazilian Computer Society (SBC).

In 2018, the LAWCG is a satellite event of ICM 2018 (International Congress
of Mathematicians), that will be held in Rio de Janeiro, from August 1st to
9th, 2018. Also in the 2018 edition, the LAWCG joins the commemorations of
the 50th edition of the Brazilian Operational Research Symposium (SBPO),
organized by the Brazilian Society of Operational Research (SOBRAPO), which
is part
of ALIO and IFORS.

The official languages are English, Portuguese, and Spanish.

We have five confirmed plenary talks by:

Bojan Mohar (Canada and Slovenia)
Gyula O. H. Katona (Hungary)
Jorge Urrutia (Mexico)
Marisa Gutierrez (Argentina)


Contributed Papers covering original work on the conference topics will be
accepted for presentation. Each contributor must submit a one page brief
abstract in .pdf format by e-mail to

lawcg2018@eic.cefet-rj.br

using the following LaTex format avaiable at

http://lawcg2018.icomp.ufam.edu.br/call-papers

Submissions open on: January 15th 2018
Closing date for submissions: March 31st 2018
Notification of acceptance: May 15th 2018

After the workshop, the proceedings of the workshop will be published
by Matemática
Contemporânea, a journal of the Brazilian Mathematical Society. All
participants of the conference will be invited to submit an extended abstract
(up to 6 pages) describing their contributions. The submitted papers will
go through the normal review process. Please follow the formatting
guidelines of Matemática Contemporânea.

Registration fee and payment method will be announced by mid-April.

We sincerely hope to see you at Rio de Janeiro for the workshop,


Committees

ICM 2018's satellite representatives
Jayme Szwarcfiter, UFRJ, Rio de Janeiro, Brazil
Nelson Maculan, UFRJ, Rio de Janeiro, Brazil

General Chair
Celina de Figueiredo, UFRJ, Rio de Janeiro, Brazil

Program Committee
Ana Karolinna Maia, UFC, Ceará, Brazil
Cláudia Linhares Sales, UFC, Fortaleza, Brazil
Leo Liberti, CNRS LIX, École Polytechnique, France
Luerbio Faria, UERJ, Rio de Janeiro, Brazil
Maya Stein, Universidad de Chile, Santiago, Chile
Rosiane de Freitas, UFAM, Manaus, Brazil

Organizing committee
Diana Sasaki, UERJ, Rio de Janeiro, Brazil
Diego Nunes Brandão, CEFET, Rio de Janeiro, Brazil
Helder Vasconcelos, CEFET, Rio de Janeiro, Brazil
Laura Silva de Assis, CEFET, Rio de Janeiro, Brazil
Pedro Henrique González Silva, CEFET, Rio de Janeiro, Brazil
Rainer Amorim, UFAM, Manaus, Brazil
Raphael Machado, CEFET, Rio de Janeiro, Brazil
Rubens Sucupira, UERJ, Rio de Janeiro, Brazil
Simone Gama, UFAM, Manaus, Brazil

Steering Committee
Celina de Figueiredo, UFRJ, Rio de Janeiro, Brazil
Erika Coelho, UFG, Goiânia, Brazil
Jayme Szwarcfiter, UFRJ and UERJ, Rio de Janeiro, Brazil
Liliana Alcón, UNLP, La Plata, Argentina
Márcia Cappelle, UFG, Goiânia, Brazil
Marina Groshaus, UBA, Buenos Aires, Argentina
Marisa Gutierrez, UNLP, La Plata, Argentina
Miguel Pizaña, UAM, Mexico, Mexico


Additional information are available at LAWCG 2018's website:

http://lawcg2018.icomp.ufam.edu.br/
<http://lawcg2018.icomp.ufam.edu.br/call-papers>


--
Rosiane de Freitas, CS Research Professor
Optimization, Algorithms, and Computational Complexity research group
Institute of Computing - Federal University of Amazonas (IComp/UFAM)
Manaus - Amazonas, Brazil
+55 92 9 8242-4088
---

**********************************************************
*
* 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 2018] SIGEVO Summer School - Call for Participation

[Apologies if you receive multiple copies]

***************************************************************
*** 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 2018 Conference ..........

July 13, 14, and 19 (plus activities in July 15-19)

SIGEVO is a special interest group of ACM always looking for new ways
to enlarge the community of researchers working in different
biologically inspired metaheuristics. The second SigEvo Summer School
(S3), held in conjunction with GECCO 2018 in Kyoto, is looking for
students and mentors.

The core of the second S3 will take place in Osaka in the days
previous to the conference, and will continue in daily interactions
during the conference proper in Kyoto, finishing in the same day of
the conference later in the afternoon. That way, students will be able
to enjoy and learn during the conference proper at the same time they
meet researchers and advance in their learning tasks. GECCO tutorials,
workshops, and papers will be an integral part of the S3.

Students are expected to:

- Attend the two days before the conference, as well as the session
after the conference, is finished, on the same day.

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

- Cooperatively work on an assignment 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 on the web page of
GECCO: http://gecco-2018.sigevo.org/index.html/Summer+School

Any comments or questions on the school organization, please contact
JJ Merelo (jmerelo@ugr.es <mailto:jmerelo@ugr.es>)

If you are interested in being a mentor for the second S3, please send
your information (name, affiliation, and contact information) to JJ
Merelo (jmerelo@ugr.es <mailto:jmerelo@ugr.es>).

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

--
Tomohiro Yoshikawa
Associate Professor
Dept. of Information and Communication
Nagoya University

Andrew M. Sutton
Assistant Professor
Department of Computer Science
University of Minnesota Duluth

*********************************
Publicity Chairs GECCO 2018
*********************************
**********************************************************
*
* 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] Scholarship, master in fundamental computer science, ENS de Lyon, France

Scholarships are proposed for international students willing to do a master in fundamental computer science at ENS de Lyon (France). Important informations below.

****************
Scope: all areas of fundamental computer science are covered (logic, combinatorics, graphs, cryptography, algorithms, computing, optimization, computational geometry, complexity, information theory...)

The scholarship is 1000 euros per month. Teaching is fully given in English. Students may apply for the two years of the master, or just for the second year. Students are encouraged to continue with a PhD.

*****************
Detailed program of the 1st year of the master:
http://www.ens-lyon.fr/DI/?page_id=4036&lang=en

Detailed program of the 2nd year of the master:
http://www.ens-lyon.fr/DI/?p=5331


*****************
How to apply:

The scholarships are provided by Labex MiLyon and ENS de Lyon. Here are the links to apply.
One application is enough to apply to the two scholarships (MiLyon and ENS)

MiLyon, deadline to apply : January 9th 2018
http://milyon.universite-lyon.fr/en/formation/bourses/

ENS de Lyon, deadline to apply : December 18th, 2017, 12 pm (Time at Lyon - France)
http://international.ens-lyon.fr/grants-and-scholarships-279258.kjsp?RH=1444323973665&RF=1445867537855


______________________________
Nicolas Trotignon
http://perso.ens-lyon.fr/nicolas.trotignon/
______________________________
CNRS, LIP, Équipe MC2
École Normale Supérieure de Lyon
Département d'informatique
Tél : (+33 | 0) 4 37 28 76 43

**********************************************************
*
* 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] CTW18 on Graphs and Combinatorial Optimization (18-20 June, Paris)

16th Cologne-Twente Workshop (CTW18) on Graphs and Combinatorial Optimization

June 18-20, 2018, Paris (France)

Call for papers
---------------
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization
2018 welcomes contributions on theory and applications of discrete
algorithms, graphs and combinatorial structures in the wide
sense. CTW18 will be organized by CNRS LIX, École Polytechnique, and will
take place at the Conservatoire National d'Arts et Métiers (CNAM), in
the center of Paris.

Contacts
--------
URL: http://ctw18.lipn.univ-paris13.fr/
EMAIL: ctw18paris@gmail.com

Invited speakers
----------------
Thomas Seiller, Univ. de Paris-Nord
Angelika Wiegele, Alpen-Adria-Univ. Klagenfurt

Registration fee
----------------
EUR 250 if the payment is received by May 2, 2018, and EUR 300
afterwards. For PhD/MSC students and/or postdocs, EUR 100 if received
by May 2, 2018, and EUR 125 afterwards (PhD studentship / postdoc status
proof is required). The registration fee includes entry to all technical
sessions, coffee-breaks and the social event.

Abstract Submission
-------------------
Submit extended abstracts of at most 4 pages using the Easychair link
<https://easychair.org/conferences/?conf=ctw18>, no later than
Feb 1st, 2018, using the templates (coming soon too) available on the
website. The scientific committee will select the presentations for
the workshop on the basis of the extended abstracts received and on
the available number of slots.

Proceedings volume
------------------
A special issue of the journal Discrete Applied Mathematics is planned
as a post-conference proceedings outlet.

Scientific committee
--------------------
Ali Fuat Alkaya, Marmara Univ.
Alberto Ceselli, Univ. Milan
Roberto Cordone, Univ. Milan
Ekrem Duman, Ozyegin Univ.
Ulrich Faigle, Univ. Koeln
Johann Hurink, Univ. Twente
Leo Liberti, CNRS & Ecole Polytechnique
Bodo Manthey, Univ. Twente
Gaia Nicosia, Univ. Roma Tre
Andrea Pacifici, Univ. Roma Tor Vergata
Stefan Pickl, Univ. des Bundeswehr Muenchen
Bert Randerath, Technische Hochschule Koeln
Giovanni Righini, Univ. Milan
Heiko Roeglin, Univ. Bonn
Britta Peis, RWTH Aachen
Oliver Schaudt, Univ. Koeln
Rainer Schrader, Univ. Koeln
Rudiger Schultz, Univ. Duisburg-Essen
Frank Vallentin, Univ. Koeln

Local organization
------------------
Fabio Furini, Univ. Paris-Dauphine
Amelie Lambert, CNAM Paris
Lucas Letocart, Univ. Paris-Nord
Leo Liberti, CNRS & Ecole Polytechnique (chair)
Ivana Ljubic, ESSEC Paris
Emiliano Traversi, Univ. Paris-Nord
Roberto Wolfler Calvo, Univ. Paris-Nord

EMAIL: <ctw18paris@gmail.com>
URL: <http://ctw18.lipn.univ-paris13.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/
*
**********************************************************

Thursday, December 7, 2017

[DMANET] AAAC 2018 First Call For Papers

The 11th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC) May 18-20, 2018, Beijing, China http://theory.ict.ac.cn/aaac2018/


The 11th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC) will take place at the Institute of Computing Technology, Chinese Academy of Sciences, Beijing on May 18-20, 2018. AAAC was founded in 2007, aiming at promoting collaborations in theoretical computer science within the region. The website of AAAC is at http://www.aa-ac.org/

Important Dates
=================
Submission due: Feb 10, 2018
Notification: Feb 28, 2018
Conference Dates: May 18-20, 2018


Abstract Submission
===================
Authors are invited to submit one-page abstracts (A4 size in pdf format) that can be based on original results or surveys of existing results in theoretical computer science. An informal collection of the one page abstracts will be distributed at the meeting, which does not prevent any future publication of the results.


Meeting Format
===============
There will be invited talks, tutorials and contributed talks in the meeting. An accepted contributed talk is given about 25 minutes. The first tutorial will be scheduled in the afternoon of May 18 before the welcome reception in the evening of May 18. The main meeting will start on May 19 and end on May 20. There will be a dinner banquet on May 19.


Invited Speakers
================
Keynote Speakers
Uri Zwick, Tel Aviv University

Tutorial Speakers
Shengyu Zhang, The Chinese University of Hong Kong
Wei Chen, Microsoft Research Asia


AAAC Board Members
===================
Hee-Kap Ahn, POSTECH
Sang Won Bae, Kyonggi University
Kun-Mao Chao, National Taiwan University
Siu-Wing Cheng, HKUST
Chung-Shou Liao, National Tsing Hua University
Pinyan Lu, Shanghai University of Finance and Economics
Heejin Park, Hanyang University
Kunihiko Sadakane, The University of Tokyo
Xiaoming Sun, Chinese Academy of Sciences
Takeshi Tokuyama, Tohoku University
Ryuhei Uehara, JAIST
Guochuan Zhang, Zhejiang University
Shengyu Zhang, The Chinese University of Hong Kong

Contact: Jialin Zhang, Institute of Computing Technology, CAS, zhangjialin@ict.ac.cn

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

[DMANET] PhD positions at University of Edinburgh in Algorithms, Geometry and Data mining

PhD student positions in algorithms for data mining, networks and computational geometry are available at the Department of Informatics, University of Edinburgh, Scotland. Applicants should have interest in one or more of the following areas:

* Algorithms with focus on self driving cars, IoT, sensor networks
* Computational Geometry and topology
* Data mining algorithms, graph analysis, streaming data

For more information, contact Dr Rik Sarkar (rsarkar@inf.ed.ac.uk) or see:

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

The research at Edinburgh School of Informatics is consistently ranked as the top in the U.K. The historic city of Edinburgh is lively, beautiful, and a great place to live. More information for students are available at http://www.ed.ac.uk/schools-departments/informatics/postgraduate

Early applications are encouraged. Students from abroad (outside U.K. and E.U.) should complete the applications by December 8.


--

Rik Sarkar

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


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


**********************************************************
*
* 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 Positions at UNSL (Argentina)

The Research Group of Algebraic Graph Theory at Universidad Nacional de San
Luis (San Luis, Argentina) is looking for 4 young European reasearchers
to fill post doc positions in Combinatorics and Graph Theory. The positions
are supported by of the H2020 Marie Skłodowska-Curie
postdoctoral fellowships programme (MSCA-IF 2018).

For further information, please contact Daniel A Jaume (
daniel.pastine.tag@gmail.com) or Adrián Pastine (
adrian.pastine.tag@gmail.com).

The duration of the fellowship is 12-24 months, based at Universidad
Nacional de San Luis, San Luis, Argentina.

Working Language: Spanish, Portuguese or English.
APPLICATION PROCESS

We invite researchers to submit a short research proposal (around 1,000
words) on one of the following major research themes:

-

Spectral Graph Theory.
-

Cayley Graphs.
-

Combinatorial Matrix Theory.
-

Chemical Graph Theory.
-

Extremal Combinatorics.


-

Random Graphs.


Please provide us with the following documents for our selection committee:

-

Research proposal (around 1,000 words)
-

CV
-

A minimum of one representative research paper/working paper.
-

One reference letter, sent directly by your reference to our mail
address.


Mail your documents to UNSL:

Daniel A. Jaume: daniel.jaume.tag@gmail.com

or

Adrián Pastine: adrian.pastine.tag@gmail.com

**********************************************************
*
* 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 CFP] [GECCO 2018] Second Call for Papers - Genetic and Evolutionary Computation Conference 2018

[Apologies if you receive multiple copies]

** Second Call for Papers **

2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July 15th-19th, 2018, Kyoto, Japan
http://gecco-2018.sigevo.org/

Submission site is now open for abstracts and papers:
https://ssl.linklings.net/conferences/gecco/

The Genetic and Evolutionary Computation Conference (GECCO 2018) 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 2018 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Full papers of at most 8 pages are aimed to present
original new work that meets the high-quality standards of
GECCO. Accepted full papers appear in the ACM digital library as part
of the MAIN PROCEEDINGS of GECCO. For full papers, a separate
abstract needs to be submitted first by January 30, 2018. Full papers
are due by the non-extensible deadline of February 6, 2018.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. Evaluation is done on a per-track basis,
ensuring high interest and high expertise of the reviewers. Review
criteria include the significance of the work, technical soundness,
novelty, clarity, writing quality, relevance, and sufficiency of
information to permit replication, if applicable.

Besides the traditional GECCO full papers, poster-only papers of at
most 2 pages can be submitted. These are aimed to present original and
new work that has not yet reached the stage of the more mature,
complete research results that are typically published in full papers
at GECCO. The review of poster-only papers follows the same
double-blind process described above. However, accepted poster-only
papers appear in the ACM digital library as part of the COMPANION
PROCEEDINGS of GECCO. Poster-only papers are due by the non-extensible
deadline of February 6, 2018, and no abstract needs to be submitted
first.

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

If an author has more than one paper to present at the conference,
there are NO additional registration fees. The author registers one
time (pays for 1 registration) and presents as many papers as have
been accepted. If a paper has more than one author, and more than one
author will attend the conference, then each author in attendance must
pay for a separate registration.


Important Dates:

Full papers (traditional category)
Abstract Deadline: ** January 30, 2018 **
Submission of Full Papers: ** February 6, 2018 **

Poster-only papers
Submission of Poster-only papers: ** February 6, 2018 **

Conference: ** July 15-19, 2018 **

*** NOTE ***
We kindly suggest booking your accommodations as soon as possible. The
Gion festival, which occurs simultaneously with GECCO, may impact the
availability of hotels during the month of July.


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

--
Tomohiro Yoshikawa
Associate Professor
Dept. of Information and Communication
Nagoya University

Andrew M. Sutton
Assistant Professor
Department of Computer Science
University of Minnesota Duluth

*********************************
Publicity Chairs GECCO 2018
*********************************
**********************************************************
*
* 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/
*
**********************************************************