An approximation scheme for strip packing of rectangles with bounded dimensionsFERNANDEZ DE LA VEGA, W; ZISSIMOPOULOS, V.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 93-101, issn 0166-218XArticle

A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)HAMIEZ, Jean-Philippe; HAO, Jin-Kao.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 252-265, issn 0166-218X, 14 p.Article

An efficient parallel algorithm for the general planar monotone circuit value problemVIJAYA RAMACHANDRAN; HONGHUA YANG.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 312-339, issn 0097-5397Article

A linear algorithm for determining the separation of convex polyhedraDOBKIN, D. P; KIRKPATRICK, D. G.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 381-392, issn 0196-6774Article

Linear time tree codesTINHOFER, G; SCHRECK, H.Computing (Wien. Print). 1984, Vol 33, Num 3-4, pp 211-225, issn 0010-485XArticle

On real time and linear time cellular automataBUCHER, W; CULIK, K. II.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 307-325, issn 0399-0540Article

Lempel, Even, and Cederbaum planarity methodBOYER, John M; FERNANDES, Cristina G; NOMA, Alexandre et al.Lecture notes in computer science. 2004, pp 129-144, issn 0302-9743, isbn 3-540-22067-4, 16 p.Conference Paper

Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

On constrained minimum pseudotriangulationsROTE, Günter; CAO AN WANG; LUSHENG WANG et al.Lecture notes in computer science. 2003, pp 445-454, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

On minimum intersection of two minimum dominating sets of interval graphsCHANG, M.-S; HSU, C.-C.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 41-50, issn 0166-218XArticle

Unique Horn renaming and Unique 2-SatisfiabilityHEBRARD, J.-J.Information processing letters. 1995, Vol 54, Num 4, pp 235-239, issn 0020-0190Article

FASTSP: linear time calculation of alignment accuracyMIRARAB, Siavash; WARNOW, Tandy.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 23, pp 3250-3258, issn 1367-4803, 9 p.Article

A simple linear-tine algorithm for in situ mergingMANNILA, H; UKKONEN, E.Information processing letters. 1984, Vol 18, Num 4, pp 203-208, issn 0020-0190Article

Un algorithme linéaire en temps espéré pour déduire toutes les conclusions logiques induites par un ensemble d'inégalités Booléennes = A linear time algorithm in expected time for the deduction of logical conclusions inducing by a boolean inequality setHANSEN, P; JAUMARD, B; MINOUX, M et al.1984, 40 p.Report

Metaphors of Temporality: Revisiting the Timeless Hinduism versus Historical Christianity AntithesisBARUA, Ankur.Harvard theological review. 2011, Vol 104, Num 2, pp 147-169, issn 0017-8160, 23 p.Article

Drawing graphs with large vertices and thick edgesBAREQUET, Gill; GOODRICH, Michael T; RILEY, Chris et al.Lecture notes in computer science. 2003, pp 281-293, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

A linear time algorithm for finding a k-tree coreSHIOURA, A; UNO, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 281-290, issn 0196-6774Article

On piercing sets of axis-parallel rectangles and ringsSEGAL, M.Lecture notes in computer science. 1997, pp 430-442, issn 0302-9743, isbn 3-540-63397-9Conference Paper

Riflessioni sull'identità non riuscita o perduta = Reflections on lost identityFERRAROTTI, Franco.Critica sociologica. 2007, Num 164, issn 0011-1546, 13-19, 89 [9 p.]Article

A simpler linear-time recognition of circular-arc graphsKAPLAN, Haim; NUSSBAUM, Yahav.Lecture notes in computer science. 2006, pp 41-52, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Minimum area joining of k compacted cellsLIM, A.Information processing letters. 1996, Vol 58, Num 6, pp 265-269, issn 0020-0190Article

Linear-time computation of local periodsDUVAL, Jean-Pierre; KOLPAKOV, Roman; KUCHEROV, Gregory et al.Lecture notes in computer science. 2003, pp 388-397, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Drawring plane graphs nicelyCHIBA, N; ONOGUCHI, K; NISHIZEKI, T et al.Acta informatica. 1985, Vol 22, Num 2, pp 187-201, issn 0001-5903Article

Linear time and branching time semanties for recursion with mergeDE BAKKER, J. W; BERGSTRA, J. A; KLOP, J. W et al.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 135-156, issn 0304-3975Conference Paper

The complexity of assigning genotypes to people in a pedigree consistentlySUZUKI, Susumu; IBARAKI, Toshihide.Discrete mathematics. 2007, Vol 307, Num 16, pp 2122-2131, issn 0012-365X, 10 p.Article