Juan Luis Esteban

Available identifiers

Publication	Date of Publication	Type
The maximum linear arrangement problem for trees under projectivity and planarity	2023-10-12	Paper
Are crossing dependencies really scarce?	2022-06-23	Paper
Minimum projective linearizations of trees in linear time	2021-12-14	Paper
Bounds of the sum of edge lengths in linear arrangements of trees	2021-04-01	Paper
The scaling of the minimum sum of edge lengths in uniformly random trees	2020-08-11	Paper
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees	2017-07-21	Paper
A combinatorial characterization of treelike resolution space	2009-04-28	Paper
On the complexity of resolution with bounded conjunctions	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4737159	2004-08-11	Paper
Minimally unsatisfiable \(CNF\) formulas	2003-09-14	Paper
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution	2003-01-14	Paper
Space bounds for resolution	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4535079	2002-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4530863	2002-06-09	Paper
On the relative complexity of resolution refinements and cutting planes proof systems	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4251071	1999-06-17	Paper
On The Maximum Linear Arrangement Problem for Trees	N/A	Paper

This page was built for person: Juan Luis Esteban