Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
The Firefighter problem on graph classesFomin, Fedor V. ; Heggernes, Pinar ; van Leeuwen, Erik JanTheoretical computer science, 2016-02, Vol.613, p.38-50 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queriesRong, Guozhen ; Yang, Yongjie ; Li, Wenjun ; Wang, JianxinTheoretical computer science, 2022-05, Vol.917, p.1-11 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation gamesBorassi, Michele ; Crescenzi, Pierluigi ; Habib, Michel ; Kosters, Walter A ; Marino, Andrea ; Takes, Frank WTheoretical computer science, 2015-06, Vol.586, p.59-80 [Periódico revisado por pares]Texto completo disponível |
4 |
Material Type: Artigo
|
![]() |
The balanced connected subgraph problem for geometric intersection graphsBhore, Sujoy ; Jana, Satyabrata ; Pandit, Supantha ; Roy, SasankaTheoretical computer science, 2022-09, Vol.929, p.69-80 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Partitioning subclasses of chordal graphs with few deletionsJana, Satyabrata ; Saha, Souvik ; Sahu, Abhishek ; Saurabh, Saket ; Verma, ShailyTheoretical computer science, 2024-02, Vol.983, p.114288, Article 114288 [Periódico revisado por pares]Texto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Hardness and efficiency on minimizing maximum distances in spanning treesCouto, Fernanda ; Cunha, Luís Felipe I.Theoretical computer science, 2020-10, Vol.838, p.168-179 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Algorithmic aspects of semitotal domination in graphsHenning, Michael A. ; Pandey, ArtiTheoretical computer science, 2019-04, Vol.766, p.46-57 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
A refinement on the structure of vertex-critical (P5, gem)-free graphsCameron, Ben ; Hoàng, Chính T.Theoretical computer science, 2023-06, Vol.961, p.113936, Article 113936 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Gap-planar graphsBae, Sang Won ; Baffier, Jean-Francois ; Chun, Jinhee ; Eades, Peter ; Eickmeyer, Kord ; Grilli, Luca ; Hong, Seok-Hee ; Korman, Matias ; Montecchiani, Fabrizio ; Rutter, Ignaz ; Tóth, Csaba D.Theoretical computer science, 2018-10, Vol.745, p.36-52 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Parameterized complexity of perfectly matched setsAgrawal, Akanksha ; Bhattacharjee, Sutanay ; Jana, Satyabrata ; Sahu, AbhishekTheoretical computer science, 2023-05, Vol.958, p.113861, Article 113861 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |