| 2026 | SAT | An Exponential Separation Between Deterministic CDCL and DPLL Solvers. | Sahil Samar, Marc Vinyals, Vijay Ganesh |
| 2025 | CP | Practically Feasible Proof Logging for Pseudo-Boolean Optimization. | Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordstrm, Andy Oertel, Yong Kiam Tan, Marc Vinyals |
| 2023 | SAT | Limits of CDCL Learning via Merge Resolution. | Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh |
| 2021 | SAT | On the Hierarchical Community Structure of Practical Boolean Formulas. | Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh |
| 2020 | AAAI | Hard Examples for Common Variable Decision Heuristics. | Marc Vinyals |
| 2020 | FOCS | Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Marc Vinyals |
| 2020 | SAT | MaxSAT Resolution and Subcube Sums. | Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals |
| 2020 | SAT | Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. | Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh |
| 2020 | SAT | Simplified and Improved Separations Between Regular and General Resolution by Lifting. | Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordstrm |
| 2018 | SAT | Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. | Jan Elffers, Jess Girldez-Cru, Jakob Nordstrm, Marc Vinyals |
| 2018 | SAT | In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. | Marc Vinyals, Jan Elffers, Jess Girldez-Cru, Stephan Gocht, Jakob Nordstrm |
| 2017 | SAT | CNFgen: A Generator of Crafted Benchmarks. | Massimo Lauria, Jan Elffers, Jakob Nordstrm, Marc Vinyals |
| 2016 | FOCS | How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). | Susanna F. de Rezende, Jakob Nordstrm, Marc Vinyals |
| 2016 | SAT | Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. | Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordstrm, Marc Vinyals |
| 2015 | FOCS | Hardness of Approximation in PSPACE and Separation Results for Pebble Games. | Siu Man Chan, Massimo Lauria, Jakob Nordstrm, Marc Vinyals |
| 2014 | STACS | From Small Space to Small Width in Resolution. | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | ICALP | Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |