4th WORKSHOP ON PARAMETERIZED COMPLEXITY OF COMPUTATIONAL REASONING

*******************************************************************************************
4th WORKSHOP ON PARAMETERIZED COMPLEXITY OF COMPUTATIONAL
REASONING (PCCR 2026)
                                             --  co-located with FLoC 2026
 --

                                            July 24-25, 2026, Lisbon,
Portugal

Website: PCCR26 <https://algorithms.leeds.ac.uk/pccr2026/>
Submission link: HotCrp <https://submissions.floc26.org/pccr>
Submission deadline: *May 25, 2026*
Theme: Parameterized complexity of problems in Logic, AI, and ML.


******************************************************************************************

--------------------------------------- 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, Artificial Intelligence,
  Computational Social  Choice, and Machine Learning.

- 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.

---------------------------- CONFIRMED INVITED SPEAKERS
---------------------------------

   - Robert Ganian (TU Wien)
   - George Osipov (Royal Holloway, University of London)
   - Johannes Fichte (Linköping University)
   - Roohani Sharma (Institute for Basic Science, Daejeon, South Korea)
   - Marquis de Silva (ICREA, University of Lleida)
   - Sebastian Siebertz (University of Bremen)
   - Daniel Neuen (MPI, Saarbrücken)


------------------------------------------ CALL FOR PAPERS
-----------------------------------------

If you would like to give a talk at the workshop, please submit a short
abstract of
your talk via HotCrp <https://submissions.floc26.org/pcrr> 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.

----------------------------------------- IMPORTANT DATES
------------------------------------------

- Early registration ends: *1 June 2026*
- Workshop paper submission deadline: *25 May 2026* (HotCrp
<https://submissions.floc26.org/pccr>)
- Workshop accepted paper notifications: *28 May 2026*

----------------------------------- WORKSHOP ORGANIZATION
----------------------------------

- Sebastian Ordyniak, University of Leeds, United Kingdom (
[email protected])
- Fahad Panolan, University of Leeds, United Kingdom ([email protected])

**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   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)
*      http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************