| 2025 | KR | About the Multi-Head Linear Restricted Chase Termination. | Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja |
| 2022 | KR | Conservative Extensions for Existential Rules. | Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski |
| 2022 | PODS | Determinacy of Real Conjunctive Queries. The Boolean Case. | Jaroslaw Kwiecien, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja |
| 2022 | PODS | A Journey to the Frontiers of Query Rewritability. | Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph |
| 2020 | ICDT | What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk). | Jerzy Marcinkowski |
| 2020 | PODS | All-Instances Restricted Chase Termination. | Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris |
| 2019 | ICDT | The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. | Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja |
| 2018 | LICS | Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. | Grzegorz Gluch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja |
| 2016 | PODS | Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2015 | LICS | The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2014 | ICALP | All-Instances Termination of Chase is Undecidable. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2013 | LICS | Converging to the Chase - A Tool for Finite Controllability. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2013 | PODS | On the BDD/FC conjecture. | Tomasz Gogacz, Jerzy Marcinkowski |
| 2011 | LICS | The Ultimate Undecidability Result for the Halpern-Shoham Logic. | Jerzy Marcinkowski, Jakub Michaliszyn |
| 2010 | ICALP | B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. | Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski |
| 2006 | CSL | On the Expressive Power of Graph Logic. | Jerzy Marcinkowski |
| 2004 | CIKM | Computing consistent query answers using conflict hypergraphs. | Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko |
| 2004 | EDBT | Hippo: A System for Computing Consistent Answers to a Class of SQL Queries. | Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko |
| 2004 | LPAR | On a Semantic Subsumption Test. | Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek |
| 2002 | CSL | Optimal Complexity Bounds for Positive LTL Games. | Jerzy Marcinkowski, Tomasz Truderung |
| 2001 | LICS | The Hierarchy inside Closed Monadic Sigma | Andr Arnold, Giacomo Lenzi, Jerzy Marcinkowski |
| 2001 | STACS | A Toolkit for First Order Extensions of Monadic Games. | David Janin, Jerzy Marcinkowski |
| 1999 | CSL | Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Frass Games. | Jerzy Marcinkowski |
| 1999 | ICALP | Two Techniques in the Area of the Star Problem. | Daniel Kirsten, Jerzy Marcinkowski |
| 1996 | LICS | DATALOG SIRUPs Uniform Boundedness is Undecidable. | Jerzy Marcinkowski |
| 1996 | STACS | The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. | Jerzy Marcinkowski |
| 1993 | CSL | A Horn Clause that Implies and Undecidable Set of Horn Clauses. | Jerzy Marcinkowski |
| 1992 | FOCS | Undecidability of the Horn-Clause Implication Problem | Jerzy Marcinkowski, Leszek Pacholski |