Wednesday, May 23, 2018

[DMANET] Reminder: [Algorithms] The 2018 Algorithms Travel Award—Open for Application (Deadline: 31 May 2018)

Dear Colleagues,

We are pleased to announce the 2018 Algorithms PhD Student Travel Award
sponsored by our journal. The award aims to assist junior researchers to
attend an international conference.

The 2018 Algorithms Travel Award consists of 800 CHF.

Candidates must meet the following requirements:

• PhD students whose research involves algorithms and their applications
• Attend an international conference in 2018 to present research (either
via an oral presentation or poster) in the area of algorithms and their
applications, and provide a letter of acceptance from the conference
organizer
The required application materials include:
• An abstract for the conference
• Curriculum Vitae, including a complete list of publications
• Letter of support from their mentors


Please send your applications to algorithms@mdpi.com or
yi.zhang@mdpi.com by 31 May 2018. The winner will be announced by 15
June 2018. Please visit our website for details here
http://www.mdpi.com/journal/algorithms/awards.

We look forward to receiving your applications.

Kind regards,

Ms. Yi Zhang
Managing Editor
E-Mail: algorithms@mdpi.com
Algorithms (http://www.mdpi.com/journal/algorithms)

On behalf of
Prof. Dr. Henning Fernau
Editor-in-Chief of Algorithms
Theoretical Computer Science, FB 4 - Abteilung Informatik,
Universität Trier, D-54286 Trier, 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] Second Call for Papers - ICDCN'19: 20th International Conference on Distributed Computing and Networking

[Apologies if you received multiple copies of this announcement]

======================================================================================
SECOND CALL FOR PAPERS
======================================================================================

ICDCN 2019: 20th International Conference on Distributed Computing and Networking
January 4-7, 2019 - Bangalore, India
http://www.icdcn.org<http://www.icdcn.org/>
Sponsored by IISc Bangalore, ACM in cooperation with ACM SigMobile, and ACM SigOps (approval pending)

IMPORTANT: Submission Deadline: July 22, 2018

Papers describing original research work and practical experiences/experimental results are solicited on topics that tentatively include, but are not limited to:

Distributed Computing Track

* Concurrent data structures
* Distributed algorithms: design, analysis, and complexity
* Distributed operating systems
* Distributed database systems
* Embedded distributed systems, sensors and mobile
* Distributed robots
* Formal methods for distributed systems
* Experimental evaluation of distributed systems
* Fault-tolerance, reliability, and availability
* Multiprocessor & multi-core architectures & algorithms
* Self-organization, self-stabilization, & autonomic computing
* High performance computing, grid computing
* Multi-tire cloud computing and Big Data processing
* Security, cryptography, & game theory in distributed systems
* Internet-scale distributed systems

Networking Track

* 5G, ultra-dense networks, and next-gen networks and services
* Ad-hoc, sensor, PAN, and mesh networks
* Backscatter and ultra-low power networks
* Cognitive networking
* Data center and cloud networking
* Energy-efficient networking & integration with smart grids
* Internetworking protocols & Internet applications
* IoT connectivity and Cyber Physical Systems (CPS)
* Mobile Edge Computing (MEC)
* Mobile offloading
* Mobile pervasive computing and networking
* Network function virtualization and Software Defined Networking (SDN)
* Network security & privacy
* Next generation & converged network architectures
* Overlay & peer-to-peer networks and services
* Pricing and network economics

ICDCN 2019 is soliciting submissions as either regular or short papers. Regular Papers should not exceed 10 pages double column including figures, tables, and references in standard ACM format. Additional details may be included in a clearly-marked appendix (containing all technical ideas and proofs necessary for an expert to fully verify the claims of the paper) that will be read at the discretion of the program committee. Short Papers should not exceed 5 pages double column including figures, tables, and references in standard ACM format. Papers must be submitted electronically in printable PDF form via the EasyChair submission management system. Some papers not accepted as regular papers may be accepted as short papers with 5 pages in the proceedings, while full papers will be allowed 10 pages. At least one author of each accepted paper must register for the conference and present the paper.

BEST PAPER AWARD: The ICDCN TPC plans to award a Best Paper Award, independently for each of the two tracks. This award will be based on the paper's technical merit, the opinions of the reviewers and the presentation quality at the conference.

SPECIAL ISSUE: The authors of selected best papers in the Distributed Computing track will be invited to submit an extended version of their paper for publication in Elsevier's Theoretical Computer Science (TCS - A) journal. The authors of selected best papers in the Networking track will be invited to submit an extended version of their paper for publication in Elsevier's Pervasive and Mobile Computing (PMC) journal.

For inquiries, contact Local Organizing Committee Co-Chairs, R. C. Hansdah (hansdah@iisc.ac.in)<mailto:hansdah@iisc.ac.in> or Dilip Krishnaswamy (dilip1@gmail.com<mailto:dilip1@gmail.com>).


IMPORTANT DATES

Abstract submission: July 15, 2018
Paper submission: July 22, 2018
Notifications: September 20, 2018
Camera-Ready: October 26, 2018
Conference Dates: January 4-7, 2019
Conference Web: http://www.icdcn.org<http://www.icdcn.org/>


ORGANIZING COMMITTEES

General Co-Chairs

* R.C. Hansdah, IISc Bangalore
* Dilip Krishnaswamy, Reliance Jio Infocomm, India
* Nitin Vaidya, University of Illinois, USA

Technical Program Committee Co-Chairs

* Networking Track: Paolo Bellavista, University of Bologna, Italy
* Distributed Computing Track: Sriram V. Pemmaraju, University of Iowa, USA

Workshop Co-Chairs

* Sathya Peri, IIT Hyderabad, India
* Nirmalya Roy, University of Maryland - Baltimore County, USA

Tutorial Co-Chairs

* Arpita Patra, IISc Bangalore, India
* Mainak Chatterjee, University of Central Florida, USA

PhD Forum Co-Chairs

* Bivas Mitra, IIT Kharagpur, India
* Yogesh Simmhan, SERC IISc Bangalore

Demo Chair

* Salil Kanhere, University of New South Wales, Australia
* Prasant Misra, TCS Innovation Lab, Bangalore, India

Poster Chair

* J. Lakshmi, IISc Bangalore

Publicity Co-Chairs

* Luciano Bononi, University of Bologna, Italy
* Neeraj Mittal, University of Texas, Dallas, USA
* S. D. Madhu Kumar, NIT Calicut, India
* Hirozumi Yamaguchi, Osaka University, Japan

Local Organizing Committee Co-Chairs

* R. C. Hansdah, IISc Bangalore, India
* Dilip Krishnaswamy, Reliance Jio Infocomm, India

Steering Committee Co-Chairs

* Sajal K. Das, Missouri University of Science and Technology, USA
* Sukumar Ghosh, University of Iowa, USA


**********************************************************
*
* 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] IWOCA Call for Open Problems

================================================================================
Call for open problem suggestions for the IWOCA open problems session
================================================================================

Since its earliest gatherings, the International Workshop on Combinatorial
Algorithms (IWOCA) has had collaborative problem solving as an essential part of
its meetings. During and after the conference, open problems are collected and
documented on the IWOCA homepage:

https://nms.kcl.ac.uk/iwoca/index_problems.html <https://nms.kcl.ac.uk/iwoca/index_problems.html>

Following an established tradition, there will be an Open Problem Session
during the next IWOCA:
29th International Workshop on Combinatorial Algorithms (IWOCA 2018)
Singapore, July 16–19, 2018
http://www.comp.nus.edu.sg/~iwoca18/ <http://www.comp.nus.edu.sg/~iwoca18/>

We would like to invite also colleagues who cannot attend the IWOCA
workshop to suggest open problems. If you have a problem you are willing
to share with the community, and that fits into the scope of IWOCA, you are
welcome to send it to us, the two chairs of the open problem section

Gabriele Fici (gabriele.fici AT unipa.it <http://unipa.it/>)
Dalibor Froncek (dfroncek AT d.umn.edu <http://d.umn.edu/>)

Our goal is to publish each problem in the form of 1-2 page PDFs, that also
provide some background information and references for the problems, like
here:

https://nms.kcl.ac.uk/iwoca/problems_list.html <https://nms.kcl.ac.uk/iwoca/problems_list.html>

Please be ready to put your problem into this format if we ask you to.
We are looking forward to your suggestions,

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

Tuesday, May 22, 2018

[DMANET] CFP for WALCOM 2019, February 27 - March 2, 2019 - IIT Guwahati, India

*******************************************************************
WALCOM 2019 (Call for Papers)
*******************************************************************
13th International Conference and Workshops on Algorithms
and Computation (WALCOM 2019)

February 27 - March 2, 2019 - IIT Guwahati, India
http://www.iitg.ac.in/walcom2019/

Poster of Call for Papers can be accessed at the following link:
http://www.iitg.ac.in/walcom2019/cfp.htm

International Conference and Workshops on Algorithms
and Computation (WALCOM) is intended to provide
an international forum for researchers working in the areas of
algorithms and computation.
WALCOM 2019 will be held during February 27 - March 2, 2019
IIT Guwahati, India

SCOPE
The range of topics within the scope of WALCOM includes
but is not limited to:

Approximation Algorithms
Algorithmic Graph Theory and Combinatorics
Combinatorial Algorithms
Combinatorial Optimization
Computational Biology
Computational Complexity
Computational Geometry
Discrete Geometry
Data Structures
Experimental Algorithm Methodologies
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Algorithms
Parameterized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms

AUTHOR INSTRUCTIONS

Authors are invited to submit papers (extended abstracts)
describing original research of theoretical or practical significance
to algorithms and computation.
Papers should not exceed 12 pages in LNCS style.
Papers significantly shorter than 12 pages are also welcome.
If the authors feel that more details are essential to substantiate
the main claim of the paper, they may include a clearly marked
appendix that will be read at the discretion of the Program Committee.

Only electronic submissions via Easychair will be allowed
(https://easychair.org/conferences/?conf=walcom2019).
Submitted papers must describe work not previously published.
They must not be submitted simultaneously to another conference
with refereed proceedings or to a journal.

PAPER SUBMISSION PAGE

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

PROCEEDINGS

Accepted papers in the conference will be published
in the conference proceedings which will be included
in the Springer Lecture Notes in Computer Science
(LNCS) series.
Moreover, selected papers will be published in special
issues of "Theoretical Computer Science (TCS) " and
"Journal of Graph Algorithms and Applications (JGAA) ".

VENUE AND TIME

The conference will be held at Indian Institute of Technology
Guwahati (IIT Guwahati), India,
during February 27 - March 02, 2019.

IMPORTANT DATES

Paper submission deadline : September 15, 2018 (Anywhere on Earth)
Notification of Acceptance/Rejection: October 25, 2018
Conference Dates: February 27-March 02, 2019

PROGRAM COMMITTEE

Sang Won Bae, Kyonggi University, Korea
Arnab Bhattacharyya, IISc, Bangalore, India
Hans Bodlaender, Utrecht University, Netherlands
Prosenjit Bose, Carleton University, Canada
Paz Carmi, Ben-Gurion University, Israel
Marek Chrobak, University of California Riverside, USA
Anirban Dasgupta, IIT Gandhinagar, India
Stephane Durocher, University of Manitoba, Canada
Rudolf Fleischer, GUtech, Oman
Guilherme Dias da Fonseca, Universite Clermont Auvergne, France
Arijit Ghosh, ISI Kolkata, India
Seok-Hee Hong, University of Sydney, Australia
Giuseppe Liotta, University of Perugia, Italy
Matus Mihalak, Maastricht University, Netherlands
Debajyoti Mondal, University of Saskatchewan, Canada
Krishnendu Mukhopadhyaya, Indian Statistical Institute, Kolkata,India
(co-chair)
Petra Mutzel, TU Dortmund, Germany
Shin-ichi Nakano Gunma University, Japan (co-chair)
Martin Nollenburg, Technical University of Vienna, Austria
Leonidas Palios, University of Ioannina, Greece
Vangelis Paschos, University Paris-Dauphine Paris, France
Rossella Petreschi, University La Sapienza Roma, Italy
Md. Saidur Rahman, BUET, Bangladesh
M. Sohel Rahman, BUET, Bangladesh
Kunihiko Sadakane, The University of Tokyo, Japan
Etsuji Tomita, The University of Electro-Communications, Japan
Csaba D. Toth, California State University Northridge, USA
Jan Vahrenhold, Universitat Munster, Germany
Sue Whitesides, University of Victoria, Canada
Hsu-Chun Yen, National Taiwan University, Taiwan

ORGANIZING COMMITTEE

Gautam Kumar Das, IITG (co-chair)
Partha Sarathi Mandal, IITG (co-chair)
Swaroop Nandan Bora, MATHS, IITG
Durga Charan Dalal, MATHS, IITG
HOD, MATHS, IITG
K. V. Krishna, MATHS, IITG
Vinay Wagh, MATHS, IITG
Kalpesh Kapoor, MATHS, IITG
S. V. Rao, CSE, IITG
Arnab Sarkar, CSE, IITG
Debasish Pattanayak, MATHS, IITG
Sangram Kishor Jena, MATHS, IITG
------------------------------

**********************************************************
*
* 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] ICALP 2018 - Call for Participation

===================================
ICALP 2018 - Call for Participation
===================================

http://iuuk.mff.cuni.cz/~icalp2018

The 45th International Colloquium on Automata, Languages, and
Programming (ICALP) will take place in Prague, Czech Republic, on July
9-13, 2018.

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

==================================================
Early registration deadline: Thursday May 31, 2018
==================================================

Registration fees:

Early Payment (until May 31):
Regular: 13 500 CZK (approx. 529 - 540 EUR)
Student: 9 500 CZK (approx. 372 - 380 EUR)

Late Payment (after May 31):
Regular: 16 000 CZK (approx. 627 - 640 EUR)
Student: 12 000 CZK (approx. 470 - 480 EUR)

Workshop fees:
With the main conference: 1 300 CZK (approx. 50 - 52 EUR)
Workshop only (until May 31): 1 500 CZK (approx. 58 - 60 EUR)
Workshop only (after May 31): 2 200 CZK (approx. 86 - 88 EUR)

All payments need to be received by June 30. Even though we give the
approximate ranges in EUR all fees will be charged in CZK. All fees
include all technical sessions, lunches and coffee breaks on the
respective days. The fee for the main conference includes also a welcome
party on Tuesday and a conference dinner on Thursday.

================
Invited Speakers
================

Jaroslav Nesetril (Charles Univ, CZ)
Alexander Schwarzmann (Univ of Connecticut, US)
Sam Staton (Oxford Univ, UK)
Ryan Williams (Massachusetts Institute of Technology, US)

=========
Workshops
=========

Accompanying the main conference, several satellite workshops will be
organized. The organizers are listed below. All workshops will be held on
Monday July 9th 2018 in Mala Strana. The exact schedule will be announced.

Modern Online Algorithms (MOLI)
http://math.haifa.ac.il/lea/MOLI.htm
Leah Epstein

Game Solving: Theory and Practice
https://www7.in.tum.de/~kretinsk/games.html
Tomas Brazdil, Branislav Bosansky, Jan Kretinsky

Parameterized Approximation Algorithms Workshop (PAAW)
https://sites.google.com/site/aefeldmann/workshop
Andreas Emil Feldmann

Infinity
Antonin Kucera, Petr Jancar

Algorithmic Aspects of Temporal Graphs
http://community.dur.ac.uk/george.mertzios/Temporal-Graphs-ICALP-2018.html
George B. Mertzios, Paul Spirakis, Viktor Zamaraev, Eleni Akrida

Constrained Recognition Problems
http://www1.informatik.uni-wuerzburg.de/en/events/wcrp-2018/
Ignaz Rutter, Steven Chaplick

Summer School on Lower Bounds (LBCAD)
Michal Koucky


**********************************************************
*
* 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] HIGHLIGHTS 2018: 1st Call for Presentations

HIGHLIGHTS 2018: 6th annual conference on Highlights of LOGIC, GAMES, and
AUTOMATA

18-21 September 2018, TU Berlin

http://highlights-conference.org

IMPORTANT DATES:
+ Submission deadline: 13 JUNE, 5pm GMT
+ Notification: 22 JUNE

SATELLITE EVENTS:
+ ErichFest: Symposium to Celebrate Erich Grädel's 60th Birthday, 17
September
+ Workshop on the Theory of Regular Cost Functions and Beyond, 21 September
(afternoon)

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

HIGHLIGHTS 2018 is the 6th conference on Highlights of Logic, Games, and
Automata that aims to integrate the diverse research community working in
the areas of Logic and Finite Model Theory, Automata Theory, and Games for
Logic and Verification. Individual papers are dispersed across many
conferences, which makes them challenging to follow. A visit to the annual
Highlights conference offers a wide picture of the latest research in the
field and a chance to meet and interact with most of the members of the
research community. We encourage you to present your best recent work at
Highlights, whether already published elsewhere or not.

The conference is short (from 19 September to the mid-day on 21 September)
and it is preceded by the Highlights Tutorial Day (18 September). The
participation costs are modest and Berlin is easy to reach.


The Contributed Presentations will be around ten minutes long. All
speakers will be also invited to contribute to a Poster Session, which will
open new ways of interaction at the conference for the whole Highlights
community.

KEYNOTE PRESENTATIONS
+ Andrei Bulatov, The Complexity of Constraints: Dichotomies and Beyond
+ Nicole Schweikardt, Constant Delay Enumeration of Query Results
+ James Worrell, Algebraic Invariants for Affine Programs

TUTORIALS
+ Amir Abboud, Fine-Grained Complexity and Hardness in P
+ Christoph Berkholz, Interactions Between Proof Complexity and Finite
Model Theory
+ Joost-Pieter Katoen, Principles of Probabilistic Programming

INVITED SESSIONS
+ Chair: Christel Baier, Multi-Objective Reasoning in Probabilistic Models
+ Chair: Martin Grohe, Logic and Learning

SPOTLIGHT TALKS
+ Stéphane Gaubert, Nonarchimedean Convex Programming and Its Relation to
Mean-Payoff Games
+ Laura Kovács, Symbol Elimination for Program Analysis
+ Jan Křetínský, A Journey from LTL to Your Favourite Automaton
+ Amaury Pouly, Continuous Models of Computation: Computability,
Complexity, Universality
+ Jeffrey Shallit, Finite Automata and Additive Number Theory

**********************************************************
*
* 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] ICGT 2018 in Lyon: Call for registration

(Apologies for multiple copies)

*************************
ICGT 2018 - 10th International Colloqium on Graph Theory and combinatorics
Registration

ICGT is a conference created in the honour of C.Berge in 1976 and
organized by the French community in Graph Theory every 4-5 years. This
10th edition succeeds the editions of Grenoble in 2014, Orsay in 2010
and Hyères in 2005, and will take place in Lyon from July 9th to 13th 2018.

To be held in Lyon, France
From July 9th to 13th 2018

http://liris.cnrs.fr/~icgt2018/
mail: igct2018@liris.cnrs.fr

*************************
**Important dates**
**
**University accommodation booking deadline: _May 29th, 2018_**
**Registration deadline: _June 20th, 2018_**
**Conference: _From July 9th to 13th, 2018_*

http://liris.cnrs.fr/~icgt2018/index.php?id=registration


*************************
Invited speakers

László Babai, University of Chicago
Maria Chudnovsky, Princeton University
Zdeněk Dvořák, Charles University, Prague
Samuel Fiorini, Université libre de Bruxelles
Daniel Král', University of Warwick
Daniela Kühn, University of Birmingham
Daniel Lokshtanov, University of Bergen
Claire Mathieu, CNRS, École Normale Supérieure de Paris
Carsten Thomassen, Technical University of Denmark


************************
Fees

Registration : 230 euros for students and retired researchers, 320 euros
for the others.


************************
Scientific Committee

Cristina Bazgan, Paris
Pierre Charbit, Paris
Victor Chepoi, Marseille
Guillaume Fertin, Nantes
Frédéric Havet, Sophia-Antipolis
Olivier Hudry, Paris
Dieter Kratsch, Metz
Zhentao Li, Paris
Yannis Manoussakis, Orsay
Christophe Paul, Montpellier
Arnaud Pêcher, Bordeaux
Myriam Preissmann, Grenoble
Jean-Sébastien Sereni, Nancy
Ioan Todinca, Orléans
Olivier Togni, Dijon
Annegret Wagler, Clermont-Ferrand


And the members of the organizing committee, all from Lyon

Christophe Crespelle
Eric Duchêne
Brice Effantin
Mohamed Haddad
Hamamache Kheddouci (co-chair)
Bodo Lass
Arnaud Mary
Aline Parreau
Michael Rao
Hamida Seba
Hamza Si Kaddour
Eric Tannier
Eric Thierry
Stéphan Thomassé
Nicolas Trotignon (co-chair)
Bora Ucar
Rémi Watrigant

**********************************************************
*
* 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 student position in Algorithms at the University of Vienna

DEPARTMENTOFCOMPUTERSCIENCE UNIVERSITY OF VIENNA

PHD STUDENT POSITION IN ALGORITHMS

A PhD student position is available in the research group "Theory and

Applications of Algorithms" led by Professor Monika Henzinger. See

http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/

for more information on the research group.

The position is available starting July 1, 2018 (or later) and will be

of 3 years.Seethe official call
<https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_cF16084E2-2799-0951-3DAA-626B785B5A0C_k1A08224C-0953-D89F-B38E-3D9493EF1156&tid=67672.28> for more details.

If you are interested, please send your CV, a letter of motivation, and
copies ofthe official transcripts of your Bachelor and Master studies to
monika.henzinger@univie.ac.at
<https://webmail.univie.ac.at/src/compose.php?send_to=monika.henzinger%40univie.ac.at>
by June 7, 2018.


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

Monday, May 21, 2018

[DMANET] Second Call for Papers - ICDCN'19: 20th International Conference on Distributed Computing and Networking

[Apologies if you received multiple copies of this announcement]

======================================================================================
SECOND CALL FOR PAPERS
======================================================================================

ICDCN 2019: 20th International Conference on Distributed Computing and Networking
January 4-7, 2019 – Bangalore, India
http://www.icdcn.org<http://www.icdcn.org/>
Sponsored by IISc Bangalore, ACM in cooperation with ACM SigMobile, and ACM SigOps (approval pending)

IMPORTANT: Submission Deadline: July 22, 2018

Papers describing original research work and practical experiences/experimental results are solicited on topics that tentatively include, but are not limited to:

Distributed Computing Track

* Concurrent data structures
* Distributed algorithms: design, analysis, and complexity
* Distributed operating systems
* Distributed database systems
* Embedded distributed systems, sensors and mobile
* Distributed robots
* Formal methods for distributed systems
* Experimental evaluation of distributed systems
* Fault-tolerance, reliability, and availability
* Multiprocessor & multi-core architectures & algorithms
* Self-organization, self-stabilization, & autonomic computing
* High performance computing, grid computing
* Multi-tire cloud computing and Big Data processing
* Security, cryptography, & game theory in distributed systems
* Internet-scale distributed systems


Networking Track

* 5G, ultra-dense networks, and next-gen networks and services
* Ad-hoc, sensor, PAN, and mesh networks
* Backscatter and ultra-low power networks
* Cognitive networking
* Data center and cloud networking
* Energy-efficient networking & integration with smart grids
* Internetworking protocols & Internet applications
* IoT connectivity and Cyber Physical Systems (CPS)
* Mobile Edge Computing (MEC)
* Mobile offloading
* Mobile pervasive computing and networking
* Network function virtualization and Software Defined Networking (SDN)
* Network security & privacy
* Next generation & converged network architectures
* Overlay & peer-to-peer networks and services
* Pricing and network economics


ICDCN 2019 is soliciting submissions as either regular or short papers. Regular Papers should not exceed 10 pages double column including figures, tables, and references in standard ACM format. Additional details may be included in a clearly-marked appendix (containing all technical ideas and proofs necessary for an expert to fully verify the claims of the paper) that will be read at the discretion of the program committee. Short Papers should not exceed 5 pages double column including figures, tables, and references in standard ACM format. Papers must be submitted electronically in printable PDF form via the EasyChair submission management system. Some papers not accepted as regular papers may be accepted as short papers with 5 pages in the proceedings, while full papers will be allowed 10 pages. At least one author of each accepted paper must register for the conference and present the paper.

BEST PAPER AWARD: The ICDCN TPC plans to award a Best Paper Award, independently for each of the two tracks. This award will be based on the paper's technical merit, the opinions of the reviewers and the presentation quality at the conference.

SPECIAL ISSUE: The authors of selected best papers in the Distributed Computing track will be invited to submit an extended version of their paper for publication in Elsevier's Theoretical Computer Science (TCS - A) journal. The authors of selected best papers in the Networking track will be invited to submit an extended version of their paper for publication in Elsevier's Pervasive and Mobile Computing (PMC) journal.

For inquiries, contact Local Organizing Committee Co-Chairs, R. C. Hansdah (hansdah@iisc.ac.in)<mailto:hansdah@iisc.ac.in> or Dilip Krishnaswamy (dilip1@gmail.com<mailto:dilip1@gmail.com>).


IMPORTANT DATES

Abstract submission: July 15, 2018
Paper submission: July 22, 2018
Notifications: September 20, 2018
Camera-Ready: October 26, 2018
Conference Dates: January 4-7, 2019
Conference Web: http://www.icdcn.org<http://www.icdcn.org/>


ORGANIZING COMMITTEES

General Co-Chairs

* R.C. Hansdah, IISc Bangalore
* Dilip Krishnaswamy, Reliance Jio Infocomm, India
* Nitin Vaidya, University of Illinois, USA


Technical Program Committee Co-Chairs

* Networking Track: Paolo Bellavista, University of Bologna, Italy
* Distributed Computing Track: Sriram V. Pemmaraju, University of Iowa, USA


Workshop Co-Chairs

* Sathya Peri, IIT Hyderabad, India
* Nirmalya Roy, University of Maryland – Baltimore County, USA


Tutorial Co-Chairs

* Arpita Patra, IISc Bangalore, India
* Mainak Chatterjee, University of Central Florida, USA


PhD Forum Co-Chairs

* Bivas Mitra, IIT Kharagpur, India
* Yogesh Simmhan, SERC IISc Bangalore


Demo Chair

* Salil Kanhere, University of New South Wales, Australia
* Prasant Misra, TCS Innovation Lab, Bangalore, India


Poster Chair

* J. Lakshmi, IISc Bangalore


Publicity Co-Chairs

* Luciano Bononi, University of Bologna, Italy
* Neeraj Mittal, University of Texas, Dallas, USA
* S. D. Madhu Kumar, NIT Calicut, India
* Hirozumi Yamaguchi, Osaka University, Japan


Local Organizing Committee Co-Chairs

* R. C. Hansdah, IISc Bangalore, India
* Dilip Krishnaswamy, Reliance Jio Infocomm, India


Steering Committee Co-Chairs

* Sajal K. Das, Missouri University of Science and Technology, USA
* Sukumar Ghosh, University of Iowa, USA

**********************************************************
*
* 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: AlgoSensors 2018 (deadline June 3)

======================================================
AlgoSensors 2018 Call for Papers
======================================================

14th International Symposium on Algorithms and Experiments for Wireless
Networks

AlgoSensors 2018

August 23-24, 2018
Helsinki, Finland
http://algo2018.hiit.fi/algosensors/

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

Important Dates:

- Abstract Submission : May 30, 2018
- Submission: June 3, 2018
- Notification: July 12, 2018
- Camera Ready: July 31, 2018

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

AlgoSensors is an international symposium dedicated to the algorithmic
aspects of wireless networks. Originally focused on sensor networks, it
now covers algorithmic issues arising in wireless networks of all types
of computational entities, static or mobile, including sensor networks,
sensor-actuator networks, autonomous robots. The focus is on the design
and analysis of algorithms, models of computation, and experimental
analysis.

AlgoSensors 2018 will be part of ALGO 2018, which also hosts AlgoCloud,
ATMOS, ESA, IPEC, WABI, and WAOA.

Submissions are sought in all areas of wireless networking, broadly
construed, including both theoretical and experimental perspectives.
This year AlgoSensors has two tracks:
- Algorithms & Theory
- Experiments & Applications
Each paper may be submitted only to one track.

Topics of interest include, but are not limited to:
- Ad Hoc Networks
- Algorithms
- Approximation Algorithms
- Communication Protocols
- Complexity and Computability
- Computational Models
- Cryptography, Security and Trust
- Cyber Physical Systems
- Data Aggregation and Fusion
- Deployment
- Energy Management
- Error Correcting Codes
- Experimental Analysis
- Fault Tolerance and Dependability
- Game Theoretic Aspects
- Infrastructure Discovery
- Internet of Things (IoT)
- Localization
- Medium Access Control
- Mobility & Dynamics
- Obstacle Avoidance
- Pattern Formation
- Performance Evaluation
- Power Saving Schemes
- Randomized Algorithms
- Resource Efficiency
- RFID Algorithms
- Routing and Data Propagation
- Self-stabilization, Self-* Properties
- Sensor Networks
- Swarm Computing
- Systems and Testbeds
- Time Synchronization
- Topology Control
- Tracking
- Virtual Infrastructures
- Wireless Networks

Submission guidelines:

Papers are to be submitted electronically using the EasyChair server.
Original research papers must contain results that have not previously
appeared and have not been concurrently submitted to a journal or
conference with published proceedings. Each paper should select one of
the two tracks (Algorithms & Theory or Experiments & Applications) for
submission. Authors need to ensure that for each accepted paper at least
one author will register and attend the symposium.

Submissions are limited to twelve (12) single-column pages in the LNCS
format. This includes figures, but excludes references and an optional
appendix (to be read at the program committee's discretion). Papers
will be published by LNCS after the conference.

Awards:

The best paper from each track will be given a Best Paper Award.

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

Conference Committee:

Program Chair: Seth Gilbert (NUS)
Program Chair: Danny Hughes (KU Leuven)
Program Chair: Bhaskar Krishnamachari (University of Southern
California)
Publicity Chair: Theofanis Raptis (CNR)
Local Co-Chair: Parinya Chalermsook (Aalto University)
Local Co-Chair: Petteri Kaski (Aalto University)
Local Co-Chair: Jukka Suomela (Aalto University)
**********************************************************
*
* 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, May 20, 2018

[DMANET] IPCO 2019 call for papers

Conference on Integer Programming and Combinatorial Optimization
IPCO XX, May 22–24, 2019
to be held at the University of Michigan in Ann Arbor, Michigan, USA.
Submission deadline: November 20, 2018 (23:59 EST)
Website: http://umich.edu/~ipco2019conf/

The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Authors are invited to submit extended abstracts of their recent work by November 20, 2018 (23:59 EST); see the submission guidelines below for more information. The Program Committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not submitted to journals or conferences with proceedings before the notification date (January 31, 2019). Papers violating these requirements will not be considered by the Program Committee.

During the conference, approximately 33 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as a volume of Springer Lecture Notes in Computer Science. They will contain extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals.

Program Committee

Amitabh Basu (Johns Hopkins U)
Pierre Bonami (IBM)
Jose Correa (U Chile)
Sanjeeb Dash (IBM)
Volker Kaibel (U Magdeburg)
Simge Küçükyavuz (U Washington)
Retsef Levi (MIT)
Jim Luedtke (U Wisconsin, Madison)
Andrea Lodi (Polytechnique Montreal, Chair)
Tom McCormick (UBC)
Ruth Misener (Imperial College)
Viswanath Nagarajan (U Michigan)
Marc Pfetsch (TU Darmstadt)
Martin Skutella (TU Berlin)
Gautier Stauffer (Kedge Business School)
Angelika Wiegele (Alpen-Adria U Klagenfurt)

Submission Guidelines

The extended abstract — in Springer LNCS format — should not exceed 10 pages plus references. An appendix of at most 2 pages for more detailed proofs (e.g., main lemma) and / or detailed computational results is welcome and, if present, will be refereed and published. Submissions not following these guidelines will not be considered. Full versions of the submitted papers freely accessible in on-line repositories are welcome.
The first page should contain the title, the authors with their affiliations, and a short abstract. The introduction should be a broadly accessible exposition of the main ideas and techniques used to achieve the results, including motivation and a clear comparison with related work. In particular, the introduction should convey to the non-expert why the paper should be accepted to IPCO.
It is required to use LaTeX2e together with the LNCS class file from Springer. Please check the Springer Information for LNCS Authors for additional information.
The submitted extended abstracts will be refereed according to the standards of other top tier refereed conferences. The main acceptance criteria used by the Program Committee are the quality and originality of the research, plus its interest to people working in the field. It is crucial that the importance of the work is understood by the committee. The claimed results must be correct and new.
A paper will not be considered in any of the following cases:
– it has been already published;
– it has been submitted to a journal or to another conference with proceedings before the notification date;
– it has a member of the Program Committee among its authors;
– it is submitted after the submission deadline.

Submission website

Abstracts should be submitted through the submission website: https://easychair.org/conferences/?conf=ipco2019
Abstracts should be submitted using the LNCS template for November 20, 2018
Information for authors and template available here : http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0


**********************************************************
*
* 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, May 19, 2018

[DMANET] PhD position in Operations Research at KU Leuven (ref. BAP-2018-235)

The research group ORSTAT (Operations Research & Business Statistics) of KU Leuven (Belgium) has a vacancy for one full-time PhD scholarship for the period of September 17, 2018, until September 16, 2022, for scientific research in the field of operations research (O.R.). This work should lead to a PhD degree. The candidate will work in the general area of network design, resource scheduling and planning. Some keywords of our research domain are: combinatorial optimization, mathematical programming, stochastic and robust optimization, algorithm design.


Candidates should have a strong interest in operations research and preferably hold a Master's degree in Business Engineering (Handelsingenieur), Industrial Engineering, Mathematics, Computer Science, Operations Research, or equivalent. An average degree of "distinction" during preliminary studies is an advantage, 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 until max. 4 years after positive evaluation. You will find a dynamic and pleasant working environment, in a group that is actively involved in scientific research at the highest international level.

For more information please contact prof. dr. Roel Leus, e-mail: roel.leus@kuleuven.be<mailto:roel.leus@kuleuven.be>. You can apply for this job no later than May 31, 2018 via the online application tool https://www.kuleuven.be/personeel/jobsite/jobs/54629417?hl=en&lang=en (ref. BAP-2018-235).

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

Thursday, May 17, 2018

[DMANET] CFP for WALCOM 2019, February 27 - March 2, 2019 - IIT Guwahati, India

*******************************************************************
WALCOM 2019 (Call for Papers)
*******************************************************************
13th International Conference and Workshops on Algorithms
and Computation (WALCOM 2019)

February 27 - March 2, 2019 - IIT Guwahati, India
http://www.iitg.ac.in/walcom2019/

Poster of Call for Papers can be accessed at the following link:
http://www.iitg.ac.in/walcom2019/cfp.htm

International Conference and Workshops on Algorithms
and Computation (WALCOM) is intended to provide
an international forum for researchers working in the areas of
algorithms and computation.
WALCOM 2019 will be held during February 27 - March 2, 2019
IIT Guwahati, India

SCOPE
The range of topics within the scope of WALCOM includes
but is not limited to:

Approximation Algorithms
Algorithmic Graph Theory and Combinatorics
Combinatorial Algorithms
Combinatorial Optimization
Computational Biology
Computational Complexity
Computational Geometry
Discrete Geometry
Data Structures
Experimental Algorithm Methodologies
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Algorithms
Parameterized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms

AUTHOR INSTRUCTIONS

Authors are invited to submit papers (extended abstracts)
describing original research of theoretical or practical significance
to algorithms and computation.
Papers should not exceed 12 pages in LNCS style.
Papers significantly shorter than 12 pages are also welcome.
If the authors feel that more details are essential to substantiate
the main claim of the paper, they may include a clearly marked
appendix that will be read at the discretion of the Program Committee.

Only electronic submissions via Easychair will be allowed
(https://easychair.org/conferences/?conf=walcom2019).
Submitted papers must describe work not previously published.
They must not be submitted simultaneously to another conference
with refereed proceedings or to a journal.

PAPER SUBMISSION PAGE

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

PROCEEDINGS

Accepted papers in the conference will be published
in the conference proceedings which will be included
in the Springer Lecture Notes in Computer Science
(LNCS) series.
Moreover, selected papers will be published in special
issues of "Theoretical Computer Science (TCS) " and
"Journal of Graph Algorithms and Applications (JGAA) ".

VENUE AND TIME

The conference will be held at Indian Institute of Technology
Guwahati (IIT Guwahati), India,
during February 27 - March 02, 2019.

IMPORTANT DATES

Paper submission deadline : September 15, 2018 (Anywhere on Earth)
Notification of Acceptance/Rejection: October 25, 2018
Conference Dates: February 27-March 02, 2019

PROGRAM COMMITTEE

Sang Won Bae, Kyonggi University, Korea
Arnab Bhattacharyya, IISc, Bangalore, India
Hans Bodlaender, Utrecht University, Netherlands
Prosenjit Bose, Carleton University, Canada
Paz Carmi, Ben-Gurion University, Israel
Marek Chrobak, University of California – Riverside, USA
Anirban Dasgupta, IIT Gandhinagar, India
Stephane Durocher, University of Manitoba, Canada
Rudolf Fleischer, GUtech, Oman
Guilherme Dias da Fonseca, Université Clermont Auvergne, France
Arijit Ghosh, ISI Kolkata, India
Seok-Hee Hong, University of Sydney, Australia
Giuseppe Liotta, University of Perugia, Italy
Matus Mihalak, Maastricht University, Netherlands
Debajyoti Mondal, University of Saskatchewan, Canada
Krishnendu Mukhopadhyaya, Indian Statistical Institute, Kolkata,India
(co-chair)
Petra Mutzel, TU Dortmund, Germany
Shin-ichi Nakano Gunma University, Japan (co-chair)
Martin Nöllenburg, Technical University of Vienna, Austria
Leonidas Palios, University of Ioannina, Greece
Vangelis Paschos, University Paris-Dauphine – Paris, France
Rossella Petreschi, University La Sapienza – Roma, Italy
Md. Saidur Rahman, BUET, Bangladesh
M. Sohel Rahman, BUET, Bangladesh
Kunihiko Sadakane, The University of Tokyo, Japan
Etsuji Tomita, The University of Electro-Communications, Japan
Csaba D. Toth, California State University Northridge, USA
Jan Vahrenhold, Universitat Münster, Germany
Sue Whitesides, University of Victoria, Canada
Hsu-Chun Yen, National Taiwan University, Taiwan

ORGANIZING COMIITTEE

Gautam Kumar Das, IITG (co-chair)
Partha Sarathi Mandal, IITG (co-chair)
Swaroop Nandan Bora, MATHS, IITG
Durga Charan Dalal, MATHS, IITG
HOD, MATHS, IITG
K. V. Krishna, MATHS, IITG
Vinay Wagh, MATHS, IITG
Kalpesh Kapoor, MATHS, IITG
S. V. Rao, CSE, IITG
Arnab Sarkar, CSE, IITG
Debasish Pattanayak, MATHS, IITG
Sangram Kishor Jena, MATHS, IITG
------------------------------

**********************************************************
*
* 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 studentships in Mathematics at The Open University, UK

PHD STUDENTSHIPS IN MATHEMATICS AVAILABLE FROM 1 OCTOBER 2018

Located in: The Open University, Milton Keynes, UK
Closing date: 1st June 2018
Full details: http://www.mathematics.open.ac.uk/phd

Several full-time three-year PhD studentships in Mathematics are
available, commencing 1 October 2018. Studentships cover full-time
fees, include a stipend (currently £14,777 per annum), plus £1250
annual travel allowance. These studentships are only available to
Home/EU applicants.

Several research projects are available, including the following in
Discrete Maths:
* algebraic graph theory,
* well-quasi-order in permutations,
* aperiodic order.

Interested persons are strongly encouraged to make informal enquiries
to stem-ms-research@open.ac.uk.

Completed application forms, together with a covering letter
indicating your suitability and reasons for applying, should be sent
to stem-ms-research@open.ac.uk to arrive by 5pm on Friday, 1
June 2018. Application forms are available from
http://www.open.ac.uk/postgraduate/research-degrees/how-to-apply/mphil-and-phd-application-process

The School of Mathematics and Statistics, situated in the OU campus in
Milton Keynes, provides a friendly and flexible working environment
for all of its staff and students, and holds a Bronze Athena SWAN
award. We particularly welcome applications from women: the School
ensures that every female PhD student is allocated a female member of
staff as a point of contact, and organises networking events for female
academic staff and PhD students.

**********************************************************
*
* 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] OR60-Data Mining Stream-submission deadline

Dear all,

OR60 (www.theorsociety.com/OR60<http://www.theorsociety.com/OR60>) will take place in Lancaster (United Kingdom) from the 11th to the 13th of September 2018. As the organizer for the stream on Data Mining, I am pleased to invite you to give a talk on a related theme of your choice. This area covers advances in relation to the broad range of methods that help discover systematic patterns in data and thus generate and communicate knowledge to aid decision-making. Examples of these methods can be found in fields such as pattern recognition, machine learning, complex systems, probabilistic modelling, statistical inference, and information visualization.

The deadline for submitting your abstract is 31st of May 2018. Please follow the link below to completing this process.
http://www.theorsociety.com/Pages/Conferences/OR60/OR60Abstract.aspx

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

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

[DMANET] ACAI 2018 - Registration and travel grants

Registration is now open.
Travel grants from EurAI are available.
http://acai2018.unife.it/
Important dates:
30 May first cutoff date for travel grants
15 June early registration deadline
30 June second cutoff date for travel grants
27 July late registration deadline

The Advanced Course on AI (ACAI) is a specialized course in Artificial Intelligence sponsored by EurAI. The 2018 edition will be in Ferrara, Italy on August 27th - 31st 2018, save the date!
The theme of the 2018 ACAI School is Statistical Relational Artificial Intelligence (StarAI).
StarAI is an emerging area that combines logical (or relational) AI and probabilistic (or statistical) AI.

Relational AI deals very effectively with complex domains involving many and even a varying number of entities connected by complex relationships, while statistical AI manages well the uncertainty that derives from incomplete and noisy descriptions of the domains. Both fields achieved significant successes over the last thirty years but evolved largely independently until about fifteen years ago, when the potential originating from their combination started to emerge. Statistical Relational Learning (SRL) was proposed for exploiting relational descriptions in statistical machine learning methods from the field of graphical models. Meanwhile, the scope of SRL was significantly advanced in StarAI to cover all forms of reasoning and models of AI. StarAI is nowadays an ample area encompassing many and diverse approaches.

The school includes courses on foundations of relational and statistical AI together with advanced courses on the new StarAI approaches and applications. The talks will provide theoretical background, practical examples and real applications where StarAI can play a role. Hands-on classes will be also organized where the main StarAI techniques will be applied to 'small' examples.

The list of confirmed lectures is:

Luc De Raedt: Probabilistic Programming
Paolo Frasconi: Kernels and deep networks for structured data
Sebastian Riedel: Differentiable Program Interpreters
Artur d'Avila Garcez: Neural-symbolic learning
Marco Lippi: Applications of Statistical Relational Artificial Intelligence
Sriraam Natarajan: Human-in-the-loop Statistical Relational Learning
Mathias Niepert and Alberto García Durán: Multi-Modal Neural Link Prediction
Kristian Kersting: Lifted Statistical Machine Learning
Fabrizio Riguzzi: Probabilistic Inductive Logic Programming
Vibhav Gogate: Lifted Systematic Search and Sampling
David Poole: TBA

Up to date information can be found at the event website
http://acai2018.unife.it/.

ACAI 2018 is part of the Relational Artificial Intelligence Days 2018 (RAID 2018, http://raid2018.unife.it/ ), which will be held in Ferrara, Italy, on August 27th 2018 - September 4th 2018. RAID includes, besides ACAI 2018, also:
- PLP 2018: 5th Workshop on Probabilistic Logic Programming, September 1st 2018, http://stoics.org.uk/plp/plp2018/ ;
- ILP 2018: 28th International Conference on Inductive Logic Programming, September 2nd - 4th 2018, http://ilp2018.unife.it/ .

Probabilistic Logic Programming (PLP) addresses the need to reason about relational domains under uncertainty arising in a variety of application domains. PLP is part of a wider current interest in probabilistic programming. PLP 2018 aims to bring together researchers in all aspects of probabilistic logic programming, including theoretical work, system implementations and applications.

The ILP conference series, started in 1991, is the premier international forum for learning from structured or semi-structured relational data. Originally focusing on the induction of logic programs, over the years it has significantly expanded and it welcomes contributions to all aspects of learning in logic, multi-relational data mining, statistical relational learning, graph and tree mining, learning in other (non-propositional) logic-based knowledge representation frameworks, exploring intersections to statistical learning and other probabilistic approaches.

RAID 2018 offers a very good opportunity to get up to date with the latest trends in logical and relational AI. We really hope to meet you in Ferrara!

Organizers
Kristian Kersting, TU Darmstadt, Germany
Marco Lippi, University of Modena and Reggio Emilia, Italy
Sriraam Natarajan, University of Texas at Dallas, USA
Fabrizio Riguzzi, University of Ferrara, Italy
Elena Bellodi, University of Ferrara, Italy
Tom Schrijvers, KU Leuven, Belgium
Riccardo Zese, University of Ferrara, Italy

[DMANET] Reminder: [Algorithms] The 2018 Algorithms Travel Award—Open for Application

Dear Colleagues,

We are pleased to announce the 2018 Algorithms PhD Students Travel Award
sponsored by our journal. The award aims to assist junior researchers to
attend an international conference.

The 2018 Algorithms Travel Award consists of 800 CHF.

Candidates must meet the following requirements:

• PhD students whose research involves algorithms and their applications
• Attend an international conference in 2018 to present research (either
via an oral presentation or poster) in the area of algorithms and their
applications, and provide a letter of acceptance from the conference
organizer

The required application materials include:
• An abstract for the conference
• Curriculum Vitae, including a complete list of publications
• Letter of support from their mentors

Please send your applications to algorithms@mdpi.com or
yi.zhang@mdpi.com by 31 May 2018. The winner will be announced by 15
June 2018. Please visit our website for details here
http://www.mdpi.com/journal/algorithms/awards.

We look forward to receiving your applications.

Kind regards,

Ms. Yi Zhang
Managing Editor
E-Mail: algorithms@mdpi.com
Algorithms (http://www.mdpi.com/journal/algorithms)

On behalf of

Prof. Dr. Henning Fernau
Editor-in-Chief of Algorithms
Theoretical Computer Science, FB 4 - Abteilung Informatik,
Universität Trier, D-54286 Trier, 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/
*
**********************************************************

Wednesday, May 16, 2018

[DMANET] CFP Special Sessions: DS-RT 2018 - Madrid, Spain, October 15-17, 2018

********** CALL FOR PAPER **********

DS-RT 2018, the 22nd IEEE/ACM International Symposium on Distributed
Simulations and Real Time Applications, is running three special sessions
this year:
- Distributed Simulations of Distributed Systems
- Agent-based Modeling and Simulation
- Simulation of Urban Traffic Management and ITS

These special sessions cover important areas of the field of distributed
simulations and real time applications, and many papers were accepted in
previous editions of DS-RT on the same topics. See below for more detailed
descriptions of those special sessions.
Accepted works will be published in the main track of IEEE DS-RT 2018
proceedings.


***** PAPER SUBMISSION AND REVIEW *****

Submitted manuscripts must be in standard IEEE two-column format that is
used for IEEE conference proceedings and must not exceed "8 pages" (2-page
extension allowed), including figures, tables and references. Standard IEEE
templates for Microsoft Word or LaTeX formats can be found at:
- http://www.ieee.org/conferences_events/conferences/publishing/
templates.html

A submission may present preliminary results, propose new research
direction, provide insightful retrospective, or offer a provocative
viewpoint on important topics related to the considered special session.
Papers will be selected based on their likelihood of generating insightful
technical discussions at the special session and influencing future
research. Papers must be unpublished and must not be submitted for
publication elsewhere. All papers will be reviewed by Technical Program
Committee members and other experts active in the field to ensure high
quality and relevance to the conference and the special session. At least
one author of accepted papers must attend the conference and present its
contribution. Accepted papers will appear in the conference proceedings to
be published by IEEE Press.


***** IMPORTANT DATES *****

Full paper submission deadline: June 10th, 2018
Paper acceptance notification: July 10th, 2018


***** FOR MORE INFORMATION *****

For questions about the paper submission and review process, please contact
the session organisers - find all relevant information on the corresponding
web pages below.


***** DESCRIPTION OF THE SPECIAL SESSIONS *****

* Special Session on Distributed Simulations of Distributed Systems *

Distributed simulation (DS) is a valuable tool for understanding and
evaluating distributed systems. The current computing trend sees businesses
and individuals moving toward a more centralized infrastructure, namely the
cloud. On the one hand, as the computing infrastructure at data centers is
highly complex and distributed, DS becomes essential for diagnosing and
gaining insights of the system. On the other hand, the scale and nature of
interaction between different components in the cloud present new
challenges and push DS's state of the art.

Another computing trend that has potential to drive DS is
internet-of-things. Such complex systems consist of a large number of
autonomous, heterogeneous devices communicating with one another in
non-uniform manner. DS is valuable not only for discerning system
properties but also for predicting the devices' emergent behavior. Finally,
users in online social networks make up large distributed systems. Insights
of user interaction and the network's collective behavior --- the study of
which fits well into the realm of DS --- bring significant value to both
the society and the business of social network providers.

This special session seeks to bring together experts and practitioners in
the domain of DS to discuss new opportunities and challenges for DS. We
welcome research papers on both theoretical and empirical issues.

Web page: http://ds-rt.com/2018/dsimdsys_2018.htm

* Special Session on Agent-based Modeling and Simulation *

This special session focuses on general aspects and special properties for
agent-based modeling and simulations that allows them to be applied on
several scientific domains, such as sociology, physics, chemistry, biology,
ecology, and economy. The session is intended to bring together researchers
and practitioners, so they can present the current status of their work and
discuss the challenges they face in developing solutions and applications
for agent-based simulations. Consequently, the design of these simulations
aims not only to social contexts but also to more technical domains, which
involves highly complex interactive systems.

Web page: http://ds-rt.com/2018/abms_2018.htm

* Special Session on Simulation of Urban Traffic Management and ITS *

This special session focuses on simulation tools and real-time simulation
applications used in and for evaluation, management, and design of
Intelligent Transportation Systems (ITS), as well as Smart Cities. Such
simulations are expected to offer prediction and on-the-flow feedback for
the better decision-making, bringing up means for both the implementation
of more complex traffic management systems and end-user applications.
Off-line and real-time analyses of data collected from infrastructured
systems (e.g. real-time traffic information), mobile, distributed
technologies (e.g. communication devices), and socially-build systems (e.g.
social networks applications) are of great interest for shaping and
influencing how ITS solutions are designed. Thus, we are particularly
interested in how these data and technologies can be incorporated in
domain-related models and simulations. We aim to bring together experts
from both industry and academia to discuss the challenges related to
modelling and simulation for ITS.

Web page: http://ds-rt.com/2018/soiits_2018.htm


Best Regards,
DS-RT 2018 Special Session Chairs

**********************************************************
*
* 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 (MCDMT 2018)- 3rd Workshop on Modeling, Computing and Data (in conjuction with IISA 2018) - DEADLINE EXTENSION TO JUNE 1

Call for Papers

3rd Workshop on Modeling, Computing and Data Handling for Marine
Transportation (MCDMT 2018), July 23, 2018, Zakynthos, Greece

(http://iisa2018.unipi.gr/mcdmt/)

in association with the

9th International Conference on Information, Intelligence, Systems and
Applications ( IISA 2018 )

Workshop Chairs: Charalampos Konstantopoulos (University of Piraeus,
Greece), Grammati Pantziou (University of West Attica, Greece)

The Workshop on Modeling, Computing and Data Handling for Marine
Transportation (MCDMT 2018) is going to take place in Zakynthos, Greece, on
July 23, 2018, in conjunction with the 9th International Conference on
Information, Intelligence, Systems and Applications (IISA 2018). Nowadays,
advancements on Marine Transportation require the synergy of both computer
science and maritime science and the technical focus of the workshop is upon
the latest developments on Computing Methodologies for Marine
Transportation.

Papers with novel theoretical as well as applied research are welcome for
submission. We would like to invite papers addressing research efforts that
aim at making sea transportation more effective and safer, targeting complex
and large-scale optimization problems with conflicting criteria, requiring
innovative solution techniques and ideas from mathematical optimization,
theoretical computer science, massive data analysis and operations research.

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

- Graph and Network algorithms for Marine Transportation

- Combinatorial optimization techniques for Marine Transportation

- Weather Routing

- Environmentally Safe Shipping

- Safety and Security of Maritime Shipping

- Risk and Safety Analysis, Assessment and Prediction

- Piracy Protection

- GIS in Maritime Applications

- Spatiotemporal and Marine Data Handling

- Route Planning and Monitoring

- Maritime Data Mining and Knowledge Discovery Applications: surveillance,
maritime traffic control, anomaly detection, emergency management, situation
recognition, etc.

- Decision Support Tools for Marine Transportation

- Integration of Heterogeneous Marine Data Sources

Important Dates

Paper Submission: June 1, 2018

Author Notification: June 8, 2018

Camera-Ready: June 15, 2018

Workshop Program Committee

Pierre Cariou, World Maritime University, France

Marco Cococcioni, University of Pisa, Italy

Ali Diabat, New York University Abu Dhabi, UAE

Shahin Gelareh, University of Portsmouth, UK

Floris Goerlandt, Dalhousie University, Canada

Ignacy Kaliszewski, Systems Research Institute, Polish Academy of Sciences,
Poland

Qiang Meng, National University of Singapore, Singapore

Rahimeh Neamatian Monemi, University of Southampton, UK

Tatsushi Nishi, Osaka University, Japan

Nikolaos Rachaniotis, Democritus University of Thrace, Greece

Carlos Guedes Soares, Universidade de Lisboa, Portugal

Zorica Stanimirovic, University of Beograd, Serbia

Joanna Szlapczynska, Gdynia Maritime University, Poland

Jin Wang, Liverpool John Moores University, UK

Shuaian (Hans) Wang, The Hong Kong Polytechnic University, Hong Kong

Zaili Yang, Liverpool John Moores University, UK

Instructions for Authors

Submitted papers should include original work not previously published or
being under consideration in any journal, conference or other workshop.
Papers should be submitted as a pdf file and follow the IEEE conference
format, according to the general Instructions for Authors of IISA 2018. See
the IISA2018 Instructions for Authors page for appropriate templates for
both Latex and MS Word. Papers for MCDMT 2018 should be submitted through
the general IISA2018 paper submission system (EasyChair).

Accepted papers will be published in the IEEE Proceedings of IISA2018 and
will be included in the IEEE Xplore digital library (IEL,
http://ieeexplore.ieee.org). Authors of accepted papers must guarantee that
their paper will be presented at the workshop.


**********************************************************
*
* 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 postdoc position in Graph Theory in Pilsen

A POSTDOCTORAL RESEARCH POSITION
University of West Bohemia, Pilsen
----------------------------------

A postdoctoral position in graph theory is available at the University
of West Bohemia in Pilsen, Czech Republic, under the supervision of
prof. Zdenek Ryjacek. The applicant is expected to join research
activities in structural graph theory of the members of the Pilsen graph
theory team (Ryjacek, Kaiser, Nedela, Cada, Holub, Vrana and others).

The position carries a salary of 63.000 CZK (= approx. 2.500 Euro or
3.000 US dollars) per month.

Deadline for applications is June 15, 2018, and the expected starting
date is September 1, 2018, with a contract for up to 9 months.

A completed Ph.D., not older than 7 years, is a necessary condition.

More details can be found at
https://projekty.zcu.cz/tenders_mobility/#!/posts/1-FAV-07---prof.-RNDr.-Zdenk-Ryjaek-DrSc.---academic-worker/5
or
http://www.zcu.cz/pracoviste/per/Volna_mista/1-FAV-07_academic-worker.doc

or contact directly the supervisor at

Zdenek Ryjacek <ryjacek@kma.zcu.cz>

--

----------------------------------------------------------------------
Zdenek Ryjacek
Department of Mathematics
University of West Bohemia
Univerzitni 8
306 14 Pilsen, Czech Republic
e-mail: ryjacek@kma.zcu.cz
http://www.kma.zcu.cz/Ryjacek
----------------------------------------------------------------------
**********************************************************
*
* 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] Karlsruhe Graph Generators

Release of KaGen v1.00
------------------------------------

We are proud to announce the release of our massively distributed graph generation framework KaGen (Karlsruhe Graph Generation).
Our framework provides scalable graph generators for different graph models including:
Erdos-Renyi graphs, random geometric graphs, random Delaunay graphs, random hyperbolic graphs and Barabassi-Albert graphs.
Our generators are built using a communication-free paradigm that makes use of local recomputations instead of communication.
This is achieved by using divide-and-conquer schemes in combination with pseudorandomness via high-quality hash functions.
We hope that our generators provide new experimental possibilities for researchers and practitioners on a massive scale.

GitHub
https://github.com/sebalamm/KaGen

Best Regards,
Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Moritz von Looz


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