Siani Smith

From MaRDI portal
Person:2055972

Available identifiers

zbMath Open smith.sianiMaRDI QIDQ2055972

List of research outcomes





PublicationDate of PublicationType
Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs2024-12-03Paper
https://portal.mardi4nfdi.de/entity/Q61475182024-01-15Paper
The complexity of \(L(p, q)\)-edge-labelling2023-11-17Paper
Induced disjoint paths and connected subgraphs for \(H\)-free graphs2023-09-27Paper
QCSP on Reflexive Tournaments2023-09-20Paper
Few induced disjoint paths for \(H\)-free graphs2023-08-03Paper
Induced disjoint paths and connected subgraphs for \(H\)-free graphs2023-05-05Paper
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem2023-05-02Paper
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs2023-05-01Paper
Colouring graphs of bounded diameter in the absence of small cycles2023-03-22Paper
https://portal.mardi4nfdi.de/entity/Q58744892023-02-07Paper
Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision2022-11-25Paper
Complexity Framework For Forbidden Subgraphs I: The Framework2022-11-23Paper
Few induced disjoint paths for \(H\)-free graphs2022-11-17Paper
Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter2022-09-01Paper
Partitioning \(H\)-free graphs of bounded diameter2022-08-25Paper
Colouring H-free graphs of bounded diameter.2022-07-21Paper
The complexity of \(L(p, q)\)-edge-labelling2022-07-13Paper
Acyclic, star, and injective colouring: bounding the diameter2022-06-13Paper
Acyclic, star, and injective colouring: bounding the diameter2022-06-08Paper
Colouring graphs of bounded diameter in the absence of small cycles2022-04-20Paper
Disjoint paths and connected subgraphs for \(H\)-free graphs2022-03-22Paper
Injective colouring for H-free graphs2022-03-21Paper
Few Induced Disjoint Paths for $H$-Free Graphs2022-03-07Paper
Hard problems that quickly become very easy2021-12-14Paper
Disjoint paths and connected subgraphs for \(H\)-free graphs2021-12-01Paper
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter2021-11-23Paper
Disjoint Paths and Connected Subgraphs for H-Free Graphs2021-05-13Paper
Partitioning H-Free Graphs of Bounded Diameter2021-05-10Paper
Acyclic, Star, and Injective Colouring: Bounding the Diameter2021-04-21Paper
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs2020-08-21Paper
Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free GraphsN/APaper

Research outcomes over time

This page was built for person: Siani Smith