[DMANET] 6th Colombian Meeting on Combinatorics ECCO 2018. First Announcement

We are organizing the CIMPA School: Combinatorics meets Algebra, Geometry and Optimization, that will also be the 6th Encuentro Colombiano de Combinatoria ECCO2018. It will be held in Barranquilla next year, June 5-16, please find the announcement below.

On behalf of the organizing committee, we will appreciate if you help us to distribute this message among the people who might be interested.

With kind regards,
Nelly Villamizar,
On behalf of the organizing committee.

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

ECCO 2018 – 6th Encuentro Colombiano de Combinatoria
CIMPA Research School: Combinatorics meets Algebra, Geometry and Optimization
June 5-16, 2018
Universidad del Norte, Barranquilla, Colombia
http://www.uninorte.edu.co/
WEB: http://ecco2018.combinatoria.co/
E-MAIL: ecco2018@googlegroups.com<mailto:ecco2018@googlegroups.com>

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

This school is the sixth "Encuentro Colombiano de Combinatoria (ECCO)" (Colombian Meeting on Combinatorics). Previous meetings took place in Bogotá (2003, 2008, 2012, and 2014), and in Medellín (2016). The main objective of the school is to bring young mathematicians from the region into close contact with international researchers and leading experts in various fields of combinatorics and its applications. We aim at promoting mathematical research among young students in a motivating environment, and to consolidate a regional research network in combinatorics.

The two weeks of the school consist of four minicourses, exercise sessions, a SageMath tutorial, and research talks given by the participants. The program is structured around the students, and therefore we encourage all the participants, independent of their career stage, to take part of the exercise sessions.

We are happy to include in the program talks proposed by the participants. ln the event of a full schedule, priority will be given to young mathematicians from the region.

MINICOURSES
– Vic Reiner (University of Minnesota)
"Reflection groups and enumeration"
– Rekha Thomas (University of Washington)
"Polynomial optimization"
– Lauren Williams (University of California Berkeley)
"Introduction to total positivity and cluster algebras"
– Günter Ziegler (Freie Universität Berlin)
"Polytopes - Extremal examples and combinatorial parameters"
– Viviane Pons (Université Paris-Sud)
"Mathematics software SageMath Tutorials".

CALL FOR TALKS

To submit a talk please fill out the form in the conference website.

REGISTRATION

Registration is now open, please follow the corresponding link in the conference website.

FINANCIAL SUPPORT

Currently, limited funds are available to partially support participants from universities in Latin America. More detailed and up-to-date information can be found in the conference website.

IMPORTANT DATES

The deadline for registration, applying to financial support and/or proposing a talk is January 28, 2018.

** For more information please do not hesitate to contact us via E-mail at: ecco2018@googlegroups.com<mailto:ecco2018@googlegroups.com>.

WE LOOK FORWARD TO YOUR PARTICIPATION

– SCIENTIFIC COMMITTEE
Carolina Benedetti (Universidad de los Andes)
Sara Billey (University of Washington)
Felipe Rincón (University of Oslo)
Bernd Sturmfels (University of California Berkeley & Max Planck Institute for Mathematics in the Sciences, Leipzig)
– ORGANIZING COMMITTEE
Ana Maria Botero (TU Darmstadt)
Cesar Ceballos (Universität Wien)
Federico Castillo (University of Kansas)
Javier de la Cruz (Universidad del Norte)
Laura Escobar (University of Illinois Urbana-Champaign)

Karen Florez (Universidad del Norte)
Rafael González (Universidad Sergio Arboleda)
Emerson León (Universidad de los Andes)
Alejandro Morales (University of Massachusetts Amherst)
Vincent Pilaud (CNRS & École Polytechnique)
José Samper (University of Miami)
Camilo Sarmiento (Universität Leipzig)
Bernardo Uribe (Universidad del Norte)
Nelly Villamizar (Swansea University)

SPONSORS

Universidad del Norte, CIMPA, San Francisco State University, Universidad Sergio Arboleda, Universität Wien, University of Massachusetts Amherst.

*************************************************************************************************
**********************************************************
*
* 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] Odysseus 2018 - Cagliari, June 3-8, 2018 - Call for extended abstracts

Dear colleague,

We kindly invite you to *Odysseus 2018*, the 7th Workshop on Freight
Transportation and Logistics, which will be held on June 3-8, 2018, in
Cagliari, Italy.

Please do not forget that the deadline for the submission of extended
abstracts is *November**10th 2017*. For further information, please
visit the workshop website:

http://convegni.unica.it/odysseus2018/

Technical topics of the conference include (but are not limited to):

• Vehicle Routing
• Fleet and Crew Management
• Modal/Intermodal Transportation
• Terminal Management
• Supply Chain Logistics
• Network Design and Planning
• City Logistics
• Synchromodality
• Physical Internet
• Intelligent Transportation Systems
• Humanitarian Logistics

Submitted extended abstracts should be up to 4 pages length, written in
English and typeset using either the LaTeX or the Word template provided
at http://convegni.unica.it/odysseus2018/submission/. Extended abstracts
will be peer-reviewed and acceptance of the contributions will be based
on originality of the work, suitability regarding the main topic of the
workshop, and overall quality of the submission.

Looking forward to welcoming you next June in Cagliari

/The organizing committee of Odysseus 2018//
/

Note: Please accept our apologies if you receive multiple copies of this
call/
/

**********************************************************
*
* 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 faculty position in Computer Science (all areas), University of Ottawa

The School of Electrical Engineering and Computer Science at the
University of Ottawa invites applications for a tenure-track faculty
position at the rank of Assistant or Associate Professor. Exceptional
candidates may be considered at the rank of Full Professor. We are
interested in candidates who conduct research in all areas of Computer
Science.

Title of the position: Assistant or Associate Professor

Duties: The functions of a member of the academic staff include, in
varying proportions: a) teaching activities; b) scholarly activities
revealed by research, or professional work; c) academic service
activities, d) supervision of graduate students.

Current research strengths in Computer Science at the School of EECS
include algorithms, distributed computing and systems, multimedia and
interactive virtual environments, information management and mining,
as well as text analysis and machine learning. Further information may
be viewed on our web site, located at
http://engineering.uottawa.ca/eecs/

Terms: Tenure Track position

Wage: Commensurate to rank and experience. The salary scale for an
Assistant Professor starts at $81,318 and for an Associate Professor
at $89,827

Benefits package: The University of Ottawa provides a complete
compensation package which includes long term disability, basic group
life insurance, supplementary health insurance, University of Ottawa
Pension Plan and optional life insurance.

Location of work: School of Electrical Engineering and Computer
Science (EECS), University of Ottawa, 800 King Edward, Ottawa, ON K1N
6N5

Contact information: Dr. Claude D'Amours, EECS Director, Faculty of
Engineering, Ottawa, ON K1N 6N5. cdamours@uottawa.ca Telephone:
613-562-5800, ext. 6208, fax: 613-562-5664

Skills requirements:

· Education: Ph.D. in Computer Science or equivalent.
Postdoctoral experience in Computer Science is considered an asset.

· Work experience: The successful candidates should possess a
strong research background and a strong commitment to excellence both
in teaching and research. The candidates will be expected to initiate
and maintain an innovative, externally funded research program and to
teach Computer Science courses, both at the undergraduate and graduate
levels. Because the University of Ottawa is Canada's premier bilingual
university, preference will be given to candidates who are bilingual
(French/English) and who are able to teach in both languages. Passive
knowledge of the other official language in Canada is a requirement
for tenure.

Appointment date: As of July 1, 2018

Application deadline: Applications received prior to November 30, 2017
will be given first consideration. Applications received after that
date will be considered until the position is filled.

Please send your curriculum vitae, a detailed research proposal, a
description of teaching interests and the names, addresses, telephone
numbers and e-mail addresses of at least three (3) referees to:

Dr. Claude D'Amours, Director
School of Electrical Engineering and Computer Science
University of Ottawa
cdamours@uottawa.ca

All qualified candidates are invited to apply; however, preference
will be given to Canadian citizens and permanent residents. The
University of Ottawa is an equal opportunity employer. We strongly
encourage applications from women, Aboriginal peoples, persons with
disabilities and members of visible minorities. If you are invited to
continue the selection process, please notify us of any particular
adaptive measures you might require by contacting the Office of the
Associate Vice-President, Faculty Affairs at 613-562-5958. Any
information you send us will be handled respectfully and in complete
confidence.

The University of Ottawa is proud of its 160-year tradition of
bilingualism. Through its Official Languages and Bilingualism
Institute, the University provides training to staff members and to
their spouses in their second official language.

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

L'École de science informatique et de génie électrique à l'Université
d'Ottawa sollicite des candidatures pour pourvoir un poste de
professeur menant à la permanence au rang d'adjoint ou agrégé. Les
candidats peuvent être considérés au rang de professeur titulaire.
Nous sommes particulièrement intéressés par des candidats qui font de
la recherche dans tous les domaines informatique.

Titre du poste : Professeur adjoint ou agrégé

Tâches : Les fonctions d'un membre du personnel enseignant incluent,
dans des proportions diverses : a) des activités d'enseignement ; b)
des activités savantes se manifestant par la recherche et des
activités professionnelles ; c) des activités reliées au service à la
communauté universitaire ; d) la supervision d'étudiants gradués.

Les forces actuelles en recherche informatique à l'École de SIGE
comprennent l'algorithmique, l'informatique et les systèmes
distribués, le multimédia et les environnements virtuels interactifs,
la gestion et le forage de l'information, ainsi que l'analyse de texte
et l'apprentissage automatisé. Des informations complémentaires
peuvent être consultées sur notre site Web, à
http://genie.uottawa.ca/sige/

Terme : Poste menant vers la permanence

Salaire : Déterminée selon les qualifications et l'expérience.
L'échelle salariale pour un professeur adjoint débute à 81,318$ et
pour un professeur agrégé à 89,827$

Avantages sociaux : L'Université d'Ottawa fournit un régime complet
d'avantages sociaux qui incluent un régime d'invalidité à long terme,
une assurance-maladie complète, un régime optionnel supplémentaire, et
un plan de retraite avantageux.

Emplacement : École de science informatique et de génie électrique
(ÉSIGE), Université d'Ottawa, 800 King Edward, Ottawa, ON K1N 6N5

Personne contact : Dr. Claude D'Amours, Directeur à l'ÉSIGE, Faculté
de génie, Ottawa, ON K1N 6N5. cdamours@uottawa.ca . Téléphone :
613-562-5800, ext. 6208, Télécopieur : 613-562-5664

Exigences préalables :

· Education : Ph.D. en informatique ou équivalent.
L'expérience postdoctorale en informatique est considérée comme un
atout.

· Expérience de travail : Les candidats retenus doivent avoir
un solide dossier de recherche et un engagement envers l'excellence en
enseignement et en recherche. Les candidats doivent s'attendre à
développer et maintenir un programme de recherche innovateur et
financé à l'externe, de même qu'à enseigner des cours d'informatique
de 1er, 2e et 3e cycles. Comme l'Université d'Ottawa est l'université
bilingue la plus importante du Canada, la préférence sera accordée aux
candidats qui sont bilingues (français/anglais) et qui sont en mesure
d'enseigner dans les deux langues. La permanence est conditionnelle à
la connaissance passive de l'autre langue officielle du Canada.

Entrée en fonction : A compter du 1er juillet 2018

Date limite de réception des applications : Les candidatures reçues
avant le 30 novembre 2017 seront considérées en priorité. Les
candidatures reçues après cette date seront acceptées jusqu'à ce que
le poste soit comblé.

Veuillez faire parvenir votre curriculum vitæ, une proposition de
recherche détaillée, la description de vos intérêts en enseignement et
les noms, adresses, numéros de téléphone et courriels d'au moins trois
(3) répondants à :

Dr. Claude D'Amours, directeur
École de science informatique et de génie électrique
Université d'Ottawa
cdamours@uOttawa.ca

Toutes les personnes qualifiées sont invitées à postuler; la priorité
sera toutefois accordée aux citoyens canadiens et aux résidents
permanents. L'Université d'Ottawa souscrit à l'équité en matière
d'emploi. Nous encourageons fortement les femmes, les Autochtones, les
personnes handicapées et les membres des minorités visibles à poser
leur candidature. Si vous êtes invité à poursuivre les étapes du
processus de sélection, veuillez nous aviser de tout besoin
nécessitant des mesures d'adaptations particulières en communiquant
avec le Vice-rectorat associé aux affaires professorales au
613-562-5958. Les renseignements communiqués seront traités avec
respect et confidentialité.

L'Université d'Ottawa est fière de sa tradition de bilinguisme vieille
de plus de 160 ans. Par l'entremise de son Institut des langues
officielles et du bilinguisme, l'Université offre aux membres de son
personnel, de même qu'à leur conjoint ou conjointe, les moyens de
devenir bilingue.

Claude D'Amours, P.Eng., Ph.D.
Directeur et Professeur / Director and Professor
École de science informatique et de genie électrique (SIGE) /
School of Electrical Engineering and Computer Science (EECS)
Université d'Ottawa / University of Ottawa
**********************************************************
*
* 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 "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] Last call for papers - Special Session ISOLIA - ACIIDS 2018

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

ACIIDS 2018 - Last Call for Papers - https://aciids.pwr.edu.pl/2018

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

Conference: ACIIDS 2018
Name: 10th Asian Conference on Intelligent Information and Database Systems
Conference web site: http://www.aciids.pwr.edu.pl/
Date: March 19-21, 2018
Venue: Dong Hoi City, Vietnam
Publication: Springer LNCS/LNAI Series (max 10 pages)
Submission via EasyChair: https://easychair.org/conferences/?conf=aciids2018

ISOLIA 2018: Special Session on Intelligent Systems for Optimization of
Logistics and Industrial Applications

*********************************
*Topics*
*********************************

With the emergence of the new manufacturing revolution, often called
Industry 4.0, new manufacturing configurations,
enhanced with advanced robotics and data acquisition, are being used.
Companies and factories, faced with increasing
competitiveness, are working on the development of new algorithms and
systems to cope with the increasing use of
autonomous machines, the demand load and environmental constraints.
Moreover, they consistently deal with a dynamic and
agile environment, characterized by a considerable amount of data, a
changing manufacturing process and uncertain inputs.
The ISOLIA 2018 Special Session at the 10th Asian Conference on Intelligent
Information and Database Systems (ACIIDS
2018) is devoted to the intelligent systems dedicated to address the
optimization of logistics and production systems with
industrial applications. We want to offer an opportunity for researchers
and practitioners to identify new promising research
directions as well as to publish recent advances in this area. The scope of
the ISOLIA 2018 includes, but is not limited to the
following topics:

- Simulation and multi-agent systems for performance evaluation
- New algorithms for scheduling problems
- Exact algorithms (Brand and Bounds, Dynamic programming …)
- Intelligent manufacturing systems
- Novel techniques for the design of assembly/disassembly systems
- Advanced evolutionary algorithms for effective manufacturing
- Facility planning
- Robust optimization for scheduling and production planning
- Heuristic and meta-heuristic approaches for reverse logistics
- Energy optimization in manufacturing and planning
- Intelligent approaches for warehouse management
- Stochastic modeling of manufacturing systems
- Multi-criteria decision making for operations and logistics
- Green manufacturing

*********************************
IMPORTANT DATES
*********************************
Submission of papers: 1 October 2017
Notification of acceptance: 1 November 2017
Camera-ready papers: 15 November 2017
Registration and payment: 15 December 2017
Conference: 19-21 March 2018

*********************************
SUBMISSION DETAILS
*********************************
All contributions should be original and not published elsewhere or
intended to be published during the review period.

Submitted papers should be prepared in English in LNCS/LNAI style and
should not exceed 10 pages.

Each paper is to be submitted electronically as a single PDF file through
EasyChair at: https://easychair.org/conferences/?conf=aciids2018

All accepted papers must be presented by one of the authors who must
register for the conference and pay the fee.

The conference proceedings will be published by Springer in the prestigious
series LNCS/LNAI (indexed by ISI, EI, DBLP, Inspec, Scopus, etc.).

A selected number of accepted and personally presented papers will be
expanded and revised for possible inclusion in special issues in high
quality scientific journals.

**********************************************************
*
* 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] Assistant Professorship in Algorithms and Complexity at Bristol university

The department of Computer Science at Bristol University, UK is
advertising for a new Assistant Professor (Lecturer/Senior Lecturer)
in a number of areas including Algorithms and Complexity.

This is a "rolling advert" with a nominal closing date only.
Applications are welcome at any time and the timing of the selection
process will be dependent on the applications received. The first
round of shortlisting is scheduled for 25th October 2017.

Details: goo.gl/E4MQtN

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

[DMANET] Final Call for Papers: LATIN 2018

Apologies for duplicate postings.

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

Call for Papers

LATIN 2018

The 13th Latin American Theoretical Informatics Symposium

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

In 2018, LATIN will be held in Buenos Aires, Argentina
(http://latin2018.dc.uba.ar/)

Abstract Submission: October 10th, 2017
Submission: October 17th, 2017
Notification: December 5th, 2017
Camera Ready: December 20th, 2017
Symposium: April 16-19, 2018

All deadlines are AOE time zone.

----------------------------------------------
SCOPE AND TOPICS
----------------------------------------------

LATIN is devoted to different areas in theoretical computer science
including, but not limited to: algorithms (approximation, online,
randomized, algorithmic game theory, etc.), analytic combinatorics
and analysis of algorithms, automata theory and formal languages,
coding theory and data compression, combinatorial algorithms,
combinatorial optimization, combinatorics and graph theory,
complexity theory, computational algebra, computational biology,
computational geometry, computational number theory, cryptology,
databases and information retrieval, data structures, formal
methods and security, Internet and the web, parallel and distributed
computing, pattern matching, programming language theory, and
random structures.

----------------------------------------------
SUBMISSION
----------------------------------------------

Full papers are to be submitted electronically using the EasyChair
server at https://easychair.org/conferences/?conf=latin2018.

Submissions are limited to twelve (12) single-column letter-size
pages in Springer LNCS format (see LNCS author guidelines at
http://www.springer.com/la/computer-science/lncs/conference-proceedings-guidelines).
This limit includes figures and references. An optional appendix
(to be read at the program committee's discretion) may be included
if desired. Simultaneous submission of papers to any other
conference with published proceedings, as well as the submission
of previously published papers, is not allowed. Papers must be
written in English. For each accepted paper at least one author
must register and attend the symposium to present it. Moreover, an
author cannot register for multiple papers. That is, each accepted
paper must have its own registrant.

----------------------------------------------
PROCEEDINGS
----------------------------------------------

Accepted papers will appear in the proceedings of LATIN, which
will be published in Springer Lecture Notes in Computer Science
(http://www.springer.com/la/computer-science/lncs).

----------------------------------------------
CONFERENCE CHAIR
----------------------------------------------

Martín Farach-Colton, Rutgers University, USA

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

Michael A. Bender, Stony Brook University, USA (Chair)
Miguel A. Mosteiro, Pace University, USA (Chair)

Eric Allender, Rutgers University, USA
Gabriela Araujo-Pardo, Universidad Nacional Autónoma de México, Mexico
Esther Arkin, Stony Brook University, USA
Jérémy Barbay, Universidad de Chile, Chile
Vladimir Braverman,Johns Hopkins University, USA
Luciana Buriol, Universidade Federal do Rio Grande do Sul, Brazil
Armando Castañeda, Universidad Nacional Autónoma de México, Mexico
Keren Censor-Hillel, Technion Israel Institute of Technology, Israel
Witold Charatonik, University of Wrocław, Poland
Jing Chen, Stony Brook University, USA
Giorgos Christodoulou, University of Liverpool, UK
Guy Even, Tel-Aviv University, Israel
Cristina G. Fernandes, Universidade de São Paulo, Brazil
Antonio Fernández Anta, IMDEA Networks Institute, Spain
Paolo Ferragina, Università di Pisa, Italy
Celina de Figueiredo, Universidade Federal do Rio de Janeiro, Brazil
Jeremy Fineman, Georgetown University, USA
Johannes Fischer, Technische Universität Dortmund, Germany
Paola Flocchini, University of Ottawa, Canada
Lance Fortnow, Georgia Tech, USA
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Juan Garay, Texas A&M University, USA
Leszek Gąsieniec, University of Liverpool, UK
Seth Gilbert, National University of Singapore, Singapore
Inge Li Gørtz, Technical University of Denmark, Denmark
Julián Gutierrez, University of Oxford, UK
John Iacono, New York University, USA
Taisuke Izumi, Nagoya Institute of Technology, Japan
Jesper Jansson, The Hong Kong Polytechnic University, Hong Kong
Gabriela Jeronimo, Universidad de Buenos Aires, Argentina
Artur Jeż, University of Wrocław, Poland
Rob Johnson, Stony Brook University, USA
Tomasz Jurdzinski, University of Wrocław, Poland
Shuji Kijima, Kyushu University, Japan
Michal Koucky, Charles University, Czech Republic
Yiannis Koutis, University of Puerto Rico, Puerto Rico
Sławomir Lasota, University of Warsaw, Poland
Reut Levi, Max-Planck-Institut für Informatik, Germany
Min Chih Lin, Universidad de Buenos Aires, Argentina
Claudia Linhares Sales, Universidade Federal do Ceará, Brazil
Javier Marenco, Universidad Nacional de General Sarmiento & Universidad de Buenos Aires, Argentina
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Moti Medina, Max-Planck-Institut für Informatik, Germany
Joseph S. B. Mitchell, Stony Brook University, USA
Marco Molinaro, Pontifícia Universidade Católica do Rio de Janeiro, Brazil
Marcelo Mydlarz, Universidad Nacional de General Sarmiento & CONICET, Argentina
Calvin Newport, Georgetown University, USA
Igor Potapov, University of Liverpool, UK
Jared Saia, University of New Mexico, USA
Rodrigo I. Silveira, Universitat Politècnica de Catalunya, Spain
Jose A. Soto, Universidad de Chile, Chile
Paul Spirakis, University of Liverpool, UK and U. Patras, Greece
Grzegorz Stachowiak, University of Wrocław, Poland
Maya Stein, Universidad de Chile, Chile
Frank Stephan, National University of Singapore, Singapore
Christopher Thraves, Universidad de Concepción, Chile
Denis Trystram, Univ. Grenoble Alpes, France
José Verschae, Pontificia Universidad Católica de Chile, Chile
Mark Daniel Ward, Purdue University, USA
Andreas Wiese, Universidad de Chile, Chile
Prudence Wong, University of Liverpool, UK
Yukiko Yamauchi, Kyushu University, Japan
Maxwell Young, Mississippi State University, USA

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

Flavia Bonomo, Universidad de Buenos Aires, Argentina (Chair)
Santiago Figueira, Universidad de Buenos Aires, Argentina
Paula Zabala, Universidad de Buenos Aires, Argentina

----------------------------------------------
STEERING COMMITTEE
----------------------------------------------

David Fernández-Baca, Iowa State University, USA
Joachim von zur Gathen, Bonn-Aachen International Center for Information Technology, Germany
Evangelos Kranakis, Carleton University, Canada
Kirk Pruhs, University of Pittsburgh
Alfredo Viola, Universidad de la Republica de Uruguay, Uruguay
Yoshiko Wakabayashi, Universidade de São Paulo, Brazil

**********************************************************
*
* 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 - ICIST2018, Cordoba, Granada, and Seville, Spain, June 30-July 6, 2018

Call for Papers

http://conference.cs.cityu.edu.hk/isist/

The Eighth International Conference on Information Science and Technology
(ICIST 2018) will be held in Cordoba, Granada, and Seville, three pearls of
Andalusia in Spain during June 30-July 6, 2018, following the successes of
previous events. ICIST 2018 aims to provide a high-level international
forum for scientists, engineers, and educators to present the state of the
art of research and applications in related fields. The conference will
feature plenary speeches given by world renowned scholars, regular sessions
with broad coverage, and special sessions focusing on popular topics.

Authors are invited to submit full-length papers by the submission deadline
through the online submission system. The submission of a paper implies
that the paper is original and has not been submitted under review or is
not copyright-protected elsewhere and will be presented by an author if
accepted. All submitted papers will be refereed by experts in the field
based on the criteria of originality, significance, quality, and clarity.
All accepted papers are expected to be included in IEEE Xplore Digital
Library.

Important Dates

Paper submission deadline: February 1, 2018

Notification of acceptance: March 1, 2018

Camera-ready copy and author registration: April 1, 2018

Tutorials in Granada: June 30/July 1, 2018

Main program in Cordoba: July 2-4, 2018

Workshops in Seville: July 5/6, 2018

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

[DMANET] CfP: EvoCOP 2018 (submission deadline: November 1, 2017)

************************************************************************
EvoCOP 2018 - The 18th European Conference on
Evolutionary Computation in Combinatorial Optimisation
http://www.evostar.org/2018/cfp_evocop.php
April 4 - April 6, 2018
Parma, Italy

Part of Evo* 2018 (http://www.evostar.org)
************************************************************************

The 18th European Conference on Evolutionary Computation in Combinatorial
Optimisation is a multidisciplinary conference that brings together researchers
working on evolutionary computation methods and other metaheuristics for
solving difficult combinatorial optimisation problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, estimation of distribution
algorithms, swarm intelligence methods such as ant colony and particle swarm
optimisation, local search methods such as simulated annealing, tabu search,
variable neighbourhood search, iterated local search, scatter search and path
relinking, and their hybridisation, such as memetic algorithms. Automatic
algorithm configuration and design, meta-optimisation, model-based methods, and
hyperheuristics are also topics of interest. Successfully solved problems
include, but are not limited to, multi-objective, uncertain, dynamic and
stochastic problems in the context of scheduling, timetabling, network design,
transportation and distribution, vehicle routing, graph problems,
satisfiability, energy optimisation, cutting, packing, and planning problems.

The EvoCOP 2018 conference will be held in the city of Parma, Italy, together
with EuroGP (the 21st European Conference on Genetic Programming), EvoMUSART
(7th European conference on evolutionary and biologically inspired music,
sound, art and design) and EvoApplications (specialist events on a range of
evolutionary computation topics and applications), in a joint event
collectively known as EvoStar (Evo*).

**** Areas of Interest and Contributions ****

Topics of interest include, but are not limited to:

* Applications of metaheuristics to combinatorial optimisation problems
* Representation techniques
* Practical solution of NP-hard problems
* Neighbourhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Theoretical developments
* Constraint-handling techniques
* Parallelisation and grid computing
* Search space and landscape analyses
* Comparisons between different (also exact) methods
* Heuristics
* Genetic programming and Genetic algorithms
* Tabu search, iterated local search and variable neighbourhood search
* Ant colony optimisation
* Artificial immune systems
* Scatter search
* Particle swarm optimisation
* Memetic algorithms
* Hybrid methods and hybridisation techniques
* Matheuristics (hybrids of exact and heuristic methods)
* Hyper-heuristics and autonomous search
* Automatic algorithm configuration and design
* Metaheuristics and machine learning
* Surrogate-model-based methods
* Estimation of distribution algorithms
* String processing
* Scheduling and timetabling
* Network design
* Vehicle routing
* Graph problems
* Satisfiability
* Packing and cutting problems
* Energy optimisation problems
* Multi-objective optimisation
* Search-based software engineering

**** Publication Details ****

EvoCOP 2018 will accept two types of submissions:

* Regular papers will be presented orally at the conference and printed in the
proceedings published by Springer in the LNCS series (see LNCS volumes 2037,
2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832, 8600,
9026, 9595 and 10197 for the previous proceedings).

* Late-breaking abstracts (LBAs) summarising ongoing research, recent studies
and applications of evolutionary computation and other meta-heuristics to
real-world or academic combinatorial optimisation problems. LBAs will be
presented as posters during the conference.

**** Submission Details ****

Regular paper submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee. The
authors of accepted papers will have to improve their paper on the basis of
the reviewers' comments and will be asked to send a camera ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference, attend the conference and present the work.

The reviewing process will be double-blind, please omit information about the
authors in the submitted paper. Submit your manuscript in Springer LNCS format.

Page limit (Regular papers): 16 pages
Page limit (LBAs): 1 page

Submit your paper via https://myreview.saclay.inria.fr/evocop18/
(Authors->Submit new paper)

**** Important Dates ****

Submission deadline (Regular papers): November 1, 2017
Submission deadline (LBAs): January 15, 2018
EvoStar: April 4-6, 2018

**** EvoCOP Programme Chairs ****

Arnaud Liefooghe
University of Lille, France
arnaud.liefooghe@univ-lille1.fr

Manuel Lopez-Ibanez
University of Manchester, United Kingdom
manuel.lopez-ibanez@manchester.ac.uk

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

[DMANET] Call for papers: Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization

Apologies for any cross-postings.
-----------------------------------------

Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization
The Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization is an event jointly promoted by the Association of European Operational Research Societies (EURO) and the Association of Latin-Iberoamerican Operational Research Societies (ALIO), both within the International Federation of Operational Research Societies (IFORS).

Bologna, Italy, June 25-27, 2018
https://events.unibo.it/euroalio2018

Call for papers
Contributions dealing with any aspect of Applied Combinatorial Optimization are welcome. This includes theoretical achievements, algorithm development and real-world implementations.

Two kinds of submission are possible: short abstracts of at most 1500 characters including up to three references, and extended abstracts of up to 8 pages. All submissions will undergo a review process.
Short abstracts will be distributed at the conference. Extended abstracts will be published on a special issue of Electronic Notes in Discrete Mathematics (ENDM) associated with the conference.
A Feature Cluster of the European Journal of Operational Research, devoted to Applied Combinatorial Optimization, will be published. High quality papers presented at the conference will be invited to this cluster.

Important Deadlines

Submission of Extended Abstracts 08/01/2018
Submission of Short Abstracts 19/02/2018
Early Registration 16/03/2018

Plenary Speakers
Andrea Lodi, École Polytechnique de Montréal
Nelson Maculan, Federal University of Rio de Janeiro
David Pisinger (EURO Plenary Speaker), Technical University of Denmark

Venue
The conference will be held at the School of Engineering and Architecture of the Alma Mater Studiorum – Università di Bologna, Viale del Risorgimento, 2 Bologna. The School is within walking distance from the city center, hotels, bars and restaurants.
The city of Bologna offers a lively cultural environment, and is well connected by high-speed trains to Florence (35min), Venice (1h 25min), Milan (1h), Rome (2h), Turin (2h 15min), Naples (3h 30min).
A short video on the city of Bologna:
https://www.youtube.com/watch?v=ObBreSoNzZY


On behalf of the Organizing Committee
Paolo Toth, Valentina Cacchiani, Enrico Malaguti
**********************************************************
*
* 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] Associate Professorship of Algorithms and Complexity Theory, Oxford

JOB: Associate Professorship of Algorithms and Complexity Theory
with Tutorial Fellowship at Hertford College

UNIVERSITY of OXFORD

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

Applications are invited for the post of Associate Professor (or Professor) of Algorithms and Complexity Theory to be held in the Department of Computer Science with effect from 1 October 2018. The successful candidate will also be appointed as Fellow and Tutor in Computer Science at Hertford College; Tutors being responsible for the organisation and teaching of their subject within the College.

The salary for this position is offered on a scale from £46,336 per annum, plus substantial additional benefits, including single accommodation at college, if available, or a living-out allowance of £9,437 pa. An allowance of £2,700 pa would be payable upon award of Full Professor title.

The Department of Computer Science is a vibrant and growing academic department, which has a research profile across the entire spectrum of contemporary computing. The Associate Professor will be expected to engage in independent and original research in the field of Algorithms and Complexity Theory, to secure funding and engage in the management of research projects and disseminate research of the highest international standard through publications, conferences and seminars. They will also will contribute to teaching on the Department's highly successful undergraduate and graduate programmes. Oxford has a strong tradition in Algorithms and Complexity Theory, with multiple active faculty members in the Computer Science, Information Engineering, and Statistics departments.

The Associate Professor will be a member of both the University and the college community. They will be part of a lively and intellectually stimulating research community with access to the excellent research facilities which Oxford offers. They will have a role to play in the running of the College as a member of the Governing Body and a trustee of the College as a charity.

The successful candidate will hold a doctorate in Computer Science, or a related subject, will have the ability to teach across a range of Computer Science subjects, and will also have a proven research record of high quality at international level in the area of Algorithms and Complexity Theory, and experience of research collaborations at both national and international level.

The closing date for applications is 12.00 noon on 5 January 2018. Interviews will be held on 13 February 2018 – please allow a full day for these.

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

--
Prof. Paul W. Goldberg, Dept of Computer Science, Oxford
Room 255, Wolfson Building
Office phone +44 (0)1865 610756

**********************************************************
*
* 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] Optimization Problems Definition Contest - Final Call for Problems

Optil.io Platform

Brilliant Challenges
Optimization Problems Definition Contest

FINAL CALL FOR PROBLEMS
(Due to several requests the deadline have been extended.)

https://www.optil.io/optilion/brilliant

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

Do you have an optimization problem? Is it one that could be used by
algorithm designers to test the effectiveness of their solutions? Then
you may be interested in the 'Brilliant Challenges' contest being
organised by Optil.io. There still some time to submit the problem and
win valuable prizes!

Evaluation as a Service (EaaS), in brief, is defined as a paradigm of
keeping the evaluation data in the cloud and allowing to access them via
dedicated interfaces [1]. Optil.io [2] is an online judge platform
following EaaS concept that allows the users from all over the world to
continuously and reliably evaluate the algorithmic solutions of complex
optimization problems and to organize specific science- and
industry-inspired challenges. By hiding the test cases from the
participants and providing the homogeneous, cloud-based runtime
environment, we provide an objective method for assessment of various
algorithms, submitted by the users, solving optimization problems. *The
aim of the Brilliant Challenges contest is to collect interesting,
applicable problems that could be published on the Optil.io platform and
addressed by its users.*

Awards:
-------

Five prizes will be awarded with restricted eligibility criteria (check
the contest website):
* 1st prize (1000 EUR)
* 2nd prize (700 EUR)
* Special distinction for the most entertaining problem (700 EUR)
* Distinction for the most interesting industry-inspired problem (400 EUR)
* Distinction for the most interesting science-inspired problem (400 EUR)

How to participate:
-------------------
Follow the simple procedure described at the contest webpage
(https://www.optil.io/optilion/brilliant) and submit your problem before
3 October 2017.

Organization Committee:
-----------------------

* Dr. Szymon Wasik, Poznan University of Technology (Chief organizer)
* Prof. Jacek Blazewicz, V-ce Director of IFORS (Head of Scientific
Committee)
* Prof. Erwin Pesch, Siegen University (Member of Scientific Committee)
* Prof. Thomas Villmann, University of Applied Sciences Mittweida
(Member of Scientific Committee)
* Prof. Grzegorz Pawlak, Computing Science Professor, and Entrepreneur
(Member of Scientific Committee)
* Dr. Maciej Antczak, Poznan University of Technology (Head of Technical
Committee)

References:
-----------

[1] Hanbury, Allan, et al. "Evaluation-as-a-Service: Overview and
outlook", arXiv:1512.07454, 2015.

[2] Wasik, Szymon, et al. "Optil. io: Cloud Based Platform For Solving
Optimization Problems Using Crowdsourcing Approach", Proceedings of the
19th ACM Conference on Computer Supported Cooperative Work and Social
Computing Companion, doi:10.1145/2818052.2869098, 433-436, ACM, 2016.

--
Szymon Wąsik, Ph.D.
Laboratory of Algorithm Design and Programming Systems
Institute of Computing Science
Poznan University of Technology
Piotrowo 2, 60-965 Poznan, Poland
http://www.cs.put.poznan.pl/swasik
e-mail: szymon.wasik@cs.put.poznan.pl
tel: 0048 61 665 3032

**********************************************************
*
* 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] Faculty Position in Operations Research at Tepper School of Business, Carnegie Mellon University

*TENURE-TRACK FACULTY POSITION IN OPERATIONS RESEARCH*

The Tepper School of Business at Carnegie Mellon University seeks
candidates for a tenure-track faculty position in Operations Research,
preferably at the Assistant Professor level, beginning in September 2018.
Applicants are expected to have a Ph.D. in Operations Research or a related
field at the time of appointment, a demonstrated potential for outstanding
research, and strong teaching skills.

The specialty of the candidate may be in the broad area of Optimization
with connections to Business Analytics and Machine Learning. The ideal
candidate will be able to contribute to the school's analytical approach to
business education, and engage in cross-disciplinary research activities
within the Tepper School and Carnegie Mellon University.

Applicants should submit an application letter, curriculum vitae, up to
three publications or working papers, research and teaching statements, and
three recommendation letters. Questions about the application can be
addressed to Mr. Philip Conley at orgroup@andrew.cmu.edu or 412-268-6212
<(412)%20268-6212>.

To receive full consideration, applications must be submitted by *December
8, 2017*.

*Application Procedure:* Faculty applications and all supporting documents
must be submitted to: http://apply.interfolio.com/45280
<http://apply.interfolio.com/45280>.

*Carnegie Mellon University is an equal opportunity employer and is
committed to increasing the diversity of its community on a range of
intellectual and cultural dimensions. Carnegie Mellon welcomes faculty
applicants who will contribute to this diversity through their research,
teaching and service, including women, members of minority groups,
protected veterans, individuals with disabilities, and others who would
contribute in different ways.*

**********************************************************
*
* 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] Assistant Professor of Mathematics, LSE (London School of Economics)

Assistant Professor of Mathematics, LSE (London School of Economics)

The Department of Mathematics at LSE seeks to appoint an Assistant
Professor. For this post, we are particularly interested in candidates
with expertise in a subject area related to the Mathematics of
Operations Research. The successful candidate will have an established
track record or trajectory of research at a level of international
excellence, will be able to teach mathematics at undergraduate and
postgraduate level, and will have a commitment to excellence in
teaching. The successful candidate will contribute to the general work
of the department, including the teaching of a range of courses. She or
he will maintain an active programme of research in mathematics and will
have a clear, well developed and viable strategy for future outstanding
research. She or he will have a PhD in a mathematical subject (or be
close to completing one) by the intended start date of 1 September 2018.

For further information about the post, other benefits that come with
this job, and shortlisting criteria, please see the "how to apply"
document, job description, and person specification which are available
at www.lse.ac.uk/LSEJobs. Salary is competitive with Departments at our
peer institutions worldwide and not less than £53,004 (GBP) per annum
inclusive. The closing date for receipt of applications is Sunday 26
November 2017 (23.59 UK time).

**********************************************************
*
* 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 for a female researcher at TU Wien, Vienna, Austria

As part of a special measure towards increasing female employment in scientific positions and promoting young researchers, the Faculty of Informatics at the TU Wien (Vienna University of Technology) invites applications for an Assistant Professor position (tenure track) for women, expected to begin on May 2, 2018.

Candidates can apply in any of the Faculty's main research areas: Computer Engineering, Distributed and Parallel Systems, Logic & Computation (which includes Algorithms and Complexity), Media Informatics & Visual Computing, as well as Business Informatics (http://www.informatik.tuwien.ac.at/research).

The work contract is initially limited to six years. The candidate and TU Wien can agree upon a tenure evaluation, which when positive, opens the possibility to change the position to Associate Professor with an unlimited contract.

Duties include research in one of the Faculty's main research areas (see above) as well as graduate and undergraduate teaching.

The TU Wien (Vienna University of Technology) is among the most successful technical universities in Europe and it is Austria's largest scientific-technical research and educational institution. The Faculty of Informatics, one of the eight faculties at the TU Wien (Vienna University of Technology), has an excellent reputation and plays an active role in national and international research.

For a more detailed announcement and information on how to apply, see
http://www.informatik.tuwien.ac.at/jobs/AssistantProfessorPositionforafemaleResearcher-2.pdf

Application deadline is November 5, 2017

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

[DMANET] The Third International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering

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

The Third International Conference on Applications of Mathematics and
Informatics in Natural Sciences and Engineering Dedicated to the
80th Birthday Anniversary of David Gordeziani,
Tbilisi, Georgia, December 7-9, 2017


http://www.viam.science.tsu.ge/aminse2017/

======================================================================
DESCRIPTION OF CONFERENCE
======================================================================
The Third International Conference on Applications of Mathematics and
Informatics in Natural Sciences and Engineering (AMINSE 2017) will be
held in Tbilisi, Georgia, December 6-9, 2017. The conference will be
organized by VIAM and is dedicated to the 80th birthday of David Gordeziani
the director of Ilia Vekua Institute of Applied Mathematics (VIAM) of
Ivane Javakhishvili Tbilisi State University (TSU) in 1985-2006.

The aim of AMINSE 2017 is to bring together scientists to discuss their
research results in all aspects of Mathematics, Informatics, and their
Applications in Natural Sciences and Engineering.

======================================================================
ABSTRACT SUBMISSION
======================================================================
Interested persons are invited to submit one page abstracts prepared in
LaTex.
The abstract must contain the title, full name of the authors, affiliations
and
e-mail addresses. The accepted abstracts will be made available
electronically on
the VIAM webpage before the conference. Abstracts must be electronically
submitted
in Tex and PDF via the webpage:
http://www.viam.science.tsu.ge/userspace/login

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

October 1, 2017 – Deadline for abstract submission
October 15, 2017 – Abstract acceptance notification
October 31, 2017 – Deadline for early registration fee


======================================================================
PLENARY TALKS
======================================================================
Philippe G. Ciarlet, City University of Hong Kong, China.
Philippe Destuynder, Conservatoire National des Arts et Métiers, France.
Olga Gil-Medrano, University of Valencia, Spain.
Temur Kutsia, RISC, Johannes Kepler University, Austria.
Volodymyr Makarov, Institute of Mathematics, Ukraine.
Mircea Marin, Computer Science Department, West University of Timisoara,
Romania.
Hamlet Meladze, N.Muskhelishvili Institute of Computational Mathematics,
St.Andrew the First Called Georgian University, Georgia.
Paolo Podio-Guidugli, Accademia Nazionale dei Lincei, Italy.


======================================================================
CONTACT
======================================================================

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

[DMANET] 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/
*
**********************************************************

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

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