The International Symposium on Parameterized and Exact Computation (IPEC, formerly IWPEC) is a strongly peer-reviewed annual conference that covers research in all aspects of parameterized and exact algorithms and complexity.
History
The first International Workshop on Exact and Parameterized Computation (IWPEC) took place in Bergen in 2004. Since 2008, IWPEC has been held annually. In 2010, IWPEC changed its name to International Symposium on Parameterized and Exact Computation (IPEC). Since 2011, IPEC has often been co-located with the European Symposium on Algorithms (ESA) and other conference and workshops in the ALGO confederated conference, held in Europe in early September. The research contributions accepted for presentation at the conference appear in printed proceedings; the 2004–2014 conferences were published with Springer in the Lecture Notes in Computer Science series. Since 2015, the IPEC proceedings are published in the Leibniz International Proceedings in Informatics.
Upcoming events
- 14th IPEC (2019)
- Arranged at ALGO 2019, Munich, Germany, September 11–13, 2019.
Previous events
- 13th IPEC (2018)
- Helsinki, Finland, August 20–24, 2018. IPEC 2018 website Business Meeting Report PC Report
- 12th IPEC (2017)
- Vienna, Austria, September 4–8, 2017. IPEC 2017 website Business Meeting Report. PC Report. Publicity Report.
- 11th IPEC (2016)
- Aarhus, Denmark, August 24–26, 2016. IPEC 2016 website
- 10th IPEC (2015)
- Patras, Greece, September 16-18, 2015. proceedings contents IPEC 2015 website
- 9th IPEC (2014)
- Wroclaw, Poland, September 10-12, 2014. proceedings contents IPEC 2014 website
- 8th IPEC (2013)
- Sophia Antipolis, France, September 4-6, 2013. proceedings contents IPEC 2013 website
- 7th IPEC (2012)
- Ljubljana, Slovenia, September 12-14, 2012. proceedings contents IPEC 2012 website
- 6th IPEC (2011)
- Saarbrücken, Germany, September 6-8, 2011. proceedings contents IPEC 2011 website
- 5th IPEC (2010)
- Chennai, India, December 13-15, 2010. proceedings contents IPEC 2010 website
- 4th IWPEC (2009)
- Copenhagen, Denmark, September 10-11, 2009. proceedings contents IWPEC 2009 website
- 3rd IWPEC (2008)
- Victoria, Canada, May 14-16, 2008. proceedings contents IWPEC 2008 website (no longer available)
- 2nd IWPEC (2006)
- Zürich, Switzerland, September 13-15, 2006. proceedings contents IWPEC 2006 website
- 1st IWPEC (2004)
- Bergen, Norway, September 14-17, 2004. proceedings contents IWPEC 2004 website
Awards
- Excellent student paper 2017
- Bart M. P. Jansen, Astrid Pieterse, "Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials."
- Best paper award 2017
- Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas, "A Fixed-Parameter Perspective on #BIS."
- Best paper award 2016
- Michal Wlodarczyk, “Clifford algebras meet tree decompositions,” Kitty Meeks, “Randomised enumeration of small witnesses using a decision oracle,” Archontia Giannopoulou, Michał Pilipczuk Jean-Florent Raymond, Dimitrios Thilikos and Marcin Wrochna, “Cutwidth: obstructions and algorithmic aspects,” and Cornelius Brand, Holger Dell and Marc Roth, “Fine-grained dichotomies for the Tutte plane and Boolean #CSP.”
- Excellent student papers 2016
- Michal Wlodarczyk, “Clifford algebras meet tree decompositions,” R. Krithika, Abhishek Sahu and Prafullkumar Tale, “Dynamic Parameterized Problems.”
- Excellent student papers 2015
- Stefan Kratsch and Manuel Sorge, “On Kernelization and Approximation for the Vector Connectivity Problem.”
- Excellent student papers 2013
- Bart M.P. Jansen “On Sparsification for Treewidth Computations,” Lukas Mach and Tomas Toufar “Amalgam Width of Matroids,” and Mateus de Oliveira Oliveira “Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.”
- Excellent student paper 2012
- Ivan Bliznets and Alexander Golovnev, “A New Algorithm for Parameterized MAX-SAT.”
- Excellent student paper 2011
- Yoichi Iwata, “A Faster Algorithm for Dominating Set Analyzed by the Potential Method.”
- Excellent student papers 2010
- Jesper Nederlof and Johan M. M. van Rooij, “Inclusion/Exclusion Branching for Partial Dominating Set Set Splitting,” and M. Praveen, “Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier."
Steering Committee
Current Members
The IPEC Steering Committee after IPEC 2018 has the following members:
- Henning Fernau (2015–2019)
- Bart M. P. Jansen (2018 - 2021)
- Daniel Lokshtanov (2016–2019)
- Naomi Nishimura (2016–2019)
- Christophe Paul (2017 - 2020)
- Michał Pilipczuk (2017 - 2020)
- Saket Saurabh (2018 - 2021)
- Jan Arne Telle (2018 - 2021)
- Magnus Wahlström (2017 - 2020)
Publicity Chair
- Frances Rosamond
Former Members
- Hans Bodlaender 2012-2015 (chair 2015)
- Jianer Chen 2009-2012
- Marek Cygan 2013–2016
- Frank Dehne
- Rod Downey
- Mike Fellows 2009-2012
- Fedor Fomin, 2009-2012 (chair 2012)
- Martin Grohe
- Jiong Guo (2015–2018)
- Gregory Gutin 2011-2014
- Pinar Heggernes 2013–2016 (chair 2015–2016)
- Danny Hermelin (2015–2018)
- Thore Husfeldt (2012–2017)
- Iyad Kanj (2014–2017)
- Stefan Kratsch (2015–2018, chair 2016-2018).
- Michael Langston
- Daniel Marx 2010-2013
- Rolf Niedermeier 2012–2015
- Venkatesh Raman
- Peter Rossmanith 2010-2013
- Saket Saurabh 2009-2012
- Stefan Szeider 2011–2014
- Dimitrios Thilikos 2011–2014
- Gerhard Woeginger (2011–2017)
Links
IPEC proceedings in the DBLP database
