Thursday, February 28, 2019

[DMANET] Open PhD position "Evolutionary Diversity Optimisation"

The Optimisation and Logistics group at the

School of Computer Science,
The University of Adelaide, Australia

has a 3 year scholarship available for a Ph.D. Student working
within the ARC Discovery Project "Evolutionary Diversity Optimisation".

We are seeking an excellent candidate with a master or diploma in
mathematics, theoretical computer science or a related field.
The successful applicant should carry out theoretical work on
evolutionary algorithms, ant colony optimisation, and related bio-inspired computing methods.
Candidates having experiences in the field of randomised methods, statistics and/or
computational complexity of bio-inspired computation are highly encouraged to apply.

Currently, around 20 researchers
from several nationalities work in the Optimisation and Logistics group.
The group collaborates with several of the major research
institutions in Europe and the U.S. and has high international visibility.
For more information, please visit http://cs.adelaide.edu.au/~optlog/

Applications (including curriculum vitae, list of publications if
applicable, list of university grades, and names of two references with their
e-mail addresses) must be sent by email in PDF format with subject line
"PhD application: Evolutionary Diversity Optimisation" to Frank Neumann
(frank.neumann@adelaide.edu.au<mailto:frank.neumann@adelaide.edu.au>) by March 31, 2019.


--------
Frank Neumann
Professor
Postgraduate Coordinator
Optimisation and Logistics
School of Computer Science
University of Adelaide, Australia
Adelaide, SA 5005
Australia
www.cs.adelaide.edu.au/~frank<http://www.cs.adelaide.edu.au/~frank>

**********************************************************
*
* 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] Call for Papers: Special Issue of Annals of Operations Research "Towards Operations Research for all", CLAIO 2018

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

CALL FOR PAPERS, Annals of Operations Research
Special Issue: Towards Operations Research for all: XIX Latin Iberian
American Conference on Operations Research, CLAIO 2018

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

The journal Annals of Operations Research seeks submissions for a
special issue "Towards Operations Research for all: XIX Latin Iberian
American Conference on Operations Research, CLAIO 2018".

We invite all participants of CLAIO 2018 to submit the full version of
their presented contributions to this special issue. Submissions from
other regions worldwide are also welcome, providing they fall within the
scope of the conference (see
http://www.sopios.org.pe/claio2018/about#topics). Manuscripts will be
subject to a strict review process managed by the Guest Editors and
accepted papers will be published online individually, before print
publication. Contributions arising from papers given at a conference
should be substantially extended, and should cite the conference paper
where appropriate.

The deadline for submission is June 1st, 2019.

Instructions for authors can be found at
http://www.springer.com/business/operations+research/journal/10479

All manuscripts must be written in English and prepared in accordance
with the journal's instructions for authors available at the journal web
site (see below). Authors should submit a cover letter and a manuscript
by June 1st, 2019, via the Journal's online submission site at
http://www.editorialmanager.com/anor/default.aspx

Within the Editorial Manager system, please choose "S.I.: CLAIO 2018" as
the article type.

Guest Editors:

- Flavia Bonomo, Department of Computer Science, Universidad de Buenos
Aires, Argentina

- Antonio Mauttone, Faculty of Engineering, Universidad de la República,
Uruguay

- Jaime Miranda, Department of Management Control and Information
Systems, Faculty of Economics and Business, Universidad de Chile, Chile

- Erik Papa, Department of Mathematical Science, Universidad Nacional
Mayor de San Marcos, Peru

Contact information: Antonio Mauttone, mauttone@fing.edu.uy

**********************************************************
*
* 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] IEEE Machine learning Workshop for Networks- co-located with IEEE 15 th IWCMC 2019, June 24-28, Tangier – Morocco -Final Call [Deadline - March 10]

- BASED ON MANY REQUESTS, THE FINAL DEADLINE IS EXTENDED TO March. 10
(FIRM)

- We apologize if you receive multiple copies of this CFPs.

- We appreciate your help to forward this CFPs to your friends & email
lists.
CALL FOR PAPERS

*Machine learning Workshop IWCMC 2019*

The IEEE 15th International Wireless Communications and Mobile Computing
Conference

Tangier, Morocco

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

Dear Colleagues,

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

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

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

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

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

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

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

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

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

Organizing Committee
- Prof. Abderrahim Sekkaki, University HASSAN II of Casablanca, Morocco,
abderahim.sekkaki@univh2c.ma
- Prof. Carlos Becker Westphall ,Federal University of Santa Catarina,
Brazil, carlosbwestphall@gmail.com
- Dr.Mohamed LAHBY, University HASSAN II of Casablanca, Morocco,
mlahby@gmail.com
- Prof.Tarek BEJAOUI, University of Carthage, Tunisia,
tarek.bejaoui@ieee.org

Regards,
on Behalf of the Program Committee 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: Special Section: Advances in Intelligent Transportation Systems in Smart Cities

Special Section: Advances in Intelligent Transportation Systems in Smart Cities


International Journal of Distributed Sensor Network

2017 Impact Factor : 1.787

Deadline for manuscript submissions: June 30, 2019

Intelligent Transport Systems (ITS) comprise the union of several technologies with the aim of providing comprehensive optimization of the urban mobility of a city and bringing greater safety to drivers, as well as comfort and entertainment for passengers. As a result, ITS employ data, communication, and computing to provide services and applications for tackling and possibly solving a wide range of transportation problems in modern large cities. These applications rely on the collaboration between elements that integrate urban and transportation systems, such as sensors, mobile devices, and vehicles, for introducing real-time awareness of the environment. The appropriate junction of all these factors considerably contributes to the sensing and gathering of data for evaluation and later implementation of due responses by a control system.


Due to the dynamic nature of entities in ITS, it offers a diverse set of challenges including, but not limited to, interoperability, high mobility, decentralization, anonymity, security, privacy, trust management, uncertainty, and pervasiveness. Besides these challenges, several issues like scalability, reliability, adaptability, and validity of available solutions are still unexplored.


This Special Collection is expected to provide a platform for academics and industrial researchers to identify and debate technical problems and recent accomplishments associated with ITS. Specific topics include, but are not limited to:


* Architecture, resource management and applications

* Leveraging Fog Computing (Edge Computing)

* Design challenges for protocol development in ITS

* ITS security and privacy

* Smart-cities-based Machine Learning;

* Intelligent data mining and forecasting;

* Multi-agent systems applications;

* Inteligent structural engineering;

* Computer graphics and performability;

* Blockchain and remote sensing;

* Ubiquitous computing;

* Fuzzy logic and emerging applications in smart IoT/Cloud paradigms;

* Designing energy efficient Road Side Units (RSUs)

* Quality of Service (QoS) in ITS

* Smart and connected vehicles: V2V; V2I V2X

* Cloud based VANETs

* Vehicular Cloud

* Demand responsive smart vehicles

* Detection, recognition, and classification of traffic

* Vehicle location and event prediction

* Autonomous vehicle technologies

* Context-aware computing and Internet of Things Services in ITS

* Artificial intelligent in ITS

* Protocols and infrastructure and standards for ITS

Guest Editors:


Rodolfo Ipolito Meneguette, Federal Institute of São Paulo, Brazi,

Luis Hideo Vasconcelos Nakamura, Federal Institute of São Paulo, Brazil

Thiago Augusto Lopes Genez, University of Bern, Switzerland

Stephan Reiff-Marganiec, University of Leicester, UK


Manuscript Preparation and Submission

Follow the guidelines in the International Journal of Distributed Sensor Networks https://us.sagepub.com/en-us/sam/manuscript-submission-guidelines. Please submit your manuscript in electronic form through Manuscript Central web site: https://mc.manuscriptcentral.com/tii .

Submissions to this Special Section must represent original material that has been neither submitted to, nor published in, any other journal.


Open access article processing charge (APC) information

The APC for this journal is currently 2000 USD.

The article processing charge (APC) is payable only if your article is accepted after peer review, before it is published. The APC is subject to taxes where applicable. Tax-exempt status can be indicated by providing appropriate registration numbers when payment is requested.
**********************************************************
*
* 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] [FOGA XV] First CFP for ACM/SIGEVO Workshop on Foundations of Genetic Algorithms

The 15th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA
XV)
August 27-29, 2019
Potsdam, Germany
https://hpi.de/foga2019/

####################################
Important News
####################################

(1) As reflected by our program committee and the call for papers, FOGA
XV aims to be (more) inclusive with respect to the methodology applied,
i.e., we invite all works aiming to understand algorithms' performance,
regardless of whether this is achieved through a rigorous
mathematical investigation or a carefully crafted empirical studies.

(2) Note that this year camera-ready papers will be collected BEFORE the
conference, to allow a faster dissemination of the results, i.e., we do
no longer support post-conference proceedings

(3) FOGA XV will be co-located with the seventh COnfiguration and
SElection of ALgorithms (COSEAL) Workshop
(https://www.coseal.net/coseal-workshop-2019/),
organized by Holger Hoos and Marius Lindauer. COSEAL is a workshop
series for discussing the most recent advances in the automated
configuration and selection of algorithms. The workshop takes place just
before FOGA, on August 26 and 27.


####################################
Call for Papers and Important Dates
####################################

The FOGA workshop series aims at advancing our understanding of the
working principles behind evolutionary algorithms and related randomized
search heuristics, such as local search algorithms, differential
evolution, ant colony optimization, particle swarm optimization,
artificial immune systems, simulated annealing, and other Monte Carlo
methods for search and optimization. Connections to related areas, such
as Bayesian optimization and direct search, are of interest as well.

FOGA is the premier event to discuss advances on the theoretical
foundations of these algorithms, tools needed to analyze them, and
different aspects of comparing algorithms' performance. Topics of
interest include, but are not limited to:

Run time analysis
Mathematical tools suitable for the analysis of search heuristics
Fitness landscapes and problem difficulty
(On- and offline) configuration and selection of algorithms,
heuristics, operators, and parameters
Stochastic and dynamic environments, noisy evaluations
Constrained optimization
Problem representation
Complexity theory for search heuristics
Multi-objective optimization
Benchmarking aspects, including performance measures, the selection
of meaningful benchmark problems, and statistical aspects
Connection between black-box optimization and machine learning

Submissions covering the entire spectrum of work, ranging from
rigorously derived mathematical results to carefully crafted empirical
studies, are invited.

Accepted papers will be published in proceedings by ACM Press.
Authors should submit their papers (15 page maximum) consistent with the
alternate ACM SIG style file by the submission deadline.
Submissions are made through EasyChair:
https://easychair.org/conferences/?conf=foga2019

Important Dates:
Deadline for paper submission: April 17, 2019 (non-extensible)
Author rebuttal phase: May 21-23, 2019
Notification of authors: June 5, 2019
Camera-ready paper: June 21, 2019

Organizers:
Tobias Friedrich, Hasso Plattner Institut, Potsdam, General Chair
Dirk Arnold, Dalhousie University, Program Chair
Carola Doerr, CNRS researcher at Sorbonne University, Paris, Program
Chair
**********************************************************
*
* 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: CEC 2019 Workshop on Understanding of Evolutionary Optimization Behavior (UEOB 2019)

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

We are organising the workshop "Understanding of Evolutionary
Optimization Behavior (UEOB 2019)" at the IEEE Congress on Evolutionary
Computation 2019 (http://cec2019.org/programs/workshops.html#cec-02) in
Wellington, New Zealand.

Please consider to contribute to and/or forward to the appropriate
groups the following opportunity to present original research articles
in CEC 2019.


SCOPE

The focus of the UEOB 2019 is to highlight theoretical and empirical
research that investigates approaches needed to analyze stochastic
optimization algorithms and performance assessment with regard to
different criteria. The main goal is to bring the problem and importance
of understanding optimization algorithms closer to researchers and to
show them how and why this is important for future development in the
optimization community. This will help researchers/users to transfer the
gained knowledge from theory into the real world, or to find the
algorithm that is best suited to the characteristics of a given
real-world problem.

More detailed information can be found at http://cs.ijs.si/ueob/.


TOPICS OF INTEREST

- Data-driven approaches (machine learning/information
theory/statistics) for assessing algorithm performance
- Vector embeddings of problem search space
- Meta-learning
- New advances in analysis and comparison of algorithms
- Operators influence on algorithm behavior
- Parameters influence on algorithm behavior
- Theoretical algorithm analysis


SUBMISSION GUIDELINES

All submissions should be formatted according to the CEC 2019 submission
guidelines provided at http://www.cec2019.org/papers.html#submission.
All submissions will be handled through EasyChair
(https://easychair.org/conferences/?conf=ueob2019) and reviewed by the
program committee.

In order to participate to this workshop, a full or a student
registration at CEC 2019 is required.

Selected papers will be invited to be extended for a special issue in
Natural Computing (https://link.springer.com/journal/11047).


IMPORTANT DATES

- Paper submission: 15 March, 2019
- Notification to authors: 31 March, 2019
- Early registration: 31 March, 2019
- Final submission: 15 April, 2019
- Conference: 10-13 June, 2019


ORGANIZERS

Tome Eftimov
Department of Biomedical Data Sciences, Stanford Medicine
Stanford University
USA

Peter Korošec
Computer Systems Department
Jožef Stefan Institute
Slovenia

Christian Blum
Artificial Intelligence Research Institute (IIIA-CSIC)
Spain

--

/Senior Research Scientist (IIIA-CSIC)
Area Editor Computers & Operations Research
https://www.iiia.csic.es/~christian.blum//


**********************************************************
*
* 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, February 27, 2019

[DMANET] [GECCO 2019] CFP: IAM Workshop - Industrial Applications of Metaheuristics

IAM 2019

4th GECCO Workshop on Industrial
Applications of Metaheuristics

IAM is held as part of the 2019 Genetic and Evolutionary Computation Conference (GECCO-2019), July 13-17, Prague, Czech Republic


Aims and Scope
================

Metaheuristics have been applied successfully to many aspects of applied mathematics and science, showing their capabilities to deal effectively with problems that are complex and otherwise difficult to solve. There are a number of factors that make the usage of metaheuristics in industrial applications more and more interesting. These factors include the flexibility of these techniques, the increased availability of high-performing algorithmic techniques, the increased knowledge of their particular strengths and weaknesses, the ever increasing computing power, and the adoption of computational methods in applications. In fact, metaheuristics have become a powerful tool to solve a large number of real-life optimization problems in different fields and, of course, also in many industrial applications such as production scheduling, distribution planning, and inventory management.

This workshop proposes to present and debate about the current achievements of applying these techniques to solve real-world problems in industry and the future challenges, focusing on the (always) critical step from the laboratory to the shop floor. A special focus will be given to the discussion of which elements can be transferred from academic research to industrial applications and how industrial applications may open new ideas and directions for academic research.

Topic areas include (but are not restricted to):

- Success stories for industrial applications of metaheuristics
- Pitfalls of industrial applications of metaheuristics.
- Metaheuristics to optimize dynamic industrial problems.
- Multi-objective optimization in real-world industrial problems.
- Meta-heuristics in very constrained industrial optimization problems.
- Reduction of computing times through parameter tuning and surrogate modelling.
- Parallelism and/or distributed design to accelerate computations.
- Algorithm selection and configuration for complex problem solving.
- Advantages and disadvantages of metaheuristics when compared to other techniques.
- New research topics for academic research inspired from industrial applications.


Submission
============

Authors can submit:
- Short contributions including position papers of up to 4 pages - and/or
- Regular contributions of up to 8 pages.

In both cases, it is mandatory to follow the official GECCO paper formatting guidelines. Please see the GECCO 2019 information for authors for further details, accessible through http://gecco-2019.sigevo.org. Papers do not need to be anonymized. Software demonstrations will also be welcome. Workshop papers must be submitted using the GECCO submission system this year. After login, the authors need to select the "Workshop Paper" submission form. In the form, the authors must select the workshop they are submitting to. The GECCO submission system accessible at https://ssl.linklings.net/conferences/gecco/. Further information on the workshop paper submission is available at http://gecco-2019.sigevo.org/index.html/tiki-index.php?page=Workshops.

Important Dates
=================

Submission deadline: April 3, 2019
Authors notification: April 13, 2109
Camera-ready submission: April 24, 2019
Workshop dates July 13 or 14, 2019
GECCO Conference, Prague, Czech Republic: July 13-17, 2019

Workshop Chairs
=================

Silvino Fernandez Alzueta (ArcelorMittal)
Pablo Valledor Pellicer (ArcelorMittal)
Thomas Stuetzle (Universite Libre de Bruxelles, ULB)

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

[DMANET] Postdoc position in computational topology at TU Graz

The Institute of Geometry at Graz University of Technology offers a
postdoc position, starting in July 2019 or later. The position is funded
by the FWF project "Algorithms for Topological Data Analysis" - see
http://www.geometrie.tugraz.at/kerber/algtda.php for project details.
The position is for one year, with the option to extend to a second year.

The ideal applicant has completed a PhD thesis in computational
topology/geometry or a related area and has demonstrated scientific
excellence through internationally peer-reviewed publications. Moreover,
experience in theoretical computer science and algorithm engineering is
a plus.

We offer
* an active and motivated research group on computational topology and
geometry
* an international and research-oriented mathematics department
* a competitive salary (~3800 EUR per month before taxes, 14x per year)
* a city with excellent quality of life

Applications including
* motivation letter
* CV with list of publications
* research statement
* 2-3 recommendation letters (can be sent separately)
should be sent until March 26 to kerber@tugraz.at. Applications after
the deadline will be considered until the position is filled.

Please contact Michael Kerber (kerber@tugraz.at) for any further questions.
**********************************************************
*
* 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] Extended deadline: EJTL Special Issue on "Combining optimization and machine learning: applications in vehicle routing, network design and crew scheduling"

Dear colleagues,

the deadline for the submission to the Special Issue on "Combining
optimization and machine learning: applications in vehicle routing,
network design and crew scheduling", published by the EURO Journal on
Transportation and Logistics, has been extended to May 31st, 2019.

In attachment you find the call for papers.

We look forward to your contribution.

Best regards,

Claudia Archetti


EJTL Special Issue on

Combining optimization and machine learning: applications in vehicle
routing, network design and crew scheduling

Guest editors: Claudia Archetti, Jean-François Cordeau, Guy Desaulniers

Submission deadline: May 31st, 2019

Several families of core problems in transportation and logistics such
as vehicle routing, network design and crew scheduling remain formidably
challenging to solve for the operations research community and, for most
of them, efficient algorithms are still sought after by the industry.
One recent research trend explores the possibility of combining
optimization and machine learning in innovative ways to design improved
algorithms. Machine learning and optimization can be applied
sequentially or in an integrated fashion. In the former case, machine
learning can be used, for example, to estimate some problem input (e.g.,
cost coefficients, customer demand, capacity) for the optimization
model, to preprocess data with the goal of reducing the size of the
model to solve, or to describe customer behavior and preferences. In the
latter case, machine learning can be applied, for example, to adjust the
values of some of the parameters controlling the optimization algorithm
or to make heuristic decisions within the algorithm (e.g., select a
branching variable or define a neighborhood to explore) to increase its
efficiency.

This special issue focuses on the development of innovative solution
methods that combine machine learning and optimization to efficiently
solve vehicle routing, network design and crew scheduling problems in
all transportation modes (freight, public transit, air, maritime, rail).
The proposed optimization algorithms can be exact or heuristic.

Topics of interest include (but are not limited to):

·Vehicle routing and its variants: capacitated, with profits,
stochastic, time-dependent, split delivery, pickup-and-delivery, etc.

·Inventory routing

·Location routing

·Transportation and supply chain network design

·Ship routing and scheduling

·Bus scheduling

·Fleet assignment / locomotive assignment

·Duty scheduling / crew pairing

·Crew scheduling / crew rostering

-
Claudia Archetti
Associate Professor in Operations Research
Dept. of Economics and Management
University of Brescia
Contrada S.ta Chiara 50
25122 Brescia
Italy
Tel: +39 030 2988587
Fax: +39 030 2400925
E-mail: claudia.archetti@unibs.it
web OR group: http://or-brescia.unibs.it
web: http://www.unibs.it/dipartimenti/metodi-quantitativi/personale-del-dipartimento/ricercatori/dottssa-archetti-claudia


--


Informativa sulla Privacy: http://www.unibs.it/node/8155
<http://www.unibs.it/node/8155>

**********************************************************
*
* 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] CEC-2019 Workshop on Data-driven Optimization and Applications (DDOA 2019)

We apologize for multiple posting. Please kindly disseminate this Call for Papers to your colleagues and contacts>

***********************************************************
CALL FOR PAPERS
***********************************************************

CEC-2019 Workshop on Data-driven Optimization and Applications (DDOA 2019)

http://www.dscil.cn/cfps/cec2019-workshop-cfps.html


Scope and aim:
Not all objective functions can be formulated using explicit equations, instead, they are normally evaluated using high precise simulation or computationally expensive experiments. So although meta-heuristic algorithms, including evolutionary algorithms and swarm optimization, have been paid more and more attention in real-world applications, they are limited for optimizing those problems with time-expensive performance evaluation on the design. Recently, the historical data are proposed to be utilized to train surrogate models using machine learning techniques in order to replace the compute-expense/time-expensive objective function during phases of the heuristic search. The successful applications can be found in aerodynamic design, structural design, drug design, and so on.
Despite surrogate-assisted meta-heuristic algorithms get successful application, there still remain many challenges for researchers to explore. For example, due to the curse of dimensionality and the insufficiency of the samples for model training, it is very difficult, if not impossible to train accurate surrogate models. Thus, appropriate model management techniques based on the characteristics of meta-heuristic algorithms play significant important role in the surrogate-assisted optimization. In addition, modern data analytics involving advance sampling techniques and learning techniques such as semi-supervised learning, transfer learning and active learning are highly beneficial for speeding up evolutionary search while bringing new insights into the problems of interest. Finally, the application problems for verifying the efficiency and effectiveness of different approaches are also indispensability.
This workshop aims to promote the research on data-driven optimization and extend meta-heuristic algorithms to solve time-expensive problems.

Topics of interest:
The topics of this workshop include but are not limited to the following topics:

* Surrogate-assisted meta-heuristic algorithms for computationally expensive problems
* Surrogate model management in single, multi/many-objective and constrained optimization
* Data collection approaches in surrogate-assisted optimization
* Adaptive model selection strategies and sampling for model training using active learning and statistical techniques
* Bayesian evolutionary optimization
* Approximation strategies
* Machine learning, such as deep learning for big data driven optimization
* Data-driven optimization using big data and data analytics
* Computationally efficient meta-heuristic algorithms for large scale and/or many-objective optimization problems
* Real world applications including multidisciplinary optimization
Submission:
The following information should be sent to the workshop chair, Dr. Chaoli Sun, chaoli.sun.cn@gmail.com<mailto:chaoli.sun.cn@gmail.com>, chaoli.sun@tyust.edu.cn<mailto:chaoli.sun@tyust.edu.cn> by email.
– Theme of Workshop: XXXXXX
– Name of presenter
– Title
– Abstract paper and full paper.
The submission format for the paper is the same as of CEC2019, at http://www.cec2019.org/papers.html#submission
In order to participate this workshop, full or student registration of CEC 2019 is needed.
Important Dates:
Paper submission: 15 March 2019
Decision notification: 31 March 2019
Final submission: 15 April 2019

Workshop organizers
Prof. Chaoli Sun, Taiyuan University of Science and Technology, Taiyuan, China
Prof. Handing Wang, School of Artificial Intelligence, Xidian University, China
Dr. Tinkle Chugh, Department of Computer Science, University of Exeter, UK
Prof. Yaochu Jin, Department of Computer Science, University of Surrey

Contact
Please feel free contact any of the special session organizers chaoli.sun@tyust.edu.cn<mailto:chaoli.sun@tyust.edu.cn> in case you have any questions about 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] Graphical Models for Security (GraMSec 2019) - CFP

GraMSec 2019: The Sixth International Workshop on Graphical Models for
Security
Hoboken, NJ, USA - June 24, 2019

http://gramsec.uni.lu
Co-located with CSF 2019

*Submissions received by April 5 receive priority consideration*

SCOPE
The use of graphical security models to represent and analyse the
security of systems has gained an increasing research attention over the
last two decades. Formal methods and computer security researchers, as
well as security professionals from the industry and government, have
proposed various graphical security models, metrics, and measurements.
Graphical models are used to capture different security facets and
address a range of challenges including security assessment, automated
defence, secure services composition, security policy validation, and
verification. For example, attack graphs, attack trees, attack-defence
trees, and attack countermeasure trees represent possible ways of
attacking and defending a system while misuse cases and mal-activity
diagrams capture threats and abusive behaviour of users.

TOPICS
This year, we encourage excellent submissions related, but not
restricted, to the following broad headings:
1. Graph representations: mathematical, conceptual, and implemented
tools for describing and reasoning about security
2. Logical approaches: formal logical tools for representing and
reasoning about graphs and their use as modelling tools in security
3. Machine learning: modelling and reasoning about the role of big data
and machine learning in security operations
4. Networks in national security: terrorist networks, counter-terrorism
networks; safety in national infrastructure (e.g., utilities and
transportation)
5. Risk analysis and management: models of risk management in business
and organizational architectures
6. Social networks: using and reasoning about social graphs, network
analysis, network protocols, social mapping, sociometry.
Preference will be given to papers likely to stimulate high-quality
debate at the Workshop.

SUBMISSION GUIDELINES
We solicit two types of submissions:
- Regular papers (up to 15 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work within
the scope of the workshop.
- Short papers (up to 7 pages, excluding the bibliography and
well-marked appendices) describing original and unpublished work in
progress.

The reviewers are not required to read the appendices, so the papers
should be intelligible without them. All submissions must be prepared
using the LNCS style. Each paper will undergo a thorough review process.
Submissions should be made using the GraMSec 2019 EasyChair website:
https://easychair.org/conferences/?conf=gramsec2019.

PUBLICATION
As in previous editions, post-proceedings will been made available in
the Lecture Notes in Computer Science (LNCS) series, published by
Springer. This will published after the workshop, thus permiting the
authors to incorporate feedback.

IMPORTANT DATES (NOTE THE TWO SUBMISSION DEADLINES)
Early submissions (priority in program, and early notification)
- Early paper submission due: Friday, April 5, 2019
- Notification for early submissions: Friday, May 3, 2019

Late submissions (after CSF notification)
- Late paper submission due: Monday, April 22, 2019
- Notification for late submissions: Monday, May 13, 2019

- Camera ready versions due: Monday, May 27
- Workshop: Monday, June 24. 2019

INVITED SPEAKER
George Cybenko, Dartmouth College

PROGRAM CHAIRS
Massimiliano Albanese, George Mason University, VA, USA
Ross Horne, University of Luxembourg, Luxembourg

GENERAL CHAIR
Christian W. Probst, Unitec, New Zealand

STEERING COMMITTEE
Sushil Jajodia, George Mason University, USA
Barbara Kordy, INSA Rennes, IRISA, FR
Sjouke Mauw, University of Luxembourg, Luxembourg
Christian W. Probst, Unitec, New Zealand
Ketil Stølen, SINTEF Digital and University of Oslo, Norway

PC MEMBERS
Ludovic Apvrille, Telecom ParisTech, France
Zaruhi Aslanyan, Alexandra Institute, Denmark
Stefano Bistarelli, Università di Perugia, Italy
Hasan Cam, U.S. Army Research Laboratory, PA, USA
Nora Cuppens-Boulahia, IMT Atlantique, France
Harley Eades III, Augusta University, GA, USA
Olga Gadyatskaya, SnT, University of Luxembourg, Luxembourg
René Rydhof Hansen, Aalborg University, Denmark
Jin B. Hong, University of Western Australia, Australia
DongSeong Kim, The University of Queensland, New Zealand
Barbara Kordy, INSA Rennes, IRISA, France
Sjouke Mauw, University of Luxembourg, Luxembourg
Per Håkon Meland, SINTEF ICT, Norway
Guozhu Meng, Chinese Academy of Sciences, Beijing, China
Guy McCusker, University of Bath, United Kingdom
Vivek Nigam, fortiss GmbH, Germany
Andreas Lothe Opdahl, University of Bergen, Norway
Noseong Park, George Mason University, VA, USA
Stéphane Paul, Thales Research and Technology, France
Sophie Pinchinat, INSA Rennes, France
Sasa Radomirovic, University of Dundee, United Kingdom
Rolando Trujillo Rasúa, Deakin University, Australia
Paul Rowe, The MITRE Corporation, MA, USA
Giedre Sabaliauskaite, Singapore University of Technology and Design,
Singapore
Ketil Stølen, SINTEF, Norway
Sridhar Venkatesan, Vencore Labs, VA, USA

PUBLICITY CHAIR
Ibifubara Iganibo, George Mason University, VA, 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] DEADLINE EXTENSION: March 15 - CTW 2019 - 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

17th Cologne-Twente Workshop (CTW 2019) on Graphs and Combinatorial
Optimization

July 1-3, 2019, Enschede (Netherlands)

Call for papers
---------------
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization
2019 welcomes contributions on theory and applications of discrete
algorithms, graphs and combinatorial structures in the wide sense. CTW
2019 will take place at the University of Twente, Enschede, Netherlands.

Important dates
---------------
Submission deadline: new deadline is March 15, 2019
Notification: : April 15, 2019

Contacts
--------
URL: https://wwwhome.ewi.utwente.nl/~ctw/
EMAIL: ctw2019@utwente.nl

Abstract Submission
-------------------
Submit extended abstracts of at most 4 pages using the Easychair link
https://easychair.org/conferences/?conf=ctw2019 no later than March 1,
2019, using the template available on the website of the workshop. The
scientific committee will select the presentations for the workshop on
the basis of the extended abstracts received and on the available number
of slots.

Proceedings volume
------------------
There will be a special issue of the journal Discrete Applied
Mathematics as a post-conference proceedings outlet.

Scientific committee
--------------------
Ali Fuat Alkaya, Marmara Univ.
Alberto Ceselli, Univ. Milan
Roberto Cordone, Univ. Milan
Ekrem Duman, Ozyegin Univ.
Ulrich Faigle, Univ. Koeln
Johann Hurink, Univ. Twente
Leo Liberti, CNRS & Ecole Polytechnique
Bodo Manthey, Univ. Twente
Gaia Nicosia, Univ. Roma Tre
Andrea Pacifici, Univ. Roma Tor Vergata
Stefan Pickl, Univ. des Bundeswehr Muenchen
Bert Randerath, Technische Hochschule Koeln
Giovanni Righini, Univ. Milan
Heiko Roeglin, Univ. Bonn
Britta Peis, RWTH Aachen
Oliver Schaudt, Univ. Koeln
Rainer Schrader, Univ. Koeln
Rudiger Schultz, Univ. Duisburg-Essen
Frank Vallentin, Univ. Koeln

Local organization
------------------
Johann Hurink
Stefan Klootwijk
Bodo Manthey
Victor Reijnders
Martijn Schoot Uiterkamp

--
Bodo Manthey
https://wwwhome.ewi.utwente.nl/~mantheyb/

--
Bodo Manthey
https://wwwhome.ewi.utwente.nl/~mantheyb/
**********************************************************
*
* 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] One 6-year Assistant Professorship in Probabilistic Combinatorics at TU Graz

One 6-year Assistant Professorship in Probabilistic Combinatorics at TU Graz

We are seeking outstanding candidates with strong background in
Probabilistic Combinatorics, in particular Random Graphs.

The successful candidate will be employed as a UniversitaetsassistentIn
mit Doktorat (a fulltime non-tenure track Assistant Professor) for six
years as a member of the Combinatorics Group
(https://www.math.tugraz.at/comb/) in the Institute of Discrete
Mathematics at the Graz University of Technology, Austria. The starting
date of the appointment is 1 September 2019.

The standard teaching load is about 4 hours per semester week. Teaching
experience would be desirable but not necessary.

The basic salary is specified in the Kollektivvertrag, and the salary
group for UniversitaetsassistentIn mit Doktorat is B1 (current gross
monthly salary: 3711,10 Euro, 14 times per year).

Qualifications and condition of employment:
- Qualified candidates must hold a PhD degree in mathematics or
theoretical computer science at the time of appointment
- Strong track record of research in Probabilistic Combinatorics

Application documents:
- Cover letter of application
- Curriculum Vitae (including the list of publications, the list of
teaching, and the list of references)
- A short statement of research interests and experience

All application documents merged into a single PDF-file should be
submitted by e-mail to bewerbungen.mpug@tugraz.at

Technische Universitaet Graz
Dekan der Fakultaet fuer Mathematik, Physik und Geodaesie
O.Univ.-Prof. Robert Tichy
Petersgasse 16, 8010 Graz

Job reference number: 5050/19/004

Application deadline: 30 April 2019

Interview: mid June 2019

Job announcement: https://www.math.tugraz.at/~kang/UAmD2019.html


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

Tuesday, February 26, 2019

[DMANET] Postdoctoral research position, Ryerson University

Applications are invited for one postdoctoral fellow in discrete
mathematics in the Department of Mathematics at Ryerson University (
http://math.ryerson.ca/) to begin on September 1, 2019. The research will
be led jointly by the members of the Graphs at Ryerson research group,
including: Drs. Anthony Bonato, Peter Danziger, Dejan Delic, Konstantinos
Georgiou, and Pawel Pralat. This position provides an opportunity to
engage in research in Mathematics, with a limited amount of teaching, and
is suited for talented mathematicians who have recently completed their
Ph.D. The salary is competitive, with funding provided for a year and with
potential for renewal for a second year.

The applicant should have a PhD in Mathematics or Computer Science. The
ideal candidate would have expertise in one or more of the areas of
interest to the above-mentioned researchers, such as: combinatorial
designs, relational structures, computational complexity, complex networks,
combinatorial optimization, discrete algorithms, graph searching and random
graphs. The position is open to candidates of any nationality and selection
will be based upon the candidate's research record and potential. As the
applicant will normally teach, some teaching experience is preferred.

Applicants should provide a cover letter, curriculum vitae, and at least
three letters of recommendation. At least one of these letters should
report on the candidate's teaching abilities.

Applicants should apply no later than April 1, 2019, and the position will
remain open until filled. Please note the position is advertised pending
budgetary approval.

Application material and reference letters will be submitted by e-mail to
konstantinos@ryerson.ca

We appreciate all replies to this advertisement, but only applicants under
consideration will be contacted. Ryerson University is strongly committed
to fostering diversity within our community. We welcome those who would
contribute to the further diversification of our faculty and its
scholarship including, but not limited to, women, visible minorities,
Aboriginal people, persons with disabilities, and persons of any sexual
orientation or gender identity.

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

[DMANET] SAT 2019 Final Call for Papers.

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

FINAL CALL FOR PAPERS

Twenty-second International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2019 ---

Lisbon, Portugal, 7 - 12 July 2019

http://sat2019.tecnico.ulisboa.pt/

Abstract submission deadline: 1 March 2019, 23:59 AoE
Paper submission deadline: 8 March 2019, 23:59 AoE

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

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

Many hard combinatorial problems can be tackled using SAT-based
techniques including problems that arise in Formal Verification,
Artificial Intelligence, Operations Research, Computational Biology,
Cryptography, Data Mining, Machine Learning, Mathematics, etc. Indeed,
the theoretical and practical advances in SAT research over the past
twenty years have contributed to making SAT technology an
indispensable tool in a variety of domains.

SAT 2019 aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to satisfiability. Specifically, SAT 2019 invites
scientific contributions addressing different aspects of SAT
interpreted in a broad sense, including (but not restricted to)
theoretical advances (such as exact algorithms, proof complexity, and
other complexity issues), practical search algorithms, knowledge
compilation, implementation-level details of SAT solvers and SAT-based
systems, problem encodings and reformulations, applications (including
both novel application domains and improvements to existing
approaches), as well as case studies and reports on findings based on
rigorous experimentation.

## Scope

SAT 2019 welcomes scientific contributions addressing different
aspects of the satisfiability problem, interpreted in a broad sense.
Domains include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified
Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), as well
as Constraint Satisfaction Problems (CSP). Topics include, but are not
restricted to:

* Theoretical advances (including algorithms, proof complexity,
parameterized complexity, and other complexity issues);
* Practical search algorithms;
* Knowledge compilation;
* Implementation-level details of SAT solving tools and SAT-based
systems;
* Problem encodings and reformulations;
* Applications (including both novel applications domains and
improvements to existing approaches);
* Case studies and reports on insightful findings based on rigorous
experimentation.

## Out Of Scope

Papers claiming to resolve a major long-standing open theoretical
question in Mathematics or Computer Science (such as those for which a
Millennium Prize is offered), are outside the scope of the conference
because there is insufficient time in the schedule to referee such
papers; instead, such papers should be submitted to an appropriate
technical journal.

## Paper Categories

Submissions to SAT 2019 are solicited in three paper categories,
describing original contributions.

* Long papers (9 to 15 pages, excluding references)
* Short papers (up to 8 pages, excluding references)
* Tool papers (up to 6 pages, excluding references)

Long and short papers should contain original research, with
sufficient detail to assess the merits and relevance of the
contribution. For papers reporting experimental results, authors are
strongly encouraged to make their data and implementations available
with their submission. Submissions reporting on case studies are also
encouraged, and should describe details, weaknesses, and strengths in
sufficient depth. Long and short papers will be evaluated with the
same quality standards, and are expected to contain a similar
contribution per page ratio.

The authors should choose between a long or a short paper depending on
the space they need to fully describe their contribution. The
classification between long and short papers is mainly a way to
balance the workload of the reviewing process among PC members. It
also impacts the duration of the presentation of the work during the
conference. It is the responsibility of the authors to make sure that
their paper is self-contained in the chosen limit of pages. There will
be no requalification of the submissions by the PC.

Tool papers must obey to a specific content criteria. A tool paper
should describe the implemented tool and its novel features. Here
"tools" are interpreted in a broad sense, including descriptions of
implemented solvers, preprocessors, etc., as well as systems that
exploit SAT solvers or their extensions for use in interesting problem
domains. A demonstration is expected to accompany a tool presentation.
Papers describing tools that have already been presented previously
are expected to contain significant and clear enhancements to the
tool.

## Deadlines

* March 1, 2019 - Abstract submission
* March 8, 2019 - Paper submission

## Proceedings

All accepted papers are expected to be published in the proceedings of
the conference, which will be published within the Springer LNCS
series.

## Best Paper Awards

Long and short papers may be considered for a best paper award. If the
main author is a student, both in terms of work and writing, the paper
may be considered for a best student paper award. Use the supplement
to your submission to state (in a brief cover letter) if the paper
qualifies as a student paper. Both the best paper award and the best
student paper award are sponsored by Springer.

The SAT association will provide partial travel support to students
with accepted papers to attend SAT 2018.

## Other Information

More information about the conference can be found at
http://sat2019.tecnico.ulisboa.pt/. Questions about the paper
submission process may be addressed to the Program Chairs Mikoláš
Janota (mikolas.janota@tecnico.ulisboa.pt) and Inês
Lynce (ines.lynce@tecnico.ulisboa.pt).
**********************************************************
*
* 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 and Postdoc Positions in Applied Cryptography, University of Stuttgart, Germany

The Institute of Information Security at University of Stuttgart offers
full-time

Ph.D. and Postdoc Positions

in applied cryptography, with a focus on

- Multi-Party Computation,
- Zero-Knowledge Proofs,
- Fully Homomorphic Encryption,

and applications thereof.

The positions are available immediately with an internationally
competitive salary, paid according to the German public salary scale
TVL-E13 or TVL-E14 (depending on the candidate's qualification).
Appointment periods follow the German science appointment regulations,
ranging from one year to up to six years.

The Institute of Information Security offers a creative international
environment for top-level international research in Germany's high-tech
region.

The successful candidate should have a Master's degree or a Ph.D. (or
should be very close to completion thereof) in Computer Science,
Mathematics, Cyber Security, or a related field. We value excellent
analytical and mathematical skills. Knowledge in cryptography, and in
particular, one of the mentioned fields, is an asset. Knowledge of
German is not required. We can offer positions with and without teaching
obligations.

Application documents should contain a cover letter, a curriculum vitae,
a list of publications (for candidates who apply for a Postdoc
position), copies of transcripts and certificates (Bachelor, Master,
PhD), and names of at least two references. Applications should be sent
by email to Prof. Ralf Kuesters as a single PDF file.

The University of Stuttgart is an equal opportunity employer.
Applications from women are strongly encouraged. Severely challenged
persons with equal qualifications will be given preference.

The deadline for applications is

March 24th, 2019.

Late applications will be considered until the positions are filled.

See https://sec.uni-stuttgart.de/jobopenings for the official job
announcement.

For further inquiries do not hesitate to contact Prof. Dr. Ralf Kuesters
by phone or email.

Prof. Dr. Ralf Kuesters
Universitaet Stuttgart
Institut fuer Informationssicherheit
70569 Stuttgart
E-Mail: ralf.kuesters@sec.uni-stuttgart.de
Phone: +49 (0)711 685 88283
https://sec.uni-stuttgart.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, February 25, 2019

[DMANET] RWTH Aachen: PhD/postdoc in computational integer programming

The chair of operations research (that's me!) of RWTH Aachen University (
www.or.rwth-aachen.de) invites applications for a full-time PhD or postdoc
position in mathematics, for up to six years, starting date at your
earliest convenience.

You should be willing (very much, indeed)

1. to teach (German is an asset)
2. to improve GCG by joining (heading?) the dev team, and doing your
theoretical, algorithmic, and experimental research in the area of
MIP/DW/Benders/etc.

If you don't know what 2. is, we are not a good fit. If you do, please
surprise me at luebbecke@or.rwth-aachen.de as soon as possible, no later
than March 15, 2019.

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

[DMANET] First Announcement: Geometric Optimization Challenge, part of CG Week 2019

Dear colleagues,

We are happy to announce a Geometric Optimization Challenge as part of the workshop
"Computational Geometry: Solving Hard Optimization Problems" (CG:SHOP), which will
take place as part of CG Week in Portland, OR, USA, June 18-21, 2019.
(See http://eecs.oregonstate.edu/socg19/workshops.html)

CG:SHOP will focus on difficult geometric optimization problems, both in theory and
practice. Contributions are sought in two different directions, as follows.

(1) First, we will host a practical OPTIMIZATION CHALLENGE. The objective
will be to compute good solutions to instances of an NP-hard geometric
optimization problem:

Given a set S of n points in the plane, compute a simple polygon, whose vertex set is precisely
the set S, that has maximum or minimum area among all such polygonalizations of S.

Details of the competition (including further details such as benchmark
instances, and rules for submission and evaluation) will be announced through
the website:
https://sites.google.com/stonybrook.edu/cgweek2019-workshop/
Contest opens 24:00 (midnight, CET), February 28, 2019.
Contest closes 24:00 (midnight, CET), May 31, 2019.

Winners will be presented during the workshop at CG Week.

(2) Second, you are invited to submit OPEN PROBLEMS for presentation during an open
problem session. Details of how to submit contributions will be provided through the website:
https://sites.google.com/stonybrook.edu/cgweek2019-workshop/
starting February 28, 2019. In order to allow sufficient time for collecting and preloading presentations,
contributions are encouraged by June 11, 2019.

In addition, we will host presentations and meta-discussions about the future of open problems.

We are looking forward to your contributions and welcome questions and comments!

Erik Demaine, Sándor Fekete, Joe Mitchell
**********************************************************
*
* 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] [GECCO CFP] Call for Late-Breaking Abstracts - Genetic and Evolutionary Computation Conference 2019

2019 Genetic and Evolutionary Computation Conference (GECCO 2019)
Call for Late-Breaking Abstracts

GENERAL INFORMATION

Two-page abstracts describing late-breaking developments in the field
of genetic and evolutionary computation are solicited for presentation
at the Late-Breaking Abstracts Workshop of the
2019 Genetic and Evolutionary Computation Conference (GECCO 2019)
https://gecco-2019.sigevo.org/index.html/HomePage
and for inclusion in the ACM Digital Library.

SELECTION PROCESS

Late-breaking abstracts will be briefly examined for relevance and
minimum standards of acceptability, but will not be peer reviewed in
detail. Authors of accepted late-breaking abstracts will individually
retain copyright (and all other rights) to their late-breaking
abstracts.

PRESENTATION FORMAT

Following the success of the last years' poster format for Late Breaking
Abstracts, authors of the accepted submissions will be asked to
prepare a poster summarizing their contributions.
Attendees will have the opportunity to interact with authors and
enjoy a dynamic forum to share and spread scientific ideas.

ABSTRACT SUBMISSION

Submission site: https://ssl.linklings.net/conferences/gecco
Submission deadline: Wednesday, April 3, 2019, 23:59 (Anywhere on Earth)
Decision notification: on or before Wednesday, April 17, 2019
Page limit: 2 pages using ACM template.

For detailed instructions, please visit our website:
https://gecco-2019.sigevo.org/index.html/Call+for+Late-Breaking+Abstracts

For more information, contact the Late-Breaking Abstracts Chair:
Carola Doerr, CNRS researcher at Sorbonne University, Paris, France
Carola.Doerr@mpi-inf.mpg.de
www.lip6.fr/Carola.Doerr/


**********************************************************
*
* 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] Special Issue "Online Algorithms in Trading Systems‎"

Special Issue "Online Algorithms in Trading Systems‎"
A special issue of Algorithms (ISSN 1999-4893).
https://www.mdpi.com/journal/algorithms/special_issues/online_algorithm_trading_syst

Deadline for manuscript submissions: 31 December 2019

Dear Colleagues,

Online algorithms handle situations where the future input is unknown.
Since competitive
analysis was first introduced in the mid-1980s, online algorithms have been
studied for a
wide range of problems, and naturally this includes those involving
financial markets and
trading. As algorithmic and high-frequency trading become increasingly
prevalent, many new
algorithmic questions and challenges arise.

For this Special Issue, we invite submissions of articles that describe
recent advances in the
design and analysis of online algorithms for trading systems (broadly
defined). Both original
research papers and surveys are welcome. Topics of interest include, but
are not limited to:

- Time series search
- Trading strategies
- Portfolio optimization
- Hedging and risk management
- Pricing and market clearing
- Auction systems
- Mechanism design and other game-theoretic issues
- Empirical evaluation of algorithm performance

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering
<https://www.mdpi.com/user/register/> and logging in to this website
<https://www.mdpi.com/user/login/>. Once you are registered, click here to
go to the
submission form <
https://www.mdpi.com/user/manuscripts/upload/?journal=algorithms>.
Manuscripts can be submitted until the deadline. All papers will be
peer-reviewed. Accepted
papers will be published continuously in the journal (as soon as accepted)
and will be listed
together on the special issue website. Research articles, review articles
as well as short
communications are invited. For planned papers, a title and short abstract
(about 100 words)
can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be
under
consideration for publication elsewhere (except conference proceedings
papers). All
manuscripts are thoroughly refereed through a single-blind peer-review
process. A guide for
authors and other relevant information for submission of manuscripts is
available on the
Instructions for Authors <
https://www.mdpi.com/journal/algorithms/instructions> page.
Algorithms <https://www.mdpi.com/journal/algorithms/> is an international
peer-reviewed
open access monthly journal published by MDPI.

Please visit the Instructions for Authors
<https://www.mdpi.com/journal/algorithms/instructions> page before
submitting a
manuscript. The Article Processing Charge (APC) <
https://www.mdpi.com/about/apc/> for
publication in this open access <https://www.mdpi.com/about/openaccess/>
journal is 1000
CHF (Swiss Francs). Submitted papers should be well formatted and use good
English.
Authors may use MDPI's English editing service <
https://www.mdpi.com/authors/english>
prior to publication or during author revisions.

Guest Editor
Dr. Stanley P. Y. Fung
Department of Informatics, University of Leicester, Leicester, LE1 7RH, UK

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

[DMANET] CFP: [Algorithms] Special Issue on "Algorithm Engineering" (Deadline 30 June 2019)

Dear Colleagues,

We invite submissions of novel research articles to the special issue of
"Algorithms" dedicated to "Algorithm Engineering".

Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is a peer-reviewed open
access journal which provides an advanced forum for studies related to
algorithms and their applications. Algorithms is published monthly
online by MDPI and is indexed by DBLP, Emerging Sources Citation Index
(ESCI - Web of Science), Ei Compendex, Scopus and other databases. More
details can be found at the following link:
http://www.mdpi.com/journal/algorithms/special_issues/algorithm_engineering

The purpose of this Special Issue is to attract papers presenting
original research in the area of Algorithm Engineering. In particular,
we encourage submissions concerning the design, implementation, tuning,
and experimental evaluation of discrete algorithms and data structures,
or addressing methodological issues and standards in algorithmic
experimentation. Papers dealing with advanced models of computing,
including memory hierarchies, cloud architectures, and parallel
processing are also welcome.

We solicit contributions from all relevant areas of applied
algorithmics, including but no limited to: databases; computational
geometry; graphs; big data; complex networks; combinatorial aspects of
scientific computing; and computational problems arising in natural
sciences or
engineering.

The submission deadline is 30 June 2019, and papers will be published
on an ongoing basis, i.e. you may send
your manuscript now or up until the deadline.
Submitted papers should not be under consideration for publication
elsewhere.

Best Regards,
Prof. Daniele Frigioni
Prof. Mattia D'Emidio
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering
and logging in to the following website: http://www.mdpi.com/user/login/
Once you are registered, click here to go to the submission form.
Manuscripts can be submitted until the deadline. All papers will be
peer-reviewed. Accepted papers will be published continuously in the
journal (as soon as accepted) and will be listed together on the special
issue website. Research articles, review articles as well as short
communications are invited. For planned papers, a title and short
abstract (about 100 words) can be sent to the Editorial Office for
announcement on this website.

Submitted manuscripts should not have been published previously, nor be
under consideration for publication elsewhere (except conference
proceedings papers). All manuscripts are thoroughly refereed through a
single-blind peer-review process. A guide for authors and other relevant
information for submission of manuscripts is available on the
Instructions for Authors page.

Please visit the Instructions for Authors page before submitting a
manuscript. The Article Processing Charge (APC) for publication in this
open access journal is 850 CHF (Swiss Francs). Submitted papers should
be well formatted and use good English. Authors may use MDPI's English
editing service prior to publication or during author revisions.

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

[DMANET] PhD Position in Combinatorial Optimization at Paris Research Center of Huawei and Paris-Dauphine University

A PhD position is available in combinatorial optimization at

Paris Research Center of Huawei and University Paris-Dauphine.


Title: Data Driven Optimization in Telecommunication Networks

Supervisors: Dr. Fabio FURINI, Pr. Ali Ridha MAHJOUB and Dr. Sebastien MARTIN

Keywords: optimization, telecommunication networks, mathematical programming, exact algorithms, data driven approaches

Abstract: Modern Telecommunication Networks are extremely complex systems in which hard combinatorial optimization problems must be effectively solved in short computing time. This thesis will focus on rich multi-commodity flow problems arising in telecommunication networks with complex demand satisfaction constraints. The primary goal will be to develop a mathematical optimization tool to face peaks and anomalies in traffic demands. Such problems are crucial in the identification of the weaknesses of the telecommunication networks. Thus the results of the thesis will provide an effective optimization tool to protect and make more efficient these networks. More in details, taking in consideration demand peaks and anomalies is crucial in finding an optimal load balance of the traffic through the network. We plan to develop exact and effective solution methodologies based on a deep mathematical understanding of the underlying problem. The new algorithms will be based on effective decomposition techniques such as the Benders and Dantzig-Wolfe decompositions which will lead to branch-and-cut and branch-and-price algorithms. The novelty of the thesis will be in the development of an alternative method to balance the traffic flow in the networks with the goal of effectively absorbing anomalies and demand peaks.

The thesis will be developed in the Mathematical and Algorithmic Sciences Lab, Paris Research Center of Huawei and in Paris-Dauphine University. The focus is on the development of scientific results concerning theory and methodology which may be of interest for the mathematical optimization community. A special attention will be given to the publication of the results in the top journals of the domain (like Mathematical Programming, Operation Research as well as top telecommunication conferences like INFOCOM).

The PhD grant will be funded at Huawei France Research Center (FRC) located in Boulogne-Billancourt, Paris area. The center is leading advanced research in the fields of Algorithm and Software design, Aesthetics, MBB & Home devices and Parallel Computing, to create and design the innovative technologies and software platforms for the company. The project is in collaboration with Paris-Dauphine University and in particular with LAMSADE, the computer science and optimization laboratory of Paris-Dauphine University (https://www.lamsade.dauphine.fr/). LAMSADE is a well known research center in decision science specialized in the domain of optimization. The PhD student will perform his research activities between LAMSADE and the Paris research center of Huawei (https://huawei.eu/media-centre/press-releases/huawei-opens-mathematics-research-centre-france).

Skills: The PhD candidate is expected to perform scientific research in a domain of telecommunication network problems. Applicants should demonstrate good programming skills and deep knowledge in solution methods for combinatorial optimization problems. Experience with branch-and-cut algorithms and/or branch-and-price algorithms is considered as plus. Applicants should have completed (or close to completion of) a master degree in operations research, computer science, mathematics or a comparable domain. Fluency English is required. Moreover, the candidate must be comfortable in programming in C/C++. Affinity with industrial Engineering or telecommunication networks is considered as plus.

Application: must be submitted electronically to fabio.furini@lamsade.dauphine.fr, ridha.mahjoub@lamsade.dauphine.fr and sebastien.martin@huawei.com and must include a cover letter, a curriculum vitae detailing educational background research experience and up to three recommendation letters. The position is for 3 years starting as soon as possible. Master students that are not available before summer are eligible (the exact starting date is negotiable).

Deadline: application must be submitted as soon as possible (hard deadline by April 15, 2019). We will accept later applications if the position is not yet filled.

The salary will be around 30000 euros brut by year (around 2000 euros net by month).


**********************************************************
*
* 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, February 24, 2019

[DMANET] IPCO 2019 conference and summer school

The 20th Conference on Integer Programming and Combinatorial Optimization
(IPCO XX) will be held May 22–24, 2019 at the University of Michigan, in
Ann Arbor, Michigan, USA. There will also be a summer school on
semidefinite and polynomial optimization during the two days preceding IPCO
(May 20-21).

REGISTRATION: The registration for IPCO 2019 is now open:

http://umich.edu/~ipco2019conf/registration.html

The early registration deadline is March 25, after which fees increase.

CONFERENCE HOTEL: There is a special group rate ($179/day) for IPCO
participants at the Graduate hotel, Ann Arbor. This hotel is located
walking distance from the conference venue (East Hall, University of
Michigan). The last date to avail of this discounted rate is March 20. For
links to hotel reservations and other local information, please see:

http://umich.edu/~ipco2019conf/travel-accommodation.html

SUMMER SCHOOL: The lectures will be given by Nikhil Bansal (Tu Eindhoven),
Samuel Burer (U Iowa) and Joao Gouveia (U Coimbra). We anticipate being
able to partially fund up to 10 Ph.D. students for the summer school. In
order to apply, please email to ipco-2019@umich.edu (i) a CV and (ii) a
recommendation letter from the student's faculty advisor. More details on
the summer school are at:

http://umich.edu/~ipco2019conf/summerschool.html

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

Friday, February 22, 2019

[DMANET] List of Accepted Papers for SoCG 2019

Dear All,

Below is the list of accepted papers for SoCG 2019. The information is
also available at CG Week 2019 website
(http://eecs.oregonstate.edu/socg19/accepted.html ).

We look forward to see you in Portland, Oregon for CG Week in June 2019!

Yusu Wang and Gill Barequet
on behalf of SoCG 2019 Program Committee

====================== SoCG 2019 Accepted Papers =======================

** Adrian Dumitrescu. /A Product Inequality for Extreme Distances/
** Sariel Har-Peled and Mitchell Jones. /Journey to the Center of the
Point Set/
** Xavier Goaoc, Andreas Holmsen and Cyril Nicaud. /An experimental
study of forbidden patterns in geometric permutations by combinatorial
lifting/
** Shay Moran and Amir Yehudayoff. /On weak ϵ-nets and the Radon number/
** Raphaël Tinarrage, Frederic Chazal, Marc Glisse, Hirokazu Anai,
Yuichi Ike, Hiroya Inakoshi and Yuhei Umeda. /DTM-based filtrations/
** Mozhgan Mirzaei and Andrew Suk. /On grids in point-line arrangements
in the plane/
** Janos Pach and Istvan Tomon. /On the chromatic number of disjointness
graphs of curves/
** Vladimir Braverman, Moses Charikar, William Kuszmaul, David P.
Woodruff and Lin F. Yang. /The One-Way Communication Complexity of
Dynamic Time Warping Distance/
** Diego Ihara, Neshat Mohammadi and Anastasios Sidiropoulos.
/Algorithms for metric learning via contrastive embeddings/
** Pankaj K. Agarwal, Boris Aronov, Esther Ezra and Joshua Zahl. /An
Efficient Algorithm for Generalized Polynomial Partitioning and Its
Applications/
** Haitao Wang. /A Divide-and-Conquer Algorithm for Two-Point L_1
Shortest Path Queries in Polygonal Domains/
** Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket
Saurabh and Meirav Zehavi. /Connecting the Dots (with Minimum Crossings)/
** Sándor Fekete, Phillip Keldenich and Christian Scheffer. /Packing
Disks into Disks with Optimal Worst-Case Density/
** Dominique Attali, Andre Lieutier and David Salinas. /When convexity
helps collapsing complexes/
** Luis Barba. /Optimal algorithm for geodesic farthest-point Voronoi
diagrams/
** Vida Dujmovic and Pat Morin. /Dual Circumference and Collinear Sets/
** Timothy M. Chan and Sariel Har-Peled. /Smallest k-Enclosing Rectangle
Revisited/
** Chen Ziv and Micha Sharir. /On the Complexity of the k-Level in
Arrangements of Pseudoplanes/
** Yufei Tao and Yu Wang. /Distribution-Sensitive Bounds on Relative
Approximations of Geometric Ranges/
** Sergio Cabello and Timothy M. Chan. /Computing Shapley values in the
plane/
** Jean-Lou de Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim
Ophelders, Claire Pennarun, Csaba D. Tóth and Sander Verdonschot.
/Convex Polygons in Cartesian Products/
** Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir and Bernhard
Zeisl. /General techniques for approximate incidences and their
application to the camera posing problem/
** Arnaud de Mesmay, Yo'Av Rieck, Martin Tancer and Eric Sedgwick. /The
Unbearable Hardness of Unknotting/
** Jacob Fox, Janos Pach and Andrew Suk. /Semi-algebraic colorings of
complete graphs/
** Kevin Buchin, Sariel Har-Peled and Dániel Oláh. /A Spanner for the
Day After/
** Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx and Arnaud
de Mesmay. /Almost tight lower bounds for hard cutting problems in
embedded graphs/
** Drago Bokal, Zdenek Dvorak, Petr Hlineny, Jesus Leanos, Bojan Mohar
and Tilo Wiedera. /Bounded maximum degree conjecture holds precisely for
c-crossing-critical graphs with c ≤ 12/
** Karl Bringmann, Marvin Künnemann and André Nusser. /Walking the Dog
Fast in Practice: //Algorithm Engineering of the Fréchet Distance/
** Karl Bringmann and Bhaskar Ray Chaudhury. /Polyline Simplification
has Cubic Complexity/
** Anne Driemel, Jeff Phillips and Ioannis Psarros. /On the VC dimension
of metric balls under Fr&#39;echet and Hausdorff distances/
** Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo,
Tamara Mchedlidze and Maurizio Patrignani. /Upward Book Embeddings of
st-Graphs/
** Ching-Hsiang Hsu, Yi-Jen Chiang and Chee Yap. /Rods and Rings: Soft
Subdivision Planner for R^3 x S^2/
** David Eppstein. /Cubic Planar Graphs That Cannot Be Drawn On Few Lines/
** David Eppstein. /Counting Polygon Triangulations is Hard/
** Haitao Wang and Jie Xue. /Near-optimal Algorithms for Shortest Paths
in Weighted Unit-Disk Graphs/
** Andrey Boris Khesin, Aleksandar Nikolov and Dmitry Paramonov.
/Preconditioning for the Geometric Transportation Problem/
** Timothy M. Chan. /Dynamic Geometric Data Structures via Shallow Cuttings/
** Radoslav Fulek and Jan Kynčl. /Z_2-genus of graphs and minimum rank
of partial symmetric matrices/
** Jie Xue, Yuan Li, Saladi Rahul and Ravi Janardan. /Searching for the
closest-pair in a query translate/
** Benjamin Niedermann, Ignaz Rutter and Matthias Wolf. /Efficient
Algorithms for Ortho-Radial Graph Drawing/
** Pankaj K. Agarwal, Hsien-Chih Chang and Allen Xiao. /Geometric
Partial Matching and Unbalanced Transportation/
** Kristóf Huszár and Jonathan Spreer./     3-Manifold triangulations of
small treewidth/
** Patrick Schnider. /Ham-Sandwich cuts and center transversals in
subspaces/
** Amer Krivosija and Alexander Munteanu. /Probabilistic smallest
enclosing ball in high dimensions via subgradient sampling/
** Michael Kerber, Michael Lesnick and Steve Oudot. /Exact computation
of the matching distance on 2-parameter persistence modules/
** Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr and Uli
Wagner. /The Crossing Tverberg Theorem/
** Siddharth Pritam and Jean-Daniel Boissonnat. /Computing Persistent
Homology of Flag Complexes via Strong Collapses/
** Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da
Lozzo and Vincenzo Roselli. /Morphing Contact Representations of Graphs/
** Ravid Cohen, Dan Halperin, Pankaj K. Agarwal and Wolfgang Mulzer.
/Maintaining the Union of Unit Discs under Insertions with Near-Optimal
Overhead/
** Hsien-Chih Chang, Marcos Cossarini and Jeff Erickson. /Lower Bounds
for Electrical Reduction on Surfaces/
** Peyman Afshani. /A New Lower Bound for Semigroup Orthogonal Range
Searching/
** Jeff Erickson and Yipu Wang. /Topologically Trivial Closed Walks in
Directed Surface Graphs/
** Peyman Afshani and Jeff Phillips. /Independent Range Sampling,
Revisited Again/
** Ulderico Fugacci and Michael Kerber. /Chunk Reduction for
Multi-Parameter Persistent Homology/
** Nathaniel Lahn and Sharath Raghvendra. /A Weighted Approach to
Maximum Cardinality Bipartite Matching Problem with Applications in
Geometric Settings/
** Ian Munro and Yakov Nekrich. /Dynamic Planar Point Location in
External Memory/
** Herbert Edelsbrunner, Žiga Virk and Hubert Wagner. /Topological Data
Analysis in Information Space/
** Hugo Akitaya, Matias Korman, Mikhail Rudoy, Diane Souvaine and Csaba
Toth. /Circumscribing Polygons and Polygonizations for Disjoint Line
Segments/
** Ivor Hoog V.D., Irina Kostitsyna, Bettina Speckmann and Maarten
Löffler. /Preprocessing Ambiguous Imprecise Points/
** Mathieu Carrière and Ulrich Bauer. /On the Metric Distortion of
Embedding Persistence Diagrams into separable Hilbert spaces/

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