WEPA 2018: Second Workshop on Enumeration Problems and Applications
November 5-8, Department of Computer Science, University of Pisa, Pisa
Submission Deadline: Sep 10, 2018 (AoE)
Notification: Sep 25, 2018
The WEPA 2018 conference is the Second Workshop on Enumeration Problems and
Applications. It will take place at Department of Computer Science of
University of Pisa, in Pisa (Italy). The conference will take place from
Monday November 5 to Tuesday November 8, 2018.
IMPORTANT DATES
Submission of papers: Sep 10, 2018 (AoE)
Acceptance notification: Sep 25, 2018
Registration: Oct 15, 2018
Conference: Nov 5-8, 2018
WEBSITE: wepa2018.di.unipi.it
AIMS AND SCOPE
WEPA is a new international forum for researchers in the area of design,
analysis, experimental evaluation and engineering of algorithms for
enumeration problems. The objective of the workshop is to gather
researchers working in enumeration algorithms, including their applications
in Biology, Data Mining, Logic, and Database. The goal is to present recent
results, identify and explore directions for future research, and foster
collaborations.
For this reason, along with the sessions for the presentation of
established results, this year WEPA will introduce new sessions that are
devoted to ideas, sketches, and open problems: hopefully this will put in
touch senior researchers with junior researchers and graduate students to
investigate problems of theoretical and practical interest. These new
sessions will be informal, with no scheduled presentations, entirely
devoted to the interactions among the participants. The workshop will be
accommodated some rooms to allow space for the parallel working groups.
Submissions to WEPA should describe results in any area of enumeration
problems and including, but not restricted to:
- Applications in Biology, Data Mining, Logic, and Database
- Approximate enumeration and counting
- Combinatorial enumeration and counting (hypergraph dualization, lattices,
functional dependencies,...)
- Input-sensitive algorithms
- Output-sensitive algorithms
There is no registration fee for WEPA this year. However, it is mandatory
to register before 20 October 2018 by sending a message to
wepa2018nov@gmail.com
SUBMISSIONS AND PROCEEDINGS
Contributors are invited to submit an extended abstract of at most 2 pages
(excluding the references) to be submitted electronically using EasyChair
at the link https://easychair.org/conferences/?conf=wepa2018. Invited
papers and accepted contributions will be invited to contribute to a
special issue in a journal.
INVITED SPEAKERS
Endre Boros (Rutgers University)
Fedor Fomin (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Shin-ichi Minato (Kyoto University)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)
PROGRAM COMMITTEE
Hiroki Arimura (Hokkaido University)
Endre Boros (Rutgers University)
Alessio Conte (National Institute of Informatics, Tokyo)
Nadia Creignou (Aix-Marseille Université)
Fedor Fomin (University of Bergen)
Petr Golovach (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Andrea Marino - PC Chair (University of Pisa)
Arnaud Mary (Laboratoire de Biométrie et Biologie Évolutive, Lyon)
Shin-ichi Minato (Kyoto University)
Lhouari Nourine (University Blaise Pascal, Aubiere)
Romeo Rizzi (University of Verona)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)
Takeaki Uno - PC Chair (National Institute of Informatics, Tokyo)
Kunihiro Wasa (National Institute of Informatics, Tokyo)
LOCAL ORGANIZING COMMITTEE
Alessio Conte
Roberto Grossi - Chair
Shima Moghtasedi
Luca Versari
**********************************************************
*
* 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/
*
**********************************************************
Posts
