[DMANET] Workshop of the 6th International Conference on Internet Science : Internet as a complex network

*Call for Papers*

*Workshop of the **6^th **International Conference on Internet Science
(INSCI 2019)*
*Internet as a complex network*

*December5, 2019, Perpignan, France*

Email *: /_insci19@univ-perp.fr <mailto:insci19@univ-perp.fr>_/*

URL : _http://insci2019.univ-perp.fr/_

In conjunction with the 6^th International Conference on Internet
Science (INSCI 2019), the workshop */Internet as a complex network/*
will be held on the 5th of December.

The Internet is today having a significant impact on societies
throughout the world. With the emergence of the Internet of Everything,
there are now links between the Internet of Things, real-time processing
of data using AI and people, via social networks. Networks also have
rapidly evolving architectures (cloud computing systems, grid computing
systems, peer-to-peer, etc.). This workshop is intended to present and
discuss the design and implementation of algorithms for complex,
distributed networks such as the Internet.
Indeed the aim of this workshop is to facilitate the exchange of ideas
among researchers through presentations on the latest developments and
research in the area of IoE, data science, IoT, computer networks and
distributed networks.

*/Topics:/*

The topics are related but not limited to the following items:

* Education and Learning
* Platforms, Applications and Practices for Sustainability
* Big Data and Privacy
* Internet and Sustainability
* Network Design and Architecture
* Communication Protocols and Architectures
* Wireless Systems and Applications
* Cloud, Grid, Cluster and Internet Computing
* Graph Based Algorithms
* Efficient Algorithms for Social Computation
* Network Complexity
* Wireless Communication and Network
* Low-power Networks and Systems
* Embedded Systems and Networking
* Network Control and Management
* Internet Technology
* Multi-agent Systems and Applications
* Distributed Databases and Data Mining
* Mobile Computing
* Mobile Ad-hoc and Sensor Networks
* Network Performance Analysis and Evaluation
* Fault-tolerant Systems
* Parallel and Distributed Algorithms
* Smart Objects

*/Important dates:/*

Paper submission:May 13^th 2019
Notification of acceptance:July8^th 2019
Camera ready version: September 2^nd 2019
Registration deadline:September 23^th 2019

*/Paper submission guideline:/*

Authors are invited to submit original and unpublished work in either
long or short paper formats. These papers will go through multiple
review cycles and will be selected based on their quality, clarity, and
relevance to the theme of the workshop. All accepted papers will be
included in the INSCI 2019 conference proceedings.
Full paper submissions should not exceed 12 pages and short papers
should not exceed 6 pages (including all text, figures, references and
appendices).
Please add at the begining of the paper that it is aimed to Internet as
a complex network Conference.

*/Organizing commitee:/*

·Allyx Fontaine, Université de Guyane, French Guiana, France
     ·Patrick Hosein, The University of the West Indies, Trinidad and
Tobago

**********************************************************
*
* 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] FCT 2019 deadline extension

The deadline for submission of abstracts and full papers to the 22nd
International Symposium on Fundamentals of Computation Theory 2019
(FCT 2019) has been extended to April 14, 24.00 AoE (Anywhere
on Earth). For details see https://easychair.org/cfp/fct2019

**********************************************************
*
* 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] ESA 2019 Call for papers

ESA 2019 Final Call for papers
The 27th Annual European Symposium on Algorithms
September 9-13, 2019, Munich Germany

OVERVIEW

The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. It is organized in collaboration with the
European Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2019 (https://algo2019.ak.in.tum.de).

The symposium seeks original algorithmic contributions for problems with
relevant theoretical and/or practical applications. Papers with a strong
emphasis on the theoretical analysis of algorithms should be submitted to
Track A, while papers reporting on the results of extensive experimental
evaluations and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to Track B.

There will be a Best Student Paper Award as well as a Best Paper Award,
both sponsored by EATCS. In order for a paper to be considered for the Best
Student Paper Award, all of its authors are required to be students.

TOPICS

Papers presenting original research in all areas of algorithmic research
are sought, including but not limited to:

- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- Online algorithms
- Parameterized algorithms
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms

SUBMISSION AND PROCEEDINGS

Papers should be submitted electronically via the EasyChair submission
system.
(https://easychair.org/my/conference.cgi?conf=esa2019).

ESA 2019 proceedings will be published in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. The
proceedings chair is Grzegorz Herman, Jagiellonian University, Poland.

SUBMISSION GUIDELINES

Authors are invited to submit an extended abstract or full paper of at most
11 pages excluding the title page, references, and an optional appendix.
The submission should be typeset using an 11-point or larger font in a
single-column format with ample spacing throughout and 2.5cm margins all
around on A4-size or letter-size paper.
Proofs omitted due to space constraints must be placed in an appendix. This
appendix can even comprise an entire full version of the paper. The
appendix will be read by the program committee members at their discretion.
The main part of the submission should therefore contain a clear technical
presentation of the merits of the paper, including a discussion of the
paper's importance within the context of prior work and a description of
the key technical and conceptual ideas used to achieve its main claims.

These guidelines are strict: submissions deviating significantly from these
guidelines risk being rejected without consideration of their merits.
Papers should be submitted electronically via the EasyChair submission
system.

Results previously published (or scheduled for publication) in another
conference proceedings or journal will not be accepted at ESA. Simultaneous
submission to other conferences with published proceedings, or to both
tracks of ESA 2019, is also not permitted.

By submitting a paper the authors acknowledge that in case of acceptance,
at least one of the authors must register at ALGO 2019 or ESA 2019, attend
the conference, and present the paper.

DOUBLE-BLIND REVIEWING

The conference will employ a lightweight double-blind reviewing process.
Submissions should not reveal the identity of the authors in any way. In
particular, authors' names, affiliations, and email addresses should not
appear at the beginning or in the body of the submission. Authors should
ensure that any references to their own related work is in the third person
(e.g., not "We build on our previous work ..." but rather "We build on the
work of ...").

The purpose of the double-blind reviewing is to help PC members and
external reviewers come to an initial judgment about the paper without
bias, not to make it impossible for them to discover the authors if they
were to try.

Nothing should be done in the name of anonymity that weakens the submission
or makes the job of reviewing the paper more difficult. In particular,
important references should not be omitted or anonymized. In addition,
authors should feel free to disseminate their ideas or draft versions of
their paper as they normally would. For example, authors may post drafts of
their papers on the web, submit them to arXiv, and give talks on their
research ideas. Authors with further questions on double-blind reviewing
are encouraged to contact the PC chairs.

IMPORTANT DATES

- Submission deadline: Friday April 26, 2019
- Notification deadline: Monday 23 June, 2019
- Final version deadline: Friday 5 July, 2019
- ESA Symposium: September 9-11, 2019
- ALGO Conference: September 9-13, 2019

PROGRAM COMMITTEE: TRACK A (DESIGN AND ANALYSIS)

- Aditya Bhaskara (University of Utah)
- Sayan Bhattacharya (University of Warwick)
- Sebastian Brandt (ETHZ)
- Raphaël Clifford (University of Bristol)
- Éric Colin de Verdière (CNRS and Université Paris-Est)
- Moran Feldman (The Open University of Israel)
- Jugal Garg (University of Illinois at Urbana-Champaign)
- Sariel Har-Peled (University of Illinois at Urbana-Champaign)
- Pinar Heggernes (University of Bergen)
- Stacey Jeffery (CWI)
- Sagar Kale (EPFL)
- Matya Katz (Ben-Gurion University)
- Tsvi Kopelowitz (Bar-Ilan University)
- Bundit Laekhanukit (Shanghai University of Finance and Economics)
- Silvio Lattanzi (Google )
- Pasin Manurangsi (UC Berkeley)
- Claire Mathieu (CNRS, Paris )
- Nicole Megow (University of Bremen)
- Shay Moran (Princeton University)
- Rad Niazadeh (Stanford University)
- Ely Porat (Bar-Ilan University)
- Eva Rotenberg (Technical University of Denmark)
- Aviad Rubinstein (Stanford University)
- Barna Saha (University of Massachusetts Amherst)
- Pascal Schweitzer (TU Kaiserslautern)
- David Shmoys (Cornell University)
- Sahil Singla (Princeton University)
- Cliff Stein (Columbia University)
- Ola Svensson (EPFL) [Chair]
- Aravindan Vijayaraghavan (Northwestern University)
- Magnus Wahlström (Royal Holloway, University of London)
- Justin Ward (Queen Mary University of London)
- Standa Živný (University of Oxford)

PROGRAM COMMITTEE: TRACK B (ENGINEERING AND APPLICATIONS)

- Dan Alistarh (IST Austria)
- Michael A. Bender (Stony Brook University) [Chair]
- Anne Benoit (Ecole Normale Supérieure de Lyon)
- Jon Berry (Sandia National Laboratories)
- Timo Bingmann (Karlsruhe Institute of Technology)
- Kevin Buchin (TU Eindhoven)
- Matteo Ceccarello (IT University of Copenhagen and BARC)
- Martín Farach-Colton (Rutgers University)
- Rati Gelashvili (NeuralMagic)
- Seth Gilbert (National University of Singapore)
- Piyush Kumar (Florida State University)
- Rob Johnson (VMware Research)
- Irina Kostitsyna (TU Eindhoven)
- Jing Li (New Jersey Institute of Technology)
- Samuel McCauley (Bar Ilan University)
- John Owens (UC Davis)
- Prashant Pandey (Carnegie Mellon University)
- Tao B. Schardl (Massachusetts Institute of Technology)
- Julian Shun (Massachusetts Institute of Technology)
- Francesco Silvestri (University of Padova)
- Sebastian Wild (University of Waterloo)
- Maxwell Young (Mississippi State University)

STEERING COMMITTEE

- Yossi Azar (Tel-Aviv University)
- Hannah Bast (Albert-Ludwigs-Universität Freiburg) [Chair]
- Michael Bender (Stony Brook University)
- Artur Czumaj (University of Warwick)
- Monika Henzinger (Universität Wien)
- Robert Krauthgamer (The Weizmann Institute of Science)
- Aleksander Madry (Massachusetts Institute of Technology)
- Kirk Pruhs (University of Pittsburgh)
- Christian Sohler (Technische Universität Dortmund)
- Ola Svensson (EPFL)

**********************************************************
*
* 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 in Algorithms at the University of Bergen (Norway)

Hi,

the Department of Informatics at the University of Bergen (Norway) has
announced a 3 years
PhD position in Algorithms
<https://www.jobbnorge.no/en/available-jobs/job/168659/phd-position-in-algorithms>.
The focus of the position will be on the algorithmic aspects of automated
reasoning, and in particular, in the algorithms aspects of automated
theorem proving. The position is
part of the project

"Automated Theorem Proving from the Mindset of Parameterized Complexity
Theory",

which is funded by the Research Council of Norway. The deadline for the
application is* 05/May/2019*.
Later applications will not be accepted. You are recommended to apply as
soon as possible. The starting
date is 01/August/2019, or as soon as possible thereafter. The full
announcement for the position, including
instructions on how to apply, can be found here
<https://www.jobbnorge.no/en/available-jobs/job/168659/phd-position-in-algorithms>
.

If you are interested in the position, please see also the FAQ below.
Please feel free to contact me if you
have any further questions.

Mateus de Oliveira Oliveira
mateus.oliveira@uib.no

Best regards,

Mateus

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

*FAQ: *

*About Bergen: *

*Q:* So how does Bergen look like?
*A:* Like in these pictures
<https://www.google.com/search?tbm=isch&source=hp&biw=1620&bih=921&ei=hGysXNG3BYGQmwWdmYmwCw&q=bergen&oq=bergen&gs_l=img.3..35i39l2j0l8.654.1748..1985...0.0..1.60.273.6......1....1..gws-wiz-img.....0.A4QrZfKquqQ>
.

*Q:* Is Bergen Cold?
*A:* Not so much. Please read this article
<https://en.wikipedia.org/wiki/Bergen#Climate>in Wikipedia for a lot
of information about climate in Bergen. The temperatures shown
in the average high and average low feel just right.

*About Requirements: *

*Q:* Do I need to have completed my Master's degree before applying?
*A: *No. But you will need to have it completed before 01/August/2019.
You cannot be employed at a PhD position without a Master degree (or
equivalent).

*Q:* Do I need to have publications to apply for the position?
*A:* Previous publication is not a requirement, but of course, they may be
used to access your
ability to produce scientific work. So you are encouraged to attach any
publication/preprint/thesis
in which you are a co-author. Please see the formal announcement for more
information.

*Q:* Do I need to know Parameterized Complexity, and or Automated Theorem
Proving?
*A:* Previous knowledge of parameterized complexity theory and/or automated
theorem proving
is not a requirement, but of course it counts positively. The most
important thing is that the applicant
has a strong background in a relevant subfield of theoretical computer
science. Examples of relevant
fields are: algorithms, type theory, automata theory, computational logic,
combinatorics, graph theory, etc.

*Q:* Do I need to know how to program?
*A:* You will need to be able to program. An estimated workload is about
70% of working on theory and
30% on programming.

*About the application: *

*Q: *What is the most important thing in the application?
*A:* The most important part of the written application will be your
motivation letter, explaining why you are
a great candidate for the position. Statements made on the letter should be
corroborated by objective evidence,
like course grades, publications, etc. Selected candidates may be called
for an interview. Interpersonal skills, such
as the ability to collaborate will have a good weight in the selection
process.

*Q:* Should I attach letters of reference?
*A:* This is not a requirement. But you need to name two references, which
may or may not be contacted.

**********************************************************
*
* 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] International Summer School on "Preference, Decisions and Games", Paris, June 25-28.

Call for Participation: International Summer School
on "Preferences, Decisions and Games"

June 25-28, 2019, LIP6, Sorbonne University, Paris, France

https://decisionschool.lip6.fr/

Purpose and Intended Audience
------------------------------
The purpose of the Summer School is to bring together PhD students,
postdoctoral researchers, and
researchers interested in mathematical and computational aspects of
preference modeling, decision making
and game theory. We expect participants with different backgrounds
(Operations Research, Artificial
Intelligence, Economics). During 4 days, the instructional program will
involve two types of activities:
lectures given by prominent scientists and workshops during which
participants to the school will have the
opportunity to present their research and exchange ideas.

Lectures
-------------------
    Denis Bouyssou (CNRS, Paris Dauphine University): Preference Modeling.
    Matthias Ehrgott (Lancaster University): Multiobjective
Combinatorial Optimization.
    Jürgen Eichberger (University of Heidelberg): Decision Under
Uncertainty and Risk.
    Michel Grabisch (Paris 1 University): Preference Aggregation with
Interacting Criteria.
    Eyke Hüllermeier (Paderborn University): Preference Learning and
Recommendation.
    Christophe Labreuche (Thalès Research and Technology):
Multicriteria Decision Making in practice.
    Jérôme Lang (CNRS, Paris Dauphine University): Computational Social
Choice.
    Patrice Perny (Sorbonne University): Preference-based Optimization.
    Agnieszka Rusinowska (CNRS, CES, Paris School of Economics):
Opinion Dynamics in Networks.
    Philippe Solal (Jean Monnet University): Game Theory.
    Stéphane Zuber (CNRS, CES, Paris School of Economics): Inequality
Measurement.
------------------

The school will be held at Sorbonne University in the center of Paris
and is supported by the CNRS (Ecole thematique du CNRS) and by GDR RO
(French national group in Operational Research) and LIP6 lab.
Information on the organisation, application procedure and fees are
given on https://decisionschool.lip6.fr/

Important Dates :
---------------------
Dealine for application : April 30th, 2019.
Notification of acceptance: May 15th, 2019.

Contact: patrice.perny@lip6.fr | denis.bouyssou@dauphine.fr  |
michel.grabisch@univ-paris1.fr

**********************************************************
*
* 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 in Parameterized Algorithms at Utrecht University

A PhD position is available in the Algorithms and Complexity group of Prof. Hans Bodlaender to conduct research in the field of Parameterized Algorithms. The candidate will work under the supervision of Dr. Erik Jan van Leeuwen.

The successful candidate will work on new algorithmic methods and complexity lower bounds for graph problems, particularly coming from the area of network design. We are looking for candidates with a strong interest and background in techniques from parameterized algorithms, computational complexity, and graph theory.

The PhD position is for 5 years with full-time employment. Of the 5 years, 70% time is allocated for research and 30% for teaching. This allows candidates to start developing a balanced academic career as independent researchers and competent teachers.

Details about the requirements for the position, conditions of employment, and Utrecht University can be found in the full advertisement on Academic Transfer:
https://www.academictransfer.com/en/53483/phd-positions-information-and-computing-sciences-30-fte/

The deadline for applications is this Friday, April 12.
**********************************************************
*
* 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] First announcement: Kolkom 2019 (Colloquium on Combinatorics)

Dear colleagues,

we invite you to the 38th conference "Colloquium on Combinatorics" (Kolkom 2019), which takes place at Paderborn University, on November 08-09, 2019.

The Colloquium on Combinatorics is a forum that brings together young researchers and well established scientists. The colloquium will cover all parts of Combinatorics and Discrete Mathematics in a broad sense, including combinatorial aspects in Algebra, Geometry, Optimization and Computer Science.

Keynote speakers are

Marco Buratti (Università degli Studi di Perugia, Italy);
Miguel Angel Fiol (Universitat Politècnica de Catalunya · BarcelonaTech (UPC), Spain);
Nicole Megow (University of Bremen, Germany);
Alexander Pott (Otto von Guericke University Magdeburg, Germany);
Benny Sudakov (ETH Zurich, Switzerland )

For more information see www.kolkom.de.

We hope seeing you in Paderborn in November!

Eckhard Steffen and Kai-Uwe Schmidt

**********************************************************
*
* 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] 2 Open Positions in Data Analytics/Engineering

We have two open positions in the Data Analytics team at the Water
Corporation in Perth, Australia. Both have AU$120k+ salaries. We have
diverse problems to solve at the Water Corporation, with opportunities to
have direct impact on environmental, cost saving and customer delivery
outcomes.

Feel free to contact me privately if you are interested, or apply directly.

https://www.seek.com.au/job/38675867

https://www.seek.com.au/job/38695641?cid=ios-share

**********************************************************
*
* 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 at Aix-Marseille University on foundations of automata networks

Dear colleagues,

Hereafter, you will find an announcement for an 18 months postdoc position in the Natural Computation research group (https://cana.lis-lab.fr) at LIS (Laboratoire d'Informatique et Systèmes - Laboratory of Computer and System Sciences) in Marseille (Luminy), France. Of course, feel free to forward it to anybody who might be interested.

Sincerely,
Sylvain Sené

=====

** Post-doc announcement **

(*) Funding ANR project:

FANS - Foundations of Automata Networks
Webpage: http://sylvain.sene.pages.lis-lab.fr/fans/
Duration: 48 months from January 2019.

(*) Postdoc position in FANs project:

A postdoc position for 18 months (possibly renewable for 6 more months) is opened, starting from September 2019 (or later). The postdoc fellow will join the ANR-funded project FANs that aims at studying dynamics, complexity and computabilty aspects of automata networks (or finite dynamical systems, including for instance Boolean networks). More details on FANs are available on the webpage of the project (see above).

(*) Topics and requirements for applicants

We are looking for young researchers who can contribute to the research
topics of FANs. Candidates should hold a PhD in computer science or
mathematics (or be close to complete and defend their PhD), with a strong background in theoretical computer science, especially in discrete dynamical systems, complexity theory, computability theory, and combinatorics.

The successful applicant will conduct research in Luminy, Marseille, with members of the project from CANA research group of LIS (https://cana.lis-lab.fr), and their close collaborators of the GDAC research group of the Institute of Mathematics (I2M).

(*) Application submission guidelines

Applications should be sent to Sylvain Sené before the 1st of June 2019 in an email entitled "FANs postdoc application", providing a detailed curriculum with publication list and a research statement. Recommandation letters are also expected to be sent directly to Sylvain Sené at [sylvain dot sene at lis-lab dot fr].

Potential candidates are invited to contact the project coordinator together with other permanent members of the FANs project for any question related to the application. Once again, the start date is not mandatorily September 2019; as a consequence, potential candidates can ask for starting later.

--

Sylvain Sené
Aix-Marseille Univ., LIS

**********************************************************
*
* 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 scholarships on software optimisation and analytics at University College London

Dear Colleagues,

I'd be grateful if you could distribute the following announcement at your institution and to anyone you think might be interested in applying for a PhD position:


***

The CREST research centre at University College London offers several PhD studentships (full-time) on the following projects:


- Automated Software Specialisation Using Genetic Improvement led by Dr. Justyna Petk

http://www0.cs.ucl.ac.uk/staff/J.Petke/news.html


- Evolutionary Program Improvement Collaborators (EPIC) led by Prof. Mark Harman

http://www0.cs.ucl.ac.uk/staff/F.Sarro/PhDEPIC.html


- Software Analytics/Search-based Software Engineering led by Dr. Federica Sarro

http://www0.cs.ucl.ac.uk/staff/F.Sarro/PhDScholarship.html


Next round of application deadline is April 17th.


Please, contact us before the deadline to express your interest in the above positions or for any other informal enquiries.

***

Thank you,

Federica

Dr. Federica Sarro
Associate Professor
Department of Computer Science
University College London
**********************************************************
*
* 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] MFCS 2019 Second Call for Papers - submission deadline April 22nd

Second Call for Papers
The 44th International Symposium on
Mathematical Foundations of Computer Science
MFCS 2019

August 26-30, 2019, Aachen, Germany

http://tcs.rwth-aachen.de/mfcs2019

The MFCS conference series has been organized since 1972. Traditionally,
the conference moved between the Czech Republic, Slovakia, and Poland,
while since 2013, the conference travels around Europe. In 2019 it will
take place in Germany.

MFCS is a high-quality venue for original research in all branches of
theoretical computer science. The broad scope of the conference
encourages interactions between researchers who might not meet at more
specialized venues. MFCS 2019 consists of invited lectures and
contributed talks, selected by an international program committee of
researchers focusing on diverse areas of theoretical computer science.
The conference will be accompanied by workshops.

INVITED SPEAKERS

- Jérôme Leroux (LaBRI, Talence)
- Daniel Lokshtanov (University of California at Santa Barbara (UCSB))
- Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken)
- Alexandra Silva (University College London)
- Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai)

IMPORTANT DATES

Submission Deadline: Monday, April 22nd, 2019 (AoE)
Notification: Wednesday, June 12th, 2019
Conference: Monday, August 26th, to Friday, August 30th, 2019
Workshops: Friday, August 30th, to Saturday, August 31st, 2019

SUBMISSION GUIDELINES

Papers should be submitted electronically through EasyChair at
https://easychair.org/conferences/?conf=mfcs2019

Submissions should be prepared according to the following instructions:
Papers should be formatted using the LIPIcs style. Length: up to 12
pages (excluding references and an optional appendix). References and an
optional appendix can go beyond the 12 pages (the appendix will be
consulted at the discretion of the program committee). It is mandatory
to use pdflatex.

No prior publication or simultaneous submission to other conferences or
journals are allowed (except preprint repositories such as arXiv or
workshops without formal published proceedings).

PUBLICATION

MFCS 2019 proceedings will be published in LIPIcs (Leibniz International
Proceedings in Informatics) under an open source license (as in previous
years).

LIST OF TOPICS

We encourage submission of original research papers in all areas of
theoretical computer science, including (but not limited to) the following:

- algebraic and co-algebraic methods in computer science
- algorithms and data structures
- automata and formal languages
- bioinformatics
- combinatorics on words, trees, and other structures
- computational complexity (structural and model-related)
- computational geometry
- computer-aided verification
- computer-assisted reasoning
- concurrency theory
- cryptography and security
- databases and knowledge-based systems
- formal specifications and program development
- foundations of computing
- logics in computer science
- mobile computing
- models of computation
- networks (incl. wireless, sensor, ad-hoc networks)
- parallel and distributed computing
- quantum computing
- semantics and verification of programs
- theoretical issues in artificial intelligence
- types in computer science

COMMITTEES

PROGRAM COMMITTEE

- Peter Rossmanith (RWTH Aachen University, chair)
- Pinar Heggernes (University of Bergen, co-chair)
- Joost-Pieter Katoen (RWTH Aachen University, co-chair)
- Nathalie Bertrand (INRIA)
- Benedikt Bollig (LSV, ENS Cachan, CNRS)
- Marthe Bonamy (CNRS, LaBRI, Bordeaux)
- Flavia Bonomo (Universidad de Buenos Aires)
- Franck van Breugel (University of York)
- Véronique Bruyère (University of Mons)
- Tiziana Calamoneri (Sapienza University of Rome)
- Supratik Chakraborty (IIT Bombay)
- Christophe Crespelle (Université Claude Bernard Lyon 1)
- Pedro R. D'Argenio (Universidad Nacional de Córdoba)
- Khaled Elbassioni (Masdar Institute)
- Edith Elkind (University of Oxford)
- Leah Epstein (University of Haifa)
- Henning Fernau (Univ. Trier)
- Dana Fisman (University of Pennsylvania)
- Fedor Fomin (Department of Informatics, University of Bergen)
- Serge Gaspers (UNSW Sydney and Data61, CSIRO)
- Archontia Giannopoulou (TU Berlin)
- Konrad Kazimierz Dabrowski (Durham University)
- Eun Jung Kim (CNRS - Paris Dauphine)
- Erik Jan van Leeuwen (Utrecht University)
- Radu Mardare (Aalborg University)
- Arnaud Mary (LBBE)
- Roland Meyer (TU Braunschweig)
- Martin Milanič (UP IAM and UP FAMNIT, University of Primorska)
- Neeldhara Misra (Indian Institute of Science)
- Andrzej Murawski (University of Oxford)
- Michał Pilipczuk (University of Warsaw)
- M. S. Ramanujan (University of Warwick}
- Dieter Rautenbach (University of Ulm)
- Felix Reidl (University of London)
- Davide Sangiorgi (University of Bologna)
- Ignasi Sau (CNRS, LIRMM, Montpellier)
- Lutz Schröder (Friedrich-Alexander-Universität Erlangen-Nürnberg)
- Hadas Shachnai (Technion)
- Mahsa Shirmohammadi (CNRS & LIS)
- Pawel Sobocinski (University of Southampton)
- B Srivathsan (Chennai Mathematical Institute)
- Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
- Tarmo Uustalu (Reykjavik University)
- Igor Walukiewicz (CNRS, LaBRI)
- Mingsheng Ying (University of Technology, Sydney)
- Meirav Zehavi (Ben-Gurion University)

ORGANIZING COMMITTEE

- Birgit Willms (chair)
- Jan Dreier
- Henri Lotze
- Jip Spel
- Matthias Volk

VENUE

The conference will be held in the SuperC Building of RWTH Aachen
University near the city center of Aachen, Germany.

CONTACT

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

[DMANET] WORDS 2019, last call for papers (Extended Deadline)

WORDS 2019
12th International Conference
Loughborough, September 9–13, 2019
http://words2019.lboro.ac.uk

*Announcement*
WORDS is a biannual international conference covering the mathematical theory of words (sequences of symbols) from all points of view: combinatorial, algebraic, algorithmic, as well as its applications to biology, linguistics, physics, and others.

The previous WORDS conferences have taken place in Rouen (1997, 1999), Palermo (2001), Turku (2003, 2013), Montreal (2005, 2017), Marseille (2007), Salerno (2009), Prague (2011), and Kiel (2015).

The 12th International Conference on Words, WORDS 2019 will take place on September 9-13 2019 at Loughborough University, UK (http://www.lboro.ac.uk/departments/compsci/).

Co-chairs of this edition are Robert Mercaș and Daniel Reidenbach.

*Invited Speakers*
Florin Manea (Kiel)
Svetlana Puzynina (St. Petersburg)
Antonio Restivo (Palermo)
Gwenaël Richomme (Montpellier)
Aleksi Saarela (Turku)
Kristina Vuskovic (Leeds)

*Program Committee*
Marie-Pierre Béal (Paris)
Srecko Brlek (Montreal)
Émilie Charlier (Liège)
Volker Diekert (Stuttgart)
Gabriele Fici (Palermo)
Anna Frid (Marseille)
Amy Glen (Murdoch)
Štěpán Holub (Prague)
Shunsuke Inenaga (Kyushu)
Robert Mercas (Loughborough) co-chair
Dirk Nowotka (Kiel)
Jarkko Peltomäki (Turku)
Edita Pelantová (Prague)
Narad Rampersad (Winnipeg)
Daniel Reidenbach (Loughborough) co-chair
Jeffrey Shallit (Waterloo)
Arseny Shur (Yekaterinburg)

*Important dates*
Submission deadline: April 23 (AOE), 2019 (EXTENDED DEADLINE)
Notification to authors: May 20, 2019
Deadline for final versions: June 3, 2019
Conference: September 9–13, 2019

*Submission guidelines*
Submitted papers should not exceed 12 pages and be prepared according to the following guidelines and LNCS-style LaTeX2e. All proofs omitted due to space constraints should be given in an appendix or made accessible through a reliable link to a freely available electronic preprint (updated before submission). These will be read at the discretion of the program committee.

Only original submission which have not been submitted for publication elsewhere will be considered. Papers should be submitted electronically in PDF through the EasyChair system: https://easychair.org/conferences/?conf=words2019

*More information*
are available on the conference website http://words2019.lboro.ac.uk/, where different PDF versions of the conference poster can also be downloaded.

*Contact*
Words2019@lboro.ac.uk

The conference is organized by the Department of Computer Science, School of Science,
Loughborough University, 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] PhD position in Operations Research at KU Leuven (ref. BAP-2019-189)

The research group ORSTAT (Operations Research & Business Statistics) of KU Leuven (Belgium) has a vacancy for one full-time PhD scholarship starting in September 2019, for a period of four years. The researcher to be hired will work in the field of operations research (OR) under the supervision of prof. Roel Leus; this work should lead to a PhD degree. Some keywords of our research area are: combinatorial optimization, integer (linear) programming, stochastic and robust optimization, algorithm design, ... The candidate will work on the development of models and algorithms at the interface of discrete optimization, scheduling, project management and innovation. He/she will find a dynamic and pleasant working environment, in a group that is actively involved in scientific research at the highest international level.
Candidates will be expected to participate in seminars and conferences, be internationally mobile and to enroll in our PhD program. The candidate can be asked to give guidance to Bachelor and Master students, to be involved in teaching activities and to supervise exams.
Candidates should have a strong interest in OR and preferably hold a Master's degree in Business Engineering (Handelsingenieur), Mathematics, Computer Science, Industrial Engineering, Operations Research, or equivalent. Graduation with honors in preliminary studies is a requirement, as well as an appropriate command of written and spoken English. Experience with at least one programming language is an asset. Students that are currently in the final year of their Masters are especially encouraged to apply.
We offer an employment as full-time doctoral scholar for 1 year, renewable up until max. 4 years after positive evaluation. The tentative starting date is September 16, 2019, depending on the availability of the candidate.
For more information please contact prof. dr. Roel Leus via email: roel.leus@kuleuven.be<mailto:roel.leus@kuleuven.be> .
You can apply for this job no later than May 03, 2019 via the online application tool at the webpage https://www.kuleuven.be/personeel/jobsite/jobs/55101540?hl=en&lang=en (ref. BAP-2019-189)
KU Leuven seeks to foster an environment where all talents can flourish, regardless of gender, age, cultural background, nationality or impairments. If you have any questions relating to accessibility or support, please contact us at diversiteit.HR@kuleuven.be<mailto:diversiteit.HR@kuleuven.be> .

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

[DMANET] 2nd International Conference on Decision Making in Manufacturing and Services (DMMS 2019)

Dear Colleague!

The Organizing Committee would like to cordially invite you to attend
the 2nd International Conference on Decision Making in Manufacturing
and Services (DMMS 2019) which will take place in Zakopane, Poland, in
September 26-29, 2019, hosted by the Department of Operations Research,
Faculty of Management, AGH University of Science and Technology.
For detailed information, please visit our website:
www.dmms.zarz.agh.edu.pl

With warm regards,
Tadeusz Sawik
Chairman of Organizing Committee

--
Organizing Committee
of the 2nd International Conference on Decision Making in Manufacturing
and Services (DMMS 2019)
AGH University of Science and Technology
Faculty of Management
Dep. of Operations Research
30, Mickiewicza Av., 30-059 Kraków

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

[DMANET] Second Call for Papers: RANDOM / APPROX

Second Call for Papers:
23rd RANDOM & 22nd APPROX 2019

Sep 20-22, 2019
MIT, Cambridge MA

http://randomconference.wordpress.com<http://randomconference.wordpress.com/>
http://approxconference.wordpress.com<http://approxconference.wordpress.com/>

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

Paper submission deadline: May 3, 2019

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

SCOPE
The 23rd International Workshop on Randomization and Computation (RANDOM 2019) and the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2019) will be held on Sep 20-22, 2019 at MIT. RANDOM 2019 focuses on applications of randomness to computational and combinatorial problems, while APPROX 2019 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.

TOPICS
Papers are solicited in all research areas related to randomization and approximation, including but not limited to:

RANDOM
* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* smoothed analysis
* property testing
* computational learning theory

APPROX
* approximation algorithms
* hardness of approximation
* small space, sub-linear time and streaming algorithms
* online algorithms
* approaches that go beyond worst-case analysis
* distributed and parallel approximation
* embeddings and metric space methods
* mathematical programming methods
* spectral methods
* combinatorial optimization
* algorithmic game theory, mechanism design and economics
* computational geometric problems
* approximate learning

IMPORTANT DATES
Submissions: May 3, 2019
Notifications: June 20 ,2019
Camera ready: July 1, 2019

SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers: http://www.easychair.org/conferences/?conf=approx2019
For submission of RANDOM papers: http://www.easychair.org/conferences/?conf=random2019

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission). The submission must be received by 15:00pm (PDT) of May 3, 2019 for your submission to be considered.

Submission Format: Submissions should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins, page numbers, and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee. Simultaneous submission to other conferences with published proceedings is not allowed.

PROCEEDINGS
Accepted papers will be published in the online proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work.

RANDOM Program Chair
Dimitris Achlioptas, UC Santa Cruz/Google
optas@cs.ucsc.edu

APPROX Program Chair
Laszlo A. Vegh, LSE
l.vegh@lse.ac.uk

Local Organizing Committee Chair
Ronitt Rubinfeld, MIT
ronitt@csail.mit.edu

RANDOM Steering Committee

Oded Goldreich, Weizmann
Cris Moore, SFI
Anup Rao, U Washington
Omer Reingold, Stanford, Steering Committee Chair
Dana Ron, Tel Aviv University
Ronitt Rubinfeld, MIT
Amit Sahai, UCLA
Ronen Shaltiel, U Haifa, Publicity Chair
Alistair Sinclair, UC Berkeley
Paul Spirakis, U Liverpool

APPROX Steering Committee

Klaus Jansen, U Kiel
Samir Khuller, U Maryland
Monaldo Mastrolilli, IDSIA

PROGRAM COMMITTEES

RANDOM
Dimitris Achlioptas, UC Santa Cruz/Google
Nikhil Bansal, Eindhoven/CWI
Paul Beame, U Washington
Ivona Bezakova, Rochester IT
Klim Efremenko, Ben Gurion
Uri Feige, Weizmann
Anna Gilbert, U Michigan
Subhash Khot, NYU
Antonina Kolokova, MUN
Ravi Kumar, Google
Or Meir, U Haifa
Prasad Raghavendra, UC Berkeley
Noga Ron-Zewi, U Haifa
Sofya Raskhodnikova, Boston University
C. Seshadhri, UC Santa Cruz
Devavrat Shah, MIT
Christian Sohler, TU Dortmund/Google
Kunal Talwar, Google
Thomas Vidick, California Institute of Technology
Jan Vondrak, Stanford
David Woodruff, CMU

APPROX
Nima Anari, Stanford
Kristof Berczi, Eotvos University
Deeparnab Chakrabarty, Dartmouth
Karthekeyan Chandrasekaran, UIUC
Michael Dinitz, Johns Hopkins
Leah Epstein, U Haifa
Samuel Fiorini, ULB
Swati Gupta, Georgia Tech
Bundit Laekhanukit, SUFE
Joseph Seffi Naor, Technion
Huy Le Nguyen, Northeastern
Kanstantsin Pashkovich, U Ottawa
Barna Saha, UMass Amherst
Bruce Shepherd, UBC
David B. Shmoys, Cornell
He Sun, U Edinburgh
Laszlo A. Vegh, LSE

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

[DMANET] CFP: Workshop on Learning in Presence of Strategic Behavior at EC 2019

Workshop on Learning in Presence of Strategic Behavior at EC 2019
(co-located with STOC at FCRC 2019)
June 28, 2019 at Phoenix, AZ, USA

Submission deadline: May 1.

Website: https://sites.google.com/view/eclearning2019/

The ACM EC Workshop on Learning in Presence of Strategic Behavior will
be held in conjunction with ACM Federated Computing Research
Conference (FCRC) 2019, Phoenix, Arizona on June 28, 2019.

The main goal of this workshop is to address current challenges and
opportunities that arise from interactions of learning systems with
social and strategic agents. This workshop aims at bringing together
members of different communities; including economics, machine
learning, theoretical computer science, and social computing; to share
recent results, discuss important directions for future research, and
foster collaborations. In particular, we expect our workshop to be of
interest to the larger research community present at ACM FCRC 2019,
including participants of EC, COLT, and STOC.

The workshop will include 4-5 invited talks by experts from machine
learning, theoretical computer science, economics, and operations
research, as well as contributed talks and posters.

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

Papers from a rich set of theoretical and applied perspectives are
invited. Some areas of interest at the interface of learning and
strategic behavior include, but are not limited to:

1. Learning from data that is produced by agents who have vested
interest in the outcome or the learning process. Examples of this
include learning a measure of quality of universities by surveying
members of the academia who stand to gain or lose from the outcome, or
when a GPS routing app has to learn patterns of traffic delay by
routing individuals who have no interest in taking slower routes.

2. Learning a model for the strategic behavior of one or more agents
by observing their interactions. Examples of this include applications
of learning in economic paradigms.

3. Learning as a model of interactions between agents. Examples of
this include applications to swarm robotics, where individual agents
have to learn to interact in a multi-agent setting in order to achieve
individual or collective goals.

4. Interactions between multiple learners. Examples of this include
scenarios where two or more learners learn about the same or multiple
related concepts. How do these learners interact? What are the
scenarios under which they would share knowledge, information, or
data. What are the desirable interactions between learners?

******* Submissions Guidelines *******

We solicit submission of published and unpublished works. For the
former, we request that the authors clearly state the venue of
previous publication. Authors are also encouraged to provide a link to
an online version of the paper (such as on arXiv). If accepted, such
papers will be linked via an index to give an informal record of the
workshop. This workshop will have no published proceedings. Accepted
submissions will be presented as posters or talks.

Submissions can be made in any format and length, but have to be
accompanied by a one page summary of the paper, its contributions, and
relevance to the workshop (this applies to previously published papers
as well). The review process is not blind. All submissions will be
made through EasyChair on or before May 1, 2019, 11:59pm AoE.
Notification of acceptance will be on May 20, 2019.

Submissions will be evaluated based on their relevance to the theme of
the workshop and the novelty of the work.

******* Important Information *******

Website: https://sites.google.com/view/eclearning2019/

Submission Deadline: May 1, 2019, 11:59pm AoE

Submission page: https://easychair.org/conferences/?conf=eclearning2019

Notification: May 15, 2019

Workshop Date: June 28, 2019

******* Workshop Registration *******

Please refer to the EC 2019 website for registration details.

******* Organizing Committee *******

Omer Ben-Porat, Technion

Nika Haghtalab, Microsoft Research and Cornell University

Yishay Mansour, Tel Aviv University

Tim Roughgarden, Columbia University

******* More Information *******

All questions about submissions should be emailed to:
eclearning2019@easychair.org
**********************************************************
*
* 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] Fwd: 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 pdf in LNCS format (
http://www.springer.de/comp/lncs/authors.html). 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.

The proceedings of BIOKDD'19 workshop will be published by *Springer* in
the CCIS series.

*IMPORTANT DATES:* Submission of abstracts: April 15, 2019

Submission of full papers: April 22, 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

Emanuel Weitschek, Uninettuno University, Rome, 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

***

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

[DMANET] [CFP] [5 days Remained] EAI GOODTECHS 2019 - Valencia, Spain, 25/09 - 27/09

********************************************************************
*
* Call for Papers
*
* GoodTechs 2019
*
* 5th EAI International Conference on
* Smart Objects and Technologies for Social Good
*
* September 25-27, 2019
*
* Submissions due: April 10, 2019 [extended]
*
********************************************************************

SCOPE
======

By social good we refer to a "good" or a service that benefits the
largest number of people in the largest possible way. Some classic
examples of social goods are, of course, healthcare, safety,
environment, democracy, and human rights, but we can add to this
classic list even communication, art, entertainment and much more.

In this context, the popularity of portable computing devices, like
smartphones, tablets, or smart watches combined with the emergence of
many other small smart objects with computational, sensing and
communication capabilities coupled with the popularity of social
networks and new human-technology interaction paradigms is creating
unprecedented opportunities for each of us to do something useful,
ranging from a single person to the whole world. Furthermore, Internet
of Things, Smart-cities, distributed sensing and Fog computing are
representative examples of modern ICT paradigms that aim to describe a
dynamic and globally cooperative infrastructure built upon objects'
intelligence and self-configuring capabilities. These connected
objects are finding their way into our pockets, vehicles, urban areas
and infrastructure, thus becoming the very texture of our society and
providing us the possibility, but also the responsibility, to shape it.

In GOODTECHS we are hence interested in experiences with the design,
implementation, deployment, operation and evaluation of smart objects
and technologies for social good. Clearly, we are not considering only
the so called first world as the scenario for this evolution; we also
refer to those areas where ICT is currently less widespread, hoping
that it may represent a societal development opportunity rather than a
source for further divide.

Topics
Authors are solicited to submit original, previously unpublished
papers in the following, but not limited to topic areas:

- App concepts and technologies for different mobile platforms
- Blockchain for social good
- Communication between mobile devices
- Content Distribution
- E-learning solutions
- Data collection, organization and dissemination methods
- Delay-tolerant aerial networks and ferrying approaches
- Deployment and field-testing
- Digital tools for art and feelings
- Environment sensing, monitoring and preservation
- Experimental results of communication testbeds
- Game, entertainment, and multimedia applications
- Health and social care
- Human-object interaction
- ICT for development
- Mobile service architectures and frameworks
- Mobility and handover management
- New application scenarios for vehicular communications
- Pervasive and ubiquitous services in cloud and IoT
- Platforms and frameworks for mobile devices
- Privacy issues and solutions
- Protocol design, testing and verification
- Security issues, architectures and solutions
- Smart cities and transportation
- Smart economy solutions: e-banking, e-business
- Smart governance and e-administration
- Smart living and E-health
- Technology addressing the digital divide

SPECIAL SESSIONS
================

In addition to the main conference, GOODTECHS19 features special
sessions, aimed to emphasize emerging topics not fully or not
specifically covered in the main conference. Special sessions
highlight current topics related to experiences with the design,
implementation, deployment, operation and evaluation of smart objects
and technologies for social good.

Presentations delivered during the events should be based on original
papers, selected through a peer-review process and that have not been
previously published. Accepted papers will be included in the
Conference Proceedings.

For more information please refer to the main conference website:
http://goodtechs.eu

PUBLICATION
===========

All registered papers will be published by ACM and made available
through ACM Digital Library.

Papers should be in English.
Regular papers should be up to 6 pages in length.
Short papers should be up to 4 pages in length.
Previously published work may not be submitted, nor may the work be
concurrently submitted to any other conference or journal. Such papers
will be rejected without review.
Proceedings will be submitted for inclusion in leading indexing
services, Ei Compendex, ISI Web of Science, Scopus, CrossRef, Google
Scholar, DBLP, as well as EAI's own EU Digital Library (EUDL).

Authors of selected best accepted and presented papers will be invited
to submit an extended version to:

- Springer Mobile Networks and Applications (MONET) Journal (IF: 2.497)
- Wiley Concurrency and Computation: Practice and Experience Journal
(IF: 1.114)

All accepted authors are eligible to submit an extended version in a
fast track of:

- EAI Endorsed Transactions on Cloud Systems
- EAI Endorsed Transactions on Serious Games

SUBMISSION
==========

Papers should be submitted through EAI 'Confy' system
(http://confy.eai.eu/52608), and have to comply with the ACM format
(see Author's kit section).

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

Full Paper Submission deadline: April 10, 2019
Notification deadline: June 1, 2019
Camera-ready deadline: July 1, 2019
Start of Conference: September 25, 2019
End of Conference: September 27, 2019

--
Giacomo Quadrio
Ph.D student
University of Padua
Department of Mathematics
Via Trieste, 63 - Office 731
35121, Padua, Italy

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

[DMANET] Workshop on Theoretical Aspects of Fairness: Call for papers

https://sites.google.com/view/wtaf-workshop/

Scope
=====
The Workshop on Theoretical Aspects of Fairness (WTAF) be held in Patras,
Greece on Monday, 8 July 2019 in conjunction with the 46th International
Colloquium on Automata, Languages and Programming (ICALP 2019). Its aim is
at making the Theoretical Computer Science audience more familiar with
several important problems related to fairness, such as cake-cutting,
resource allocation, market environments and auctions, or algorithmic
fairness in machine learning. Most of these problems exhibit a strong
algorithmic aspect but somewhat strangely, the bulk of the research on
those topics has been outside the main TCS venues. The aim of the workshop
will be to identify and highlight the most important open problems related
to fairness and make them easily accessible to researchers in TCS,
especially those who are less familiar with this "tangent" line of research
in these other venues.

Paper submission
==============
We welcome submissions with strong theoretical and experimental results
that have been published during the last 2-3 years as well as unpublished
or on-going works, related to the following non-exhaustive list of topics:

-- Algorithmic fairness
-- Cake cutting
-- Fair allocation of indivisible goods/chores
-- Matching and matching markets
-- Market equilibria
-- Participatory budgeting
-- Strategic issues in fair division problems

The workshop's proceedings will be non-archival, and the authors of
accepted papers are free to publish their results in archival conferences
and journals. However, the accepted papers will be linked so that they are
accessible from the Workshop's participants.

The authors are encouraged to format their paper following the LIPIcs
template, or as a single-column article, leaving at least 1 inch margins
all around. There is no page limit, but submissions should contain within
the first ten pages a clear presentation of the merits of the paper,
including a discussion of its importance within the context of prior work
and a description of the key technical and conceptual ideas used to achieve
the main results. To enhance the reviewing process, authors are encouraged
to use double spacing and line numbering.

The submission server is now open! The authors are requested to submit
their papers through Easychair, see
https://sites.google.com/view/wtaf-workshop/call-for-papers

Important deadlines
===============
Submission deadline: 26 April 2019
Notification of acceptance: 23 May 2019

Invited Speaker
============
Evangelos Markakis

**********************************************************
*
* 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 APPROACHING] 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 deadline for submissions extended to: April 7, 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

April 7, 2019: Deadline for paper submission
April 24, 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/
*
**********************************************************

[DMANET] Open Post-Doctoral Position at Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)

Open Post-Doctoral Position

A post-doctoral position (100%, German TV-L E 14) is available in
mathematical optimization at the Friedrich-Alexander-Universität
Erlangen-Nürnberg (FAU), Erlangen, Germany.

The optimization group at FAU has more than 25 years of experience in
modeling and solving complex and very large-scale planning and decision
problems from logistics, energy, production, engineering, and the
natural sciences, see https://www.mso.math.fau.de/de/edom/. Their key
expertise is in developing and applying models and algorithms, which
yield proven optimal solutions to optimization problems. This involves
techniques like linear, nonlinear, and integer programming, robust
optimization, graph algorithms, polyhedral combinatorics, and the like.
Furthermore, design of efficient heuristics and exact algorithms
together with effective implementations is key expertise. The chair EDOM
- Economics, Discrete Optimization, Mathematics (Chair
Wirtschaftsmathematik) consists of 20+ PhD students and Postdocs, and is
headed by Frauke Liers and Alexander Martin. The group participates in
many projects funded by the German Science Foundation (DFG), the German
Federal Ministry of Education and Research (BMBF), the Federal Ministry
for Economic Affairs and Energy (BMWi), the European Union, as well as
by the industry.

The position is for a period of three years, with possible extension by
another three years. It may start as soon as possible.

It is expected that during their doctoral research, candidates have
gained research independence in one or more of the following areas:

- mixed-integer linear and nonlinear optimization,
- optimization under uncertainty, especially robust optimization,
- discrete mathematics,
- nonlinear optimization,
- mathematical data science.

You should be interested in doing research on optimization models and
methods. You should also like to validate them in real-world
applications such as energy, logistics, and analytics. You should like
to work in teams and should like to participate in coordinating research
projects.

Candidates with background in pure mathematics are also welcome if they
can prove interest in transfering their theory to solve applied problems.

Informal inquiries and applications (including cover letter and short
research statement, publications, CV, certificates) can be sent to

edom-office@fau.de

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

[DMANET] Application of Artificial Intelligence in Optimization and Modeling

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on
"Application of Artificial Intelligence in Optimization and Modeling"
at the International Conference on
High-Performance Computing 2019 (HPC 2019) will take place in
Borovets, Bulgaria, from 2-nd to 6-th of September 2019.

The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Assoc. Prof. Vassia Atanassova (vassia.atanassova@gmail.com)
from the Institute of Biophysics and Biomedical Engineering
Bulgarian Academy of Sciences

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

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Generalized Nets
Neural Networks
Game Method for Modeling

After reviewing, presented papers will be published as a post
conference publication in the Springer series "Studies in
Computational Intelligence" (SJR 0.184).

Important deadlines
Deadline for submission of abstracts - April 15, 2019
Deadline for submission of full papers - May 15 2019
Notification of acceptance of full papers - July 05, 2019

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

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http://parallel.bas.bg/dpa/HPC_2019/

Special session organizers
Prof. Stefka Fidanova
Assoc. Prof. Vassia Atanassova

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Analytical and combinatorial methods in quantum information theory Workshop, Edinburgh, 9-13 September 2019

Call for participation
----------------------

ICMS Workshop: Analytical and combinatorial methods in quantum information theory
Edinburgh, 9-13 September 2019

Workshop website: https://sites.google.com/view/acqit-venue/home
----------------------------------------------------------------------------------

The Workshop will focus on the mathematical aspects of Quantum Information Theory,
with emphasis on the functional analytic and combinatorial approaches.
It will be based on, and will aim to develop further, the interactions between operator algebras,
graph theory, zero-error quantum information theory and the theory of non-local games.

The workshop will take place at the International Centre for Mathematical Sciences (ICMS) in Edinburgh.

The size of the workshop will be limited to 35 participants.
All prospective participants are encouraged to register early at https://www.smartsurvey.co.uk/s/G57HO/
before 20 July.

Financial support for attending the event will be available, with PhD students and early career researchers receiving priority.
If you would like to apply for financial support, please indicate this on your registration form,
which in this case has to be received by *20 June 2019*.
See the workshop webpage for further details.

The workshop will feature lectures by the following scientists:
Aida Abiad (Maastricht)
Jop Briet (CWI Amsterdam)
Jason Crann (Carleton)
Gemma de las Cuevas (Innsbruck)
Hamza Fawzi (Cambridge)
Debbie Leung (IQC Waterloo)
Tim Netzer (Innsbruck)
Sergii Strelchuk (Cambridge)
Anna Pappa (UCL)
Vern Paulsen (IQC Waterloo)
Giannicola Scarpa (Madrid)
Antonios Varvitsiotis (Singapore)
Dominic Verdon (Bristol)
Peter Vrana (Copenhagen)

If you wish to present a contributed talk please do submit your title and abstract on the registration form.

We hope to welcome you at ICMS Edinburgh in September 2019!

The organizers:
Monique Laurent (Centrum Wiskunde & Informatica, Amsterdam)
Simone Severini (University College London)
Ivan Todorov (Queen's University Belfast)
Andreas Winter (Universitat Autònoma de Barcelona)

**********************************************************
*
* 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 at TU Berlin

A PhD position is available in the research group of Prof. Markus Brill (www.algo.tu-berlin.de<http://www.algo.tu-berlin.de>) at TU Berlin in Germany.

The successful applicant will work within the DFG funded Emmy Noether project "Foundations of Interactive Democracy" (http://www.algo.tu-berlin.de/fid). The project has sufficient travel money available to support conference and workshop attendance as well as research visits to other groups internationally. There are no teaching obligations.

We are looking for candidates with a strong interest in interdisciplinary research at the intersection of computer science, economics, mathematics, and political science. Relevant fields include Algorithmic Economics, Computational Social Choice, and Digital Democracy (aka e-democracy).

The main research themes of the group are computational social choice and algorithmic game theory. Therefore, applicants must have a strong background in discrete mathematics and algorithms. Research experience in (algorithmic) game theory and/or (computational) social choice is beneficial. Fluency in written and spoken English is required. Programming skills are a plus.

The position is for 3 years with the possibility of extension. The starting date is negotiable; we are interested in filling the position as soon as possible. The position is full-time and paid according to salary grade 100% TV-L E 13 (the standard rate for junior scientific staff at German universities; salary depends on experience and amounts to at least 2200 Euro net per month).

Berlin has been repeatedly voted one of the world's most livable cities and offers a vibrant, creative, and international living environment. Berlin's scientific landscape with three leading universities offers plenty of collaboration opportunities, for example in the context of the Weizenbaum Institute for the Networked Society, the Einstein Center Digital Future, The Berlin Mathematics Research Center MATH+, the Berlin Mathematical School (BMS), or the DFG research training group Facets of Complexity.

The official job advertisement (including application instructions) can be found at https://tub.stellenticket.de/de/offers/62815/

The deadline for applications is 5 May 2019.

For informal inquiries please contact Markus Brill (brill@tu-berlin.de<mailto:brill@tu-berlin.de>).

—
Prof. Dr. Markus Brill
http://www.algo.tu-berlin.de/brill



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