Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems - Maria Luisa Bonet; Juan Luis Esteban; Nicola Galesi; Jan Johannsen (Electron. Colloquium Comput. Complex., 1998)

A DNA-Based Random Walk Method for Solving k-SAT. - Sergio Díaz; Juan Luis Esteban; Mitsunori Ogihara (DNA Computing, 2000)

On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. - Maria Luisa Bonet; Juan Luis Esteban; Nicola Galesi; Jan Johannsen (SIAM J. Comput., 2000)

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. - Albert Atserias; Maria Luisa Bonet; Juan Luis Esteban (ICALP, 2001)

Minimally Unsatisfiable CNF Formulas. - Sven Baumer; Juan Luis Esteban; Jacobo Torán (Bull. EATCS, 2001)

Space Bounds for Resolution. - Juan Luis Esteban; Jacobo Torán (Inf. Comput., 2001)

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. - Albert Atserias; Maria Luisa Bonet; Juan Luis Esteban (Inf. Comput., 2002)

A combinatorial characterization of treelike resolution space. - Juan Luis Esteban; Jacobo Torán (Inf. Process. Lett., 2003)

Complexity measures for resolution. - Juan Luis Esteban (2003)

On the complexity of resolution with bounded conjunctions. - Juan Luis Esteban; Nicola Galesi; Jochen Messner (Theor. Comput. Sci., 2004)

The scaling of the minimum sum of edge lengths in uniformly random trees. - Juan Luis Esteban; Ramon Ferrer-i-Cancho; Carlos Gómez-Rodríguez (CoRR, 2016)

Are crossing dependencies really scarce? - Ramon Ferrer-i-Cancho; Carlos Gómez-Rodríguez; Juan Luis Esteban (CoRR, 2017)

A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees. - Juan Luis Esteban; Ramon Ferrer-i-Cancho (SIAM J. Comput., 2017)

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. - Carlos Ansótegui; Miquel Bofill; Jordi Coll; Nguyen Dang 001; Juan Luis Esteban; Ian Miguel; Peter Nightingale; András Z. Salamon; Josep Suy; Mateu Villaret (CP, 2019)

The variation of the sum of edge lengths in linear arrangements of trees. - Ramon Ferrer-i-Cancho; Carlos Gómez-Rodríguez; Juan Luis Esteban (CoRR, 2020)

The optimality of syntactic dependency distances. - Ramon Ferrer-i-Cancho; Carlos Gómez-Rodríguez; Juan Luis Esteban; Lluís Alemany-Puig (CoRR, 2020)

The Linear Arrangement Library. A new tool for research on syntactic dependency structures. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (CoRR, 2021)

Minimum projective linearizations of trees in linear time. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (Inf. Process. Lett., 2022)

On The Maximum Linear Arrangement Problem for Trees. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (CoRR, 2023)

The maximum linear arrangement problem for trees under projectivity and planarity. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (Inf. Process. Lett., 2024)