Konferanseforedrag

• George Karypis; Christian Schulz; Michael Fellows et al. (2024). Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). (ekstern lenke)
• Michael Ralph Fellows; Frances Rosamond; Laurent Bulteau et al. (2021). Parameterized String Equations abs/2104.14171. (ekstern lenke)

Rettelse i tidsskrift

• Liming Cai; Jainer Chen; Rod Downey et al. (2018). Corrigendum to 'Advice classes of parameterized tractability' [Ann. Pure Appl. Logic 84 (1) (1997) 119-138] (S0168007295000208) (10.1016/S0168-0072(95)00020-8)). (ekstern lenke)

Vitenskapelig artikkel

• Benjamin Bergougnoux; Nello Blaser; Michael Ralph Fellows et al. (2025). On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. (ekstern lenke)
• Matthias Bentert; Michael Ralph Fellows; Petr Golovach et al. (2024). Breaking a Graph into Connected Components with Small Dominating Sets. (ekstern lenke)
• Emmanuel Sam; Michael Ralph Fellows; Frances Rosamond et al. (2023). On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. (ekstern lenke)
• Julien Baste; Michael Ralph Fellows; Lars Jaffke et al. (2022). Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. (ekstern lenke)
• Michael Ralph Fellows; Frances Rosamond (2021). Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. (ekstern lenke)
• Julien Baste; Michael Fellows; Lars Jaffke et al. (2020). Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. (ekstern lenke)
• Michael Fellows; Ariel Kulik; Frances Rosamond et al. (2018). Parameterized approximation via fidelity preserving transformations. (ekstern lenke)
• Michael Fellows; Frances Rosamond (2018). A brief history of Edward K. Blum and the Journal of Computer and System Sciences. (ekstern lenke)
• Michael Fellows (2017). Surfing with rod. (ekstern lenke)
• Michael Ralph Fellows; Fabio Protti; Frances Rosamond et al. (2017). Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. (ekstern lenke)
• Michael Fellows; Danny Hermelin; Frances Rosamond et al. (2016). Tractable parameterizations for the MINIMUM LINEAR ARRANGEMENT problem. (ekstern lenke)

Vitenskapelig monografi

• Frances Rosamond; Noam Greenberg; Michael Fellows et al. (2018). Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. (ekstern lenke)

Se en fullstendig oversikt over publikasjoner i NVA.