Siani Smith

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 43

Top Topics

Conformant Planning

Top Venues

Theor. Comput. Sci.

Publications

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT (2024)
Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CiE (2024)
Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
-Free Graphs. CoRR (2024)
Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, Siani Smith
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR (2024)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA (2024)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR (2023)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 939 (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85 (9) (2023)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR (2023)
Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
The Complexity of L(p, q)-Edge-Labelling. Algorithmica 85 (11) (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2022)
Gaetan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
The Complexity of L(p, q)-Edge-Labelling. WALCOM (2022)
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework For Forbidden Subgraphs. CoRR (2022)
Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29 (2) (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. Theor. Comput. Sci. 931 (2022)
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR (2022)
Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23 (3) (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Hard problems that quickly become very easy. Inf. Process. Lett. 174 (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. CoRR (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. ISCO (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 898 (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
-free graphs of bounded diameter. Theor. Comput. Sci. 930 (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring graphs of bounded diameter in the absence of small cycles. Discret. Appl. Math. 314 (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CIAC (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter. CoRR (2021)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Injective Colouring for H-Free Graphs. CSR (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. CoRR (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ESA (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. CoRR (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. ISAAC (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Hard Problems That Quickly Become Very Easy. CoRR (2020)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA (2020)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR (2020)
Gaetan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
The complexity of L(p, q)-Edge-Labelling. CoRR (2020)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring H-Free Graphs of Bounded Diameter. MFCS (2019)