Sunday, December 30, 2018

[DMANET] EURO Doctoral Dissertation Award 2019

Apologies for cross-posting.

EURO Doctoral Dissertation Award 2019

The purpose of the prize is to distinguish an outstanding doctoral
dissertation in OR defended in the countries having an OR society that is a
member of EURO.
We invite you to widely disseminate this announcement.

THE PRIZE

The prize consists of a certificate and reward of €1,000

CALL FOR APPLICATIONS

The EDDA 2019 jury will only consider dissertations in Operational Research
defended between 1 February 2018 and 31 January 2019. The dissertation must
have been defended in a University located in a member country of EURO. The
author of the dissertation must be a member of a member society of EURO.

To be considered, a dissertation should be nominated by the supervisor of
the thesis (one of them in case of multiple supervisors). The supervisor of
the dissertation is asked to provide the jury with the following
information:

*The text of the dissertation;
*An extended abstract (3 to 5 pages) of the dissertation; this abstract
should be written in English and should include precise keywords;
*An itemization of the candidate's contribution to each co-authored article
if the dissertation contains co-authored articles (i.e., published papers
or unpublished manuscripts);
*If the dissertation is not in English, a paper in English which has been
authored or co-authored by the candidate and which describes the core ideas
of the dissertation. This paper should preferably have been published in or
submitted to an international journal;
*Nomination letters (or reports) from two referees selected by the
dissertation supervisor, supporting the submission and stating their
assessment of why the dissertation should win the award;
*An up-to-date CV of the candidate, including a list of publications.

No nomination will be considered without these items. Please also check the
guidelines.

Since many doctoral dissertations in OR are defended each year only
outstanding pieces of work are expected to be submitted. The jury would
like to remind supervisors that only high-quality theses might have a
chance of winning the award.

The jury selects a short-list of finalists who will present their work in a
special session at the 30th European Conference on Operational Research in
Dublin. There is no registration fee for each finalist. EURO will also
contribute to the travel and accommodation expenses. The winner will be
determined by the jury at the end of the special session and will be
announced by the chair of the jury during the closing session of the EURO
2019 Conference.

Applications should be submitted online
http://www.euro-online.org/awards/edda2019/registration.php by the deadline
of January 31, 2019.

--

Dr Sarah Fores
Manager of EURO

<http://euro2018valencia.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/
*
**********************************************************

Re: [DMANET] EURO Excellence in Practice Award 2019

Apologies for cross-posting.

EURO Excellence in Practice Award 2019

The purposes of the competition are to:
*recognise outstanding accomplishments in the practice of OR,
*attract more application-oriented papers to EURO-k Conferences,
*promote the practice of OR in general.

THE PRIZE

*a certificate of excellence in OR practice for each author of the paper
*an amount of €3,000 shared between the authors.

CALL FOR APPLICATIONS

All interested authors are invited to submit a detailed description of an
application of OR with a real impact on practice,which has original
features, whether in methodology, field of application and/or
implementation. This may be in the form of a paper written for publication
(although not necessarily published at the time of submission), a client
report, or other appropriate documentation. The documentation must describe
the work in a way that illustrates how it meets the criteria outlined
below. The age limit for published papers is four years. The work must not
have been submitted concurrently to another competition. The application is
open to OR specialists from any part of the world. Please also check the
guidelines.

The criteria for the evaluation of the papers are:

*real impact on practice,
*scientific quality,
*relevance to Operational Research,
*appreciation by the organisation involved with the application,
*originality in methodology, implementations and/or field of application.

Letters of appreciation are important.

The jury selects a short-list of finalists who will present their work in a
special session at the 30th European Conference on Operational Research in
Dublin. There is no registration fee for one author of each of the finalist
presentations. The winner will be determined by the jury at the end of the
special session and will be announced by the chair of the jury during the
closing session of the EURO 2019 Conference.

Applications should be submitted online
http://www.euro-online.org/awards/eepa2019/registration.php by the deadline
of January 31, 2019.


--
Dr Sarah Fores
Manager of EURO


<http://euro2018valencia.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/
*
**********************************************************

Thursday, December 27, 2018

[DMANET] PhD position in carsharing optimization

The research group for quantitative logistics at Linköping University is expanding its research and searches for a new PhD student.

The group is part of the Division for Communication and Transport Systems, with over 70 staff members studying transport and communication networks in the broadest sense. Many projects aim at developing models and methods for traffic systems, which can be used as decision support tools by infrastructure managers, operators, vehicle drivers and others.

At the Department of Science and Technology, at the university's Norrköping Campus, we provide education and conduct research in physics and electronics, communications/logistics and media- and information technology. The department is recognised for its work in fields including logistics, visualisation and organic electronics. We combine academic excellence with fruitful collaboration with the Community. Read more at https://liu.se/en/organisation/liu/itn <https://liu.se/en/organisation/liu/itn>
Your research will be conducted within the research project NEtworK Optimization for CarSharing Integration into a Multimodal TRANSportation System (EkoCS-Trans). The overall goal of this project is to support Swedish industry in providing CS solutions that attract a wide customer base (and, hence, lead to a reduced energy consumption), and to enable Swedish authorities to account for growing CS in their strategic urban transport planning. The approach is quantitative and makes strong use of simulation and optimization techniques.

On the simulation side, you will be responsible for integrating a representation of shared vehicles into an existing multi-agent transport simulation for Stockholm. On the optimization side, you will be responsible for solving problems that are mainly related to the planning of car sharing systems, using for example mathematical optimization or geometric algorithms. You will also contribute to the integration of both aspects of your research into a simulation-based optimization approach for the planning of car sharing systems.

The research is carried out together with VTI, the Swedish National Road and Transport Research Institute and stakeholders from industry and society.

We wish you have programming skills in Java or strong programming skills in some other object-oriented language. You should have strong quantitative skills/theoretical/mathematical background, e.g. through a degree in computer science, mathematics, physics, engineering (or willingness to learn). Moreover, you have an interest in applying quantitative and computational techniques to real transportation problems, and have good command of spoken and written English.
Additionally desirable are a transportation related background (e.g. a degree in (intelligent) transportation systems or the like), knowledge of algorithm design or mathematical optimization, an interest in interdisciplinary cooperation, communication and team skills, and creativity.

We hope to fill the position by spring 2019.

For the official announcement see:
https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=10210&rmlang=UK <https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=10210&rmlang=UK> (English verison)
https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=10204&rmlang=SE <https://liu.se/jobba-pa-liu/lediga-jobb?rmpage=job&rmjob=10204&rmlang=SE> (Swedish version)
Your application must be received at latest February 7, 2019.

Questions can be directed to Christiane Schmidt (PI), christiane.schmidt@liu.se, +46 11 36 3212, http://weber.itn.liu.se/~chrsc91/ <http://weber.itn.liu.se/~chrsc91/>


**********************************************************
*
* 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, December 24, 2018

[DMANET] IEEE Machine learning Workshop for Networks- co-located with IEEE 15 th IWCMC 2019, June 24-28, Tangier – Morocco

CALL FOR PAPERS

*Machine learning Workshop IWCMC 2019*

The IEEE 15th International Wireless Communications and Mobile Computing
Conference

Tangier, Morocco

June 24-28, 2019
http://iwcmc.org/2019

Dear Colleagues,

We are pleased to invite you to submit Full Papers to Machine Learning for
Next Generation Systems and Networks Workshop co-located with the IEEE
15th International Wireless Communications and Mobile Computing Conference
(IWCMC 2019), will be held on June 24-28, 2019 Tangier, Morocco

==========Scope==========

Authors are invited to submit previously unpublished papers to this
Workshop. Topics include, but are not limited to:

- Machine learning for next-generation wireless networks
- Machine learning for next-generation cognitive networks
- Machine learning for communication and network resource optimization
- Machine learning for communication and network operation and control
- Machine learning applied to WSN Applications
- Machine learning applied WSN Data Management
- Machine learning applied to WSN Data processing
- Machine learning applied to IoT Applications
- Machine learning applied IoT Data Management
- Machine learning applied to IoT Data processing
- Machine learning applied to Vehicular network applications
- Performance analysis of machine learning algorithms in next generation
networks

==========Submission Link: ============
https://edas.info/newPaper.php?c=24841

==========Technically sponsored by: ==========
IEEE and IEEE Morocco Section

===========Important Dates=================
Submission: *January 10, 2019*
Acceptance notification: March 30, 2019
Camera-ready paper submissions: April 30, 2019
=============Extended Papers==============
Selected papers will further considered for possible
publication in three special issues in the following Journals. For
more information, visit: http://iwcmc.org/2019/

1. The International Journal of Sensor Networks (IJSNet)
http://www.inderscience.com/browse/index.php?journalCODE=ijsnet
2. The International Journal of Autonomous and Adaptive Communications
Systems (IJAACS)
http://www.inderscience.com/jhome.php?jcode=ijaacs
3. KSII Transactions on Internet and Information Systems:
http://www.itiis.org/
4. Peer-to-Peer Networking & Applications:
http://www.springer.com/engineering/signals/journal/12083
5. Cyber-Physical Systems journal: www.tandfonline.com/loi/tcyb20

Note: There will be best paper award, best Symposium award and best
Workshop award.

Best regards

M. LAHBY

**********************************************************
*
* 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] Zuckerman Postdoctoral Scholars Program

The Zuckerman Postdoctoral Scholars Program attracts high-achieving
postdoctoral scholars from premier universities in the United States to do
research at one of seven Israeli universities (Bar-Ilan University,
Ben-Gurion University of the Negev, University of Haifa, Hebrew University,
Technion–Israel Institute of Technology, Tel Aviv University, and Weizmann
Institute).

Candidates for the Zuckerman STEM Leadership Program are assessed based on
their academic and research achievements, as well as on personal merit and
leadership qualities, without regard to race, religion, gender, ethnicity,
or age. Candidates may apply to more than one university.

For more information, please visit
http://zuckerman-scholars.org/programs/postdoctoral-scholars/.

Applications will be accepted through *February 15, 2019*.

Best Regards
Siddharth Gupta

PS: I am not a direct contact person for the program. I am a current
Zuckerman Postdoctoral Scholar at Ben-Gurion university. So, if you have
any questions regarding application, I will be happy to help. For any other
purposes, you should contact the people given on the website.

**********************************************************
*
* 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] A new Master's program at St. Petersburg U., Russia

A new Master's program "Advanced Mathematics
<http://math-cs.spbu.ru/msc-math/>" (which includes Theoretical Computer
Science) will be launched at St. Petersburg State University in 2019. This
is a two-year program with most of the courses taught in English (no
knowledge of Russian is required). The program is tightly connected to
the Chebyshev
Laboratory <http://chebyshev.spbu.ru/en/>, headed by the Fields
Medalist Stanislav
Smirnov <https://en.wikipedia.org/wiki/Stanislav_Smirnov>.

We kindly ask our colleagues to spread the word about it among the
interested students.

Key features of the programme:

-

Students choose their own curriculum from a broad range of advanced
courses in theoretical mathematics, theoretical computer science and their
applications (e.g., there will be courses in data science provided by
Yandex <https://yandex.com/>).
-

Students can participate in the active research life of the laboratory,
e.g., its research seminars <http://chebyshev.spbu.ru/en/schedule/> with
prominent guest lecturers <http://chebyshev.spbu.ru/en/visitors/>. Many
other research groups across the city, e.g., of the Steklov Institute of
Mathematics at St.Petersburg
<http://www.pdmi.ras.ru/eng/adress/adress.php>, also welcome the
students to join their seminars and research projects.
-

After finishing the program, students are likely to get their work
published, and will be prepared for PhD studies.
-

Incredibly low student-professor ratio, tiny class sizes of 5-10
students.
-

Excellent teaching staff with international experience, many external
teachers. Students are exposed to the famous Russian mathematical
tradition, while the program adopts best world teaching practices.
-

Location in St. Petersburg, the cultural capital and the most European
city of Russia, well-connected with all major cities of the world. The
cost of living <http://russian4foreigners.spbu.ru/en/node/195> in St.
Petersburg is less than in Europe, and it is also less than in Moscow
<https://www.expatistan.com/cost-of-living/moscow>.
-

Waivers of the tuition fee and scholarships for the most talented
students.
-

Travel grants to attend international scientific schools and conferences.


Graduates of the programme are prepared to continue their research in PhD
programs at the best universities worldwide (see e.g. testimonies of the
former students <http://chebyshev.spbu.ru/en/o-laboratorii/> of the
Chebyshev Laboratory http://chebyshev.spbu.ru/en/o-laboratorii/). They also
can choose an industrial career. In particular, the Chebyshev Laboratory
has strong ties with leading Russian and international industrial and IT
companies, including Gazprom Neft, Yandex, Huawei
<https://www.huawei.com/en/> and JetBrains <https://www.jetbrains.com/>,
which are interested in promising employees.

Questions about the program?

Check our webpage: http://math-cs.spbu.ru/en/msc-math-en/

Send us an email: math.msc at spbu.ru

Follow us on Facebook: @MathematicsSPbU
<https://www.facebook.com/MathematicsSPbU/>

--

Elena Arseneva (Khramtcova),

St. Petersburg University

Russia

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

Sunday, December 23, 2018

[DMANET] Postdoc positions in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for postdoc positions in computer science focused on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The postdoctoral researchers will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers based on conflict-driven clause learning (CDCL). We are even more interested in exploring new algebraic or geometric techniques (such as Groebner bases or pseudo-Boolean solving) that could potentially yield exponential improvements over CDCL. We also believe that there should be ample room for technology transfer with related areas such as SMT solving, constraint programming, and/or mixed integer linear programming, and so excellent researchers in these areas are also warmly welcome to apply.

A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of 4 postdoctoral researchers and 4 PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

Within the overall framework sketched above, the postdocs will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

These postdoc positions are full-time employed positions for one year with a possible (and expected) one-year extension. The expected starting date is in August-September 2019, although this is to some extent negotiable.

The application deadline is February 4, 2019. See http://www.csc.kth.se/~jakobn/openings/J-2018-3178-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .


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

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

The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (http://www.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The postdoc positions are in the area of computational complexity theory. Current research in the group focuses mostly on approximation algorithms/hardness of approximation, subexponential algorithms, and proof complexity, but excellent researchers in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.

This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation and the Swedish Research Council.

In addition to the PIs, the research project is planned to involve a total of 3-4 postdocs and 3-4 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

These postdoc positions are full-time employed positions for one year with a possible (and expected) one-year extension. The expected starting date is in August-September 2019, although this is to some extent negotiable.

The application deadline is February 4, 2019. See https://apc.eecs.kth.se/J-2018-3169-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc@eecs.kth.se.


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

[DMANET] Permanent positions at the Comp. Sci. Dept., Ecole Polytechnique (FR)

Dear colleagues,

Ecole Polytechnique welcomes applications for several full-time and part-time
computer science assistant professors, starting in September 2019:

- 1 position of full-time Assistant Professor ("Maître de
Conférences") "Monge" (tenure-track) in Data Science and Artificial
Intelligence

- 1 position of assistant professor full-time ("Maître de
Conférences") in Internet of Things

- 3 full-time Assistant Professor ("Maître de Conférences") positions
in computer science, capable of teaching at least one or more of the
following: algorithmic, programming at all levels, but also computer
architecture, operating systems, compilation and logic and complexity.

- 1 full-time Assistant Professor ("Maître de Conférences") "Monge"
position (tenure-track) in computer science, capable of teaching at
least one or more of the following: algorithmic, programming at all
levels, but also computer architecture, operating systems, compilation
and logic and complexity.

- 1 position of part-time assistant professor in computer graphics

- 2 positions of part-time assistant professor in data sciences and
artificial intelligence

- 2 positions of part-time assistant positions in computer science

Application deadline: March 25, 2019
Auditions: from May 13 to May 24, 2019

Candidates on full-time positions must show how they would integrate
into one of the existing teams of the laboratory (see
https://www.lix.polytechnique.fr).

Part-time positions are cumulated with a main academic or industry job.

Candidates can obtain more specific information (including contacts
for each position) at these addresses:
(in French) http://www.lix.polytechnique.fr/Labo/Eric.Goubault/Postes2019.htm
(english) http://www.lix.polytechnique.fr/Labo/Eric.Goubault/positions-2019.htm
and on the department's website, accessible in 2019 on
https://portail.polytechnique.edu/informatique)

The links on the application server are accessible from these pages or
from http://www.polytechnique.edu, as well as some details on computer
science education at Ecole Polytechnique and the statutes and
salaries.

You can already contact positions2019@lix.polytechnique.fr if you are
interested in knowing more about the computer science department, and
Ecole Polytechnique. You can also come meet the members of the
department, for example at the occasion of the "galette des rois" of
January 10, 2019, Turing building, Ecole Polytechnique, from 3:30pm
on.

Sincerely,

Eric Goubault
Head of the Comp. Sci. Dept.
Professor, Ecole Polytechnique

**********************************************************
*
* 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, December 22, 2018

[DMANET] Russian Workshop on Complexity and Model Theory, June 9 - 11, Moscow, 2019

Dear Colleagues,

The Russian Workshop on Complexity and Model Theory will be held in Moscow
on June 9-11.
https://mipt.ru/education/chairs/dm/conferences/workshop-june-9-11-moscow-2019.php
The focus of the conference will be on computational complexity,
communication complexity, formal languages, descriptive complexity,
cryptography and other related fields

There will be a number of invited and contributed talks. Plenary speakers
include:
--------------

- Andrei A. Bulatov (‪‪‪Simon Fraser University)
- Bruno Courcelle (University of Bordeaux)
- Anuj Dawar (University of Cambridge)
- Volker Diekert (Institut für Formale Methoden der Informatik)
- Lance Fortnow (Georgia Institute of Technology)
- Erich Grädel (RWTH Aachen University)
- Yuri Gurevich (University of Michigan)
- Alexei Miasnikov (Stevens Institute of technology)
- Jaroslav Nešetřil (Charles University)
- Noam Nisan (Hebrew University of Jerusalem)
- Vladimir Remeslennikov (Institute of Mathematics, Siberian Branch of
the Russian Academy of Sciences)
- Vitalii Roman'kov (Dostoevsky Omsk State University)
- Moshe Vardi (Rice University)
- Nikolay Vereshchagin (Moscow State University and NRU Higher School of
Economics)


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 workshop. When registering, please tell us as soon as possible if you
wish to give a talk. The abstracts of the talks should be submitted by
01.04.2019. A decision will be made by 15.04.2019.

For information concerning visas, getting to the venue, and accommodation,
please consult the conference webpage
---------------------------
Organizing committee
---------------------------

- Daniil Musatov (MIPT)
- Andrei M. Raigorodskii (MIPT, Yandex)
- Vladimir Remeslennikov (Institute of Mathematics, Siberian Branch of
the Russian Academy of Sciences)
- Maksim 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/
*
**********************************************************

[DMANET] WMA-Stelle an der BTU Cottbus

Die Brandenburgische Technische Universität (BTU) Cottbus-Senftenberg ist eine Campusuniversität mit drei Standorten: Zentralcampus Cottbus, Campus Cottbus-Sachsendorf und Campus Senftenberg. An der BTU sind rund 8.000 Studenten eingeschrieben, welche von 197 Professoren und 629 akademischen Mitarbeitern unterwiesen werden. In der Fakultät 1 (Mathematik, Informatik, Physik, Elektro- und Informationstechnik) ist an der Professur für Ingenieurmathematik und Numerik der Optimierung zum nächstmöglichen Zeitpunkt eine Stelle für einen wissenschaftliche Mitarbeiter (m/w; Entgeltgruppe 13 TV-L) in Vollzeit (100%-Stelle) befristet für die Dauer von fünf Jahren zu besetzen. Die Beschäftigungsdauer richtet sich nach den Vorschriften des Wissenschaftszeitvertragsgesetzes.

Aufgabengebiet:
Zu den Aufgaben gehört die Mitarbeit im Studiengang Mathematik sowie in Serviceveranstaltungen (Mathematik für Wirtschafts- und Ingenieurwissenschaften). Schwerpunkte in der Forschung sind die lineare und nicht-lineare gemischt-ganzzahlige Optimierung und deren Anwendung auf Fragestellungen der Praxis (universitäre und externe Partner). Die Tätigkeit umfasst die Unterstützung in Forschung und Lehre, Betreuung der Studenten sowie Mitwirkung bei administrativen Aufgaben und Förderanträgen.

Die Lehrverpflichtung beträgt vier Semesterwochenstunden pro Semester.

Qualifikationserfordernisse:
- Hochschulabschluss (Diplom, Master) in der Fachrichtung Mathematik, Physik oder Informatik,
- Kenntnisse im Bereich der diskreten Mathematik/Algorithmen/Optimierung,
- Programmierkenntnisse (C/C++, Python),
- gute Deutsch- und Englischkenntnisse,
- Interesse an einer Tätigkeit im Bereich der angewandten mathematischen Optimierung,
- Didaktische Fähigkeiten zur Vermittlung mathematischer Inhalte.

Wir bieten ein freundliches, offenes Arbeitsumfeld und eine exzellente Ausstattung in einem jungen Team. Die Möglichkeit zur wissenschaftlichen Qualifikation (Promotion bzw. Habilitation) ist gegeben. Nähere Informationen über die Universität finden Sie unter der Internetadresse http://www.b-tu.de

Weitere Auskünfte erteilt Ihnen Armin Fügenschuh (EMail: fuegenschuh@b-tu.de).

Bewerbungen mit den üblichen Unterlagen (Anschreiben, Lebenslauf, Zeugniskopien) senden Sie bitte elektronisch an Armin Fügenschuh per Email.

Prof. Dr. Armin Fügenschuh
Fachgebiet Ingenieurmathematik und Numerik der Optimierung
Fakultät 1 - MINT
Brandenburgische Technische Universität Cottbus - Senftenberg

Postanschrift: Postfach 101344, D-03013 Cottbus
Besucheradresse: Platz der Deutschen Einheit 1, Hauptgebäude, Raum 2.09, D-03046 Cottbus

Telefon: +49 (0)355 69-3127
Telefax: +49 (0)355 69-2307


**********************************************************
*
* 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, King's College, London, UK

***

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

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

Friday, December 21, 2018

[DMANET] [GECCO CFP] Second Call for Papers - 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/
=======================================================================

The Genetic and Evolutionary Computation Conference (GECCO 2019) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper-heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, search-based software engineering,
digital entertainment technologies and arts, artificial immune systems,
and more. Main tracks and chairs are (see more details at
https://gecco-2019.sigevo.org/index.html/Program+Tracks):

* Ant Colony Optimization and Swarm Intelligence,
Christine Solnon and Andries Engelbrecht

* Complex Systems (Artificial Life/Artificial Immune Systems/Generative
and Developmental Systems/Evolutionary Robotics/Evolvable Hardware),
Stéphane Doncieux and Sebastian Risi

* Digital Entertainment Technologies and Arts,
Penousal Machado and Vanessa Volz

* Evolutionary Combinatorial Optimization and Metaheuristics,
Christian Blum and Francisco Chicano

* Evolutionary Machine Learning,
Bing Xue and Jean-Baptiste Mouret

* Evolutionary Multiobjective Optimization,
Arnaud Liefooghe and Jonathan Fieldsend

* Evolutionary Numerical Optimization,
Jose Antonio Lozano and Dirk Arnold

* Genetic Algorithms,
Gabriela Ochoa and Tian-Li Yu

* General Evolutionary Computation and Hybrids,
Holger Hoos and Yaochu Jin

* Genetic Programming,
Ting Hu and Miguel Nicolau

* Real World Applications,
Robin Purshouse and Thomas Bäck

* Search-Based Software Engineering,
Justyna Petke and Giuliano Antoniol

* Theory,
Johannes Lengler and Per Kristian Lehre


GECCO2019 will also host 33 tutorials
(https://gecco-2019.sigevo.org/index.html/Tutorials), 8 competitions
ranging from different types of optimization problems to games and
industrial problems
(https://gecco-2019.sigevo.org/index.html/Competitions), and 25
workshops (https://gecco-2019.sigevo.org/index.html/Workshops).
Submission deadlines for competitions and workshops are available from
their website.


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

* Full papers
* Abstract deadline: January 30, 2019
* Submission of full papers: February 6, 2019
* Poster-only papers:
* Submission of poster-only papers: February 6, 2019
* Conference: July 13-17, 2019

Call for Papers
-----------------------------------------------------------------

The GECCO 2019 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Full papers of at most 8 pages (excluding references)
should present original work that meets the high-quality standards of
GECCO. Accepted full papers appear in the ACM digital library as part of
the **Main Proceedings** of GECCO. For full papers, a separate abstract
needs to be submitted first by January 30, 2019. Full papers are due by
the non-extensible deadline of February 6, 2019.

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

Besides full papers, poster-only papers of at most 2 pages may be
submitted. Poster-only papers should present original work that has not
yet reached the maturity and completeness of research results that are
published as full papers at GECCO. The review of poster-only papers
follows the same double-blind process described above. Accepted
poster-only papers will appear in the ACM digital library as part of the
**Companion Proceedings** of GECCO. Poster-only papers are due by the
non-extensible deadline of February 6, 2019, and no abstract needs to be
submitted first.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:

* Submit a final, revised, camera-ready version to the publisher on
or before the camera-ready deadline
* Register at least one author to attend the conference (by April 24,
2019)
* Attend the conference (at least one author)
* Present the accepted paper at the conference


Each paper accepted needs to have at least one author registered. If an
author is presenting more than one paper at the conference, she/he does
not pay any additional registration fees.

More information about paper submission is available at:
https://gecco-2019.sigevo.org/index.html/Call+for+Papers

--
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] PhD Position on "Exploiting Structural Properties of Random Wireless Network Graphs for Local Algorithm Design"

The Computer Science department of the University Koblenz-Landau
  (Campus Koblenz) invites applications for the position of a

                        research assistant
         (wissenschaftlicher Mitarbeiter/Mitarbeiterin)
                        (1,0 EGr. 13 TV-L)

at PhD level, in the research groups ``Formal methods and theoretical
computer science'' (Prof. Dr. Viorica Sofronie-Stokkermans) and
``Computer Networks'' (Prof. Dr. Hannes Frey).

The position is available for 2 years. A further extension is
planned.

The prospective scientific assistant will study theoretical modelling
and verification of wireless networked automatic assistant systems
like driver assistant systems, self-organizing fleet management, air
traffic management, or UAV swarm robotics. Such systems will be
modelled as randomly generated graphs. However, such graphs are not
arbitrarily random but underlie certain structural properties which
are typically satisfied by wireless networks (e.g. limited
communication range, spatial correlated communication links). In this
project such properties will be described by graph axioms. Based on the
axioms local algorithms for structuring wireless graphs will be
developed. Objectives are for example intersection free drawings,
limited degree, connectivity, or spanner property. The project covers
three areas: (1) based on automatic verification, correctness of local
algorithms shall either be verified or falsified (in the latter case a
counter example has to be found), (2) local algorithms are to be
designed which are correct or correct with high probability under the
considered graph axioms, (3) validity of the graph axioms for describing
wireless networks has to be investigated by stochastic analysis or by
means of simulation. Focus of the three areas will be decided depending
on the skills of the candidate.

Besides participation in research the position includes teaching
obligations in theoretical and technical fields of computer science.

Applicants should have a MSc degree (or comparable University degree)
in computer science, mathematics or a related discipline.

Application letters (including a CV) must be sent by e-mail as a
single .pdf file to:

          bewerbung@uni-koblenz-landau.de

*** In the subject line please indicate your name and the position
number 140/2018 ***

To receive full consideration, applications should be received by
January 31, 2019. Applications sent after this date will be
considered until the position is filled.


======================================
Position code number: 140/2018
Application deadline: 31 January 2019
=======================================


--
Prof. Dr. Hannes Frey
AG Rechnernetze
Universität Koblenz-Landau

**********************************************************
*
* 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] STACS 2019: Accepted Papers and First Call for Participation

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

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

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

The accepted papers and more information can be found via

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

The scientific program consists of three invited talks, two tutorial
talks, and presentations of 54 contributed papers (selected from more
than 260 submitted papers).
It will start on March 13 early afternoon with the two tutorials and it
will end on March 16 early afternoon.
More details concerning program arrangements etc. will be added soon.

The registration (via webpage above) is open.
Early registration deadline: January 31, 2019, AoE.


**********************************************************
*
* 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] Full Professorship 'Data Science Foundations' at TUHH, Hamburg, Germany

Hamburg University of Technology (TUHH) seeks applicants for a full
professorship in 'Data Science Foundations'. We are looking for a
distinguished researcher to establish and lead the new Institute of Data
Science Foundations and to represent Data Science in research and teaching
at TUHH. Applicants are expected to have an excellent track record in
basic research as well as a strong interest in interdisciplinary
collaborations with engineering work groups at TUHH. We particularly
welcome applications from scientists with a research focus on

- Methods of machine learning and particularly statistical learning
- Theory of data efficient machine learning methods
- Estimators and algorithms for multi-dimensional distributions in
engineering
- Methods of time series analysis and their application to processes in
engineering
- Resource-efficient machine learning for embedded and cyber-physical
systems
- Development of mathematical methods and algorithmic implementations

The successful candidate is expected to offer courses both at the
undergraduate and the graduate level in computer science and related
programs of study, and to actively participate in the development of
curricula offered by TUHH. The ability to teach undergraduate courses in
German is a plus.

Please, find the official job offer at
https://intranet.tuhh.de/aktuell/stellen/pdf/p_18_08_data_science_foundations_pdf.pdf
and feel free to contact the Head of Administration, Klaus-Joachim
Scheunert (phone: +49 40 428 78 3202) for further information regarding
the application process.
**********************************************************
*
* 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] (211-0014/18-2N) Tenure-track assistant Professor in Combinatorial Optimization at University of Denmark

*Tenure-track assistant Professor in Combinatorial Optimization *
*Department of Computer Science *
* Faculty of Science *
*University of Copenhagen *

The position is open from 1 August 2019 or as soon as possible thereafter.

The assistant professor will join the department's Image Section (
https://di.ku.dk/forskning/imagesection/) which hosts experts in image
analysis, computer vision,, computer simulation, discrete optimization, and
machine learning. The work ranges from theoretical analyses over algorithm
development to solving concrete problems for science, industry and society.
The section offers a research environment with much freedom: to a large
extent, you shape the research you work on and the ideas you pursue. The
section aspires to be a top research environment that bridges theory and
practice.

The successful applicant will perform innovative research in the area of
combinatorial optimization. The applicant is also expected to contribute to
ongoing research projects within data science, involving simulation,
bioinformatics, machine learning and image analysis, where in particular
solving complex NP-hard problems plays a key role. Moreover, the applicant
will contribute to basic as well as advanced courses, mainly in the area of
algorithmic discrete optimization.

Read more about the Department at
http://www.science.ku.dk/english/about-the-faculty/organisation/.

Please find the full job advertisement at http://employment.ku.dk/.
Only electronic applications are accepted.

Application due: 2/17/2019

*Apply
<https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1307&ProjectId=148630&DepartmentId=18971&MediaId=4642&SkipAdvertisement=true>*

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

[DMANET] Post Doc position on deep learning on graphs

Hello,

We offer a new post doctoral position in Rouen, France, to work on the
application of deep learning methods on graphs, especially within
chemoinformatics.

Contact postdoc-graphkernel@litislab.fr for any questions or check the
offer here : http://pagesperso.litislab.fr/~bgauzere/postdoc_deep.pdf


Best regards,

Benoit Gaüzère.

Brief Description of the position

Geometric deep learning: Application to chemoinformatics

Keywords: graph theory, deep learning, machine learning, Python.
Duration : 8 to 10 months

Context

Conversely to machine learning on data encoded as vectors, learning a
prediction function on graphs arises different scientific bottlenecks.
First of all, by their non euclidean representation, use of classic
machine learning methods is non trivial. Some methods propose to embed
the graphs onto an euclidean space. However, such projections induce a
loss of structural information which may be difficult to control.

In the two last decades, some methods aimed to design graphs kernels or
graph edit distance approximation methods to avoid an arbitrary
representation of graphs as vectors. GREYC and LITIS laboratories from
Normandie University collaborate on the definition of these methods.
Since the emerging of deep learning methods, most of proposed approaches
were defined using vectors as inputs. As a consequence, graphs were
mostly apart of the scope of application of these methods, and graph
based machine learning can not profit of impressive deep learning advances.
However, since the pioneer work of Gori and Scarselli [1, 2], some
propositions were made to bridge the gap between graphs and deep
learning. One particular application of graph based machine learning is
chemoinformatics. Molecular compounds are naturally encoded as graphs
and graph based methods are of thus methods of choice when predicting
properties of molecules. Within AGAC regional project, the two
laboratories GREYC and LITIS put in common their expertise to design and
develop new machine learning methods based on graphs to be used in
chemoinformatics. The project includes aspects of graph edit distance
and kernels. A logic continuation is to study how geometric deep
learning may help to improve results on chemoinformatics. To achieve
this goal, we are recruiting a post doctoral researcher for 8 to 10 months.

This project will be supervised in close collaboration by LITIS (Rouen,
France) and GREYC (Caen, France) laboratories which have a strong exper-
tise on graph based machine learning methods. The chemical expertise
will be brought by COBRA laboratory (Rouen, France).

Details on the position:

Location: LITIS laboratory in Rouen (Normandy).
Date of desired start January 2019
Duration: 8 to 10 months
Salary: about 2200 euros/month net
Contact: postdoc-graphkernel@litislab.fr

Required documents
• Updated CV
• cover letter explaining the candidate's qualifications for the position,
• Letter of support (if applicable)

References
[1] Marco Gori, Gabriele Monfardini, and Franco Scarselli. A new model
for learning in graph domains. In Neural Networks, 2005. IJCNN'05.
Proceedings. 2005 IEEE International Joint Conference on, volume 2,
pages 729–734. IEEE, 2005.
[2] Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner,
and Gabriele Monfardini. The graph neural network model. Trans. Neur.
Netw., 20(1):61–80, January 2009.
**********************************************************
*
* 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] Eight open positions, St.Petersburg State University

Dear Colleagues,

SPbSU once again announces well-paid TCS and math positions in their new program.
Don't miss this possibility to teach exceptionally bright and very motivated students!
The deadline is January 30.

These positions are open for English speakers.

Apologies for multiple postings.

Best regards,
Edward Hirsch
%---

Eight Positions in St.Petersburg

The St.Petersburg State University opens eight full-time
positions of various level (see below) for advanced
teaching within the new Mathematics and Theoretical
Computer Science program. The Scientific Council of this
program is headed by Stanislav Smirnov.

This time positions are available for teaching in English,
and the knowledge of Russian is optional.

1. Professor, salary level 217 412 RUB per month (2 Position)
2. Associate Professors (Docents), salary level 190 235 RUB per month (2 Positions)
3. Associate Professors (Docents), salary level 163 059 RUB per month (4 Positions)

(We encourage to apply to _all_ appropriate positions,
because the formal applications are processed separately.)

The undergraduate program is very selective, admission is limited to
55 top students per year, the first four enrollments
(2015, 2016, 2017, 2018) are first rate. In particular,
more winners of the all-Russian mathematical Olympiad
joined our program than any other similar program
in Russia.

In addition, a graduate (master's) program is starting
in 2019, open both to Russian and foreign students.
Graduate courses are taught in English.

The program is accomplished in close cooperation with
Chebyshev Laboratory (http://chebyshev.spbu.ru/en/)

Applicants are expected to have a strong research record
and to be able to teach in English.
The winners are expected to carry out research of high professional
standard, to teach, as well as to perform customary administrative duties
such as advising students, participating in committees,
organizing admissions, etc. The teaching load is up to
6 academic hours (=4.5 astronimic hours) per week for full
professors, and 8 academic hours (= 6 astronomic hours)
for associate and assistant professors.

Initial contract is normally signed for a period of up
to five years, and can be renewed by further 5 year terms.

The details of the formal application procedure can be
found at

http://hr.spbu.ru/konkursy-na-zameshchenie-dolzhnostej-professorsko-prepodavatelskogo-sostava/31233-matematika-20-12-2018.html

In addition to the formal application sent according to
the above document, all applicants are invited to send a
copy of their CV to
Maria Rossomakhina (secretariat@chebyshev.spb.ru)
mentioning any detail that could be relevant to the work
of the selection committee, such as, for instance, the
names of PhD students they supervised, if any, etc.

The minimum requirements for the positions are as follows:

Position 1 (Professor)

- the degree of D.Sc. (Doctor of Science) or habilitation
or any degree acknowledged by Russian Federation as a D.Sc.
degree;
- at least five refereed publications indexed
simultaneously in MathSciNet and Scopus in 2013-2018;
- at least five years of experience in research or teaching
(excluding Ph.D. studies but including work on research
projects/grants, even unpaid).

Position 2 (Associate Professor/Docent)

- the degree of Ph. D. (foreign) or Cand. Sci. (Russian);
- at least five refereed publications indexed
simultaneously in MathSciNet and Scopus in 2013-2018;
- at least three years of experience in research or teaching
(excluding Ph.D. studies but including work on research
projects/grants, even unpaid).

Position 3 (Associate Professor/Docent)

- the degree of Ph. D. (foreign) or Cand. Sci. (Russian);
- at least four refereed publications indexed
simultaneously in MathSciNet and Scopus in 2013-2018;
- at least three years of experience in research or teaching
(excluding Ph.D. studies but including work on research
projects/grants, even unpaid).

As mentioned above, responsibilities include lectures and
seminars, advising BSc, MSc and PhD students. Typical basic
subjects that successful applicants are expected to teach
range over all mathematics and theoretical computer science.

Applications and questions on formalities should be sent
to personnel officer Olga Ivanova. Less formal questions
should be sent to Maria Rossomakhina <secretariat@chebyshev.spb.ru>
who can also provide templates for the formal documents
to be submitted to the personnel officer, so we recommend to contact Maria first
and then send the official application.

Please check that your documents are processed normally
(and not lost!) by visiting

http://hr.spbu.ru/konkursy-na-zameshchenie-dolzhnostej-professorsko-prepodavatelskogo-sostava/31233-matematika-20-12-2018.html

a couple of days after sending them.

Deadline: 17:00 MSK, January 30, 2019.
Teaching starts: September 1, 2019.

Our staff elected in the previous application campaigns includes in particular
Youri Davydov (probability theory, previous job -- University of Lille),
Elena Khramtcova (computational geometry, Universite Libre de Bruxelles).
Alexander Okhotin (theoretical computer science, University of Turku),
Svetlana Puzynina (combinatorics, Universite Paris Diderot),
Sergey Tikhomirov (dynamical systems, Max Plank Institute for Mathematics in the Sciences, Leipzig),
Yury Volkov (algebra, Instituto de Matem��tica e Estat��stica, S��o Paulo).

The program page: http://math-cs.spbu.ru/



UNSUBSCRIPTION: This is one-time mailing.
Nevertheless if you do not wish to receive any news
regarding SPbSU positions, please reply to this mail
and we will remove you from the mailing list.

Thursday, December 20, 2018

[DMANET] Special Session CEC-51: Evolutionary Algorithms for Complex Optimization in the Energy Domain (CEC 2019, New Zealand)

Dear Colleagues,

We invite you to submit your research to our special session in the energy domain in the next CEC 2019. We would appreciate that you could forward this mail to potential contributors and colleagues. This activity is supported by EEE CIS Task Force 3 on Computational Intelligence in the Energy Domain (http://ci4energy.uni-paderborn.de/).

Check the full call below:

IEEE Congress on Evolutionary Computation – CEC 2019
10-13 June, Wellington, New Zealand
João Soares, Fernando Lezama, Zita Vale, and Markus Wagner
Website Link: http://www.gecad.isep.ipp.pt/ieee-CEC2019/CEC2019-SS

Aim and scope:

Keeping the world at current pace in what concerns energy demand is not possible with the limited world resources. Sustainability and efficiency are a crucial part of the process to enable this sustained growth. Moreover, adequate methods of energy optimization are highly relevant in the current paradigm playing a key role in the planning, operation, and control of energy systems. However, several optimization problems in the energy domain are complex by nature since they are highly constrained and face issues related to high-dimensionality, lack of information, noisy and corrupted data as well as real-time requirements. Under these circumstances, achieving good solutions in a reasonable amount of time remains a challenge in most problems. Even the most sophisticated exact solutions require workarounds that often lead to unsatisfactory performance and applicability of the algorithms.

Due to the difficulties of traditional algorithms to find feasible solutions for those complex problems in real-world conditions, Evolutionary Computation (EC) has emerged and demonstrated satisfactory performance in a wide variety of applications in the energy domain.

This is a follow-up of the previous special session in WCCI2018. Research work is welcome concerning complex real-world applications of EC in the energy domain. The problems can be focused on different parts of the energy chain (e.g., heating, cooling, and electricity supply) and different consumer targets (e.g., residential or industrial level). Problems dealing with uncertainty, dynamic environments, many-objectives, and large-scale search spaces are important for the scope of this special session. This special session aims at bringing together the latest applications of EC to complex optimization problems in the energy domain. Besides, this special session is linked to the competition on "Evolutionary Computation in Uncertain Environments: A Smart Grid Application". Therefore, participants are welcome to submit the results of their algorithms to our session.

Topics must be related to EC in the energy domain including, but not limited to:

- Electric and plug-in hybrid vehicles
- Electricity markets
- Energy scheduling
- Heat and electricity joint optimization problems
- Hydrogen economy problems
- Multi/many-objective problems in the energy domain
- Natural gas optimization problems
- Optimal power flow in distribution and transmission
- Residential, industrial and district cooling/heating problems
- Smart grid and micro-grid problems
- Solar and wind power integration and forecast
- Super grids problems (continental and trans-continental transmission system)
- Transportation & energy joint problems
- Distributed evolutionary approaches in the energy domain

Please note that you should select the CEC-51 under the main research topic during upload if you wish to submit to our SS.

Important deadlines:
January 7, 2019 Paper submission deadline
March 7, 2019 Author notification of acceptance or rejection
March 31, 2019 Deadline for receipt of final manuscript

Special Session Organizers:
Joao Soares, GECAD, Polytechnic of Porto
(jan@isep.ipp.pt)
Fernando Lezama, GECAD, Polytechnic of Porto
(flzcl@isep.ipp.pt)
Zita Vale, Polytechnic of Porto
(zav@isep.ipp.pt)
Markus Wagner, Adelaide University
(markus.wagner@adelaide.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] ICDT2020 CfP - First Submission Cycle

CALL FOR PAPERS

23rd INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2020)

Copenhagen, Denmark, March 30 - April 2, 2020

* About ICDT

ICDT is an international conferences series that addresses the
principles and theory of data management. Since 2009, it is annually
and jointly held with EDBT, the international conference on extending
database technology. See also https://databasetheory.org/icdt-pages.

* Broadening Scope

As ICDT strives to broaden its scope, ICDT 2020 will have a Reach Out
Track that calls for

- novel formal frameworks or directions for database theory and/or
- connections between principles of data management and other
communities.

The aim of the Reach Out track is to present novel and important
directions for database theory and to expand the scope and impact of
ICDT towards neighboring communities such as Database Systems,
Artificial Intelligence, Knowledge Representation, Machine Learning,
Programming Languages, Distributed Computing, and Operating Systems.
It is reasonable for articles submitted to this track to be be shorter
than regular ICDT submissions. Submissions will be judged mainly in
terms of their potential to lead to valuable and impactful theoretical
developments. We encourage authors to illustrate the potential impact
via convincing examples, preliminary results, and clearly specified
open problems.

* Topics of Interest

Every topic related to the principles of data management is relevant
to ICDT. Particularly welcome are contributions that connect data
management to theoretical computer science, and those that connect
database theory and database practice.

Examples of relevant topics include:
- Data mining, information extraction, information retrieval, and
database aspects of machine learning
- Data models, design, structures, semantics, query languages,
and algorithms for data management
- Distributed and parallel databases, cloud computing
- Databases and knowledge representation
- Graph databases, (semantic) Web data, and Web services
- Data streams and sketching
- Data-centric (business) process management and workflows
- Data and knowledge integration and exchange, data provenance, views,
and data warehouses
- Domain-specific databases (multimedia, scientific, spatial, etc)
- Data privacy and security, concurrency, and recovery

* Submission Cycles and Dates

ICDT has two submission cycles, the first providing the possibility
of a revision.

First cycle abstract deadline: March 27, 2019
Full paper submission deadline: April 3, 2019
Notification: May 29, 2019

Second cycle abstract deadline: September 15, 2019
Full paper submission deadline: September 23, 2019
Notification: December 5, 2019

* Program Committee

Program Committee Chair:
Carsten Lutz (University of Bremen)

Program Committee Members:
Marcelo Arenas (PUC, Santiago de Chile)
Michael Benedikt (University of Oxford)
Christoph Berkholz (HU Berlin)
Angela Bonifati (University Lyon 1)
Pierre Bourhis (University of Lille)
James Cheney (University of Edinburgh)
Graham Cormode (University of Warwick)
Victor Dalmau (UPF, Barcelona)
Claire David (University Paris-Est)
Floris Geerts (University of Antwerp)
Bas Ketsman (EPFL, Lausanne)
Daniel Kifer (Penn State University)
Leonid Libkin (University of Edinburgh)
Sebatian Maneth (University of Bremen)
Filip Murlak (University of Warsaw)
Reinhard Pichler (TU Vienna)
Andreas Pieris (University of Edinburgh)
Sebastian Rudolph (TU Dresden)
Thomas Schwentick (University of Dortmund)
Uri Stemmer (Ben-Gurion University, Negev)
Domagoj Vrgoc (PUC, Santiago de Chile)
Frank Wolter (University of Liverpool)

* Submission Instructions

Submissions will be electronic via EasyChair at
https://easychair.org/conferences/?conf=icdt2020.

Papers must be written in English and provide sufficient detail to allow
the program committee to assess their merits. The results must be
unpublished and not submitted for publication elsewhere, including
the proceedings of other symposia, workshops, and journals.

Papers must be submitted as a PDF document and use the LIPIcs style
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors).
Paper length is limited to 15 pages excluding references, both for
regular submissions and for the Reach Out Track. Additional details
may be included in a clearly marked appendix which will be read at the
discretion of the program committee. Online appendices are not
allowed. Papers that do not conform to these requirements may be
rejected without further consideration.

The proceedings will appear in the Leibniz International Proceedings
in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This
guarantees that the proceedings will be available under the gold open
access model, that is, online and free of charge while the authors
retain the rights over their work.

At least one author of each accepted paper is expected to register at
the conference and to present the paper.

* Awards

An award will be given to the Best Paper and to the Best Newcomer
Paper where `newcomer' refers to the field of database theory. The
latter award will preferentially be given to a paper authored only by
students and in that case be called Best Student-Paper Award. The
program committee reserves the right to not give any award and to
split an award among several papers. Papers co-authored by program
committee members are not eligible for an award.
**********************************************************
*
* 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 Position in Algorithmic Optimization at Trier University

The Research Training Group (RTG) 2126 "Algorithmic Optimization",
funded by the Deutsche Forschungsgemeinschaft (DFG), is accepting
applications for a

Postdoctoral position (TVL 13, 100%)
at Trier University
for the period of 1,5 years, starting as soon as possible

The research topics of the RTG are devoted to all mathematical aspects
of algorithmic optimization with an emphasis on applications, in
particular in large and big data as well as systems models from
economics. The candidate has just finished her/his PhD and can
demonstrate research ability in the research fields of the RTG in
combination with its application fields. She/he is expected to build
up a strong publication record and to shape the RTG's research
framework actively.

Applicants must hold a PhD degree (or equivalent) in mathematics or a
strongly related field at the time of hiring. They should be able to
communicate in English and should document their interest in the
scientific goals of the research program of the research training
group (Graduiertenkolleg). Excellent programming skills are a plus.

Applications should include:
- letter of motivation and a description of the research interests
- outline of a lecture series and a workshop proposal
- curriculum vitae
- two recent letters of reference (in English or German) to be sent
directly to the address given below
- contact information of at least one additional reference
- copies of earned degrees (in German or English translation)
- a mathematical writing sample (PhD thesis or preferably a published paper)

Applications from researchers of all nationalities are welcome. Trier
University strives to increase the share of women in research and
strongly encourages women to apply. Trier University is a certified
family friendly employer. Provided equal qualifications are
demonstrated, applicants with disabilities will be preferred.

Please compile all application material into one pdf or zip-file and
forward it via e-mail to:

Graduiertenkolleg Algorithmische Optimierung Mathematik - FB IV
Universität Trier
54286 Trier, Germany
Email: alop@uni-trier.de
Subject: RTG ALOP POST DOC

For full consideration, applications will be accepted until January
15, 2018, or until the position is filled.


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

[DMANET] LSD & LAW 2019 - Second Call

*London Stringology Days & London Algorithmic Workshop*

*LSD & LAW 2019
<https://emea01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnms.kcl.ac.uk%2Finformatics%2Fevents%2FLSD%26LAW19%2F&data=01%7C01%7C%7C604f56dce9404d1d2df008d640bbf451%7C8370cf1416f34c16b83c724071654356%7C0&sdata=dQGjiF4X7sJQGxNH%2B%2FnSphD2WcFa5dGTgbKPCASqqvc%3D&reserved=0>*

*London, UK February 7-8, 2019*

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

The Algorithms & Bioinformatics group at King's college invites well
renowned researchers, doctoral and post-doctoral students to submit
abstracts to present their work at the 27th London Stringology Days &
London Algorithmic Workshop, sponsored by the Department of Informatics
at King's College London.

*Aims:*
The workshop aims to bring together researchers to discuss their latest
developments and findings towards theoretical or applied aspects of
discrete algorithms, including string algorithms, automata
theory, combinatorics on words, Bioinformatics, graph and network
algorithms and computational complexity.


*Venue:*
LSD & LAW 2019 will take place in King's College London, situated in the
heart of London: Council Room, Strand campus (Strand, London WC2R 2LS).

*Scope:*
Topics include, but are not limited to:

* String Algorithms
* Automata Theory
* Combinatorics on Words
* Bioinformatics
*        Graph and Network Algorithms
* Computational Complexity

*Structure:*

Each session of this two-day workshop will feature an invited talk,
followed by oral presentations by researchers. Breaks will provide the
opportunity to network; lunch will be hosted in a local restaurant.

*Invited Speakers:*·

To be announced

*Submissions:*

We invite participants to submit abstracts to be considered for oral
presentations by 25th January 2019, using this form: Abstract submission
<https://emea01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdocs.google.com%2Fforms%2Fd%2Fe%2F1FAIpQLSeysKpO5rEyUhhDRIW5pLJschkJxQfhS9PVHRz-GPYgqC6GOA%2Fviewform&data=01%7C01%7C%7C604f56dce9404d1d2df008d640bbf451%7C8370cf1416f34c16b83c724071654356%7C0&sdata=33q3R5OjONMCSdUwXPMZ85BbZHOja3U10TWb85w7sgw%3D&reserved=0>.

*Special Issue:*

To be announced.


*Registration:*

Registration is free; please sign up using the following form:
Registration Form
<https://emea01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdocs.google.com%2Fforms%2Fd%2Fe%2F1FAIpQLScZEo9eWBclWqOWoUhswcsMuEJ3bN1glxib9P0jVMFSLwqZWg%2Fviewform&data=01%7C01%7C%7C604f56dce9404d1d2df008d640bbf451%7C8370cf1416f34c16b83c724071654356%7C0&sdata=9h06vVT85kVmwAqGrHxW9A55EVUxI3UfjICp9mPczoA%3D&reserved=0>.


*Deadlines:*

Abstract Submission: The deadline is  25th January 2019.

Registration: The deadline is 25th January 2019.


*Organising Committee:*

* Oluwole Ajala
* Mai Alzamel
* Lorraine Ayad
* Huiping Chen
* Costas S. Iliopoulos
* Grigorios Loukides (Chair)
* Solon P. Pissis


*Questions and Further Information:*
grigorios.loukides@kcl.ac.uk <mailto:grigorios.loukides@kcl.ac.uk>


*Webpage:*

https://nms.kcl.ac.uk/informatics/events/LSD&LAW19/
<https://emea01.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnms.kcl.ac.uk%2Finformatics%2Fevents%2FLSD%26LAW19%2F&data=01%7C01%7C%7C604f56dce9404d1d2df008d640bbf451%7C8370cf1416f34c16b83c724071654356%7C0&sdata=dQGjiF4X7sJQGxNH%2B%2FnSphD2WcFa5dGTgbKPCASqqvc%3D&reserved=0>


--
Solon P. Pissis

Senior Lecturer in Computer Science
Algorithms and Data Analysis group
Department of Informatics
King's College London
Bush House, Strand Campus, 30 Aldwych
London WC2B 4BG, UK

Tel: +44 (0)20 7848 1807 (Office)
+44 (0)7964 558764 (Mobile)
Skype: solonas13
Email: solon.pissis@kcl.ac.uk
WWW: https://nms.kcl.ac.uk/solon.pissis/


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