| 2022 | MFCS | On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. | Ilario Bonacina, Nicola Galesi, Massimo Lauria |
| 2022 | STACS | Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. | Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin |
| 2019 | Algosensors | Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography. | Nicola Galesi, Fariba Ranjbar, Michele Zito |
| 2019 | FOCS | Polynomial Calculus Space and Resolution Width. | Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen |
| 2019 | MFCS | Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. | Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova |
| 2018 | ICDCS | Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography. | Nicola Galesi, Fariba Ranjbar |
| 2018 | SAT | Cops-Robber Games and the Resolution of Tseitin Formulas. | Nicola Galesi, Navid Talebanfard, Jacobo Torn |
| 2014 | FOCS | Total Space in Resolution. | Ilario Bonacina, Nicola Galesi, Neil Thapen |
| 2014 | SCN | Proofs of Space: When Space Is of the Essence. | Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi |
| 2011 | ICALP | Parameterized Bounded-Depth Frege Is Not Optimal. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
| 2011 | SAT | Parameterized Complexity of DPLL Search Procedures. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
| 2005 | SAT | Resolution and Pebbling Games. | Nicola Galesi, Neil Thapen |
| 2004 | SAT | Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. | Nicola Galesi, Oliver Kullmann |
| 2004 | SAT | Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. | Nicola Galesi, Oliver Kullmann |
| 2003 | FOCS | Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. | Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi |
| 2002 | ICALP | On the Complexity of Resolution with Bounded Conjunctions. | Juan Luis Esteban, Nicola Galesi, Jochen Messner |
| 2000 | ICALP | Monotone Proofs of the Pigeon Hole Principle. | Albert Atserias, Nicola Galesi, Ricard Gavald |
| 1999 | FOCS | A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. | Maria Luisa Bonet, Nicola Galesi |
| 1998 | FOCS | Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. | Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen |
| 1997 | CIAC | Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. | Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino |
| 1997 | CSL | Linear Lower Bounds and Simulations in Frege Systems with Substitutions. | Maria Luisa Bonet, Nicola Galesi |