Thursday, March 23, 2017

[DMANET] Call for Papers - ACM Workshop SecDef 2017

Dear colleagues,

This might be of interest to some of you.

Apologies for cross-posting.

Anna I. Exparcia-Alcazar, Gunes Kayacik, Frank W. Moore and Nur
Zincir-Heywood
SecDef 2017 Workshop Co-chairs

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

The Fourth ACM Workshop on Genetic and Evolutionary Computation in Defense,
Security, and Risk Management (SecDef'2017)

In conjunction with the ACM Genetic and Evolutionary Computation Conference
(GECCO) in Berlin, Germany, July 15-19, 2017

https://projects.cs.dal.ca/projectx/secdef2017/index.html

(Submissions due: 29 March 2017)

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

The Fourth ACM Workshop on Genetic and Evolutionary Computation in Defense,
Security, and Risk Management (SecDef'2017) will be held in conjunction
with the ACM Genetic and Evolutionary Computation Conference (GECCO) in
Berlin, Germany, July 15-19, 2017.

With the constant appearance of new threats, research in the areas of
defense, security and risk management has acquired an increasing importance
over the past few years. These new challenges often require innovative
solutions and computational intelligence techniques can play a significant
role in finding them.
We invite both completed and work in progress, with the aim to encourage
communication between active researchers and practitioners to better
understand the current scope of efforts within this domain. The ultimate
goal is to understand, discuss, and help set future directions for
computational intelligence in security and defense problems.

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

Topics of Interest

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

Authors are invited to submit papers that fall into or are related to one
or multiple topic areas listed below:

Security:
- Intrusion Detection
- Anomaly Detection
- Signature-Based Detection
- Behavior Monitoring
- Network Traffic Analysis
- System Data Analysis
- Application Data Analysis
- Attack Prevention and Defense Systems
- Threat Forecasting Systems
- Anti Spam and/or Antivirus Systems
- Bring Your Own Device
- Critical Infrastructure Protection
- Advanced Persistent Threats

Defense:
- Design of Military Systems and Sub-Systems
- Logistics and Scheduling of Military Operations
- Strategic Planning and Tactical Decision Making
- Logistics and Scheduling of Military Operations
- Examining Tradeoffs in Military and Counter-Terrorism Procedures
- Automated Discovery of Tactics and Procedures for Military and Defense
Systems
- Cyber Warfare
- Cyber Fraud

Risk:
- Identification, Prevention, Monitoring, and Handling of Risks
- Risk Impact and Probability Estimation Systems
- Contingency Plans,
- Real Time Risk Management
- Policy Management

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

Paper Submission

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

Paper submissions must present original, unpublished research or
experiences. Each submission must be written in English. There is a length
limitation of 8 pages (including title, abstract, all figures, tables, and
references) for regular papers. Submissions must be in the ACM GECCO
manuscript style.

Papers should be submitted in PDF format to secdefworkshop@gmail.com.
Acceptance to the workshop will be based on peer review of submitted
papers. Each accepted submission will be presented orally at the workshop.

Papers accepted for SecDef'2017 will be distributed in the GECCO Companion
Volume and ACM Digital Library.

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

Important Dates

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

Paper Submission Deadline: March 29, 2017
Acceptance Notification: April 15, 2017
Camera-Ready Papers: April 24, 2017
Workshop Date: July 15/16, 2017

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

Workshop Co-Chairs

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

Anna I. Exparcia-Alcazar, Gunes Kayacik, Frank W. Moore and Nur
Zincir-Heywood

Please contact us if you have any question about the ACM Workshop
SecDef'2017: secdefworkshop@gmail.com

**********************************************************
*
* 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] School and Workshop "Aperiodicity and Hierarchical Structures in Tiling", Lyon, September 2017

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

Dear Colleagues,

This is a double announcement:

For the research school https://tilingslyon2017.sciencesconf.org/
and the following workshop https://aperiodic2017.sciencesconf.org/

"Aperiodicity and Hierarchical Structures in Tilings"

both to be held at the ENS de Lyon.

The school will take place during September 18-22, 2017.
and the workshop during September 25-29, 2017.

School and workshop are part of the thematic semester
"Graphs, Groups and Dynamics" (September, 2017 to February, 2018).

The school will be centred around four mini-courses which will be given by:

- Laurent Bartholdi (ENS, Paris and University of Göttingen)
- Edmund Harris (University of Arkansas)
- Jarkko Kari (University of Turku)
- Lorenzo Sadun (University of Texas at Austin).

Registration is free of charge but compulsory.

For registration and further information please visit the corresponding
webpages.

Looking forward to seeing you in Lyon,

The organising committee
Nathalie Aubrun
Johannes Kellendonk
Michael Rao


--
===============================
Nathalie Aubrun

CNRS, LIP, Équipe MC2
École Normale Supérieure de Lyon
Tél : +33(0)4.26.23.39.32
nathalie.aubrun@ens-lyon.fr

http://perso.ens-lyon.fr/nathalie.aubrun/

**********************************************************
*
* 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] WAOA 2017 Call for papers

WAOA 2017 - 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] PhD- or Postdoc-positions in algorithms at TU Dortmund (Germany)

**********************************************************************
TU Dortmund (Germany): PhD or PostDoc positions in Discrete Algorithms
and Data Structures
**********************************************************************

The Technical University of Dortmund has one of the largest faculties
for Computer Science in Germany and offers a very stimulating
environment for algorithm theory and algorithm engineering.

The group of Johannes Fischer (ls11-www.cs.uni-dortmund.de/fischer/start)
offers 2 full-time PhD or PostDoc positions in the broad area of Discrete
Algorithms or Data Structures, starting as soon as possible. We seek:

* PhD-students with an excellent Master's (or equivalent) degree in
computer science and a strong interest in algorithms and data
structures, to be documented, e.g., with specialization in those
topics and very good grades.
* PostDocs with a PhD in computer science and a strong background in
discrete algorithms and data structures, to be documented, e.g.,
with a strong publication record in those fields.

Research areas of the group include:

- string algorithmics,
- text indexing for big data,
- indexes for approximate pattern matching
- text compression and compressed text indexing,
- external memory indexes,
- space efficient data structures, and
- shared memory and distributed parallel computing,

but other research topics fitting into the areas of stringology or
compressed data structures are also welcome.

Good communication skills and solid English writing skills are
mandatory. There are moderate teaching obligations (TA) for which
knowledge of German or the commitment to study it quickly would be a
plus, but are not strictly necessary.

PhD positions are initially for 2 years, but can be extended for up to
2 more years by mutual consent. The net salaries range from around EUR
2000/month in the first year up to 2250 EUR/month in the final year,
including a full health insurance and other welfare benefits (TVL
E13-1/2/3).

PostDoc positions are initially for 1 year, but can be extended by
mutual consent. The net salary starts around 2250 EUR/month, again
including a full health insurance and other welfare benefits (TVL
E13-3).

Please send by email (pdf format only):
- a cover letter, in which you give the names and email-addresses of
at least one (Phd-students) or two (PostDocs) referees who would be
willing to write a letter of recommendation (e.g., your thesis
supervisor)
- your CV
- your motivation to work in the area (PhD-students) or
a short research plan (Postdocs; max. 2 pages)
- your Master's or PhD-thesis
- PhD-students only: copies of transcripts showing your courses taken
and their grades
- list of publications and copies of your two or three most relevant
papers (if available)

to johannes.fischer<<AT>>cs.tu-dortmund.de . Use this email address also
if you have further inquiries. You can send encrypted email (see homepage
for the PGP-key).

Dortmund is situated on the edge of Germany's largest urban
conglomeration, the Ruhr Area with approx. 5 million inhabitants, and
offers all opportunities for leisure time activities. It is also the
home of one of the best football clubs in Germany! Dortmund has a small
international airport; larger airports in Frankfurt and Duesseldorf
are also easily reachable by train (1 or 2 hrs, respectively).

All applications arriving before May 1, 2017, will be given full
consideration, but the call remains open until the positions have been
filled. Successful applicants should ideally start in summer/fall 2017, but
this is negotiable.
**********************************************************
*
* 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] Associate Professor (TF) of Algorithms and Complexity Theory, University of Oxford

DEADLINE FOR APPLICATIONS: 5th MAY 2017

Applications are invited for the post of Associate Professor (or Professor) of Algorithms and Complexity Theory to be held in the Department of Computer Science with effect from 1 October 2017. The successful candidate will also be appointed as Fellow and Tutor in Computer Science at Hertford College.

The salary for this position is offered on a scale from £45,562 per annum, plus substantial additional benefits, including single accommodation at college, if available, or a living-out allowance of £8,437 p.a. An allowance of £2,655 p.a. would be payable upon award of Full Professor title.

The Department of Computer Science is a vibrant and growing academic department, which has a research profile across the entire spectrum of contemporary computing. The Associate Professor will be expected to engage in independent and original research in the field of Algorithms and Complexity Theory, to secure funding and engage in the management of research projects and disseminate research of the highest international standard through publications, conferences and seminars. They will also will contribute to teaching on the Department's highly successful undergraduate and graduate programmes. Oxford has a strong tradition in Algorithms and Complexity Theory, with multiple active faculty members in the Computer Science, Information Engineering, and Statistics departments.

The Associate Professor will be a member of both the University and the College community. They will be part of a lively and intellectually stimulating research community with access to the excellent research facilities which Oxford offers. They will have a role to play in the running of the College as a member of the Governing Body and a trustee of the College as a charity.

The successful candidate will hold a doctorate in Computer Science, or a related subject, will have the ability to teach across a range of computer science subjects, and will also have a proven research record of high quality at international level in the area of Algorithms and Complexity Theory, and experience of research collaborations at both national and international level.

For further details and to apply, visit https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.display_form.

**********************************************************
*
* 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 2017) - CFP

GraMSec 2017 - call for papers

The Fourth International Workshop on Graphical Models for Security
Santa Barbara, CA, USA - August 21, 2017

http://gramsec.uni.lu
Co-located with CSF 2017
LNCS proceedings confirmed

SCOPE
Graphical security models provide an intuitive but systematic approach
to analyze security weaknesses of systems and to evaluate potential
protection measures. Cyber security researchers, as well as security
professionals from industry and government, have proposed various
graphical security modeling schemes. Such models are used to capture
different security facets (digital, physical, and social) and address a
range of challenges including vulnerability assessment, risk analysis,
defense analysis, automated defensing, secure services composition,
policy validation and verification. The objective of the GraMSec
workshop is to contribute to the development of well-founded graphical
security models, efficient algorithms for their analysis, as well as
methodologies for their practical usage.

TOPICS
The workshop seeks submissions from academia, industry, and government
presenting novel research on all theoretical and practical aspects of
graphical models for security. The topics of the workshop include, but
are not limited to:

• Graphical models for threat modeling and analysis
• Graphical models for risk analysis and management
• Graphical models for requirements analysis and management
• Textual and graphical representation for system, organizational, and
business security
• Visual security modeling and analysis of socio-technical and
cyber-physical systems
• Graphical security modeling for cyber situational awareness
• Graphical models supporting the security by design paradigm
• Methods for quantitative and qualitative analysis of graphical
security models
• Formal semantics and verification of graphical security models
• Methods for (semi-)automatic generation of graphical security models
• Enhancement and/or optimization of existing graphical security models
• Scalable evaluation of graphical security models
• Evaluation algorithms for graphical security models
• Dynamic update of graphical security models
• Game theoretical approaches to graphical security modeling
• Attack trees, attack graphs and their variants
• Stochastic Petri nets, Markov chains, and Bayesian networks for security
• UML-based models and other graphical modeling approaches for security
• Software tools for graphical security modeling and analysis
• Case studies and experience reports on the use of graphical security
modeling paradigm

INVITED SPEAKER
To be decided.

PAPER SUBMISSION
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:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0

Each paper will undergo a thorough review process. All accepted (regular
and short) papers will be included in the workshop's post-proceedings.
The GraMSec 2017 post-proceedings will be published in the Lecture Notes
in Computer Science (LNCS) series of Springer. Submissions should be
made using the GraMSec 2017 EasyChair web site:
https://www.easychair.org/conferences/?conf=gramsec17

IMPORTANT DATES
• Submission deadline: Sunday, May 21, 2017
• Acceptance notification: Friday, July 7, 2017
• Workshop: Monday, August 21, 2017

GENERAL CHAIR
• Sjouke Mauw, University of Luxembourg, Luxembourg

PROGRAM CHAIRS
• Peng Liu, Pennsylvania State University, USA
• Ketil Stølen, SINTEF Digital and University of Oslo, Norway

PC MEMBERS
Mathieu Acher, University Rennes 1, Inria, France
Massimiliano Albanese, George Mason University, USA
Ludovic Apvrille, Télécom ParisTech, France
Thomas Bauereiss, DFKI, Germany
Kristian Beckers, Technical University of Munich, Germany
Giampaolo Bella, University of Catania, Italy
Stefano Bistarelli, Università di Perugia, Italy
Marc Bouissou, EDF RD, France
Frédéric Cuppens, Télécom Bretagne, France
Nora Cuppens-Boulahia, Télécom Bretagne, France
Binbin Chen, Advanced Digital Sciences Center, Singapore
Hervé Debar, Télécom SudParis, France
Harley Eades, Augusta University, USA
Mathias Ekstedt, KTH - Royal Institute of Technology, Sweden

Ulrik Franke, Swedish Institute of Computer Science - SICS, Sweden
Frank Fransen, TNO, The Netherlands
Olga Gadyatskaya, University of Luxembourg, Luxembourg
Paolo Giorgini, University of Trento, Italy
Dieter Gollmann, Hamburg University of Technology, Germany
Joshua Guttman, WPI and MITRE, USA
René Rydhof Hansen, Aalborg University, Denmark
Maritta Heisel, Universität Duisburg-Essen, Germany
Hannes Holm, Swedish Defence Research Agency, Sweden
Siv Hilde Houmb, Secure-NOK AS, Norway
Sushil Jajodia, George Mason University, USA
Ravi Jhawar, University of Luxembourg, Luxembourg
Henk Jonkers, BiZZdesign, The Netherlands
Cristian Johansen, University of Oslo, Norway
Florian Kammueller, Middlesex University London, UK
Nima Khakzad, TU Delft, The Netherlands
Dong Seong Kim, University of Canterbury, New Zealand
Barbara Kordy, INSA Rennes, IRISA, France
Pascal Lafourcade, Université Clermont Auvergne, LIMOS, France
Jean-Louis Lanet, Inria, France
Per Håkon Meland, SINTEF Digital, Norway
Jogesh Muppala, HKUST, Hong Kong, SAR China
Simin Nadjm-Tehrani, Linköping University, Sweden
Andreas L. Opdahl, University of Bergen, Norway
Xinming Ou, University of South Florida, USA
Stéphane Paul, Thales Research and Technology, France
Wolter Pieters, TU Delft, The Netherlands
Ludovic Piètre-Cambacédès, EDF, FR
Sophie Pinchinat, University Rennes 1, IRISA, France
Vincenzo Piuri, University of Milan, Italy
Marc Pouly, Lucerne University of Applied Sciences and Arts, Switzerland
Nicolas Prigent, Supélec, France
Christian W. Probst, Technical University of Denmark, Denmark
David Pym, UCL, UK
Saša Radomirovic, University of Dundee, UK
Indrajit Ray, Colorado State University, USA
Arend Rensink, University of Twente, The Netherlands
Yves Roudier, Université Côte d'Azur, CNRS, I3S, UNS, France
Guttorm Sindre, NUST, Norway
Mariëlle Stoelinga, University of Twente, The Netherlands
Xiaoyan Sun, California State University, USA
Axel Tanner, IBM Research - Zurich, Switzerland
Alexandre Vernotte, KTH - Royal Institute of Technology, Sweden
Luca Viganò, King's College London, UK
Lingyu Wang, Concordia University, Canada
Jan Willemson, Cybernetica, Estonia

CONTACT
For inquiries please send an e-mail to gramsec17@easychair.org


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

[DMANET] [GECCO 2017] Call for Late-Breaking Abstracts - Less than 2 weeks remaining

Call for Late-Breaking Abstracts - DEADLINE 3rd, April

*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 2017 Genetic and Evolutionary Computation Conference (GECCO 2017), and for inclusion in the proceedings companion to be distributed on USB key to all attendees of the conference and 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 year poster format for Late Breaking Abstracts, authors of the accepted submissions will be asked to prepare a poster summarizing their contributions. The chair will introduce each work at the beginning of the session and 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: Monday, April 3, 2017, 23:59 (Anywhere on Earth)
Page limit: 2 pages using ACM template.

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

For more information, contact the Late-Breaking Abstracts Chair, Hoang Luong, atN.H.Luong@cwi.nl

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

Wednesday, March 22, 2017

[DMANET] Two positions of full-time researchers in Computer Science

CINVESTAV-IPN
Two positions in Computer Science

The Centro de Investigacion y de Estudios Avanzados (Center for Research and
Advanced Studies, Cinvestav after its name in Spanish), which is the top
public research center in Mexico, has two positions for full-time
researchers in Computer
Science to be filled for the Computer Science Department located at Mexico
City.

Candidates are required to have a PhD in Computer Science (or a related
field) and an outstanding research record, or a very good potential to
develop an outstanding
research career. Candidates from all areas of computer science are welcome
to apply.

Both junior and senior researchers are encouraged to apply for a position.
The type of appointment in turn could be as an Assistant or as an Associate
Professor.
The salary is competitive and varies depending on the curriculum of the
candidate (note that research experience is emphasized over teaching
experience).

The candidate is expected to have a light teaching load (one graduate-level
class per term), so that he/she can concentrate mostly on research
activities. Candidates do not need to be fluent in Spanish, as they can
teach in English.

CINVESTAV-IPN is the most important public research center in Mexico, with
645 full-time researchers and the second highest scientific productivity
(per researcher) of the country
(only after UNAM, which is the largest university in Mexico). The Computer
Science
Department offers both a MSc and a PhD program in Computer Science
(CINVESTAV-IPN only offers graduate programs). Both programs are included
in the National Graduate Program certification from CONACyT, which means
that all our Mexican full-time students receive
a stipend scholarship from the Federal Government (no tuition is required
for Mexican students).

The Computer Science Department of CINVESTAV-IPN currently has 17 full-time
researchers
and about 70 graduate students, and has research projects on Computer
architecture, Cooperative work, Cryptography, Databases, Evolutionary
computation, Optimization, Super computing and Visualization.


Interested candidates must send (via email to: jobs2013@cs.cinvestav.mx)
the following
information (as a single PDF file):

1) A detailed curriculum vitae that clearly indicates the publications in
international journals (highlighting the papers in journals included in the
Journal Citations Report), and a list of MSc and PhD graduates (if any).
The candidate should also include a copy of the three papers that he/she
considers as the most representative of his/her research. Note that papers
published in the Lecture Notes series from Springer will not be considered
as JCR papers.

2) A research statement that briefly (no more than 1 page) describes the
sort of research that the candidate has done so far and his/her research
plan in case of being hired.

3) A teaching statement that briefly (no more than 1 page) describes the
sort of graduate-level courses (in computer science) that the candidate can
teach (and has taught in the past, in case of having teaching experience).

4) The names and contact information (postal address, phone and fax number,
and email) of 3 references.

The screening of candidates will start at the end of June and the position
is expected to be filled by the end of 2017.

For further information, please contact:

Dr. Francisco Rodriguez-Henriquez
Chair, Computer Science Department
CINVESTAV-IPN
Av. IPN No. 2508
Col. San Pedro Zacatenco.
07300 Mexico City
MEXICO
Tel: +52 (55) 5747 3800 x 6564
Fax: +52 (55) 5747 3757
URL: http://www.cs.cinvestav.mx
email: francisco@cs.cinvestav.mx


--
Dra. Dolores Lara
Investigadora Cinvestav 2-C
CINVESTAV-IPN
Depto. de Computación
Av. IPN No. 2508
Col. San Pedro Zacatenco
México, D.F. 07300
e-mail: dlara@cs.cinvestav.mx
Tel. +52 55 5747 3800 ext. 6550


**********************************************************
*
* 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 PhD Summer School in Discrete Mathematics

Dear Colleagues,

We are happy to announce the "7th PhD Summer School in Discrete
Mathematics" to be held on Mt. Rogla, Slovenia, July 23 -- July 29, 2017.

Summer School consist of two mini-courses (10 hours each):

1. Theory of pseudo-Boolean functions and binary optimization
Lecturer: Endre Boros, MSIS and RUTCOR, Rutgers University, New Jersey, USA

2. A hundred years of Graph theory
Lecturer: Robin Wilson, Open University, London, UK

Beside the two mini-courses, there will also be several invited speakers.

Confirmed invited speakers:

- Marco Buratti (Universita degli Studi di Perugia, Italy)
- Marston Conder (University of Auckland, New Zealand)
- Vladimir Gurvich (Rutgers, State University of New Jersey, USA)
- Joy Morris (University of Lethbridge, Canada)
- Mikhail Muzychuk (Netanya Academic College, Israel)
- Ilya Ponomarenko (Petersburg Department of V. A. Steklov Institute of
Mathematics, Russia)

Students and other participants will also have the opportunity to give
short 15 minutes presentations.

The number of participants is limited, so please register as
soon as possible. The registration form together with other relevant
information is available at

https://conferences.famnit.upr.si/event/2/


Please feel free to forward this message to your colleagues and students.
For further questions please contact sygn at upr.si.

Best regards,

The Scientific Committee of 7th PhD Summer School in Discrete Mathematics:
Scientific Committee:
Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic,
Tomaz Pisanski, Primoz Sparl, Boris Zgrablic

The Organizing Committee of 7th PhD Summer School in Discrete Mathematics:
Bostjan Frelih, Ademir Hujdurovic, Bostjan Kuzman, Rok Pozar

**********************************************************
*
* 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] Tenure Track Faculty Position in Computer Science

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



Call for Applications for a

Tenure Track Faculty Position in Computer Science



Department of Informatics

University of Mons, Mons (Belgium)



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



The Department of Informatics of the Faculty of Science at the University of Mons (Mons, Belgium) invites applications for a tenure-track faculty position in computer science, with special emphasis on big data analytics. The position is at the level of «chargé de cours» (assistant professor). The expected starting date for the position is October 1, 2018. Qualified candidates must have a doctorate in disciplines related to computer science or computer engineering, and should have a strong commitment to teaching and an outstanding research record in applied aspects of big data analytics. The selected person should collaborate with existing research groups of the department and be active in fundraising for industrial and governmental projects.

Candidates should be able to fulfil teaching duties in the French language after two years. Teaching duties are on both the undergraduate and graduate level, and include novel courses in the candidate's domain of expertise.

The University of Mons is a university located in the French community of Belgium with about 8000 students. Information about the Department of Informatics can be found at http://informatique.umons.ac.be/.

Applications should be sent by email to Prof. Dr. Véronique Bruyère (veronique.bruyere@umons.ac.be<mailto:veronique.bruyere@umons.ac.be>), Department Head. We encourage candidates to apply from now on. Applications must be submitted as PDF files, which include a cover letter, curriculum vitae, a one-page statement of teaching interests, a one-page statement of research interests in big data analytics, and names and contact information of at least three references. Following their application, candidates will be informed in due time about the further application procedure.

The most up to date information about the position and the application procedure will be maintained at http://informatique.umons.ac.be/job_offers/.

--
Prof. Hadrien Mélot
Algorithms Lab - UMONS
http://informatique.umons.ac.be/algo





**********************************************************
*
* 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: CISND'17, November 27-December 1 2017, Hawaii, USA

-----------------------------------------------------------------------------
Call for Papers

IEEE Symposium on CI in Scheduling and Network Design (IEEE CISND'17)
Conference website: http://www.ele.uri.edu/ieee-ssci2017/
CISND Symposium web page: http://www.ele.uri.edu/ieee-ssci2017/CISND.htm

The IEEE Symposium on CI in Scheduling and Network Design (IEEE CISND'17) invites research on all aspects of computational intelligence applied to scheduling and network design problems. The symposium is one of more than 30 symposiums in the 2017 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2017) that brings together at one location thousands of scholars and practitioners from academia and industry. Topics of CISND include, but are not limited to, the following:

- Combinatorial Optimisation
- Machine Learning and Optimisation in Scheduling
- Machine Learning and Optimisation in Network Design
- Production Scheduling
- Personnel Scheduling
- Healthcare Scheduling
- Vehicle Routing
- Sports Scheduling
- Transportation Network Optimisation
- Network Flows

Important Dates
Special Session Proposals: April 2, 2017
Paper Submissions: July 2, 2017
Notification to Authors: August 27, 2017
Final Submission: September 24, 2017
Early Registration: September 24, 2017

Symposium Co-Chairs
Ruibin Bai
The University of Nottingham Ningbo China
Email: ruibin.bai@nottingham.ac.uk<mailto:ruibin.bai@nottingham.ac.uk>

Rong Qu
The University of Nottingham, UK
Email: rong.qu@nottingham.ac.uk<mailto:rong.qu@nottingham.ac.uk>


This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.

Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.

This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.


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

[DMANET] Open permanent position

Dear readers of DMANET,

At the institute of Mathematics and Computer Science at the University
of Greifswald (Germany), we have an open permanent position (50 %,
TVL-13) as a teaching and research assistant with teaching obligations
of 7 hours per week. The application deadline is the 1st of April. The
aspired research area is not restricted, so we are open to interested
applicants of all areas of mathematics as long as he or she fits into
the general research areas of our institute. Note that the main focus of
this position is teaching. For more details on the position, please
visit our website:
https://www.uni-greifswald.de/universitaet/information/stellenausschreibungen/oeffentliche-stellenausschreibungen/wissenschaftliches-personal/institut-fuer-mathematik-und-informatik-17sa05/

Note that the website also contains an English version (you just need to
scroll down).

We accept applications via mail or via email (one single PDF please).

Greifswald is a beautiful town located at the Baltic Sea, a popular
holiday region. Student life here is vibrant, and the university has a
long tradition - in fact, it is one of the oldest universities of
Europe. Our institute is one of only a few places in Germany where
students can study biomathematics already at an undergraduate level,
which is why this study program attracts students from all over Germany.
Therefore, the majority of our institute's students study
biomathematics, but we also have pure mathematics students as well as
students who want to become maths teachers. However, our institute also
does a lot of teaching for students of other subjects that are not
directly linked to our institute, e.g. students of natural sciences.

Kind regards,

Mareike Fischer

--

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

Prof. Dr. Mareike Fischer

Biomathematics and Stochastics

Ernst-Moritz-Arndt-University Greifswald
Institute for Mathematics and Computer Science
Walther-Rathenau-Str. 47
17487 Greifswald
Germany

Tel: +49 (0) 3834 864643

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

**********************************************************
*
* 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] Computability and Complexity in Analysis (CCA 2017): Final Call for Papers

______________________________________________________________

Final Call for Papers
Fourteenth International Conference on

Computability and Complexity in Analysis (CCA 2017)
http://cca-net.de/cca2017/

July 24-27, 2017, Daejeon, Republic of Korea (South Korea)

Submission deadline: April 3, 2017
______________________________________________________________


Topics

* Computable analysis
* Complexity on real numbers
* Constructive analysis
* Domain theory and analysis
* Effective descriptive set theory
* Theory of representations
* Computable numbers, subsets and functions
* Randomness and computable measure theory
* Models of computability on real numbers
* Realizability theory and analysis
* Reverse analysis
* Real number algorithms
* Implementation of exact real number arithmetic


Invited Speakers

* Hee-Kap Ahn (Pohang, Republic of Korea)
* Verónica Becher (Buenos Aires, Argentina)
* Anders Hansen (Cambridge, UK)
* Takayuki Kihara (Berkeley, USA)
* Amaury Pouly (Max Planck Institute, Germany)
* Linda Brown Westrick (Connecticut, USA)


Funding

Funding opportunities for student members of the Association for
Symbolic Logic (ASL) are available. Applications should be directed to
the Association for Symbolic Logic three months prior to the meeting,
following the instructions here:
http://www.aslonline.org/studenttravelawards.html


Scientific Programme Committee

* Johanna Franklin (Hempstead, USA)
* Daniel Graça, chair (Faro, Portugal)
* Vassilios Gregoriades (Turin, Italy)
* Peter Hertling (Munich, Germany)
* Gyesik Lee (Anseong, Republic of Korea)
* Alexander Melnikov (Auckland, New Zealand)
* Takako Nemoto (Ishikawa, Japan)
* Arno Pauly (Brussells, Belgium)
* Cristóbal Rojas (Santiago, Chile)
* Frank Stephan (Singapore)
* Klaus Weihrauch (Hagen, Germany)


Organising Committee

* Sunyoung Kim (Yonsei University, Republic of Korea)
* Sewon Park (KAIST, Republic of Korea)
* Martin Ziegler, chair (KAIST, Republic of Korea)


Submissions

Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:

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

If full versions of papers are already available as technical report
or arXiv version, then corresponding links should be added to the
reference list. Final versions of abstracts might be distributed to
participants in hardcopy and/or in electronic form.


Dates

* Submission deadline: April 3, 2017
* Notification of authors: May 1, 2017
* Final version: May 29, 2017


Conference Web Page

http://cca-net.de/cca2017/

A co-located "Workshop on Real Verification" will take place on
Friday, July 28, jointly organized by:

* Gyesik Lee (Hankyong National University, Republic of Korea)
* Martin Ziegler (KAIST, Republic of Korea)

https://complexity.kaist.edu/CCA2017/workshop.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, March 21, 2017

[DMANET] 2nd CfP, IAM 2017, GECCO Workshop on Industrial Applications of Metaheuristics

IAM 2017

2nd GECCO Workshop on Industrial
Applications of Metaheuristics

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 2017 information for authors for further details, accessible through http://gecco-2017.sigevo.org/index.html/HomePage. Papers do not need to be anonymised. Software demonstrations will also be welcome.

Please submit your paper in pdf format to iam2017@iridia.ulb.ac.be.


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

Submission deadline: March 27, 2017
Authors notification: April 15, 2107
Camera-ready submission: May 1, 2017
Workshop dates July 15 or 16, 2017
GECCO Conference, Berlin, Germany: July 15-19, 2017


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] Special issue of Discrete Applied Mathematics: CTW 2016 (deadline March 31th, 2017)

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

Discrete Applied Mathematics

Special Issue: 14th Cologne-Twente Workshop on
Graphs and Combinatorial Optimization (CTW 2016)

--------------------ic.eatcs@di.unipi.it------------------------------------------------


The 14th edition of the Cologne-Twente Workshop on Graphs and
Combinatorial Optimization (CTW 2016, http://http://ctw16.di.unimi.it/)
was held on June 6-8, 2016 at Palazzo Feltrinelli in Gargnano, Italy,
a historical building belonging to the University of Milan.

Following the tradition of previous CTWs, a special issue of
Discrete Applied Mathematics will be devoted to a selection of papers
on topics related to the themes of the workshop (graph theory,
combinatorial optimization and the design and analysis of algorithms).

All interested researchers are invited to contribute to this special issue.
Submissions of contributions not presented at the workshop are also
welcome.

All articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.

The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify
that the paper is a contribution for the Special Issue of CTW 2016,
so that your paper is assigned to the guest editors. Please see the
Author Instructions on the site if you have not yet submitted a paper
through this web-based system. Be sure to note that your work is intended
for the Special Issue and to select the article type SI: CTW 2016.

The deadline for submission is March 31, 2017.

Accepted papers will be published online individually, before print
publication.
We are looking forward to receiving your contribution.

The Guest Editors,

Alberto Ceselli
Roberto Cordone

**********************************************************
*
* 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] CG: YRF---second call for papers

Computational Geometry: Young Researchers Forum -- Second Call
==============================================================

The 33rd Symposium on Computational Geometry (SoCG) will take place July 4-7,
2017 in Brisbane, Australia. It brings together the global community of
researchers who work on a large variety of aspects that combine geometry,
algorithms and applications. To allow a broad audience to actively participate
in the community's major scientific event, this year SoCG will again be
accompanied by a series of satellite events, which together constitute "CG Week
2017". See http://socg2017.smp.uq.edu.au/ for details.

One of these satellite events will be the "Computational Geometry: Young
Researchers Forum" (CG:YRF), which is aimed at current and recent students. The
active involvement by students and recent graduates in research, discussions,
and social events has been longstanding tradition in the CG community.
Participation in a top-level event such as SoCG can be educating, motivating,
and useful for networking, both with other students and with more senior
scientists.

The YRF presents young researchers (defined as not having received a formal
doctorate before 2015) an opportunity to present their work (in progress as
well as finished results) to the CG community in a friendly, open setting. Just
like in the main event, presentations will be given in the form of talks. A
pre-screening (but no formal review process) will ensure appropriate quality
control.

Submission guidelines:
----------------------
- The idea of the event is for young researchers to present new and ongoing
work. Therefore, the work should not have appeared in print in a formally
reviewed proceedings volume or journal by the time of submission, and at least
one author must be young researcher.
- Topics must fit into the general context of SoCG, as described in the call
for SoCG submissions.
- A submission must be in the form of a 2-page abstract, formatted according to
a style file provided at the SoCG web page and submitted via easychair at
https://easychair.org/conferences/?conf=cgyrf2017
- Accepted abstracts will be compiled in a booklet of abstracts that will be
distributed among the participants; this should not be considered a formal
publication. In particular, participants are encouraged to submit (an extended
version of) their presented work to a conference with formal proceedings and/or
to a journal.
- The work must be presented at CG:YRF by an author who is a young researcher,
else it will be removed from the program.

We will employ a two-phase screening process. After the first review phase,
there will be a notification of either rejection (if the result is clearly out
of context, or technically incorrect), or conditional acceptance, accompanied
with a description of required changes to be made (either with respect to
content or format). In the second phase, we will check whether the changes have
been implemented satisfactorily. The screening process is intended to ensure
the technical quality of the presented work. Submissions that are not well
written risk rejection, irrespective of correctness. Authors are requested to
have their submissions proofread by their advisor or another experienced
scientist.

Important dates (deadlines are 23:59 Honolulu time):
----------------------------------------------------
- April 17, 2017: Deadline for submissions - May 12, 2017: Notification of
conditional acceptance
- May 19, 2017: Deadline for revisions
- May 26, 2017: Notification of acceptance
- July 3-7, 2017: CG-Week 2017

YRF Program Committee
---------------------
Therese Biedl, University of Waterloo, Canada (chair)
Arijit Bishnu, Indian Statistical Institute, India
Stephane Durocher, University of Manitoba, Canada
Seok-hee Hong, University of Sydney, Australia
John Iacono, New York University, USA
Clement Maria, University of Queensland, Australia
David Mount, University of Maryland, USA
Yoshio Okamoto, The University of Electro-Communications, Japan

**********************************************************
*
* 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 Workshop CFP: Ensemble Methods for Optimisation

********************************************************
GECCO 2017 Workshop CFP: Ensemble Methods for Optimisation
********************************************************
Workshop @ GECCO 2017, Berlin

Organisers: Emma Hart and Kevin Sim, Edinburgh Napier University

http://www.rollproject.org/ensembles-methods-for-optimisation-workshop-gecco-2017/

In the field of machine-learning, ensemble-methods that combine decisions from multiple learning algorithms to make accurate predictions have been the focus of intense research for well over a decade, with a broad range of empirical results underpinned by a sound theoretical understanding. Ensemble methods have also found favour within the constraint satisfaction and satisfiability domains where they are commonly referred to as portfolio methods. In the latter case, portfolios tend to be composed from exact solvers, and are evaluated according to run-time metrics.

On the other hand, research in ensemble-methods using meta-heuristic algorithms - in which solution quality rather than run-time is the driving factor - lags behind machine-learning and satisfiability research in both theory and practice. Many fundamental questions remain with respect to how to construct, and design ensembles that will be addressed during the workshop:

* How should we select algorithms to form an ensemble?
* How large should the selection pool be - and where do we find algorithms to form the pool?
* Are automated algorithm generation techniques required to design new algorithms to provide a large enough pool?
* Machine-learning theory suggests that diversity between components is a key factor - what diversity measures can be used to successfully distinguish between meta-heuristic algorithms?
* How should the ensemble operate? Algorithms might collaborate, i.e. the computational budget is divided between algorithms within the ensemble, or cooperate, in that different algorithms solve different instances?
* What domains are ensemble methods best suited to?

************
Submissions
************

We invite paper submissions describing technical work as well as conceptual/visionary short papers. Demos accompanied by short papers are also welcomed. The workshop encourages presentation of work in early stages in order to encourage discussion amongst participants.

Technical papers have a limit of 8 pages.
Conceptual and Demo papers have a limit of 2 pages.

All papers should be in ACM (Association for Computing Machinery) format. Please see GECCO 2017 http://gecco-2017.sigevo.org for details. Papers should not be anonymised. All papers should be submitted in PDF format.

All accepted papers will be presented at GECCO-2017 and will appear in the GECCO workshop volume.

Submissions should be emailed to e DOT hart AT napier.ac.uk with the subject heading: EfO Submission


**********
Key Dates
**********
Paper submission deadline: March 29, 2017 (no extensions permitted)

This message and its attachment(s) are intended for the addressee(s) only and should not be read, copied, disclosed, forwarded or relied upon by any person other than the intended addressee(s) without the permission of the sender. If you are not the intended addressee you must not take any action based on this message and its attachment(s) nor must you copy or show them to anyone. Please respond to the sender and ensure that this message and its attachment(s) are deleted.

It is your responsibility to ensure that this message and its attachment(s) are scanned for viruses or other defects. Edinburgh Napier University does not accept liability for any loss or damage which may result from this message or its attachment(s), or for errors or omissions arising after it was sent. Email is not a secure medium. Emails entering Edinburgh Napier University's system are subject to routine monitoring and filtering by Edinburgh Napier University.

Edinburgh Napier University is a registered Scottish charity. Registration number SC018373


**********************************************************
*
* 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] Lecturer in Theoretical Computer Science at Loughborough University

Loughborough University is seeking to appoint two dedicated and ambitious academics to Lectureship in Computer Science. Appointees will become a member of the Department of Computer Science within the School of Science. The appointed candidates will collaborate effectively in a team atmosphere; will have an intellectually challenging research agenda in one or more of the areas: Networks, Internet/Cloud Computing, Cybersecurity, Formal Aspects of Software Engineering, Theoretical Computer Science and a commitment to research-led teaching at all levels of undergraduate and postgraduate education.

Computer Science is a vibrant community of researchers who are committed to supporting each other deliver outstanding research: http://www.lboro.ac.uk/departments/compsci/ <http://www.lboro.ac.uk/departments/compsci/>
Candidates should possess a degree in Computer Science, have an emerging track record of outstanding research with impact and the potential to attract external funding. They will initiate and participate in collaborative activity with School members and across the University.

For informal discussions about this role please contact Dr Iain Phillips, Acting Head of the Computer Science and Director of Academic Staffing for the School of Science, I.W.Phillips@lboro.ac.uk <mailto:I.W.Phillips@lboro.ac.uk>

Application Closing Date: 19 April 2017

More information and a link to the application: http://www.jobs.ac.uk/job/AYC539/lecturer-in-computer-science/
**********************************************************
*
* 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] CIAC 2017: Call for participation

CALL FOR PARTICIPATION

10th International Conference on Algorithms and Complexity (CIAC 2017)
May 24-26, 2017, Athens, Greece
http://www.corelab.ntua.gr/ciac2017

The 10th International Conference on Algorithms and Complexity (CIAC 2017)
is intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and experimentation
of efficient algorithms and data structures.

Principal topics of interest include (but are not limited to): sequential,
parallel and distributed algorithms and data structures; approximation and
randomized algorithms; graph algorithms and graph drawing; online and
streaming algorithms; analysis of algorithms and computational complexity;
algorithmic engineering; web algorithms; exact and parameterized
computation;
algorithmic game theory; computational biology; foundations of communication
networks; computational geometry; discrete optimization.

The scientific program of CIAC 2017 includes 3 invited lectures and
presentations of 36 contributed papers. A celebration for the 70th birthday
of Stathis Zachos will take place as part of the conference. The conference
will take place at the campus of the National Technical University of
Athens.

INVITED SPEAKERS
Giuseppe Italiano (Universita di Roma "Tor Vergata", Italy)
Klaus Jansen (University of Kiel, Germany)
Christos Papadimitriou (University of California at Berkeley, USA)

ACCEPTED PAPERS: http://www.corelab.ntua.gr/ciac2017/#accepted

REGISTRATION
Registration is now open at https://www.corelab.ntua.gr/ciac2017/register/
Early registration deadline: April 10, 2017
Regular: 380 Euro, Student: 280 Euro

To register for CIAC 2017 or for any further information, please go to
http://www.corelab.ntua.gr/ciac2017 or email us to ciac2017@corelab.ntua.gr

We look forward to seeing you in Athens!

**********************************************************
*
* 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, March 20, 2017

[DMANET] Third CFP: ADT 2017 -- the 5th International Conference on Algorithmic Decision Theory, Luxembourg, 25--27 October 2017

Dear colleagues,

I'm pleased to announce the third and final CFP for ADT 2017 and I apologize for
cross-postings:

======================================================================
Call for Papers: ADT 2017 Third Announcement

The International Research Group on Algorithmic Decision Theory
(CNRS/GDRI ALGODEC) in collaboration with the EURO working group on
preference handling and the Computer Science and Communications
Research Unit (CSC) of the University of Luxembourg is proud to
announce

ADT 2017, the 5th International Conference on
Algorithmic Decision Theory
Luxembourg, 25--27 October 2017
http://sma.uni.lu/adt2017

The ADT 2017 conference seeks to bring together researchers and
practitioners coming from diverse areas such as Artificial
Intelligence, Database Systems, Operations Research, Discrete
Mathematics, Theoretical Computer Science, Decision Theory, Game
Theory, Multiagent Systems, Computational Social Choice, Argumentation
Theory, and Multiple Criteria Decision Aiding in order to improve the
theory and practice of modern decision support. Some of the scientific
challenges facing the Algorithmic Decision Theory (ADT) community
include big preference data, combinatorial structures, partial and/or
uncertain information, distributed decision making, and large user
bases. Such challenges occur in real-world decision making in domains
like electronic commerce, recommender systems, argumentation tools,
network optimization (communication, transport, energy), risk
assessment and management, and e-government.

ADT 2017 provides a multi-disciplinary forum for sharing knowledge in
this area with a special focus on algorithmic issues in Decision
Theory. The first four International Conferences on Algorithmic
Decision Theory (ADT 2009 Venice, ADT 2011 Rutgers (DIMACS), ADT 2013
Brussels, ADT 2015 Lexington (Kentucky US)) brought together
researchers and practitioners from diverse areas of computer science,
economics, and operations research from around the globe.

Important Dates:

Title and abstract submission: April 2, 2017 (23:59 GMT)
Full paper submission: April 9, 2017 (23:59 GMT)
Notification: May 14, 2017
Final version of accepted papers: June 2, 2017
ADT 2017 Tutorial and Doctoral Consortium day: October 24, 2017
ADT 2017 Conference: October 25--27, 2017

Keynote Speakers:

Eleni Pratsini, Lab Director, IBM Research -- Ireland
Tentative title: Algorithmic Decision Theory and IoT

Carmine Ventre, Teesside University, Middlesbrough, UK
Tentative title: Novel Mechanism Design Paradigms

Toby Walsh, Data61 and University of New South Wales, Sydney, Australia
Tentative title: Deceased Organ Matching in Australia

Submission (according to one of the following two types):

1. Submissions for proceedings: Submissions are invited on
significant, original, and previously unpublished research on all
aspects of Algorithmic Decision Theory. Papers must be at most 15
pages long in the LNCS format (including references). The formal
proceedings of ADT 2017 will be published by Springer Verlag in the
Lecture Notes in Artificial Intelligence (LNAI) series:
http://www.springer.com/lncs
Papers of this type will be accepted for either oral or poster
presentation, or both. However, no distinction will be made
between accepted papers in the conference proceedings.

2. Submissions without proceedings: Submissions are invited on
significant recent results on Algorithmic Decision Theory. Papers
must be at most 15 pages long (including references). They will not
appear in the proceedings and can be submitted elsewhere. Selected
papers in this category will be accepted for either oral or poster
presentation, or both. Authors are required to write "submission
without proceedings" into the author field of their paper (instead
of author names) if they choose this category; otherwise, it will
be assumed by default that their paper is submitted in the first
category (submissions for proceedings).

For both types of submission, please use Springer's guidelines and
technical instructions for the preparation of contributions that can
be downloaded from:
http://www.springer.com/de/it-informatik/lncs/conference-proceedings-guidelines
and note that at least one author of each accepted paper is required
to attend the conference to present the work. Authors will be required
to agree to this requirement at the time of submission.

All papers will be peer-reviewed by a double-blind procedure. Therefore,
papers must be submitted *anonymously* as pdf via the EasyChair system:
https://easychair.org/conferences/?conf=adt2017
Note that you will need to give the author names in the EasyChair system,
but reviewers will not be able to get any information about the authors.
Therefore, it is important and required that authors do not reveal their
identities in submitted papers.

Program Committee:

Raymond Bisdorff (University of Luxembourg)
Sylvain Bouveret (Université Grenoble-Alpes, France)
Simina Brânzei (The Hebrew University of Jerusalem, Israel)
Robert Bredereck (TU Berlin, Germany)
Katarína Cechlárová (P.J. Safárik University, Kosice, Slovakia)
Jiehua Chen (TU Berlin, Germany)
Gabrielle Demange (EHESS, Paris School of Economics, France)
Paul Goldberg (University of Oxford, UK)
Judy Goldsmith (University of Kentucky, Lexington, KY, USA)
Edith Hemaspaandra (RIT, Rochester, NY, USA)
Sébastien Konieczny (CRIL -- CNRS, Université d'Artois, France)
Jérôme Lang (LAMSADE, Université Paris-Dauphine, France)
Nicholas Mattei (Data61 and University of New South Wales, Sydney, Australia)
Brice Mayag (LAMSADE, Université Paris-Dauphine, France)
Joana Pais Ribeiro (Lisbon School of Economics & Management, Portugal)
Hans Peters (Maastricht University, The Netherlands)
Gabriella Pigozzi (LAMSADE, Université Paris-Dauphine, France)
Eve Ramaekers (Université catholique de Louvain, Louvain-la-Neuve, Belgium)
Anja Rey (TU Dortmund, Germany)
Federica Ricca (Università di Roma La Sapienza, Italy)
Francesca Rossi (University of Padova, Italy)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany, Chair)
Ildikó Schlotter (Budapest University of Technology and Economics, Hungary)
Claudia Schulz (Imperial College London, UK)
Piotr Skowron (University of Oxford, UK)
Marija Slavkovik (University of Bergen, Norway)
Leon van der Torre (University of Luxembourg)
Alexis Tsoukiàs (LAMSADE, Université Paris-Dauphine, France)
Brent Venable (Tulane University, New Orleans, LA, USA)
Angelina Vidali (Teesside University, Middlesbrough, UK)
Toby Walsh (Data61, University of New South Wales, Sydney, Australia)
Gerhard Woeginger (TU Eindhoven, The Netherlands)
Stefan Woltran (TU Wien, Austria)
Ying Zhu (University of Kentucky, Lexington, KY, USA)

Organizing Committee:

Raymond Bisdorff (University of Luxembourg, Chair)
Brice Mayag (LAMSADE, Université Paris-Dauphine, France)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany)
Alexis Tsoukiàs (LAMSADE, Université Paris-Dauphine, France)

Doctoral Consortium Committee:

Nicholas Mattei (Data61 and University of New South Wales, Sydney, Australia)
Anja Rey (TU Dortmund, Germany, Chair)
Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany)

Conference Venue:

The Conference venue is located at the Conference Centre of the Hotel
Parc-Belle-Vue, 5, Avenue Marie-Thérèse L in 2132 Luxembourg.
Luxembourg can easily be reached by train from all major European
cities. In particular, a TGV connects Paris to Luxembourg in
approximatively 2 hours. Luxembourg also has an international airport
which can be reached from Vienna, Paris, Milan, Copenhagen, London,
Frankfurt, Munich, Amsterdam, Rome, Barcelona, Madrid, Porto, Lisbon,
Nice, Dublin, ...
======================================================================

Best regards,
Jörg Rothe (Program Chair of ADT 2017)

********************************************************************
Prof. Dr. Jörg Rothe
Universität Düsseldorf, Institut für Informatik, Department Chair
rothe@cs.uni-duesseldorf.de http://ccc.cs.uni-duesseldorf.de/~rothe

Check out my new book:
Economics and Computation. An Introduction to Algorithmic
Game Theory, Computational Social Choice, and Fair Division
http://www.springer.com/de/book/9783662479032
********************************************************************

**********************************************************
*
* 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] [CP 2017] Last call for workshops

CP 2017: Call for Workshops
--------------------------

Information also available online at http://cp2017.a4cp.org/call_for_workshops

The CP conference is the premier annual international conference on constraint
programming. It is concerned with all aspects of computing with constraints,
including but not limited to algorithms, environments, languages, models,
systems, theory, and applications such as decision making, resource allocation,
configuration, planning, and scheduling.

We invite proposals for workshops associated to the main conference program of
CP 2017 (http://cp2017.a4cp.org/), which will be held in Melbourne (Australia)
from August 28 to September 1, 2017, colocated with SAT 2017
(http://sat2017.gitlab.io/) and ICLP 2017 (http://iclp17.a4lp.org/), and
following IJCAI 2017 (http://ijcai-17.org).

The purpose of the CP workshops is to provide an informal venue in which
participants can:

- explore specific research areas in depth,
- discuss new research directions,
- study specific application areas of CP, or
- bring together researchers from different fields with shared interests.

In previous years, workshop topics included data analytics, smart cities,
packing & placement, cloud computing, configuration, teaching, testing &
verification, bioinformatics, constraint-based modelling, CP solvers,
cross-fertilisation with other solving technologies, etc. We encourage
proposals for workshops on new topics, especially multi-disciplinary ones.

Based on successful experiments made in the last three years, we particularly
encourage workshops that break away from the tradition of reviewing
("publishing") and presenting submitted papers: instead, the better attended
workshops tended to foster much more interaction by having several invited
talks, if not introductory or specialist tutorials, and/or presentations
selected only on the basis of brief submitted abstracts. We encourage any other
innovations that are likely to increase the audience and interaction.

All workshops will take place at the site of the main conference, and follow
either a half-day format or a full-day format.

Incubator Workshop
------------------

The Association for Constraint Programming (ACP) will provide a sponsorship for
an Incubator Workshop. An Incubator Workshop should address a promising novel
topic, be multi-disciplinary in nature, and have the aim to broaden the
application of CP or deepen its methodologies. The ACP will make 1,500 euros
available for this purpose.

The call for Incubator Workshop will be issued by the ACP. Workshop organizers
who want to apply as an Incubator Workshop should check the ACP specific call
and follow its guidelines, and also submit their Workshop as described below.

Important Dates (for proposers of Workshop)
-------------------------------------------

- March 27, Workshop proposal submission deadline
- April 10, Workshop acceptance notification
- May 13, Workshop webpage available on CP website
- May 13, First call for papers (or abstracts, participation...)
- July 2017, Early registration deadline (accepted speakers must have received
notifications)
- August 28, CP 2017 Workshops

The exact schedule for workshops will be confirmed in due time.

Proposal Format
---------------

Each workshop proposal should include the following information, in a single
PDF file or in plain text

- Title
- Abstract outlining the goals and scope of the workshop
- Description of the target audience
- Motivation for running the workshop at CP 2017
- If the workshop also applies as Incubator workshop, motivation for this
- Estimate of the number/list of (invited) speakers, tutors, and participants
- History of the workshop (if applicable), with the number of applications and
the number of attendees (if available)
- Tentative duration of the workshop: half day or full day
- Relevant chairing experience of the main organizers (if any)
- Organizing committee members (if already known)
- Contact information of the main organizers

The Workshop Chair will acknowledge receipt of the proposal.

Responsibilities of the Workshop Organizers
-------------------------------------------

1. Creating several calls for abstracts (or papers) and calls for
participation, and distributing them on specialist channels not used by the
Publicity Chair of CP 2017.
2. The call for abstracts (or papers), if any, must clearly describe the review
& selection process and indicate that at least one author of every accepted
abstract (or paper) must attend the workshop and pay the workshop fee;
otherwise the presentation (and paper) will be withdrawn from the
proceedings, if any, and program.
3. Creating and publishing, in a timely manner, a webpage at the CP 2017
website, including all the relevant calls and information pertaining to the
workshop.
4. Providing a short description for the conference program.
5. Reviewing and selecting abstract (or paper) submissions.
6. Scheduling the presentations within the workshop.

It should be noted that the conference organization does not budget for free
registration, accommodation, or travel expenses for the workshop organizers or
their invited speakers. The workshop organizers should therefore secure any
source of funding or sponsorship deemed necessary for their invited speakers
(if any).

Responsibilities of the CP 2017 Organizing Committee
----------------------------------------------------

- Provide publicity for the workshop program as a whole.
- Provide logistics at the conference venue (meeting room, catering, etc.).
- Coordinate the allocation of time blocks for each workshop.
- Collect the workshop fees covering the rental and catering costs.
- Publicize the workshop calls with the help of the Publicity Chair.

Submission Process
------------------

Please send your proposal of Workshop by email to the CP 2017 Workshop Chair
(Charlotte Truchet, Charlotte.Truchet@univ-nantes.fr).

Dr Tommaso Urli

Researcher | Optimisation Platforms

DATA61 | CSIRO

E tommaso.urli@data61.csiro.au<mailto:tommaso.urli@data61.csiro.au> T +61 2 6218 3862 M +61 403 464 731

Tower A Level 3, 7 London Circuit, Canberra ACT 2601

www.data61.csiro.au

CSIRO's Digital Productivity business unit and NICTA have joined forces to create digital powerhouse Data61

[Data61 | CSIRO logo]

**********************************************************
*
* 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 Participation] The 5th Gdansk Workshop on Graph Theory (GWGT 2017)

Dear Colleagues,

We cordially invite you to attend the fifth GDAŃSK WORKSHOP ON GRAPH
THEORY that will take place on September 13-15 (2017) in Sopot, one of the
three cities (Gdansk, Sopot, Gdynia) forming a metropolitan area on the
Baltic coast called Tricity (Trojmiasto). The aim of the workshop is to
bring together academic specialists in graph theory and combinatorics to
exchange ideas and identify new directions of research. The workshop
program will consist of a number of contributed talks and three invited
talks during the three days of sessions.

INVITED SPEAKERS

Jaroslaw Grytczuk (Poland)
Andrzej Lingas (Sweden)
Ingo Schiermeyer (Germany)

DEADLINE for early registration: May 15, 2017

Please visit the conference web page http://www.gwgt.mif.pg.gda.pl for
more details and feel free to pass this announcement on to anyone you
think might be interested in.

ACCOMPANYING EVENT

Just before the workshop, from September 5 till 12, 2017, Department of
Algorithms and System Modeling of the ETI Faculty at the Gdansk University
of Technology organizes the Gdańsk Summer School of Advanced Science on
Algorithms for Discrete Optimization, see
http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/summer-school-2017
for more details.


Best regards,
GWGT Team

--------------------------------------------------------------------------
The Fifth Gdansk Workshop on Graph Theory
http://www.gwgt.mif.pg.gda.pl
e-mail: graphs@mif.pg.gda.pl
--------------------------------------------------------------------------

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

[DMANET] ISAAC 2017 - call for papers

---------------------------------------------------------------
Call for Papers

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017)
December 9-12, 2017, Phuket, Thailand
http://aiat.in.th/isaac2017/

Submission Deadline: June 29, 2017 11:59PM (PDT)
---------------------------------------------------------------

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017) will be held in Phuket, Thailand on December 9-12,
2017. The symposium is intended to provide a forum for
researchers working in algorithms and theory of computation.
Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant
applied areas are also welcomed. The topics include, but are
not limited to:
Algorithmic game theory
Algorithms and data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithms
Graph drawing and graph algorithms
Internet algorithms
Online algorithms
Parallel and distributed algorithms
Quantum computing
Randomized algorithms.

---------------------------------------------------------------
Important Dates

June 29, 2017: Submission Deadline
August 31, 2017: Notification
October 3, 2017: Camera-Ready Version Due
December 9-12, 2017: ISAAC

---------------------------------------------------------------
Submission Guidelines

Authors are invited to submit an extended abstract or full
paper of at most 12 pages with an optional appendix. The
submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear
comparison with related work. They must not be submitted
simultaneously to another conference with refereed proceedings
or to a journal. Drafts which contain essentially the same
results as papers under review in other conferences or
journals cannot be submitted to ISAAC 2017. Exempted are
workshops and conferences without formal proceedings, but
possibly with handouts containing short abstracts. At least
one author of an accepted paper is required to present the
paper at the conference as a registered participant.

Papers must be formatted in LaTeX, using the LIPIcs style file,
which is available at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ .
The maximum length of the paper (including title, the list of
authors, abstract, references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the
font, do not make a separate title page, etc.: use the LIPIcs
style file as given.

Proofs omitted due to space constraints must be placed in an
appendix that is to be read by the program committee members
at their discretion and will not be published as part of the
proceedings. Thus the paper without the appendix should be
able to stand on its own.

Submissions are due on June 29, 2017 11:59PM (PDT). Only
electronic submission will be allowed via the easychair
submission server
http://www.easychair.org/conferences/?conf=isaac2017 .

These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LIPIcs format) will
be rejected without consideration of their merits.

---------------------------------------------------------------
Availability of Full Versions

Polished full versions are expected to be published in refereed
journals after the ISAAC conference. Upon acceptance, if there
is an omitted detail in the camera-ready version for ISAAC,
authors are encouraged to upload a full version of the accepted
paper to a preprint server, e.g., arXiv, ECCC, or an
e-repository at universities/institutes, so that interested
readers can access the full proofs that are omitted in ISAAC
proceedings. When authors refer to omitted proofs in ISAAC
proceedings, citation to the accessible full version is
desired. However, uploading a full version is not mandatory
for authors.

---------------------------------------------------------------
Special Issues

Special issues in Algorithmica and International Journal of
Computational Geometry and Applications are planned for
selected papers from ISAAC 2017.

---------------------------------------------------------------
Awards

The Best Paper and the Best Student Paper will be awarded. A
paper is eligible for the Best Student Paper if all authors are
full-time students at the time of submission. To indicate that
a submission is eligible, please mark the checkbox ``Eligible
for best student paper'' in the web form on the submission
server.

---------------------------------------------------------------
Invited Speakers

Satoru Iwata (University of Tokyo, Japan)
Suresh Venkatasubramanian (University of Utah, USA)

---------------------------------------------------------------
Program Committee

Isolde Adler (University of Leeds, UK)
Patrizio Angelini (University of Tübingen, Germany)
Markus Bläser (Saarland University, Germany)
Yixin Cao (Hong Kong Polytechnic University, Hong Kong)
Jean Cardinal (Université Libre de Bruxelles, Belgium)
Parinya Chalermsook (Aalto University, Finland)
Erin Wolf Chambers (Saint Louis University, USA)
Kun-Mao Chao (National Taiwan University, Taiwan)
Sevag Gharibian (Virginia Commonwealth University, USA)
Keiko Imai (Chuo University, Japan)
Taisuke Izumi (Nagoya Institute of Technology, Japan)
Jesper Jansson (Kyoto University, Japan)
Naoyuki Kamiyama (Kyushu University, Japan)
Akinori Kawachi (Tokushima University, Japan)
Chung-Shou Liao (National Tsing Hua University, Taiwan)
Yoshio Okamoto (The University of Electro-Communications, Japan) Co-Chair
Dömötör Pálvölgyi (University of Cambridge, UK)
C. Pandu Rangan (Indian Institute of Technology Madras, India)
Laura Sanità (University of Waterloo, Canada)
Daniel Stefankovic (University of Rochester, USA)
Takeshi Tokuyama (Tohoku University, Japan) Co-Chair
Kei Uchizawa (Yamagata University, Japan)
Marc van Kreveld (Utrecht University, the Netherlands)
Haitao Wang (Utah State University, USA)
Yajun Wang (Microsoft, USA)
Wei Xu (Tsinghua University, P.R. China)
Guochuan Zhang (Zhejiang University, P.R. China)
Martin Ziegler (KAIST, Republic of Korea)

---------------------------------------------------------------
Local Arrangement Committee

Thanaruk Theeramunkung (Sirindhorn International Institute of Technology,
Thammasat University)
Jittat Fakcharoenphol (Kasetsart University)
Natsuda Kaothanthong (Sirindhorn International Institute of Technology,
Thammasat University)
Pokpong Songmuang (Thammasat University)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************