Siani Smith - RankMe

52 papers A 2B 9C 5Misc 1Journal 34Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. Algorithmica Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2025	J	`jnl`	A forbidden subgraph study for cut problems on graphs permitting loops and multiedges. CoRR Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Acyclic, star and injective colouring: A complexity picture for H-free graphs. J. Comput. Syst. Sci. Jan Bok, Nikola Jedlicková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	B	`conf`	Finding d-Cuts in Claw-Free Graphs. ISAAC Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Finding d-Cuts in Claw-free Graphs. CoRR Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2024	B	`conf`	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024	C	`conf`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	—	`conf`	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	Finding CoRR Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	B	`conf`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. WG Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	C	`conf`	Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CiE Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
2024	J	`jnl`	Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark H. Siggers, Siani Smith
2023	B	`conf`	Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Few induced disjoint paths for Theor. Comput. Sci. Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	The Complexity of L(p, q)-Edge-Labelling. Algorithmica Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. Theor. Comput. Sci. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Colouring graphs of bounded diameter in the absence of small cycles. Discret. Appl. Math. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Complexity Framework For Forbidden Subgraphs. CoRR Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Disjoint paths and connected subgraphs for Theor. Comput. Sci. Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2022	C	`conf`	Few Induced Disjoint Paths for H-Free Graphs. ISCO Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Few Induced Disjoint Paths for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Hard problems that quickly become very easy. Inf. Process. Lett. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	B	`conf`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Partitioning Theor. Comput. Sci. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
2022	B	`conf`	The Complexity of L(p, q)-Edge-Labelling. WALCOM Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	B	`conf`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2021	C	`conf`	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CIAC Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2021	C	`conf`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	J	`jnl`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	Misc	`conf`	Injective Colouring for H-Free Graphs. CSR Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	B	`conf`	Partitioning H-Free Graphs of Bounded Diameter. ISAAC Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Partitioning H-Free Graphs of Bounded Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	A	`conf`	QCSP on Reflexive Tournaments. ESA Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2021	J	`jnl`	QCSP on Reflexive Tournaments. CoRR Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2020	A	`conf`	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	Hard Problems That Quickly Become Very Easy. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	The complexity of L(p, q)-Edge-Labelling. CoRR Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2019	B	`conf`	Colouring H-Free Graphs of Bounded Diameter. MFCS Barnaby Martin, Daniël Paulusma, Siani Smith