Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
![]() |
Stacs 2000Annual Symposium on Theoretical Aspects of Computer Science, 17 2000 Lille Horst Reichel; Sophie TisonGoos, G., ed; Hartmanis, J., ed; Leeuwen, J. van, ed Lecture Notes in Computer Science Berlin, Springer-Verlag, c1985-Berlin Springer-Verlag c2000Localização: IFSC - Inst. Física de São Carlos (P621.38195 L471 v.1770 )(Acessar) |
2 |
Material Type: Livro
|
![]() |
STACS 99Annual Symposium on Theoretical Aspects of Computer Science, STACS, 16 1999 Trier Christoph Meinel; Sophie TisonGoos, G., ed; Hartmanis, J., ed; Leeuwen, J. Van, ed Lecture Notes in Computer Science Berlin, Springer-Verlag, c1985-Berlin Springer-Verlag c1999Localização: IFSC - Inst. Física de São Carlos (P621.38195 L471 v.1563 )(Acessar) |
3 |
Material Type: Livro
|
![]() |
STACS 97Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, 14 1997 Lubeck Rudiger Reischuk; Michel MorvanGoos, G., ed; Hartmanis, J., ed; Leeuwen, J. Van, ed Lecture Notes in Computer Science Berlin, Springer-Verlag, c1985-Berlin Springer-Verlag c1997Localização: IFSC - Inst. Física de São Carlos (P621.38195 L471 v.1200 )(Acessar) |
4 |
Material Type: Artigo
|
![]() |
Structural Properties and Tractability Results for Linear SyntenyLiben-Nowell, David ; Kleinberg, Jon Giancarlo, Raffaele ; Sankoff, DavidCombinatorial Pattern Matching, 2000, p.248-263 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Incomplete Directed Perfect PhylogenyPe’er, Itsik ; Shamir, Ron ; Sharan, Roded Giancarlo, Raffaele ; Sankoff, DavidCombinatorial Pattern Matching, 2000, p.143-153 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Improved compact visibility representation of planar graph via Schnyder's realizerLIN, Ching-Chi ; LU, Hsueh-I ; SUN, I.-FanLecture notes in computer science, 2003, p.14-25 [Periódico revisado por pares]Berlin: SpringerTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Some structural aspects of hypergraph languages generated by hyperedge replacementHabel, Annegret ; Kreowski, Hans-Jörg Brandenburg, Franz J. ; Vidal-Naquet, Guy ; Wirsing, MartinSTACS 87, 1987-01, p.207-219 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Algorithms for SAT Based on Search in Hamming BallsDantsin, Evgeny ; Hirsch, Edward A. ; Wolpert, Alexander Diekert, Volker ; Habib, MichelSTACS 2004, p.141-151 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Semi-dynamic shortest paths and breadth-first search in digraphsFranciosa, Paolo Giulio ; Frigioni, Daniele ; Giaccio, Roberto Morvan, Michel ; Reischuk, RüdigerSTACS 97, 1997-01, p.33-46 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Approximating geometric bottleneck shortest pathsBOSE, Prosenjit ; MAHESHWARI, Anil ; NARASIMHAN, Giri ; SMID, Michiel ; ZEH, NorbertLecture notes in computer science, 2003, p.38-49 [Periódico revisado por pares]Berlin: SpringerTexto completo disponível |