| 2026 | STACS | Generalised Quantifiers Based on Rabin-Mostowski Index. | Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2025 | STACS | A Dichotomy Theorem for Ordinal Ranks in MSO. | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2023 | LICS | The Probabilistic Rabin Tree Theorem | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2021 | CSL | A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. | Andr Arnold, Damian Niwinski, Pawel Parys |
| 2021 | MFCS | On Guidable Index of Tree Automata. | Damian Niwinski, Michal Skrzypczak |
| 2020 | ICALP | Computing Measures of Weak-MSO Definable Sets of Trees. | Damian Niwinski, Marcin Przybylko, Michal Skrzypczak |
| 2013 | CSL | The Ackermann Award 2013. | Anuj Dawar, Thomas A. Henzinger, Damian Niwinski |
| 2012 | CSL | The Ackermann Award 2012. | Thierry Coquand, Anuj Dawar, Damian Niwinski |
| 2012 | STACS | On the separation question for tree languages. | Andr Arnold, Henryk Michalewski, Damian Niwinski |
| 2010 | CSL | The Ackermann Award 2010. | Johann A. Makowsky, Damian Niwinski |
| 2009 | STACS | On the Borel Inseparability of Game Tree Languages. | Szczepan Hummel, Henryk Michalewski, Damian Niwinski |
| 2008 | CSL | The Ackermann Award 2008. | Johann A. Makowsky, Damian Niwinski |
| 2007 | CSL | The Ackermann Award 2007. | Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski |
| 2005 | ICALP | Unsafe Grammars and Panic Automata. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz |
| 2002 | CSL | µ-Calculus via Games. | Damian Niwinski |
| 2002 | FOSSACS | Higher-Order Pushdown Trees Are Easy. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
| 1998 | LICS | The Horn Mu-calculus. | Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz |
| 1998 | STACS | Relating Hierarchies of Word and Tree Automata. | Damian Niwinski, Igor Walukiewicz |
| 1996 | EDBT | First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. | David Toman, Damian Niwinski |
| 1993 | LICS | y = 2x vs. y = 3x | Damian Niwinski, Alexei P. Stolboushkin |
| 1993 | PODS | On the Feasibility of Checking Temporal Integrity Constraints. | Jan Chomicki, Damian Niwinski |
| 1991 | FCT | About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Bchi Conditions. | Danile Beauquier, Maurice Nivat, Damian Niwinski |
| 1991 | MFCS | On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. | Damian Niwinski |
| 1988 | LICS | Fixed Points vs. Infinite Generation | Damian Niwinski |
| 1986 | ICALP | On Fixed-Point Clones (Extended Abstract). | Damian Niwinski |
| 1982 | ICALP | Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). | Damian Niwinski |