Thursday, November 16, 2017

[DMANET] 1 PhD Research Position in Next Generation Wireless Networks at Technical University of Berlin​

1 PhD Research Position in Next Generation Wireless Networks at Technical University of Berlin​

http://www.personalabteilung.tu-berlin.de/menue/jobs/stellenausschreibungen/parameter/en/
Re­ference num­ber: IV-554/17

Work­ing field:
The CCAN chair at the Tech­ni­sche Uni­ver­sität Ber­lin deals with dis­trib­uted con­trol in next gen­er­a­tion wire­less net­works. The future of wire­less com­mu­nic­a­tions is envi­sioned with ultra-dense net­works where a vari­ety of emer­ging tech­no­lo­gies such as machine-type/device-to-device com­mu­nic­a­tions and small cells coex­ist. Due to the dens­ity, dynam­icity and lack of inform­a­tion, the optimal con­trol of such net­works is very chal­len­ging. The prob­lem becomes aggrav­ated when the con­trol and optim­iz­a­tion has to be done in a dis­trib­uted man­ner. The main work­ing theme of this pos­i­tion is to address such chal­lenges using the­or­et­ical meth­ods from game the­ory, machine learn­ing, and dynamic pro­gram­ming. PhD thesis pre­par­a­tion is pos­sible and will be super­vised by Prof. Dr. Setareh Magh­sudi.
Require­ments:
Suc­cess­fully com­pleted uni­versity degree (Mas­ter, Dip­lom or equi­val­ent) in at least one of the fol­low­ing fields:

* elec­trical engin­eer­ing (with strong back­ground in wire­less com­mu­nic­a­tions),
* or math­em­at­ics (with strong back­ground in oper­a­tions research),
* or com­puter sci­ence (with strong back­ground in machine learn­ing),
* or eco­nom­ics (with strong back­ground in game the­ory).

Applic­ants must have strong back­ground in math­em­at­ical ana­lysis, and must be motiv­ated towards the­or­et­ical prob­lems with a strong math­em­at­ical fla­vor. Good pro­gram­ming skills (at least MAT­LAB or C++) and Eng­lish pro­fi­ciency are also required.
How to ap­ply:
Please send your applic­a­tion with the ref­er­ence num­ber and the lis­ted doc­u­ments

* a cur­riculum vitae, stat­ing clearly and pre­cisely their edu­ca­tion his­tory, earned degrees and pre­vi­ous aca­demic insti­tu­tions,
* let­ters of recom­mend­a­tion from aca­demic advisors, MSc thesis super­visors, aca­demic instruct­ors (up to 3 let­ters), together with con­tact inform­a­tion,
* if applic­able, pub­lished research work, includ­ing MSc thesis, in elec­tronic form
* a let­ter of motiv­a­tion and pur­pose, illus­trat­ing how the can­did­ate's know­ledge and back­ground fits in the afore­men­tioned research area;
* offi­cial grade tran­scripts with cer­ti­fied trans­la­tion in Eng­lish or Ger­man if the ori­ginal doc­u­ments are in a dif­fer­ent lan­guage

prefer­ably by e-mail to maghsudi@tu-berlin.de<mailto:maghsudi@tu-berlin.de> or in writ­ing to Tech­nis­che Uni­versität Ber­lin - Der Präsid­ent - Fak­ultät IV, Insti­tut für Telekom­munika­tionssysteme, FG Con­trol of Con­ver­gent Access Net­works (CCAN), Frau Prof. Dr.-Ing. Magh­sudi, Sekr. TEL 12-11, Ernst-Reu­ter-Platz 7, 10587 Ber­lin.

To ensure equal oppor­tun­it­ies between women and men, applic­a­tions by women with the required qual­i­fic­a­tions are expli­citly desired. Qual­i­fied indi­vidu­als with dis­ab­il­it­ies will be favored.

Please send cop­ies only. Ori­ginal doc­u­ments will not be returned.

Application deadline : 8 December 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] SECOND CALL: IEEE TCSS Special Issue on "Parallel and Distributed Processing for Computational Social Systems"

[Apologies if you receive multiple postings]
############################################################
############################
CALL FOR PAPERS
IEEE Transactions of Computational Social Systems Special Issue on
"Parallel and Distributed Processing for Computational Social Systems"

https://goo.gl/s8xQXm

Important Dates:
Submission deadline: *Dec. 05, 2017*
First round of reviews: Jan. 31, 2018
Revised papers due: Feb. 20, 2018
Final notification: Mar. 20, 2018
Final manuscript due: Apr. 5, 2018
Expected publication: Jun. or Sep. 2018
############################################################
#############################

*Scope of Special Issue:
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. Meanwhile, the
emergence of parallel architectures, in the form of multi-core/many-core
processors, and distributed platforms, have provided new approaches for
large-scale modeling and simulation, and new tools for analysis. This
special issue provides a platform to bring together interdisciplinary
researchers from areas, including computer science, applied mathematics,
social sciences, and computer engineering, to showcase innovative research
in computational social systems that leverage the emerging trends in
parallel and distributed processing, computational modeling, and high
performance computing.

The major topic areas covered by the special issue are:
1. Large-Scale Modeling and Simulation for Social Systems.
E.g. Social network based models, Models of social interactions/influence,
Complex Adaptive System (CAS) models, Models incorporating socio-cultural
factors, Agent based social modeling and simulation, Modeling with
uncertain/incomplete social data, real-time social modeling, social and
behavioral theories

2. Social Computing Algorithms for Parallel and Distributed Platforms
E.g. Analysis of massive social data, Algorithms for dynamic social data,
Analysis methods for incomplete, uncertain social data, Social computing on
new and emerging parallel/distributed architectures

3. Applications
E.g. Emergency management (in areas such as infrastructure resilience,
natural disaster management), National security, Health science, Social
media analytics

*Manuscript Submission:
Authors must ensure that the papers submitted to this special issue is
original and is not under consideration for publication in any other
journal or conference. Submission that are extensions of previously
published work must contain significant technical novelty and significant
new results. Manuscripts may be submitted via the IEEE TCSS submission
portal at https://mc.manuscriptcentral.com/tcss. The max page length of the
camera ready paper is 12, with a maximum cap of 2 over length pages, at
$175 per page. *IMPORTANT* In the cover letter, authors must mention the
special issue so that the manuscript is routed to the special issue
editors. The manuscripts should follow the IEEE formatting guidelines as
provided at http://ieeeauthorcenter.ieee.org/create-your-ieee-article/
use-authoring-tools-and-ieee-article-templates/ieee-
article-templates/templates-for-transactions/

*Special Issue Editors:

Dr. Eunice E. Santos, Ron Hochsprung Endowed Chair and Professor of
Computer Science, Illinois Institute of Technology, USA

Dr. John Korah, Research Assistant Professor, Illinois Institute of
Technology, USA

For inquiries, please contact the special issue editors via email to
parsocial@cs.iit.edu

<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=icon>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail&utm_term=link>
<#m_-583747942455653629_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>


**********************************************************
*
* 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: Search-Based Software Engineering - Genetic and Evolutionary Computation Conference (GECCO) 2018

Dear Colleague,

We invite you to submit original, high quality papers to the Search-Based Software Engineering (SBSE) track of the Genetic and Evolutionary Computation Conference (GECCO 2018).

After a few years as part of a combined track, SBSE is for the second consecutive year the subject of its own dedicated track at GECCO and we encourage you to continue supporting the track with your original contribution.

Note also this year GECCO invites shorter "poster-only" papers (2 pages) in addition to full-length technical papers (8 pages); see: http://gecco-2018.sigevo.org/index.html/Call+for+Papers for details. We encourage the community to submit short poster-only papers to present new ideas which are not fully empirically evaluated as well as new framework/tools for search-based software engineering.

All accepted papers will be published in the ACM Digital Library. Moreover, the authors of best selected papers accepted for the SBSE track will be invited to submit an extended version of their paper for a special section in the Elsevier Journal of Information and Software Technology (IST).

Please, find the full CfP below.

Kind regards,
Federica Sarro (f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>), Associate Professor, CREST, University College London, United Kingdom
and
Giuliano Antoniol (antoniol@ieee.org<mailto:antoniol@ieee.org>), Professor of Software Engineering, Department of Computer and Software Engineering of the Polytechnique Montreal, Canada

======================================================================================================
CALL FOR PAPERS
Search-Based Software Engineering (SBSE) Track @ Genetic and Evolutionary Computation Conference (GECCO) 2018
http://gecco-2018.sigevo.org/

**********KEY DATES**********
Conference: 15-19 July 2018, Kyoto, Japan
Abstract Submission: 30th January 2018 (non-extensible)
Paper Submission: 6th February 2018 (non-extensible)

**********KEY LINKS**********
Track Details: http://gecco2018.sigevo.org/index.html/Program+Tracks#id_SBSE%20-%20Search-Based%20Software%20Engineering
Paper Submission General Information: http://gecco-2018.sigevo.org/index.html/Call+for+Papers
Paper Submission Instructions: http://gecco-2018.sigevo.org/index.html/Papers+Submission+Instructions

**********SBSE TRACK DESCRIPTION**********
Search-Based Software Engineering (SBSE) is the application of search algorithms and strategies to the solution of software engineering problems.
Evolutionary computation is a foundation of SBSE, and since 2002 the SBSE track at GECCO has provided the unique opportunity to present
SBSE research in the widest context of the evolutionary computation community. Last but not least, participating to the SBSE track and, more generally, to GECCO allows to be informed by advances in evolutionary computation, new cutting edge meta-heuristic ideas, novel search strategies, approaches and findings.

We invite papers that address problems in the software engineering domain through the use of heuristic search techniques.
We particularly encourage papers demonstrating novel search strategies or the application of SBSE techniques to new problems in software engineering. Papers may also address the use of methods and techniques for improving the applicability and efficacy of search-based techniques when applied to software engineering problems.
While empirical results are important, papers that do not contain strong empirical results - but instead present new sound approaches, concepts, or theory - are also very welcome.
Moreover, this year for the first time we encourage the submission of both full papers and poster-only papers describing negative results as well as industrial reports on the practical use of search-based approaches. Moreover poster-only papers presenting frameworks/tools for search-based software engineering are also welcomed.

**********SCOPE**********
As an indication of the wide scope of the field, search techniques include, but are not limited to: Ant Colony Optimization, Automatic Algorithm configuration and Parameter Tuning, Estimation of Distribution Algorithms, Evolutionary Computation, Hybrid and Memetic Algorithms, Hyper-heuristics, Iterated Local Search, Particle Swarm Optimization, Simulated Annealing, Tabu Search, Variable Neighbourhood Search.

The software engineering tasks to which they are applied are drawn from throughout the software lifecycle and include, but are not limited to:
Automated Software Design and Hyper-Heuristics; Automatic Algorithm Selection and Configuration; Configuring Cloud-Based Architectures; Creating Recommendation Systems to Support Life Cycle (Software Requirement, Design, Development, Evolution and Maintenance, etc.); Developing Dynamic Service-Oriented Systems; Enabling Self-Configuring/Self-Healing/Self-Optimizing Systems; Network Design and Monitoring; Optimizing Functional and Non-Functional Software Properties (Genetic Improvement); Predictive Modelling for Software Engineering Tasks; Project Management and Organization; Regression Test Optimization; Requirements Engineering; Software Evolution, Maintenance, Program Repair, Refactoring and Transformation; Software Security; System and Software Integration; Test Data Generation.

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

**********PROCEEDINGS**********
All accepted papers will be published in the ACM Digital Library.

**********SPECIAL SECTION IN THE INFORMATION AND SOFTWARE TECHNOLOGY JOURNAL FOR THE BEST PAPERS**********
The authors of best selected papers accepted in the SBSE track will be invited to submit an extended version of their paper for a special section in the Elsevier Journal of Information and Software Technology (IST).

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

--
Dr. Federica Sarro
Senior Lecturer (Associate Professor)
CREST, Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
http://www0.cs.ucl.ac.uk/staff/F.Sarro/

**********************************************************
*
* 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] [DEADLINE EXTENSION] Special Issue on Parallel and Distributed Data Mining

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

Submission deadline: February 1st, 2018


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: February 1st, 2018
First round notification: May 1st, 2018
Revised version due: July 1st, 2018
Final notification: August 1st, 2018
Camera-ready due: September 15th, 2018
Publication tentative date: December 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] Symposium GRAPHS - Conference ICNAAM 2018

FIRST CALL FOR PARTICIPATION

Symposium GRAPHS, ICNAAM 2018 (International Conference
of Numerical Analysis and Applied Mathematics 2018),
13-18 September 2018, Sheraton Hotel, Rhodes, Greece

Organizer: Vojislav Petrovic (DMI Novi Sad)

Topics:

- scores in graphs and digraphs

- Eulerian and Hamiltonian graphs and digraphs

- planar graphs

- graph factors and decompositions

- graph colorings

- extremal graphs

- graph spectra

- tournaments and hypertournaments

- graph algorithms


Email to vojpet@dmi.uns.ac.rs or vojpet@gmail.com to announce
registration.

For further information

vojpet@dmi.uns.ac.rs or vojpet@gmail.com

or visit

http://www.icnaam.org/


Vojislav Petrovic
**********************************************************
*
* 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: 6th International Conference on Variable Neighborhood Search, (ICVNS 2018)

***********************************
First Call for Papers
***********************************

6th International Conference on Variable Neighborhood Search, (ICVNS 2018)
Sithonia, Halkidiki, Greece, October 4-7, 2018

http://vns2018.uom.gr

Scope and Objectives:
***********************************
The 6th International Conference on Variable Neighborhood Search will be
held in Sithonia, Halkidiki, Greece (Porto Carras Meliton Hotel) October
4-7, 2018. The ICVNS 2018 will be co-organized by the EURO Working Group
on Metaheuristics (EWG EU/ME) and, the Computational Methodologies &
Operations Research (CMOR Lab) and the Department of Applied Informatics,
School of Information Sciences, of the University of Macedonia. VNS is a
metaheuristic based on systematic changes in the neighborhood structure
within a search, for solving optimization problems and related tasks. The
main goal of the ICVNS 2018 is to provide a stimulating environment in
which researchers coming from various scientific fields can share and
discuss their knowledge, expertise and ideas related to the VNS
Metaheuristic and its applications.

Conference Proceedings and Book of Abstracts:
***********************************
All accepted papers will be published by Springer as a post-proceedings
volume in its Lecture Notes in Computer Science series. Participants are
also allowed to send just abstract of their presentation. If accepted,
they will be published in the Book of abstracts.
Paper submission site: https://ocs.springer.com/ocs/home/ICVNS2018

Publication in Special Issues:
***********************************
- Journal of Global Optimization, Springer (I.F.: 1.733, SJR: 1.48)
- Optimization Letters, Springer (I.F.: 1.310, SJR: 0.92)
- Yugoslav Journal of Operations Research (SJR: 0.32)

Conference Chairs:
***********************************
- Pierre Hansen, GERAD and HEC Montreal, Canada (Honorary Chair of the
Conference)
- Nenad Mladenovic, Mathematical Institute, Serbian Academy of Sciences
and Arts, Serbia (General Chair)
- Angelo Sifaleras, University of Macedonia, Greece (Conference Chair)

Plenary speakers:
***********************************
- Panos M. Pardalos, University of Florida, USA
- Abraham Duarte, Universidad Rey Juan Carlos, Spain
- Daniel Aloise, Polytechnique Montreal, Canada

Venue:
***********************************
The conference activities will take place at Porto Carras Meliton Hotel,
Sithonia, 63081, Halikidiki, Greece. Porto Carras Grand Resort is located
only 120km away from the city of Thessaloniki (the second largest city in
Greece) and 75 minutes drive from Thessaloniki's International Airport
"Macedonia" (SKG).

Important Dates:
***********************************
Submission deadline: May 15, 2018
Notification to authors: July 02, 2018
Early registration deadline: July 31, 2018
Preliminary program: September 04, 2018
Conference date: October 4-7, 2018
Camera-ready due: October 31, 2018

Contact: vns2018@uom.edu.gr

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

[DMANET] Post-doc position in Combinatorics / Discrete Mathematics at Tel Aviv University

The School of Mathematical Sciences at Tel Aviv University invites applications for Post-doctoral Fellowships in Combinatorics and Discrete Mathematics for one year, with a possibility of extension for an additional year, starting October 1, 2018 (the starting date is negotiable).

The School of Mathematical Sciences is a leading international research institution in mathematics. It has a large and very active research group in Combinatorics (five faculty members, two post-docs, and many research students), with a weekly research seminar.

Further information about the School, including a list of our faculty, is available on our web site http://www.math.tau.ac.il <http://www.math.tau.ac.il/>.

We welcome applications from candidates specializing in Combinatorics, who have completed a Ph. D. degree in Mathematics or Computer Science by September 30, 2018 (but not earlier than October 1, 2014). Preference will be given to applicants whose research interests are compatible with those of the relevant faculty in the School.

Post-doctoral Fellowships are strictly research positions and do not carry any teaching responsibilities.

Stipends for a one year fellowship are approximately 137,000 Israeli Shekels and are commensurable with entry level academic salaries in Israel. Additional funds for research related travel will also be available.

Candidates should arrange the following application materials to be sent to Ms. Nurit Liberman at nuritl@tauex.tau.ac.il <mailto:nuritl@tauex.tau.ac.il> (with a cc sent to asafico@post.tau.ac.il <mailto:asafico@post.tau.ac.il> and samotij@post.tau.ac.il <mailto:samotij@post.tau.ac.il>):

- CV
- List of Publications
- Research statement
- Three letters of recommendation

The deadline for applications is December 31, 2017.

Applications received after the deadline will be considered if positions remain open.

--
Noga Alon, Michael Krivelevich, Doron Puder, Wojciech Samotij, and Asaf Shapira


**********************************************************
*
* 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 Position in Theoretical Computer Science/Discrete Mathematics at Charles University in Prague

Assistant professor position
Computer Science Institute of Charles University
Prague, Czech Republic


The Computer Science Institute (CSI) of Charles University, Prague, Czech
Republic, invites applications for a faculty position at the rank of an
assistant professor in the area of theoretical computer science and
discrete mathematics. The expected starting date is between July 1, 2018,
and October 1, 2018, and is negotiable.

We are looking for candidates that would complement and/or strengthen
existing research areas in our group (which currently include structural
graph theory, computational complexity, computational and combinatorial
geometry, and approximation algorithms). Strong candidates from all areas
of theoretical computer science and discrete mathematics will be
considered. For further information about our research group at CSI and at
the closely related Department of Applied Mathematics see
http://iuuk.mff.cuni.cz/ and http://kam.mff.cuni.cz/. Informal inquiries
are welcome and may be sent to Michal Koucky <koucky@iuuk.mff.cuni.cz>.

A successful candidate is expected to pursue an active research program,
teach advanced and introductory classes and possibly supervise
undergraduate and graduate students. Candidates are expected to have a
proven international research record and postdoctoral experience. A PhD in
computer science, discrete mathematics or a closely related field is
required.

The contract duration is three years. Potentially, the position is
renewable; also a habilitation (associate professor promotion) and a
permanent position is a possibility (subject to a separate review
process).

A signed application, accompanied by a curriculum vitae, a proof of
education, a list of publications, an overview of citations (e.g., from
Web of Science or MathSciNet), and a description of pedagogical experience
should be sent by e-mail to <konkurzy@dekanat.mff.cuni.cz> by February 28,
2018. The candidate should also arrange for two letters of recommendation
to be sent to the same address.


The application deadline is: February 28, 2018.
Application and recommendation letters to: <konkurzy@dekanat.mff.cuni.cz>
Announcement: https://www.mff.cuni.cz/to.en/fakulta/prace/201710-iuuk.htm

**********************************************************
*
* 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] NEW TERMS AND DATES - Postdoctoral Fellowship(s) of Algorithms at Postdoctoral Fellowship(s) of Algorithms Department of Computer Science, Faculty of Science at University of Copenhagen

Postdoctoral Fellowship(s) of Algorithms

Department of Computer Science, Faculty of Science at University of
Copenhagen (DIKU) is offering Postdoctoral Fellowship(s) in algorithms
expected to commence 1 August 2018 or as soon as possible thereafter.

The Algorithms Group at DIKU is headed by Professors Mikkel Thorup and
Stephen Alstrup. The group is prolific at the topmost conferences like
SODA, STOC, and FOCS, e.g. with 10 papers accepted for SODA'18. Adding to
the excitement, we have just started the new center Basic Algorithms
Research Copenhagen (BARC, cf. barc.ku.dk). BARC is located at DIKU and
organized in collaboration with the IT University of Copenhagen. The aim is
to attract top talent from around the world to an ambitious, creative,
collaborative, and fun environment. Using the power of mathematics, we
strive to create fundamental breakthroughs in algorithmic thinking,
typically disseminated in top venues such as STOC, FOCS, and SODA. While
the focus of BARC is algorithms theory, we do have a track record of
surprising algorithmic discoveries leading to major industrial
applications. Finally, it should be mentioned that Computer Science and
Engineering at University of Copenhagen was 11th in the 2017 Shanghai
Ranking, and 3rd outside the US.

The duties of the postdoctoral researcher will include research within
algorithms as well as research-based teaching. The post may also include
performance of other duties.

Further information on the Department is linked at
http://www.science.ku.dk/english/about-the-faculty/organisation/.

Inquiries about the position can be made to Professor Mikkel Thorup,
Department of Computer Science, E-mail mthorup@di.ku.dk, Direct Phone: +45
21179123.

The University wishes our staff to reflect the diversity of society and
thus welcomes applications from all qualified candidates regardless of
personal background.

*Requirements *
The candidates must have

- a PhD degree in Computer Science, Mathematics, or equivalent.
- demonstrated strength within algorithm with a solid publication record
at the top conferences STOC, FOCS, and SODA.

*Terms of employment *
The position is covered by the Memorandum on Job Structure for Academic
Staff.
Terms of appointment and payment accord to the agreement between the
Ministry of Finance and The Danish Confederation of Professional
Associations on Academics in the State.

Depending on seniority, the gross basic salary range for Postdoctoral
Fellows is DKK 32,745 to DKK 34,476 per month (level 6 to 8) (about EUR
4,100 to 4,400 per month). A supplement could be negotiated, dependent on
the candidate's experience and qualifications. An additional 17.1 % monthly
contribution to pension will be paid by the employer.

Potential applicants from outside of Denmark can find information about
life in Denmark, including on taxation and health care at http://ism.ku.dk.
For most non-Danish citizens, health care is free and reduced taxation
available.

The application, in English, must be submitted electronically by clicking
APPLY NOW below.

*Please include *

- Curriculum vita
- Diplomas (Master and PhD degree or a statement from your supervisor,
which confirms that you will submit and defend your PhD before you start
employment)
- Complete publication list and links to author pages with DBLP and with
Google Scholar citations
- Separate reprints of 3 particularly relevant papers

*The deadline for applications is 15 December 2017, 23:59 GMT +1. *

After the expiry of the deadline for applications, the authorized
recruitment manager selects applicants for assessment on the advice of the
Interview Committee.

You can read about the recruitment process at
http://employment.ku.dk/faculty/recruitment-process/.


*APPLY NOW
<https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1307&ProjectId=146113&DepartmentId=18970&MediaId=4636&SkipAdvertisement=true>*

Part of the International Alliance of Research Universities (IARU), and
among Europe's top-ranking universities, the University of Copenhagen
promotes research and teaching of the highest international standard. Rich
in tradition and modern in outlook, the University gives students and staff
the opportunity to cultivate their talent in an ambitious and informal
environment. An effective organisation – with good working conditions and a
collaborative work culture – creates the ideal framework for a successful
academic career.

**********************************************************
*
* 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] 5th German Day on Computational Game Theory

First announcement: 5th German Day on Computational Game Theory


Dear colleagues,

I would like to draw your attention to the upcoming

5th German Day on Computational Game Theory,

to be held on

February 8-9, 2018, at the Department of Mathematics, University of Augsburg.

You can find a preliminary web page with important dates and additional information at

https://www.math.uni-augsburg.de/prof/opt/mitarbeiter/harks/Tagungen/5-GDCGT_2018/

This workshop will bring together researchers in Computer Science, Operations Research and Economics, who are interested in algorithmic or computational aspects of game theory, social choice and related areas. It provides an opportunity to foster collaboration, present research and exchange ideas at an informal and relaxed level.

Confirmed Plenary Speakers:

- Michal Feldman (Blavatnik School of Computer Science, Tel-Aviv University)
- Giorgos Christodoulou (Dept. of Computer Science, University of Liverpool)

Participation in the workshop is free of charge and lunch and coffee will be provided.

For registration, please send an email to

gdcgt2018@math.uni-augsburg.de,

no later than January 15th, 2018, if you plan to attend.

With best regards,

Tobias Harks

---------------------------------------------------------------
Prof. Dr. Tobias Harks
Institut fuer Mathematik
Universitaet Augsburg
86135 Augsburg
Tel.: 0821 598 2220 or 2212
E-Mail: gdcgt2018@math.uni-augsburg.de
https://www.math.uni-augsburg.de/prof/opt/mitarbeiter/harks/Tagungen/5-GDCGT_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 PMS 2018: New Deadline Extension

******************************************************************
PMS 2018
16th International Conference on Project Management and Scheduling
April 17-20, 2018
Rome - Italy
www.pms2018.ing.uniroma2.it
******************************************************************

Due to many requests, the deadline for submitting extended abstracts
has been further postponed to 24th November, 2017.

PMS 2018 (16th International Workshop on Project Management and
Scheduling) is organized by the Department of Enterprise Engineering
of the University of Rome "Tor Vergata" (Rome, Italy). The workshop
will be held in Rome - Italy - on April, 17-20, 2018 at Residenza di
Ripetta, strategically located in the heart of the City - a few steps
away from Piazza del Popolo and Piazza di Spagna.

The workshop website is http://www.pms2018.ing.uniroma2.it

The workshop will cover the following but non exhaustive list of topics:
- Project Management: Network modeling, Project scheduling, Resource
management, Due-date management, Project risk management, Project
scheduling under uncertainty, Proactive/reactive project scheduling,
Multicriteria project scheduling, Applications, Software
- Machine Scheduling: Shop scheduling, Scheduling with additional
constraints, Machine assignment and scheduling, Flexible/robust
scheduling, Grid scheduling, Multicriteria scheduling, Applications,
Software.

The workshop will consist of technical and selected presentations as
well as invited presentations made by esteemed researchers working on
Project Management and Scheduling.

Plenary speakers confirmed are:
- Jacques Carlier - Université de Technologie de Compiègne
- Rolf Möhring - Technische Universität Berlin
- Erwin Pesch - Universität Siegen

All researchers, academics, phd students and practitioners working on
the conference themes are invited to participate to PMS 2018
submitting an extended abstract (length 4 single-spaced A4 pages).
Templates and guidelines to authors are available on the PMS 2018
website. These 4-page submissions will be reviewed according to the
standard reviewing process of international conferences. A selection
of submissions will be presented during the workshop.

Best student paper award. See the PMS 2018 website for details
(section Call for papers).

After the workshop, the authors will have the opportunity to submit
full papers to a special issue of Annals of Operations Research (see
the PMS 2018 website).

Important deadlines:
Paper submission: 24th November 2017 (Extended)
Notification of acceptance: 19th January 2018
Final paper presentation: 12th February 2018
Early registration: 15th February 2018

A list of hotels will be made available on the PMS 2018 website soon.
We remind you that Rome is very crowded in the period of the
Conference. Hence, we warmly invite all the participants to reserve
their accommodation as soon as possible in order to find solutions at
best rates.

For detailed information about the conference and the venue, please,
visit the Conference website: http://www.pms2018.ing.uniroma2.it, or
send an email to caramia@dii.uniroma2.it.

On behalf of the Organizing Committee,
Massimiliano Caramia (Conference Chair)

**********************************************************
*
* 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, November 15, 2017

[DMANET] Call for Papers for the 29th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms

Call for Papers

29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms (AofA 2018)

Uppsala, Sweden,  June 25-29, 2018

The 29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms will be held in Uppsala, Sweden, June
25-29, 2018. The website of the event is to be announced.

Program Committee:

    Olivier Bodini, Paris 13, France
    Michael Drmota, TU Vienna, Austria
    James Allen Fill (chair), Johns Hopkins Univ., USA
    Antoine Genintrini, Paris 6, France
    Zbigniew Go??biewski, Wroc?aw U. Sci. Tech., Poland
    Cecilia Holmgren, Uppsala U., Sweden
    Hsien-Kuei Hwang, Academic Sinica, Taiwan
    Svante Linusson, KTH, Sweden
    Manuel Lladser, U. Colorado, USA
    Cécille Mailler, Univ. Bath, UK
    Markus Nebel, TU Kaiserslautern, Germany
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Daniel Panario, Carleton Univ., Canada
    Bruno Salvy, INRIA Lyon, France
    Robert Sedgewick, Princeton Univ., USA
    Wojciech Szpankowski, Purdue Univ., USA
    Stephan Wagner, Stellenbosch Univ., South Africa
    Mark Daniel Ward, Purdue Univ., USA

Steering Committee:

    Nicolas Broutin, INRIA Rocquencourt, France
    Hsien-Kuei Hwang, Academia Sinica, Taiwan
    Conrado Martinez, UPC Barcelona, Spain
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Robert Sedgewick (chair), Princeton Univ., USA
    Michèle Soria, Paris 6, France

Organization/Contact:

    Cecilia Holmgren, Uppsala University, Sweden
(cecilia.holmgren@math.uu.se)
    James Allen Fill, Johns Hopkins University, USA (jimfill@jhu.edu)

Scope:

Analysis of algorithms is a scientific basis for computation, providing
a link between abstract algorithms and the performance characteristics
of their implementations in the real world. The general effort to
predict precisely the performance of algorithms has come to involve
research in analytic combinatorics, the analysis of random discrete
structures, asymptotic analysis, exact and limiting distributions, and
other fields of inquiry in computer science, probability theory, and
enumerative combinatorics.  See http://aofa.cs.purdue.edu/ .

We invite papers in

    * analytic algorithmics and combinatorics
    * probabilistic analysis of algorithms
    * randomized algorithms

We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.

Confirmed keynote speakers:

    Louigi Addario-Berry, McGill University, Canada
    Béla Bollobás, Univ. of Cambridge, UK and Univ. of Memphis, USA
    Karen Gunderson, University of Manitoba, Canada
    Olle Häggström, Chalmers University of Technology, Sweden
    Svante Janson, Uppsala University, Sweden
    Mihyun Kang, Graz University of Technology, Austria
    Mark Daniel Ward, Purdue University, USA

Flajolet Award Lecture:

    Luc Devroye, McGill University, Canada

Submissions:

We invite you to submit an extended abstract (12 pages) or a short
abstract for a poster (2 pages) via the EasyChair system:

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

The proceedings will be published electronically.  Authors of selected
accepted papers will be invited to submit their contributions to a
special issue in a leading journal (to be determined).

Important dates:

    Submission deadline: February 8, 2018
    Notification: April 8, 2018
    Final version: May 8, 2018

If you intend to submit a paper, please consider submitting a title and
a short abstract early.
**********************************************************
*
* 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] FUN 2018 - Call for Papers

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

FUN 2018 - Call for Papers

9th International Conference on Fun with Algorithms
June 13-15, 2018. La Maddalena, Maddalena Islands, Italy
https://sites.google.com/view/fun2018/

=======================================================================
Submission deadline: Feb 9, 2018
https://easychair.org/conferences/?conf=fun2018
=======================================================================

SCOPE

FUN is dedicated to the use, design and analysis of algorithms and
data structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The topics of interest include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with mobile algorithms
FUN with Web algorithms
FUN with machine learning algorithms
FUN with parallel algorithms
FUN with optimization algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms

SUBMISSIONS

Contributors must submit their papers using the Easychair system.
https://easychair.org/conferences/?conf=fun2018
Submissions should not exceed 12 pages including front page and references.
Additionally, if full details of proofs do not fit into the page
limit, a clearly marked appendix containing the remaining details must
be included; this appendix will not be regarded as part of the
submission and will be considered only at the discretion of the
program committee. Submissions deviating substantially from this format
risk rejection without consideration of their merits.

Papers submitted for review should represent original, previously
unpublished work. At the time the paper is submitted to the conference,
and for the entire review period, the paper (or essentially the same
paper) must not be under review by any other conference with published
proceedings or by a scientific journal.
At least one author of every accepted paper is required to register
and present the paper at the symposium.


IMPORTANT DATES

Submission deadline: Feb 9, 2018
Author notification: April 1, 2018
Symposium: June 13-15, 2018


SPECIAL ISSUE

Authors of selected papers will be invited to submit an extended
versions of their work to a special issue of Theoretical Computer
Science.


PROGRAM COMMITTEE

Anna Bernasconi, U. Pisa, Italy
Allan Borodin, U. Toronto, Canada
Artur Czumaj, U. Warwick, UK
Erik Demaine, MIT, USA
David Eppstein, U. California Irvine, USA
Guy Even, Tel-Aviv University, Israel
Michele Flammini, GSSI & L'Aquila U., Italy
Rudolf Fleischer, GUtech, Oman
Paola Flocchini, Ottawa U., Canada
Fedor Fomin, U. Bergen, Norway
Naveen Garg, IIT Delhi, India
Fabrizio Grandoni, IDSIA Lugano, Switzerland
John Iacono, U. Libre Bruxelles, Belgium
Hiro Ito, UEC, Japan (co-chair)
Marc van Kreveld, Utrecht U., Netherlands
Stefan Langerman, U. Libre Bruxelles, Belgium
Stefano Leonardi, Sapienza U. Rome, Italy (co-chair)
Anna Lubiw, U. Waterloo, Canada
Flaminia Luccio, Ca' Foscari U. Venice, Italy
S. Muthu Muthukrishnan, Rutgers U., USA
Yoshio Okamoto, UEC, Japan
Mike Paterson, U. Warwick, UK
Nadia Pisanti, ERABLE Team INRIA and U. Pisa, Italy
David Peleg, Weizmann Inst. Sci., Israel
Geppino Pucci, U. Padova, Italy
Laura Sanita', U. Waterloo, Canada
Aravind Srinivasan, U. Maryland, College Park, USA
Ryuhei Uehara, JAIST, Japan
Yushi Uno, Osaka Prefecture U., Japan
Takashi Horiyama, Saitama U., Japan
Hideki Tsuiki, Kyoto U., Japan
Aaron Williams, Bard College at Simon's Rock, USA

ORGANIZING COMMITTEE

- Linda Pagli, U. Pisa, Italy
- Giuseppe Prencipe, U. Pisa, Italy
- Atsuki Nagao, Seikei U., Japan (web manager)


STEERING COMMITTEE

- Erik Demaine, MIT, USA
- Fabrizio Grandoni, IDSIA, Switzerland
- Linda Pagli, U. Pisa, Italy
- Giuseppe Prencipe, U. Pisa, Italy
- Nicola Santoro, Carleton U., Canada
- Ugo Vaccaro, U .Salerno, 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] Research Fellow in Applied Operational Research/Railway Logistics

*Research Fellow in Applied Operational Research/Railway Logistics*

*Faculty of Technology*

*Department of Mathematics*

*University of Portsmouth*

*Employment type: Fixed-term contract to 31 August 2019*

*Employment basis: Full-time*

*Salary**: £34,520 - £37,706 per annum*

*Post number: ZZ004260*

*Date published: 03 November 2017*

*Closing date: 03 December 2017 *

*Interview date: 11 December 2017*

Applications are invited for the position of Research Fellow in the
Logistics, Operational Research and Analytics Group at the University of
Portsmouth. The researcher will work on a collaborative multi-disciplinary
project funded by RSSB (Rail Safety and Standards Board), involving the
University of Portsmouth, Cubic Transportation Systems Ltd., Transport
Systems Catapult, Chiltern Railways, Transport for London, Arriva UK Trains
Ltd.

Applicants should have a PhD (or equivalent research experience) in
Operational Research, or a related discipline. Experience in applied
Operational Research and Logistics is required; and expertise in transport
and railway logistics, and predictive modelling is desirable. Ideally, you
should have experience in dealing with industrial and/or governmental
problem owners and decision makers. Proficiency in computer programming is
also required. The applicants should show strong motivation for independent
research, and the ability to work with academic and industrial partners.

Applicants should also be able to perform effectively under pressure and
time constraints, possess good organisational and time management skills,
pay close attention to detail, and have effective interpersonal skills.
Applicants should be willing to undertake travel to work with the partners.


You will work on the development of intelligent gatelines; using
situational awareness to improve customer experience, gate throughput and
increase gateline staff effectiveness at mainline and metro stations. This
will include the design and implement real-time predictions of crowding at
the stations and the length of the queues at the gates; and the optimal
configuration of gates to use in both directions and the maximum throughput
of each gate. The real time predictions on passenger crowding will be used
to determine the optimal gate line configuration to minimise congestion on
the platform and maximise passenger safety and comfort.

Informal enquiries can be addressed to Prof. Djamila Ouelhadj (
Djamila.ouelhadj@port.ac.uk), tel: +44 (0) 23 8059 6355 <023%208059%206355>,
mobile: +44 (0)7818453756 <07818%20453756>; or Prof. Graham Fletcher (
Graham.fletcher@cubic.com), tel: +44 (0)7718696788 <07718%20696788>

For detailed information about the vacancy, please select this link: ZZ004260
- Research Fellow in Applied Operational Research/Railway Logistics.docx
<https://port.engageats.co.uk//ViewAttachment.aspx?enc=jmxpV+AcVus8i/wvT3FZXrrCOvCUGNWd9uca/tGZrAIwi3eRa4DOfjyKHGN5LiPM5y/iI8HQDfmAEzqv41kKDbpDEHePcrUVlSsul3eqpiJZAw+JhjDPJBzluRF5IGDS>


Please apply HERE
<https://port.engageats.co.uk/ViewVacancy.aspx?enc=mEgrBL4XQK0+ld8aNkwYmCnfQnK06SMs0ZJDJHex92CjwmxIr/S+JH+XHI7H+cAGHUyKlz+0qwO+Y3crGd5jea0f/fIYTsf0tI4PP+YkgtkNpShPQw9y4VazFpih7ZhQvxX/O4IhvPTxZk1oohDp+w==>
.

Best regards,
Banafsheh Khosravi
-----------------------------------------------------------
Dr Banafsheh Khosravi, PhD, MSc, BSc
Senior Lecturer in Operational Research
Department of Mathematics
University of Portsmouth
Portsmouth PO1 3HF
-----------------------------------------------------------

**********************************************************
*
* 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: ISCO 2018

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

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

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

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

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

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

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

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

CONFERENCE CHAIRS
Abdelatif El Afia (ENSIAS, University Mohammed V, Marroco)
Jon Lee (University of Michigan, USA)
A. Ridha Mahjoub (University Paris-Dauphine, France)
Giovanni Rinaldi (IASI, Roma, Italy)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] OPODIS 2017 Call for Participation

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

[DMANET] Postdoc positions in algorithms and complexity at MPII, Germany

M A X P L A N C K I N S T I T U T E
for
I N F O R M A T I C S

seeks several

POSTDOCS

for the Algorithms and Complexity Department

directed by Kurt Mehlhorn.

We are looking for applicants from all areas of algorithmics, including
related areas like computer algebra, complexity theory, and discrete
optimization. We are also seeking researchers interested in distributed
computing and computational geometry.

The Max Planck Institute for Informatics is located on the campus of
Saarland University in Saarbruecken, Germany. Currently, more than 40
researchers of several nationalities work in the Algorithms and Complexity

Department. Our working language is English. The group collaborates with
several major research institutions in Europe and the U.S. and has high
international visibility. There is generous travel support available for
all group members. Postdoctoral fellowships are available for one year
through the Guest Program of our institute. Guest researchers are
free in their choice of research topics and collaborators.

The Max Planck Society is committed to employing more individuals with
disabilities and expressly welcomes these to apply.
The Max Planck Society seeks to increase the percentage of women in the
areas where they are underrepresented and expressly encourages these to
apply.

Applications are to be submitted via our web form at

http://www.mpi-inf.mpg.de/d1postdoc

by uploading a single PDF-file containing

* a curriculum vitae,
* a complete list of publications, and
* a research plan (1 page suffices).

The submission server is online now, and applications are reviewed as they
are received. We encourage you to apply early; however, all applications
that are submitted by 15 December 2017 will receive full consideration.
Simultaneous applications for a Lise Meitner Award Fellowship or a
Simons-MPI joint fellowship are possible (please indicate simultaneous
applications in the cover letter).

**********************************************************
*
* 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] PACE 2018: Call for participation

After a successful PACE 2017 challenge (see here for the official report https://pacechallenge.files.wordpress.com/2016/06/lipics-ipec-2017-30.pdf), we are now happy to announce PACE 2018, the Parameterized Algorithms and Computational Experiments Challenge. The goal of PACE is to investigate the practical applicability of algorithmic ideas studied and developed in the subfields of multivariate, fine-grained, parameterized, or fixed-parameter tractable algorithms. The challenge this year consists of three tracks on the Steiner Tree problem.

Given an undirected edge-weighted graph G and a subset T (terminals) of its vertices, find a subgraph of G spanning T with the smallest total edge-weight.

TRACK 1 (Exact with few terminals)

You have 30 minutes per instance.
Win by solving more instances than the other participants.
In all the instances, there are only a few terminals.

TRACK 2 (Exact with low treewidth)

You have 30 minutes per instance.
Win by solving more instances than the other participants.
In this track only, the instances come with a tree decomposition and the treewidth is low.

TRACK 3 (Heuristic)

Here the instances are significantly larger, have many terminals, and high treewidth, but you are not expected to find an optimum solution.
You still have 30 minutes per instance.
Win by finding Steiner trees of smaller weight than the other participants.
We will rank by average approximation ratio.

Detailed instructions about the three tracks, their rules, the instance sets, and the input and output formats: https://pacechallenge.wordpress.com/pace-2018/

You can already register for the challenge: https://docs.google.com/forms/d/e/1FAIpQLScHH6lNpUYwLT6GDVMO9ik0s9iwhQTRbxnaJED1wdZOWBtJRg/viewform .
You can also download the public instances on the PACE challenge website and start your implementation.
As for the previous edition, we cooperate with the platform optil.io (https://www.optil.io/optilion/).
In a short while, you will be able to run your code on this platform.
We will let you know when it is ready and how to proceed.

TIMELINE:

November 14th, 2017: Announcement of the challenge
May 1st, 2018: Submission of final program
May 10th, 2018: Result are communicated to participants
August 20-24 2018: Award ceremony at the International Symposium on Parameterized and Exact Computation (IPEC 2018) in Helsinki

PROGRAM COMMITTEE:

Track 1, 2, 3:
- Édouard Bonnet (Middlesex University, London)
- Florian Sikora (Paris-Dauphine University)

STEERING COMMITTEE:

- Holger Dell (Saarland University and Cluster of Excellence, MMCI)
- Bart M. P. Jansen (chair) (Eindhoven University of Technology)
- Thore Husfeldt (ITU Copenhagen and Lund University)
- Petteri Kaski (Aalto University)
- Christian Komusiewicz (Friedrich-Schiller-University Jena)
- Frances A. Rosamond (University of Bergen)

Best of luck with your code!

The PACE Committees

**********************************************************
*
* 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] Computational optimization

Call for Papers

11th International Workshop on Computational Optimization (WCO18)
Poznan, Poland, September 9-12, 2018

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2018

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.

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

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO18 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2018
Position paper submission : May 15th, 2018
Author notification : June 12th, 2018
Final paper submission and registration : July 03, 2018
Conference date : September 9-12, 2018

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2018@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Numerical search and optimization

Dear Colleagues,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "Numerical Search and Optimization"
at the
9th Conference on Numerical Methods and Applications NM&A'18,
to be held 20-24 August 2018 in Borovets, Bulgaria.
The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies,
Bulgarian Academy of Sciences
Prof. Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain, and
Prof. Kalin Penev, (kalin.penev@solent.ac.uk) School Media Arts and
Technology, Southampton Solent University, UK.

Topics

The list of topics includes, but is not limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multi-objective optimization
- optimization in dynamic and/or noisy environments
- large scale optimization
- Scalable search and optimization methods
- Scalable numerical tests
- parallel and distributed approaches in optimization
- random search algorithms
- adaptive search algorithms
- nature inspired optimization methods
- hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
- optimization methods for learning processes and data mining
-classical operational research problems (knapsack, traveling salesman, etc)
-computational biology and distance geometry
-data mining and knowledge discovery
-human motion simulations; crowd simulations
-industrial applications
- computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc


Proceedings
The refereed and presented papers will be published as a special
volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
April 15, 2018
Notification of acceptance of the talks on the basis of the
submitted abstract
April 30, 2018
Deadline for submission of full papers
June 10, 2018
Notification of acceptance of full papers
July 10, 2018
Submission of accommodation forms
July 15, 2018
Final version of paper submission
September 30, 2018

Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http:http://nma18.fmi.uni-sofia.bg/

Special session organizers
Prof. S. Fidanova (stefka@parallel.bas.bg) , Institute of Information
and Communication Technologies, Bulgarian Academy of Science.
Prof. Gabriel Luque (gabriel@lcc.uma.es), University of Malaga, Spain.
Prof. Kalin Penev (penev@solent.ac.uk), School Media Arts and
Technology, Southampton Solent University, UK.

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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, November 14, 2017

[DMANET] PhD position in discrete optimization at FAU Erlangen-Nürnberg

The Chair of Economics, Discrete Optimization and Mathematics invites
applications for a full-time

    PhD position in Discrete Optimization

at the Department of Mathematics to be filled by 01 March 2018 for an
initial period of three years. The successfull applicant will work in a
project on the

    Integrated Optimization of International Transportation Networks

in cooperation with DB Cargo Polska, a subsidiary of Deutsche Bahn AG.
The focus of the project will be the development of model hierarchies
and mixed-integer optimization methods for the optimal allocation of
resources in railway transport (staff, rolling stock, ...), especially
in the context of border-crossing transport services. The mathematical
work in this project will focus on structural analysis of this problem,
drawing e.g. upon polyhedral analysis and graph theory, as well as the
treatment of data uncertainties, which will require the development of
robust or stochastic optimization approaches. The PhD candidate will
spend secondments for technical and scientific training at DB Cargo
Polska in Zabrze, Poland. The PhD degree will be awarded by FAU
Erlangen-Nürnberg, Germany.

Applicants should have completed their studies at master level in a
program with strong mathematical background in discrete optimization. We
seek excellent open-minded and team-spirited PhD candidates who will get
unique international, interdisciplinary and inter-sectoral training in
scientific and transferable skills by distinguished leaders from
academia and industry.

This position is offered as part of the European Industrial Doctorate
(EID) training network ROMSOC (Reduced Order Modelling, Simulation and
Optimization of Coupled systems) within the Marie Skłodowska Curie
Actions of the Horizon 2020 programme (see
https://euraxess.ec.europa.eu/jobs/257318 for further information).
Please note that according to the EU mobility rule governing this kind
of training network, we can only consider applicants who have not lived
or worked in Germany for more than 12 months during the last 3 years.

For further information and the application guidelines, please see the
official announcement:
http://www3.math.tu-berlin.de/numerik/mt/NumMat/ECProjekte/ROMSOC/ROMSOC_call_ESR07.pdf

Please send your complete application documents (motivation letter,
detailed CV, certificates, list of MSc courses and grades, copy of the
master thesis, reference letter etc.) in electronic form until 30
November 2017 to:
Alexander.Martin@fau.de
(Prof. Dr. Alexander Martin
FAU Erlangen-Nürnberg
Lehrstuhl für Wirtschaftsmathematik
Cauerstraße 11
91058 Erlangen, Germany)
**********************************************************
*
* 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] Conference in honor of Thomas C. Hales: "From the Fundamental Lemma to Discrete Geometry, to Formal Verification", June 18-22, 2018 at the University of Pittsburgh

Dear all,

We are pleased to announce the conference

From the Fundamental Lemma to Discrete Geometry, to Formal Verification

which will take place June 18-22, 2018, 2018 at the University of
Pittsburgh. The conference is held in honor of Thomas C. Hales on the
occasion of his 60th birthday.

http://www.mathematics.pitt.edu/hales60/


*** Scope and speakers ***

The conference will feature talks on representation theory, discrete
geometry, and formal verification, with 1.5 days dedicated to each of
these topics and with broadly accessible public lectures at the
interfaces.

*Geometry*

Károly Bezdek (University of Calgary)
Robert Connelly (Cornell University)
John Conway (Princeton University)
Sharon Glotzer (University of Michigan)
Stephen D. Miller (Rutgers University)
Ileana Streinu (Smith College)
Frank Vallentin (University of Cologne)


*Formal proof verification*

Mark Adams (Radboud University Nijmegen)
Andrew Appel (Princeton University),
Georges Gonthier (INRIA)
John Harrison (Intel)
Robert Lewis (Carnegie Mellon University)
Assia Mahboubi (INRIA)
Tobias Nipkow (Technical University Munich),
Hoàng Lê Trường (Vietnam Academy of Science & Technology)
Josef Urban (CTU Prague)
Bohua Zhan (MIT)


*Automorphic forms and the Fundamental Lemma*

James Arthur (University of Toronto)
William Casselman (University of British Columbia)
Ngô Bảo Châu (University of Chicago)
Mark Goresky (Institute for Advanced Study)
Ju-Lee Kim (MIT)
Colette Mœglin (Institut de Mathematiques de Jussieu)
Peter Sarnak (Institute for Advanced Study), TBC
Tasho Statev-Kaletha (University of Michigan)


*Motivic integration and transfer principles*

François Loeser (Institut de Mathematiques de Jussieu)
Yimu Yin (Los Angeles)


*** Registration and financial support ***

To register for the conference, please visit:

http://www.mathematics.pitt.edu/hales60/

The registration will open in December 2017. There will be no
registration fee, but we ask those planning to attend to register.

Limited financial support will be available to help cover
participants' travel and local expenses. The priority will be given to
students and postdocs who do not have access to other sources of
funding. Women and members of underrepresented minorities are
particularly encouraged to apply.

To apply for funding, please fill out the funding application form
which is part of the online registration. The deadline to apply for
financial support is March 15, 2018.


*** Banquet ***

A banquet dinner will be held on Thursday, June 19, starting at 6 PM
at the University Club. Please indicate on the registration form if
you plan on attending. The banquet will cost $30 per person.


If you have any questions, please contact the organizers at

hales60conference@gmail.com


We are looking forward to seeing you all in Pittsburgh!

Organizers: Jeremy Avigad, Henry Cohn, Julia Gordon, Michael Harris,
Bogdan Ion, Chris Kapulkin, Wöden Kusner

**********************************************************
*
* 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] Two post-doctoral positions in Lyon, France, 2018

The Excellence Laboratory Milyon (Labex Milyon -
http://milyon.universite-lyon.fr ) opens the 2018 campaign of
postdoctoral researchers in Mathematics and Fundamental Computer Science
in Lyon & Saint-Etienne.

*Milyon offers two postdoctoral positions of two years with no teaching
load for the period 2018–2020.*

All the domains in Mathematics and Fundamental Computer Science are
eligible.

More information on the links below:
http://milyon.universite-lyon.fr/en/appels-doffres/contrats-post-doctoraux/
http://milyon.universite-lyon.fr/en/wp-content/uploads/sites/3/2017/11/Milyon_call_postdocs_2018.pdf

Deadline for application: January 10th 2018.

===

Michaël Rao
https://perso.ens-lyon.fr/michael.rao/
MC2
team "Models of computation, Complexity and Combinatorics"
CNRS, LIP, École Normale Supérieure de Lyon

===


**********************************************************
*
* 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, November 13, 2017

[DMANET] First Call for Papers - PATAT 2018: 12th International Conference on the Practice and Theory of Automated Timetabling

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]

Call for Papers

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

PATAT 2018

12th International Conference on the Practice and Theory of Automated
Timetabling

28-31 August, 2018 in Vienna, Austria

http://www.patatconference.org/patat2018/

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

AIM AND SCOPE:

The International Series of Conferences on the Practice and Theory of
Automated Timetabling (PATAT) is held biennially as the main international
forum for both researchers and practitioners of timetabling to exchange
ideas. PATAT 2018 which is the twelfth in the conference series will be held
in Vienna, Austria.

Whether it is sporting events, educational institutions, transportation or
employee management the construction of efficient timetables which provide
the maximum in way of flexibility for all constituent parts is as important
as it is challenging. An increasingly important aspect within organisations
is an automated approach which optimises all aspects of resource usage. In
doing so a number of quantitative and qualitative challenges must be dealt
with from both a technical and practical perspective.

An important aim of the conference is to align the needs of practitioners
and the objectives of researchers. This is achieved through the presentation
and application of leading edge research techniques. Practitioners and
Researchers alike are encouraged to present their work and experiences with
the overall goal of developing efficient and practical solutions. With this
goal in mind, at PATAT 2018, researchers and practitioners will be brought
together through a number of key presentations and workshops.

Topics of interest and themes of the conference include, but not limited to:

- Educational Timetabling

- Timetabling in Transport

- Employee Rostering

- Sports Timetabling

- Timetabling in Healthcare

- Mathematical Programming

- Constraint-Based Methods

- Knowledge Based Systems

- Fuzzy Systems

- Heuristic Search

- Metaheuristics (e.g., Evolutionary Computation, Simulated Annealing, Tabu
Search, Ant Colony Methods)

- Systems to Build Systems (e.g., Hyper-heuristics, Algorithm Portfolios)


- Algorithm Configuration

- Artificial Intelligence

- Graph Colouring

- Resource Capacity Planning

- Parallel/Distributed Computing

- Hybrid Methods (e.g., Memetic Computing, Matheuristics)

- Machine Learning (e.g., Data Mining, Classifier Systems, Neural Networks)

- Expert Systems

- Multi-objective Approaches

- Multi-criteria Decision Making

- Foundational Studies (e.g., Complexity Issues)

- Timetabling Tools and Applications (e.g., Interactive and Batch Systems,
Standard Data Formats, Ontologies, Experiences)

IMPORTANT DATES:

* Paper Submission Deadline: 26 February, 2018

* Notification of Acceptance: 30 April, 2018

* Early Registration Closes: 30 June, 2018

* Conference: 28-31 August, 2018

PUBLICATION:

Authors are invited to submit their work in one of three categories:

1) Full papers: Authors should submit papers describing significant,
original and unpublished work.

2) Abstracts: People who wish to give a talk (e.g. practitioners,
researchers with preliminary or incomplete papers) but do not want to submit
a full paper can submit abstracts of up to 1000 words.

3) System demonstrations: Authors can also submit an abstract, describing
the major properties and contribution of implemented and/or commercial
timetabling systems.

All submissions will be peer reviewed by at least three members of the
programme committee. Accepted papers will be invited for an oral
presentation at the event and included in the PATAT 2018 proceedings after
they are presented.

Detailed submission details and the link to the submission system are
available at: http://patatconference.org/patat2018/instructions/

JOURNAL SPECIAL ISSUE:

Authors of all three categories will be invited to submit extended versions
of their original work as full papers for consideration to be published in a
Special Issue of the Annals of Operations Research.

PROGRAMME CO-CHAIRS:

* Edmund Burke, Queen Mary University of London (UK), e.burke(ATT)qmul.ac.uk

* Luca Di Gaspero, Univerity of Udine (IT), luca.digaspero(ATT)uniud.it

* Barry McCollum, Queen's University Belfast (UK), b.mccollum(ATT)qub.ac.uk

* Nysret Musliu, TU Wien (AT), musliu(ATT)tuwien.ac.at

* Ender Özcan, University of Nottingham (UK),
ender.ozcan(ATT)nottingham.ac.uk

ORGANISING COMMITTEE:

* Emir Demirović, University of Melbourne (AU)

* Luca Di Gaspero, University of Udine (IT)

* Florian Mischek, TU Wien (AT)

* Nysret Musliu, TU Wien (AT)

* Tommaso Urli, Satalia and Alpen-Adria-Universität Klagenfurt (AT)

* Felix Winter, TU Wien (AT)

This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.

Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.

This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.

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