Sunday, September 24, 2017

[DMANET] CSR 2018: Call for Papers

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

С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

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

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

---------------------------------
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] ISAIM 2018: Final Call for Papers

FINAL CALL FOR PAPERS

Fifteenth International Symposium on
ARTIFICIAL INTELLIGENCE and MATHEMATICS
ISAIM 2018
http://isaim2018.cs.virginia.edu/
January 3-5, 2018
Fort Lauderdale, Florida

PAPER SUBMISSION DEADLINE: Tuesday, October 3, 2017

The International Symposium on Artificial Intelligence and Mathematics (ISAIM) is a biennial meeting that fosters interactions between mathematics, theoretical computer science, and artificial intelligence. This is the fifteenth Symposium in the series, which is sponsored by Annals of Mathematics and Artificial Intelligence. We seek submissions of recent results with a particular emphasis on the foundations of AI and mathematical methods used in AI. Papers describing applications are also encouraged, but the focus should be on principled lessons learned from the development of the application. Traditionally, the Symposium attracts participants from a variety of disciplines, thereby providing a unique forum for scientific exchange. The three-day Symposium includes invited speakers, presentations of technical papers, and special topic sessions.


KEYNOTE SPEAKERS:

o Craig Boutilier, University of Toronto

o Cynthia Rudin, Duke University


SPECIAL TOPIC INVITED SESSIONS:

o Flow Optimization in Traffic Networks
-Organized by Michael Albert, Duke University, and Guni Sharon, The University of Texas at Austin

o Boolean and pseudo-Boolean Functions
-Organized by Endre Boros, Rutgers University, and Yves Crama, University of Liege

o Formalising Robot Ethics
-Organized by Michael Fisher, University of Liverpool, and Marija Slavkovik, University of Bergen

o Topological Reasoning and Data Analyses
-Organized by Debasis Mitra, Florida Istitute of Technology

o Theory of Machine Learning
-Organized by Lev Reyzin, University of Illinois at Chicago


PAPER SUBMISSION:

Paper submission will be electronic via the submission link to EasyChair on the Paper Submission page of the Symposium website (/isaim2018.cs.virginia.edu/). Papers must be formatted in accordance with the guidelines given there.

The submission deadline is Tuesday, October 3, 2017 (11:59PM PDT). Papers will be reviewed by members of the Program Committee. Authors will be notified of acceptance or rejection by Tuesday, October 31, 2017. Final versions of accepted papers, for inclusion in the conference electronic proceedings, are due by Monday, November 27, 2017.

Work that has already been published as of the ISAIM submission deadline should not be submitted to ISAIM unless it introduces a significant addition to the previously published work. However, the ISAIM web site proceedings are not archival, so papers submitted to ISAIM can be under review at the time of submission and can be submitted elsewhere after ISAIM.

Authors of a selected set of papers from the Symposium will be invited to submit full versions of their papers for inclusion in a special volume of the Annals of Mathematics and Artificial Intelligence, published by Springer. Those invited submissions will be subject to refereeing at the usual standards of the journal, and authors will receive more details with the acceptance notice. Papers must of course be new and unpublished to be considered for the special volume.

Any questions regarding paper submission should be sent to the program committee chair at the email address <isaim2018 at mail DOT cs DOT virginia DOT edu>.


IMPORTANT DATES:

Paper submission: Tuesday, October 3, 2017
Notification: Tuesday, October 31, 2017
Final version due: Monday, November 27, 2017
Workshop: January 3-5, 2018, Ft. Lauderdale, Florida


ORGANIZERS:

o General Chair: Martin Charles Golumbic, University of Haifa
o Conference Chair: Frederick Hoffman, Florida Atlantic University
o Program Committee Chairs: Juergen Dix, TU Clausthal
Guillermo R. Simari, Universidad Nacional del Sur
o Publicity Chair: Dimitrios I. Diochnos, University of Virginia


PROGRAM COMMITTEE:

Franz Baader TU Dresden
Salem Benferhat Universite d'Artois
Endre Boros Rutgers University
Gerhard Brewka Leipzig University
Yixin Chen Washington University in St. Louis
Berthe Choueiry University of Nebraska-Lincoln
Yves Crama University of Liege
Dimitrios I. Diochnos University of Virginia
Agostino Dovier Universita degli Studi di Udine
Michael Fisher University of Liverpool
Georg Gottlob University of Oxford
Warren Hunt The University of Texas at Austin
Anthony Hunter University College London
Vladimir Lifschitz The University of Texas at Austin
Gerhard Lakemeyer Aachen University of Technology
Hector Levesque University of Toronto
Vladimir Lifschitz University of Texas at Austin
Larry M. Manevitz University of Haifa
Debasis Mitra Florida Institute of Technology
Leora Morgenstern Leidos, Inc., Reston
Maurice Pagnucco University of New South Wales
Francesca Rossi IBM Research and University of Padova
David Sarne Bar-Ilan University
Marija Slavkovik University of Bergen
Christine Solnon INSA Lyon
Miroslaw (Mirek) Truszczynski University of Kentucky
Gyorgy Turan University of Illinois at Chicago and University of Szeged
Miroslav N. Velev Aries Design Automation
Kristen Brent Venable Tulane University and IHMC
Toby Walsh NICTA and University of New South Wales
Neil Yorke-Smith TU Delft and American University of Beirut


Send inquiries and requests to isaim2018 at mail DOT cs DOT virginia DOT edu.
Visit http://isaim2018.cs.virginia.edu/.
Join isaim@googlegroups.com to receive announcements related to ISAIM.


**********************************************************
*
* 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, September 23, 2017

[DMANET] 7th Int. Conf. HPSC Hanoi, March 2018 deadline is approaching

7th INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SCIENTIFIC COMPUTING

Modeling, Simulation and Optimization of Complex Processes
March 19-23, 2018
Hanoi, Vietnam

Detailed information can be found at the conference
websiteshttp://www.math.ac.vn/HPSCHanoi2018/
andhttp://hpsc.iwr.uni-heidelberg.de/HPSCHanoi2018/
(Participants can register, reserve hotel and submit data needed for
applying for a Vietnamese visa by using these conference websites.)

PROCEEDINGS: The conference proceedings with selected high-quality contributions
will be published by Springer.

DATES TO REMEMBER
Deadline for registration and submission of abstracts: September 29, 2017.
Notification of acceptance for presentation: December 22, 2017.
Deadline for applying a business visa through the organizers: January 19, 2018.
Deadline for hotel reservation: January 19, 2018.

Contact address: hpsc2018@math.ac.vn

**********************************************************
*
* 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, September 22, 2017

[DMANET] 2nd CFP to DCC '18 session Computation over Compressed Data

Dear Colleague,

The November 1st deadline for the next *Data Compression Conference* (DCC
'18) is approaching and we would like to remind you that there will be a
special session on *c**omputation over compressed data*. We invite you to
submit interesting new results you may have both on *compact data
structures* and on *compression-aware algorithms*.

The DCC '18 session will extend the special sessions at DCC '14 and '16 on
*c**ompact data structures*, which resulted in special issues of the *Journal
of Discrete Algorithms* (published) and *Algorithmica* (in press):
---
http://www.sciencedirect.com/science/journal/15708667/43/supp/C?sdc=1
https://link.springer.com/journal/453/topicalCollection/AC_8c2552fc6eb1f8e828de642aaeb0f48f/page/1
---
We plan to invite extended versions of selected papers from the DCC '18
session to a special issue of *Information and Computation*.

The conference will take place from March 27th to 30th, in Snowbird, Utah
(a premier ski resort in the Rocky Mountains). The DCC submission process
(see http://www.cs.brandeis.edu/~dcc/Call.html) will allow authors to
direct their papers to the special session, but submissions will be
otherwise handled in the same way, will be subject to the same review
process and, if accepted, will be included in the same proceedings.

Best regards,
Travis Gagie and Gonzalo Navarro
(session co-chairs)

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

[DMANET] Special Issue on Parallel and Distributed Data Mining

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier


The sheer volume of new data, which is being generated at an =
increasingly fast pace, has already produced an anticipated data deluge =
that is difficult to challenge. We are in the presence of an =
overwhelming vast quantity of data, owing to how easy is to produce or =
derive digital data. Even the storage of this massive amount of data is =
becoming a highly demanding task, outpacing the current development of =
hardware and software infrastructure. Nonetheless, this effort must be =
undertaken now for the preservation, organization and long-term =
maintenance of these precious data. However, the collected data is =
useless without our ability fully understand and make use of it. =
Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in =
order to extract useful and interesting information have become popular =
in many different contexts. Algorithms are required to make sense of =
data automatically and in efficient ways. Nonetheless, even though =
sequential computer systems performance is improving, they are not =
suitable to keep up with the increase in the demand for data mining =
applications and the data size. Moreover, the main memory of sequential =
systems may not be enough to hold all the data related to current =
applications.

This Special Issue takes into account the increasing interest in the =
design and implementation of parallel and distributed data mining =
algorithms. Parallel algorithms can easily address both the running time =
and memory requirement issues, by exploiting the vast aggregate main =
memory and processing power of processors and accelerators available on =
parallel computers. Anyway, parallelizing existing algorithms in order =
to achieve good performance and scalability with regard to massive =
datasets is not trivial. Indeed, it is of paramount importance a good =
data organization and decomposition strategy in order to balance the =
workload while minimizing data dependences. Another concern is related =
to minimizing synchronization and communication overhead. Finally, I/O =
costs should be minimized as well. Creating breakthrough parallel =
algorithms for high-performance data mining applications requires =
addressing several key computing problems which may lead to novel =
solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically =
distributed sites. Centralized processing of this data is very =
inefficient and expensive. In some cases, it may even be impractical and =
subject to security risks. Therefore, processing the data minimizing the =
amount of data being exchanged whilst guaranteeing at the same time =
correctness and efficiency is an extremely important challenge. =
Distributed data mining performs data analysis and mining in a =
fundamentally distributed manner paying careful attention to resource =
constraints, in particular bandwidth limitation, privacy concerns and =
computing power.

The focus of this Special Issue is on all forms of advances in =
high-performance and distributed data mining algorithms and =
applications. The topics relevant to the Special Issue include (but are =
not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, =
shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and =
many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud =
environments

Benchmarking and performance studies of high-performance data mining =
applications

Novel programming paradigms to support high-performance computing for =
data mining

Performance models for high-performance data mining applications and =
middleware

Programming models, tools, and environments for high-performance =
computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for =
data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted =
electronically through Elsevier Editorial System (EES) at =
http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors =
must select as =E2=80=9CSI:PDDM=E2=80=9D when they reach the =E2=80=9CArti=
cle Type=E2=80=9D step in the submission process.

A detailed submission guideline is available as =E2=80=9CGuide to =
Authors=E2=80=9D at: =
http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-=
authors.

IMPORTANT DATES

Submission deadline: December 1th, 2017
First round notification: March 1th, 2018
Revised version due: May 1st, 2018
Final notification: June 1st, 2018
Camera-ready due: July 1st, 2018
Publication tentative date: October 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate =
Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate =
Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy


-=20

=
**************************************************************************=
**********

Massimo Cafaro, Ph.D.
Associate Professor =
=20
Dept. of Engineering for Innovation =20
University of Salento, Lecce, Italy =20
Via per Monteroni =20
73100 Lecce, Italy =
=20
Voice/Fax +39 0832 297371 =20=

Web http://sara.unisalento.it/~cafaro =
=20
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

=
**************************************************************************=
**********

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

[DMANET] Ausschreibung des Richard-Rado-Preises 2018

---------------------------------------------
Ausschreibung des Richard-Rado-Preises 2018
---------------------------------------------

Die Fachgruppe Diskrete Mathematik der Deutschen
Mathematiker-Vereinigung schreibt zum elften Mal einen Preis für
hervorragende Dissertationen in der Diskreten Mathematik aus. Der Preis
wird vom Springer-Verlag gestiftet und ist in diesem Jahr mit EUR 1000,-
dotiert. Die Bekanntgabe der Preisträgerin/des Preisträgers und die
Übergabe des Preises wird im Rahmen des Symposiums Diskrete Mathematik
2018, 15.-16. Juni 2018 in Graz
(https://www.math.tugraz.at/comb/sdm2018/) erfolgen.

Die Preisträgerin/der Preisträger werden zu diesem Symposium eingeladen,
um ihre/seine Dissertation in einem Vortrag vorzustellen. Die
Entscheidung über die Preisvergabe liegt in den Händen einer
renommierten ausländischen Mathematikerin oder eines renommierten
ausländischen Mathematikers. Vorschlagsberechtigt sind die Betreuer der
Dissertationen. Eigenbewerbung ist ausgeschlossen. Vorgeschlagen werden
können Personen, die in Deutschland, Österreich oder der
deutschsprachigen Schweiz promoviert haben oder eine solche Nationalität
besitzen und deren Dissertation über ein Thema der Diskreten Mathematik
zwischen dem 1. Januar 2016 und dem 31. Dezember 2017 abgeschlossen
wurde. Dem Vorschlag sind ein Exemplar der Dissertation sowie ein
Gutachten (in englischer Sprache) der Betreuerin/des Betreuers der
Arbeit beizufügen. Desweiteren fügen Sie bitte ein in Englisch
verfasstes Abstract der Dissertation bei, falls diese in deutscher
Sprache verfasst wurde.

Die Vorschläge und Gutachten sind bis zum 31. Januar 2018 bei einem der
Vorstandsmitglieder der Fachgruppe Diskrete Mathematik, bevorzugt in
pdf-Dateien, einzureichen:

Prof. Mihyun Kang (Fachgruppensprecherin)
TU Graz
Institut für Diskrete Mathematik
Steyrergasse 30
A-8010 Graz
kang@math.tugraz.at

Prof. Dr. Volker Kaibel
Otto-von-Guericke-Universität Magdeburg
Institut für Mathematische Optimierung
Universitätsplatz 2
D-39106 Magdeburg
kaibel@ovgu.de

Prof. Tibor Szabó
FU Berlin
Institut für Mathematik
Arnimallee 6
D-14195 Berlin
szabo@zedat.fu-berlin.de

Prof. Dr. Thorsten Theobald
Goethe-Universität Frankfurt
FB 12 - Institut für Mathematik
Robert-Mayer-Straße 10
D-60325 Frankfurt am Main
theobald@math.uni-frankfurt.de

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

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

The Theory Group at KTH Royal Institute of Technology invites applications for 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 3-4 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 four-year full-time employed positions, 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 January 2018, although this is to some extent negotiable. The positions are fully funded and come with a competitive salary.

The application deadline is October 23, 2017. See http://apc.csc.kth.se/D-2017-0619-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/
*
**********************************************************

Thursday, September 21, 2017

[DMANET] Call for Papers: 11th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF) New Orleans, Louisiana, USA, during February 2-7, 2018 in conjunction with AAAI-18.

[Apologies for Multiple Postings]


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

11th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF)
New Orleans, Louisiana, USA, during February 2-7, 2018
in conjunction with AAAI-18.

http://www.mpref-2018.preflib.org
======================================================================

======================================================================
DESCRIPTION OF WORKSHOP
======================================================================
Preferences are a central concept of decision making. As preferences
are fundamental for the analysis of human choice behavior, they are
becoming of increasing importance for computational fields such as
artificial intelligence, databases, and human-computer interaction as
well as for their respective applications.

The workshop will provide a forum for presenting advances in
preference handling and for exchanging experiences between researchers
facing similar questions, but coming from different fields.


======================================================================
TOPICS
======================================================================
The workshop on Advances in Preference Handling addresses all
computational aspects of preference handling. This includes methods
for the elicitation, learning, modeling, representation, aggregation,
and management of preferences and for reasoning about preferences. The
workshop studies the usage of preferences in computational tasks from
decision making, database querying, web search, personalized
human-computer interaction, personalized recommender systems,
e-commerce, multi-agent systems, game theory, social choice,
combinatorial optimization, planning and robotics, automated problem
solving, perception and natural language understanding and other
computational tasks involving choices. The workshop seeks to improve
the overall understanding of and best methodologies for preferences in
order to realize their benefits in the multiplicity of tasks for which
they are used. Another important goal is to provide
cross-fertilization between the numerous sub-fields that work with
preferences.

* Preference handling in artificial intelligence
* Preference handling in database systems
* Preference handling in multiagent systems
* Applications of preferences
* Preference elicitation
* Preference representation and modeling
* Properties and semantics of preferences
* Practical preferences


======================================================================
FORMAT
======================================================================
The program will consist of presentations of peer-reviewed papers,
panel discussions about future challenges, and an invited talk.


======================================================================
ATTENDANCE
======================================================================
At least one author from each accepted paper must register for the
workshop. An attendance of approximately 40 people is expected.
All authors as well as researchers interested in the field are
encouraged to participate.


======================================================================
SUBMISSION REQUIREMENTS
======================================================================
Papers must be formatted according to
the AAAI Formatting Instructions and up to 7 pages in length + 1 page
for references in PDF format.
Authors can chose between an anonymized or non-anonymized submission.


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

Oct. 13, 2017: Workshop paper submission deadline.
Nov. 9, 2017: Notification on workshop paper submissions.
Nov. 18, 2017: Camera-ready copy due to organizers.
Feb. 2-3, 2018: M-PREF'18 Workshop.


=====================================================================
SUBMIT TO
=====================================================================

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


======================================================================
WORKSHOP CHAIRS
======================================================================

Kristen Brent Venable
Markus Endres
Nicholas Mattei
Andreas Pfandler


======================================================================
WORKSHOP URL
======================================================================

http://www.mpref-2018.preflib.org
**********************************************************
*
* 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] * MIXED INTEGER PROGRAMMING WORKSHOP 2018: FIRST ANNOUNCEMENT *

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. Registration details, a call for participation in the poster session, and information about student travel awards will be made in a subsequent announcement. Please see the workshop website at https://or.clemson.edu/mip-2018/ for updates.

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, Columbia University & 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] Tenure-track Position in Theoretical Foundations of Computer Science and Software Engineering at Concordia University, Montreal, Quebec

Tenure-track Position in Theoretical Foundations of Computer Science and
Software Engineering
Department of Computer Science and Software Engineering

One of Canada's most innovative Faculties, the Faculty of Engineering
and Computer
Science (ENCS) is home to about 8,500 engineering and computer science
students and a
faculty complement of 208 faculty members. ENCS has 3,500 graduate
students enrolled in
more than 15 graduate programs. The Faculty's research profile
continues to grow as it
fosters multidisciplinary approaches to finding solutions to a broad
range of societal
challenges. For more information on the Faculty, please visit:
www.concordia.ca/encs.

The Department of Computer Science and Software Engineering has a
faculty complement of
42 researchers active in the various areas of computer science and
software engineering
and its strength has been growing rapidly in recent years. The
Department offers PhD ,
masters and bachelor's degrees in both Computer Science and Software
Engineering.
Concordia University attracts high quality domestic and international
students in all its
programs and enrollments are stable and strong at both the
undergraduate and graduate
levels. More information is available on the department website.

The Department of Computer Science and Software Engineering seeks an
outstanding
candidate for one tenure-track position in the area of Theoretical
Foundations in
Computer Science and Software Engineering. We will consider applicants
in all research
areas related to the above specialization, but we are particularly
interested in
candidates whose research is in theoretical models, algorithms and analysis of
algorithms. The appointment is intended to be at the rank of Assistant
Professor but
exceptional candidates at the Associate level may also be considered.

Applicants must possess a PhD degree in computer science, software
engineering or
computer engineering or a related area and also possess research and
development
expertise in the area of computer science theory and applications. A
successful candidate
is expected to provide academic leadership, establish a strong
externally funded research
program, demonstrated abilities to work in collaborative
multidisciplinary settings and
teach/develop both undergraduate and graduate courses. Strong
commitment to the
supervision of graduate student research and to excellence in teaching
are essential.
Relevant industrial experience is an asset. Excellent communication
skills are required.
Membership or eligibility for membership in a Canadian professional
engineering
association, preferably in the province of Quebec, is essential.

Applications should consist of a cover letter, detailed curriculum
vitae, teaching and
research statements, and the names of at least four referees.
Applications should be
submitted by December 1, 2017 and will be reviewed on an ongoing basis
until a suitable
candidate has been identified. Only short-listed applicants will be
notified. This
appointment is expected to commence in July 2018.

Kindly forward electronic applications with the subject
"Tenure-Track-CSE-Theory
position" to:

Dr. Sudhir Mudur, Chair
sudhir.mudur@concordia.ca
Department of Computer Science and Software Engineering
Concordia 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/
*
**********************************************************

Wednesday, September 20, 2017

[DMANET] 7th edition of the Winter School on Network Optimization (2nd announcement)

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

Adam Ouorou (Orange Labs) - Robust optimization in telecommunications;

Martine Labbé (Univ. Libre de Bruxelles) - Bilevel programming: Stackelberg games and Pricing Problems;

Ivana Ljubic (ESSEC, Paris) - Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem;

Silvano Martello (Univ. of Bologna) - Packing problems in one and more dimensions;

Juan José Salazar-Gonzalez (Univ. de La Laguna) - Models and Algorithms for Vehicle Routing Problems with Pickups and Deliveries.

The school is part of the activities of the CMAFCIO (Centro de Matemática, Aplicações Fundamentais e Investigação Operacional) University of Lisbon as well as of the ENOG

(European Network Optimization Group). The event is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).

Potential participants are invited to submit their CVs to the address NetOpt2018@fc.ul.pt no later than the 31st October .

Further information is available in the webpage (http://netopt2018.campus.ciencias.ulisboa.pt<http://netopt2018.campus.ciencias.ulisboa.pt/>)??

**********************************************************
*
* 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] WALCOM 2018: Submission Deadline Extended

Dear Colleagues

Due to some request from some authors, we have extended the submission deadline for WALCOM 2018 as follows:

Paper Submission Deadline (Extended): 02 October (Monday), 2017
(Anywhere on Earth, Paper submission closes on this date but submitted papers can be updated until 05 October, 2017)

The revised CFP is pasted below the signature.

Thanks
Sohel


***
Call for Papers: WALCOM 2018
(cse.buet.ac.bd/walcom2018/)
-------------------------------

The 12th International Conference and Workshop on Algorithms and Computation (WALCOM) is intended to provide an international forum for researchers working in the areas of algorithms and computation. WALCOM 2018 will be held during March 03- 05, 2018 at Dhaka, Bangladesh. It is being organized in cooperation with IEICE Technical Committee on Theoretical Foundations of Computing (COMP), the Special Interest Group for ALgorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the EATCS Japan Chapter.

Scope
------
The range of topics within the scope of WALCOM includes (but is not limited to):

Approximation Algorithms
Algorithmic Graph Theory and Combinatorics
Combinatorial Algorithms
Combinatorial Optimization
Computational Biology
Computational Complexity
Computational Geometry
Discrete Geometry
Data Structures
Experimental Algorithm Methodologies
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Algorithms
Parameterized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms

Author Instructions
--------------------
Authors are invited to submit papers (extended abstracts) describing original research of theoretical or practical significance to algorithms and computation. Papers should not exceed 12 pages in LNCS style. Papers significantly shorter than 12 pages are also welcome. If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the Program Committee. Only electronic submissions via Easychair will be allowed (Link: https://easychair.org/conferences/?conf=walcom2018). Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed proceedings or to a journal.
Proceedings

Accepted papers will be published in the conference proceedings. Following the tradition of the previous editions of WALCOM the proceedings will be included in the Springer-Verlag series, Lecture Notes in Computer Science.

Venue
------
WALCOM 2018 will be held at the Department of CSE, BUET, ECE Building, West Palasi, Dhaka.

Important Dates
----------------
Paper Submission Deadline (Extended): 02 October (Monday), 2017 (Anywhere on Earth, Paper submission closes on this date but submitted papers can be updated until 05 October, 2017)

Notification of Acceptance: 17 November (Friday), 2017

Camera-ready Submission: 01 December (Friday), 2017

Conference Dates: 03 March – 05 March, 2018

Program Committee
-----------------
Hee-Kap Ahn, Pohang University of Science and Technology (POSTECH), South Korea
Muhammad Jawaherul Alam, Amazon, USA
Md. Shamsuzzoha Bayzid, BUET, Bangladesh
Guillaume Blin, Université de Bordeaux, France
Jackie Daykin, King's College, London, UK
Amr Elmasry, Alexandria University, Egypt
Wing-Kai Hon, National Tsing Hua University, Taiwan
Seok-Hee Hong, University of Sydney, Australia
Giuseppe F. Italiano, Universita' di Roma "Tor Vergata", Italy
Jesper Jansson, Hong Kong Polytechnic University, Hong Kong
Ralf Klasing, CNRS and University of Bordeaux, France
Gad M. Landau, University of Haifa, Israel
Hon Wai Leong, National University Singapore, Singapore
Giuseppe Liotta, University of Perugia, Italy
Stefano Lonardi, University of California, Riverside, USA
Debajyoti Mondal, University of Saskatchewan, Canada
Krishnendu Mukhopadhyaya, Indian Statistical Institute, Kolkata, India
Subhas Chandra Nandy, Indian Statistical Institute, Kolkata, India
Gonzalo Navarro , University of Chile, Chile
Solon P Pissis, King's College, London, UK
Sheung Hung Poon, National Tsing Hua University, Taiwan
Simon J Puglisi, University of Helsinki, Finland
Tomasz Radzik, King's College, London, UK
C. Pandu Rangan, Indian Institute of Technology, Madras, India
M. Sohel Rahman (Co-Chair), BUET, Bangladesh
Md. Saidur Rahman, BUET, Bangladesh
Atif Hasan Rahman, BUET, Bangladesh
Kunihiko Sadakane, The University of Tokyo, Japan
William F. Smyth, McMaster University, Canada
Paul Spirakis, University of Liverpool and University of Patras, UK and Greece
Wing-Kin Sung (Co-Chair), National University Singapore, Singapore
Etsuji Tomita, The University of Electro-Communications, Japan
Ryuhei UEHARA (Co-Chair), JAIST, Japan
Osamu Watanabe, Tokyo Institute of Technology, Japan
Bruce Watson, Stellenbosch University, South Africa
Sue Whitesides, University of Victoria, Canada
Prudence Wong, University of Liverpool, UK
Hsu-Chun Yen, National Taiwan University, Taiwan

Invited Speakers
-----------------
Giuseppe Di Battista
Professor of Computer Science
&
Vice President for Research
Università Roma Tre, Italy


Naoki Katoh
Department of Informatics
Kwansei Gakuin University, Japan


Limsoon Wong
Professor of Computer Science, School of Computing, National University of Singapore
&
Professor of Pathology, School of Medicine, National University of Singapore

Journal Special Issues
-----------------------
Special issues dedicated to WALCOM 2018 will be published at the Journal of Graph Algorithms and Applications (http://www.jgaa.info/) and Theoretical Computer Science, Elsevier (https://www.journals.elsevier.com/theoretical-computer-science/).

Awards
------
Two awards, namely, "The Best Paper" and "The Best Student Paper" will be awarded. A paper is eligible for the Best Student Paper if all authors are students at the time of submission.

Contact Address
---------------
M. Sohel Rahman
Professor & Head
Department of CSE
BUET, Dhaka-1000
Bangladesh
E-mail: msrahman@cse.buet.ac.bd
http://msrahman.buet.ac.bd/

Wing-Kin Sung
Professor of Computer Science
National University of Singapore
E-mail: ksung@comp.nus.edu.sg
http://www.comp.nus.edu.sg/~ksung

Ryuhei Uehara
Professor
School of Information Science
Japan Advanced Institute of Science and Technology
E-mail: uehara@jaist.ac.jp
https://www.jaist.ac.jp/~uehara/index-e.html

***

Dr. M. Sohel Rahman
Professor & Head
Department of CSE, BUET
&
IEEE Senior Member
Member, ACM, LMS
Address:
ECE Building
West Palasi
Dhaka-1205
Bangladesh
URL: http://msrahman.buet.ac.bd/
Google Scholar: https://scholar.google.com/citations?user=IUwFD9gAAAAJ
Researchgate:https://www.researchgate.net/profile/Mohammad_Rahman42

**********************************************************
*
* 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, September 19, 2017

[DMANET] Special Issue on Parallel and Distributed Data Mining

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier


The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.

The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud environments

Benchmarking and performance studies of high-performance data mining applications

Novel programming paradigms to support high-performance computing for data mining

Performance models for high-performance data mining applications and middleware

Programming models, tools, and environments for high-performance computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.

A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.

IMPORTANT DATES

Submission deadline: December 1th, 2017
First round notification: March 1th, 2018
Revised version due: May 1st, 2018
Final notification: June 1st, 2018
Camera-ready due: July 1st, 2018
Publication tentative date: October 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy

-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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


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

[DMANET] CPAIOR 2018: Call for Papers

CPAIOR 2018: Call for Papers
https://sites.google.com/view/cpaior2018/

The 15th International Conference on the Integration of Constraint
Programming, Artificial Intelligence, and Operations Research will be held
in Delft, The Netherlands, June 26-29, 2018.

The aim of the conference is to bring together interested researchers from
Constraint Programming (CP), Artificial Intelligence (AI), and Operations
Research (OR) to present new techniques or applications and to provide an
opportunity for researchers in one area to learn about techniques in the
others. A main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques from
different fields can lead to interesting results on large and complex
problems. Therefore, papers that actively combine, integrate, or contrast
approaches from more than one of the areas are especially solicited. High
quality papers from a single area are also welcome, if they are of interest
to other communities involved. Application papers showcasing CP/AI/OR
techniques on novel and challenging applications or experience reports on
such applications are strongly encouraged.

The program committee invites submissions that include but are not limited
to the following topics:

* Inference and relaxation methods: constraint propagation, cutting planes,
global constraints, graph algorithms, dynamic programming, Lagrangian and
convex relaxations, heuristic functions based on constraint relaxation.
* Search methods: branch and bound, intelligent backtracking, incomplete
search, randomized search, portfolios, column generation, Benders
decompositions or any other decomposition methods, local search,
meta-heuristics.
* Integration methods: solver communication, model transformations and
solver selection, parallel and distributed solving, combining machine
learning with combinatorial optimization.
* Modeling methods: comparison of models, symmetry breaking, uncertainty,
dominance relationships.
* Innovative applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.

Submissions are of two types: regular papers (submitted for publication and
presentation) and extended abstracts (submitted for presentation only).
Outstanding regular paper submissions may be invited to be published
directly in the journal Constraints through a 'fast track' process.

This year's conference will also introduce a distinguished paper award and
a student paper award.


INSTRUCTIONS FOR REGULAR PAPERS

Regular papers should present original unpublished work and can be of two
types:

* long papers (at most 15 pages plus references)
* short papers (at most 8 pages plus references)

Both long and short papers will undergo rigorous review and are subject to
the same criteria of quality. Both types are also eligible for
distinguished paper or student paper award. Short papers are particularly
encouraged for interesting and novel work in progress, for which the
practical or theoretical relevance is not yet fully identified.

The conference proceedings will be published in the Springer Lecture Notes
in Computer Science series. All regular papers should be prepared in the
format used for that series (http://www.springer.de/comp/lncs/authors.html
).

Submission schedule for regular papers (both long and short):

Abstracts: December 1, 2017
Full papers: December 8, 2017
Rebuttal Phase: January 15-17, 2018
Notification: January 31, 2018
Camera-ready version: March 1, 2018


INSTRUCTIONS FOR EXTENDED ABSTRACTS

Extended abstracts should be 1 or 2 pages in length and may present
preliminary work or work already published in other outlets. The extended
abstracts are submitted for presentation only (if accepted), and will not
be formally published in the LNCS conference volume. A collection of the
accepted extended abstracts will be published on the conference website. A
submission representing work submitted or published in another outlet
should state that outlet. Extended abstracts will be reviewed to ensure
appropriateness for the conference.

Submission schedule for extended abstracts:

Abstract: March 2, 2018
Notification: March 16, 2018


INSTRUCTIONS FOR JOURNAL FAST TRACK

A selection of outstanding submissions to the technical program will be
offered the opportunity to be published exclusively through a 'fast track'
process in the journal Constraints. Authors of these papers can opt to
extend their paper from 15 to 20 pages plus references (subject to a minor
second round of review) and be accepted directly in the journal by the time
of the conference. Invited authors who select to fast track their paper
will receive a 1-page extended abstract in the conference proceedings and
will be invited to present at the conference on the same ground as any
other accepted submission. Fast Track Journal papers should be formatted
according to the Journal Guidelines (
http://www.springer.com/computer/ai/journal/10601). The important dates for
fast track papers are:

Author opt-in decision: February 7, 2018
Extended abstract submission (for LNCS proceedings): March 1, 2018
Journal version submission: March 1, 2018
Notification: April 1, 2018
Camera-ready version: April 8, 2018

Submission Process

All papers are to be submitted electronically in PDF format by following
the instructions at the URL
https://easychair.org/conferences/?conf=cpaior2018 .


QUESTIONS

For any queries on the submission process, please contact the Program Chair
(Willem-Jan van Hoeve) using cpaior2018@easychair.org .

**********************************************************
*
* 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 (Univ.-Ass.) in Combinatorial Optimization with Heuristic and Exact Methods @ TU Wien, Austria

PhD position (University Assistant) in the Algorithms and Complexity
Group, TU Wien, Austria

The Algorithms and Complexity Group at TU Wien
(https://www.ac.tuwien.ac.at) invites applications for a PhD candidate
Assistant position. The position is for a duration of four years and is
paid according to pay scale B1 at 25 hours per week. An optional
possibility for a full-time employment via an additional project
contract exists.

The successful candidate has excellent knowledge in algorithmics,
particular interest in combinatorial optimization with heuristic and
exact techniques, and will contribute to the research and teaching
(e.g., Algorithms and Data Structures 1 and 2, Heuristic Optimization
Techniques). German language skills are appreciated.

The deadline for applications is September 28, 2017.

Application details can be found here:
http://www.informatik.tuwien.ac.at/jobs/Ausschreibung_teilbeschAssistentInnen_Juli2017.pdf


For more information please contact:
Günther Raidl <raidl@ac.tuwien.ac.at>.

--
+- Guenther Raidl -+
+- Institute of Computer Graphics and Algorithms, TU Wien -+
+- http://www.ac.tuwien.ac.at | phone: +43(1)58801/18616 -+
**********************************************************
*
* 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] PDP 2018 - Second Call for Papers

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

PDP 2018 - Second Call for Papers - Deadline Postponed - http://www.pdp2018.org

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

Parallel, Distributed, and Network-Based Processing has undergone
impressive changes over recent years. New architectures, advanced
programming models, improved efficiency and novel application
domains have rapidly become the central focus of this discipline.

These changes are often a result of cross-fertilisation of parallel
and distributed computational paradigms with other rapidly evolving
technologies in different disciplines. It is of paramount importance
to review and assess these new developments in relation with the recent
research achievements in the different areas of parallel and distributed
computing, considering both the industrial and scientific point of view.

PDP 2018 will provide a forum for the discusssion of these and other issues
through original research presentations and will facilitate the exchange of
knowledge and new ideas at the highest technical and applicative level.

PDP 2018 will be held in Cambridge, UK, March 21-23, 2018.

Conference web site http://www.pdp2018.org

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

* Topics of interest include, but are not restricted to:

- Parallel Computing: massively parallel machines; embedded
parallel and distributed systems; multi- and many-core systems; GPU
and FPGA based parallel systems; parallel I/O; memory organisation.

- Distributed and Network-based Computing: Cluster, Grid, Web and
Cloud computing; mobile computing; interconnection networks.

- Big Data: large scale data processing; distributed databases and
archives; large scale data management; metadata; data intensive
applications.

- Models and Tools: programming languages and environments; runtime
support systems; performance prediction and analysis; simulation of
parallel and distributed systems.

- Systems and Architectures: novel system architectures; high data
throughput architectures; service-oriented architectures;
heterogeneous systems; shared-memory and message-passing systems;

- Middlewares and File systems : distributed operating systems;
dependability and survivability; resource management; parallel and
distributed file systems;

- Advanced Algorithms and Applications: distributed algorithms;
multi-disciplinary applications; computations over irregular domains;
numerical applications with multi-level parallelism; real-time
distributed applications.


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


* In addition, special sessions will address upcoming novel topics:

- GPU computing and Many Integrated Core Computing

http://www.pdp2018.org/specialsessions/gpu.html

- Advances in High-Performance Bioinformatics and Biomedicine

http://www.pdp2018.org/specialsessions/ahpbb.html

- Security in Parallel, Distributed and Network-Based Computing

http://www.pdp2018.org/specialsessions/snds.html

- Energy Efficient Management of Parallel Systems, Platforms, and Computations

http://www.pdp2018.org/specialsessions/energy.html

- Cloud Computing on Infrastructure as a Service and its Applications

http://www.pdp2018.org/specialsessions/ccisa.html

- High Performance Computing in Modeling and Simulation

http://www.pdp2018.org/specialsessions/hpcms.html

- On-chip parallel and network-based systems

http://www.pdp2018.org/specialsessions/ocpnbs.html

- Storage architectures and Data Transfer systems for BigData and
Exascale Computing

http://www.pdp2018.org/specialsessions/sdt.html

- High Performance Computing for Neuroscience

http://www.pdp2018.org/specialsessions/neuro.html

- High Performance Computing in Astronomy and Astrophysics

http://www.pdp2018.org/specialsessions/astro.html

- Parallel and distributed high-performance computing solutions in
Systems Biology

http://www.pdp2018.org/specialsessions/sysbio.html

- Parallel Numerical Methods and Libraries for Heterogeneous Multi/Manycores

http://www.pdp2018.org/specialsessions/numerical.html


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

SPECIAL SESSIONS MAY HAVE DIFFERENT DEADLINES FROM THE PDP2018 MAIN TRACK

PLEASE TAKE A LOOK TO THE WEB PAGE OF EACH SPECIAL SESSSION FOR MORE DETAILS

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

* Important dates:

- Paper submission: 3 Nov, 2017

- Acceptance notification: 1 Dic, 2017

- Camera ready due: 22 Dic, 2017

- Conference: 21 - 23 Mar, 2018


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

* Submission of papers

Prospective authors should submit a full paper not exceeding 8 pages
in the Conference proceedings format ( double-column, 10pt) to the
conference main track
through the EasyChair conference submission system
(http://www.easychair.org/conferences/?confpdp2018). The possibility
to submit a paper to a special session
will appear soon.

Double-blind review: the paper should not contain authors names and
affiliations; in the reference list, references to the authors' own
work entries should be
substituted with the string "omitted for blind review".

Publication: all accepted papers will be included in the same volume,
published by the Conference Publishing Services (CPS). The Final Paper
Preparation and
Submission Instructions will be published after the notification of
acceptance. Authors of accepted papers are expected to register and
present their papers at
the Conference. Conference proceedings will be submitted to IEEE
explore, CDSL, and for indexing among others, to DBLP, Scopus
ScienceDirect, and ISI Web of
Knowledge.

Special Issues: selected papers will be considered for a publication
in a special issue of the journal "Concurrency and Computation:
Practice and Experience",
edited by Wiley. Further contacts with editors of other international
journal are on-going to have more special issues for papers from the
special sessions.


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


Ivan Merelli
Istituto di Tecnologie Biomediche, Consiglio Nazionale delle Ricerche
93, via F.lli Cervi, 20090 Segrate (Mi), Italy
Phone: +39 02 2642-2606
E-Mail: ivan.merelli@itb.cnr.it

Pietro Liò
Computer Laboratory, University of Cambridge
15, JJ Thomson Avenue, Cambridge CB3 0FD, UK
Phone: +44 (0)1223-763604
E-Mail: pl219@cam.ac.uk

Igor Kotenko
Laboratory of Computer Security Problems, SPIIRAS
39, 14th. Liniya, St. Petersburg, 199178, Russia
Phone: +7 (812) 328-71-81
E-Mail: ivkote@comsec.spb.ru


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

Euromicro is an international scientific organization advancing
sciences and applications of Information Technology and
Microelectronics. A major focus is on
organizing conferences and workshops in Computer Science and Computer
Engineering. Euromicro is a non-profit association founded in 1974 and
annual conferences
have taken place in more than 20 countries all over Europe. Find out
more at http://www.euromicro.org.

**********************************************************
*
* 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] Extended Call for Helmut Veith Stipend Deadline November 30

Dear colleagues,

Apologies for crossposting, herewith we announce an extension for the
annually awarded Helmut Veith Stipend, for female master students at TU
Wien. Invited to disseminate the call with the flyer further on. Thank you!

****

It is our pleasure to invite academically excellent female applicants in
pursuit (or planning to pursue) a master degree in Computer Sciences at TU
Wien to apply for annually awarded Helmut Veith Stipend. The recipients of
Helmut Veith Stipend receive EUR 6000 annually for the duration of up to two
years, and waiver of all tuition fees for the study at TU Wien. The
application deadline is November 30, 2017. For more information download the
Flyer for Helmut Veith Stipend.

About Helmut Veith

The stipend is named to honour the memory of Helmut Veith (1971–2016),
specifically his international influential research, and his visionary
mentorship of building bridges between the computer science and the society.
The Helmut Veith Stipend continues the late scholar´s support of female
scientist in the field of computer science, and his backing of the revival
era in the Austrian logic scene.

****

For more information please follow the link -
http://bit.ly/Forsyte-Helmut-Veith-Stipend

****

Mihaela Rozman, MA

Vienna Center for Logic and Algorithms

Technische Universität Wien - TU Wien

Institut für Informationssysteme

Favoritenstraße 9-11, 1040 Wien

Telefon: +43 1 58801 184806

Email: <mailto:mihaela.rozman@tuwien.ac.at> mihaela.rozman@tuwien.ac.at

Web: http://www.vcla.at/

Facebook: http://bit.ly/FBVCLA

**********************************************************
*
* 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 Decomposition Approaches for Multiobjective Optimisation

Dear Colleagues,

A fully funded PhD position in Multiobjective Optimisation is available
at the University of Auckland.

The PhD project will be part of the research project "Novel
Decomposition Techniques for Multiobjective Optimisation". The
successful candidate will work on the integration of decomposition
techniques such as Dantzig-Wolfe and Bender's decomposition in
multiobjective optimisation methods, and their potential applications.
The PhD candidate will be working with Dr Andrea Raith (Engineering
Science, University of Auckland), and Associate Professor Richard Lusby
(Danish Technical University, Copenhagen, Denmark).

Scholarship: The upcoming scholarship will provide $27,500 per annum,
and covers fees up to $7,500 per annum. The PhD candidate has the
opportunity to visit Richard Lusby at Danish Technical University. The
university also provides support that can be used towards conference
travel and other research expenses.

For details on the application process, please refer to the project
description on the University of Auckland findathesis page (project
10385334): https://www.findathesis.auckland.ac.nz/research-entry/10385334

Applications will be reviewed from 1 October 2017 until the position is
filled.

Questions can be directed to Andrea Raith a.raith@auckland.ac.nz

--
Andrea Raith
Senior Lecturer,
Engineering Science, Faculty of Engineering
University of Auckland
New Zealand
Phone: +64 9 9231977
email: a.raith@auckland.ac.nz


**********************************************************
*
* 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, September 18, 2017

[DMANET] A workshop in Rome in honour of János Körner

We are pleased to invite you to a one-day workshop in Rome in honour of
János Körner
in the occasion of his retirement from Sapienza University.

The workshop will be an event to celebrate Janos' research and his work in
combinatorics, information theory and computer science.

It will take place in the Aula Magna of the Department of Computer Science
of Sapienza University the day November 10th 2017.

The list of invited speakers includes

Imre Csiszár (Hungarian Academy of Science),
Ron Holzman (Technion),
Joret Gwenaël (Université Libre de Bruxelles),
Katalin Marton (Hungarian Academy of Science),
Jaikumar Radhakrishnan (Tata Institute),
Gábor Simonyi (Hungarian Academy of Science).

Please visit the web page http://wwwusers.di.uniroma1.it/~galesi/WS.html

The admission is free but it would be preferable to send an email to:
fachini@di.uniroma1.it
to confirm your participation.

Looking forward to see you at the workshop.

E. Fachini
N. Galesi
P. Wollan

Dpt. Computer Science
Via Salaria,113
00198 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/
*
**********************************************************

[DMANET] Tenure-track position in Combinatorics and Number Theory

The Department of Mathematical Sciences at Carnegie Mellon University
invites applications for a tenure-track position to begin September 1,
2018, in the areas of combinatorics and number theory and nearby areas.

Applications should be submitted by October 31, 2017 for full consideration.

The Department has a long-standing strength in combinatorics, and seeks
outstanding candidates who will broaden the research profile of the
department. Candidates for this position should be able to contribute to
Carnegie Mellon's interdisciplinary PhD program in Algorithms,
Combinatorics and Optimization. This program is a joint effort of the
Computer Science Department, the Department of Mathematical Sciences and
the Tepper School of Business.

Preference will be given to candidates who have shown outstanding
promise and/or excellent accomplishments in research, and are pursuing a
vigorous research program including major contributions beyond the
doctoral dissertation. Promise of excellent ability to teach and mentor
students of diverse backgrounds is a plus.

The Department of Mathematical Sciences is committed to increasing our
faculty diversity. Carnegie Mellon considers applicants for employment
without regard to, and does not discriminate on the basis of gender,
race, protected veteran status, disability, or any other legally
protected status.

Applicants should submit all materials electronically at
www.mathjobs.org. This includes a cover letter, curriculum vita, list of
publications, a statement describing current and planned research, and
at least three letters of recommendation (including at least one that
specifically addresses teaching). Recommenders who are unable to submit
their letters electronically may mail them to: Combinatorics/Number
Theory Appointments Committee, Department of Mathematical Sciences,
Carnegie Mellon University, Pittsburgh, PA 15213.

Applications may be accepted and reviewed until any open positions are
filled.

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

[DMANET] Special Issue on Information and Opinion Diffusion in Online Social Networks and Media

CALL FOR PAPERS

Elsevier - Online Social Networks and Media Journal
Special Issue on Information and Opinion Diffusion in Online Social Networks and Media

Submission Deadline: October 1st, 2017
http://www.journals.elsevier.com/online-social-networks-and-media/


Online Social Networks are a massively successful phenomenon, used by billions of users to interact. Nowadays, information diffusion in Online Social Networks and Media (OSNEM) has a major role, among many others, for recommendation systems, advertising, and political campaigns. Moverover, the way information circulates in OSNEM impacts on the formation of opinions and on the social roles of users and their influence on others. OSNEM are extensively used for spreading information, opinions and ideas, but also to propagate fake news and rumors. Therefore, prevention of spam, bots and fake accounts, information leakage, trustworthiness of information and trust between users are relevant research issues associated with information diffusion.

This special issue seeks contributions pushing the state of the art in all facets of information and opinion diffusion in online social networks and media. We solicit manuscripts where quantitative and/or data-driven approach is used to investigate information and opinion diffusion in OSNEM.

Topics include, but are not limited to:

- Dynamics of trends, information and opinion diffusion in OSNEM
- Recommendations and advertising in OSNEM
- Spread of news, topics, and opinions
- Trust, reputation, privacy in OSNEM information and opinion diffusion
- Rumors and fake news spreading in OSNEM
- Bots and fake users detection
- Influence analysis and social influence
- Identification of diffusion sources and influencers
- Methods to modify/control/maximise information and opinion diffusion
- Measurements of information and opinion diffusion??in OSNEM
- Models of information and opinion diffusion
- Data-driven approaches to study information and opinion diffusion in OSNEM


*** Tentative Schedule ***
Manuscript submission deadline: October 1, 2017
First notification: November 10, 2017
Submission of revised paper: December 10, 2017
Notification of acceptance: January 10, 2018


Guest Editors
Marco Conti, IIT-CNR, Italy
Andrea Passarella, IIT-CNR, Italy

*** Instructions for submission ***
Manuscripts must not have been previously published nor currently under review by other journals or conferences. Papers previously published in conference proceedings are eligible for submission if the submitted manuscript is a substantial revision and extension of the conference version. In this case, authors should indicate the previous publication(s) in the cover letter and are also required to submit their published conference article(s) and a summary document explaining the enhancements made in the journal version.
The submission website for this journal is located at https://www.evise.com/profile/#/OSNEM/login. Please select "Research Paper" when you reach the "Article Type" step in the submission process. To ensure that all manuscripts are correctly identified, for consideration by the special issue, the authors should indicate in the cover letter that the manuscript has been submitted for the special issue on Information and Opinion Diffusion in Online Social Networks and Media.

For further information, please contact the guest editors at {m.conti,a.passarella} at iit.cnr.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Postdoc in Sublinear/Randomized Algorithms, University of Warwick

=============================================
Postdoc in Sublinear/Randomized Algorithms
University of Warwick
http://www.dcs.warwick.ac.uk/people/artur_czumaj/postdoc-advert-2016/
=============================================

Applicants are sought for a postdoctoral position in connection with a grant of Artur Czumaj (http://www.dcs.warwick.ac.uk/~czumaj/).

We are looking for highly qualified candidates with a PhD degree (or expecting to get one very soon) in combinatorics, discrete mathematics, theoretical computer science, or related fields. The main focus of the post is on the research in the broadly understood area of design and mathematical analysis of sublinear and randomized algorithms, including research in property testing and combinatorics, and sublinear-time approximation algorithms for combinatorial and optimization problems.

The position is affiliated with the Centre for Discrete Mathematics and its Applications, DIMAP (http://www2.warwick.ac.uk/dimap/) and the Foundations of Computer Science Research Group (http://www.dcs.warwick.ac.uk/research/focs/) in the Department of Computer Science at the University of Warwick.

The position is for 12 months, with the possibility to extend (the start date is flexible and can be negotiated).

Closing date for receipt of applications: October 1, 2017.

Informal inquiries should be addressed to Artur Czumaj at A.Czumaj@warwick.ac.uk.

Formal applications, which include CV with a list of publications,, a research statement, and a short statement highlighting your suitability for this post, should be made following the link at
http://www.jobs.ac.uk/job/BDY447/research-fellow-77111-087/.

Closing date: October 1, 2017.

--
=====================================================
Prof Artur Czumaj
Centre for Discrete Mathematics and its Applications
Department of Computer Science
University of Warwick
Coventry CV4 7AL, United Kingdom
Email: A.Czumaj@warwick.ac.uk
http://www.dcs.warwick.ac.uk/~czumaj/
Phone: +44 24 7657 3796
=====================================================
**********************************************************
*
* 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/
*
**********************************************************