[DMANET] Cfp: Special issue on New trends in Variable Neighborhood Search

Call for Papers
Special issue of the International Transactions in Operational Research on
"New trends in Variable Neighborhood Search".

The Variable Neighborhood Search (VNS) metaheuristic is based on
systematic changes in the neighborhood structure within a search, and has
been succesfully applied for solving various discrete, global optimization
problems, and related tasks. This Call for Papers addresses the recently
growing interest of the research community working on the VNS methodology.

Our call of this special issue of the International Transactions in
Operational Research (ITOR) invites submissions on theoretical,
methodological or applied aspects of the VNS metaheuristic method. The
objective of this special issue is to present recent advances in the VNS
methodology and novel applications in industrial optimization problems,
informatics, engineering, etc. This special issue is also linked to the
4th International Conference on Variable Neighborhood Search (VNS'16),
which was held in Malaga, Spain, October 3-5, 2016.

The deadline for submission is January 15, 2017. Although we strongly
encourage authors who attended VNS'16 conference to submit their
manuscripts, this Call for Papers is also open to the entire community of
academics and practitioners.

Each paper will be peer-reviewed according to the editorial policy of ITOR
(http://www3.interscience.wiley.com/journal/118505725/home), published by
the International Federation of Operational Research Societies –
IFORS. Papers should be original, unpublished, and not currently under
consideration for publication elsewhere. They should be prepared according
to the instructions to authors that can be found in the journal homepage.
Authors should upload their contributions using the submission site
http://mc.manuscriptcentral.com/itor, indicating in their cover letter
that the paper is intended for this special issue. Other inquiries should
be sent directly to any of the Guest Editors in charge of this issue:
Nenad Mladenovic (nenad@mi.sanu.ac.rs), Angelo Sifaleras
(sifalera@uom.gr), and Kenneth Sorensen (kenneth.sorensen@uantwerpen.be).

Guest Editors:
Nenad Mladenovic, Mathematical Institute, Serbia
Angelo Sifaleras, University of Macedonia, Greece
Kenneth Sorensen, University of Antwerp, Belgium

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

[Mycolleagues] CFP: Joint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization -- ECCO XXX

Call for Papers

Joint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization
(ECCO XXX)

Koper, Slovenia, May 3rd - 6th, 2017
http://ecco2017.euro-online.org
mailto:ecco-xxx@iam.upr.si

The conference is jointly organized by EURO and ORSC. For more
details, please, visit the conference site as the information is added
frequently.

Aims and objectives
-------------------

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

Scope and Topics
----------------

We seek submissions in all areas of combinatorial optimization from
theory through applications. Suggested, but not exclusive, topics
include:

- theory and applications of combinatorial optimization
- exact solution algorithms, approximation algorithms, heuristics, and
meta-heuristics for combinatorial optimization problems
- integer programming, global optimization, stochastic integer
programming, multi-objective programming, graph theory and network
flows
- application areas include logistics and supply chain optimization
manufacturing, energy production and distribution, land
consolidation telecommunications, bioinformatics, finance, discrete
tomography, discrete and hybrid dynamical systems, and other fields

Abstract submission
-------------------

Only electronic submissions will be accepted (in pdf format), via EURO
online system:

https://www.euro-online.org/conf/ecco2017/

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

Two special issues (Journal of the Operations Research Society of
China, snd Discrete Applied Mathematics) will be dedicated to the
conference.

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

Abstract submission starts: December 1st, 2016
Abstract submission closes: March 1st, 2017
Notification of acceptance: March 19th, 2017
Deadline for early registration: April 1st, 2017
Conference: May 3rd-6th, 2017

Confirmed Plenary Speakers
--------------------------
Robert Bixby, Rice University, USA
Xiaotie Deng, Shanghai Jiaotong University, China
Bernard Ries, University of Fribourg, Switzerland
Gerhard Woeginger, RWTH Aachen University, Germany

Committees
----------

General Conference Committee
Xiaodong Hu, Chinese Academy of Sciences
Silvano Martello, University of Bologna
Gerhard Wäscher, Otto von Guericke University Magdeburg

Program Committee
Andrej Brodnik, University of Primorska and University of Ljubljana -
co-chair
Guochuan Zhang, Zhejiang University - co-chair
Jacek Blazewicz, Poznan University of Technology
Xujin Chen, Chinese Academy of Sciences
Van-Dat Cung, Institut Polytechnique de Grenoble
Alain Hertz, Ecole Polytechnique de Montréal
Liying Kang, Shanghai University
Minming Li, The City University of Hong Kong
Xiwen Lu, East China University of Science and Technology
Silvano Martello, University of Bologna
Paolo Toth, University of Bologna
Dachuan Xu, Beijing University of Technology
Gerhard Wäscher, Otto von Guericke University Magdeburg
Zhao Zhang, Zhejiang Normal University

Organizing Committee
Andrej Brodnik, University of Primorska and University of Ljubljana -
co-chair
Degang Liu, Chinese Academy of Sciences - co-chair
Guangting Chen, Taizhou University
Rok Požar, University of Primorska
Xin Liu, Chinese Academy of Sciences
Yindong Shen, Huazhong Univeristy of Science and Technology

--
Andrej (Andy) Brodnik

University of Ljubljana
Faculty of Computer and Information Science

-------------------------------------------------------
We love you. We are sorry. Please forgive us. Thank you.
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues

- Through this links above you can "subscribe", "unsubscribe", or change your settings in the list.
OR
- Easy unsubscribe: http://mailman.ufsc.br/mailman/options/mycolleagues

[DMANET] Call for Papers - ACM Workshop SecDef 2017

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

Call for Papers - ACM Workshop SecDef 2017

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

Dear Colleagues,

It is our pleasure to announce the fourth ACM Workshop on Genetic and
Evolutionary Computation in Defense, Security, and Risk Management
(SecDef'2017) will be held in conjunction with the ACM Genetic and
Evolutionary Computation Conference (GECCO) in Berlin, Germany, July 15-19,
2017.

With the constant appearance of new threats, research in the areas of
defense, security and risk management has acquired an increasing importance
over the past few years. These new challenges often require innovative
solutions and computational intelligence techniques can play a significant
role in finding them.

We invite completed or ongoing work, with the aim to encourage
communication between active researchers and practitioners to better
understand the current scope of efforts within genetic and evolutionary
computation on defense, security and risk. The ultimate goal is to
understand, discuss, and help set future directions for our community.
Authors are invited to submit papers that fall into or are related to one
or multiple topic areas listed below:

Security:
- Intrusion Detection
- Anomaly Detection
- Signature-Based Detection
- Behavior Monitoring
- Network Traffic Analysis
- System Data Analysis
- Application Data Analysis
- Attack Prevention and Defense Systems
- Threat Forecasting Systems
- Anti Spam and/or Antivirus Systems
- Bring Your Own Device
- Critical Infrastructure Protection
- Advanced Persistent Threats

Defense:
- Design of Military Systems and Sub-Systems
- Logistics and Scheduling of Military Operations
- Strategic Planning and Tactical Decision Making
- Logistics and Scheduling of Military Operations
- Examining Trade-offs in Military and Counter-Terrorism Procedures
- Automated Discovery of Tactics and Procedures for Military and Defense
Systems
- Cyber Warfare
- Cyber Fraud
Risk:
- Identification, Prevention, Monitoring, and Handling of Risks
- Risk Impact and Probability Estimation Systems
- Contingency Plans,
- Real Time Risk Management
- Policy Management

The submission deadline is March 15, 2017. A detailed description of the
workshop and submission instructions may be found at:
https://projects.cs.dal.ca/projectx/secdef2017/callforpapers.html

We look forward to receiving your papers and meeting you at the conference!

Best regards,

Anna I. Esparcia-Alcázar, Universitat Politècnica de València, Spain
Gunes Kayacik, Qualcomm Research Silicon Valley, USA
Frank W. Moore, University of Alaska Anchorage, USA
Nur Zincir-Heywood, Dalhousie University, Canada

**********************************************************
*
* 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: Joint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization -- ECCO XXX

LPA

Call for Papers

Joint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization
(ECCO XXX)

Koper, Slovenia, May 3rd - 6th, 2017
http://ecco2017.euro-online.org
mailto:ecco-xxx@iam.upr.si

The conference is jointly organized by EURO and ORSC. For more
details, please, visit the conference site as the information is added
frequently.

Aims and objectives
-------------------

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

Scope and Topics
----------------

We seek submissions in all areas of combinatorial optimization from
theory through applications. Suggested, but not exclusive, topics
include:

- theory and applications of combinatorial optimization
- exact solution algorithms, approximation algorithms, heuristics, and
meta-heuristics for combinatorial optimization problems
- integer programming, global optimization, stochastic integer
programming, multi-objective programming, graph theory and network
flows
- application areas include logistics and supply chain optimization
manufacturing, energy production and distribution, land
consolidation telecommunications, bioinformatics, finance, discrete
tomography, discrete and hybrid dynamical systems, and other fields

Abstract submission
-------------------

Only electronic submissions will be accepted (in pdf format), via EURO
online system:

https://www.euro-online.org/conf/ecco2017/

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

Two special issues (Journal of the Operations Research Society of
China, snd Discrete Applied Mathematics) will be dedicated to the
conference.

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

Abstract submission starts: December 1st, 2016
Abstract submission closes: March 1st, 2017
Notification of acceptance: March 19th, 2017
Deadline for early registration: April 1st, 2017
Conference: May 3rd-6th, 2017

Confirmed Plenary Speakers
--------------------------
Robert Bixby, Rice University, USA
Xiaotie Deng, Shanghai Jiaotong University, China
Bernard Ries, University of Fribourg, Switzerland
Gerhard Woeginger, RWTH Aachen University, Germany

Committees
----------

General Conference Committee
Xiaodong Hu, Chinese Academy of Sciences
Silvano Martello, University of Bologna
Gerhard Wäscher, Otto von Guericke University Magdeburg

Program Committee
Andrej Brodnik, University of Primorska and University of Ljubljana -
co-chair
Guochuan Zhang, Zhejiang University - co-chair
Jacek Blazewicz, Poznan University of Technology
Xujin Chen, Chinese Academy of Sciences
Van-Dat Cung, Institut Polytechnique de Grenoble
Alain Hertz, Ecole Polytechnique de Montréal
Liying Kang, Shanghai University
Minming Li, The City University of Hong Kong
Xiwen Lu, East China University of Science and Technology
Silvano Martello, University of Bologna
Paolo Toth, University of Bologna
Dachuan Xu, Beijing University of Technology
Gerhard Wäscher, Otto von Guericke University Magdeburg
Zhao Zhang, Zhejiang Normal University

Organizing Committee
Andrej Brodnik, University of Primorska and University of Ljubljana -
co-chair
Degang Liu, Chinese Academy of Sciences - co-chair
Guangting Chen, Taizhou University
Rok Požar, University of Primorska
Xin Liu, Chinese Academy of Sciences
Yindong Shen, Huazhong Univeristy of Science and Technology

--
Andrej (Andy) Brodnik

University of Ljubljana
Faculty of Computer and Information Science

**********************************************************
*
* 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] IFORS 2016 - OR in Sports

Call for sessions/papers within the stream "OR in Sports"
at the 21st IFORS Conference
July 17-21, 2017 in Quebec, Canada

We (Dries Goossens and James Cochran) are putting together a number of sessions on OR in Sports for the IFORS Meeting next July in Quebec City, Canada (more information about the conference can be found at http://ifors2017.ca).  We'd like to have a sports track covering various areas such as optimization, analytics, graph theory, mathematics, and statistics.

If you plan to present a paper within this stream (or if you want to organize a full session of 3-4 talks), please let us know (dries.goossens@ugent.be or jcochran@cba.ua.edu). We are glad to send you a session code such that you may submit your paper in an invited session. Note that the deadline for abstract submission is February 10, 2017.

Furthermore, if you are interested/involved in any quantitative research that is related to sports in a broad sense, you may want to enjoy a free membership of the "OR in Sports" working group (see orinsports.com). This group also maintains a list of conferences on OR/analytics and sports: http://orinsports.com/index.php/events/.

Best regards,
James and Dries

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

[Mycolleagues] IFORS 2017 in Quebec, Canada

Dear ladies and gentlemen,


"Welcome to the webpage of the 21st Conference of the International
Federation of Operational Research Societies. We are delighted to host
the IFORS 2017 conference under the theme of "OR/Analytics for a
better world". The conference will be held between 17-21 July 2017 in
Quebec City, the capital of the province of Quebec, Canada."

(http://ifors2017.ca/)


Thank you very much for your attention.

With kind regards,
best wishes,
Gerhard-Wilhelm Weber


-------------------------------------------------------
We love you. We are sorry. Please forgive us. Thank you.
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues

- Through this links above you can "subscribe", "unsubscribe", or change your settings in the list.
OR
- Easy unsubscribe: http://mailman.ufsc.br/mailman/options/mycolleagues

[Mycolleagues] Researcher position available

KDDI Research Inc., based in Saitama, Japan is looking for
researchers with a strong background and interest in one or more of the
following areas:

- Cryptography and Information Security
e.g. Symmetric/Asymmetric Crypto., Provable Security of Cryptographic
Primitives, Post-Quantum Crypto., Homomorphic Encryption,
Privacy-Preserving Data Mining, and Application of Cryptographic Primitives.

The position is available within the Information Security Laboratory at
KDDI Research. The applicant is expected to have (or be close to
completion of) a
PhD in Computer Science, Mathematics or a related field; and be fluent
in English. Japanese language skill is not essential but an advantage.
If offered the position, the candidate should be willing to relocate to
Japan.

KDDI Research Inc. is a research wing of KDDI Corporation -
Japan's second largest telecom operator by customer base, which provides
fixed and mobile communication services. Further information about the
research laboratory is available at: https://www.kddi-research.jp/english.

The deadline for the application is May 12, 2017.

For more information, please check the JREC web site
(https://jrecin.jst.go.jp/seek/SeekJorDetail?fn=3&dt=1&id=D116120695&ln_jor=1)
and contact us by email (inquiry@sec.kddilabs.jp).

Information Security Laboratory, KDDI Research Inc.

-------------------------------------------------------
We love you. We are sorry. Please forgive us. Thank you.
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues

- Through this links above you can "subscribe", "unsubscribe", or change your settings in the list.
OR
- Easy unsubscribe: http://mailman.ufsc.br/mailman/options/mycolleagues

[DMANET] BBC 2017 - Deadline Extension

BBC 2017 : 10th Workshop on Biomedical and Bioinformatics Challenges
for Computer Science - BBC 2017
Zurich, Switzerland, June 12-14, 2017

https://bbc2017.wordpress.com/

AIMS & SCOPE
================
Emerging technologies in genomics, transcriptomics, metagenomics and
other life science areas are generating an increasing amount of
complex data and information. Traditionally, bioinformatics has been
focused on the design of methods and technologies facilitating the
acquisition, storage, organization, archiving, analysis and
visualization of biological and medical data. However, recent changes
related to the emerging technologies have made the role of computer
science (both theoretical and applied aspects) much more critical in
all the bioinformatics research directions.

Computational biology, on the other hand, has emphasized mathematical
and computational techniques facilitating the modelling and simulation
of biomedical processes and systems.

In recent years the distinction between these two fields has become
increasingly blurred. In order to tackle the growing complexity
associated with emerging and future life science challenges,
bioinformatics and computational biology researchers and developers
need to explore, develop and apply novel computational concepts,
methods, tools and systems.

Many of these new approaches are likely to involve advanced and
large-scale computing techniques, computational approaches,
technologies and infrastructures such as:

High-performance architectures and systems (e.g. multicore, GPU);
Distributed computing (e.g. grid, cloud, peer-to-peer, Web services,
e-infrastructures);
Computational simulation (mechanistic, stochastic, multi-model);
Algorithms (theoretical and experimental aspects);
Applied bioinformatics (analysis pipelines, tools, applications);
Artificial and computational intelligence (machine learning, agents,
evolutionary techniques, bio-inspired methods).
Together, these topics cover the key bioinformatics and computational
biology techniques and technologies encountered in modern life science
environments:

Advanced computing architectures/infrastructures
Data/information management and integrationData/information analysis
and knowledge discovery
Integration of quantitative/symbolic knowledge into executable
biomedical "theories" or models.
The aim of this workshop is to bring together computer and life
scientists to discuss emerging and future directions in these areas.

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

When Jun 12, 2017 - Jun 14, 2017
Where Zürich, Switzerland
Submission Deadline Jan 31, 2017 (Extended)
Notification Due March 10, 2017
Final Version Due Mar 31, 2017

This is the 10th edition of this workshop, which was previously held
in Kraków (2008), Baton Rouge (2009), Amsterdam (2010), Singapore
(2011), Omaha (2012), Barcelona (2013), Cairns (2014), Reykjavìk
(2015), and San Diego(2016).

WORKSHOP CO-ORGANIZERS
Giuseppe Agapito, University Magna Græcia of Catanzaro, Italy
Mario Cannataro, University Magna Græcia of Catanzaro, Italy (CHAIR)
Mauro Castelli, NOVA IMS – Universidade Nova de Lisboa, Portugal
Riccardo Dondi, University of Bergamo, Italy
Italo Zoppis, University of Milano-Bicocca, 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/
*
**********************************************************

[DMANET] Second: CFP for the BeyondMR 2017 workshop at SIGMOD

* Call for papers *

BEYONDMR'17
The 4th Workshop on Algorithms and Systems for MapReduce and Beyond, May 19, 2017.
https://sites.google.com/site/beyondmr2017/

Held in conjunction with SIGMOD 2017
Raleigh, NC, USA, May 14-19, 2017
http://sigmod2017.org/

----------------
KEYNOTES
----------------

Author: Ke Yi, Hong Kong University of Science and Technology, China

Title: The relationships among coarse-grained parallel models

----------------
WORKSHOP FOCUS
----------------

The third BeyondMR workshop aims to explore algorithms, computational
models, architectures, languages and interfaces for systems that need
large-scale parallelization and systems designed to support efficient
parallelization and fault tolerance. These include specialized programming
and data-management systems based on MapReduce and extensions, graph
processing systems, data-intensive workflow and dataflow systems.

We invite submissions on topics such as:

Frameworks for Large-Scale Analytical Processing:
- Models, architectures and languages for data processing pipelines,
data-intensive workflows, networks of operations/MapReduce jobs, dataflows,
and data-mashups.
- Analysis of programs for workflow systems, e.g., Spark.
- Expressing and parallelising iterations, incremental iterations, and
programs consisting of large networks of operations.
- Approaches to achieving fault tolerance and to recovering from failures.

Algorithms for Large-Scale Data Processing:
- Methods and techniques for designing efficient algorithms for MapReduce
and similar systems.
- Experiments and experience with new algorithms in these settings.

Cost Models and Optimization Techniques:
- Formal definitions of models that evaluate the efficiency of algorithms
in large-scale parallel processing systems taking into account the
requirements of such systems in different applications.
- Testing and benchmarking of MapReduce extensions and data-intensive
workflows.

Resource Management for Many-Task Computing:
- Scheduling of tasks and load-balancing techniques.
- Study of cases where automatic data distribution in MapReduce and
similar systems does not provide sufficient data balancing.
- Algorithms, methods and frameworks to address data skewness.

----------------
IMPORTANT DATES
----------------
Papers submission deadline: Wed Jan 27, 2017
Authors notification: Sun March 5, 2017
Deadline for camera-ready copy: Sun March 19, 2017
Workshop: Fri May 19, 2017

----------------
SUBMISSION GUIDELINES
----------------
We invite full research or experience papers (up to 10 pages), or short
papers (up to 4 pages) describing research in progress, formatted using
the ACM double-column style
(http://conferences.sigcomm.org/imc/2009/sig-alternate-10pt.cls)

----------------
PUBLICATION
----------------
The workshop proceedings will be published in ACM DL and the organizers
will prepare a SIGMOD Record report.

---------------------------
ORGANIZERS
---------------------------
- Foto Afrati National Technical University of Athens, Greece)
- Jan Hidders Vrije Universiteit Brussel, Belgium
- Paris Koutris University of Wisconsin-Madison, USA
- Jacek Sroka University of Warsaw, Poland
- Jeffrey Ullman Stanford University

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

- Paris Koutris, University of Wisconsin-Madison (CHAIR)
- Foto Afrati, National Technical University of Athens
- Sourav S. Bhowmick, Nanyang Technological University
- Yingyi Bu, Couchbase
- Ahmed Eldawy, University of California, Riverside
- Todd Green, LogicBlox
- Jan Hidders, Vrije Universiteit Brussel
- Asterios Katsifodimos, Technical University of Berlin
- Paraschos Koutris, University of Wisconsin-Madison
- Nectarios Koziris, National Technical University of Athens
- Ulf Leser, Humboldt-Universität zu Berlin
- Dionysios Logothetis, Facebook
- Frank McSherry
- Frank Neven, Hasselt University
- Daniel de Oliveira, Fluminense Federal University
- Krzysztof Onak, IBM T.J. Watson Research Center
- Fabio Porto, National Laboratory of Scientific Computation
- Chris Re, Stanford University
- Krzysztof Rzadca, University of Warsaw
- Semih Salihoglu, University of Waterloo
- Mark Santcroos, Rutgers University
- Francesco Silvestri, IT University of Copenhagen
- Yogesh Simmhan, Indian Institute of Science, Bangalore
- Jacek Sroka, University of Warsaw
- Dan Suciu, University of Washington
- Jeffrey Ullman, Stanford University
- Theodore Vassilakis, Microsoft
- Jianwu Wang, University of Maryland, Baltimore County
- Zhengkui Wang, National University of Singapore
- Ke Yi, Hong Kong University of Science and Technology
- Eiko Yoneki, University of Cambridge
- Matei Zaharia, Stanford University

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

[DMANET] Reminder for submission：Special Session on Model Reduction in Multi-Objective and Robust Design Optimization ，IEEE Congress on Evolutionary Computation 2017

***

Submission deadline: January 16, 2017.

***

IEEE Congress on Evolutionary Computation 2017, Donostia - San
Sebastián, Spain, June 5-8, 2017

http://cec2017.org/

***

Special Session on Model Reduction in Multi-Objective and Robust
Design Optimization

https://sites.google.com/site/adloptimization/home

***

Dear Colleagues,

We would like to kindly remind that the submission deadline for the
Special Session on Model Reduction in Multi-Objective and Robust
Design Optimization ，IEEE Congress on Evolutionary Computation 2017
(CEC2017), January 16, 2017, is getting closer.

**Important date**

Deadline for contribution paper submission: January 16, 2017.
Notification of acceptance: February 26, 2017
Final paper submission: March 12, 2017
Conference dates:
June 5-8, 2017

IEEE CEC 2017 is a world-class conference that aims to bring together
researchers and practitioners in the field of evolutionary computation
and computational intelligence from all around the globe. The
special session aims to promote research on theoretical and practical
aspects of multi-objective optimization, surrogate assisted
optimization and robust design optimization, etc.

*Scope and Motivations*

With model reduction, e.g. Proper Orthogonal Decomposition (POD, also
called Principal Components Analysis, PCA) based model reduction,
expenses of optimization process can be greatly reduced. Take the
standard ZDT series test functions for example, it takes around 20
iterations for the MOO with POD model reduction to search the true
Pareto front. The model reduction can also be used in surrogate
assisted optimization and evidence approximation. With model
reduction, surrogate and evidence computation can be constructed on a
reduced data set, thus the sample size can be greatly reduced.

The optimization with model reduction shows advantages over
conventional MOOs and can be potentially extended to the scenarios
such as optimization problems with many objectives. However, to
implement successfully the methods in design optimization with
expensive model under uncertainty, a series of issues such as evidence
approximation, model fidelity management, optimization algorithm and
the strategy to integrate them, etc. should be resolved. We therefore
propose the special issue on Model Reduction in Multi-objective and
Robust Optimization.

**Scope and Topic:**

The session seeks to promote discussion and presentation of related
novel works. Topics may include, but are not limited to:

Multi-objective optimization
Many-objective optimization
Robust design optimization
Multi-Fidelity optimization
Uncertainty modeling
Parameter reduction
Data mining in Multi-objective and Many-objective Optimization
Model fidelity management
Surrogate of expensive model
Model reduction in Multi-objective and Many-objective Optimization
Infill strategy of surrogate
Surrogate assisted optimization
Evidence approximation of epistemic uncertainty
Multi-objective robust optimization under uncertainty
Applications of design optimization with prarameter reduction,
particularly the aerospace engineering design
Preliminary space mission design under uncertainty
Multi-objective optimization in preliminary space mission design

**Organizers**

Dr. Liqiang Hou, State Key Laoratory of Astronautic Dynamics, Xi'an
Staellite Control Center, Xi'an, China
Dr. Tapabrata Ray, School of Engineering and Information Technology
University of New South Wales, Canberra, Australia
Dr. Edmondo Minisci, Department of Mechanical & Aerospace Engineering
 of University of Strathclyde, Glasgow, UK

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

[DMANET] Scholarships for masters at ENS de Lyon, France

I send this message again, because some links were wrong, sorry.

Here is an announcement for scholarships for the master program at ENS de Lyon, France. In particular, applications to the master in Fundamental Computer Science at ENS de Lyon will be considered. Continuing with a phd is possible. The list of courses for 2017-2018 can be found here.

http://www.ens-lyon.fr/DI/?p=4946

____________________________
The ENS de Lyon and its partners offer scholarships for international students to enrol in its Masters programs in the Exact Sciences, the Arts, and Human and Social Sciences.

- The Ampère Scholarships of Excellence of the ENS de Lyon provide students with the opportunity to enrol in one of the ENS de Lyon Masters programs in the Exact Sciences, the Arts or the Human and Social Sciences.

- The MILYON Laboratory of Excellence (Labex MILYON) offers scholarships for enrolment in the Masters programs in Advanced Mathematics and Fundamental Computer Science.

The maximum financial support is 1,000 Euros per month for twelve months.

Students from all countries are eligible. Last year laureates had come from Cameroon, Vietnam, Brazil, Mali, United Kingdom, Burkina Faso, Kazakhstan, Ukraine, Italy, Korea, Czech Republic, Russia, Turkey, and United States.

Further information and the application form can be found on our website:
http://www.ens-lyon.fr/en

Closing date for application: 9 January 2017 12h00 pm (Time at Lyon ‐ France)

Contact :
Ecole normale supérieure de Lyon ‐ International Mobility Office Tel: +33 4 37 37 66 82

ampere.scholarship@ens‐lyon.fr

______________________________
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] CSR 2017: Last Call for Papers, Extended Deadline

Dear Colleagues,

Due to multiple requests we have decided to extend
the deadline for CSR-2017 by six days,
that is, until December 21 (anywhere on Earth).
Please note that this is a firm deadline.

Best regards,
Edward Hirsch

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Last Call for Papers
The 12th International Computer Science Symposium in Russia, CSR-2017
Kazan, Russia
June 8-12, 2017
http://logic.pdmi.ras.ru/csr2017/

---------------------------------
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.

They 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
applications of logic to computer science, e.g. proof theory, model
checking and verification
formal and algorithmic aspects of bio-informatics
current challenges such as quantum computing

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

Deadline for submissions: December 21, 2016 (23:59 anywhere on Earth).
Notification of acceptance: February 15, 2017.
Conference dates: June 8-12, 2017.

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

Thierry Coquand (Chalmers), distinguished opening lecture
Javier Esparza (Munich)
Elham Kashefi (Paris and Edinburgh)
Andrew McGregor (Amherst)
Ronitt Rubenfeld (MIT)
Marc Zeitoun (Bordeaux)

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

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

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.

For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference.

Additionally, selected papers will be invited to a special issue of Theory of Computing Systems and will be refereed according to the journal's procedure.

---------------------------------
Yandex Awards

for the best paper and for the best student paper will be given by the PC.

---------------------------------
Organizers and sponsors

CSR is organized by Kazan Federal university (Volga region), with the support of (tentative list):

The Russia Foundation for Basic Research, http://www.rfbr.ru/rffi/eng/info
Kazan Federal University, http://kpfu.ru/eng
Yandex, https://www.yandex.com/

---------------------------------
Organizing committee (tentative)

The organizing committee can be reached at the following address: CSR2017.Kazan@gmail.com

Farid Ablayev (KFU), chair
Aida Gainutdinova (KFU)
Anton Marchenko (KFU)
Daniil Musatov (MIPT)
Alexander Vasiliev (KFU)
Valeria Volkova (KFU)
Mansur Ziatdinov (KFU)
Marsel Sitdikov (KFU)

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

Farid Ablayev (Kazan, RU)
Ittai Abraham (Jerusalem, IL)
Isolde Adler (Leeds, UK)
Frédérique Bassino (Paris Nord, FR)
Véronique Bruyère (Mons, BE)
Maike Buchin (Bochum, DE)
Hubie Chen (San Sebastian, ES)
Anuj Dawar (Cambridge, UK)
Stéphanie Delaune (Cachan, FR)
Anna Frid (Marseille, FR)
Elena Grigorescu (Purdue, US)
Krishna S (Mumbai, IN)
K.N. Kumar (Chennai, IN)
Frédéric Magniez (Paris, FR)
Meena Mahajan (Chennai, IN)
Grigory Marshalko (Moscow, RU)
Catuscia Palamidessi (Saclay, FR)
Victor Selivanov (Novosibirsk, RU)
Kavitha Telikepalli (Mumbai, IN)
Thomas Thierauf (Aalen, DE)
Szymon Torunczyk (Warsaw, PL)
Hélène Touzet (Lille, FR)
Mikhail Volkov (Ekaterinburg, RU)
Dorothea Wagner (Karlsruhe, DE)
Pascal Weil (Bordeaux, FR), chair

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

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

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

CSR 2016 took place in St.Petersburg, Russia
The list of previous CSR webpages can be found at
http://logic.pdmi.ras.ru/~csr/

UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
**********************************************************
*
* 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/
*
**********************************************************

PhD opportunity in Operations Research and Optimization at University of Newcastle, Australia

Dear all,

There is an opportunity for a PhD scholarship in Operations Research at University of Newcastle, Australia. Please see below for a description of the project. Please feel free to circulate it to your colleagues/research teams.

Regards,

Amir

----------------------------
Dr Amir Salehipour
ARC DECRA Fellow
School of Mathematical and Physical Sciences
University of Newcastle (UON), AUSTRALIA
www.newcastle.edu.au/profile/a-salehipour

Tel: (+61) 0467670987

-------------------------------------------------------------------------------
Apologies for cross-posting

PhD Scholarship in Operations Research
University of Newcastle, Australia
School of Mathematical and Physical Sciences

Project topic
The topic of the PhD dissertation will on developing optimization tools and solution methodologies for the Aircraft Landing Problem, where the focus is on exact algorithms.

Summary
The Aircraft Landing Problem (ALP) is an important class of scheduling problems. Optimal solution of an ALP has applications in the areas of transportation and health care delivery, providing significant benefits to systems experiencing long delays. Available solution methodologies for the ALP cannot solve very large size instances of the problem. This PhD project will build the optimization tools to advance current solution methodologies for the ALP.

Scholarship: a stipend of $26,682 per annum (2017 rate). Successful international applicants will have the tuition fees waived for the duration of the scholarship. For more on the available scholarships at the University of Newcastle see https://www.newcastle.edu.au/research-and-innovation/graduate-research/phd-and-research-degrees/scholarships

How to apply: Interested applicants are encouraged to send their expression of interest including transcripts and CV to Dr Amir Salehipour at a.salehipour@newcastle.edu.au before 10 January 2017.

Eligibility: Honors or Masters degree in Industrial Engineering, Mathematics, Computer Sciences or related fields. Applicants are expected to have a strong understanding of mathematical programming, and exact and heuristic algorithms. Having a good grasp of meta-heuristic algorithms is an advantage. Experience in programming in C++, and Python as well as working with the solver CPLEX/Gurobi is a must.
The applications are considered as soon as they are received.
-------------------------------------------------------------------------------

[DMANET] Pre- and Post-Doctoral Positions in Algorithmic and Enumerative Combinatorics

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% PRE- and POST-DOCTORAL POSITIONS in %
% ALGORITHMIC AND ENUMERATIVE COMBINATORICS %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

The Special Research Program (SFB) "ALGORITHMIC AND ENUMERATIVE
COMBINATORICS," a four-year programme (March 1, 2017 - Feb. 28, 2021)
funded by the Austrian Science Foundation FWF, is offering post-
and pre-doctoral positions at each of its five associated research
groups at the University of Vienna, at the Johannes Kepler University
Linz (JKU), at the Vienna University of Technology, and at the Austrian
Academy of Sciences in Linz.

"Algorithmic and Enumerative Combinatorics," as we understand it,
is the general research area which is defined by the interplay
of the fields of Enumerative Combinatorics, Analytic Combinatorics,
and Algorithmics.
The SFB joins the forces of the Combinatorics Group at the University
of Vienna, the Combinatorics and Algorithms Group at the Vienna
University of Technology, and the joint Symbolic Combinatorics Group
in Linz formed by the RISC and the Institute for Algebra at the
Johannes Kepler University Linz, and the RICAM at the Austrian Academy
of Sciences, in order to significantly advance our knowledge
in this branch of Combinatorics and related fields.

The SFB consists of nine project parts, run by:

Michael Drmota (TU Wien)
Ilse Fischer (Universit\"at Wien)
Bernhard Gittenberger (TU Wien)
Manuel Kauers (Institute for Algebra, JKU)
Christoph Koutschan (RICAM Linz)
Christian Krattenthaler (Universit\"at Wien)
Peter Paule (RISC, JKU)
Veronika Pillwein (RISC, JKU)
Carsten Schneider (RISC, JKU)

For more specific information see the SFB WWW Site

https://www.sfb050.risc.jku.at/

We explicitly encourage female researchers to apply for the offered
positions. We guarantee that the selection process, based solely on
the research records, will give equal opportunities to female and
male researchers.

Interested applicants should submit an application with
CV, list of publications, an indication with whom the applicant
would like to work (multiple choice is possible),
and in addition ask 2 (for postdocs), respectively 1 (for pre-docs),
people to send letters of evaluation,
no later than

JANUARY 31, 2017.

The application should be done using the website

https://www.sfb050.risc.jku.at/application

Late applications will be considered until all the positions are filled.

For more detailed information see the SFB WWW Site

https://www.sfb050.risc.jku.at/

General enquiries about the programme and the opportunities it is
offering for early career researchers should be made in the
first instance to the Speaker of the SFB, Christian Krattenthaler
(Christian.Krattenthaler@univie.ac.at).

**********************************************************
*
* 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 in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for up to four PhD positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The PhD positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory. The overarching goal is to understand fundamental properties of efficient computation by proving mathematical theorems about the power and limitations of different computational models.

This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.

In addition to the PIs and the announced PhD positions, the research project will also involve 2-3 existing PhD students and 3-4 postdocs. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

These are a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidates are expected to start at the latest in August-September 2017, although this is to some extent negotiable. The positions are fully funded and come with a competitive salary.

The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0832-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries about this position are welcome and may be sent to apc@csc.kth.se .

**********************************************************
*
* 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] Algorithm Developer Positions at Optym

Algorithm Developer Positions at Optym
*********************************

Optym is developing software solutions for the transportation and logistics industry that will automate operations and replace human decision-making by machine decision-making. Founded in 2000 by a leading researcher and academician, with its headquarter located in Gainesville, FL, and branches in four countries, Optym has over 200 highly qualified professionals worldwide.

Optym is seeking bright, motivated and ambitious individuals which will help us become a leading decision automation and optimization software provider for airlines, railroads and trucking companies worldwide. The company is fully employee-owned and offers competitive salaries and comprehensive benefits package including profit sharing and stock options. Compensation and perks offered are above industry standards, and based on candidates' capability and experience. Learn more at: www.optym.com.

Job Description:
*************
* Data analytics and business intelligence
* Building models (MIP, Network Optimization, Combinatorial Optimization, Discrete Event Simulation)
* Designing and implementing algorithms
* R&D of new upcoming techniques to bring into the company

Qualifications:
************
* Ph.D. degree in Computer Science, Industrial Engineering or Operations Research
* Background in modeling, algorithms, data structures and optimization
* Excellent programming skills
* Excellent problem-solving, analytical and communications skills

Why you should join Optym:
***********************
* Interesting and challenging projects
* Highly educated, intelligent and inspired team
* Culture of innovation and creativity
* Ability to make a big societal impact

Application Process:
*****************
* Please email your resume for consideration to mailto:jobs.us@optym.com along with a cover letter explaining why you would be a great fit for the job and the company.

___________________________________________________________

Ravindra K. Ahuja, Ph.D. | President & CEO
Optym - Live Efficiently | 7600 NW 5th Place, Gainesville, FL 32607 | USA
M: +1-352-870-8401 | mailto:ravindra.ahuja@optym.com
http://www.optym.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/
*
**********************************************************

Postdoc positions in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for up to four postdoctoral positions in theoretical computer science.

 

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The postdoc positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory.

 

This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.

 

In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 5-7 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

 

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

 

These postdoc positions are full-time employed positions for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.

 

The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0871-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc@csc.kth.se.

[DMANET] Postdoc positions in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for up to four postdoctoral positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The postdoc positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory.

This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.

In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 5-7 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

These postdoc positions are full-time employed positions for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.

The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0871-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc@csc.kth.se.

**********************************************************
*
* 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] EUROCOMB 2017 - 2ND ANNOUNCEMENT

************************************************************
2nd ANNOUNCEMENT AND CALL FOR PAPERS
EUROPEAN CONFERENCE ON COMBINATORICS,
GRAPH THEORY AND APPLICATIONS
EUROCOMB 2017
http://www.dmg.tuwien.ac.at/eurocomb2017/
Vienna, August 28 - September 1, 2017
************************************************************

The conference Eurocomb 2017 will take place at the TU Wien (Vienna,
Austria)
from August 28 - September 1, 2017.

SCOPE.

In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague),
EuroComb'05 (Berlin),
Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), Eurocomb'11 (Budapest),
Eurocomb'13 (Pisa),
and Eurocomb'15 (Bergen), this conference will cover the full range of
Combinatorics and Graph Theory
including applications in other areas of Mathematics, Computer Science
and Engineering.
Topics include, but are not limited to:

Algebraic Combinatorics
Combinatorial Geometry
Combinatorial Number Theory
Combinatorial Optimization
Designs and Configurations
Enumerative Combinatorics
Extremal Combinatorics
Graph Theory
Ordered Sets
Random Methods
Topological Combinatorics

IMPORTANT DATES:
Abstract Submission deadline : March 15th, 2017
Nomination for the European Prize in Combinatorics, April 15th, 2017
Abstract Acceptance: April 30th, 2017
Full paper deadline: May 27th, 2017
Early registration deadline: June 30, 2017
Conference: August 28 - September 1, 2017

ORGANIZATION:

The conference is organized in Vienna at the TU Wien, in collaboration
with the University of Vienna,
the TU Graz, and the Center for Discrete Mathematics, Theoretical
Computer Science
and Applications (DIMATIA) of Charles University.

CONFERENCE POSTER:

http://www.dmg.tuwien.ac.at/eurocomb2017/wp-content/uploads/2016/12/Eurocomb-Poster-1.pdf

CONTACT:

The organizing committee can be contacted at: michael.drmota@tuwien.ac.at
For up to date information consult the conference web site:
http://www.dmg.tuwien.ac.at/eurocomb2017/

INVITED SPEAKERS

Guillaume Chapuy, Université Paris Diderot
Julia Chuzhoy, University of Chicago
Irit Dinur, Weizmann Institute
Zoltan Füredi, Hungarian Acad. Sci
Yoshi Kohayakawa, Universidade de São Paulo
Andrew Suk, University of Illinois at Chicago
Endre Szemeredi, Alfréd Rényi Institute
Lauren Williams, University of California, Berkeley
Gerhard Wöginger, RWTH Aaachen
Paul Wollan, University of Rome

SUBMISSIONS

Submission should have: A title, a list of authors with affiliations,
and a brief abstract
(up to 5 pages in A4) describing recent original theoretical results or
applications of
Combinatorics and Graph Theory. They should be submitted as a pdf-file
using the interface provided at

https://easychair.org/conferences/?conf=eurocomb2017
by March 15th, 2017.

FULL PAPERS/POSTERS

Submission can be accepted either as a full paper or as poster. An
author for each accepted paper (as full or poster)
is required to register at the conference (at academic/speaker rate).
Authors of full papers will deliver a 20 min presentation of their results.
Authors of posters will deliver a 5 min presentation of their results
and participate in a poster session.

PROCEEDINGS

A proceedings book will be edited. The proceedings will include full
papers (5 pages limit) and poster papers (1 page limit).

JOURNAL SPECIAL ISSUE

It is planned to publish a special issue in a Combinatorics Journal that
will be devoted to selected papers contributed to the conference.
The usual high standards of the journals will be applied through a
strict and thorough refereeing process.

EUROPEAN PRIZE IN COMBINATORICS

Continuing with the tradition established at EuroComb'03 in Prague the
European Prize in Combinatorics
will be awarded during the conference EuroComb 2017. The prize is
established to recognize excellent
contributions in Combinatorics, Discrete Mathematics and their
Applications by young European researchers
(eligibility of EU) not older than 35. The prize carries a monetary
award of 2500 Euro.
The nomination letter including CV and the list of publications of the
nominee must be sent
to the organizers of EUROCOMB'17 before April 15, 2017. The nominations
will be evaluated by an
international jury. The award of 2500 EURO for 2017 is founded with
contributions
of DIMATIA, local organizers and Elsevier B.V.

Looking forward to see you in Vienna.

Michael Drmota and Jarik Nesetril

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

PhD position in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in computer science focused on SAT solving.

 

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The PhD student will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving (basically 0/1 integer linear programming).

 

The research project is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of two postdoctoral researchers and four PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

 

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate is expected to start at the latest in August-September 2017, although this is to some extent negotiable. The position is fully funded and comes with a competitive salary.

 

The application deadline is January 15, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2016-0833-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .