10
0
0
2025-07-02

Special Issue on WEPA 2024 (6th Workshop on Enumeration Problems and Applications) Submission Date: 2026-05-31 WEPA (Workshop on Enumeration Problems and Applications) is an 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 foster collaboration, gathering researchers to present recent results and explore future directions for enumeration algorithms with applications in biology, data mining, logic, databases, and more. This special issue collects papers related to these themes, but not restricted to contributions presented at the workshop.


Guest editors:


Dr. Giulia Punzi

University of Pisa, Pisa, Italy

E-mail: giulia.punzi@unipi.it

Areas of Expertise: Combinatorial algorithms, Enumeration, Graph algorithms


Prof. Nadia Creignou

Aix-Marseille Université, Marseille, France

E-mail: nadia.creignou@lis-lab.fr

Areas of Expertise: Complexity, Enumeration, Logic


Special issue information:


Submissions should relate to the themes of WEPA, including but not restricted to:


Combinatorial Enumeration and Counting

Input-sensitive and Output-sensitive Algorithms

Complexity of Enumeration Problems

Approximate Enumeration and Counting

Applications in Biology, Data Mining, Logic, and Databases


Manuscript submission information:


Guide for authors can be found at:

Guide for authors - Discrete Applied Mathematics - ISSN 0166-218X | ScienceDirect.com by Elsevier


Full papers must be submitted through the Editorial Manager®. Please see the Author Instructions on the site if you have not yet submitted a paper through this web based system. When submitting your paper, be sure to specify that the paper is a contribution for the special issue by selecting the article type WEPA 2024.


The submission deadline is September 26, 2025


The guest editors will make every effort for a timely processing of the submissions. Accepted papers will be published online individually, before print publication.


We appreciate your consideration and look forward to receiving your contribution.


Keywords:


(Enumeration) AND ((algorithms) OR (complexity) OR (combinatorics) OR (approximation) OR (logic) OR (database) OR (data mining) OR (bioinformatics))

登录用户可以查看和发表评论, 请前往  登录 或  注册


SCHOLAT.com 学者网
免责声明 | 关于我们 | 用户反馈
联系我们: