- Parameterized Algorithmics and Counting: Treewidth in Practice (Johannes K. Fichte)
- Decompositions and algorithms for interpretations of sparse graphs (Jakup Gajarsky)
- Parameterized Approximations and CSPs (Hadas Shachnai)
- Parameterized algorithmics in Access Control: linking theory and practice (Gregory Gutin)
- Towards Tractable QSAT for structural parameters below treewidth (Friedrich Slivovsky)
- Kemeny Rank Aggregation: Width Measure and Diversity Notion (Emmanuel Arrighi)
- Resolving Inconsistency of Linear Equations (Gerge Osipov)
- Learning Small Decision Trees (Giacomo Paesani)
- MaxSAT: Parameterized, Parallel, Absolute (Max Bannach)
- The Tournament Fixing Problem (Meirav Zehavi)
- Tractable Abstract Argumentation via Backdoor-Treewidth (Matthias Koenig)
- The Parameterized Complexity of SAT (Stefan Szeider)
The 3rd installation of the Workshop on the Parameterized Complexity of Computational Reasoning (PCCR 2022) will take place on July 31- August 1, 2022 in Haifa, Israel. The workshop is co-located with FLoC/IJCAR 2022 and associated with the 19th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022).
The program can now be found here.
Aims and Scope
This workshop aims to support a fruitful exchange of ideas between the research on parameterized complexity (PC) on one side and the research on problems in computational reasoning (Logic and probabilistic reasoning), Artificial Intelligence (AI), and Machine Learning (ML) on the other.
Topics of interest include but are not limited to:
- Parameterized complexity of problems in Logic, AI, Computational Social Choice, and ML.
- Recent developments in PC and the above areas plus introduction of new problems that might benefit from the PC approach.
- Various (structural) parameteriziations such as decompositions, backdoor sets, and hybrid parameterizations.
- Theory and practice of parameterized algorithms.
The workshop will feature invited and contributed talks with surveys and new technical results, an open problem session, and a panel discussion on future research directions. Apart from talks on parameterized complexity we are also interested in presentations that highlight structural parameters that have not been studied within the framework of parameterized complexity so far.
Call for Papers
If you would like to give a talk at the workshop, please submit a short abstract of your talk via Easychair by the submission deadline in PDF format. The abstract and talk can be based on published or unpublished results, and we welcome overview and survey talks, besides regular technical talks. Contributed talks are expected to be around 30 minutes each.
- Green light physical conference: 1 May 2022
- Early registration starts: 1 May 2022
- Abstract submission deadline: 24 May 2022
- Accepted talks notifications: 15 June 2022
- Stefan Szeider, TU Wien, Austria
- Gregory Gutin, Royal Holloway University of London, UK
- Saket Saurabh, University of Bergen, Norway
- Meirav Zehavi, Ben-Gurion University, Israel
- Hadas Shachnai, Technion, Israel
- Sebastian Ordyniak, University of Leeds, United Kingdom (firstname.lastname@example.org)
- M.S. Ramanujan, University of Warwick, United Kingdom (R.Maadapuzhi-Sridharan@warwick.ac.uk)
- Ronald de Haan, University of Amsterdam, Netherlands (email@example.com)