Thursday, January 31, 2019

[DMANET] Assistant Professor of Data Analytics - Dept. Supply Chain Analytics - VU Amsterdam

Are you driven for research and teaching in logistics and operations management in a young, dynamic group? Then Vrije Universiteit Amsterdam would like to get to know you.

Location: AMSTERDAM

Job description
We seek a new colleague who can contribute to building and extending the department's reputation for excellence in research and teaching. Our research aims at having an impact, evidenced by publications in top international academic journals. Teaching focuses on logistics and operations management courses and student supervision. Applicants receive a well-structured tenure track.

Your duties

* doing innovative research and publish this research at the highest level in the international top journals;
* creating a stimulating learning environment for students at all levels (BSc, MSc, Ph.D.);
* being active in acquiring additional research funds, both individually and as a team effort with your colleagues.

Requirements
We are looking for candidates with strong data analytics skills (e.g. data mining, machine learning, data science, predictive analytics,...), and an interest in applying these skills to real-life problems in logistics and operations management. You have:

* A (nearly) completed Ph.D. thesis in Computer Science, Statistics, Mathematics, Operations Research, Operations Management, Management Science or related fields;
* A strong interest in analyzing and modeling real-life problems in logistics and operations using state-of-the-art quantitative methods and empirical data witnessed by international scientific publications;
* Good teaching and communication skills to interact successfully with students, industry, and academic partners.

What are we offering?
A challenging position in an international and ambitious research group. The initial employment contract for an Assistant professor will be for a period of 6 years, with the possibility of Tenure. The tenure track position involves research (40%) and teaching (60%). At the end of the second year, a performance evaluation will take place. The Tenure Track Committee will review your file including the evaluation and advice on the continuation of your tenure track. In the fifth year, the Tenure Track Committee will review your file in order to decide upon the tenured assignment, based on the assessment criteria of the Tenure Track system at SBE. In the case of excellent performance, earlier tenure decisions are possible.

Additionally, Vrije Universiteit Amsterdam offers excellent fringe benefits and various schemes and regulations to promote a good work/life balance, such as:

* a maximum of 41 days of annual leave based on full-time employment
* 8% holiday allowance and 8.3% end-of-year bonus
* considerable employer's contribution to the ABP pension scheme
* contribution to commuting expenses
* an optional model for designing a personalized benefits package
* a relocation allowance
* you may also be eligible for a favorable tax ruling for high-skilled expats (the so-called 30% ruling), which means that 30% of the salary is free of taxes, resulting in a higher net salary.
About Vrije Universiteit Amsterdam
The ambition of Vrije Universiteit Amsterdam is clear: to contribute to a better world through outstanding education and ground-breaking research. And to be a university where personal education and societal involvement play a leading role. Where people from different disciplines and backgrounds work together on innovations and on generating new knowledge. Our teaching and research embrace the whole spectrum of science - from the humanities, the social sciences and the pure sciences through to the life sciences and the medical sciences.

Vrije Universiteit Amsterdam is home to more than 23,000 students. We employ more than 4,500 individuals. The VU campus is easily accessible, located in the heart of Amsterdam's Zuidas district, a truly inspiring environment for teaching and research.

School of Business and Economics
The School of Business and Economics (SBE) provides high-quality education and excellent research in business administration and economics with a focus on contributing to the social, economic and ecological challenges of our time. Whether it is the use of robots in society or big data, labor market participation or flexibility in the labor market, traffic jams or the housing market, flash crashes in the stock market or choice behavior in gambling, leadership or change management: we believe in goal-oriented scientific research and understand that progress in academics, the business community and society is achieved through cooperation, openness and social responsibility.

At SBE, all of our highly-motivated colleagues work together closely in a stimulating, dynamic and international environment to achieve our collective goal of encouraging society to make informed choices. Approximately 4,200 Bachelor's and Master's students and 1,700 executive students are enrolled at the School, and employs roughly 500 people.

The Department of Supply Chain Analytics is driven for science with purpose, focusing on solving real-life problems in distribution logistics, including performance analysis, distribution and transport network optimization, and supply chain coordination. The group operates in a strong international research and industry network, participates in various national and international research projects and regularly organizes international conferences and workshops. Group members collaborate with leading researchers at several international universities and research output is published in leading academic journals in the field. Teaching wise, our mission is to empower students with the methodological skills, managerial insights, and enduring curiosity to contribute to solving today's challenges in the industry

Diversity
Diversity is one of our university's core values. We are an inclusive community, and we believe that diversity and international activities enhance the quality of education and research. We are always looking for people who can enhance diversity on our campus thanks to their background and experience

Application
Are you interested in this position? Send your letter with your motivation, CV, list of publications, a research and teaching statement, two recommendation letters by March 15th, 2019, to Ms. M. Maletic, Managing Director of the School of Business and Economics, by e-mail: vacature.sbe@vu.nl<mailto:vacature.sbe@vu.nl>. Please mention position in the e-mail header. We start inviting candidates from the application deadline onwards, and the search will continue until the position has been filled with a high-quality candidate.

Vacancy questions
If you have any questions regarding this vacancy, you may contact:

Prof. Dr. W.E.H. Dullaert, e-mail: wout.dullaert@vu.nl<mailto:wout.dullaert@vu.nl>, phone +31-20-5983627
Prof. Dr. Ir. S. de Leeuw, e-mail: sander.de.leeuw@vu.nl<mailto:sander.de.leeuw@vu.nl>, phone: +31-20-5986067

Relocation support
If you have any questions regarding moving to Amsterdam and working at VU Amsterdam, you may contact:
Name: Wytske Siegersma
Position: Relocation Advisor
E-mail: relocation@vu.nl<mailto:relocation@vu.nl>
Telephone: +31 (20) 59 85037

No agencies

https://werkenbij.vu.nl/ad/assistant-professor-of-data-analytics/ptjbkg


**********************************************************
*
* 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] Winter Combinatorics Meeting, 20th February, Open University, UK

The 18th Winter Combinatorics Meeting will take place on Wednesday
20th February 2019.
Location: CMR room 15, The Open University, Milton Keynes, UK

All are welcome -- this event is free, but to assist with catering we
ask those wishing to attend to sign-up by the morning of Monday 11th
February by completing this short form:
https://docs.google.com/forms/d/e/1FAIpQLSfoZDWNQf4mYlIf8ukCqLMGoagVsGS1JpPxBxUH_b_8dViTOQ/viewform

Full details (including travel advice):
http://www.mathematics.open.ac.uk/seminars-and-events/winter-combinatorics-meeting

This year, we are celebrating early-career researchers, with 7 of the
8 talks being given by PhD students or postdoctoral researchers. The
provisional schedule is as follows:

10:00 - 10:30 Natalie Behague, Queen Mary, University of London:
Semi-perfect 1-factorizations of the hypercube
10:30 - 11:00 Alberto Espuny Díaz, University of Birmingham: Edge
correlations in random regular hypergraphs

11:00 - 11:30 Tea/Coffee

11:30 - 12:30 Keynote speaker: Mathilde Bouvel (Zürich)

12:30 - 14:00 Lunch

14:00 - 14:30 Fiona Skerman, Uppsala Universitet: Random tree
recursions: which fixed points correspond to tangible sets of trees?
14:30 - 15:00 John Haslegrave, University of Warwick: Spanning
surfaces in 3-uniform hypergraphs
15:00 - 15:30 Matthew Coulson, University of Birmingham: A rainbow
Dirac's theorem

15:30 - 16:00 Tea/Coffee

15:30 - 16:30 Rachel Kirsch, London School of Economics: Many cliques
with few edges
16:30 - 17:00 David Marchant, The Open University: The growth of the
Möbius function on the permutation poset

**********************************************************
*
* 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] Lecturer in Computer Science at Royal Holloway, University of London (near deadline)

Applications are invited for the post of Lecturer in Computer Science in
the Department of Computer Science, Royal Holloway, University of London.

We are recruiting for an academic member of staff who can strengthen our
research, which falls broadly within Artificial Intelligence, Algorithms
and Complexity, Distributed and Global Computing, and Software Language
Engineering; we also have strong connections with the Information Security
Group.

The successful candidate will help us seek and seize opportunities for
research funding and industrial engagement. They will hold a PhD or
equivalent, and will have a proven research record in any of those areas,
with a solid background in the underlying theory. Experience in attracting
funding, engaging with industry, or contributing to outreach activities
would also be valuable.

This is a full-time and permanent (tenured) post, available from April 2019
or as soon as possible thereafter. The post is based in Egham, Surrey,
within commuting distance from London, Europe's most dynamic technology
hub.

For further details of the Department see
royalholloway.ac.uk/computerscience or contact the Head of Department at
jose.fiadeiro@rhul.ac.uk

To view further details or to apply please visit
https://jobs.royalholloway.ac.uk


Closing Date: Midnight, 17 February 2019

Interview Dates: 6 and 7 March 2019

**********************************************************
*
* 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] [jobs] Postdoctoral research position(s) at the Nanyang Technological University

Two short-term post-doctoral positions are available at the School of
Computer Science and Engineering of the Nanyang Technological University
based on two distinct MOE Tier-1 (seed) grands.

Position-1:
~~~~~~~~~~~

Start date: immediate
Duration: 6 months (extendable to 10 months)
Keywords: security games, social choice, game theory, voting

The context for the position is a Tier-1 project "Securing Expression of
Opinion". The overall aim of the project is to develop a new game-theoretic
approach to prevent falsification of election results. The approach is
based on a model that combines recent advances in security games when
applied to features of an underlying voting process.

Specifically, the aim of this post will be to contribute to one or more of
the following:

(i) assist in theoretical analysis of the formal secured voting model,
identify domain sub-classes with distinct features wrt computational
complexity and manipulability
(ii) develop an experimental test-bed for the approach with an outlook to
incorporate and study real-world human behaviour patterns
(iii) study other social choice processes for the possibility to apply the
secured model

More information:
For more details about the position and to apply, please contact Svetlana
Obraztsova (lana@ntu.edu.sg) via an e-mail titled "Re: Application RF/RA
SingEO"

Position-2:
~~~~~~~~~~~

Start date: immediate
Duration: 6 months (extendable to 10 months)
Keywords: distributed constraint optimisation, information theory

The context for the position is a Tier-1 project "Mixed Initiative DCOPs".
The overall aim of the project is to study the effects of heterogeneous
computational and communication capabilities of nodes that partake in the
execution of a distributed constraint optimisation algorithm.

Specifically, the aim of this post will be to contribute to one or more of
the following:

(i) assist in the information theoretic analysis of existing DCOP algorithms
(ii) develop efficient means to augment DCOP algorithms to counteract
computational and communication restrictions
(iii) develop an experimental test-bed for the approach with an outlook to
incorporate and study real-world human behaviour patterns


More information:
For more details about the position and to apply, please contact Zinovi
Rabinovich (zinovi@ntu.edu.sg) via an e-mail titled "Re: Application RF/RA
MI-DCOPS".


About the University
~~~~~~~~~~~~~~~~~~~~
Nanyang Technological University (NTU), Singapore, is currently ranked 12th
world-wide by the QS World University Rankings. In 2017, Times Higher
Education World University Rankings has placed the School of Computer
Science and Engineering (SCSE) in the 3rd place for our citation impact in
the area of Artificial Intelligence. NTU's campus is located in the greener
and a more quiet corner of Singapore, a welcome respite from the vividly
bustling, vibrant city life of the island.

**********************************************************
*
* 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, January 30, 2019

[DMANET] WAW 2019: CFP

WAW 2019: 16th Workshop on Algorithms and Models for the Web Graph
The University of Queensland, Brisbane, Australia, July 6-7, 2019

Conference website:
http://www.math.ryerson.ca/waw2019/
Submission link:
https://easychair.org/conferences/?conf=waw2019

The World Wide Web has become part of our everyday life, and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, hosts and users.

The aim of the 16th Workshop on Algorithms and Models for the Web Graph (WAW 2019) is to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop will also welcome the researchers who are working on graph-theoretic and algorithmic aspects of citation networks, social networks, biological networks, molecular networks, and the Internet.

WAW 2019 Keynotes:

Anthony Bonato (Ryerson University, Canada)

Catherine Greenhill (University of New South Wales, Australia)

Peter Taylor (University of Melbourne, Australia)


Submission Guidelines:

WAW 2019 invites original research papers and abstracts on all aspects of algorithmic and mathematical research in the areas pertaining to the World-Wide Web, especially papers that espouse the view of complex data as networks.

Submissions are invited in, but not limited to, the following areas:

Algorithms: graph algorithms, clustering, collaborative filtering, routing optimization.
Analysis: structural properties, visualization, patterns, communities, discovery, flow simulation.
Data Models: graph models, evolution, trust and reputation networks.
Topics: Web, social networks, transportation networks, communication networks, recommender networks, citation networks, Wikipedia,
biological networks, blogs, p2p.
Applications: web mining, social applications, routing & transportation, web search and ranking.

The papers must be formatted according to Springer LNCS style. The maximum length of papers is at most 15 pages. The workshop proceedings will be published as a Springer LNCS volume. Selected papers from the workshop will be invited to a special issue of Internet Mathematics. Talks associated with proceedings papers will be 30 minutes.

Abstracts are a maximum of one page, may be in any style, and must be pdf files. They should include the title, speakers, and a summary of research. All abstracts related to the conference areas will be accepted (at the discretion of the program committee), and published on the conference website (but not published in the proceedings). Talks associated with abstracts will be 20 minutes.

Papers and abstracts must be submitted via Easychair:
https://easychair.org/conferences/?conf=waw2019

Important dates:

Full paper submission: April 1, 2019
Notification of acceptance: May 1, 2019
Final version due: June 1, 2019
WAW 2019: July 6-7, 2019

Program Committee Chairs:

Konstantin Avrachenkov, Inria, France
Pawel Pralat, Ryerson University, Canada
Nan Ye, University of Queensland, Australia

Program Committee:

Konstantin Avrachenkov, Inria
Paolo Boldi, University of Milano
Anthony Bonato, Ryerson University
Milan Bradonjic, Bell Laboratories
Fan Chung Graham, UC San Diego
Collin Cooper, King's College London
Andrzej Dudek, Western Michigan University
Alan Frieze, Carnegie Mellon University
David Gleich, Purdue University
Jeannette Janssen, Dalhousie University
Bogumil Kaminski, SGH Warsaw School of Economics
Ravi Kumar, Google
Marc Lelarge, Inria
Stefano Leonardi, Sapienza University of Rome
Nelly Litvak, University of Twente
Michael Mahoney, UC Berkeley
Oliver Mason, NUI Maynooth
Dieter Mitsche, Universite de Nice Sophia-Antipolis
Peter Morters, University of Bath
Tobias Mueller, Utrecht University
Liudmila Ostroumova, Yandex
Pan Peng, University of Vienna
Xavier Perez-Gimenez, University of Nebraska-Lincoln
Pawel Pralat, Ryerson University
Vittorio Scarano, University of Salerno
Przemyslaw Szufel, SGH Warsaw School of Economics
Yana Volkovich, AppNexus
Nan Ye, The University of Queensland
Stephen Young, Pacific Northwest National Laboratory

Contact:

All questions about submissions should be emailed to k.avrachenkov@inria.fr, pralat@ryerson.ca, nan.ye@uq.edu.au


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

[DMANET] PhD position on Mathematical Optimization for Data Science

The Department of Economics at the Copenhagen Business School encourages applications for its PhD program for the fall term 2019. Candidates interested in writing a PhD dissertation in the area of Mathematical Optimization for Data Science are particularly welcome to apply. For information on the doctoral application process visit:
https://www.cbs.dk/en/about-cbs/jobs-cbs/vacant-positions/phd-scholarships-in-economics.

The application deadline is 04.04.2019.

Kind regards,
Dolores.
--
Dr Dolores Romero Morales
Professor in Operations Research
Department of Economics
Copenhagen Business School
Denmark
E: drm.eco@cbs.dk
H: www.doloresromero.com
T: +45 38153823

**********************************************************
*
* 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] Summer school on random graphs, random walks, Nice July 8-19

The Nice Summer School on Markov chains, random walks, random graphs and
its applications to complex networks will be held in Nice (France)
from July 8-19, 2019. One of the two courses focusses on different models
of random graphs (model G(n,p), configuration model, preferential
attachment model, random graph processes, ...) together with techniques in
these models (switching techniques, differential equation method,...),
whereas the other course will focus on concepts and techniques related to
random walks and Markov chains (mixing times, hitting times, random
spanning trees, cutoff phenomena, ...).

The school is aimed at advanced master students, PhD students, or
researchers in an early stage of their career working in the broad field of
discrete probability and its applications.

Further details can be found at:
https://math.unice.fr/~dmitsche/Summerschool/Summerschool.html

Being a popular summer holiday destination, lodging in Nice in summer is
expensive. However, the school is supported by different sponsors:
Universite Cote d'Azur, UCA Academie 1, Universite Nice, google, PIMS.
Registration fees (including 2-week stay in a single bedroom close to the
university, lunches and coffee breaks during lecture days): 400 Euro.
Discounts for people without need for lodging. However, the number of
participants being limited, we might have to make a selection.

If you want to participate, send an email to dmitsche@gmail.com. Attach a
CV as well as a short motivation letter for your participation.

Deadline for registration: May 1, 2019. You will be informed shortly
afterwards whether your application was successful.

Best regards,
Dieter Mitsche

**********************************************************
*
* 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] SAT 2019 Call for Workshops.

===============================================================
CALL FOR WORKSHOPS

SAT 2019
22nd International Conference on Theory and Applications of Satisfiability Testing
http://sat2019.tecnico.ulisboa.pt/workshops.html
July 7-12, 2019, Lisbon, Portugal
===============================================================


===============================================================
*** WORKSHOP PROPOSAL SUBMISSION DEADLINE: February 4, 2019 ***
===============================================================


===============================================================
The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning.

We invite proposals for workshops associated to the main conference program of SAT 2019, which will be held in Lisbon (Portugal) from July 7 to July 12, 2019.
Submission of Workshop Proposals

Proposals should be submitted in pdf format to the following address: workshops@sat2019.tecnico.ulisboa.pt.

Proposals should consist of two parts. First, a short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). A second, organizational part should include:

- Contact information of the workshop organizers
- Estimate of the audience size
- Proposed format and agenda (for example, paper presentations, tutorials, demo sessions, etc.)
- Potential invited speakers
- Procedures for selecting talks and participants
- Plans for dissemination, if any (for example, proceedings or special issue of journals)
duration: half day or full day
- Relevant chairing experience of the organizers (if any)
- Organizing committee members (if already known)


===============================================================
Important Dates:

- February 04, Workshop proposal submission deadline
- February 18, Workshop acceptance notification
- July 7-8, SAT 2019 Workshops


===============================================================
Contact Information:

Questions regarding workshop proposals should be sent to workshops@sat2019.tecnico.ulisboa.pt.

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

[DMANET] Postdoc in Brno, Czech Republic (scheduling & planning)

*** Post-doctoral open call FI MU 2019

The Faculty of Informatics of Masaryk University (FI MU) in Brno, Czech
Republic <http://www.fi.muni.cz/>, invites applications for
Post-doctoral positions in all areas of Computer Science. See the call

https://www.muni.cz/en/about-us/careers/vacancies/43809

This includes, in particular, the area of

*Scheduling and Planning*

Please contact Hana Rudova <hanka@fi.muni.cz> if you are interested in
these particular topics. You should also send her
-- an academic CV
including a list of publications (only published or accepted),
-- your three best publications from recent years from above mentioned
areas (references as well as PDF files), where all publications
must be published or accepted. Do not send publications
under review.
Note that deadline for application is March 1, 2019. However, you should
contact Hana Rudova as early as possible to compare potential candidates
for these areas in advance. More details about corresponding research
topics can be found at

https://www.fi.muni.cz/research/networks/scheduling.html.en

* Offer
The postdoctoral positions are awarded for one year with an extension to
the second year after a review. Gross salary is 50,000 CZK per month
which, with an optional 10% bonus, sums to more than 25,500 EUR per
year. Additional funds of 4,000 EUR per year will be available for
travel and material expenses. Preferred start date of the contract is in
June/July 2019, but other options can be negotiated without hassle.

* Requirements
Candidates must have a Ph.D. degree not older than 4 years at the time
of application, from a university outside of the Czech and Slovak
Republics. In case that the Ph.D. defense is not yet finished, the
candidate must also provide an official letter certifying that his/her
Ph.D. thesis has already been submitted for defense and outlining the
expected schedule of the Ph.D. defense. Candidates with a Ph.D. degree
from a Czech or Slovak university may also be considered if they prove
at least two years of post-doctoral research experience abroad.

--
Hana Rudova, Ph.D.
Associate Professor
Faculty of Informatics, Masaryk University
Botanicka 68a, 602 00 Brno, Czech Republic
hanka@fi.muni.cz
http://www.fi.muni.cz/~hanka
**********************************************************
*
* 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, January 29, 2019

[DMANET] STACS 2019: Early registration ends on February 5, 2019

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

STACS 2019
36th International Symposium on Theoretical Aspects of Computer Science
March 13—16, 2019, TU Berlin, Berlin, Germany

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

The STACS deadline for early registration ends soon: February 5, 2019.
Registration through

https://stacs2019.akt.tu-berlin.de/

The scientific program consists of three invited talks

* Leslie Ann Goldberg (Oxford):
"Computational Complexity and Partition Functions"
* Anca Muscholl (Bordeaux):
"The Many Facets of String Transducers"
* Petra Mutzel (Dortmund):
"Algorithmic Data Analysis"

and two invited tutorials

* Karl Bringmann (Saarbruecken):
"Fine-Grained Complexity Theory"
* Tobias Friedrich (Potsdam):
"Network Science".

Moreover, the scientific program comprises 54 contributed papers
(selected from 260 submitted papers).
The program will start on March 13, 01:00 pm, with the two tutorials
and it will end on March 16 around noon.

More information and details concerning program arrangements
can be found on the above-mentioned web page.
**********************************************************
*
* 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] WG 2019: Second CFP

************************************************
WG 2019: SECOND CALL FOR PAPERS
************************************************

45th International Workshop on Graph-Theoretic Concepts in Computer Science
June 19-21, 2019, Hotel Vall de Núria, Vall de Núria, Catalonia, Spain
http://wg2019.sau.thilikos.info

Submission link: https://easychair.org/conferences/?conf=wg2019
Submission deadline: February 19, 2019

LOCATION
The WG 2019 conference is the 45th edition of the WG series. It will take
place in
Vall de Núria, a valley very close to the French-Spanish borders. The
conference
will take place from Wednesday June 19 to Friday June 21, 2019.
Participants are
expected to arrive at Vall de Núria on Tuesday June 18, preferably by train
from
Barcelona, to join the welcome reception in the evening.

IMPORTANT DATES
Submission of papers: February 19, 2019
Acceptance notification: April 19, 2019
Conference: June 19-21, 2019
Final version: July 9, 2019

SCOPE
- design and analysis of sequential, parallel, randomized, parameterized
algorithms,
- distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modeling,
- graph drawing and layouts,
- computational geometry,
- computational biology,
- graph mining,
- random graphs and models of the web and scale-free networks, and
- support of the above concepts by suitable implementations and
applications.

SUBMISSIONS AND PROCEEDINGS
Contributors are invited to submit an extended abstract of at most 12 pages
Springer LNCS format (www.springer.com/lncs) including title, abstract and
references.
Proofs omitted due to space restrictions must be placed in an appendix, to
be read
by program committee members at their discretion. All papers must be
original and not
simultaneously submitted to another journal or conference. Accepted
contributions will be
published in the conference post-proceedings in the Lecture Notes in
Computer Science
(ARCoSS/LNCS) series of Springer-Verlag.

INVITED SPEAKERS
Frédéric Havet (Sophia Antipolis, France)
Saket Saurabh (Chennai, India & Bergen, Norway)
Marc Noy (Barcelona, Spain)

PROGRAM COMMITTEE
L. Sunil Chandran, Indian Institute of Science, India
Maria Chudnovsky, Princeton University, USA
Marek Cygan, University of Warsaw, Poland
Tınaz Ekim Aşıcı, Bogazici University, Turkey
Jirí Fiala, Charles University, Czech Republic
Loukas Georgiadis, University of Ioannina, Greece
Petr Golovach, University of Bergen, Norway
Gregory Gutin, Royal Holloway, UK
Juraj Hromkovic, ETH Zurich, Switzerland
Michael Kaufmann, University of Tuebingen, Germany
Eun Jung Kim, CNRS, LAMSADE, France
Cláudia Linhares Sales, Universidade Federal do Ceará, Brazil
Bojan Mohar , Simon Fraser University, Canada & University of Ljubljana,
Slovenia
Rolf Niedermeier, Technische Universität Berlin, Germany
Naomi Nishimura, University of Waterloo, Canada
Nicolas Nisse, INRIA Sophia Antipolis, France
Daniel Paulusma, Durham University, UK
Ignaz Rutter, Universität Passau, Germany
Ignasi Sau (Chair), CNRS, LIRMM, France
Maria Serna, UPC & Barcelona Graduate School of Mathematics, Spain
Mordechai Shalom, TelHai Academic College, Israel
Hisao Tamaki, Meiji University, Japan
Dimitrios M. Thilikos (Chair), CNRS, LIRMM, France & NKUA, Greece

ORGANIZING COMMITTEE
Ignasi Sau
Dimitrios M. Thilikos

CONTACT INFORMATION
wg2019@thilikos.info

**********************************************************
*
* 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 on graphs, networks and their applications in Moscow SECOND ANNOUNCEMENT

SECOND ANNOUNCEMENT

Dear Colleagues,
The 2019 Conference on Graphs, Networks, and their Applications will be held in Moscow on May 13-18.
https://mipt.ru/education/chairs/dm/conferences/workshop-on-graphs-networks-and-their-applications-may-13-18-moscow-2019.php
The aim of the conference is to bring together specialists in graph and hypergraph theory, random graphs and complex networks.
There will be a number of invited and contributed talks.
---------------------------------
Plenary speakers include:
---------------------------------
• Armen Asratian (Linköping University, Sweden)
• Nikhil Bansal (Eindhoven University of Technology)
• Stefano Boccaletti (CNR- Institute of Complex Systems, Florence, Italy, Northwestern Polytechnical University, Xi'an, China)
• Colin Cooper (King's College London)
• Reinhard Diestel (University of Hamburg)
• Santo Fortunato (Indiana University Bloomington)
• Ehud Friedgut (Weizmann Institute)
• David Gamarnik (MIT)
• Remco van der Hofstad (Eindhoven University of Technology)
• Alexander Kostochka (University of Illinois at Urbana-Champaign)
• Michael Krivelevich (Tel-Aviv University)
• Daniela Kühn (University of Birmingham)
• Jure Leskovec (Stanford University)
• Dhruv Mubayi (University of Illinois at Chicago)
• Marc Noy (Universitat Politècnica de Catalunya)
• Deryk Osthus (University of Birmingham)
• János Pach (École polytechnique fédérale de Lausanne)
• Panos Pardalos (University of Florida)
• Romualdo Pastor-Satorras (Universitat Politècnica de Catalunya)
• Bruce Reed (McGill University)
• Joel Spencer (NYU)
• Benjamin Sudakov (ETH)
• Lutz Warnke (Georgia Institute of Technology)
• Paul Wollan (University of Rome)
• Jozsef Balogh (University of Illinois at Urbana-Champaign) tentatively
• Peter Frankl (Hungarian Academy of Sciences) tentatively
• Ravi Kumar (Google) tentatively
• Vojtěch Rödl (Emory University) tentatively
• Ola Svensson (École polytechnique fédérale de Lausanne) tentatively

----------------
Registration
----------------
If you wish to attend, please register following the link on the webpage.

Registration fee:
• Full rate - €100
• Reduced rate - €0
Reduced rate applies to students.

---------------------------------
Call for contributed talks:
---------------------------------

A limited number of contributed talks will be included in the program of the conference. When registering, please indicate as soon as possible if you wish to give a talk. The abstracts of the talks should be submitted by 01.03.2019. A decision will be made by 15.03.2019.

For information concerning visas, getting to the venue, and accommodation, please consult the conference webpage https://mipt.ru/education/chairs/dm/conferences/workshop-on-graphs-networks-and-their-applications-may-13-18-moscow-2019.php
---------------------------
Organizing committee
---------------------------
• Andrei M. Raigorodskii (MIPT, Yandex)
• Andrei Kupavskii (MIPT, University of Oxford)
• Liudmila Prokhorenkova (MIPT, Yandex)
• Maxim Zhukovskii (MIPT)
**********************************************************
*
* 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, January 28, 2019

[DMANET] Postdoctoral Positions at University of Chile

Two postdoctoral positions are available at the Department of
Industrial Engineering of Universidad de Chile (Santiago) starting in
between May and October 2019. The selected candidates will devote
fully to research working with professors Jose Correa
<http://www.dii.uchile.cl/~jcorrea/> and Juan Escobar
<http://www.dii.uchile.cl/~jescobar/> on fundamental algorithmic
and/or economic issues related to market design, broadly understood.

The appointment will be for a period of 12 months, renewable by mutual
agreement, with a monthly salary of 1.900.000 CLP. Shorter periods may
also be considered. Travel support is available. Applicants must hold
a recent PhD in Computer Science, Economics, Mathematics, Operations
Research, or related fields. Applications including curriculum vitae,
list of publications, research plan (1 page), and names of references
with their e-mail addresses, should be sent electronically to Jose
Correa or Juan Escobar. To ensure full consideration the application
should be sent before the deadline of February 26th, 2019. Late
applications will be considered on a case by case basis.
**********************************************************
*
* 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/
*
**********************************************************

FW: NSF re-starting after the lapse in appropriations

 

 

From: CISE Announcements <CISE-ANNOUNCE@LISTSERV.NSF.GOV> On Behalf Of Kurose, James
Sent: Monday, January 28, 2019 2:13 PM
To: CISE-ANNOUNCE@LISTSERV.NSF.GOV
Subject: NSF re-starting after the lapse in appropriations

 

Dear Computer and Information Science and Engineering (CISE) Community,

 

The National Science Foundation (NSF) is once again open for business, operating under a three-week continuing resolution (CR) through February 15, 2019, following the 35-day lapse in appropriations (lapse) that began December 22, 2018, and concluded this past Friday.  Many people have been impacted by the lapse, both personally and professionally, including our own NSF staff as well as all of you – our broader community.  Unfortunately, the lapse resulted in numerous missed panels, a backlog of proposal actions, and delays on several other fronts as well.  Consequently, as we resume operations today, across the Foundation, we face a significant backlog of personnel, programmatic, review, facility, budgetary, and oversight actions, with additional impending deadlines.   

 

We call your attention to the NSF home page (www.nsf.gov), where you'll find a message from NSF Director France Córdova regarding the lapse, as well as a document outlining guidance for the NSF proposer and awardee community.  In this guidance document, you'll find information about proposal preparation and submission; changes to existing proposal due dates (note that several solicitations led by the CISE directorate are impacted); updates regarding proposal review processes, including panels that were missed or are scheduled in the coming weeks; and post-award information.

 

It will certainly take some time until we are able to work through the backlog of items and activities needing attention, and much longer before we are able to return to a sense of "business as usual."  We are establishing priorities that will enable us to focus on the most critical activities first, particularly in light of the time-limited, three-week CR.  We ask that you please review the guidance document and other material posted on the NSF website, and hope that these will answer many of the questions that you might have.  If you still have questions, we and our colleagues in CISE are here to address items that are not in the posted guidance – but also ask for your patience and understanding as we re-boot with more than a month of backlogged activities.

 

Throughout the lapse, many have noted the critical role that NSF, and the science and engineering community that we serve, play in "promot[ing] the progress of science; …advanc[ing] the national health, prosperity, and welfare; and secur[ing] the national defense..." our mission as stated in the 1950 NSF Act that established the agency.  We return to work today inspired, as always, by this mission and the importance of our collective activities to the Nation, and look forward to working with you all again in the times ahead.

 

Best,

 

Jim and Erwin

 

Jim Kurose, Assistant Director (AD) of NSF for CISE

Erwin Gianchandani, Deputy AD of NSF for CISE

 

PS:  Please feel free to forward this email to colleagues who you think might be interested, and note the information below about one can subscribe or unsubscribe to the CISE-announce listserv.

 

Information about this listserv

 

If you do not wish to receive these emails, you can unsubscribe at any time

by sending an email to cise-announce-unsubscribe-request@listserv.nsf.gov.

 

Additionally, please feel free to forward this note to colleagues; anyone

interested in subscribing can join by sending an email to

cise-announce-subscribe-request@listserv.nsf.gov.

 

 

########################################################################

[DMANET] PhD project: "Design and Analysis of Algorithms for Continuous Optimisation with Applications to Crystal Structure Prediction" (University of Liverpool, UK)

Fully funded PhD project: "Design and Analysis of Algorithms for Continuous Optimisation with Applications to Crystal Structure Prediction"

University of Liverpool | School of Electrical Engineering, Electronics and Computer Science | Liverpool | United Kingdom

Supervisors:

Prof Piotr Krysta (Computer Science)
Dr Matthew Dyer {Chemistry)
Prof Rahul Savani (Computer Science)

Application Deadline: Wednesday, July 31, 2019

Project Description

This position will remain open until a suitable candidate has been found.
This PhD position is funded by the Leverhulme Centre for Functional Materials Design that has been recently launched at the University of Liverpool. This centre is one of only 4 such centres funded in the UK and brings together expertise in chemistry with state-of-the-art computer science and automated technologies to develop a new approach to revolutionise the design of functional materials at the atomic scale.

The research questions that we are going to consider within this new PhD project on "Design and Analysis of Algorithms for Continuous Optimisation with Applications to Crystal Structure Prediction" will be related to several areas of Theoretical Computer Science (e.g., the design and theoretical analysis of algorithms and computational complexity theory), Discrete and Continuous Optimisation (e.g., mathematical programming, convex and non-convex optimisation), as applied to Crystal Structure Prediction (CSP), a topic in Computational Chemistry.

The prediction of crystal structures with lowest potential energy, and therefore most stable, configuration of the atoms is still a largely unresolved challenging computational problem. The main complexity comes from the combinatorial explosion in the number of possibilities and unpredictable nature of non-convex energy landscape. The current computational methods mainly fail to provide reliable low energy structures prediction for atomic structures containing more than 100-150 atoms per the unit cell and become even useless with significant increase of potentially available types of atoms for new structures. The currently used variants of simulated annealing or genetic algorithms also have their own different limitations.

We will consider a family of continuous optimisation problems with convex or smooth but non-convex objective functions, where various fast algorithms have been developed by the Theoretical Computer Science community, with proven polynomial time bounds on their running time. These algorithms find global (approximate) optima, in the case of convex optimisation, and (approximately) local optima in case of non-convex smooth optimisation. The goal of this research is to design and analyse (new variants of) such algorithms for classes of such optimisation problems inspired by crystal structure prediction.

In crystal structure prediction (CSP), specific energy functions are minimised in search of minimal energy constellations of a collection of atoms of different kinds. The energy functions are known to be smooth but highly non-convex, so finding global optima may be challenging. However, even local optima are of importance, because they also correspond to chemically stable crystal structures. This area opens very interesting avenues to theoretical optimisation algorithmics, where faster such solvers for classes of optimisation problems motivated by CSP will be sought.

This project will look at the design and analysis of state of the art algorithms for classes of such continuous optimisation problems, where the focus of this PhD project will mostly be theoretical analysis. In addition, to evaluate the usefulness of these new algorithms, we will also implement them and test them on real-world CSP problems.

Qualifications

We welcome talented and highly motivated candidates with good first degree (BSc or MSc) in Computer Science, Mathematics or closely related subject. A programming experience and/or previous research experience would be a distinct advantage though it is not essential.

Informal enquiries should be addressed to Prof Piotr Krysta (P.Krysta@liverpool.ac.uk)

Please apply by completing the online postgraduate research application form here: https://www.liverpool.ac.uk/study/postgraduate-research/how-to-apply/

Please ensure you quote the following reference on your application: "Design and Analysis of Algorithms for Continuous Optimisation with Applications to Crystal Structure Prediction" (Reference: LRC CS1909)

Funding Notes

The award is primarily available to students resident in the UK/EU and will pay full tuition fees and a maintenance grant for 3.5years (£14,777 pa in 2018/19). Non-EU nationals are not eligible for this position and applications from non-EU candidates will not be considered unless you have your own funding.

References

Yurii Nesterov and Boris T. Polyak. Cubic regularization of Newton method and its global performance. Mathematical Programming, 108(1):177–205, 2006.

Scott M. Woodley and Richard Catlow. Crystal structure prediction from first principles. 
Nature Materials 7, 937–946 (2008) doi:10.1038/nmat2321
http://www.nature.com/articles/nmat2321

-----
Professor Piotr Krysta
University of Liverpool
Department of Computer Science
Ashton Building, Ashton Street
Liverpool L69 3BX, U.K.
http://www.csc.liv.ac.uk/~piotr

**********************************************************
*
* 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] BIOKDD-DEXA'19: CFP

*CALL FOR PAPERS*

*10th International Workshop on*

*Biological **Knowledge Discovery from Big Data **(BIOKDD'19)*

Held in parallel with

*30th International Conference on Database and *

*Expert Systems Applications **(**DEXA'19**)*

www.dexa.org/biokdd2019

Linz, Austria

August 26 - 29, 2019

In the recent years, there has been a rapid development of biological
technologies producing more and more *biological data*, i.e., data related
to biological macromolecules (DNA, RNA and proteins). The rise of *Next
Generation Sequencing* (NGS) technologies, also known as *high-throughput
sequencing* technologies, has contributed actively to the deluge of these
data. In general, these data are big, heterogeneous, complex, and distributed
in all over the world in databases. Analyzing biological big data is a
challenging task, not only, because of its complexity and its multiple and
numerous correlated factors, but also, because of the continuous evolution
of our understanding of the biological mechanisms. Classical approaches of
biological data analysis are no longer efficient and produce only a very
limited amount of information, compared to the numerous and complex
biological mechanisms under study. From here comes the necessity to adopt
new computer tools and develop new *in silico* high performance approaches
to support us in the analysis of biological big data and, hence, to help us
in our understanding of the correlations that exist between, on one hand,
structures and functional patterns in biological macromolecules and, on the
other hand, genetic and biochemical mechanisms. *Biological **Knowledge
Discovery from Big Data* (BIOKDD) is a response to these new trends.

Topics of BIOKDD'19 workshop include, but not limited to:

*Data Preprocessing: *Biological Big Data Storage*, *Representation
and Management
(data warehouses, databases, sequences, trees, graphs, biological networks
and pathways, …), Biological Big Data Cleaning (errors removal, redundant
data removal, completion of missing data, …), Feature Extraction
(motifs, subgraphs,
…), Feature Selection (filter approaches, wrapper approaches, hybrid
approaches, embedded approaches, …).

*Data Mining: *Biological Big Data Regression (regression of biological
sequences…), Biological Big Data Clustering/Biclustering (microarray data
biclustering, clustering/biclustering of biological sequences, …),
Biological Big Data Classification (classification of biological sequences…),
Association Rules Learning from Biological Big Data, Text mining and
Application to Biological Sequences, Web mining and Application to
Biological Big Data, Parallel, Cloud and Grid Computing for Biological Big
Data Mining.

*Data Postprocessing:* Biological Nuggets of Knowledge Filtering,
Biological Nuggets of Knowledge Representation and Visualization,
Biological Nuggets of Knowledge Evaluation (calculation of the
classification error rate, evaluation of the association rules *via*
numerical indicators, e.g. *measurements of interest*, … ), Biological
Nuggets of Knowledge Integration

*PAPER SUBMISSION DETAILS: *

Authors are invited to submit electronically original contributions in
English. Submitted papers should not exceed 5 pages in IEEE CSP format
*http://www.computer.org/portal/web/cscps/formatting
<http://www.computer.org/portal/web/cscps/formatting>*. All accepted papers
will be published in the proceedings of DEXA'19 Workshops with IEEE CSP*. *One
of the authors of an accepted paper must register to DEXA'19 conference and
present the paper at BIOKDD'19 workshop. For paper registration and
electronic submission see http://confdriver.ifs.tuwien.ac.at/dexa2019/
starting from January 2019.

*IMPORTANT DATES:* Submission of abstracts: March 11, 2019

Submission of full papers: March 18, 2019

Notification of acceptance: May 18, 2019

Camera-ready copies due: June 08, 2019

*PROGRAM COMMITTEE:*

Mourad Elloumi, LaTICE, University of Tunis, Tunisia (PC Chair)

Davide Verzotto, University of Pisa, Italy

Haider Banka, India Institute of Technology, Dhanbad, India

Suresh Dara, B V Raju Institute of Technology, Hyderabad, India

Daisuke Kihara, Purdue University, West Lafayette, USA

Bhaskar DasGupta, University of Illinois at Chicago, Chicago, USA

Robert Harrison, Georgia State University, Atlanta, Georgia, USA

Jérémie Bourdon, University of Nantes, France

Abdelhalim Larhlimi, University of Nantes, France

Dominique Lavenier, GenScale, IRISA-CNRS, Rennes, France

Malik Yousef, Zefat Academic College, Zefat, Israel

Giuseppe Lancia, University of Udine, Italy

Farhana Zulkernine, School of Computing Queen's University Kingston,
Ontario, Canada

Vladimir Makarenkov, University of Québec, Montréal, Canada

P. Ch. J. Srinivasa Rao, Koneru Lakshmaiah University, Vijayawada, India

Matteo Comin, University of Padova, Padova, Italy

Adrien Goëffon, University of Angers, France

Maad Shatnawi, Higher colleges of Technology, Abu Dhabi, UAE

Mirto Musci, University of Pavia, Pavia, Italy

Tomas Flouri, University College London, UK
Solon Pissis, Centrum Wiskunde & Informatica, Amsterdam, Netherlands

Jamal Al Qundus, Free University of Berlin, Berlin, Germany

***


</p><p class="MsoNormal" align="center" style="margin:0cm 12pt 0.0001pt 0cm;text-align:center;font-size:12pt;font-family:Times,serif"><span lang="EN-US">***</span><span lang="EN-GB" style="font-family:Calibri,sans-serif;color:gray"></span></p></div>
</div></div>
</div></div>
</div></div>
</div></div>

--0000000000001393580580873d50--
**********************************************************
*
* 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] Lecturer / Senior Lecturer / Reader in Algorithms and Complexity, University of Glasgow, School of Computing Science

Lecturer / Senior Lecturer / Reader in Algorithms and Complexity, University of Glasgow, School of Computing Science

Grades 7/8/9
£35,210 - £39,610 / £43,266 - £50,132 / £51,630 - £58,089 per annum

The School of Computing Science at the University of Glasgow seeks applications from outstanding candidates to develop and lead research of international standard in the area of algorithms and complexity.

The successful candidate will work with the algorithms and complexity group in the FATA (Formal Analysis, Theory and Algorithms) research section, where current topics include matching algorithms, graph algorithms, constraint programming, phase transitions in algorithmic complexity, and parallelisation.

The post holder will pursue a world-class research programme and will teach related topics in Computing Science at all undergraduate and postgraduate levels as well as carrying out allocated administrative tasks. The appointment will be made at Lecturer / Senior Lecturer / Reader level (approximately equivalent to Assistant Professor / Associate Professor in the US) depending on knowledge, skills and experience.

The School is creating a new research theme in Understandable Autonomous Systems. Preference may be given to candidates who have experience of research in algorithmic aspects of autonomous agents and multi-agent systems, or else demonstrate the potential to actively contribute to research in this area.

For more information, including the job description, see:

https://www.gla.ac.uk/explore/jobs, reference number 023200
https://www.gla.ac.uk/schools/computing/worldchangerswelcome
http://www.dcs.gla.ac.uk/research/algorithms

For informal enquiries, contact Prof David Manlove (david.manlove@glasgow.ac.uk).

It is the University of Glasgow's mission to foster an inclusive climate, which ensures equality in our working, learning, research and teaching environment.

We strongly endorse the principles of Athena SWAN, including a supportive and flexible working environment, with commitment from all levels of the organisation in promoting gender equality.

Vacancy Reference: 023200, Closing Date: 31 March 2019

The University of Glasgow, charity number SC004401

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

[DMANET] Mixed Integer Programming at EURO 2019 in Dublin

Dear colleagues,

we are happy to announce the possibility to submit sessions and
abstracts for EURO2019, the 30th European Conference on Operational
Research, in the stream on

"Mixed Integer Programming".

We would like to invite you to contribute a session or a talk to this
stream. We are especially interested in presentations about interesting
new mathematical developments and novel or large-impact applications
thereof.

EURO2019 is the largest and most important conference for Operational
Research and Management Science (OR/MS) in Europe organized by EURO –
the European Association of Operational Research Society. It will be
held June 23-26 in Dublin, Ireland.

More information is available on the website https://www.euro2019dublin.com/

Submission deadline is February 8, 2019. For submitting a talk in this
stream, please use the code "4ba2ac5e".
If you like to organize a session, please let us by email (and we will
open a session accordingly).


Arie Koster & Sven O. Krumke
Organizers of the EURO2019 stream on "Mixed Integer Programming"

**********************************************************
*
* 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] Optimisation position at Satalia

Satalia is a London-based optimisation technology company with optimisation
teams in Austria, Greece and the UK. We are currently looking for an
optimisation scientist with good programming skills to join one of our
optimisation teams and solve large-scale industrial problems. Remote and
flexible work is possible.

Detailed job description:
https://hire.withgoogle.com/public/jobs/sataliacom/view/P_AAAAABkAACLFNQyyl94T1c

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

Saturday, January 26, 2019

[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: extended to January 30, 2019

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

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

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

[DMANET] The Third International Workshop on Parallel and Distributed Data Mining (WPDM 2019)

WPDM 2019


The Third International Workshop on Parallel and Distributed Data Mining (WPDM 2019)
http://sara.unisalento.it/~cafaro/WPDM2019/

CALL FOR PAPERS

The Third Workshop on Parallel and Distributed Data Mining (WPDM 2019) will be held in conjunction with The 19th International Conference on Computational Science and Its Applications (ICCSA 2019), http://www.iccsa.org


Saint Petersburg University, Saint Petersburg, Russia July 1-4 2019


Final submission Deadline: February 17, 2019


SCOPE AND OBJECTIVES

The Workshop on Parallel and Distributed Data Mining is an international forum which brings together researchers and practitioners working on different high-performance aspects of data mining algorithms, enabling novel applications. 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. Therefore, there is an increasing interest in the design and implementation of parallel data mining algorithms. On parallel computers, by exploiting the vast aggregate main memory and processing power of processors and accelerators, parallel algorithms can easily address both the running time and memory requirement issues. 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. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of data mining algorithms and applications. 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. The focus of the workshop is on all forms of advances in high-performance data mining algorithms and applications, and related topics.

The WPDM Workshop topics include (but are not limited to) the following:

- 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

INSTRUCTIONS FOR PAPER SUBMISSIONS

You are invited to submit original and unpublished research works on above topics. Submitted papers must not have been published or simultaneously submitted elsewhere. The submitted paper must be between 10 to 16 pages long and formatted according to the Springer LNCS (Lecture Notes in Computer Science) rules, Guidelines and templates can be found at the url http://www.springer.com/it/computer-science/lncs/conference-proceedings-guidelines

To submit a paper, please connect to the Submission site from the link available at the ICCSA 2019 web site: http://ess.iccsa.org.
Only papers submitted through the electronic system and strictly adhering to the relevant format will be considered for reviewing and publication. Please pay attention, when submitting your contribution to the workshop, to select the right entry in the listbox shown in the submission form.


CONFERENCE POLICY

By submitting the paper to ICCSA conference, all authors agree to abide by all ICCSA conference paper submission, publication and presentation policies. Namely, authors confirm that the work is original, has not appeared in literature in any form in the past and will not be submitted to any other venue concurrently with ICCSA submission or until it appears in ICCSA proceedings (in the case of acceptance). Furthermore, upon paper acceptance, authors agree to transfer copyright on the accepted paper to ICCSA, and one of the authors will register the paper and present the paper at the event. No paper withdrawals can be accepted after Conference pre-registration date or within three months of the actual event, whichever date comes first. Paper withdrawal request can be only accepted in writing through email, letter or fax to conference organizers. The conference has no responsibility for any intentional or accidental misuse, misinterpretation, or failure to follow above rules and conditions and holds no legal, civil or other responsibility for opinions, content or utilization of any methods/algorithms expressed in the Conference Proceedings.

If you have any questions about paper submission or the workshop, please contact the workshop organisers.

IMPORTANT DATES

February 17, 2019: Deadline for paper submission
March 31, 2019: Notification of Acceptance.
May 8, 2019: Early-bird Registration ends.
May 8, 2019: Submission deadline for the final version of the Papers
July 1-4, 2019: ICCSA 2019 Conference


WORKSHOP ORGANIZERS

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it

All submitted papers will be reviewed by the workshop technical program committee members.

International Program Committee:

Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Bronis R. de Supinski, Lawrence Livermore National Laboratory, USA
Giuseppe Di Fatta, University of Reading, UK
Ann Gordon-Ross, University of Florida, USA
Kenli Li, Hunan University, China
Donato Malerba, University of Bari, Italy
Barbara Masucci, University of Salerno, Italy
Mitsunori Ogihara, University of Miami, USA
Takahiko Shintani, The University of Electro-Communications , Japan
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA
Laurence T. Yang, St Francis Xavier University, Canada


-

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

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

Friday, January 25, 2019

[DMANET] CFP: DIPI 2019 - 1st International Workshop on Data Distribution in Industrial and Pervasive Internet - deadline March 11, 2019 - Washington DC

=============================================================
1st International Workshop on
Data Distribution in Industrial and Pervasive Internet (DIPI 2019)*
June 9-12, 2019
Washington DC, USA
http://cnd.iit.cnr.it/dipi2019/

*co-located with IEEE WoWMoM 2019
=============================================================

******** Benefits ********

- Accepted papers will be included and indexed in IEEE Xplore
- 6-pages double column format
- Editorial follow-ups: Extended versions of selected papers might be
considered for possible fast track publication in a Special Issue of
Elsevier Computer Communications

******** Topics of Interest ********

The ubiquitous presence of data originating from the integration of
wireless networks, pervasive computing, industrial equipment and people,
has led to an increased interest in solutions for distributed data
management and efficient data distribution at the edge of the networked
environments. The essence of this vision is the creation of data-driven
networks saturated with pervasive sensing, computing, and wireless
communication that ideally support the needs of individuals, societies
and industries.

Contributions can be analytical, empirical, technological,
methodological, or a combination of those. Papers reporting strong
data-oriented systems engineering contributions backed by solid and
appropriate evaluations are strongly encouraged. The impact of the
contributions should be demonstrated in the context of the data-related
aspects in the pervasive and industrial internet. Research contributions
are solicited in all application areas pertinent to industrial and
pervasive data distribution, including but not limited to:

Data distribution in Industrial Internet, where novel data management
techniques can be supported by networking protocols, algorithms and
processes, and where intelligent entities can exchange and manage
distributed data in order to achieve improved performance for both the
cyber and the physical components.
Particular areas of interest include:

- Data-driven industrial IoT architectures with multiple inter-connected
networking technologies
- Pervasive data distribution and management algorithms for the
Industrial Internet
- Networking protocol stacks and standardization for enabling efficient
data distribution
- Industrial cloud and edge computing, communication and networking
technologies
- Data-oriented networked control, distributed optimization, and
distributed learning
- Industrial internet robotics and autonomous systems
- Modeling of tightly integrated, data-intensive Cyber-Physical
processes, computation platforms, and networks
- Data distribution solutions which satisfy the Industry 4.0
requirements

Data distribution in Pervasive Internet, where the ambient intelligence
of network devices embedded in the environment can provide a constant
and unobtrusive data management and distribution.
Particular areas of interest include:

- Large-scale data management and distribution in pervasive internet
- Clouds, cloudlets, fog computing, device-to-device coordination
- Pervasive big data and artificial intelligence
- Smart spaces and intelligent environments
- Cognitive computing techniques
- Social Cyber-Physical Computing and human in the loop, data-oriented
approaches
- Crowdsensing and analytics of human user data in Cyber-Physical
Systems

Contributions focused on the horizontal topics of (a) security, privacy,
trust (b) reliability, safety (c) experiences from real-world
deployments, testbeds, case studies, are also welcome, as long as they
target one of the aforementioned application areas.

******** Main Organizers ********

- Workshop Chairs
Theofanis P. Raptis, Institute for Informatics and Telematics, National
Research Council (IIT-CNR), Italy
Georgios Z. Papadopoulos, IMT Atlantique, France

- Technical Program Committee
Masoud Abbaszadeh (GE Global Research, USA)
Xenofon (Fontas) Fafoutis (DTU, Denmark)
Antoine Gallais (Inria Lille / University of Strasbourg, France)
Oana Iova (INSA Lyon, France)
Salil Kanhere (UNSW Sydney, Australia)
Stamatis Karnouskos (SAP, Germany)
Vasilis Katos (Bournemouth University, UK)
Ernoe Kovacs (NEC Labs Europe, Germany)
Francois Lemercier (NIST, USA)
Valeria Loscri (Inria Lille, France)
Nathalie Mitton (Inria Lille, France)
Julien Montavont (University of Strasbourg, France)
Sharief Oteafy (DePaul University, USA)
Chrysa Papagianni (Nokia Bell Labs, Belgium)
Andrea Passarella (IIT-CNR, Italy)
Tanguy Ropitault (NIST, USA)
Miguel Sepulcre (Miguel Hernandez University of Elche, Spain)
Lei Shu (University of Lincoln, UK / Nanjing Agricultural University,
China)
George Sklivanitis (Florida Atlantic University, USA)
Petros Spachos (University of Guelph, Canada)
Violet R. Syrotiuk (Arizona State University, USA)
Geraldine Texier (IMT Atlantique, France)
Fabrice Theoleyre (CNRS / University of Strasbourg, France)
Eirini Eleni Tsiropoulou (University of New Mexico, USA)
Carlo Vallati (University of Pisa, Italy)
Cong Wang (Old Dominion University, USA)
Dimitrios Zorbas (Tyndall National Institute, Ireland)

- Publicity co-Chairs
Gangyong Jia (Hangzhou Dianzi University, China)
Fabrice Theoleyre (CNRS / University of Strasbourg, France)
Eirini Eleni Tsiropoulou (University of New Mexico, USA)

******** Important Dates ********

Paper Submission: March 11, 2019
Acceptance Notification: April 15, 2019
Camera Ready: April 29, 2019

******** Submission Guidelines ********
http://cnd.iit.cnr.it/dipi2019/sub.html
**********************************************************
*
* 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 24th Australasian Conference on Information Security and Privacy (ACISP 2019)

CALL FOR PAPERS
********************************************************************************
The 24th Australasian Conference on Information Security and Privacy (ACISP 2019)
Christchurch, New Zealand, 3-5 July 2019
http://acisp19.canterbury.ac.nz

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

The 24th Australasian Conference on Information Security and Privacy (ACISP) will be held in Christchurch New Zealand on 3-5 July 2019,
organized by the University of Canterbury. ACISP has established a key forum for international researchers and industry experts to present
and discuss the latest research, trends, breakthroughs, and challenges in the domain of information security, privacy and cybersecurity.

"Christchurch City is alive with colour, atmosphere and world-class attractions,
including the International Antarctic Centre, Orana Park and Willowbank Wildlife Park.
Christchurch is known internationally as the "Garden City" because of its spectacular gardens.
Christchurch is also home to a number of excellent cafes, bars and restaurants.
Many popular destinations such as Kaikoura, Akaroa, Mt Hutt and South Canterbury are less than two hours drive from Christchurch."
(from NZ tourism guide, http://www.tourism.net.nz/region/christchurch)

We welcome papers presenting theories, techniques, implementations, applications
and practical experiences on a variety of topics.
Topics of interest include, but are not limited to:
- Authentication
- Access Control
- Blockchain technology
- Cloud security
- Cryptology
- Cryptocurrency
- Cyber-physical systems security
- Database security
- Digital forensics
- Edge/Fog computing security
- Internet of Things security
- Intrusion Detection, Prevention and Response
- Key management
- Lightweight security
- Network security
- Post-quantum cryptography
- Privacy enhancing technologies
- Security implementation
- Security policy
- Security protocols
- Software security
- System security
- Viruses and Malware
- Vulnerability Discovery and Management

Submission and Publication Information

Papers should be submitted via easychair at https://www.easychair.org/conferences/?conf=acisp2019

All the submissions must be original, unpublished, and not submitted to another conference or journal for consideration of publication.
Submissions must be fully anonymous with no author names, affiliations, acknowledgements or obvious references.
Submissions must be written in English and have at most 18 pages (LNCS format, including everything).
Papers should be sufficiently intelligible and self-contained without appendices so that PC members can make decisions without reading appendices.
Submissions not meeting the submission guidelines risk rejection regardless of their merits.
Papers must be submitted using the EasyChair system via the link on the ACISP 2019 conference website.
The proceedings will be published by Springer-Verlag as a volume of the Lecture Notes in Computer Science series.
Authors of accepted papers must guarantee that at least one of the authors will register and attend the conference and present their paper.

Important Dates
Paper Submission: 15 February 2019
Notification of Acceptance: 1 April 2019
Camera-ready Copy: 11 April 2019
Conference dates: 3-5 July 2019

General Chair:
Dong Seong Kim, U. of Queensland, Australia
Jin Hong, U. of Western Australia, Australia

Program Co-Chairs:
Julian Jang-Jaccard, Massey U., New Zealand
Fuchun Guo, U. of Wollongong, Australia

If you have any question, please contact the organizers at acisp19@gmail.com or acisp19@outlook.com.


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