The 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) covers research in all aspects of parameterized and exact algorithms and complexity.
--- Topics ---
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 and kernelization results;
- parameterized complexity theory;
- parameterized (in)approximability results;
- relationships between parameterized complexity and traditional complexity classifications;
- applications of parameterized and exact computation; and
- implementation issues of exact, parameterized, and kernelization algorithms.
Theoretically grounded studies on parameterized and exact computations and kernelization for real-world applications and algorithmic engineering are especially encouraged.
--- Conference ---
IPEC 2019 will be part of ALGO 2019, which also hosts ESA 2019 and a number of more specialized conferences and workshops. IPEC 2019 will take place September 11-13, 2019, in Munich, Germany.
Accepted papers will be published in the symposium proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. 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 is planned for selected papers presented at IPEC 2019.
--- Important dates ---
Title and short abstract registration deadline: May 29, 2019, 23:59 AoE
Full paper submission deadline: June 1, 2019, 23:59 AoE
Notification: July 15, 2019
Conference: September 11-13, 2019
--- Awards ---
The program committee may award a Best Paper Award and a Best Student Paper Award, both of which may be exceptionally split between two or more papers. A student is someone who has not received a PhD degree before the full paper submission deadline. A paper accepted to the conference is eligible for the Best Student Paper Award if either all its authors are students, or besides student co-author(s) there is one non-student co-author that confirms, at the moment of submission, that a clear majority of conceptual work on the paper was done by the student co-author(s). In the latter case, it is moreover expected that a student gives a presentation at the conference. Papers co-authored by members of the program committee are not eligible for the Best Paper Award or the Best Student Paper Award.
--- Special Events ---
There will be an invited tutorial on parameterized inapproximability by Pasin Manurangsi. An invited talk is planned by one of the authors of the paper that was awarded the 2019 EATCS-IPEC Nerode Prize: 'Color-Coding', by Noga Alon, Raphael Yuster, and Uri Zwick. In addition, there will be a session presenting the results of the 4th Parameterized Algorithms and Computational Experiments Challenge (PACE 2019).
--- Submission guidelines ---
Authors are invited to submit an extended abstract of up to 12 pages (excluding the title page and references section) in LIPIcs style, in English, describing original unpublished research. The title page consists exclusively of the title of the paper, author information, and abstract. Results previously published in another conference proceedings or journal (or scheduled for publication prior to IPEC) will not be considered. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. However, the authors are encouraged to make full versions of their submissions freely accessible in an on-line repository such as ArXiv or ECCC.
The extended abstract should contain a summary of the main results, their motivation and importance, and evidence of their correctness. All claims made in the extended abstract must be fully justified in a clearly marked appendix that will be read at the discretion of the program committee. The authors may choose to either present in the appendix only the material excluded from the extended abstract or to attach a full version of the paper as the appendix. In either case, the authors should take a particular notice that the extended abstract should present their work in a comprehensible and self-contained way and the quality of the presentation in the extended abstract will be taken into account by the program committee.
We encourage authors of papers describing implementations, for example following the PACE competition, to read and follow the advice in David Johnson's article 'A Theoretician's Guide to the Experimental Analysis of Algorithms'.
Authors must submit their papers electronically via EasyChair: https://easychair.org/conferences/?conf=ipec2019 . The use of the LIPIcs style file (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors) is mandatory; no changes to font size, page margins, etc., are permitted. Program committee members (except the co-chairs) are allowed to submit papers.
--- Program Committee ---
Amir Abboud (IBM Almaden Research Center)
Édouard Bonnet (ENS Lyon)
Jianer Chen (Texas A&M University)
Petr Golovach (University of Bergen)
Bart M. P. Jansen (Eindhoven University of Technology, co-chair)
Sudeshna Kolay (Ben-Gurion University)
Lukasz Kowalik (University of Warsaw)
O-joung Kwon (Incheon National University)
Daniel Marx (MTA SZTAKI)
Kitty Meeks (University of Glasgow)
Yota Otachi (Kumamoto University)
Felix Reidl (Birkbeck University of London)
Christian Schulz (University of Vienna)
Manuel Sorge (University of Warsaw)
Jan Arne Telle (University of Bergen, co-chair)
* Contributions to be spread via DMANET are submitted to
* 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)