Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised PapersSau, Ignasi ; Thilikos, Dimitrios M Thilikos, Dimitrios M ; Sau, Ignasi ; Sau, Ignasi ; Thilikos, Dimitrios M.Cham: Springer Nature 2019Sem texto completo |
|
2 |
Material Type: Artigo
|
On the Complexity of Finding Large Odd Induced Subgraphs and Odd ColoringsBelmonte, Rémy ; Sau, IgnasiAlgorithmica, 2021-08, Vol.83 (8), p.2351-2373 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
3 |
Material Type: Artigo
|
Introducing lop-Kernels: A Framework for Kernelization Lower BoundsAraújo, Júlio ; Bougeret, Marin ; Campos, Victor ; Sau, IgnasiAlgorithmica, 2022-11, Vol.84 (11), p.3365-3406 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
4 |
Material Type: Artigo
|
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and KernelizationGomes, Guilherme C. M. ; Sau, IgnasiAlgorithmica, 2021-06, Vol.83 (6), p.1677-1706 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
5 |
Material Type: Artigo
|
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting SetsAraújo, Júlio ; Bougeret, Marin ; Campos, Victor A. ; Sau, IgnasiAlgorithmica, 2023-02, Vol.85 (2), p.444-491 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
6 |
Material Type: Artigo
|
A unifying model for locally constrained spanning tree problemsViana, Luiz ; Campêlo, Manoel ; Sau, Ignasi ; Silva, AnaJournal of combinatorial optimization, 2021-07, Vol.42 (1), p.125-150 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
7 |
Material Type: Artigo
|
A Linear Kernel for Planar Total Dominating SetGarnero, Valentin ; Sau, IgnasiDiscrete Mathematics and Theoretical Computer Science, 2018-05, Vol.20 (1), p.1 [Periódico revisado por pares]DMTCSTexto completo disponível |
|
8 |
Material Type: Artigo
|
On the Complexity of Finding Internally Vertex-Disjoint Long Directed PathsAraújo, Júlio ; Campos, Victor A. ; Maia, Ana Karolinna ; Sau, Ignasi ; Silva, AnaAlgorithmica, 2020-06, Vol.82 (6), p.1616-1639 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
9 |
Material Type: Artigo
|
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helpsLopes, Raul ; Sau, IgnasiTheoretical computer science, 2022-01, Vol.898, p.75-91 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
10 |
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 |