Intersection of Longest Paths in a Graph. - Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2011)

Intersecting longest paths. - Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabayashi (Discret. Math., 2013)

On the proper orientation number of bipartite graphs. - Júlio Araújo 001; Nathann Cohen; Susanna F. de Rezende; Frédéric Havet; Phablo F. S. Moura (Theor. Comput. Sci., 2015)

Cumulative Space in Black-White Pebbling and Resolution. - Joël Alwen; Susanna F. de Rezende; Jakob Nordström; Marc Vinyals (ITCS, 2017)

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. - Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere; Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2019)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. - Susanna F. de Rezende; Jakob Nordström; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2019)

Lower Bounds and Trade-offs in Proof Complexity. - Susanna F. de Rezende (2019)

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere; Marc Vinyals (FOCS, 2020)

Automating Algebraic Proof Systems is NP-Hard. - Mika Göös; Jakob Nordström; Toniann Pitassi; Robert Robere; Dmitry Sokolov 001; Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2020)

The Power of Negative Reasoning. - Susanna F. de Rezende; Massimo Lauria; Jakob Nordström; Dmitry Sokolov 001 (CCC, 2021)

Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. - Susanna F. de Rezende (LAGOS, 2021)

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Robert Robere (Comput. Complex., 2021)

Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. - Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2021)

How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). - Susanna F. de Rezende; Jakob Nordström; Marc Vinyals (Electron. Colloquium Comput. Complex., 2021)

Clique Is Hard on Average for Regular Resolution. - Albert Atserias; Ilario Bonacina; Susanna F. de Rezende; Massimo Lauria; Jakob Nordström; Alexander A. Razborov (J. ACM, 2021)

Proofs, Circuits, and Communication. - Susanna F. de Rezende; Mika Göös; Robert Robere (CoRR, 2022)

Guest Column: Proofs, Circuits, and Communication. - Susanna F. de Rezende; Mika Göös; Robert Robere (SIGACT News, 2022)

Clique Is Hard on Average for Unary Sherali-Adams. - Susanna F. de Rezende; Aaron Potechin; Kilian Risse (FOCS, 2023)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. - Susanna F. de Rezende; Aaron Potechin; Kilian Risse (CoRR, 2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. - Susanna F. de Rezende; Noah Fleming; Duri Andrea Janett; Jakob Nordström; Shuo Pang 002 (Electron. Colloquium Comput. Complex., 2024)

KRW Composition Theorems via Lifting. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere (Comput. Complex., 2024)

On the Automatability of Tree-Like k-DNF Resolution. - Gaia Carenini; Susanna F. de Rezende (CCC, 2025)

Lifting with Colourful Sunflowers. - Susanna F. de Rezende; Marc Vinyals (CCC, 2025)

Some Recent Advancements in Monotone Circuit Complexity (Invited Talk). - Susanna F. de Rezende (STACS, 2025)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. - Jonas Conneryd; Susanna F. de Rezende; Jakob Nordström; Shuo Pang 002; Kilian Risse (Electron. Colloquium Comput. Complex., 2025)

The Proof Analysis Problem. - Noel Arteche; Albert Atserias; Susanna F. de Rezende; Erfan Khaniki (CoRR, 2025)