Theory Announcements: October 2018

Wednesday, October 31, 2018

[DMANET] Developing Countries - Resources online --- IFORS

Dear Colleagues,

The aim of the IFORS Developing Countries On-Line Resources page is to offer the OR worker all publicly-available materials on the topic of OR for Development. It also aims to provide a venue for people who are working in the area to share their completed or in-process work, learn from others, and stimulate comments and discussions on the work.

Regarding IFORS Developing Countries OR resources website, its regular updates - and your possible submission of "free" (not copyright protected) material, you might occasionally visit

[ http://ifors.org/developing_countries/index.php?title=Main_Page | http://ifors.org/developing_countries/index.php?title=Main_Page ] .

"Operational Research" (OR) is the discipline of applying advanced analytical methods to help make better decisions. By using techniques such as problem structuring methods and mathematical modelling to analyze complex situations, Operational Research gives executives the power to make more effective decisions and build more productive systems.

The International Federation of Operational Research Societies (IFORS; [ http://ifors.org/ | http://ifors.org/ ] ) is an almost 60-year old organization which is currently composed of 51 national societies.

Regional Groups of IFORS are:

ALIO (The Latin American Ibero Association on Operations Research),
APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies).

IFORS conferences are taking place every three years; IFORS 2017 has been successfully celebrated in Quebec City, Canada.

Thank you very much for your attention.

With kind regards,
best wishes,

Luciana Buriol, Sue Merchant, Gerhard-Wilhelm Weber

PS: Feedback is welcome via [ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | buriol@inf.ufrgs.br ] , [ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | suemerchant@hotmail.com ] , [ https://horde.metu.edu.tr/imp/dynamic.php?page=mailbox# | gerhard.weber@put.poznan.pl ] .

**********************************************************
*
* 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] IBS Discrete Mathematics Group (DIMAG) Postdoctoral Research Fellowship

The IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea invites
applications for several postdoctoral research fellowship positions. The
expected start date is the 1st of March 2019 but it can be negotiated; it
is possible to start earlier or later in 2019 but the candidate should have
a Ph.D. by the start date.

DIMAG is a new research group to be established in December 2018 at the
Institute for Basic Science (IBS, https://www.ibs.re.kr), led by Prof.
Sang-il Oum (https://mathsci.kaist.ac.kr/~sangil/). DIMAG is located on the
main campus of the Institute for Basic Science (IBS) in Daejeon, South
Korea, a city of 1.5 million people.

Successful candidates for postdoctoral research fellowship positions will
be new or recent Ph.D.'s with outstanding research potential in all fields
of discrete mathematics with emphasis on structural graph theory, extremal
graph theory, combinatorial optimization, matroid theory, or fixed-paramter
tractable algorithms.

These non-tenure-track appointments are for two or three years, and the
salary range is KRW 57,000,000 – 66,000,000. The appointment is one time
renewable up to 5 years in total contingent upon the outstanding
performance of the researcher.

These are purely research positions and research fellows will have no
teaching duties.

A complete application packet should include:

(1) AMS standard cover sheet (preferred) or cover letter (PDF format)

(2) Curriculum vitae including a publication list (PDF format)

(3) Research statement (PDF format)

(4) At least 3 recommendation letters

For full consideration, applicants should email items 1, 2, and 3 and
arrange their recommendation letters emailed to dimag@ibs.re.kr by Friday,
December 14, 2018. Recommendations letters forwarded by an applicant will
not be considered.

DIMAG encourages applications from individuals of diverse backgrounds.

DIMAG website: dimag.ibs.re.kr (will be available soon)

*For Korean citizens who have not yet completed their military duty: IBS는
병역특례지정기관입니다. IBS is a designated institute for alternative military service.

--
Sang-il Oum
Professor, Dept. of Mathematical Sciences, KAIST.
https://mathsci.kaist.ac.kr/~sangil/

[DMANET] Full professor Discrete Mathematics

Delft Institute of Applied mathematics, Delft University of Technology,
seeks a full Professor in the field of Discrete Mathematics.
A description of the position can be found here:
https://vacature.beta.tudelft.nl/vacaturesite/permalink/50634/?lang=en

For more information about this position, please contact Prof. Geurt
Jongbloed, phone: +31 (0)15-2785111, e-mail: G.Jongbloed@tudelft.nl or
Prof. Karen Aardal, phone: +31 (0)15-2785093, e-mail:
K.I.Aardal@tudelft.nl. To apply, please e-mail a detailed CV and
statements on research, education, and valorisation along with a letter
of application before January 15, 2019 to HR-EEMCS@tudelft.nl.

When applying for this position, please refer to vacancy number EWI2018-63
**********************************************************
*
* 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] UD position Mathematics for Business @ VU

At VU-mathematics we have an open position for an

ASSISTANT PROFESSOR (UD) IN MATHEMATICS FOR BUSINESS

The department is looking for candidates with a proven expertise in an area of mathematics that is related to business, like discrete or stochastic optimization, data analytics, operations research, applied probability, statistics, data mining or machine learning.

More information: https://www.academictransfer.com/en/50693/
**********************************************************
*
* 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] EJTL Special Issue on "Combining optimization and machine learning: applications in vehicle routing, network design and crew scheduling"

Dear colleagues,

the EURO Journal on Transportation and Logistics proposes a Special
Issue on "Combining optimization and machine learning: applications in
vehicle routing, network design and crew scheduling".
The deadline for submission is March 31st, 2019.
In the following you find the call for papers.

We look forward to your contribution.

Best regards,

Claudia Archetti

EJTL Special Issue on

Combining optimization and machine learning: applications in vehicle
routing, network design and crew scheduling

Guest editors: Claudia Archetti, Jean-François Cordeau, Guy Desaulniers

Submission deadline: March 31, 2019

Several families of core problems in transportation and logistics such
as vehicle routing, network design and crew scheduling remain formidably
challenging to solve for the operations research community and, for most
of them, efficient algorithms are still sought after by the industry.
One recent research trend explores the possibility of combining
optimization and machine learning in innovative ways to design improved
algorithms. Machine learning and optimization can be applied
sequentially or in an integrated fashion. In the former case, machine
learning can be used, for example, to estimate some problem input (e.g.,
cost coefficients, customer demand, capacity) for the optimization
model, to preprocess data with the goal of reducing the size of the
model to solve, or to describe customer behavior and preferences. In the
latter case, machine learning can be applied, for example, to adjust the
values of some of the parameters controlling the optimization algorithm
or to make heuristic decisions within the algorithm (e.g., select a
branching variable or define a neighborhood to explore) to increase its
efficiency.

This special issue focuses on the development of innovative solution
methods that combine machine learning and optimization to efficiently
solve vehicle routing, network design and crew scheduling problems in
all transportation modes (freight, public transit, air, maritime, rail).
The proposed optimization algorithms can be exact or heuristic.

Topics of interest include (but are not limited to):

·Vehicle routing and its variants: capacitated, with profits,
stochastic, time-dependent, split delivery, pickup-and-delivery, etc.

·Inventory routing

·Location routing

·Transportation and supply chain network design

·Ship routing and scheduling

·Bus scheduling

·Fleet assignment / locomotive assignment

·Duty scheduling / crew pairing

·Crew scheduling / crew rostering

--
Claudia Archetti
Associate Professor in Operations Research
Dept. of Economics and Management
University of Brescia
Contrada S.ta Chiara 50
25122 Brescia
Italy
Tel: +39 030 2988587
Fax: +39 030 2400925
E-mail: claudia.archetti@unibs.it
web OR group: http://or-brescia.unibs.it
web: http://www.unibs.it/dipartimenti/metodi-quantitativi/personale-del-dipartimento/ricercatori/dottssa-archetti-claudia

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

Tuesday, October 30, 2018

[DMANET] Tenured / Tenure-Track Faculty Positions at UCSB

The Department of Computer Science at the University of California,
Santa Barbara is continuing a period of strategic growth, with plans for
new faculty positions that will add to core
strengths, explore new and emerging areas of the field, and leverage
opportunities across disciplinary boundaries. Towards this goal, the
department invites applications for tenure-track
or tenured appointments at the Assistant/Associate/Full Professor
levels, for the 2019-2020 academic year. For primary consideration apply
by November 16, 2018; however, positions will
remain open until filled.

We are looking for individuals from all areas of Computer Science who
have a track record of research excellence, a passion to shape the
future of the field, and the potential to become an outstanding leader
in research and education. The department is especially interested in
candidates who can contribute to the diversity and excellence of the
academic community through research, teaching, and service. Qualified
assistant professor candidates will be considered for appointment to the
John and Eileen Gerngross Endowed Chair, which is intended to support a
junior faculty scholar and future leader and to strengthen department
diversity.

UC Santa Barbara is a premier public research university. The Department
of Computer Science is part of the highly ranked College of Engineering,
which includes among its faculty three Nobel laureates and 29 members of
the National Academy of Engineering. Additional information about the
department and our academic programs can be found at
http://www.cs.ucsb.edu.

PhD in Computer Science or related field at the time of application is
preferred. At the minimum in order to be considered, applicants should
have completed all requirements for a PhD (or equivalent) in Computer
Science or a related field, except the dissertation (or equivalent) at
the time of application. PhD degree must be conferred by the time of
appointment.

All applications *must* include a cover letter, curriculum vitae,
statement of research, statement of teaching, contact information for
three to five references, and candidates' three top publications.
Additionally, we strongly encourage all applicants to include a
statement of contribution to diversity. *In your cover letter, please
indicate whether you are applying to a tenure-track position (Assistant
Professor) or a tenured position (Associate/Full Professor)*.

Letters of reference for completed applications will be requested by the
department at the following stages:
- Assistant Professor level will be requested by the department once the
initial review date passes and/or after any additional review dates.
- Associate/Full Professor levels will be requested by the department at
the point of serious consideration.

Applications should be submitted electronically as PDF documents to
https://recruit.ap.ucsb.edu/apply/JPF01312.

The University of California is an Equal Opportunity/Affirmative Action
Employer, and all qualified applicants will receive consideration for
employment without regard to race, color, religion, sex, sexual
orientation, gender identity, national origin, disability status,
protected veteran status, or any other characteristic protected by law.

[DMANET] [GECCO CFP] (Deadline Nov 7) Call for Proposals for Tutorials, Workshops and Competitions - Genetic and Evolutionary Computation Conference 2019

=======================================================================
2019 Genetic and Evolutionary Computation Conference (GECCO 2019)
13-17 July, 2019, Prague, Czech Republic http://gecco-2019.sigevo.org/
=======================================================================

Important Dates
-----------------------------------------------------------------

* Call for Tutorials, Workshops and Competitions
* Proposals: November 7, 2018
* Acceptance Decision: December 5, 2018
* Conference: July 13-17, 2019

Call for Tutorials
-----------------------------------------------------------------

The Tutorials Chair of GECCO 2019 invites domain experts to submit
proposals for presenting a tutorial at GECCO 2019.

Tutorials at GECCO will be presented by domain experts to cover current
topics relevant to evolutionary computation researchers and
practitioners. Each tutorial will be 110 minutes long. We encourage the
inclusion of interactive activities and demos.

Tutorials will be free to all GECCO attendees. It is expected that all
the instructors involved in a tutorial will attend the conference. One
instructor/presenter of each accepted tutorial will get a discounted
registration. (The discount can be divided among tutorial instructors if
there are more than one. Each presenter is eligible for only a single
tutorial discount, i.e., it is not possible to aggregate discounts from
more tutorials).

Accepted tutorials' slide sets will be published as part of a companion
volume to the conference proceedings in the ACM Digital library.

### Submission Process ###

Each tutorial proposal should include:

1. A half-page extended abstract (in plain text) that includes: the title
of the tutorial, the name and affiliation of the instructor(s), and a
description of the tutorial scope, content and expected level of
knowledge
of the intended audience.

2. Short bio of the instructor(s) (about half page in plain text).

3. [Highly encouraged] A description of any interactive activity or demo
planned within the tutorial presentation.

### Reviewing ###

Tutorial proposals will be reviewed by the GECCO 2019 organizing
committee, based on the GECCO attendees' likely interest in them, the
breadth and depth of the topic(s), and the expertise and credentials of
the instructor(s).

### Information and Submissions ###

Tutorials proposals should be submitted to:

Sébastien Verel
Université du Littoral Côte d'Opale, Calais, France
Email: verel@univ-littoral.fr
Webpage: https://gecco-2019.sigevo.org/index.html/Call+for+Tutorials

Call for Workshops
-----------------------------------------------------------------

The Workshops Chairs of GECCO 2019 invite domain experts to submit
proposals for organizing a workshop at GECCO 2019.

Workshops at GECCO provide the possibility to commonly develop visions
and exchange ideas in an informal setting, especially if focused on an
emerging research field or interdisciplinary research area. In contrast
to regular sessions, workshops can (and should) host interactive
sessions (posters, discussions, demonstrations, etc.). Attendance at the
workshops will be free to all GECCO attendees.

Workshop organizers are responsible for coordination and publicity. They
collect and review papers, and provide a list of accepted papers and
their authors, if applicable. Alternatively, a list of (invited)
speakers and titles of talks to be given can be provided. If required,
the GECCO organizers may provide additional support to the workshop
organizers, such as publicity. Note that organizers, participants and
presenters must register for the conference. Accepted workshop papers
will be published as part of a companion volume to the conference
proceedings in the ACM Digital library.

### Submission Process ###

Each workshop proposal should include:

1. A half-page extended abstract (in plain text) that includes: the
workshop
title, the name and affiliation of the organizer(s), and a
description of
scope and content.
Please refrain from using special characters in the title.

2. Short bio of the organizer(s) (about half-page in plain text).

3. [Highly encouraged] A description of any interactive activity or demo
planned within the workshop.

4. A draft schedule of the workshop, including the estimated duration
(1 to max 4 sessions) and type of sessions.

5. If this workshop (or a similar event coordinated by the same
organizers or
a subset of them) has taken place in previous years, either at GECCO
or at
other events, then include URLs to the event pages.

### Reviewing of Proposals ###

Workshop proposals will be reviewed by the Workshops Chairs and other
members of the GECCO 2019 organizing committee. Final decisions will be
made based on GECCO attendees' likely interest, the breadth and depth of
the topic(s), and the expertise and credentials of the instructor(s).

### Information and Proposal Submissions ###

Workshops proposals should be submitted by email to:

Carlos Cotta
Malaga University, Spain
Email: ccottap@lcc.uma.es

Richard Allmendinger
The University of Manchester, UK
Email: richard.allmendinger@manchester.ac.uk
Webpage: https://gecco-2019.sigevo.org/index.html/Call+for+Workshops

Call for Competitions
---------------------

The Competitions Chair of GECCO 2019 invites domain experts to submit
proposals for organizing a competition at GECCO 2019.Competitions
demonstrate how Evolutionary Computation and related techniques can be
utilized in challenging practical, real-world and gaming settings. They
also enable fair comparisons between algorithms and (for recurrent
competitions) provide the possibility to follow the development of
approaches over time.

### Submission process ###

Each competition proposal should include:

1. A half-page abstract (plain text) that includes: competition title,
the name and affiliation of the organizer(s), a description of the
competition. If the competition has been held before, then also provide
the web address of last edition and what you will change in case you
plan any changes.

2. In addition, you can voluntarily provide your thoughts on the
following items:
* sourcing of prizes
* judging process
* think about newcomers: can you provide tutorials (incl. videos)
to make the entrance easier?
* think about the eventual sharing of submitted algorithms and
their descriptions

There is the option of publishing descriptions of algorithms (2 pages
per algorithm) as part of a companion volume to the conference
proceedings in the ACM Digital library. The competition organizers
decide whether they want to offer this to the competition participants.
The deadline for these algorithm descriptions will be in April 2019, and
they will be reviewed by the respective competition organizers.

### Information and Submissions ###

Competition proposals should be submitted by e-mail to the GECCO 2019
Competitions Chair:

Markus Wagner
University of Adelaide, Australia
Email: markus.wagner (at) adelaide.edu.au
Webpage: https://gecco-2019.sigevo.org/index.html/Call+for+Competitions

### Review Process ###

Competition proposals will be reviewed by the Competitions Chair and
other members of the GECCO 2019 organizing committee. Final decisions
will be made based on GECCO attendees' and competitors' likely interest,
the breadth and depth of the topic(s), and the expertise and credentials
of the organizer(s). The outcome of the review process is scheduled to
be announced on December 5, 2018.

--
Andrew M. Sutton, University of Minnesota Duluth
Nadarajen Veerapen, University of Lille, France
Publicity Chairs

Manuel Lopez-Ibanez, University of Manchester, UK
Editor-in-Chief

Anne Auger, INRIA Saclay, France
General Chair

--
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
--------------------------------------------------------------------------
**********************************************************
*
* 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] Masters/PhD positions in theoretical quantum computation at the University of Paderborn, Germany

Dear colleagues,

The Department of Computer Science at the University of Paderborn, Germany, is seeking to recruit motivated Masters and Ph.D. students in theoretical quantum computation, with a focus on the areas of quantum algorithms, computational complexity theory, and/or cryptography.

Master's students will be recruited into the research group of Jun.-Prof. Dr. Sevag Gharibian. Ph.d. students will be recruited into the group of Prof. Dr. Johannes Blömer. Note that a background in German is *not* required for these positions - all of our graduate courses are taught in English, and Masters/PhD theses can be in English.

The University of Paderborn is currently undertaking an exciting cross-departmental initiative to establish a new quantum optics center, PhoQS, under the leadership of Prof. Dr. Christine Silberhorn, involving faculty across experimental and theoretical physics, computer science, and mathematics. The new students recruited by this call would be affiliated with PhoQS and have opportunities to collaborate and learn from all involved disciplines.

Links for further details:

Full advertisements for Masters/PhD positions:
http://groups.uni-paderborn.de/fg-qi/openings.html

Department of Computer Science:
https://cs.uni-paderborn.de/en/studies/degree-programs/computer-science/

Weekly seminar talk list:
https://math.uni-paderborn.de/ag/arbeitsgruppe-spektralanalysis/forschung/interdisziplinaeres-oberseminar-quantennetzwerke/

If you have any questions, please feel free to contact Sevag Gharibian at sevag.gharibian@upb.de .

Please also feel free to share this advertisement with any potentially interested candidates.

Thanks and best wishes,
Sev

--
Sevag Gharibian, Ph.D.
Junior Professor
Department of Computer Science
University of Paderborn, Germany, and
Virginia Commonwealth University (on leave), USA
http://groups.uni-paderborn.de/fg-qi [http://groups.uni-paderborn.de/fg-qi]
@sevag_gharibian
**********************************************************
*
* 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 winter school on Theoretical Foundations of Computer Science

The winter school on Theoretical Foundations of Computer Science (
https://cte.ibsu.edu.ge/wstfcs2019/) will be held in Tbilisi, Georgia,
February 4-9, 2019. The school will be organized by the International Black
Sea University with the support of Shota Rustaveli National Science
Foundation of Georgia (SRNSFG). The intended audience of the winter school
includes master and PhD students as well as young researchers from the
fields of computer science and mathematics. The lecturers and subjects of
the school are:

Volker Diekert (University of Stuttgart, Germany) - Algorithms and
Complexity

Santiago Escobar (Universitat Politècnica de València, Spain) - Program
Verification

Boris Konev (University of Liverpool, UK) - Logic for Computer Scientists

Temur Kutsia (RISC, Johannes Kepler University of Linz, Austria) -
Automated Reasoning

Luigi Liquori (INRIA Sophia Antipolis-Méditerranée, France) - Foundations
of Peer-to-peer Networks and Tools

Mircea Marin (West University of Timisoara, Romania) - Foundations of
Programming Languages

Monday, October 29, 2018

[DMANET] CFP IEEE/IFIP DISSECT 2019 (co-located with IEEE/IFIP IM 2019)

***** Submission deadline Dec. 15, 2018 *****

5^TH IEEE/IFIP Workshop on Security for Emerging Distributed Network
Technologies (DISSECT)

/Security for the Next Wave of Cyber and Social Networks/

Co-located with IEEE/IFIP IM 2019 <http://www.ieee-im.org/>
Washington D.C., USA

The computer networking landscape is subject to a multitude of changes that occur
very rapidly. First, paradigm shifts such as fog computing, mobile edge computing,
Named Data Networking (NDN) and emerging open networking technologies such as
Software-Defined Networking (SDN), Network Function Virtualization (NFV), and
Programmable Networks are reshaping the way networks are designed, deployed, and
managed. The benefits are manifold, including an unprecedented flexibility for
network operation and management, and a favorable environment for delivering
innovative network applications and services. However, those paradigm shifts bring
a multitude of security challenges that have to be addressed in order to provide
secure, trustworthy, and privacy-preserving data communication and network
services. Second, large scale and distributed deployment of mobile communications,
Internet-of-Things (IoT), Intelligent Transport Systems, smart grids or industrial
systems has become real but also emphasizes particular privacy and security issues
to be overcome, especially when interconnected with Internet.

Addressing all these challenges may require not only revisiting existing solutions
(e.g., for intrusion detection, privacy preserving, and resilience against
attacks), but also designing novel security and resilience schemes tailored to the
specific design of open networking technologies and infrastructures. New types of
attacks and threats also appear against usual services over Internet such as DNS
or routing. DISSECT 2019 follows the track of its four previous editions, and will
put focus on security issues and challenges arising with the emergence of novel
networking technologies and paradigms but also on new threats emerging against
former services and technologies, towards a secure cognitive management in a
cyber-world. The workshop will shed light on new challenges and present
state-of-the-art research on the various security aspects of next-generation
networking technologies and service management frameworks.

DISSECT will offer a venue for bringing together students, researchers, and
professionals from academia and industry sharing common interest on security
challenges related to the design and management of the distributed networks and
infrastructures. DISSECT is intended to (1) discussing these challenges as well as
future trends on security management, (2) presenting and discussing
work-in-progress security-related research on cutting-edge technologies, and (3)
strengthening collaboration and research ties among peers.

Topics of Interest

The research community will be invited to contribute with manuscripts describing
novel, work-in-progress research on the design of solutions to relevant security
issues on a wide variety of next generation networking technologies. The topics of
interest include, but are not limited to, the following

* Secure and resilient design and deployment of open networking technologies
* Privacy-preserving solutions
* Security models and threats
* Security and privacy properties and policies
* Verification and enforcement of security properties
* Trust and identity management
* NFV-based security functions and services
* Security of software-defined infrastructures, protocols and interfaces
* Threat modeling
* Security measurement and monitoring
* Industrial Control System security
* Security and availability management
* Security for Internet of Things
* Intrusion detection, resilience, and prevention
* Honeypots
* Network forensics and auditing
* Detection and resilience against large-scale distributed attacks
* Security of programmable components
* Security-related business and legal aspects
* Security challenges and trends for open networking technologies
* Secure programmable data plane
* Collaborative intrusion detection
* Blockchain and distributed consensus

*Important Dates*

*-Dec. 15, 2018 Paper submission Deadline*

-Jan. 5, 2019 Acceptance Notification

-Jan. 25, 2019 Camera-Ready Version Due

-Apr. 8, 2019 Workshop Day

More information can be found here: http://www.inf.ufrgs.br/dissect/2019
<http://www.inf.ufrgs.br/dissect/2019>

[DMANET] Final extension: EJOR Feature Cluster - New Trends in Applied Combinatorial Optimization -

Apologies for cross posting
——————————————————

***Due to many requests, the Paper Submission is extended to November 15, 2018. No further extension will be granted***

Call For Papers: EJOR Feature Cluster - New Trends in Applied Combinatorial Optimization

Although we encourage the submission of papers presented at the Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization, this Call for Papers is open to the entire community of academics and practitioners working in the field of applied combinatorial optimization.

Motivation

Applied Combinatorial Optimization has always received large interest in the scientific community. Thanks to the development of effective methods and innovative techniques, hard real-world problems can now be solved more efficiently, and new challenges arise, such as considering uncertain conditions, combining hard problems together, solving problems in real-time. The aim of the Feature Cluster "New trends in Applied Combinatorial Optimization" is to bridge the gap between science and real-world, by providing effective formulations and algorithms that allow solving practical problems. We solicit original and high-quality papers presenting innovative research in the field of Applied Combinatorial Optimization.

Contents

We will consider high-quality manuscripts addressing theoretical achievements, algorithm development and real-world implementations in the context of applied combinatorial optimization.

Topics of interest include (but are not limited to):

- Applications of Combinatorial Optimization
- Approximation algorithms
- Branch-and-cut-and-price algorithms
- Computational complexity
- Emerging applications of OR
- Energy planning
- Graph theory
- Healthcare applications
- Heuristics, metaheuristics and matheuristics
- Hybrid methods
- Integer programming
- Natural resource management
- Network design and analysis
- Production planning
- Telecommunications
- Transportation and logistics

Submission

Prospective authors are asked to follow the EJOR guide for authors and submit their papers from August 1, 2018 via the EES (http://ees.elsevier.com/ejor). Please select "Feat.Cluster App.Comb.Opt" as the "Article Type" during the submission process. Submitted papers will undergo a regular review process according to the high standard of EJOR.

Important Dates

Paper Submission Due: November 15, 2018 — Final Deadline —
Notification of Review Results: February 15, 2019
Revised Manuscript Due: April 30, 2019
Final Decision: July 31, 2019

Guest Editors

Valentina Cacchiani, University of Bologna
Enrico Malaguti, University of Bologna
Paolo Toth, University of Bologna
**********************************************************
*
* 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/
*
**********************************************************

TPNC 2018: call for participation

*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*

***************************************************************************
7th INTERNATIONAL CONFERENCE ON THE THEORY AND PRACTICE OF NATURAL COMPUTING

TPNC 2018

Dublin, Ireland

December 12-14, 2018

Co-organized by:

Natural Computing Research & Applications Group
School of Business
University College Dublin

Institute for Research Development, Training and Advice
Brussels / London

http://tpnc2018.irdta.eu/
***************************************************************************

PROGRAM

Wednesday, December 12

08:30 - 09:00   Registration

09:00 - 09:10   Opening

09:10 - 10:00   Hani Hagras. Explainable AI and Fuzzy Logic Systems - Invited lecture

10:00 - 10:15   Break

10:15 - 11:30

Roberto Barbuti, Anna Bernasconi, Roberta Gori and Paolo Milazzo. Computing Preimages and Ancestors in Reaction Systems

Mengzhe Chen and Nikolay M. Sirakov. Poisson Equation Solution and its Gradient Vector Field to Geometric Features Detection

Ziya Firat, Eliseo Ferrante, Nicolas Cambier and Elio Tuci. Self-organised Aggregation in Swarms of Robots with Informed Robots

11:30 - 11:45   Break

11:45 - 13:00

Fred Gruau and Luidnel Maignan. Cellular Computation, with Spatial Types on Planar Graph

Yuichi Kato, Tetsuro Saeki and Jiwei Fei. Application of STRIM to Datasets Generated by Partial Correspondence Hypothesis

Yuichi Komano and Takaaki Mizuki. Multi-party Computation Based on Physical Coins

13:00 - 14:15   Lunch

14:15 - 15:30

Shigeru Ninagawa. Patterns and their Interaction in Excitable Media on Face-centered Cubic Lattice

Yuya Sugie, Yuki Yoshida, Normann Mertig, Takashi Takemoto, Hiroshi Teramoto, Atsuyoshi Nakamura, Ichigaku Takigawa, Shin-Ichi Minato, Masanao Yamaoka and Tamiki Komatsuzaki. Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity

Miin-Shen Yang, Shou-Jen Chang-Chien and Yessica Nataliani. Gaussian-kernel c-means Clustering Algorithms

15:30 - 15:45   Break

15:45 - 17:00

Michael Hellwig and Hans-Georg Beyer. A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem

Karlo Knezevic, Stjepan Picek, Luca Mariot, Domagoj Jakobovic and Alberto Leporati. The Design of (Almost) Disjunct Matrices by Evolutionary Algorithms

Nam Le, Anthony Brabazon and Michael O'Neill. How the "Baldwin Effect" Can Guide Evolution in Dynamic Environments

---

Thursday, December 13

09:00 - 09:50   Juergen Branke. Design of Complex Systems via Simulation-based Optimisation - Invited lecture

09:50 - 10:05   Break

10:05 - 11:20

Katherine Malan. Landscape-aware Constraint Handling Applied to Differential Evolution

Abtin Nourmohammadzadeh and Sven Hartmann. Fuel Efficient Truck Platooning with Time Restrictions and Multiple Speeds Solved by a Particle Swarm Optimisation

Thambo Nyathi and Nelishia Pillay. Automated Design of Genetic Programming Classification Algorithms for Financial Forecasting Using Evolutionary Algorithms

11:20 - 11:35   Break and Group photo

11:35 - 12:50

Geoff Pond and Greg McQuat. Optimizing Fleet Staging of Air Ambulances in the Province of Ontario

Takfarinas Saber, David Fagan, David Lynch, Stepan Kucera, Holger Claussen and Michael O'Neill. A Hierarchical Approach to Grammar-guided Genetic Programming: The Case of Scheduling in Heterogeneous Networks

Maxim Sakharov and Anatoly Karpenko. Multi-memetic Mind Evolutionary Computation Algorithm Based on the Landscape Analysis

12:50 -   14:05   Lunch

14:05 - 15:20

Alexandru Amarioarei, Gefry Barad, Eugen Czeizler, Ana-Maria Dobre, Corina Itcus, Victor Mitrana, Andrei Paun, Mihaela Paun, Frankie Spencer, Romica Trandafir and Iris Tusa. DNA-guided Assembly of Nanocellulose Meshes

Alejandro Díaz-Caro and Marcos Villagra. Classically Time-controlled Quantum Automata

Tadao Maekawa, Manabu Honda, Osamu Ueno and Tsutomu Oohashi. Mortal Organisms Rescue Immortal Organisms from Evolutionary Inertness: Perspective of the Programmed Self-decomposition Model

15:20 - 15:35   Break

15:35 - 16:50

S. Sahand Mohammadi Ziabari and Jan Treur. Integrative Biological, Cognitive and Affective Modeling of a Drug-therapy for a Post-traumatic Stress Disorder

Roland Ritt and Paul O'Leary. Symbolic Analysis of Machine Behaviour and the Emergence of the Machine Language

Knud Thomsen. It Is Time to Dissolve Old Dichotomies in order to Grasp the Whole Picture of Cognition

17:00 - 19:00   Touristic visit

---

Friday, December 14

09:00 - 09:50   Georgios Ch. Sirakoulis. The Cellular Automata Computing Paradigm Enriched: From Simple Models to Real World Applications - Invited lecture

09:50 - 10:05   Break

10:05 - 11:20

Caroline Tichelaar and Jan Treur. Network-oriented Modeling of the Interaction of Adaptive Joint Decision Making, Bonding and Mirroring

Jan Treur. Network Reification as a Unified Approach to Represent Network Adaptation Principles within a Network

Jan Treur. Relating an Adaptive Network's Structure to its Emerging Behaviour for Hebbian Learning

11:20 - 11:35   Break

11:35 - 12:50

Toshinori Deguchi and Naohiro Ishii. On Capacity with Incremental Learning by Simplified Chaotic Neural Network

Ata Kabán and Yamanporn Thummanusarn. Tighter Guarantees for the Compressive Multi-layer Perceptron

Ryotaro Kamimura. Information-theoretic Self-compression of Multi-layered Neural Networks

12:50 -   14:05   Lunch

14:05 - 15:20

Tibor Kmet and Maria Kmetova. Radial Basis Function Networks Simulation of Age-structure Population

Esma Mansouri-Benssassi and Juan Ye. Bio-inspired Spiking Neural Networks for Facial Expression Recognition: Generalisation Investigation

Tamás Nyíri, Attila Ulbert and Attila Kiss. Novel Ensembling Methods for Dermatological Image Classification

15:20 - 15:35   Break

15:35 - 16:25

Feras Odeh and Adel Taweel. SemVec: Semantic Features Word Vectors Based Deep Learning for Improved Text Classification

Jiri Síma. Three Analog Neurons Are Turing Universal

16:25 - 16:35   Closing

Sunday, October 28, 2018

ICALP 2019 - First Call for Workshops

==================================
ICALP 2019 - Call for Workshops
==================================

ICALP 2019, 8-12 July, Patras, Greece
https://icalp2019.upatras.gr/

Workshops affiliated with ICALP 2019 will be held on Monday, 8 July (before the main
conference), see https://icalp2019.upatras.gr for more details.

We invite proposals of workshops related to any of the three tracks of ICALP, as well
as other areas of theoretical computer science. To submit a proposal, contact us at
zaro@ceid.upatras.gr and nikole@cti.gr not later than 15 December 2018. Because of
the limited capacity of the venue, we might not be able to accept all proposals.

In your mail, please provide the following information about your intended workshop:

- workshop's name and organizers

- whether you plan a half-day or full-day event and an estimated number of participants

- the format: Standard options are either an invitation only workshop or a workshop with
regular submissions. For submissions, we suggest a unified submission date a week after the
ICALP 2019 notification and notification date about a week before early registration ends.
Other formats are also possible, in that case please specify your proposal.

We expect that the workshops will be financially independent, we also expect that the
organizers will take care of the proceedings / abstract books themselves. In particular,
we cannot cover any expenses of the workshop invited speakers, if there are any. Any such
expenses would need to be covered from independent sources.

There will be a workshop fee (on top of the ICALP fee), to cover lunch, coffee breaks and
the usual local support.

===============================
ICALP 2019 Organizing Committee
===============================

Efstratios Gallopoulos
John Garofalakis
Christos Kaklamanis
Sotiris Nikoletseas (Conference Co-Chair)
Christos Zaroliagis (Conference Co-Chair)

[DMANET] ICALP 2019 - First Call for Workshops

==================================
ICALP 2019 - Call for Workshops
==================================

ICALP 2019, 8-12 July, Patras, Greece
https://icalp2019.upatras.gr/

Workshops affiliated with ICALP 2019 will be held on Monday, 8 July (before the main
conference), see https://icalp2019.upatras.gr for more details.

We invite proposals of workshops related to any of the three tracks of ICALP, as well
as other areas of theoretical computer science. To submit a proposal, contact us at
zaro@ceid.upatras.gr and nikole@cti.gr not later than 15 December 2018. Because of
the limited capacity of the venue, we might not be able to accept all proposals.

In your mail, please provide the following information about your intended workshop:

- workshop's name and organizers

- whether you plan a half-day or full-day event and an estimated number of participants

- the format: Standard options are either an invitation only workshop or a workshop with
regular submissions. For submissions, we suggest a unified submission date a week after the
ICALP 2019 notification and notification date about a week before early registration ends.
Other formats are also possible, in that case please specify your proposal.

We expect that the workshops will be financially independent, we also expect that the
organizers will take care of the proceedings / abstract books themselves. In particular,
we cannot cover any expenses of the workshop invited speakers, if there are any. Any such
expenses would need to be covered from independent sources.

There will be a workshop fee (on top of the ICALP fee), to cover lunch, coffee breaks and
the usual local support.

===============================
ICALP 2019 Organizing Committee
===============================

Efstratios Gallopoulos
John Garofalakis
Christos Kaklamanis
Sotiris Nikoletseas (Conference Co-Chair)
Christos Zaroliagis (Conference Co-Chair)

ICALP 2019 - First Call for Papers

==================================
ICALP 2019 - First Call for Papers
==================================

https://icalp2019.upatras.gr/

The 46th International Colloquium on Automata, Languages, and Programming (ICALP)
will take place in Patras, Greece, on 8-12 July 2019.

ICALP is the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series
of workshops, which will take place on 8 July 2019.

=============== Important dates =======================

Submission deadline: Monday 18 February 2019, 23:59 AoE
Notification: Friday 19 April 2019
Early registration deadline: Thursday 30 May 2019

Deadlines are firm; late submissions will not be considered.

===========================
Submissions and Proceedings
===========================

ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is a series of high-quality conference
proceedings across all fields in informatics established in cooperation with
Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of Open Access, i.e., they are available online and
free of charge.

Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12 pages,
excluding references presenting original research on the theory of computer
science. All submissions must be formatted in the LIPIcs style
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
and submitted via Easychair to the appropriate track of the conference. The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly
from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets
(either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission
must be included in the 12-page submission or in a clearly labelled appendix, to
be consulted at the discretion of program committee members. Authors are strongly encouraged
to also make full versions of their submissions freely accessible in an on-line
repository such as ArXiv, HAL, ECCC.

Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best student paper
awards for each track of the conference. In order to be eligible for a best student
paper award, a paper should be authored only by students and should be marked as
such upon submission.

Topics
======
Papers presenting original research on all aspects of theoretical computer science
are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, Complexity and Games
-----------------------------------------
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Foundations of Algorithmic Game Theory
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Quantum Computing
* Randomness in Computation

Track B: Automata, Logic, Semantics, and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Principles and Semantics of Programming Languages
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi

Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
* Algorithmic Aspects of Networks and Networking
* Algorithmic Game Theory
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Foundations of Complex Networks
* Message-Passing Models of Distributed Computing
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Focus of track C:
The aim for Track C is to be the leading venue for theory papers motivated
by networking applications, and/or proposing theoretical results relevant
to networking, certified analytically.

=====================================
ICALP 2019 Programme Committee Chairs
=====================================

Track A: Track A: Algorithms, Complexity and Games
---------------------------------------------------
* Stefano Leonardi, chair (Sapienza University of Rome, Italy)

Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------------------------------------
* Christel Baier, chair (TU Dresden, Germany)

Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
* Paola Flocchini, chair (University of Ottawa, Canada)

============================
ICALP 2019 Proceedings Chair
============================
Ioannis Chatzigiannakis (Sapienza University of Rome, Italy)

===============================
ICALP 2019 Organizing Committee
===============================

Efstratios Gallopoulos
John Garofalakis
Christos Kaklamanis
Sotiris Nikoletseas (Conference Co-Chair)
Christos Zaroliagis (Conference Co-Chair)

[DMANET] ICALP 2019 - First Call for Papers

==================================
ICALP 2019 - First Call for Papers
==================================

https://icalp2019.upatras.gr/

The 46th International Colloquium on Automata, Languages, and Programming (ICALP)
will take place in Patras, Greece, on 8-12 July 2019.

ICALP is the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series
of workshops, which will take place on 8 July 2019.

=============== Important dates =======================

Submission deadline: Monday 18 February 2019, 23:59 AoE
Notification: Friday 19 April 2019
Early registration deadline: Thursday 30 May 2019

Deadlines are firm; late submissions will not be considered.

===========================
Submissions and Proceedings
===========================

ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is a series of high-quality conference
proceedings across all fields in informatics established in cooperation with
Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of Open Access, i.e., they are available online and
free of charge.

Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12 pages,
excluding references presenting original research on the theory of computer
science. All submissions must be formatted in the LIPIcs style
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
and submitted via Easychair to the appropriate track of the conference. The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly
from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets
(either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission
must be included in the 12-page submission or in a clearly labelled appendix, to
be consulted at the discretion of program committee members. Authors are strongly encouraged
to also make full versions of their submissions freely accessible in an on-line
repository such as ArXiv, HAL, ECCC.

Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best student paper
awards for each track of the conference. In order to be eligible for a best student
paper award, a paper should be authored only by students and should be marked as
such upon submission.

Topics
======
Papers presenting original research on all aspects of theoretical computer science
are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, Complexity and Games
-----------------------------------------
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Foundations of Algorithmic Game Theory
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Quantum Computing
* Randomness in Computation

Track B: Automata, Logic, Semantics, and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Principles and Semantics of Programming Languages
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi

Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
* Algorithmic Aspects of Networks and Networking
* Algorithmic Game Theory
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Foundations of Complex Networks
* Message-Passing Models of Distributed Computing
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Focus of track C:
The aim for Track C is to be the leading venue for theory papers motivated
by networking applications, and/or proposing theoretical results relevant
to networking, certified analytically.

=====================================
ICALP 2019 Programme Committee Chairs
=====================================

Track A: Track A: Algorithms, Complexity and Games
---------------------------------------------------
* Stefano Leonardi, chair (Sapienza University of Rome, Italy)

Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------------------------------------
* Christel Baier, chair (TU Dresden, Germany)

Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
* Paola Flocchini, chair (University of Ottawa, Canada)

============================
ICALP 2019 Proceedings Chair
============================
Ioannis Chatzigiannakis (Sapienza University of Rome, Italy)

===============================
ICALP 2019 Organizing Committee
===============================

Efstratios Gallopoulos
John Garofalakis
Christos Kaklamanis
Sotiris Nikoletseas (Conference Co-Chair)
Christos Zaroliagis (Conference Co-Chair)

[DMANET] Special Issue "The Second International Workshop on Parallel and Distributed Data Mining"

Special Issue "The Second International Workshop on Parallel and Distributed Data Mining"

A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: 21 December 2018

http://www.mdpi.com/journal/algorithms/special_issues/Parallel_Distributed_Data_Mining

Special Issue Information

Dear Colleagues,

This Special Issue is devoted to the increasing interest in the design and implementation of parallel and distributed data mining algorithms. The Workshop on Parallel and Distributed Data Mining (WPDM 2018) is an international forum that brings together researchers and practitioners, working on different high-performance aspects of data mining algorithms, enabling novel applications. Indeed, datasets grow so rapidly that, every day, exabytes of data are being generated, and, in order to extract and infer useful knowledge, parallel processing techniques are required to cope with this huge volume of data: Traditional sequential software is not viable to cope with them. When the data are generated in different places (such as wireless sensor networks and/or Internet of things devices), they may be geographically spread out, and the data cannot be sent to a centralized site, thus, the need for distributed processing algorithms arises. Topics relevant to this Special Issue cover the scope of the WPDM 2018 Workshop (http://sara.unisalento.it/~cafaro/WPDM2018/):

- Parallel data mining algorithms using MPI and/or OpenMP
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Parallel data mining applications exploiting FPGA
- Distributed data mining algorithms
- 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
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Extended versions of papers presented at WPDM 2018 are sought, but this call for papers is fully open to all those who wish to contribute by submitting a relevant research manuscript.

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 850 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Special Issue Editors

Guest Editor
Assoc. Prof. Massimo Cafaro

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, Italy

Guest Editor
Dr. Italo Epicoco

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, Italy

Guest Editor
Dr. Marco Pulimeno

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy

Guest Editor
Prof. Giovanni Aloisio

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, 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

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

[DMANET] 8th edition of the Winter School on Network Optimization (last announcement)

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

Markus Leitner (Univ. of Vienna) - Layered graph approaches for combinatorial optimization problems;

William Cook (Univ. of Waterloo) - The Traveling Salesman Problem and Computational Discrete Optimization;

Giovanni Rinaldi (IASI) - Maximum weight cuts in graphs and extensions

Francisco Saldanha da Gama (Univ. de Lisboa) - Logistics network design: capturing uncertainty and risk;

Tolga Bektas (Univ. of Southampton) - Compact formulations, projections and some polyhedral results for the vehicle routing problem.

The school is part of the activities of the of the ENOG (European Network Optimization Group) and of
CMAFCIO (Centro de Matemática, Aplicações Fundamentais e Investigação Operacional) University of Lisbon.

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

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

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

[DMANET] Master and PhD scholarships in Berlin

The Berlin Mathematical School is a joint endeavor of the Berlin
research universities which offers a combined Master/PhD-program taught
in English.

There are scholarships available to study for a Master or a PhD, in a
broad spectrum of mathematics, including Discrete Mathematics.

The new application cycle is open, the deadline is December 1st, 2018.

For the details about how to apply, visit:
http://www.math-berlin.de/application

[DMANET] Postdoctoral positions at IRIF (previously, LIAFA), Paris, France

The Algorithms and Complexity group of IRIF - previously LIAFA - (CNRS and University Paris Diderot), Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, distributed algorithms, biological
algorithms, communication complexity, cryptography (including post-quantum cryptography), computational game theory, quantum computing, quantum algorithms (in particular machine learning and optimization), quantum communication, computational applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (French National Center for Scientific Research) and University Paris Diderot. For more information about IRIF, please see http://www.irif.univ-paris-diderot.fr , and for more information about the Algorithms and Complexity group please see https://www.irif.fr/en/equipes/algocomp/index . Further information may be obtained from any of the permanent members of the group.

The starting date of the position(s) will usually be in September 2019 but can be negotiated.

The position(s) will be financed either by the group's own resources, or via joint applications of the candidate and the group to external funding sources.

Applications should consist of a CV including list of publications, a summary of research, and names and emails of at least three references. For further technical instructions on how to submit applications, please visit the "openings" sections at https://www.irif.fr/en/equipes/algocomp/index .

Applications should be received by November 5, 2018.

Saturday, October 27, 2018

[DMANET] ETAPS 2019 2nd joint call for papers

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

JOINT CALL FOR PAPERS

22nd European Joint Conferences on Theory And Practice of Software
ETAPS 2019

Prague, Czech Republic, 6-11 April 2019

http://www.etaps.org/2019

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

-- ABOUT ETAPS --

ETAPS is the primary European forum for academic and industrial
researchers working on topics relating to software science. ETAPS,
established in 1998, is a confederation of five main annual
conferences, accompanied by satellite workshops. ETAPS 2019 is the
twenty-second event in the series.

-- MAIN CONFERENCES (8-11 April) --

* ESOP: European Symposium on Programming
(PC chair Luís Caires, Universidade Nova de Lisboa, Portugal)
* FASE: Fundamental Approaches to Software Engineering
(PC chairs Reiner Hähnle, Technische Univ Darmstadt, Germany,
and Wil van der Aalst, RWTH Aachen University, Germany)
* FoSSaCS: Foundations of Software Science
and Computation Structures
(PC chairs Mikolaj Bojanczyk, University of Warsaw, Poland,
and Alex Simpson, University of Ljubljana, Slovenia)
* POST: Principles of Security and Trust
(PC chairs Flemming Nielson, Danmarks Tekniske Univ, Denmark,
and David Sands, Chalmers Tekniska Högskola, Sweden)
* TACAS: Tools and Algorithms for
the Construction and Analysis of Systems
(PC chairs Tomás Vojnar, Brno Univ of Technology, Czech Rep,
and Lijun Zhang, Chinese Academy of Sciences, China)

TACAS '19 hosts the 8th Competition on Software Verification
(SV-COMP).

-- INVITED SPEAKERS --

* Unifying speakers:
Marscha Chechik (University of Toronto, Canada)
Kathleen Fisher (Tufts University, USA)
* FoSSaCS invited speaker:
Thomas Colcombet (IRIF, France)
* TACAS invited speaker:
Cormac Flanagan (University of California at Santa Cruz, USA)

-- IMPORTANT DATES

* Abstracts due: 9 November 2018 23:59 AoE
* Papers due: 16 November 2018 23:59 AoE
* Rebuttal (ESOP, FoSSaCS, POST):
11 January 00:01 AoE - 14 January 2019 23:59 AoE
* Notification: 25 January 2019
* Camera-ready versions due: 15 February 2019

-- SUBMISSION INSTRUCTIONS --

ETAPS conferences solicit contributions of two types: research papers
and tool demonstration papers. ESOP and FoSSaCS accept only research
papers. FASE, POST and TACAS have multiple types of research papers,
see below.

All accepted papers will appear in the proceedings and have
presentations during the conference.

A condition of submission is that, if the submission is accepted, one
of the authors attends the conference to give the presentation.

Submitted papers must be in English presenting original research. They
must be unpublished and not submitted for publication elsewhere (this
does not apply to abstracts). In particular, simultaneous submission
of the same contribution to multiple ETAPS conferences is
forbidden.

Submissions must follow the formatting guidelines of Springer's
Lecture Notes in Computer Science and be submitted electronically in
pdf through the EasyChair author interface of the respective
conference.

Submissions not adhering to the specified format and length may be
rejected immediately.

FASE and POST use double-blind review.

Like ETAPS 2018, the proceedings of ETAPS 2019 will be published in
*gold open access*. The copyright of the papers will remain with the
authors. The proceedings will be published in the Advanced Research in
Computing and Software Science (ARCoSS) subline of Springer's Lecture
Notes in Computer Science series.

The publisher's charges for gold open access will be paid by the
conference (funded with the participation fees of all
participants). There will be no added cost for authors specifically.

- Research papers

FASE, FoSSaCS and TACAS have a page limit of 15 pp (excluding
bibliography) for research papers, whereas POST allows at most 20 pp
(excluding bibliography) and ESOP 25 pp (excluding bibliography).

Additional material intended for the referees but not for publication
in the final version - for example, details of proofs - may be placed
in a clearly marked appendix that is not included in the page
limit. ETAPS referees are at liberty to ignore appendices and papers
must be understandable without them.

In addition to regular research papers, TACAS solicits also *case
study papers* (with the same page limit as for regular research
papers). POST solicits also *systematization of knowledge papers*
(with the same page limit as for regular research papers) and
*position papers* (max 10 pp, excluding bibliography).

Both TACAS and FASE solicit also *regular tool papers* (at most 15 pp,
excluding bibliography).

- Tool demonstration papers

Tool demo papers have a page limit of 6 pp. The individual conferences
FASE, POST, TACAS have additional specific requirements on tool demo
papers.

ESOP and FoSSaCS do not consider tool demonstration papers.

-- SATELLITE EVENTS (6-7 April) --

A number of satellite workshops will take place before the main
conferences: BEHAPI, CREST, DICE-FOPARA, GaLoP, HCVS, HSB, InterAVT,
LiVe, MeTRiD, PERR, PLACES, QAPL, SPIoT, SynCoP, VerifyThis.

-- HOST INSTITUTION --

ETAPS 2019 is hosted by the School of Computer Science of the Charles
University in Prague, the beautiful capital of the Czech Republic.

-- ORGANIZERS

Jan Kofron and Jan Vitek (general chairs), Barbora Buhnova, Milan
Ceska, Ryan Culpepper, Vojtech Horky, Paley Li, Petr Maj, Artem
Pelenitsyn, David Safranek

-- FURTHER INFORMATION --

Please do not hesitate to contact the organizers at
jan.kofron@d3s.mff.cuni.cz and j.vitek@neu.edu.

[DMANET] CIAC 2019 submission deadline

The submission deadline for CIAC 2019 is October 31 AoE.
New versions of already submitted papers can be uploaded until November 5 AoE.
Submission page: https://easychair.org/conferences/?conf=ciac2019

Conference web page: http://easyconferences.eu/ciac2019/

Looking forward to your submissions!
Pinar Heggernes, PC 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/
*
**********************************************************

[DMANET] EvoApplications'19: Deadline extension until the 12th of November

The EvoApplications 2019 Conference extends its deadline until the
12th of November. The submission site will stay open until Monday,
after which no further submissions will be accepted. Authors who
have already submitted a paper can update their work by the new deadline.

—————————————————————————————————————————————————————————————————-

The 22nd International Conference on the Applications of
Evolutionary Computation, April 24–26 2019, Leipzig, Germany.

http://www.evostar.org/2019/

EvoApplications invites high quality contributions for its 22nd edition,
which will be held as part of the EvoStar 2019 event in Leipzig, Germany,
April 2019 and co-located within EvoStar with three related conferences:
EuroGP, EvoCOP and EvoMUSART.

EvoApplications will focus on following thematic areas:

- Engineering + Real world applications, Chairs: Emma Hart, Sara Silva
- Games, Chairs: Julian Togelius, Alberto Tonda
- Image & Signal Processing, Vision & Pattern recognition, Chairs: Stephen Smith, Monica Mordonini
- Life sciences, Chairs: James Foster, Jaume Bacardit
- Networks, Chairs: JJ Merelo, Juan Luis (Juanlu) Jiménez-Laredo
- Neuroevolution, Chairs: Julian Miller, Sebastian Risi
- Numerical optimization, Chairs: Günter Rudolph, Oliver Kramer
- Robotics, Chairs: Gusz Eiben, Kyrre Glette
- General, Chairs: Carlos Cotta, Paco Fernandez, Giovanni Iacca, Trung Thanh Nguyen

Please do not be deterred if your work does not fit into any of these,
as new areas will arise depending on submissions. Just ensure you select
the appropriate keywords to classify your paper.

SUBMISSION, PRESENTATION, AND PUBLICATION DETAILS

This year EvoApplications is accepting two kinds of submission: full papers
and short papers. Full papers require novel and complete research work and
have a limit of 16 pages. Short papers should present complete research and
interesting preliminary results and have a limit of 8 pages. Both types of
submission will undergo the same double-blind review process and all accepted
papers will be included in the LNCS proceedings. All authors of accepted
papers will be given the opportunity to further disseminate their work in
poster sessions.

- Page limit: 8 pages (short papers) or 16 pages (full papers).
- Submission format: Springer LNCS
– Review process: double-blind. Please ensure to anonymize your submission.
- Presentation format
-- Long talks: 20 minutes + 5 min questions. Authors can optionally bring a
poster to present at the poster session.
-- Short talks: 10 minutes, no questions. Authors MUST also bring a poster to
present at the poster session.
-- Short papers are only eligible for short talks. Authors of long papers
will be notified in advance of the type of presentation (short/long).
- Submission link: https://myreview.saclay.inria.fr/evoapps19/

IMPORTANT DATES

- Submission Deadline: November 12, 2018
- Notification: January 12, 2019
- Camera-ready: February 11, 2019
- EvoStar dates: 24-26 April 2019

LOCATION

The city of Leipzig is located in the north-east of Germany, about 160km
south of Berlin. Situated at the crossing of two major medieval trading
routes, Via Imperii connecting Italy with the North and Via Regia connecting
East and West, it was once considered as one of the major European centers of
trade, culture and learning. Today Leipzig is an easily likeable, green and
young city with a rich cultural diversity. Particularly in the city center
one can find many beautiful historical buildings from different architectural
periods, museums and parks. Also, lovers of classical music appreciate
Leipzig due to the impact of Bach and Mendelsohn-Bartholdy, who lived in the
city for important parts of their lives.

ORGANIZATION

EvoApplications Coordinator
Paul Kaufmann, Mainz University, Germany

EvoApplications Publication Chair
Pedro Castillo, University of Granada, Spain

Evo* Local Chair:
Hendrik Richter, Leipzig University of Applied Sciences, Germany

Friday, October 26, 2018

[DMANET] CfP: EvoCOP 2019, held as part of EvoStar (EXTENDED submission deadline: November 12, 2018)

NEWS: Due to a large number of requests for late submissions, the EvoStar
submission sites will stay open until Monday, November 12, after which no
further submissions will be accepted. Authors who have already submitted, can
update their work until this time.

************************************************************************
EvoCOP 2019 - The 19th European Conference on
Evolutionary Computation in Combinatorial Optimisation
http://www.evostar.org/2019/cfp_evocop.php

April 24 - April 26, 2019
Leipzig, Germany

held as part of EvoStar (http://www.evostar.org)
************************************************************************

The 19th 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 2019 conference will be held in the city of Leipzing, Germany,
together with EuroGP (the 22nd European Conference on Genetic Programming),
EvoMUSART (the 8th European conference on evolutionary and biologically inspired
music, sound, art and design) and EvoApplications (the 22nd European Conference
on the Applications of Evolutionary Computation), 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

Notice that, by tradition, continuous/numerical optimisation is *not* part of
the topics of interest of EvoCOP. Interested authors might consider submitting
to other EvoStar conferences such as EvoApplications.

**** Publication Details ****

EvoCOP 2019 will accept three 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, 10197 and 10782 for the previous proceedings).

The best regular paper presented at EvoCOP 2019 will be distinguished with a
*Best Paper Award*. Authors of the best regular papers will be invited for fast
track publication in the *Evolutionary Computation Journal*. The invited
submissions must significantly extend the conference paper and will undergo
peer review.

* Reproducibility studies are concise and rigorous experimental studies that
replicate published experiments, and that substantially shift the confidence in
the main results of the original study. We strongly encourage the authors to
discuss the reasons for the new findings, such as, e.g., input data not
considered in the original work or different implementation details.
A reproducibility study should follow the usual reproducibility standards, that
is, it should provide complete details about the implementation, compiler
options, input data description, algorithmic parameters, operating system and
hardware specification. Moreover, the code should be available in a public
repository immediately after the submission to EvoCOP and should remain
available after publication in the proceedings. Statistical analysis, if
applicable, should provide details about the statistical assumptions and
statistical testing procedures. Although it is expected that textual
similarity between the reproducibility study and the original work may arise,
the usual plagiarism standards will be taken into account. Reproducibility
studies will take the form of short papers presented orally at the conference
and published in the Springer LNCS proceedings.

* Late-breaking abstracts (LBAs) summarise 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 short
talks during the conference.

**** Submission Details ****

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 (Reproducibility studies): 8 pages
Page limit (LBAs): 1-2 pages

Regular papers and reproducibility studies shall be submitted via
https://myreview.saclay.inria.fr/evocop19/ (Authors->Submit new paper)

LBAs shall be submitted by e-mail to: evocop@inria.fr

**** Important Dates ****

EXTENDED Submission deadline (Regular papers, Reproducibility studies): November 12, 2018
Author notification (Regular papers, Reproducibility studies): January 14, 2019
Submission deadline (LBAs): January 28, 2019
Camera-ready deadline: February 11, 2019
EvoStar: April 24-26, 2019

**** EvoCOP Programme Chairs ****

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

Luís Paquete
University of Coimbra, Portugal
paquete@dei.uc.pt

--
Luís Paquete | paquete@dei.uc.pt
http://www.uc.pt/go/paquete
Dept. of Informatics Engineering
University of Coimbra, Portugal

Theory Announcements

Wednesday, October 31, 2018

[DMANET] Developing Countries - Resources online --- IFORS

[DMANET] IBS Discrete Mathematics Group (DIMAG) Postdoctoral Research Fellowship

[DMANET] Full professor Discrete Mathematics

[DMANET] UD position Mathematics for Business @ VU

[DMANET] EJTL Special Issue on "Combining optimization and machine learning: applications in vehicle routing, network design and crew scheduling"

Tuesday, October 30, 2018

[DMANET] Tenured / Tenure-Track Faculty Positions at UCSB

[DMANET] [GECCO CFP] (Deadline Nov 7) Call for Proposals for Tutorials, Workshops and Competitions - Genetic and Evolutionary Computation Conference 2019

[DMANET] Masters/PhD positions in theoretical quantum computation at the University of Paderborn, Germany

[DMANET] The winter school on Theoretical Foundations of Computer Science

Monday, October 29, 2018

[DMANET] CFP IEEE/IFIP DISSECT 2019 (co-located with IEEE/IFIP IM 2019)

[DMANET] Final extension: EJOR Feature Cluster - New Trends in Applied Combinatorial Optimization -

TPNC 2018: call for participation

Sunday, October 28, 2018

ICALP 2019 - First Call for Workshops

[DMANET] ICALP 2019 - First Call for Workshops

ICALP 2019 - First Call for Papers

[DMANET] ICALP 2019 - First Call for Papers

[DMANET] Special Issue "The Second International Workshop on Parallel and Distributed Data Mining"

[DMANET] 8th edition of the Winter School on Network Optimization (last announcement)

[DMANET] Master and PhD scholarships in Berlin

[DMANET] Postdoctoral positions at IRIF (previously, LIAFA), Paris, France

Saturday, October 27, 2018

[DMANET] ETAPS 2019 2nd joint call for papers

[DMANET] CIAC 2019 submission deadline

[DMANET] EvoApplications'19: Deadline extension until the 12th of November

Friday, October 26, 2018

[DMANET] CfP: EvoCOP 2019, held as part of EvoStar (EXTENDED submission deadline: November 12, 2018)

Mailing Lists

Search This Blog

Blog Archive

Wednesday, October 31, 2018

Tuesday, October 30, 2018

Monday, October 29, 2018

Sunday, October 28, 2018

Saturday, October 27, 2018

Friday, October 26, 2018

Mailing Lists

Subscribe To

Search This Blog

Blog Archive