IPEC 2014: Call for papers
The symposium covers research in all aspects of parameterized and exact exponential-time algorithms and complexity. In particular, studies on parameterized and exact computations for real-world applications and algorithmic engineering are especially encouraged.
Papers presenting original research in the area are sought, including but not limited to:
- New techniques for the design and analysis of parameterized and exact exponential-time algorithms
- Fixed-parameter tractability results
- Parameterized complexity theory
- Relationship between parameterized complexity and traditional complexity classifications
- Applications of parameterized and exact exponential-time computation
- Implementation issues of parameterized and exact exponential-time algorithms
Authors are invited to submit an extended abstract in English not exceeding 12 pages (excluding appendices) in LNCS format, describing original unpublished research. Simultaneous submission to other conferences with published proceedings is not permitted. Additional details as necessary may be included in a clearly marked appendix that will be read at the discretion of the program committee. Authors must submit their papers electronically via EasyChair. Program committee members (except the chairs) are allowed to submit papers.
Accepted papers will be published in the symposium proceedings in the Springer series Lecture Notes in Computer Science. Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee. A special issue of Algorithmica will be dedicated to full versions of selected papers presented at the symposium, subject to the regular reviewing standards of Algorithmica.
The program committee may award an Excellent Student Paper Award to one or more papers accepted to the symposium. A paper is eligible for the award if none of its authors has received a PhD degree before the paper submission deadline.