| 2024 | MFCS | Pebble Games and Algebraic Proof Systems. | Lisa-Marie Jaser, Jacobo Torn |
| 2024 | SPLC | Towards Deterministic Compilation of Binary Decision Diagrams From Feature Models. | Tobias He, Sean Niklas Semmler, Chico Sundermann, Jacobo Torn, Thomas Thm |
| 2023 | SAT | Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. | Jacobo Torn, Florian Wrz |
| 2022 | CSL | Number of Variables for Graph Differentiation and the Resolution of GI Formulas. | Jacobo Torn, Florian Wrz |
| 2021 | SAGT | Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures. | Julian Nickerl, Jacobo Torn |
| 2020 | STACS | Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. | Jacobo Torn, Florian Wrz |
| 2018 | SAT | Cops-Robber Games and the Resolution of Tseitin Formulas. | Nicola Galesi, Navid Talebanfard, Jacobo Torn |
| 2017 | CiE | A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy. | Stefan Arnold, Jacobo Torn |
| 2017 | STACS | Parameterized Complexity of Small Weight Automorphisms. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Jacobo Torn |
| 2016 | SAT | Solution-Graphs of Boolean Formulas and Isomorphism. | Patrick Scharpfenecker, Jacobo Torn |
| 2014 | LATA | Succinct Encodings of Graph Isomorphism. | Bireswar Das, Patrick Scharpfenecker, Jacobo Torn |
| 2013 | SAT | On the Resolution Complexity of Graph Non-isomorphism. | Jacobo Torn |
| 2010 | STACS | Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. | Bireswar Das, Jacobo Torn, Fabian Wagner |
| 2006 | ISAAC | The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. | Vikraman Arvind, Jacobo Torn |
| 2005 | CiE | Arthur-Merlin Games and the Problem of Isomorphism Testing. | Jacobo Torn |
| 2002 | STACS | The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. | Johannes Kbler, Jacobo Torn |
| 2000 | FOCS | On the Hardness of Graph Isomorphism. | Jacobo Torn |
| 2000 | STACS | Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. | Vikraman Arvind, Johannes Kbler, Martin Mundhenk, Jacobo Torn |
| 1999 | CSL | Lower Bounds for Space in Resolution. | Jacobo Torn |
| 1999 | STACS | Sparse Sets, Approximable Sets, and Parallel Queries to NP. | Vikraman Arvind, Jacobo Torn |
| 1999 | STACS | Space Bounds for Resolution. | Juan Luis Esteban, Jacobo Torn |
| 1998 | STACS | Optimal Proof Systems for Propositional Logic and Complete Sets. | Jochen Mener, Jacobo Torn |
| 1995 | COCOON | Efficient Parallel Algorithms for some Tree Layout Problems. | Josep Daz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torn |
| 1993 | ESA | Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). | Josep Daz, Maria J. Serna, Jacobo Torn |
| 1992 | STACS | Graph Isomorphism is Low for PP. | Johannes Kbler, Uwe Schning, Jacobo Torn |
| 1991 | WADS | The MINSUMCUT Problem. | Josep Daz, Alan Gibbons, Mike Paterson, Jacobo Torn |
| 1990 | MFCS | Counting the Number of Solutions. | Jacobo Torn |
| 1989 | FCT | Complexity Classes with Complete Problems Between P and NP-C. | Carme lvarez, Josep Daz, Jacobo Torn |
| 1989 | ICALP | A Combinatorial Technique for Separating Counting Complexity Classes. | Jacobo Torn |