Juan Luis Esteban

Orcid: 0000-0003-0072-6576

According to our database1, Juan Luis Esteban authored at least 20 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The maximum linear arrangement problem for trees under projectivity and planarity.
Inf. Process. Lett., January, 2024

2023
On The Maximum Linear Arrangement Problem for Trees.
CoRR, 2023

2022
Minimum projective linearizations of trees in linear time.
Inf. Process. Lett., 2022

2021
The Linear Arrangement Library. A new tool for research on syntactic dependency structures.
CoRR, 2021

2020
The optimality of syntactic dependency distances.
CoRR, 2020

The variation of the sum of edge lengths in linear arrangements of trees.
CoRR, 2020

2019
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2017
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees.
SIAM J. Comput., 2017

Are crossing dependencies really scarce?
CoRR, 2017

2016
The scaling of the minimum sum of edge lengths in uniformly random trees.
CoRR, 2016

2004
On the complexity of resolution with bounded conjunctions.
Theor. Comput. Sci., 2004

2003
Complexity measures for resolution.
PhD thesis, 2003

A combinatorial characterization of treelike resolution space.
Inf. Process. Lett., 2003

2002
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.
Inf. Comput., 2002

2001
Space Bounds for Resolution.
Inf. Comput., 2001

Minimally Unsatisfiable CNF Formulas.
Bull. EATCS, 2001

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
SIAM J. Comput., 2000

A DNA-Based Random Walk Method for Solving k-SAT.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1998
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
Electron. Colloquium Comput. Complex., 1998


  Loading...