Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
11 |
Material Type: Artigo
|
![]() |
Linear time algorithms and NP-complete problemsGRANDJEAN, ESIAM journal on computing, 1994-06, Vol.23 (3), p.573-597 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
12 |
Material Type: Artigo
|
![]() |
Polynomial algorithms for hamiltonian cycle in cocomparability graphsDEOGUN, J. S ; STEINER, GSIAM journal on computing, 1994-06, Vol.23 (3), p.520-552 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
13 |
Material Type: Artigo
|
![]() |
Digital search trees again revisited: the internal path length perspectiveKIRSCHENHOFER, P ; PRODINGER, H ; SZPANKOWSKI, WSIAM journal on computing, 1994-06, Vol.23 (3), p.598-616 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
14 |
Material Type: Artigo
|
![]() |
Inferring evolutionary history from DNA sequencesKANNAN, S. K ; WARNOW, T. JSIAM journal on computing, 1994-08, Vol.23 (4), p.713-737 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
15 |
Material Type: Artigo
|
![]() |
Existence and construction of edge-disjoint paths on expander graphsBRODER, A. Z ; FRIEZE, A. M ; UPFAL, ESIAM journal on computing, 1994-10, Vol.23 (5), p.976-989 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
16 |
Material Type: Artigo
|
![]() |
Treewidth of circular-arc graphsRAVI SUNDARAM ; KARAN SHER SINGH ; PANDU RANGAN, CSIAM journal on discrete mathematics, 1994-11, Vol.7 (4), p.647-655 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
17 |
Material Type: Artigo
|
![]() |
Optimal parallel algorithms for straight-line grid embeddings of planar graphsKao, Ming-Yang ; Furer, Martin ; He, Xin ; Raghavachari, BalajiSIAM journal on discrete mathematics, 1994-11, Vol.7 (4), p.632-646 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
18 |
Material Type: Artigo
|
![]() |
Simple and fast algorithms for linear and integer programs with two variables per inequalityHOCHBAUM, D. S ; NAOR, JSIAM journal on computing, 1994-12, Vol.23 (6), p.1179-1192 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
19 |
Material Type: Artigo
|
![]() |
A new way of countingYOUNG-CHING DENG ; YUE-LI WANG ; JOU-MING CHANGComputers & mathematics with applications (1987), 1995, Vol.29 (12), p.75-80 [Periódico revisado por pares]Oxford: ElsevierTexto completo disponível |
20 |
Material Type: Artigo
|
![]() |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in TournamentsBampis, E. ; Elhaddad, M. ; Manoussakis, Y. ; Santha, M.Journal of algorithms, 1995, Vol.19 (3), p.432-440 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |