Decidability of S1S and S2S. - Mark Weyer (Automata, Logics, and Infinite Games, 2001)

Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. - Jörg Flum; Martin Grohe; Mark Weyer (ICALP, 2004)

Bounded Fixed-Parameter Tractability: The Case 2poly(k). - Mark Weyer (IWPEC, 2004)

Kernelization for Convex Recoloring. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (ACiD, 2006)

Bounded fixed-parameter tractability and log2n nondeterministic bits. - Jörg Flum; Martin Grohe; Mark Weyer (J. Comput. Syst. Sci., 2006)

Bounded fixed-parameter tractability and reducibility. - Rod Downey; Jörg Flum; Martin Grohe; Mark Weyer (Ann. Pure Appl. Log., 2007)

Understanding the Complexity of Induced Subgraph Isomorphisms. - Yijia Chen 001; Marc Thurley; Mark Weyer (ICALP (1), 2008)

Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. - Albert Atserias; Mark Weyer (CSL, 2009)

Boundedness of Monadic Second-Order Formulae over Finite Words. - Achim Blumensath; Martin Otto 001; Mark Weyer (ICALP (2), 2009)

Quadratic Kernelization for Convex Recoloring of Trees. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (Algorithmica, 2011)

Tree-width for first order formulae - Isolde Adler; Mark Weyer (Log. Methods Comput. Sci., 2012)

Decidability Results for the Boundedness Problem. - Achim Blumensath; Martin Otto 001; Mark Weyer (Log. Methods Comput. Sci., 2014)