Friday, May 25, 2018

[DMANET] 1st Workshop on Multi-objective Reasoning in Verification and Synthesis (MoRe 2018): call for participation

[Apologies for multiple copies]

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

1st International Workshop on
Multi-objective Reasoning in Verification and Synthesis

MoRe 2018
http://math.umons.ac.be/more2018/

Friday 13th July 2018, Oxford, United Kingdom
FLoC 2018 workshop, affiliated with LICS 2018

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

TOPICS:

MoRe aims at bringing together researchers interested in multi-objective
reasoning for verification and synthesis.

Traditionally, verification and synthesis techniques focus on a single
qualitative or quantitative objective for the reactive system. In
practice, it is often desired that systems satisfy a functional
requirement expressed as a qualitative property, while optimising some
quantitative dimension (e.g., reach a target state while minimising the
energy consumption). Furthermore, there are numerous application contexts
in which reasoning simultaneously about multiple, heterogeneous
quantitative and qualitative characteristics is important. In many cases,
the analysis of such systems may be complicated by the fact that there
are trade-offs between objectives. Such trade-offs may also arise between
several interpretations of the same quantitative dimension: for example,
between the average-case and the worst-case performance of a system.

MoRe is a meeting place for researchers in the area of multi-objective
reasoning for verification and synthesis, with topics of interest
ranging from novel theoretical models to industrial challenges and
practical applications. Typical topics of the workshop include, but are
not limited to, formal approaches toward verification and synthesis in
the following settings:

- games (and related models) with multiple qualitative and quantitative
objectives;
- multi-criteria reasoning in probabilistic models (e.g., percentile
queries, quantiles, trade-off between worst-case and average-case
performance);
- probabilistic programs;
- extensions of timed automata including probabilistic or weighted
aspects;
- stochastic hybrid systems;
- temporal logics enabling quantitative reasoning;
- practical applications involving multi-objective challenges;
- any related attempt to tackle trade-offs between multiple criteria
in formal models for verification and synthesis.

INVITED SPEAKERS:

Christel Baier, Technische Universität Dresden, Germany
"Conditioning and quantiles in Markovian models"

Benjamin Monmege, Aix-Marseille Université, France
"A journey through negatively-weighted timed games: undecidability,
decidability, approximability"

ACCEPTED CONTRIBUTIONS:

Dimitri Scheftelowitsch
"Multi-Scenario Uncertainty in Markov Decision Processes"

Thomas Brihaye, Mickael Randour and Cédric Rivière
"Stochastic o-minimal hybrid systems"

Thomas Brihaye, Véronique Bruyère, Aline Goeminne and Jean-François Raskin
"Constraint Problem for Weak Subgame Perfect Equilibria with omega-
regular Boolean Objectives"

Véronique Bruyère, Quentin Hautem and Jean-Francois Raskin
"Parameterized complexity of games with monotonically ordered omega-
regular objectives"

Adrien Le Coent, Kim Guldstrand Larsen, Marco Muniz and Jiri Srba
"Comfort and Energy Optimization for Floor Heating Systems"

Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen and Tim Quatmann
"Multiple Objectives and Cost Bounds in MDP"

Gilles Geeraerts, Shibashis Guha and Jean-Francois Raskin
"Safe and Optimal Scheduling of Hard and Soft Tasks"

Mohammadhosein Hasanbeig, Alessandro Abate and Daniel Kroening
"Logically-Constrained Reinforcement Learning"

REGISTRATION:

Through the FLoC registration web page: https://www.floc2018.org/register/
Early registration deadline is 6 June.

ORGANISATION:

Program committee chairs

- Mickael Randour, UMONS - Université de Mons, Belgium
- Jeremy Sproston, University of Turin, Italy

Program committee

- Shaull Almagor, University of Oxford, UK
- Nathalie Bertrand, INRIA Rennes Bretagne-Atlantique, France
- Véronique Bruyère, UMONS - Université de Mons, Belgium
- Krishnendu Chatterjee, IST Austria, Austria
- Joost-Pieter Katoen, RWTH Aachen, Germany
- Sadegh Soudjani, University of Newcastle, UK
- Ufuk Topcu, University of Texas at Austin, USA
- Ashutosh Trivedi, University of Colorado Boulder, 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/
*
**********************************************************

Thursday, May 24, 2018

[DMANET] Call for Participation: Workshop on Game Theory and Experimental Economics, June 14/15, HU Berlin

We kindly invite you to the GOR (German Society of Operations Research) B-Conference co-funded by the Einstein-Center for Mathematics (ECMath) on Game Theory and Experimental Economics. The workshop takes place on 14 and 15 June 2018 at the Heilig-Geist-Kapelle within the School of Business and Economics (HU Berlin) in the center of Berlin. The aim of the workshop is to foster collaboration and state-of-the-art research at the interface of (algorithmic) game theory and experimental economics with a focus on economic and managerial problems.

This invitation particularly addresses also those researchers (but not exclusively) that did not have much contact with GOR yet and whose research interests are in management, economics, computer science, mathematics or other related fields considers game-theoretical approaches. The relevant methodology incorporates cooperative and non-cooperative game theory as well as experiments and field studies.

A main goal of the conference is connecting researchers and research. We therefore encourage participants to present state-of-the-art reviews on active research for a diverse audience. Please contact max.klimm@hu-berlin.de <mailto:max.klimm@hu-berlin.de> until May 30, 2018 for registration and indicate whether you would like to give a talk. There is no participation fee. Invited Keynotes are given by Dorothea Kübler (WZB) and Felix Fischer (QMUL). For further and updated information please visit https://hu.berlin/gtee <https://hu.berlin/gtee>.

Max Klimm (HU Berlin) and Guido Voigt (U Hamburg)
**********************************************************
*
* 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 CfP & Submission Deadline Extension: ATMOS 2018

2nd CALL FOR PAPERS - ATMOS 2018
-----------------------------------------------------------------
SUBMISSION DEADLINE EXTENDED TO 24.06.2018
-----------------------------------------------------------------

18th Workshop on Algorithmic Approaches for Transportation Modeling,
Optimization, and Systems

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

The workshop on Algorithmic Approaches for Transportation Modeling,
Optimization, and Systems (ATMOS) is an annual event bringing together
researchers and practitioners who are interested in all aspects of
algorithmic methods and models for transportation optimization. The
workshop provides a forum for the exchange and dissemination of new
ideas and techniques. The aim of making transportation better gives rise
to very complex and large-scale optimization problems requiring
innovative solution techniques and ideas from mathematical optimization,
theoretical computer science, and operations research. Applicable tools
and concepts include those from graph and network algorithms,
combinatorial optimization, approximation and online algorithms,
stochastic and robust optimization.

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

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


IMPORTANT DATES

Submission deadline:    Su, 24.06., 24:00 GMT (extended by 1 week)
Notification:           Fr, 20.07.

ATMOS 2018: 23-24 August 2018
ALGO  2018: 20-24 August 2018

-----------------------------------------------------------------
 
TOPICS

We invite authors to present work that advances optimization methods and
algorithms to facilitate planning and operational management of freight
and passenger transportation and traffic. The workshop welcomes but is
not limited to papers addressing the following challenges:

    Demand Forecasting
    Models for User Behavior
    Design of Pricing Systems
    Infrastructure Planning
    Multi-modal Transport Optimization
    Mobile Applications for Transport
    Congestion Modeling and Reduction
    Line Planning
    Timetable Generation
    Routing and Platform Assignment
    Vehicle Scheduling
    Route Planning
    Crew and Duty Scheduling
    Rostering
    Delay Management
    Routing in Road Networks
    Traffic Guidance
    Electro Mobility

The workshop welcomes but is not limited to papers applying and
advancing the following techniques: Graph and Network Algorithms,
Combinatorial Optimization, Mathematical Programming, Approximation
Algorithms, Methods for the Integration of Planning Stages, Stochastic
and Robust Optimization, Online and Real-time Algorithms, Algorithmic
Game Theory, Heuristics for Real-world Instances, Simulation Tools.

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

SUBMISSIONS

Authors are invited to submit an extended abstract or full paper of at
most 12 pages (including title page and abstract, but not counting
references and an optional appendix). Submissions must be formatted in
LaTeX, using the OASIcs style file. The paper should contain a succinct
statement of the issues and of their motivation, a summary of the main
results, and a brief explanation of their significance, accessible to
non-specialist readers. Proofs omitted due to space constraints can be
put into an appendix to be read by the program committee members at
their discretion. Papers must be submitted electronically via the
EasyChair submisson system at
https://easychair.org/conferences/?conf=atmos18. The submission must be
received by June 24, 2018. By submitting a paper the authors acknowledge
that in case of acceptance at least one of the authors must register at
ALGO 2018 or ATMOS 2018, attend the conference, and present the paper.

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

DISSEMINATION, AWARDS

The proceedings of ATMOS 2018 will be published online and as
open-access in the Dagstuhl Open Access Series in Informatics (OASIcs).

Selected papers will be invited for publication in a special issue of
'NETWORKS'.

There will be a BEST PAPER award as well as a BEST VGI PAPER award for
the paper that best leverages volunteered geographic information in
meaningful and novel ways.

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

SPONSORS

  MODAL
  TomTom
  VGI science

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

INVITED SPEAKER

  Dennis Huismann

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

PC

  Markus Bohlin
  Ralf Borndörfer (co-chair)
  Stefan Funke 
  Natalia Kliewer 
  Spyros Kontogiannis
  Alexander Kröller 
  Jesper Larsen
  Carlo Mannino
  Matthias Müller-Hannemann
  Guvenc Sahin
  Peter Sanders 
  Marie Schmidt    
  Sabine Storandt (co-chair)
  Pieter Vansteenwegen 
  Renato Werneck

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

ORGANIZING COMMITTEE (ALGO)

  Parinya Chalermsook · Aalto University
  Petteri Kaski · Aalto University
  Jukka Suomela · Aalto University

--

Prof. Dr. Ralf Borndoerfer

Zuse Institute Berlin, Optimization
Freie Universität Berlin, Mathematics
Takustrasse 7, 14195 Berlin, Germany
Fon: +49.30.84185-243
Sec: -209
Fax: -269
E-mail: mailto:borndoerfer@zib.de
WWW: http://www.zib.de/borndoerfer

**********************************************************
*
* 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 - NEW DEADLINE

Due to some administrative reasons, the call for applications, announced
on May 16 (see the message below), had to be reopened with slightly
modified conditions.

The main parametrers (duration, salary, starting date) remain the same,
but the deadline for application is extended to June 23, 2018.

For more details, see
https://projekty.zcu.cz/tenders_mobility/#!/posts/1-FAV-07---prof.-RNDr.-Zdenk-Ryjaek-DrSc.---academic-worker/5
or
https://zcu.cz/export/sites/zcu/research/Grantovy-system/1-FAV-07_academic-worker.pdf

or contact directly the supervisor at

Zdenek Ryjacek <ryjacek@kma.zcu.cz>

-------- Přeposlaná zpráva --------
Předmět: [DMANET] A postdoc position in Graph Theory in Pilsen
Datum: Wed, 16 May 2018 14:48:47 +0200
Od: Zdenek Ryjacek <ryjacek@kma.zcu.cz>
Komu: dmanet@zpr.uni-koeln.de

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] Timetabling Practitioners' Day - 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2018)

Dear Practitioner,

Are you a professional involved in timetabling of lectures and exams at
universities or other schools? You may then be aware that the 12th
International Conference on the Practice and Theory of Automated Timetabling
(PATAT) will be held in Vienna during 28-31 August 2018.

The timetabling research community wants to hear from you! Join us for
debates, discussions and talks. If you're an experienced higher education
timetabler, you'll know how far the technology behind timetabling software
has improved over the years. But it still has a long way to go.

PATAT is the forum where the leading lights of the international automated
timetabling research community have been meeting to discuss the latest
advances in research since 1995. While their research covers the full
spectrum of timetabling applications - essentially everything in education,
healthcare, transport and industry that uses a timetable - Practitioners'
Day is a new initiative for 2018 aimed at timetablers from education.

The day will give practitioners the chance to sit down with researchers to
both learn more about advances in automated timetabling and how this will
improve the quality and efficiency of their work in the future, and share
their valuable end-user experience as a way of guiding future research work.
It should be a win-win for everyone involved. The practitioners will also
have the opportunity to hear the invited speakers and visit the talks of
accepted papers scheduled on August 30. Would you be willing to attend, give
a presentation, demonstrate a commercial software application, lead a
discussion, or merely to participate? If so please let us know before 25
June 2018 which is also the early registration deadline to allow us time to
put the timetable together. Although all are welcome to register for the
full conference and networking events, it is hoped that the 1 day
registration will encourage as many practitioners as possible to attend the
PATAT conference.

We are particularly interested in presentations regarding:

- Best practices

- Experiences

- Challenges

- Solutions

- Ideas

Speakers should send us a 1-2 page abstract of their topic to Barry
McCollum: b.mccollum@qub.ac.uk

by 7th July.

Please visit our website at http://www.patatconference.org/patat2018/ttpd/
for more information about the conference and to access our registration
system. Questions can also be sent directly to the organizers of PATAT 2018.

Important Dates:

* Early Registration Closes: 25 June, 2018

* Abstract Submission Deadline for Practitioners: 7 July, 2018

* PATAT Conference: 28-31 August, 2018

* Timetabling Practitioners' Day: 30 August, 2018

We are looking forward to hearing from you,

PATAT 2018 Organising Committee


This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please contact the sender and delete the email and
attachment.

Any views or opinions expressed by the author of this email do not
necessarily reflect the views of the University of Nottingham. Email
communications with the University of Nottingham may be monitored
where permitted by law.

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

[DMANET] Summer School on Algebraic Statistics Sep 24-28

Summer School on Algebraic Statistics
September 24-28, 2018 in Tromsø, Norway - above the polar circle.

The summer school focuses on the interplay of Algebra and Statistics and will feature four interesting mini courses presented by invited speakers and contributed talks by participants.

The mini courses are on the following topics:
Kaie Kubjas<http://www.kaiekubjas.com/> (Aalto University): Algebraic methods for maximum likelihood estimation.
Fatemeh Mohammadi<http://www.bristol.ac.uk/maths/people/fatemeh-mohammadi/index.html> (University of Bristol): Algebra and geometry of conditional independence statements and probabilistic graphical models
Carlos Amendola<http://www.luke-amendola.appspot.com/> (Technische Universität München): Signature Tensors
Sonja Petrovic<http://math.iit.edu/~spetrov1/> (Illinois Institute of Technology): The role of algebraic statistics in estimation and modelling of random graphs and networks

There is no registration fee but in order to plan lunches and dinners (which are free of charge) a registration is required.
Further, we have pre-booked beds in twin rooms in a Hotel, which we can offer to 30 participants thanks to support of the Tromsø Research Foundation (TFS).


Additionally to the interesting mini courses an talks
the participants have good chances to see Northern Lights during the nights.
Application and more information:
https://site.uit.no/alg-stat/<https://deref-gmx.net/mail/client/BqQryHpEsSo/dereferrer/?redirectUrl=http%3A%2F%2Fwww.hcm.uni-bonn.de%2Fcombinatorial-optimization-2018%2F>

Organizers: Cordian Riener, Hugues Verdure
UiT - The Arctic University of Norway



**********************************************************
*
* 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: MATCH-UP 2019

First announcement: MATCH-UP 2019

5th International Workshop on Matching Under Preferences Congressi Stefano Franscini, Monte Verita, Ascona, Switzerland, 26-29 May 2019

Web page: http://www.optimalmatching.com/MATCHUP2019

Introduction
MATCH-UP is a series of interdisciplinary and international workshops on matching under preferences. The remit of these workshops is to explore matching problems with preferences from the perspective of algorithms and complexity, discrete mathematics, combinatorial optimization, game theory, mechanism design and economics, and thus a key objective is to bring together the research communities of the related areas.

Background
Matching problems with preferences occur in widespread applications such as the assignment of school-leavers to universities, junior doctors to hospitals, students to campus housing, children to schools, kidney transplant patients to donors and so on. The common thread is that individuals have preference lists over the possible outcomes and the task is to find a matching of the participants that is in some sense optimal with respect to these preferences.

List of topics
The matching problems under consideration include, but are not limited to:
* two-sided matchings involving agents on both sides (e.g. college admissions, resident allocation, job markets, school choice, etc.)
* two-sided matchings involving agents and items (e.g. house allocation, course allocation, project allocation, assigning papers to reviewers, school choice, etc.)
* one-sided matchings (roommates problem, kidney exchanges, etc.)
* matching with payments (assignment game, etc.)

Important dates (provisional)
* Paper submission deadline: 15 January 2019
* Notification: 22 February 2019
* Final version for proceedings: 15 March 2019
* Poster abstract submission deadline: 1 April 2019
* Workshop: Sunday 26 May (starting at 1400) to Wednesday 29 May (ending at 1830) with an excursion in the afternoon of Tuesday 28 May

For further information, see the workshop web page at http://www.optimalmatching.com/MATCHUP2019.

**********************************************************
*
* 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 PhD positions in OR at the University of Naples Federico II

The Operations Research Group of the Department of Electrical Engineering and Information Technology, University "Federico II" of Naples, announces the three years PhD Programme in INFORMATION TECHNOLOGY AND ELECTRICAL ENGINEERING (ITEE).

The PhD program includes also a curriculum in Operations Research for students with background in optimization and computer science.
The topics of the PhD positions will be both methodological and applicative, with particular emphasis on integer and network optimization problems arising in transportation, logistics and communication network fields.

The program will start on November 2018, and the deadline for the presentation of the applications will be in September 2017 (more information will come in successive emails).

The interested candidates are invited to contact Antonio Sforza (antonio.sforza@unina.it), Maurizio Boccia (maurizio.boccia@unina.it) and Claudio Sterle (claudio.sterle@unina.it) for further information, sending also a CV and a description of their interests and experiences.

Best regards

Antonio Sforza, full professor of OR
Maurizio Boccia, associate professor of OR
Claudio Sterle, assistant professor of OR

Optimization and Problem Solving Laboratory (http://opslab.dieti.unina.it)
Department of Electrical Engineering and Information Technology (www.dieti.unina.it)
University "Federico II" of Naples Via Claudio 21, 80125, Naples, Italy (www.unina.it)


---
Dona il 5 per mille all'Università Federico II per sostenere studenti e ricercatori
Codice Fiscale Università degli Studi di Napoli Federico II 00876220633

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