Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
21 |
Material Type: Artigo
|
![]() |
Asynchronous deterministic rendezvous in graphsMarco, Gianluca De ; Gargano, Luisa ; Kranakis, Evangelos ; Krizanc, Danny ; Pelc, Andrzej ; Vaccaro, UgoTheoretical computer science, 2006-04, Vol.355 (3), p.315-326 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
22 |
Material Type: Artigo
|
![]() |
Complexity of the traveling tournament problemThielen, Clemens ; Westphal, StephanTheoretical computer science, 2011-02, Vol.412 (4), p.345-351 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
23 |
Material Type: Artigo
|
![]() |
Logarithmic lower bounds in the cell-probe modelPATRASCU, Mihai ; DEMAINE, Erik DSIAM journal on computing, 2006, Vol.35 (4), p.932-963 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
24 |
Material Type: Artigo
|
![]() |
Size-constrained tree partitioning: Approximating the multicast k -tree routing problemCai, Zhipeng ; Goebel, Randy ; Lin, GuohuiTheoretical computer science, 2011-01, Vol.412 (3), p.240-245 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
25 |
Material Type: Artigo
|
![]() |
HOW HARD IS IT TO APPROXIMATE THE BEST NASH EQUILIBRIUM?HAZAN, Elad ; KRAUTHGAMER, RobertSIAM journal on computing, 2011, Vol.40 (1), p.79-91 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
26 |
Material Type: Artigo
|
![]() |
A greedy approximation for minimum connected dominating setsRuan, Lu ; Du, Hongwei ; Jia, Xiaohua ; Wu, Weili ; Li, Yingshu ; Ko, Ker-ITheoretical computer science, 2004-12, Vol.329 (1-3), p.325-330 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
27 |
Material Type: Artigo
|
![]() |
DLS-trees : A model of evolutionary scenariosGORECKI, Paweł ; TIURYN, JerzyTheoretical computer science, 2006-08, Vol.359 (1-3), p.378-399 [Periódico revisado por pares]Amsterdam: ElsevierTexto completo disponível |
28 |
Material Type: Artigo
|
![]() |
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elementsPark, Jung-Heum ; Lim, Hyeong-Seok ; Kim, Hee-ChulTheoretical computer science, 2007-05, Vol.377 (1), p.170-180 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
29 |
Material Type: Artigo
|
![]() |
INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V ; GOLOVACH, Petr A ; LOKSHTANOV, Daniel ; SAURABH, SaketSIAM journal on computing, 2010, Vol.39 (5), p.1941-1956 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
30 |
Material Type: Artigo
|
![]() |
A framework for security analysis of mobile wireless networksNanz, Sebastian ; Hankin, ChrisTheoretical computer science, 2006-11, Vol.367 (1), p.203-227 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |