Siani Smith

According to our database, Siani Smith authored at least 32 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Finding d-Cuts in Claw-free Graphs.

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith

CoRR, May, 2025

Complexity Framework for Forbidden Subgraphs I: The Framework.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Algorithmica, March, 2025

A forbidden subgraph study for cut problems on graphs permitting loops and multiedges.

Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith

CoRR, February, 2025

Acyclic, star and injective colouring: A complexity picture for H-free graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith

J. Comput. Syst. Sci., 2025

2024

Finding <i>d</i>-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and <i>H</i>-Free Graphs.

Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith

CoRR, 2024

Graph Homomorphism, Monotone Classes and Bounded Pathwidth.

Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark H. Siggers, Siani Smith

CoRR, 2024

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs.

Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.

Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.

Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Graph Homomorphism, Monotone Classes and Bounded Pathwidth.

Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Few induced disjoint paths for <i>H</i>-free graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2023

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.

Barnaby Martin, Daniël Paulusma, Siani Smith

Theor. Comput. Sci., 2022

Disjoint paths and connected subgraphs for <i>H</i>-free graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2022

Partitioning <i>H</i>-free graphs of bounded diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Theor. Comput. Sci., 2022

Hard problems that quickly become very easy.

Barnaby Martin, Daniël Paulusma, Siani Smith

Inf. Process. Lett., 2022

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.

Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Complexity Framework For Forbidden Subgraphs.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.

Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

CoRR, 2022

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith

Electron. J. Comb., 2022

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

The Complexity of L(p, q)-Edge-Labelling.

Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the WALCOM: Algorithms and Computation, 2022

Few Induced Disjoint Paths for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Partitioning H-Free Graphs of Bounded Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

QCSP on Reflexive Tournaments.

Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Injective Colouring for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Computer Science - Theory and Applications, 2021

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles.

Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Colouring H-Free Graphs of Bounded Diameter.

Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019