Tuesday, January 16, 2018

[DMANET] FUN 2018 - 2nd Call for Papers: the deadline is Feb 9, 2018

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

FUN 2018 - 2nd Call for Papers

9th International Conference on Fun with Algorithms
June 13-15, 2018. La Maddalena, Maddalena Islands, Italy
https://sites.google.com/view/fun2018/

=======================================================================
Submission deadline: Feb 9, 2018
https://easychair.org/conferences/?conf=fun2018
=======================================================================

SCOPE

FUN is dedicated to the use, design and analysis of algorithms and
data structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The topics of interest include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with mobile algorithms
FUN with Web algorithms
FUN with machine learning algorithms
FUN with parallel algorithms
FUN with optimization algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms

SUBMISSIONS

Contributors must submit their papers using the Easychair system.
https://easychair.org/conferences/?conf=fun2018
Submissions should not exceed 12 pages including front page and references.
Additionally, if full details of proofs do not fit into the page
limit, a clearly marked appendix containing the remaining details must
be included; this appendix will not be regarded as part of the
submission and will be considered only at the discretion of the
program committee. Submissions deviating substantially from this format
risk rejection without consideration of their merits.

Papers submitted for review should represent original, previously
unpublished work. At the time the paper is submitted to the conference,
and for the entire review period, the paper (or essentially the same
paper) must not be under review by any other conference with published
proceedings or by a scientific journal.
At least one author of every accepted paper is required to register
and present the paper at the symposium.


CAMERA READY VERSION

Authors of accepted papers are expected to submit the final, camera-ready version of their paper in LIPIcs style:
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
(deadline to be announced) on the EasyChair website. The program committee will determine appropriate time allocations for presentations (between 20 and 45 minutes).


IMPORTANT DATES

Submission deadline: Feb 9, 2018
Author notification: April 1, 2018
Symposium: June 13-15, 2018


SPECIAL ISSUE

Authors of selected papers will be invited to submit an extended
versions of their work to a special issue of Theoretical Computer
Science.


PROGRAM COMMITTEE

Anna Bernasconi, U. Pisa, Italy
Allan Borodin, U. Toronto, Canada
Artur Czumaj, U. Warwick, UK
Erik Demaine, MIT, USA
David Eppstein, U. California Irvine, USA
Guy Even, Tel-Aviv University, Israel
Michele Flammini, GSSI & L'Aquila U., Italy
Rudolf Fleischer, GUtech, Oman
Paola Flocchini, Ottawa U., Canada
Fedor Fomin, U. Bergen, Norway
Naveen Garg, IIT Delhi, India
Fabrizio Grandoni, IDSIA Lugano, Switzerland
Takashi Horiyama, Saitama U., Japan
John Iacono, U. Libre Bruxelles, Belgium
Hiro Ito, UEC, Japan (co-chair)
Marc van Kreveld, Utrecht U., Netherlands
Stefan Langerman, U. Libre Bruxelles, Belgium
Stefano Leonardi, Sapienza U. Rome, Italy (co-chair)
Anna Lubiw, U. Waterloo, Canada
Flaminia Luccio, Ca' Foscari U. Venice, Italy
S. Muthu Muthukrishnan, Rutgers U., USA
Yoshio Okamoto, UEC, Japan
Mike Paterson, U. Warwick, UK
David Peleg, Weizmann Inst. Sci., Israel
Nadia Pisanti, ERABLE Team INRIA and U. Pisa, Italy
Geppino Pucci, U. Padova, Italy
Laura Sanita', U. Waterloo, Canada
Aravind Srinivasan, U. Maryland, College Park, USA
Hideki Tsuiki, Kyoto U., Japan
Ryuhei Uehara, JAIST, Japan
Yushi Uno, Osaka Prefecture U., Japan
Aaron Williams, Bard College at Simon's Rock, USA

ORGANIZING COMMITTEE

- Linda Pagli, U. Pisa, Italy
- Giuseppe Prencipe, U. Pisa, Italy
- Atsuki Nagao, Seikei U., Japan (web manager)


STEERING COMMITTEE

- Erik Demaine, MIT, USA
- Fabrizio Grandoni, IDSIA, Switzerland
- Linda Pagli, U. Pisa, Italy
- Giuseppe Prencipe, U. Pisa, Italy
- Nicola Santoro, Carleton U., Canada
- Ugo Vaccaro, U .Salerno, Italy

..A A .. ......ITO Hiro, Professor
. ..... School of Informatics and Engineering,
. @ @ .... The University of Electro-Communications
. = x = . .... 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, JAPAN
. . . . Tel/Fax: +81 42 443 5332
.(( (( ( .. E-mail: itohiro@uec.ac.jp


**********************************************************
*
* 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] Workshop on Random Graphs and Random Processes at King's College London

King's College London will be hosting a one-day workshop on Random Graphs and Random Processes on the 17th April, 2018. The workshop will look at recent work in the area of random structures and algorithms and random processes on networks and will take place at the Harvard lecture theatre in King's new Bush House building. The list of confirmed speakers includes

Pietro Caputo (Università Roma Tre)
Artur Czumaj (Warwick University)
Alan Frieze (Carnegie Mellon University)
Annika Heckel (University of Oxford)
Guillem Perarnau (University of Birmingham)
Tim Rogers (University of Bath)


The workshop is jointly organised by the Department of Informatics and Department of Mathematics at King's. The organisers are Colin Cooper, Martin Dyer, Reimer Kuehn, Andrew McDowell and Tomasz Radzik.


**********************************************************
*
* 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 for SIROCCO 2018, June 18-21, 2018, Ma'ale HaHamisha, Israel

Call for Papers: 25th International Colloquium on Structural
Information and Communication Complexity
(SIROCCO 2018)
www.sirocco-conf.org

June 18-21, 2018, Ma'ale HaHamisha, Israel

OVERVIEW. SIROCCO is devoted to the study of the interplay between
structural knowledge, communication, and computing in decentralized
systems of multiple communicating entities. Special emphasis is given
to innovative approaches leading to better understanding of the
relationship between computing and communication. SIROCCO has a
tradition of interesting and productive scientific meetings in a
relaxed and pleasant atmosphere, attracting leading researchers in a
variety of fields in which communication and knowledge play a
significant role. This year, SIROCCO will be held in Kibbutz Ma'ale
HaHamisha, a picturesque kibbutz near Jerusalem, Israel. The year 2018
marks the 25th year of SIROCCO. SIROCCO's quarter-century of
innovation will be celebrated with six invited speakers who will give
a panoramic view of the research landscape relevant to SIROCCO.

SCOPE. Original papers are solicited from all areas of study of local
structural knowledge, global communication, and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, communication complexity, fault tolerant graphs, and
probability in networks. Keeping up with the tradition of SIROCCO, new
areas are always welcome.

SUBMISSIONS. Papers are to be submitted via EasyChair, according to
the guidelines available on the conference web page. First, abstracts
should be registered and later the full papers are due. See sidebar on
this page and in the conference webpage for deadlines. A submission
for a regular presentation must report on original research. Papers
submitted for regular presentations must contain results that have not
previously appeared, and have not been concurrently submitted to a
journal or a conference with published proceedings, with a special
exception of PODC 2018 (details below). Any partial overlap with any
such published or concurrently submitted paper must be clearly
indicated. Papers for regular presentation must be no longer than 12
single-column pages on letter-size paper using at least 11-point font,
including tables and references. Up to 4 additional pages of figures
may be included with the submission. Additional details may be
included in a clearly marked appendix, which will be read at the
discretion of the program committee. A submission for a brief
announcement must be no longer than 3 single-column pages on
letter-size paper using at least 11-point font. Such submissions may
describe work in progress or work presented elsewhere. A submission
that is not selected for regular presentation may be invited for a
brief announcement.

CONCURRENT SUBMISSION WITH PODC. This year, the program committees of
PODC and SIROCCO have decided to allow for double submission of papers
that are relevant both to PODC and to SIROCCO. As a rule, double
submission of papers is not allowed, except for the following: by
agreement with the PODC PC, papers can be submitted concurrently to
PODC and SIROCCO. The procedure for this double submission is as
follows: papers which are doubly submitted should indicate their
double submission status when submitting to SIROCCO. During the
submission the authors will be asked if they allow for the PC of PODC
to transfer the reviewers' comments from the PODC PC to the SIROCCO
PC. This will be done only for papers rejected from PODC after the
PODC decisions are announced (April 28). Papers accepted to PODC will
be automatically withdrawn from consideration as regular submissions
to SIROCCO.

PUBLICATION. Regular papers and brief announcements will be included
in the conference proceedings that will be published by
Springer. Regular papers receive up to 15 pages, brief announcements
receive up to 2 LNCS-style pages.

BEST STUDENT PAPER AWARD. A prize will be given to the best student
regular paper. A paper is eligible if at least one author is a
full-time student at the time of submission, and the contribution of
the student is significant. This must be noted on the cover page. The
program committee may decline to make the award or may split it.

KEY DATES (all in 2018)
Abstract registration March 23
Full paper submission April 1
PODC notification April 28
SIROCCO notification May 4
Proceedings version May 8
Early registration May 15

PROGRAM COMMITTEE
Ittai Abraham (VMware Research)
Amotz Bar-Noy (CUNY)
Jurek Czyzowicz (UQO)
Taisuke Izumi (Nagoya IT)
Paola Flocchini (U. Ottawa)
Luisa Gargano (U. Salerno)
Leszek Gasieniec (U. Liverpool)
Qiang-Sheng Hua (HUST)
Adrian Kosowski (Inria)
Zvi Lotker (co-chair) (Ben Gurion U.)
Euripides Markou (U. Thessaly)
Gopal Pandurangan (U. Houston)
Merav Parter (Weizmann IS)
Boaz Patt-Shamir (co-chair) (Tel Aviv U.)
Sriram Pemmaraju (U. Iowa)
Harald Raecke (TU Munich)
Sergio Rajsbaum (UNAM)
Ivan Rapaport (U. Chile)
Adi Rosen (CNRS & U. Paris Diderot)
Ladislav Stacho (Simon Fraser U.)
Lewis Tseng (Boston College)

CONFERENCE COMMITTEE
Chen Avin: web (BGU)
M. Borokhovich: proceedings (Amazon)
Hadassa Daltrophe: celebration (SCE)
Pierre Fraigniaud: celebration (CNRS)
Moti Medina: publicity (BGU)
Boaz Patt-Shamir: local (TAU)

STEERING COMMITTEE
Shantanu Das (Aix-Marseille U.)
Andrzej Pelc (chair) (UQO)
Nicola Santoro (Carleton U.)
Christian Scheideler (U. Paderborn)
Sebastien Tixeuil (U. Paris 6)
Jukka Suomela (Aalto U.)

SUPPORT
Research Workshop of the Israel Science Foundation. Supported also by
Israel Ministry of Science, Technology and Space.

**********************************************************
*
* 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] Presburger Award 2018 - Call for Nominations

The Presburger Award for Young Scientists 2018

Call for Nominations Deadline: 31 January 2018 anywhere on earth (extended deadline)

Starting in 2010, the European Association for Theoretical Computer Science (EATCS) established the Presburger Award. The Award is conferred annually at the International Colloquium on Automata, Languages and Programming (ICALP) to a young scientist (in exceptional cases to several young scientists) for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers.

The Award is named after Mojżesz Presburger who accomplished his groundbreaking work on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929.

Nominations for the Presburger Award can be submitted by any member or group of members of the theoretical computer science community except the nominee and his/her advisors for the master thesis and the doctoral dissertation. Nominated scientists have to be at most 35 years at the time of the deadline of nomination (i.e., for the Presburger Award of 2018 the date of birth should be in 1982 or later). The Presburger Award Committee of 2018 consists of Stephan Kreutzer (TU Berlin, chair), Jukka Suomela (Aalto) and Monika Henzinger (University of Vienna). Nominations, consisting of a two page justification and (links to) the respective papers, as well as additional supporting letters, should be sent by e-mail to:

presburger-award@eatcs.org

The subject line of every nomination should start with Presburger Award 2018, and the message must be received before 31 January 2018

The award includes an amount of 1000 Euro and an invitation to ICALP 2018 for a lecture.

Previous Winners:

Mikołaj Bojanczyk, 2010
Patricia Bouyer-Decitre, 2011
Venkatesan Guruswami, 2012
Mihai Pătraşcu, 2012
Erik Demaine, 2013
David Woodruff, 2014
Xi Chen, 2015
Mark Braverman, 2016
Alexandra Silva, 2017

Official website: http://www.eatcs.org/index.php/presburger

**********************************************************
*
* 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] EvoAPPS 2018 - Late-Breaking Abstracts

** Late-Breaking Abstracts **

EvoAPPS 2018 invites submissions of late-breaking abstracts (LBAs) summarising ongoing research and recent studies in all areas of applications of Evolutionary Computation and other Nature-inspired techniques.

LBAs will be presented as posters during the conference and published online (in CEUR or arXiv).

At least one author of each accepted work has to register for the conference, attend the conference and present the work.

Papers will be reviewed by the organising committee to ensure quality and relevance to the conference.

Submit your manuscript in Springer LNCS format. Page limit (LBAs): 4 pages.

Submit your LBA via https://myreview.saclay.inria.fr/evoapps18_lba/

** Important Dates **

- Submission deadline (LBAs): 12 February 2018

- Notification (LBAs): 16 February 2018

- Mandatory registration per LBA: 28 February 2018

- EvoStar: April 4-6, 2018

Regards

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

Monday, January 15, 2018

[DMANET] AAAC 2018 Second Call For Papers

The 11th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC) May 18-20, 2018, Beijing, China http://theory.ict.ac.cn/aaac2018/


The 11th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC) will take place at the Institute of Computing Technology, Chinese Academy of Sciences, Beijing on May 18-20, 2018. AAAC was founded in 2007, aiming at promoting collaborations in theoretical computer science within the region. The website of AAAC is at http://www.aa-ac.org/

Important Dates
=================
Submission due: Feb 10, 2018
Notification: Feb 28, 2018
Conference Dates: May 18-20, 2018


Abstract Submission
===================
Authors are invited to submit one-page abstracts (A4 size in pdf format) that can be based on original results or surveys of existing results in theoretical computer science. An informal collection of the one page abstracts will be distributed at the meeting, which does not prevent any future publication of the results.


Meeting Format
===============
There will be invited talks, tutorials and contributed talks in the meeting. An accepted contributed talk is given about 25 minutes. The first tutorial will be scheduled in the afternoon of May 18 before the welcome reception in the evening of May 18. The main meeting will start on May 19 and end on May 20. There will be a dinner banquet on May 19.


Invited Speakers
================
Keynote Speakers
Uri Zwick, Tel Aviv University

Tutorial Speakers
Shengyu Zhang, The Chinese University of Hong Kong
Wei Chen, Microsoft Research Asia

AAAC Board Members
===================
Hee-Kap Ahn, POSTECH
Sang Won Bae, Kyonggi University
Kun-Mao Chao, National Taiwan University
Siu-Wing Cheng, HKUST
Chung-Shou Liao, National Tsing Hua University
Pinyan Lu, Shanghai University of Finance and Economics
Heejin Park, Hanyang University
Kunihiko Sadakane, The University of Tokyo
Xiaoming Sun, Chinese Academy of Sciences
Takeshi Tokuyama, Tohoku University
Ryuhei Uehara, JAIST
Guochuan Zhang, Zhejiang University
Shengyu Zhang, The Chinese University of Hong Kong

Contact: Jialin Zhang, Institute of Computing Technology, CAS, zhangjialin@ict.ac.cn

**********************************************************
*
* 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] WADT 2018 – 1st Call for Papers

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

WADT 2018
24th International Workshop on Algebraic Development Techniques
http://wadt18.cs.rhul.ac.uk
July 2–5, 2018, Royal Holloway University of London, Egham, UK
======================================================================

AIMS AND SCOPE

The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends.

TOPICS OF INTEREST

Typical, but not exclusive topics of interest are:
– Foundations of algebraic specification
– Other approaches to formal specification, including process calculi and models of concurrent, distributed, and cyber-physical systems
– Specification languages, methods, and environments
– Semantics of conceptual modelling methods and techniques
– Model-driven development
– Graph transformations, term rewriting, and proof systems
– Integration of formal specification techniques
– Formal testing and quality assurance, validation, and verification
– Algebraic approaches to cognitive sciences, including computational creativity

WORKSHOP FORMAT AND LOCATION

The workshop will take place over four days, Monday to Thursday, at Royal Holloway University of London in Egham, UK (https://www.royalholloway.ac.uk).
Presentations will be selected on the basis of submitted abstracts.

INVITED SPEAKERS

Artur d'Avila Garcez (City, University of London, UK)
Rolf Hennicker (LMU Munich, Germany)

IMPORTANT DATES

Submission deadline for abstracts: April 27th, 2018
Notification of acceptance: May 18th, 2018
Early registration: June 1st, 2018
Final abstract due: June 1st, 2018
Workshop: July 2–5, 2018

SUBMISSIONS

The scientific programme of the workshop will include presentations of recent results or ongoing research as well as invited talks. The presentations will be selected by the Steering Committee on the basis of submitted abstracts according to originality, significance and general interest. Abstracts must not exceed two pages including references; if a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract.

Abstracts have to be submitted electronically via the EasyChair system at https://easychair.org/conferences/?conf=wadt18.

PROCEEDINGS

After the workshop, authors will be invited to submit full papers for the refereed proceedings. All submissions will be reviewed by the Programme Committee. Selection will be based on originality, soundness, and significance of the presented ideas and results. The proceedings will be published as a volume of Lecture Notes in Computer Science (Springer).

The deadline for submissions will be September 3, 2018, with notifications by October 29. Camera-ready versions will be required by November 11.

SPONSORSHIP

The workshop takes place under the auspices of IFIP WG 1.3.

WADT STEERING COMMITTEE

Andrea Corradini (Italy)
José Fiadeiro (UK) [co-chair]
Rolf Hennicker (Germany)
Hans-Jörg Kreowski (Germany)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Markus Roggenbach (UK)
Grigore Roșu (United States)

PROGRAMME COMMITEE

Paolo Baldan (Italy)
Andrea Corradini (Italy)
Răzvan Diaconescu (Romania)
José Fiadeiro (UK) [co-chair]
Fabio Gadducci (Italy)
Artur d'Avila Garcez (UK)
Reiko Heckel (UK)
Rolf Hennicker (Germany)
Alexander Knapp (Germany)
Barbara König (Germany)
Antónia Lopes (Portugal)
Narciso Marti-Oliet (Spain)
Till Mossakowski (Germany)
Fernando Orejas (Spain)
Leila Ribeiro (Brazil)
Markus Roggenbach (UK)
Pierre-Yves Schobbens (Belgium)
Lutz Schröder (Germany)
Pawel Sobocinski (UK)
Ionuț Țuțu (UK) [co-chair]
Martin Wirsing (Germany)

ORGANIZING COMMITTEE

Claudia Chiriță (UK)
José Fiadeiro (UK)
Ionuț Țuțu (UK)

CONTACT INFORMATION

Email: wadt18@cs.rhul.ac.uk
Homepage: http://wadt18.cs.rhul.ac.uk

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

[DMANET] Tenure Track vacancy at CWI in Mathematics and Computer Science for Life Sciences and Health

CWI has a tenure track vacancy in mathematics and computer science for life sciences and health:
https://www.cwi.nl/jobs/vacancies/tenure-track-position-in-mathematics-and-computer-science-for-life-sciences-and-health
Deadline for applications is February 20.

If you know persons who might be interested and qualify for the position, please forward the vacancy to them. If you are interested yourself, please feel welcome to apply.

Best regards,
Leen Stougie


**********************************************************
*
* 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] position at the Institute of Mathematics, Prague

A two‐year postdoctoral position is available at the Institute of Mathematics of the Czech Academy of
Sciences. The deadline for applications is March 12, 2018 and the tentative starting date is July 2018.
Application details are available here:

http://www.math.cas.cz/fichier/postes/positions/position_20180103150558_11.pdf
[www.math.cas.cz].

The Institute is based in Prague with a branch also in Brno. Within discrete mathematics, there are groups
in theoretical computer science (in particular computational/communication/proof complexity), control theory,
and extremal graph theory. The webpages of the relevant groups are here

http://www.math.cas.cz/recherche/equipe.php?id_equipe=16 [www.math.cas.cz]

and here

http://www.math.cas.cz/recherche/equipe.php?id_equipe=12
[www.math.cas.cz].

Applicants are encouraged to contact potential host researchers.

Pavel Pudlak

**********************************************************
*
* 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] Machines, Computations and Universality 2018 --- 1st Call for Papers

============================================================
MCU 2018 - CALL FOR PAPERS

8th Conference on Machines, Computations and Universality

MCU 2018, June 28-30, 2018,

Fontainebleau, Paris region, France


Submission deadline        February 4, 2018,
Notification of acceptance    March 20, 2018,
Final version for proceedings    April 9, 2018.

Website: https://mcu2018.lacl.fr/

SUBMISSIONS
https://easychair.org/conferences/?conf=mcu2018
============================================================

The International conference MCU series traces its roots back to the mid
90's, and has always been concerned with gaining a deeper understanding
of computation and universality through the study of models of general
purpose computation. The MCU conference series was initiated in Paris
(1995). Following editions were held in Metz (1998), Chisinau (2001),
St. Petersburg (2004), Orleans (2007), Zurich (2013) and Famagusta
(2015). The 8th edition of MCU will take place at IUT de Fontainebleau,
located in the city of Fontainebleau, former residence of French kings
situated near Paris.

SCOPE

The scope of the conference topics includes, but is not limited to,
computation in the setting of various discrete models (Turing machines,
register machines, cellular automata, tile assembly systems, rewriting
systems, molecular computing models, neural models...) and analog and
hybrid models (BSS machines, infinite time cellular automata, real
machines, quantum computing...) and the meaning and implantation of
universality in these contexts. Particular emphasis is given towards
search for frontiers between decidability and undecidability in the
various models, search for the simplest universal models, computational
complexity of predicting the evolution of computations in the various
models... Parallel computing models  and their connections to
decidability, complexity and universality.

TOPICS ADDRESSED

MCU 2018 conference topics include, but not exclusively:

* Analog computation
* Automata theory
* Cellular automata
* Classical computability and degree structures
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Continuous computing
* Decidability of theories
* DNA computing, self-assembly and tiling
* Dynamical systems and computational models
* Emerging and non-standard models of computation
* Finite model theory
* Generalized recursion theory
* Higher type computability
* Hyper-computational models
* Infinite time Turing machines
* Membrane computing
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural computation and Hybrid systems
* Neural nets and connectionist models
* Physics and computability
* Proof theory and computability
* Randomness and Kolmogorov complexity
* Relativistic computation
* Swarm intelligence and self-organisation
* Theory of Petri nets
* Turing, Counter, Register, Signal machines
* Universality of systems

INVITED SPEAKERS

* Damien Woods (INRIA Paris, France)
* Erzsebet Csuhaj-Varju (Eötvös Loránd University, Hungary)
* Rudolf Freund (Technical University of Vienna, Austria)
* Natasha Jonoska (University of South Florida, USA)
* Michel Raynal (IRISA, University of Rennes, France)

AUTHOR GUIDELINES

Authors of accepted papers are expected to present their results at the
conference. Submitted papers must describe work not previously
published, and they must neither be accepted nor under review at a
journal or at another conference with refereed proceedings. Authors are
required to submit their manuscripts electronically in PDF using the
LNCS style. Authors using LaTeX can download the needed macros at
Springer-Verlag site. Papers should not exceed 15 pages; full proofs may
appear in a clearly marked technical appendix which will be read at the
reviewers' discretion. The submission process is managed by EasyChair.

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

The proceedings will be available at the conference venue. It will be an
LNCS volume by Springer Verlag.

Traditionally, a selection of the papers will be will be invited to
submit extended versions for publication in a special issue of a journal.

There will be a best paper and a best student paper award.


PROGRAM COMMITTEE

* Artiom Alhazov, Academy of Sciences of Moldova, Moldova
* Nathalie Aubrun, ENS Lyon, France
* Pablo Arrighi, University of Marseille, France
* Laurent Bienvenu, CNRS, Université de Montpellier, France
* Olivier Bournez, École polytechnique, France
* Jérôme Durand-Lose, University of Orléans, France (co-chair)
* François Fages, INRIA, Saclay, France
* Henning Fernau, University of Trier, Germany
* Rudolf Freund, Technical University of Vienna, Austria
* Christine Gaßner, University of Greifswald, Germany
* Frédéric Gruau, Université Paris-Sud, France
* Hendrik Jan Hoogeboom, University of Leiden, The Netherlands
* Gabriel Istrate, West University of Timisoara, Romania
* Emmanuel Jeandel, Université de Lorraine, France
* Seth Lloyd, MIT, USA
* Benedek Nagy, Eastern Mediterranean University, North Cyprus
* Turlough Neary, University of Zürich and ETH Zürich, Switzerland
* Matthew Patitz, University of Arkansas, USA
* Simon Perdrix, CNRS, LORIA, France
* Nicolas Schabanel, CNRS, Université Paris Diderot, France
* Klaus Sutner, Carnegie Mellon University, USA
* Sergey Verlan, University of Paris Est, France (co-chair)

ORGANISING COMMITTEE

 * Patrick CEGIELSKI, Université Paris Est Créteil (co-chair)
 * Julien CERVELLE, Université Paris Est Créteil
 * Catalin DIMA, Université Paris Est Créteil
 * Luidnel MAIGNAN, Université Paris Est Créteil
 * Olivier MICHEL, Université Paris Est Créteil
 * Antoine SPICHER, Université Paris Est Créteil
 * Pierre VALARCHER, Université Paris Est Créteil
 * Pascal VANIER, Université Paris Est Créteil
 * Serghei VERLAN, Université Paris Est Créteil (co-chair)

CONTACT
         Jérôme Durand-Lose - jerome.durand-lose (at) univ-orleans.fr
         Sergey Verlan – verlan (at) u-pec.fr
_______________________________________________
MCU2018 mailing list
MCU2018@ns.lacl.fr
https://listes.lacl.fr/listinfo/mcu2018

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

[DMANET] [GECCO CFP] [GECCO 2018] Third Call for Papers - Genetic and Evolutionary Computation Conference 2018

** Third Call for Papers **

---------------------------------------------------------------------------
2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July 15th-19th, 2018, Kyoto, Japan
http://gecco-2018.sigevo.org/

*** NOTE ***
We kindly suggest booking your accommodations as soon as possible. The
Gion festival, which occurs simultaneously with GECCO, may impact the
availability of hotels during the month of July.
---------------------------------------------------------------------------

*NON-EXTENSIBLE* Abstract Deadline: January 30, 2018.

Submission site for abstracts and papers:
https://ssl.linklings.net/conferences/gecco/

The Genetic and Evolutionary Computation Conference (GECCO 2018) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper-heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and
more.

The GECCO 2018 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Full papers of at most 8 pages are aimed to present
original new work that meets the high-quality standards of
GECCO. Accepted full papers appear in the ACM digital library as part
of the MAIN PROCEEDINGS of GECCO. For full papers, a separate
abstract needs to be submitted first by January 30, 2018. Full papers
are due by the non-extensible deadline of February 6, 2018.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. Evaluation is done on a per-track basis,
ensuring high interest and high expertise of the reviewers. Review
criteria include the significance of the work, technical soundness,
novelty, clarity, writing quality, relevance, and sufficiency of
information to permit replication, if applicable.

Besides the traditional GECCO full papers, poster-only papers of at
most 2 pages can be submitted. These are aimed to present original and
new work that has not yet reached the stage of the more mature,
complete research results that are typically published in full papers
at GECCO. The review of poster-only papers follows the same
double-blind process described above. However, accepted poster-only
papers appear in the ACM digital library as part of the COMPANION
PROCEEDINGS of GECCO. Poster-only papers are due by the non-extensible
deadline of February 6, 2018, and no abstract needs to be submitted
first.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:
- Submit a final, revised, camera-ready version to the publisher on
or before the camera-ready deadline
- Register at least one author to attend the conference on or before
the advance registration deadline
- Attend the conference (at least one author)
- Present the accepted paper at the conference

If an author has more than one paper to present at the conference,
there are NO additional registration fees. The author registers one
time (pays for 1 registration) and presents as many papers as have
been accepted. If a paper has more than one author, and more than one
author will attend the conference, then each author in attendance must
pay for a separate registration.


Important Dates:

Full papers (traditional category)
Abstract Deadline: ** January 30, 2018 **
Submission of Full Papers: ** February 6, 2018 **

Poster-only papers
Submission of Poster-only papers: ** February 6, 2018 **

Conference: ** July 15-19, 2018 **


********
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
********

--
Tomohiro Yoshikawa
Associate Professor
Dept. of Information and Communication
Nagoya University

Andrew M. Sutton
Assistant Professor
Department of Computer Science
University of Minnesota Duluth

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

[DMANET] 1st International Workshop on Advances in High-Performance Algorithms Middleware and Applications

1st International Workshop on
Advances in High-Performance Algorithms Middleware and Applications
http://sara.unisalento.it/~cafaro/AHPAMA2018/

Held in conjunction with the the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2018), Washington, DC, USA May 1-4 2018


The Workshop on Advances in High-Performance Algorithms Middleware and Applications is an international forum which brings together researchers and practitioners working on different high-performance aspects of algorithms, middleware and technologies enabling novel applications. Middleware technologies include tools to assemble together different resources such as parallel supercomputers, data archives, high-speed storage systems, advanced visualization devices and scientific instruments using high speed networks connecting geographically distributed devices and organizations. Many recent international efforts are actively fostering the development of such applications and technologies. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of algorithms and applications.

Creating breakthrough parallel algorithms for high-performance applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance algorithms middleware and applications, and related topics. For example, the following topics are relevant to the workshop:

- Scalable message-passing parallel algorithms using MPI
- Scalable shared-memory parallel algorithms using OpenMP
- GPGPU parallel algorithms using OpenCL or CUDA
- Green High-Performance Computing
- Exploiting modern parallel architectures including FPGA, many-cores and multi-cores for parallel applications
- Middleware for high-performance computing
- Benchmarking and performance studies of high-performance applications
- Novel programming paradigms to support high-performance computing
- Performance models for high-performance applications and middleware
- Efficient job scheduling for high-performance applications
- Performance-aware resource reservation
- Security-related performance issues
- Programming models, tools, and environments for high-performance computing
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing
- Peer-to-peer systems for high-performance grid and cloud environments
- Optimization techniques for mobile grids

Submission Guidelines


The results presented in the paper must be unpublished and not submitted for publication elsewhere, including the proceedings of other conferences or workshops. Papers will be peer-reviewed by at least three reviewers. Papers are evaluated with respect to originality, significance, clarity, and technical soundness. One author of each accepted paper will be expected to present the paper at the workshop. Authors are invited to submit papers electronically in PDF format. Submitted manuscripts should be structured as technical papers and may not exceed 10 letter-size (8.5 x 11) pages including all figures, tables and references using the IEEE format for conference proceedings. Papers need to be submitted through Easy Chair following this link: https://easychair.org/conferences/?conf=ahpama1

Important Dates

Paper submission: February 23, 2018
Author notification: March 7, 2018
Camera ready: March 15, 2018
Workshop: May 1-4, 2018

Workshop Organizers

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it

Program Committee

To be defined...


-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

**********************************************************
*
* 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] ECCO 2018: submissions are now open

Submissions for ECCO 2018 are now open: https://ecco2018.euro-online.org/abstract-submission.html

*************************
European Chapter on Combinatorial Optimization (ECCO) 2018

To be held at the University of Fribourg, Switzerland
From June 14th to June 16th, 2018

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

The 31st Conference of the European Chapter on Combinatorial Optimization (ECCO) will be held at the University of fribourg (Switzerland) on June 14th to June 16th 2018.

ECCO is a working group of EURO (Association of European Operation Research Societies) that provides an excellent opportunity to discuss recent and important issues in Combinatorial Optimization and its applications.

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

Topics of interest

- theory and applications of combinatorial optimization
- exact solution algorithms, approximation algorithms, heuristics and meta-heurtistics for combinatorial optimization problems
- integer programming, global optimzation, stochastic integer programming, multi-objective programming, graph theory and network flows
- application areas include logistics and supply chain optimization, manufacturing, energy production and distribution, land consolidation, telecommunications, bioinformatics, finance, dicrete
  tomography, discrete and hybrid dynamical systems and other fields

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

Invited speakers

Yves Crama, HEC Liège
John B. Gauci, University of Malta
Christos H. Papadimitriou, University of California at Berkeley
Daniel Kuhn, Ecole Polytechnique Fédérale de Lausanne

************************
Important dates

Submissions: from January 15th to March 16th 2018
Notification of acceptance: April 9th 2018
Deadline for early registration: April 30th 2018
Deadline for author registration (for inclusion in the program): May 15th 2018
Deadline for late registration: May 31st 2018
Conference: From June 14th to June 16th 2018

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

Website: https://ecco2018.euro-online.org/index.html


----------------------------------------------------------------------------------
Prof. Dr. Bernard Ries

University of Fribourg - Department of Informatics
Decision Support & Operations Research Group
Bd. de Pérolles 90, 1700 Fribourg

Phone : +41 26 300 83 33 - Fax: +41 26 300 97 26
Email: bernard.ries@unifr.ch
Personal homepage
----------------------------------------------------------------------------------

**********************************************************
*
* 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] (no subject)

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier

Submission deadline: February 1st, 2018


The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.

The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud environments

Benchmarking and performance studies of high-performance data mining applications

Novel programming paradigms to support high-performance computing for data mining

Performance models for high-performance data mining applications and middleware

Programming models, tools, and environments for high-performance computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.

A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.

IMPORTANT DATES

Submission deadline: February 1st, 2018
First round notification: May 1st, 2018
Revised version due: July 1st, 2018
Final notification: August 1st, 2018
Camera-ready due: September 15th, 2018
Publication tentative date: December 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy


-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

**********************************************************
*
* 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] Workshop on Computational Optimization

Call for Papers

11th International Workshop on Computational Optimization (WCO18)
Poznan, Poland, September 9-12, 2018

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2018

IEEE CS is a technical co-sponsor of FedCSIS 2018

https://fedcsis.org/2018/wco

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

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.

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

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO18 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 10th, 2018
Position paper submission : May 15th, 2018
Author notification : June 12th, 2018
Final paper submission and registration : July 03, 2018
Conference date : September 9-12, 2018

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2018@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Numerical Search and Optimization

Dear Colleagues,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "Numerical Search and Optimization"
at the
9th Conference on Numerical Methods and Applications NM&A'18,
to be held 20-24 August 2018 in Borovets, Bulgaria.
The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies,
Bulgarian Academy of Sciences
Prof. Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain, and
Prof. Kalin Penev, (kalin.penev@solent.ac.uk) School Media Arts and
Technology, Southampton Solent University, UK.

Topics

The list of topics includes, but is not limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multi-objective optimization
- optimization in dynamic and/or noisy environments
- large scale optimization
- Scalable search and optimization methods
- Scalable numerical tests
- parallel and distributed approaches in optimization
- random search algorithms
- adaptive search algorithms
- nature inspired optimization methods
- hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
- optimization methods for learning processes and data mining
-classical operational research problems (knapsack, traveling salesman, etc)
-computational biology and distance geometry
-data mining and knowledge discovery
-human motion simulations; crowd simulations
-industrial applications
- computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc


Proceedings
The refereed and presented papers will be published as a special
volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
April 15, 2018
Notification of acceptance of the talks on the basis of the
submitted abstract
April 30, 2018
Deadline for submission of full papers
June 10, 2018
Notification of acceptance of full papers
July 10, 2018
Submission of accommodation forms
July 15, 2018
Final version of paper submission
September 30, 2018

Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts to special session organizers and conference
organizers, indicating the name of the special session. After sending
the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Paper submission, notification, and reviews will be realized through
the Springer OCS (Online Conference Service).
OCS for NM&A'18 is already set up on:

https://ocs.springer.com/ocs/home/NMA2018

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http:http://nma18.fmi.uni-sofia.bg/

Special session organizers
Prof. S. Fidanova (stefka@parallel.bas.bg) , Institute of Information
and Communication Technologies, Bulgarian Academy of Science.
Prof. Gabriel Luque (gabriel@lcc.uma.es), University of Malaga, Spain.
Prof. Kalin Penev (penev@solent.ac.uk), School Media Arts and
Technology, Southampton Solent University, UK.

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)

The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)
http://sara.unisalento.it/~cafaro/WPDM2018/

CALL FOR PAPERS

As part of The 18th International Conference on Computational Science and Its Applications (ICCSA 2018), http://www.iccsa.org

July 2 - 5 2018, Melbourne, Australia


Submission Deadline: January 28, 2018


SPECIAL ISSUE

Selected extended versions of workshop papers will be invited to a Special Issue to appear in the Algorithms journal (see http://www.mdpi.com/journal/algorithms/special_issues/Parallel_Distributed_Data_Mining)

SCOPE AND OBJECTIVES

The Workshop on Parallel and Distributed Data Mining is an international forum which brings together researchers and practitioners working on different high-performance aspects of data mining algorithms, enabling novel applications. Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications. Therefore, there is an increasing interest in the design and implementation of parallel data mining algorithms. On parallel computers, by exploiting the vast aggregate main memory and processing power of processors and accelerators, parallel algorithms can easily address both the running time and memory requirement issues. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of data mining algorithms and applications. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance data mining algorithms and applications, and related topics.

The WPDM Workshop topics include (but are not limited to) the following:

- Parallel data mining algorithms using MPI and/or OpenMP
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Parallel data mining applications exploiting FPGA
- Distributed data mining algorithms
- Benchmarking and performance studies of high-performance data mining applications
- Novel programming paradigms to support high-performance computing for data mining
- Performance models for high-performance data mining applications and middleware
- Programming models, tools, and environments for high-performance computing in data mining
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

INSTRUCTIONS FOR PAPER SUBMISSIONS

You are invited to submit original and unpublished research works on above topics. Submitted papers must not have been published or simultaneously submitted elsewhere. The submitted paper must be between 10 to 16 pages long and formatted according to the Springer LNCS (Lecture Notes in Computer Science) rules, Guidelines and templates can be found at the url http://www.springer.com/it/computer-science/lncs/conference-proceedings-guidelines

To submit a paper, please connect to the Submission site from the link available at the ICCSA 2018 web site: http://ess.iccsa.org.
Only papers submitted through the electronic system and strictly adhering to the relevant format will be considered for reviewing and publication. Please pay attention, when submitting your contribution to the workshop, to select the right entry in the listbox shown in the submission form.

CONFERENCE POLICY

By submitting the paper to ICCSA conference, all authors agree to abide by all ICCSA conference paper submission, publication and presentation policies. Namely, authors confirm that the work is original, has not appeared in literature in any form in the past and will not be submitted to any other venue concurrently with ICCSA submission or until it appears in ICCSA proceedings (in the case of acceptance). Furthermore, upon paper acceptance, authors agree to transfer copyright on the accepted paper to ICCSA, and one of the authors will register the paper and present the paper at the event. No paper withdrawals can be accepted after Conference pre-registration date or within three months of the actual event, whichever date comes first. Paper withdrawal request can be only accepted in writing through email, letter or fax to conference organizers. The conference has no responsibility for any intentional or accidental misuse, misinterpretation, or failure to follow above rules and conditions and holds no legal, civil or other responsibility for opinions, content or utilization of any methods/algorithms expressed in the Conference Proceedings.

If you have any questions about paper submission or the workshop, please contact the workshop organisers.

IMPORTANT DATES

January 28, 2018: Deadline for paper submission
April 8, 2018: Notification of Acceptance.
May 6, 2018: Early-bird Registration ends.
May 6, 2018: Submission deadline for the final version of the Papers
July 2-5, 2018: ICCSA 2018 Conference


WORKSHOP ORGANIZERS

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it


International Program Committee:

All submitted papers will be reviewed by the workshop technical program committee members.
Program Committee formation is pending and will be finalised shortly. Current TPC members:

Gianfranco Bilardi, University of Padova, Italy
Matteo Ceccarello, University of Padova, Italy
Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Giuseppe Di Fatta, University of Reading, UK
Ann Gordon-Ross, University of Florida, USA
Giuliano Laccetti, University of Naples, Italy
Pablo Moscato, University of Newcastle, Australia
Mitsunori Ogihara, University of Miami, USA
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA


-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

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

Sunday, January 14, 2018

[DMANET] School on Optimal Transport: Numerical Methods and Applications -- Como, May 2018

The school

OTNM 2018 - OPTIMAL TRANSPORT: NUMERICAL METHODS AND APPLICATIONS
http://otnm.lakecomoschool.org/

will be held at

Villa del Grumello, Como, May 07 - 11, 2018,

as part of the

Lake Como School of Advanced Studies program.

OTNM 2018 school aims to give a broad and up-to-date overview on various challenging models and problems arising from applications of Optimal Transport, as control of crowd and congested motions, image processing, big data and machine learning, and economics.
A particular emphasis will be devoted to the analysis of new algorithms and powerful computational strategies, allowing for new and quite efficient numerical methods.

Lectures will be held by

Gabriel Peyré, CNRS and Ecole Normale Supérieure
Computational Optimal Transport and its Applications

Alfred Galichon, New York University, FAS and Courant Institute
Economic applications of optimal transport

Andrea Tosin, Politecnico di Torino
Conservation laws with nonlocal flux

Applications of interested people are strongly encouraged; partial financial support for Ph.D. students, advanced master students and postdocs is available.

For further information please visit the school website

http://otnm.lakecomoschool.org/

The registration deadline is March 10, 2018.


The organizers

Filippo Santambrogio
Giuseppe Savaré

**********************************************************
*
* 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] CfA: Rail Transport Demand Management (Oct 24-25, 2018, in Darmstadt, Germany)

CALL FOR ABSTRACTS

Symposium on
Rail Transport Demand Management – RTDM 2018

Strategies, Methods and Digitalization across all Disciplines

Darmstadt, Germany (30 minutes from Frankfurt Airport) on Oct 24-25, 2018

Submission of abstracts due: May 31, 2018

Details: www.rtdm2018.de

--

Appetizer:

Efficient rail traffic management and high customer satisfaction do
not only need optimization of train operations but also control of
transport demand. Besides long-term and mid-term strategies to
influence the demand, e.g. by ticketing and pricing strategies, also
short-term measures are needed in cases of incidents to avoid
overcrowded trains and to guide passengers towards the most suitable
connection. The symposium addresses both, passenger and freight
transport.

--

Prof. Karsten Weihe
Hochschulstr. 10, 64289 Darmstadt, Germany
Phone: +49-6151-16-20870
Fax: +49-6151-16-20873
www.algo.informatik.tu-darmstadt.de

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

Saturday, January 13, 2018

[DMANET] PhD or postdoc position in integer optimization

PhD or postdoc position in integer optimization (up to six years)

mathematics, computer science, operations research

Chair of Operations Research
RWTH Aachen University


The chair of operations research at RWTH Aachen University, Germany (
www.or.rwth-aachen.de) opens a full-time PhD or postdoc position at the
earliest possible starting date. The salary is according to the German TV-L
E13 tarif. The position is limited to three years, with a possible
extension to a total of six years. Discrete mathematics, theoretical
computer science and operations research form the interdisciplinary
background of the team of 40+ student assistents and scientific staff. Our
current research focus is on integer and combinatorial optimization, in
particular decomposition algorithms and the connection between optimization
and machine learning. Fundamental research is as important as practical
applications.

You have sucessfully completed a master's degree (or comparable) in
mathematics or computer science with distinction. You have a profound
knowledge of mathematical (in particular integer/discrete) optimization.
Ideally, you are mathematically talented and curious and interested in
real-world applications. Generally good computer and implementation skills
are indispensable. It is a benefit to know the SCIP framework (scip.zib.de)
well. Resposibility and perseverance, creativity and team spirit are
extremely welcome. Fluent command of the German language is a must.

Please add to the usual documents a brief motivation statement and a PDF of
your thesis, if already available.


Your tasks: You will become part of the GCG team (www.or.rwth-aachen.de/gcg),
give your scientific input there as part of your PhD project and further
develop the GCG software. You will take responsibility for some of our
courses which comes with giving exercises to students and leading a team of
student tutors.

We expect you to pursue a PhD and we will support you in all aspects of
this endeavor.

RWTH Aachen University is an equal oppotunity employer and certified to be
a family friendly university. We particularly encourage applications of
women and will give preference to these applications.


Please send your applications to

Prof. Dr. Marco Luebbecke
marco.luebbecke@rwth-aachen.de

no later than January 28, 2018.

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

Friday, January 12, 2018

[DMANET] Introduction to graph limits - Budapest, June 25-29

The Institute of Mathematics of the Eötvös Loránd University, Budapest is
organizing a one week long summer school in mathematics entitled
"Introduction to graph limits".

The aim of the summer school is to give an introduction into the theory of
large graphs through the following four mini-courses:

- Ágnes Backhausz: Limits of random graphs
- Péter Csikvári: Statistical physics and graph limits
- Péter Frenkel: Homomorphism numbers and graph convergence
- Dávid Kunszenti-Kovács: From combinatorics to analysis

The school is followed by the conference "Building Bridges II" celebrating
the 70th birthday of László Lovász
(https://www.renyi.hu//conferences/ll70/).

The registration closes on June 15 (early bird registration until April
30). For more details, please check the homepage of the summer school:

http://bolyai.cs.elte.hu/summerschool/

Kristof Berczi
Egervary Research Group
Eotvos University, Budapest
berkri@cs.elte.hu

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

Thursday, January 11, 2018

[DMANET] SIAM-DM18 Conference: Minisymposium deadline extended

This is a call for proposals for Minisymposia at the upcoming SIAM Conference on Discrete Mathematics. The deadline for proposals has been extended to January 17. We already have a strong set of proposals, but would welcome a few more, particularly in areas of applications.

The SIAM-DM conferences are bi-annual internationally prominent gatherings of the broad Discrete Math community. The conferences are known for the high quality of the talks and for strong attendance. (DM16 in Atlanta attracted roughly 350 registrants.) SIAM-DM18 will be held June 4-8, 2018, in Denver, USA, with sessions taking place at the University of Colorado Denver. See http://www.siam.org/meetings/dm18/

There will be a slate of nine invited talks by internationally prominent researchers. Minisymposia (MS) form the heart of the DM conference, where experts on many topics attend and speak, attracting even more people to come hear them (and perhaps contribute their own talks).

For proposal submissions please see http://www.siam.org/meetings/dm18/submissions.php for instructions. To make it simple for proposers (and what is not clear from the website) is that we only ask for proposed speakers (they don't have to be invited yet). For titles, proposers can enter TBD. The actual speakers and talk titles can be worked out later after the proposal is accepted. A typical MS at DM-18 will consist of from one to three sessions of five talks each. Each talk is 25 minutes, with 5 additional minutes for questions.

If you have any questions or concerns, please contact us. Thank you for your consideration!

Jerry Griggs and Ravi Kumar

j@sc.edu<mailto:j@sc.edu> ravi.k53@gmail.com<mailto:ravi.k53@gmail.com>

SIAM-DM18 OC co-chairs

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

[DMANET] Call for Papers for AofA 2018

Call for Papers

29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms (AofA 2018)

Uppsala, Sweden,  June 25-29, 2018

The 29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms will be held in Uppsala, Sweden, June
25-29, 2018. The website of the event is

http://www.math.uu.se/math.uu.se/department-of-mathematics/AofA2018 .

Program Committee:

    Olivier Bodini, Paris 13, France
    Michael Drmota, TU Vienna, Austria
    James Allen Fill (chair), Johns Hopkins Univ., USA
    Antoine Genitrini, Paris 6, France
    Zbigniew Golebiewski, Wroclaw U. Sci. Tech., Poland
    Cecilia Holmgren, Uppsala U., Sweden
    Hsien-Kuei Hwang, Academic Sinica, Taiwan
    Svante Linusson, KTH, Sweden
    Manuel Lladser, U. Colorado, USA
    Cécille Mailler, Univ. Bath, UK
    Markus Nebel, TU Kaiserslautern, Germany
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Daniel Panario, Carleton Univ., Canada
    Bruno Salvy, INRIA Lyon, France
    Robert Sedgewick, Princeton Univ., USA
    Wojciech Szpankowski, Purdue Univ., USA
    Stephan Wagner, Stellenbosch Univ., South Africa
    Mark Daniel Ward, Purdue Univ., USA

Steering Committee:

    Nicolas Broutin, INRIA Rocquencourt, France
    Hsien-Kuei Hwang, Academia Sinica, Taiwan
    Conrado Martinez, UPC Barcelona, Spain
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Robert Sedgewick (chair), Princeton Univ., USA
    Michèle Soria, Paris 6, France

Organization/Contact:

    Cecilia Holmgren, Uppsala University, Sweden
(cecilia.holmgren@math.uu.se)
    James Allen Fill, Johns Hopkins University, USA (jimfill@jhu.edu)

Scope:

Analysis of algorithms is a scientific basis for computation, providing
a link between abstract algorithms and the performance characteristics
of their implementations in the real world. The general effort to
predict precisely the performance of algorithms has come to involve
research in analytic combinatorics, the analysis of random discrete
structures, asymptotic analysis, exact and limiting distributions, and
other fields of inquiry in computer science, probability theory, and
enumerative combinatorics.  See http://aofa.cs.purdue.edu/ .

We invite papers in

    * analytic algorithmics and combinatorics
    * probabilistic analysis of algorithms
    * randomized algorithms

We also welcome papers addressing problems such as: combinatorial
algorithms, string searching and pattern matching, sublinear algorithms
on massive data sets, network algorithms, graph algorithms, caching and
memory hierarchies, indexing, data mining, data compression, coding and
information theory, and computational finance. Papers are also welcome
that address bridges to research in related fields such as statistical
physics, computational biology, computational geometry, and simulation.

Keynote speakers (confirmed):

    Louigi Addario-Berry, McGill University, Canada
    Béla Bollobás, Univ. of Cambridge, UK and Univ. of Memphis, USA
    Karen Gunderson, University of Manitoba, Canada
    Olle Häggström, Chalmers University of Technology, Sweden
    Svante Janson, Uppsala University, Sweden
    Mihyun Kang, Graz University of Technology, Austria
    Mark Daniel Ward, Purdue University, USA

Flajolet Award Lecture:

    Luc Devroye, McGill University, Canada

Submissions:

We invite you to submit an extended abstract (12 pages) or a short
abstract for a poster (2 pages) via the EasyChair system:

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

The proceedings will be published electronically.  Authors of selected
accepted papers will be invited to submit their contributions to a
special issue in a leading journal (to be determined).

Important dates:

    Submission deadline: February 8, 2018
    Notification: April 8, 2018
    Final version: May 8, 2018

If you intend to submit a paper, please consider submitting a title and
a short abstract early.
**********************************************************
*
* 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/
*
**********************************************************