8th International Symposium on Parameterized and Exact Computation
The International Symposium on Parameterized and Exact Computation (IPEC) covers research in all aspects of parameterized and exact algorithms and complexity. 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 algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms. In particular, studies on parameterized and exact computations for real-world applications and algorithmic engineering are especially encouraged.
For travel information, as well as details on registration and accommodation, please refer to the
ALGO 2013 website.
Ramamohan Paturi: "Exact Complexity and Satisfiability"
Marek Cygan: "Graph Problems Parameterized by Treewidth"
Daniel Lokshtanov: "Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms"
- Abstract Submission: June 12, 2013
- Paper Submission: June 15, 2013
- Notification of Acceptance: July 13, 2013
- Final Version: August 19, 2013
- Symposium: September 4-6, 2013