Alexander Scott

12 papers Misc 1Journal 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distant Digraph Domination.
Electron. J. Comb.
Tung Nguyen, Alexander Scott, Paul D. Seymour
2024 J jnl
Clique covers of H-free graphs.
Eur. J. Comb.
Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé
2016 J jnl
The parameterised complexity of list problems on graphs of bounded treewidth.
Inf. Comput.
Kitty Meeks, Alexander Scott
2014 J jnl
Spanning Trees and the Complexity of Flood-Filling Games.
Theory Comput. Syst.
Kitty Meeks, Alexander Scott
2013 J jnl
The complexity of Free-Flood-It on 2×n boards.
Theor. Comput. Sci.
Kitty Meeks, Alexander Scott
2012 Misc conf
Spanning Trees and the Complexity of Flood-Filling Games.
FUN
Kitty Meeks, Alexander Scott
2012 J jnl
Spanning trees and the complexity of flood-filling games
CoRR
Kitty Meeks, Alexander Scott
2012 J jnl
The complexity of flood-filling games on graphs.
Discret. Appl. Math.
Kitty Meeks, Alexander Scott
2011 J jnl
Szemerédi's Regularity Lemma for Matrices and Sparse Graphs.
Comb. Probab. Comput.
Alexander Scott
2011 J jnl
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
CoRR
Kitty Meeks, Alexander Scott
2011 J jnl
The complexity of Free-Flood-It on 2xn boards
CoRR
Kitty Meeks, Alexander Scott
2011 J jnl
The complexity of flood-filling games on graphs
CoRR
Kitty Meeks, Alexander Scott