Juan Luis Esteban

27 papers A* 3A 2Journal 20Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
The maximum linear arrangement problem for trees under projectivity and planarity.
Inf. Process. Lett.
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2023 J jnl
On The Maximum Linear Arrangement Problem for Trees.
CoRR
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2022 J jnl
Minimum projective linearizations of trees in linear time.
Inf. Process. Lett.
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2022 J jnl
The Maximum Linear Arrangement Problem for trees under projectivity and planarity.
CoRR
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2021 J jnl
Minimum projective linearizations of trees in linear time.
CoRR
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2021 J jnl
The Linear Arrangement Library. A new tool for research on syntactic dependency structures.
CoRR
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
2020 J jnl
The optimality of syntactic dependency distances.
CoRR
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban, Lluís Alemany-Puig
2020 J jnl
The variation of the sum of edge lengths in linear arrangements of trees.
CoRR
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
2019 A conf
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.
CP
Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret
2017 J jnl
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees.
SIAM J. Comput.
Juan Luis Esteban, Ramon Ferrer-i-Cancho
2017 J jnl
Are crossing dependencies really scarce?
CoRR
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
2016 J jnl
The scaling of the minimum sum of edge lengths in uniformly random trees.
CoRR
Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
2015 J jnl
A correction on Shiloach's algorithm for minimum linear arrangement of trees.
CoRR
Juan Luis Esteban, Ramon Ferrer-i-Cancho
2004 J jnl
On the complexity of resolution with bounded conjunctions.
Theor. Comput. Sci.
Juan Luis Esteban, Nicola Galesi, Jochen Messner
2003 J jnl
A Combinatorial Characterization of Treelike Resolution Space
Electron. Colloquium Comput. Complex.
Juan Luis Esteban, Jacobo Torán
2003 J jnl
A combinatorial characterization of treelike resolution space.
Inf. Process. Lett.
Juan Luis Esteban, Jacobo Torán
2003 — —
Complexity measures for resolution.
Juan Luis Esteban
2002 J jnl
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.
Inf. Comput.
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
2002 A* conf
On the Complexity of Resolution with Bounded Conjunctions.
ICALP
Juan Luis Esteban, Nicola Galesi, Jochen Messner
2001 A* conf
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.
ICALP
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
2001 J jnl
Minimally Unsatisfiable CNF Formulas.
Bull. EATCS
Sven Baumer, Juan Luis Esteban, Jacobo Torán
2001 J jnl
Space Bounds for Resolution.
Inf. Comput.
Juan Luis Esteban, Jacobo Torán
2000 — conf
A DNA-Based Random Walk Method for Solving k-SAT.
DNA Computing
Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara
2000 J jnl
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
SIAM J. Comput.
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
1999 A conf
Space Bounds for Resolution.
STACS
Juan Luis Esteban, Jacobo Torán
1998 J jnl
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
Electron. Colloquium Comput. Complex.
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
1998 A* conf
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems.
FOCS
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen