Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Classifying subset feedback vertex set for H-free graphsPaesani, Giacomo ; Paulusma, Daniël ; Rzążewski, PawełTheoretical computer science, 2024-07, Vol.1003, Article 114624 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
2 |
Material Type: Artigo
|
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphsLozin, Vadim ; Barnaby, Martin ; Pandey, Sukanya ; Paulusma, Daniel ; Siggers, Mark ; Smith, Siani ; van Leeuwen, Erik JanarXiv.org, 2024-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
3 |
Material Type: Artigo
|
Finding \(d\)-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and \(H\)-Free GraphsLucke, Felicia ; Momeni, Ali ; Paulusma, Daniël ; Smith, SianiarXiv.org, 2024-04Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
4 |
Material Type: Artigo
|
Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free GraphsLucke, Felicia ; Momeni, Ali ; Paulusma, Daniël ; Smith, Siani2024-04Texto completo disponível |
|
5 |
Material Type: Artigo
|
Dichotomies for Maximum Matching Cut: \(H\)-Freeness, Bounded Diameter, Bounded RadiusLucke, Felicia ; Paulusma, Daniël ; Ries, BernardarXiv.org, 2024-03Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
6 |
Material Type: Artigo
|
Graph Homomorphism, Monotone Classes and Bounded PathwidthEagling-Vose, Tala ; Barnaby, Martin ; Paulusma, Daniel ; Siggers, Mark ; Smith, SianiarXiv.org, 2024-03Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
7 |
Material Type: Artigo
|
Solving problems on generalized convex graphs via mim-widthBonomo-Braberman, Flavia ; Brettell, Nick ; Munaro, Andrea ; Paulusma, DaniëlJournal of computer and system sciences, 2024-03, Vol.140, p.103493, Article 103493 [Periódico revisado por pares]Texto completo disponível |
|
8 |
Material Type: Artigo
|
On the price of independence for vertex cover, feedback vertex set and odd cycle transversalDabrowski, Konrad K. ; Johnson, Matthew ; Paesani, Giacomo ; Paulusma, Daniël ; Zamaraev, ViktorEuropean journal of combinatorics, 2024-03, Vol.117, p.103821, Article 103821 [Periódico revisado por pares]Elsevier LtdTexto completo disponível |
|
9 |
Material Type: Artigo
|
The Complexity of Diameter on H-free graphsOostveen, Jelle J ; Paulusma, Daniël ; van Leeuwen, Erik JanarXiv.org, 2024-02Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
10 |
Material Type: Artigo
|
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphsJohnson, Matthew ; Barnaby, Martin ; Smith, Siani ; Pandey, Sukanya ; Paulusma, Daniel ; van Leeuwen, Erik JanarXiv.org, 2024-02Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |