Juan Luis Esteban

Inf. Process. Lett., January, 2024

2023

On The Maximum Linear Arrangement Problem for Trees.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Minimum projective linearizations of trees in linear time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

The optimality of syntactic dependency distances.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

2017

A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Are crossing dependencies really scarce?

[BibT_eX]

[DOI]

CoRR, 2017

2016

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

[BibT_eX]

[DOI]

CoRR, 2016

2004

On the complexity of resolution with bounded conjunctions.

[BibT_eX]

[DOI]

Nicola Galesi

Jochen Messner

Theor. Comput. Sci., 2004

2003

Complexity measures for resolution.

[BibT_eX]

[DOI]

PhD thesis, 2003

A combinatorial characterization of treelike resolution space.

[BibT_eX]

[DOI]

Jacobo Torán

Inf. Process. Lett., 2003

2002

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.

[BibT_eX]

[DOI]

Albert Atserias

Maria Luisa Bonet

Inf. Comput., 2002

2001

Space Bounds for Resolution.

[BibT_eX]

[DOI]

Jacobo Torán

Inf. Comput., 2001

Minimally Unsatisfiable CNF Formulas.

[BibT_eX]

Sven Baumer

Jacobo Torán

Bull. EATCS, 2001

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.

[BibT_eX]

[DOI]

Albert Atserias

Maria Luisa Bonet

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A DNA-Based Random Walk Method for Solving k-SAT.

[BibT_eX]

[DOI]

Sergio Díaz