Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Approximating Pathwidth for Graphs of Small TreewidthGroenland, Carla ; Joret, Gwenaël ; Nadara, Wojciech ; Walczak, Bartosz2023-03Texto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Finding small-width connected path decompositions in polynomial timeDereniowski, Dariusz ; Osula, Dorota ; Rzążewski, PawełTheoretical computer science, 2019-11, Vol.794, p.85-100 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Horton-Strahler number, rooted pathwidth and upward drawings of treesBiedl, ThereseInformation processing letters, 2022-04, Vol.175, p.106230, Article 106230 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Tight Bound on Treedepth in Terms of Pathwidth and Longest PathHatzel, Meike ; Joret, Gwenaël ; Micek, Piotr ; Pilipczuk, Marcin ; Ueckerdt, Torsten ; Walczak, BartoszCombinatorica (Budapest. 1981), 2024-04, Vol.44 (2), p.417-427 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
The treewidth of line graphsHarvey, Daniel J. ; Wood, David R.Journal of combinatorial theory. Series B, 2018-09, Vol.132, p.157-179 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
The localization capture time of a graphBehague, Natalie C. ; Bonato, Anthony ; Huggan, Melissa A. ; Marbach, Trent G. ; Pittman, BrittanyTheoretical computer science, 2022-04, Vol.911, p.80-91 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
On exploring always-connected temporal graphs of small pathwidthBodlaender, Hans L. ; van der Zanden, Tom C.Information processing letters, 2019-02, Vol.142, p.68-71 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex orderingLiu, Yunlong ; Chen, Jie ; Huang, Jingui ; Wang, JianxinTheoretical computer science, 2021-06, Vol.873, p.16-24 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Length-bounded cuts: Proper interval graphs and structural parametersBentert, Matthias ; Heeger, Klaus ; Knop, DušanJournal of computer and system sciences, 2022-06, Vol.126, p.21-43 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Approximating Pathwidth for Graphs of Small TreewidthGroenland, Carla ; Joret, Gwenaël ; Nadara, Wojciech ; Walczak, BartoszACM transactions on algorithms, 2023-03, Vol.19 (2), p.1-19, Article 16 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |