Thursday, June 8, 2017

[DMANET] ISSAC 2017 - First Call for Participation

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

ISSAC 2017

International Symposium on Symbolic and Algebraic Computation
University of Kaiserslautern, Germany,
July 25-28 2017.

FIRST CALL FOR PARTICIPATION

Online Registration Now Open!
http://www.issac-conference.org/2017/

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

The International Symposium on Symbolic and Algebraic Computation is
the premier conference for research in symbolic computation and
computer algebra. ISSAC 2017 will be the 42nd meeting in the series,
which started in 1966 and has been held annually since 1981. The
conference presents a range of invited speakers, tutorials, poster
sessions, software demonstrations and vendor exhibits with a
centerpiece of contributed research papers.

ISSAC 2017 is held on 25-28 July 2017 at the University of
Kaiserslautern, Germany. Tutorial Sessions will be held on July 25th 2017.

Call for Participation:
-----------------------
Online registration is now open. For details on fees and to register
online, please visit

http://www.issac-conference.org/2017/registration.php

In order to guarantee printed proceedings and a place at the banquet
please register
before July 2nd. As usual, discounts are available for students and SIGSAM
members. On-site registration will be available, but incurs an extra fee.


Accepted Papers:
----------------
The program committee has accepted 55 papers as listed here:
http://www.issac-conference.org/2017/papers.php


Invited Speakers:
-----------------

Mark van Hoeij (Florida State University, USA)
Title: Closed Form Solutions for Linear Differential and Difference
Equations

Gabriele Nebe (RWTH Aachen, Germany)
Title: Computing with arithmetic groups

James Worrell (University of Oxford, UK)
Title: Decision Problems for Linear Dynamical Systems

Abstracts are available here:
http://www.issac-conference.org/2017/invited.php


Tutorials:
----------

Hongbo Li (Chinese Academy of Sciences, China)
Title: Automated Geometric Reasoning with Geometric Algebra: Theory and
Practice

Marni Mishna (Simon Fraser University, Canada)
Title: Algorithmic Approaches for Lattice Path Combinatorics

Damien Stehlé (INRIA, France)
Title: Lattice reduction algorithms

Abstracts are available here:
http://www.issac-symposium.org/2017/tutorials.php


Posters and Software Presentations:
-----------------------------------
Abstracts for poster presentations and software demonstration are
currently undergoing review.


Satellite Workshops/Conferences:
--------------------------------

The International Workshop on Parallel Symbolic Computation (PASCO
2017), will be held
on July 23rd-24th 2017 (prior to ISSAC'17) at University of Kaiserslautern.

The Second International Workshop on Satisfiability Checking and
Symbolic Computation (SC2 2017)
will be held on July 29th 2017 (after ISSAC'17) at University of
Kaiserslautern.

We are looking forward to seeing you in Kaiserslautern.

**********************************************************
*
* 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, June 7, 2017

[DMANET] Postdoc position in Warwick

Dear colleagues,

We are advertising an ERC-funded postdoctoral position in the area of
extremal combinatorics and graph limits (previous research experience in at
least one the two areas is required). The length of the position is 24
months and the starting date can be negotiated - further details are in the
advert below.

http://www.jobs.ac.uk/job/BBX877/research-fellow-80311-067/

The closing date for the applications is July 6 - applying well before the
deadline is encouraged, however, all applications received by the deadline
will be given a full consideration.

Best regards,

Dan Kral
**********************************************************
*
* 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] ATMOS 2017 2nd Call for papers

17th Workshop on Algorithmic Approaches for Transportation Modeling,
Optimization, and Systems (ATMOS 2017)
https://algo2017.ac.tuwien.ac.at/atmos/

Call for papers

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.

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
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.

Submission Guidelines

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://www.easychair.org/conferences/?conf=atmos2017

The submission must be received by June 24, 2017.

By submitting a paper the authors acknowledge that in case of acceptance
at least one of the authors must register at ALGO 2017 or ATMOS 2017,
attend the conference, and present the paper.
The proceedings will be published online and as open-access in the
Dagstuhl Open Access Series in Informatics (OASIcs).

Important dates

Submission: June 24, 2017
Notification of acceptance: July 24, 2017
Camera-ready version: August 4, 2017
Workshop: September 7, 2017

**********************************************************
*
* 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] Travel Grants (STSMs) on Kidney Exchange Programmes

There are a number of travel grants available from the COST Action on Kidney Exchange Programmes (ENCKEP). Under this scheme you can apply for a grant for a "Short-Term Scientific Mission" (STSM), i.e., a research visit to another country, related to kidney exchange programmes. In particular, this includes work on optimisation and the mathematical aspects of kidney exchange matching.

This is mostly intended for researchers based in Europe visiting institutions in other European countries, but there are some exceptions. For full details, see:
http://www.enckep-cost.eu/page/scientific-missions/guidelines

We especially encourage PhD students and early stage researchers to apply.

The current application deadline is 15th June. You can apply for trips starting between 1st August and 31st December 2017, and finishing by mid-April 2018.

Please read carefully the guidelines given on the website (especially the page called Application Procedure) before applying.

On behalf of COST Action CA15210

Nic Wilson (STSM Chair)
David Manlove (Action Vice Chair)
Joris van de Klundert (Action Chair)

ENCKEP websites:
http://www.cost.eu/COST_Actions/ca/CA15210
http://www.enckep-cost.eu/


**********************************************************
*
* 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, June 6, 2017

[DMANET] Open postdoc position on Approximation Algorithms, Quantum Information and Semidefinite Optimization at CWI, Amsterdam, The Netherlands

***********************************************
CWI, Amsterdam, The Netherlands

Open postdoc position

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

Centrum Wiskunde & Informatica (CWI) has a vacancy in the Network & Optimization research group for a
postdoc in the research project

"Approximation Algorithms, Quantum Information and Semidefinite Optimization".

This research project aims to explore the limits of efficient computation within classical and quantum computing, using semidefinite optimization as a main unifying tool. The position involves research into the mathematical and computer science aspects of approximation algorithms for discrete optimization, quantum entanglement in communication, and complexity of fundamental problems in classical and quantum computing.
We especially welcome applicants with a solid background and interest in algebraic methods for optimization.
The project will be carried out in collaboration between Monique Laurent from the CWI Networks & Optimization research group, Ronald de Wolf from the CWI Algorithms & Complexity research group, and Nikhil Bansal from the department of mathematics and computer science of the Technical University Eindhoven. The position is funded through an NWO-TOP grant.
More background information about the project can be found at the website:

http://projects.cwi.nl/quantumdsp/

For details about the application procedure please visit the website:

https://www.cwi.nl/jobs/vacancies/postdoc-in-the-research-project-approximation-algorithms-quantum-information-and-semidefinite-optimization

**********************************************************
*
* 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] Update to 4-year faculty PhD position at University Linz, Austria

* Update to previous post.
* Please note the new link to the application portal:
http://jku.at/application

As the largest institution of research and education in Upper Austria,
the Johannes Kepler University Linz has over 20,000 enrolled students
and 3,000 employees. The JKU's four faculties offer over 60 academic
degree programs. In order to strengthen our team at the Faculty of
Social Sciences, Economics & Business, we announce an opening starting
October 1, 2017 for a

*****************************************
* 4-year PhD position
* (UniversitätsassistentIn, must
* hold a Diploma/Master's degree)
* at the Department of
* Production and Logistics Management
*****************************************

Job Reference Number: 3361

Job Duties:
- Conduct independent research on topics relevant to the institute and
publish the respective findings
- Present research results at international conferences
- Take part in the execution of institutional research projects
- Teach university-level courses and co-supervise Master's and Bachelor
theses
- Participate in administrative tasks at the institute

Your Qualifications:
- Diploma/Master's degree in business science, economics, business
informatics, computer science, mathematics, statistics, or a related field
- Strong interest in research issues pertaining to production,
logistics, and supply chain management
- Experience in applying quantitative methods (combinatorial
optimization, linear programming, simulation, metaheuristics)
- Programming skills (preferred C/C++ or Java)
- Strong command of English (spoken and written)

The minimum salary in accordance with the collective agreement is €
2,731.00 gross per month (CA Job Grade: B1). If you have questions,
please contact: Univ. Prof. Sophie Parragh, Ph.D. (sophie.parragh@jku.at).

Application deadline: June 14, 2017.

The Johannes Kepler University wishes to increase the proportion of
academic female faculty and, for this reason, especially welcomes
applications by qualified women. If applicants are equally qualified, a
woman will be given preference for this position. The university
welcomes applications from qualified applicants with physical
disabilities. These applications will be given special consideration.
Prospective applicants interested in the multifaceted position are
requested to electronically send their applications via our online
portal http://jku.at/application to the Johannes Kepler University Linz,
Department of Human Resource Management, Altenberger Straße 69, A-4040
Linz. Please include "Job Reference Number 3361" in your application.
**********************************************************
*
* 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] UNSW Scientia PhD scholarships

At UNSW Sydney (Australia) we have an opening for up to two UNSW Scientia
PhD scholarships within the project Algorithms for Scheduling and
Cooperation in Distributed Energy Markets. The project is to design and
implement modern algorithms (parameterized algorithms and approximation
algorithms) for problems around clean energy technology adoption. The UNSW
Scientia PhD scholarships are very generous scholarships covering the
tuition fees, a stipend of AUD 40,000 per year, and a research support
package of AUD 10,000 per year.

Supervisory team: Serge Gaspers, Iain Macgill, and Aleksandar Ignjatovic.
More details: http://www.cse.unsw.edu.au/~sergeg/index.html#ScientiaPhD
Apply by: 14 July 2017.
**********************************************************
*
* 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 applications: Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)

The Faculty of Sciences and the Cluster of Excellence Engineering of
Advanced Materials EAM invite applications for a

W1 Junior Professorship for Applied Mathematics

at the Department of Mathematics to be filled by the earliest possible
starting date for an initial period of three years. Depending on
successful evaluation, the appointment will be extended for another
three years. Candidates may be appointed to a W2 professorship (tenure
track) depending on their performance during this six-year period and
subject to legal requirements.

The successful candidate is expected to represent the field adequately
in teaching and research. The professorship is mainly concerned with
data analysis and forecasting. Research activities should be
mathematically sound and may include uncertainty quantification,
statistical learning theory, machine learning or mathematical
statistics. Candidates with proven experience in interdisciplinary
research related to activities in material sciences and processes,
economics or the humanities are desirable.

For further information and the application guidelines please see
https://www.fau.eu/university/careers-at-fau/professorships/

Please submit your complete application documents (CV, list of
publications, list of lectures and courses taught, copies of
certificates and degrees, list of third-party funding) to the Dean of
the Faculty of Sciences, FAU Erlangen-Nürnberg: Prof. Dr. Frank Duzaar,
Universitätsstr. 40, 91054 Erlangen, nat-dekanat@fau.de by 30.06.2017.
**********************************************************
*
* 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: MACIS 2017

Call for Papers

**********************************************************
MACIS 2017
7th International Conference on
Mathematical Aspects of Computer and Information Sciences
November 15-17, 2017 Vienna, Austria.
https://macis2017.sba-research.org/
**********************************************************

MACIS is a series of biennial conferences focusing on research in mathematical
and computational aspects of computing and information science.
MACIS 2017 will feature invited presentations and a selective four-track
program of contributed papers describing original and unpublished research.

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

Submission deadline (REGULAR/SHORT papers): September 3, Sunday
(SHORT papers are decided on a rolling basis)
Notification deadline for all submissions: October 2, Monday
Registration opens: October 2, Monday
Camera-ready due: October 15, Sunday

Deadlines are firm; late submissions will not be considered.

==== MACIS 2017 Organization ====

General Chair:
Dimitris E. Simos, SBA Research, Austria

PC Chairs:
Johannes Bloemer, Paderborn University, Germany
Temur Kutsia, RISC, Johannes Kepler University, Austria

MACIS Steering Committee:
Ilias Kotsireas (Chair), Wilfrid Laurier University, Canada
Siegfried Rump, Hamburg University of Technology, Germany
Thomas Sturm, Max Planck Institute for Informatics, Germany
Dongming Wang, Beihang University, China
Jinzhao Wu, Guangxi University for Nationalities, China
Chee Yap, New York University, USA

==== Proceedings ====

All accepted SHORT or REGULAR papers (details, below) are planned to appear in
a conference proceedings volume published by Springer LNCS (pending approval).
In addition, REGULAR papers have the opportunity to be considered for
post-conference special issues of the journal Mathematics in Computer Science
(MCS http://link.springer.com/journal/11786) by Birkhauser/Springer.

==== MACIS 2017 Topics ====

MACIS authors are required to choose one of the following tracks:
-----------------
Track 1:
Foundation of Algorithms in Mathematics, Engineering & Scientific Computation
Track Chairs:
Matthew England (Coventry University, UK),
Jonathan Hauenstein (University of Notre Dame, USA),
Laura Kovacs (Vienna University of Technology, Austria),
Elias Tsigaridas (INRIA, France)
Topics:
quantifier elimination and decision procedures; global optimization;
differential equations; numeric, symbolic, interval and hybrid solution
techniques; satisfiability modulo theories; combinations of logics and
deductive engines; applications, especially in systems analysis and formal
verification; solving (parametric) polynomial systems
----------------
Track 2:
Combinatorics and Codes in Computer Science
Track Chairs:
Daniel Augot (INRIA & Ecole Polytechnique, France),
Alexander May (Ruhr-University Bochum, Germany),
Alfred Wassermann (University of Bayreuth, Germany)
Topics:
combinatorics, enumerative, combinatorial designs, their analysis and
algorithmic constructions of them, complexity problems in combinatorics;
codes constructions, decoding methods and their complexity, information
theory aspects, Kolmogorov complexity
----------------
Track 3:
Data Modeling and Analysis
Track Chairs:
Xiaoyu Chen (Beihang University, China)
Joachim Giesen (Friedrich Schiller University Jena, Germany),
Giorgos Kollias (IBM Research, USA)
Topics:
knowledge discovery; data mining; differential privacy, pattern recognition;
complex knowledge - representation and management; foundations and theories
for data analysis - systems; design and analysis of machine learning
algorithms, statistical analysis for big data
----------------
Track 4:
Mathematical Aspects of Information Security and Cryptography
Track Chairs:
Jan Camenisch (IBM Research, Switzerland),
Stefan Dziembowski (University of Warsaw, Poland),
Guenael Renault (ANSSI, France)
Topics:
security models; formal methods for security and privacy; design and analysis
of algebraic, elliptic, number theoretical, code-based, lattice-based and
hash-based cryptographic primitives; algebraic cryptanalysis, algebraic
attacks, number theoretical algorithms, mathematical foundations of
post-quantum cryptography; (lattices, codes); algorithms and software for
symbolic computation in cryptography
-----------------
- For general inquiries regarding MACIS 2017, please send e-mail to
Dimitris Simos <dsimos@sba-research.org>
- For inquiries regarding MACIS topics, please send e-mail to
Johannes Bloemer <bloemer@mail.uni-paderborn.de> or to
Temur Kutsia <kutsia@risc.jku.at>

==== Submission Guidelines ====

Authors are invited to submit papers, presenting original and unpublished
research:
- REGULAR papers are up to 15 pages, and SHORT papers are up to 5 pages,
including references.
- Simultaneous submission to other conferences with published proceedings or
journals is not allowed.
- Please use the LNCS format from Springer:
ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip
- Submissions should be made to the appropriate track of the conference,
by using the easychair submission system:
https://easychair.org/conferences/?conf=macis2017.
- For detailed submission guidelines please see the MACIS website:
https://macis2017.sba-research.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, June 5, 2017

[DMANET] PhD Position in Network Analysis and Order Structures

The research unit Knowledge & Data Engineering is opening a new

PhD position (salary scale TV-H E13, 100%)

under the supervision of Prof. Dr. Gerd Stumme. The successful candidate
will research and develop methods and algorithms to analyze social
networks and discover order structures in bi-partite data.

We welcome talented and highly motivated candidates with interest in
data mining, knowledge representation and mathematics. The position
requires a good knowledge in discrete structures. Furthermore, good
programming skills, a high social competency as well as a very good
command of the English language.

Applicants to the PhD position must have a relevant Master's degree in
Computer Science, Mathematics, Physics or a related field.


The position is (at first) limited to 3 years (cf. Qualifikationsstelle
gem. § 65 HHG i. V. m. § 2 Abs. 1 Satz 1 WissZeitVG;
Promotionsmöglichkeit). Applications are accepted as of now until
2017-06-12. The University of Kassel is an equal opportunity employer. A
significant increase in the proportion of women in research and teaching
is being sought. Qualified women are therefore expressly invited to
apply. In case of equal qualification, persons with disabilities who are
severely handicapped will be given preferential consideration. Please
send your complete application (including all necessary documents and a
letter of intent) to kde-office@cs.uni-kassel.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/
*
**********************************************************

Saturday, June 3, 2017

[DMANET] Travel Support Announcement: Recent Advances in Parameterized Complexity, Tel Aviv 2017

Recent Advances in Parameterized Complexity (http://rapctelaviv.weebly.com/)
will be held on December 3-7, 2017 in Tel Aviv, Israel.

Limited travel support is available for graduate students and postdocs to
participate in Recent Advances in Parameterized Complexity. To apply,
please send your CV and a recommendation letter (to be sent separately by
the referee) to rapctelaviv@gmail.com.

*** Application deadline: August 5, 2017 ***

**********************************************************
*
* 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] Final Call for Papers: Graph Drawing and Network Visualization GD 2017

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

Final Call for Papers

GD 2017

25th International Symposium on
Graph Drawing and Network Visualization

September 25-27, 2017 - Boston, MA, U.S.A.
http://graphdrawing.org/gd2017

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

PDF version:
https://gd2017.ccis.northeastern.edu/files/2017/02/GD2017CFP.pdf

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

Graph Drawing is concerned with the geometric representation of graphs
and constitutes the algorithmic core of Network Visualization. Graph
Drawing and Network Visualization are motivated by applications where it
is crucial to visually analyze and interact with relational datasets.
Examples of such application areas include data science, social
sciences, Web computing, information systems, biology, geography,
business intelligence, information security and software engineering.

GD has been the main annual event in this area for more than 20 years.
Its focus is on combinatorial and algorithmic aspects of graph drawing
as well as the design of network visualization systems and interfaces.
GD 2017 will take place September 25-27, 2017 at the Northeastern
University in Boston, Massachusetts, USA. Researchers and practitioners
working on any aspects of graph drawing and network visualization are
invited to contribute papers and posters and to participate in the
symposium and the graph drawing contest.

PAPERS
------

We invite authors to submit papers describing original research of
theoretical or practical significance to graph drawing and network
visualization. Regular papers must be submitted explicitly to one of two
distinct tracks. Papers submitted to one track will not compete with
papers submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such
as combinatorial aspects and algorithm design. The range of topics for
this track includes (but is not limited to):

• Design and analysis of graph drawing algorithms
• Geometric graph theory
• Geometric computing
• Planarity and topological graph theory
• Optimization on graphs

Track 2: Experimental, applied, and network visualization aspects
-----------------------------------------------------------------

This track is mainly devoted to the practical aspects of graph drawing,
such as the development of network visualization systems and interfaces
in different application areas. The range of topics for this track
includes (but is not limited to):

• Visualization of graphs and networks in real world applications,
including big data
• Engineering of network visualization algorithms and systems
• Experimental results in graph theory and algorithms
• Benchmarks and experimental studies of network visualization systems
and user interfaces
• Cognitive studies on graph drawing readability and user interaction
• Interfaces and methods for interacting with graphs

Short papers
------------

In addition to the above two tracks, there will be a separate category
for short papers, describing theoretical or applied contributions of
shorter length. Papers in this category will be assigned a shorter time
for presentation during the conference.

Demos
-----

Authors of applied papers will have the opportunity to show a demo of
their software/system during the poster session.

Submission format
-----------------

All submissions must be formatted using the LaTeX style file for the
conference series Lecture Notes in Computer Science (LNCS) provided by
Springer. The default margins and fonts must not be modified; in
particular, the use of packages such as times.sty is not allowed.
Submissions that do not comply with this format risk rejection without
consideration of their merits. The length of regular papers is limited
to 12 pages (excluding references), while the length of short papers is
limited to 6 pages (excluding references). The claims of the paper
should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page
limits, the authors should include it in a clearly marked appendix,
whose length is not constrained and which the reviewers may read at
their own discretion.

POSTERS
-------

Submissions of posters on graph drawing, network visualization, and
related areas are solicited. The poster session will provide a forum
for the communication of late-breaking research results (which may also
appear elsewhere) to the GD community. Authors of posters should prepare
an abstract (up to 2 pages in the LNCS style) that must be submitted
together with the poster itself.

CONTEST
-------

Details about the traditional Graph Drawing Contest held at the
conference will be provided on the conference Web site.

PUBLICATION
-----------

All accepted papers (including the two-page poster abstracts) will
appear in the conference proceedings, published by Springer in the
Lecture Notes in Computer Science (LNCS) series. Twelve pages (excluding
references) will be allocated for regular papers and six pages
(excluding references) for short papers. The LNCS proceedings will be
made freely accessible to the GD community upon publication and openly
accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv
repository, in order to provide immediate and unrestricted open access
to them. The self-archived arXiv papers shall consist of an identical
copy of the LNCS proceedings plus an optional clearly marked appendix,
possibly containing a long version of the entire paper or proofs that
have been omitted from the main text. Subsequent submissions of
different versions of the paper to the arXiv (known as arXiv
``replacements'') are allowed. Upon submission of the camera-ready
version of an accepted paper, the authors will be required to specify
the arXiv identifier associated with the paper for inclusion in a
conference index, which will be also published in the ArXiv repository.
Failure to comply with these guidelines will impede the publication of
the paper.

Each paper must be presented at the conference by an author (baring
unforeseen circumstances), otherwise the paper will not be included in
the proceedings. Should any visa restriction prevent an author from
attending the conference and presenting a paper, he/she will be given
ways to participate and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a
special issue of the Journal of Graph Algorithms and Applications
(JGAA). The authors of the best paper in Track 2 will be invited to
submit a substantially extended and enhanced version of their work to
IEEE Transactions on Visualization and Computer Graphics (TVCG).

AWARDS
------

For each of the two tracks, the Program Committee of GD 2017 will give a
Best Paper Award. In addition, to recognize the effort of participants
to present their work and to prepare their posters in a clear and
elegant way, there will be a Best Presentation Award and a Best Poster
Award voted on by the GD 2017 attendees.

IMPORTANT DATES
---------------

• Paper submission deadline: June 11 (23:59 PDT) – Updates
possible until June 13 (23:59 PDT)
• Notification of paper acceptance: July 28
• Poster submission deadline August 17 (23:59 PDT)
• Notification of poster acceptance August 28
• Final versions due September 3
• Contest submission deadline September 13
• Symposium September 25-27

INVITED SPEAKERS
----------------

Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
Alessandro Vespignani, Northeastern University, US

PROGRAM COMMITTEE
-----------------

Daniel Archambault, Swansea University, GB
Benjamin Bach, University of Edinburgh, GB
Fabian Beck, Universität Duisburg-Essen, DE
Michael Bekos, Universität Tübingen, DE
Therese Biedl, University of Waterloo, CA
Giordano Da Lozzo, UC Irvine, US
Vida Dujmovic, University of Ottawa, CA
Stephane Durocher, University of Manitoba, CA
Tim Dwyer, Monash University, AU
Fabrizio Frati (co-chair), Università Roma Tre, IT
Martin Gronemann, Universität zu Köln, DE
John Alexis Guerra Gómez, Universidad de los Andes, CO
Michael Hoffmann, ETH Zürich, CH
Yifan Hu, Yahoo Research, US
Takayuki Itoh, Ochanomizu University, JP
Anna Lubiw, University of Waterloo, CA
Kwan-Liu Ma (co-chair), UC Davis, US
Fabrizio Montecchiani, Università degli Studi di Perugia, IT
Martin Nöllenburg, Technische Universität Wien, AT
Arnaud Sallaberry, LIRMM, FR
Andrew Suk, University of Illinois at Chicago, US
Antonios Symvonis, National Technical University of Athens, GR
Ioannis Tollis, University of Crete, GR
Csaba Tóth, California State University Northridge, US
Alexander Wolff, Universität Würzburg, DE
Jian Zhao, FX Palo Alto Laboratory, US

ORGANIZING COMMITTEE
--------------------

Cody Dunne (co-chair), Northeastern University, US
Alan Keahey (co-chair), Conversant, US

CONTEST COMMITTEE
-----------------

Philipp Kindermann, Universität Würzburg, DE
Maarten Löffler (chair), Utrecht University, NL
Ignaz Rutter, Karlsruhe Institute of Technology, 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/
*
**********************************************************

Friday, June 2, 2017

[DMANET] Open Positions: Postdoctoral Researchers in Theory of Distributed Computing (Helsinki, Finland)

The Distributed Algorithms group in the Department of Computer Science at Aalto University (Helsinki, Finland) is looking for

POSTDOCTORAL RESEARCHERS IN THEORY OF DISTRIBUTED COMPUTING

The postdoctoral researchers will take part in the project "Charting the Landscape of Distributed Time Complexity", funded by the Academy of Finland for 2015-2019. The project is related to the theoretical foundations of distributed computing, with the main focus on understanding the distributed time complexity of so-called local coordination problems. For more information on our research team and the research area, please visit our web page http://research.cs.aalto.fi/da/

The candidates should have a Ph.D. and an excellent track record in research related to theoretical computer science, demonstrated by relevant publications in leading conferences or journals. The positions are fixed-term appointments for one or two years; the starting and ending dates are negotiable. The salary is between 3498 and 3673 EUR per month depending on experience and qualifications.

To apply for the position, please send an email to Jukka Suomela (jukka.suomela@aalto.fi), no later than 30 June 2017. Please include your CV, a list of publications, a brief research statement, and a transcript of doctoral studies. Please also arrange for one or two letters of recommendation to be sent directly to the same address. While all applicants who have submitted an application by the deadline will be appropriately considered, Aalto University reserves the right to also consider other candidates for the announced position.

Further information:

Jukka Suomela
Assistant Professor
Department of Computer Science
Aalto University
jukka.suomela@aalto.fi
http://users.ics.aalto.fi/suomela/


**********************************************************
*
* 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] Joint postdoctoral fellowships at MPI-INF and Universidad de Chile

Up to three joint postdoctoral fellowships will be available at the
Max-Planck-Institute for Informatics in Saarbrücken (MPII) and the
Universidad de Chile in Santiago (UChile) starting in March 2018, or by
mutual agreement at any date thereafter. The position is funded by the
MPII-UChile collaborative grant "Fast algorithms for Massive Data Set",
therefore we are looking for applicants with interests in the design and
analysis of algorithms.

The position is for 12 months renewable by mutual agreement. The
selected candidate will spend 6 months at the Universidad de Chile
working with Jose Correa, Jose Soto, Jose Verschae and/or Andreas Wiese
and 6 months at the MPI for Informatics working with researchers from
the Algorithms and Complexity Department, e.g., Kurt Mehlhorn and
Antonios Antoniadis. Travel support is available.

Applicants must hold a recent PhD or be close to finishing their thesis.
Applications including curriculum vitae, list of publications, research
plan (1 page), and names of references with their e-mail addresses,
should be sent electronically to Andreas Wiese awiese@dii.uchile.cl. To
ensure full consideration the application should be sent before the
deadline of June 30th, 2017. Late applications might be considered on a
case by case basis.

The Max-Planck-Institute for Informatics is located on the campus of the
Universität des Saarlandes in Saarbrücken, Germany. Currently, around 30
researchers of several nationalities work in the Algorithms and
Complexity Department. The working language is English. The group
collaborates with several of the major research institutions in Europe
and the U.S. and has high international visibility.

The Universidad de Chile is the main research institution in Chile. Its
school of Physical and Mathematical Sciences gathers 200+ full time
professors together with a large number of postdocs and other
researchers. The school provides one of the very best research
environments in Latin America for exact sciences and technology.

**********************************************************
*
* 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] 4-year faculty PhD position at University Linz, Austria

As the largest institution of research and education in Upper Austria,
the Johannes Kepler University Linz has over 20,000 enrolled students
and 3,000 employees. The JKU's four faculties offer over 60 academic
degree programs. In order to strengthen our team at the Faculty of
Social Sciences, Economics & Business, we announce an opening starting
October 1, 2017 for a

*****************************************
** **4-year PhD position ***
*** *(UniversitätsassistentIn, must* *
* *hold a Diploma/Master's degree)****
*** *at the Department of**
* Production and Logistics Management *
***************************************** *

*Job Reference Number: 3361 *

Job Duties:
- Conduct independent research on topics relevant to the institute and
publish the respective findings
- Present research results at international conferences
- Take part in the execution of institutional research projects
- Teach university-level courses and co-supervise Master's and Bachelor
theses
- Participate in administrative tasks at the institute

Your Qualifications:
- Diploma/Master's degree in business science, economics, business
informatics, computer science, mathematics, statistics, or a related field
- Strong interest in research issues pertaining to production,
logistics, and supply chain management
- Experience in applying quantitative methods (combinatorial
optimization, linear programming, simulation, metaheuristics)
- Programming skills (preferred C/C++ or Java)
- Strong command of English (spoken and written)

The minimum salary in accordance with the collective agreement is €
2,731.00 gross per month (CA Job Grade: B1). If you have questions,
please contact: Univ. Prof. Sophie Parragh, Ph.D. (sophie.parragh@jku.at).

*Application deadline: June 14, 2017. *

The Johannes Kepler University wishes to increase the proportion of
academic female faculty and, for this reason, especially welcomes
applications by qualified women. If applicants are equally qualified, a
woman will be given preference for this position. The university
welcomes applications from qualified applicants with physical
disabilities. These applications will be given special consideration.
Prospective applicants interested in the multifaceted position are
requested to electronically send their applications via our online
portal http://jku.at/bewerbungor to the Johannes Kepler University Linz,
Department of Human Resource Management, Altenberger Straße 69, A-4040
Linz. Please include "Job Reference Number 3361" in your application.
**********************************************************
*
* 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, June 1, 2017

[DMANET] Transportation Science: Special Section: ROADEF/EURO Challenge 2016

*Special Section: ROADEF/EURO Challenge 2016*

*Guest Editors*
*
*
*Roberto Wolfler Calvo*

LIPN, Laboratoire d'Infomatique de Paris Nord, Universite Paris 13,
Villetaneuse, France, roberto.wolfler@lipn.univ-paris13.fr

*Jean Andre*

Air Liquide R&D-Applied Mathematics Global Lab, Operations Research
Team, Paris, France, jean.andre@airliquide.com

*Eric Bourreau*

LIRMM, 161 rue Ada, Montpellier Cedex 5, 34090 Montpellier, France,
eric.bourreau@lirmm.fr

*SUBMISSION DEADLINE: SEPTEMBER 1, 2017*
Inventory routing is key issue in logistics. The ROADEF/EURO Challenge
2016 (http://challenge.roadef.org/2016/en/index.php) was devoted to this
topic and focused on an inventory routing problem proposed by Air
Liquide. The inventory routing problem proposed by Air Liquide arises in
their healthcare business (https://www.airliquide.com/healthcare), which
delivers large (bulk) volumes of liquid oxygen to 7500 hospitals
worldwide. Their inventory routing problem incorporates both vendor
managed inventory (VMI) customers (the majority) and call-in customers
(still a significant number) who are served on demand.

We invite papers for a special section of/Transportation Science/devoted
to this variant of the Inventory Routing Problem. All papers submitted
have to discuss approaches that can solve the ROADEF instances. All
papers will go through the standard review process of/Transportation
Science/. Up to five accepted papers will be published in the special
section; others may appear as regular journal articles.

*Submission:*Please submit your manuscript online via ScholarOne
Manuscripts at
http://mc.manuscriptcentral.com/transci. When choosing Manuscript Type
in Step 1 of the submission process, enter "Special Section –
ROADEF/EURO", otherwise your submission will be handled as a regular
manuscript.

The Instructions to Authors can be found on the /Transportation Science
/homepage:
http://pubsonline.informs.org/page/trsc/submission-guidelines.
**********************************************************
*
* 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 2017] CFE for "Humies" Awards at GECCO **Deadline next week**

Call For Entries
for 14th Annual (2017) "Humies" Awards
for Human-Competitive Results
Produced by Genetic and Evolutionary Computation
www.human-competitive.org

To be Held at
Genetic and Evolutionary Computation Conference (GECCO)
July 15-19, 2017 (Saturday-Wednesday)
Berlin
http://gecco-2017.sigevo.org/

Entries are hereby solicited for awards totaling $10,000 for
human-competitive results that have been produced by any form of genetic
and evolutionary computation (including, but not limited to genetic
algorithms, genetic programming, evolution strategies, evolutionary
programming, learning classifier systems, grammatical evolution, gene
expression programming, differential evolution, etc.) and that have been
published in the open literature between the deadline for the previous
competition and the deadline for the current competition.

The competition will be held as part of the Genetic and Evolutionary
Computation (GECCO) conference operated by the Association for
Computing Machinery (ACM) Special Interest Group (SIG) on Genetic and
Evolutionary Computation (SIGEVO). Entries chosen to be finalists will
be made at the conference. The winners of the awards will be announced
during the conference.

IMPORTANT DATES:
• Wednesday June 7, 2017 — Deadline for entries (consisting of one TEXT
file and one or more PDF files). Send entries to koza at
human-competitive dot org

• Wednesday June 21, 2017 — Finalists will be notified by e-mail

• Wednesday July 5, 2017 — Finalists must submit their presentation
(e.g., PowerPoint, PDF) for posting on the competition's web site. Send
presentations to koza at human-competitive dot org

• July 15-19, 2017 (Saturday-Wednesday) — The GECCO conference

• Monday July 17, 2017 (VERY TENTATIVE) — Presentations before judging
committee at public session of the GECCO conference. Finalists should
make a point of checking for the time and date in the conference's final
schedule.

• Wednesday July 19, 2017 (TENTATIVE) — Announcement of awards at
plenary session of the GECCO conference

JUDGING COMMITTEE
• Erik Goodman
• Una-May O'Reilly
• Wolfgang Banzhaf
• Darrell Whitley
• Lee Spector

CALL FOR ENTRIES
Techniques of genetic and evolutionary computation are being
increasingly applied to difficult real-world problems — often yielding
results that are not merely academically interesting, but competitive
with the work done by creative and inventive humans. Starting at the
Genetic and Evolutionary Computation Conference (GECCO) in 2004, cash
prizes have been awarded for human-competitive results that had been
produced by some form of genetic and evolutionary computation in the
previous year.

This prize competition is based on published results. The publication
may be a paper at the GECCO conference (i.e., regular paper, poster
paper, or any other full-length paper), a paper published anywhere in
the open literature (e.g., another conference, journal, technical
report, thesis, book chapter, book), or a paper in final form that has
been unconditionally accepted by a publication and is "in press" (that
is, the entry must be identical to something that will be published
imminently without any further changes). The publication may not be an
intermediate or draft version that is still subject to change or
revision by the authors or editors. The publication must meet the usual
standards of a scientific publication in that it must clearly describe a
problem, the methods used to address the problem, the results obtained,
and sufficient information about how the work was done in order to
enable the work described to be independently replicated.

An automatically created result is considered "human-competitive" if it
satisfies at least one of the eight criteria below.

(A) The result was patented as an invention in the past, is an
improvement over a patented invention, or would qualify today as a
patentable new invention.

(B) The result is equal to or better than a result that was accepted as
a new scientific result at the time when it was published in a
peer-reviewed scientific journal.

(C) The result is equal to or better than a result that was placed into
a database or archive of results maintained by an internationally
recognized panel of scientific experts.

(D) The result is publishable in its own right as a new scientific
result independent of the fact that the result was mechanically created.

(E) The result is equal to or better than the most recent human-created
solution to a long-standing problem for which there has been a
succession of increasingly better human-created solutions.

(F) The result is equal to or better than a result that was considered
an achievement in its field at the time it was first discovered.

(G) The result solves a problem of indisputable difficulty in its field.

(H) The result holds its own or wins a regulated competition involving
human contestants (in the form of either live human players or
human-written computer programs).

Contestants should note that a pervasive thread in most of the above
eight criteria is the notion that the result satisfy an "arms length"
standard — not a yardstick based on the opinion of the author, the
author's own institution (educational or corporate), or the author's own
close associates. "Arms length" may be established in numerous ways. For
example, if the result is a solution to "a long-standing problem for
which there has been a succession of increasingly better human-created
solutions," it is clear that the scientific community (not the author,
the author's own institution, or the author's close associates) have
vetted the significance of the problem. Similarly, a problem's
significance may be established if the result replicates or improves
upon a scientific result published in a peer-reviewed scientific
journal, replicates or improves upon a previously patented invention,
constitutes a patentable new invention, or replicates or improves a
result that was considered an achievement in its field at the time it
was first discovered. Similarly, a problem's significance may be
established if the result holds its own or wins a regulated competition
involving live human players or human-written computer programs. In each
of the foregoing examples, the standard for human-competitiveness is
being established external to the author, the author's own institution,
or the author's close associates. It is also conceivable to rely only on
criterion G ("The result solves a problem of indisputable difficulty in
its field"); however, if only criterion G is claimed, there must be a
clear and convincing argument that the problem's "difficulty" is indeed
"indisputable."

The competition will be held as part of the annual Genetic and
Evolutionary Computation (GECCO) conference. Entries chosen to be
finalists are to be made at the conference. The awards and prizes will
be announced at the conference.

Cash prizes of $5,000 (gold), $3,000 (silver), and bronze (either one
prize of $2,000 or two prizes of $1,000) will be awarded for the best
entries that satisfy one or more of the criteria for
human-competitiveness. The awards will be divided equally among
co-authors unless the authors specify a different division at the time
of submission. Prizes are paid by check in U.S. dollars after the GECCO
conference. The judges may, based on submissions, rearrange the prize
amounts and prize categories within the total amount available for prizes.

DETAILED INSTRUCTIONS FOR ENTERING THE "HUMIES"

If you plan to make an entry into this competition, please check the web
site at www.human-competitive.org for updated information and for
possible changes immediately prior to submitting your entry.

If you make an entry, please re-check the web site prior to the
conference for possible changes in the instructions or the schedule.

All entries are to be sent electronically to koza at human-competitive
dot org. All entries will be promptly acknowledged, so please make an
inquiry if you do not receive a reasonably prompt acknowledgment shortly
after your submission.

An entry must consist of one TEXT file and one or more PDF files. If the
same authors are making multiple entries, please submit separate
e-mails, each containing the required TEXT file and PDF file(s)
supporting the entry.

The TEXT file must contain the following 10 items. Please be very
careful to include ALL required information. Contestants are alerted to
the fact that items 6 and 9 are especially important and will be the
main basis by which entries will be judged. The papers and presentations
from earlier competitions (starting in 2004) are posted at the
competition web site at www.human-competitive.org. These previous
entries may be informative and helpful in crafting your entry.

1. the complete title of one (or more) paper(s) published in the open
literature describing the work that the author claims describes a
human-competitive result;

2. the name, complete physical mailing address, e-mail address, and
phone number of EACH author of EACH paper(s);

3. the name of the corresponding author (i.e., the author to whom
notices will be sent concerning the competition);

4. the abstract of the paper(s);

5. a list containing one or more of the eight letters (A, B, C, D, E, F,
G, or H) that correspond to the criteria (see above) that the author
claims that the work satisfies;

6. a statement stating why the result satisfies the criteria that the
contestant claims (see examples of statements of human-competitiveness
as a guide to aid in constructing this part of the submission);

7. a full citation of the paper (that is, author names; publication
date; name of journal, conference, technical report, thesis, book, or
book chapter; name of editors, if applicable, of the journal or edited
book; publisher name; publisher city; page numbers, if applicable);

8. a statement either that "any prize money, if any, is to be divided
equally among the co-authors" OR a specific percentage breakdown as to
how the prize money, if any, is to be divided among the co-authors;

9. a statement stating why the authors expect that their entry would be
the "best," and

10. An indication of the general type of genetic or evolutionary
computation used, such as GA (genetic algorithms), GP (genetic
programming), ES (evolution strategies), EP (evolutionary programming),
LCS (learning classifier systems), GE (grammatical evolution), GEP (gene
expression programming), DE (differential evolution), etc.

The PDF file(s) are to contain the paper(s). The strongly preferred
method is that you send a separate PDF file for each of your paper(s)
relating to your entry. Both the text file and the PDF file(s) for each
entry will be permanently posted on a web page shortly after the
deadline date for entries (for use by the judges, conference attendees,
and anyone else who is interested) and will remain posted on the web as
a permanent record of the competition. If your paper is only available
on the publisher's web site and your publisher specifically requires
that your published paper may appear only on your own personal page, the
second choice is that you send link(s) to a separate web page on your
web site containing link(s) to the PDF file(s) of the paper(s) that
constitute your entry. This separate web page is to contain nothing
else, so the interested parties may quickly locate your paper(s). If you
use this second-choice option, you must ALSO supply a link to a
permanent web site maintained by your publisher where your specific
paper may be viewed or purchased (that is, not a link merely to the
publisher's general home page, but a link to the specific web page
containing your paper on the publisher's site). The objective, in each
case, is to provide a permanent record of the entries and to make it
easy for anyone to locate your material.

Generally, only one paper should be submitted. Note that this is a
competition involving a result that satisfies the criteria for being
human-competitive (not a competition involving an evaluation of the
author's entire body of work). More than one paper should be submitted
only if no single paper fully describes the specific result or method.

The judging committee will review all entries and identify a short list
for presentation at the GECCO conference. Finalists will be notified by
an e-mail to the corresponding author. Please acknowledge receipt of
this message, so the judges know that you received your notice.
Finalists must then make a short oral presentation to the judging
committee at a public session of the GECCO conference. The presentations
will be held on one of the early days of the conference, and the winners
will be announced a day or two later at the conference.

Finalists must submit their presentation (e.g., a PowerPoint, PDF) by
e-mail to koza at human-competitive dot org. All submissions will be
promptly acknowledged, so please make an inquiry if you do not receive a
reasonably prompt acknowledgment. These presentations will be posted on
the web page for the competition.

At the GECCO conference, there will be 10-minute oral presentations by
the finalists to the judging committee. The presentations will be open
to all conference attendees at a special session of the conference. The
oral presentation should primarily focus on

1. why the result qualifies as being human-competitive and

2. why the judges should consider the entry as "best" in comparison to
other entries that may also be "human-competitive" (because, as
previously mentioned, these are the two main standards by which entries
will be judged by the judges).

In the short oral presentation to the judges, a description of the work
itself is decidedly secondary. By the time of the presentation the
judges will be familiar with the papers. Thus, the focus of the
presentation is on reasons why the work being presented should win a prize
— not an explanation or presentation of the work itself.

In the unlikely event that a presenter is scheduled to make a
presentation elsewhere at the GECCO conference at the same time, please
notify the judging committee, so they can rearrange time slots.

After the oral presentations, the award committee will meet and consider
the presentations.

The presenting author for each entry must register for the GECCO conference.

A judge will recuse himself or herself if he or she is closely
associated with a finalist (e.g., a current academic advisor, current
collaborator, co-author with the finalist of related work).

Additional information is at www.human-competitive.org

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 2017
*********************************

**********************************************************
*
* 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] 7th Int. Conf. on HPSC, March 19-23, 2018 in Hanoi, Vietnam

*7th Int. Conf. on HPSC, March 19-23, 2018 in Hanoi, Vietnam*

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

*Topics*
- mathematical modeling
- numerical simulation
- methods for optimization and control
- parallel computing: architectures, algorithms, tools and environments
- software developmentapplications of scientific computing in

- physics, mechanics, hydrology,
- chemistry, biology, medicine,
- transport, logistics, site location,
- communication, scheduling,
- industry, business, finance..
-

*Contact*

- E-mail: hpsc2018@math.ac.vn


- Conference Web site: http://hpsc.iwr.uni-heidelberg.de/HPSCHanoi2018

*Deadlines*

-

Deadline for registration and submission of abstracts: September 29,
2017.
Notification of acceptance for presentation: December 22, 2017.
Deadline for applying a business visa through the organizers: January
19, 2018.
Deadline for hotel reservation: January 19, 2018.
Deadline for submission of full papers for the conference proceedings:
May 29, 2018.
*(Please do not submit full papers before March 29, 2018)*


<http://hpsc.iwr.uni-heidelberg.de/HPSCHanoi2018>

**********************************************************
*
* 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 31, 2017

[DMANET] WAOA 2017 - Second call for papers

WAOA 2017 - SECOND CALL FOR PAPERS
=================================================================
15th Workshop on Approximation and Online Algorithms
https://algo2017.ac.tuwien.ac.at/waoa/

7-8 September 2017. Vienna, Austria

Important Dates

Submission deadline: June 27, 2017
Notification: July 21th, 2017
Workshop: September 7-8, 2017
Camera Ready: September 25, 2017

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

Approximation and online algorithms are fundamental tools to deal with
computationally hard problems and problems in which the input is gradually
disclosed over time. Both kinds of problems arise from a large number of
applications in a variety of fields. The workshop focuses on the design
and analysis of approximation and online algorithms. It also covers
experimental methods used to design and analyze efficient approximation
and online algorithms.

WAOA 2017 will be part of ALGO 2017 (https://algo2017.ac.tuwien.ac.at/waoa/),
which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, IPEC, and PCSS.
ALGO 2017 will take place 4-8 September 2017 in Vienna, Austria.

Topics
Papers are solicited in all research areas related to approximation and
online algorithms, including, but not limited to:

- graph algorithms
- inapproximability results
- network design
- packing and covering
- paradigms for the design and analysis of
approximation and online algorithms
- parameterized complexity
- scheduling problems
- algorithmic game theory
- algorithmic trading
- coloring and partitioning
- competitive analysis
- computational advertising
- computational finance
- cuts and connectivity
- geometric problems
- mechanism design
- resource augmentation
- real-world applications

====================================================================
Publication:

Proceedings will be published in the Springer series Lecture Notes
in Computer Science after the workshop takes place. Instructions for
authors can be found at Springer web site (www.springer.com/lncs).

Submission guidelines:

Authors are invited to submit an extended abstract or full paper of at
most 12 pages, not including the references, describing original
unpublished research. Simultaneous submission to other conferences
with published proceedings is not permitted. The title page of the
submission should include the authors' full names, addresses, e-mail
addresses, and an abstract summarizing the results in roughly 100-200
words. The remainder of the submission should contain a description
of the main results, an explanation of their importance, and a clear
comparison with related work. The submission must include full proofs
of the results. Material that cannot be included in the 12 allowed
pages can be placed in an appendix, that will be read at the sole
discretion of the program committee.

Submissions should be formatted for letter-size paper with reasonable
margins and at least 11-point font.

Papers should be submitted electronically via the EasyChair submission
system at:

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

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

====================================================================
Program Committee

Yossi Azar, Tel Aviv University
Danny Chen, University of Notre Dame
Jose Correa, Universidad de Chile
Khaled Elbassioni, Masdar Institute Abu Dhabi
Leah Epstein, University of Haifa
Rudolf Fleischer (co-chair), German University of Technology in Oman
Martin Fürer, The Pennsylvania State University
Klaus Jansen, University of Kiel
Li Jian, Tsinghua University
George Karakostas, McMaster University
Monaldo Mastrolilli, IDSIA Switzerland
Nicole Megow, University of Bremen
Jiri Sgall, Charles University
Roberto Solis-Oba (co-chair), Western University
Frits Spieksma, KU Leuven
Clifford Stein, Columbia University
Denis Trystram, Grenoble Institute of Technology
Gerhard Woeginger, RWTH Aachen University
Qin Zhang, Indiana University Bloomington
**********************************************************
*
* 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] IPEC 2017 Second Call For Papers

CALL FOR PAPERS

The 12th International Symposium on Parameterized and Exact Computation
(IPEC 2017) covers research in all aspects of parameterized and exact
algorithms and complexity. Papers presenting original research in the
area are sought, including but not limited to: new techniques for the
design and analysis of parameterized and exact algorithms,
fixed-parameter tractability results, parameterized complexity theory,
relationship between parameterized complexity and traditional complexity
classifications, applications of parameterized and exact computation,
and implementation issues of parameterized and exact algorithms. In
particular, studies on parameterized and exact computations for
real-world applications and algorithmic engineering are especially
encouraged.

IPEC 2017 will be part of ALGO 2017, which also hosts ESA 2017 and a
number of more specialized conferences and workshops. ALGO 2017 will
take place September 4-8, 2017, Vienna, Austria.

Authors are invited to submit an extended abstract of up to 12 pages
(including references) in LIPIcs style, in English, describing original
unpublished research. Simultaneous submission to other conferences with
published proceedings is not permitted. All claims made in the extended
abstract must be fully justified, either in an enclosed full version, or
by providing a reference to a full version published on Arxiv.org prior
to the conference deadline. The full version will be read at the
discretion of the program committee. Authors must submit their papers
electronically. A detailed description of the electronic submission
process will be available at the symposium website. Program committee
members (except the co-chairs) are allowed to submit papers.

Accepted papers will be published in the symposium proceedings in the
Leibniz International Proceedings in Informatics (LIPIcs) series, based
at Schloss Dagstuhl. Authors of accepted papers are expected to present
their work at the symposium, and to incorporate the comments from the
program committee. A journal special issue will be planned for selected
papers presented at IPEC 2017.

The program committee may award a Best Paper Award and an Excellent
Student Paper Award to one or more papers accepted to the symposium. For
the Excellent Student Paper Award, a student is someone who has not
received a PhD degree before the paper submission deadline. A paper is
eligible for the award if at least one co-author is a student, and at
most one co-author is not a student. If there is a non-student author,
the students' contributions must be substantial, and a student must give
the presentation at the conference.

The conference features an invited talk and an invited tutorial. The
invited talk will be given by one of the 2017 EATCS-IPEC Nerode Prize
winners, Fabrizio Grandoni. The prize was awarded for the paper "A
measure & conquer approach for the analysis of exact algorithms." [J.
ACM, 2009] by Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. The
invited tutorial will be given by Mikolaj Bojanczyk.

The submission server is available here:
https://easychair.org/conferences/?conf=ipec2017

The registration information will be available at the ALGO 2017 website:
https://algo2017.ac.tuwien.ac.at/ipec/


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

Important Dates:

Abstract Submission:
June 25, 2017, 23:59 AOE

Paper Submission:
June 28, 2017, 23:59 AOE

Notification of acceptance:
July 25, 2017

Symposium:
September 6-8, 2017

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

Program Committee:
Christina Boucher
Karl Bringmann
Radu Curticapean
Henning Fernau
Stefan Kratsch
Daniel Lokshtanov (co-chair)
Neeldhara Misra
Jesper Nederlof
Rolf Niedermeier
Naomi Nishimura (co-chair)
Michal Pilipczuk
Venkatesh Raman
M. S. Ramanujan
Virginia V. Williams

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