October 28-31, Yumekaiyu Awajishima, in Hyogo (Japan)
================================================================================
The WEPA 2019 conference is the Third Workshop on Enumeration Problems and
Applications. It will take place at Yumekaiyu Awajishima, in Hyogo (Japan). The
conference will take place from Monday October 28 to Thursday October 31, 2019.
Website: http://research.nii.ac.jp/~uno/WEPA2019/
================================================================================
Important Dates
- Submission of papers: September 13, 2019
- Acceptance notification: September 27, 2019
- Conference: October 28 - 31, 2019
================================================================================
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, etc)
- Enumeration algorithms for graphs/sequences/strings
- Input-sensitive algorithms
- Output-sensitive algorithms
================================================================================
Invited speakers
- David Avis (McGill University and Kyoto University)
- Serge Gaspers (The University of New South Wales, Australia)
- Takashi Horiyama (Saitama University, Japan)
- Koji Tsuda (Tokyo University, Japan)
================================================================================
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=wepa2019. Invited papers and
accepted contributions will be invited to contribute to a special issue in a
journal.
================================================================================
Program committee
- Takeaki Uno - PC Chair (National Institute of Informatics, Japan)
- Endre Boros (Rutgers University, USA)
- Mamadou Moustapha Kanté (Université Clermont Auvergne, France)
- Benny Kimelfeld (Technion - Israel Institute of Technology, Israel)
- Masashi Kiyomi (Yokohama City University, Japan)
- Andrea Marino (Università degli Studi di Firenze, Italy)
- Arnaud Mary (University Claude Bernard Lyon 1, France)
- Lhouari Nourine (Université Clermont Auvergne, France)
- Yann Strozecki (The University of Versailles Saint-Quentin)
- Katsuhisa Yamanaka (Iwate University, Japan)
- Kunihiro Wasa (National Institute of Informatics, Tokyo)
Organizing committee
- Kaori Deguchi - Local organizer
- Arnaud Mary
- Takeaki Uno - Chair
- Kunihiro Wasa
================================================================================
Other information
- Additional information (registration, travel support, etc.) can be found on
the conference web page (http://research.nii.ac.jp/~uno/WEPA2019/).
**********************************************************
*
* 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
