Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Selected papers from the 15th international symposium on Theoretical Aspects of Software Engineering (TASE 2021)Zhang, Min ; Ogata, KazuhiroScience of computer programming, 2023-01, Vol.225, p.102912, Article 102912 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Two-stage Robust Network Design with Exponential ScenariosKhandekar, Rohit ; Kortsarz, Guy ; Mirrokni, Vahab ; Salavatipour, Mohammad R.Algorithmica, 2013-02, Vol.65 (2), p.391-408 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Preface for the special issue of the 12th International Symposium on Theoretical Aspects of Software Engineering (TASE 2018)Zhang, Chenyi ; Pang, JunScience of computer programming, 2020-02, Vol.187, p.102375, Article 102375 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Preface for the special issue of the 10th International Symposium on Theoretical Aspects of Software Engineering (TASE 2016)Bonsangue, Marcello ; Deng, YuxinScience of computer programming, 2018-09, Vol.162, p.1-2 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?Bougeret, Marin ; Sau, IgnasiAlgorithmica, 2019-10, Vol.81 (10), p.4043-4068 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Fault Tolerant Approximate BFS Structures with Additive StretchParter, Merav ; Peleg, DavidAlgorithmica, 2020-12, Vol.82 (12), p.3458-3491 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph ModelsTirodkar, Sumedh ; Vishwanathan, SundarAlgorithmica, 2019-11, Vol.81 (11-12), p.4275-4292 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
The limits of local search for weighted k-set packingNeuwohner, MeikeMathematical programming, 2023-10 [Periódico revisado por pares]Texto completo disponível |
9 |
Material Type: Artigo
|
![]() |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 GroupsIvanyos, Gábor ; Sanselme, Luc ; Santha, MiklosAlgorithmica, 2012-02, Vol.62 (1-2), p.480-498 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Planar Polyline Drawings via Graph TransformationsZhang, HuamingAlgorithmica, 2010-06, Vol.57 (2), p.381-397 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |