Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
11 |
Material Type: Artigo
|
IMPROVED APPROXIMATION ALGORITHMS FOR PRIZE-COLLECTING STEINER TREE AND TSPARCHER, Aaron ; BATENI, Mohammadhossein ; HAJIAGHAYI, Mohammadtaghi ; KARLOFF, HowardSIAM journal on computing, 2011-01, Vol.40 (2), p.309-332 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
12 |
Material Type: Artigo
|
Minimum connected dominating sets and maximal independent sets in unit disk graphsWu, Weili ; Du, Hongwei ; Jia, Xiaohua ; Li, Yingshu ; Huang, Scott C.-H.Theoretical computer science, 2006-03, Vol.352 (1), p.1-7 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
13 |
Material Type: Artigo
|
A survey of graph layout problemsDIAZ, Josep ; PETIT, Jordi ; SERNA, MariaACM computing surveys, 2002-09, Vol.34 (3), p.313-356 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
|
14 |
Material Type: Artigo
|
ORACLES FOR DISTANCES AVOIDING A FAILED NODE OR LINKDEMETRESCU, Camil ; THORUP, Mikkel ; ALAM CHOWDHURY, Rezaul ; RAMACHANDRAN, VijayaSIAM journal on computing, 2008-01, Vol.37 (5), p.1299-1318 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
15 |
Material Type: Artigo
|
Exact and approximate bandwidthCygan, Marek ; Pilipczuk, MarcinTheoretical computer science, 2010-09, Vol.411 (40), p.3701-3713 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
|
16 |
Material Type: Artigo
|
Constructing edge-disjoint spanning trees in locally twisted cubesHsieh, Sun-Yuan ; Tu, Chang-JenTheoretical computer science, 2009-03, Vol.410 (8), p.926-932 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
|
17 |
Material Type: Artigo
|
Electric routing and concurrent flow cuttingKelner, Jonathan ; Maymounkov, PetarTheoretical computer science, 2011-07, Vol.412 (32), p.4123-4135 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
|
18 |
Material Type: Artigo
|
Graph exploration by a finite automatonFraigniaud, Pierre ; Ilcinkas, David ; Peer, Guy ; Pelc, Andrzej ; Peleg, DavidTheoretical computer science, 2005-11, Vol.345 (2), p.331-344 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
19 |
Material Type: Artigo
|
Balanced allocation and dictionaries with tightly packed constant size binsDietzfelbinger, Martin ; Weidling, ChristophTheoretical computer science, 2007-06, Vol.380 (1), p.47-68 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
20 |
Material Type: Artigo
|
The complexity of partition functionsBulatov, Andrei ; Grohe, MartinTheoretical computer science, 2005-12, Vol.348 (2), p.148-186 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |