Mark Weyer

Isolde Adler, Mark Weyer: Tree-width for first order formulae. Logical Methods in Computer Science 8(1) (2012)

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

Isolde Adler, Mark Weyer: Tree-Width for First Order Formulae. CSL 2009: 71-85

Albert Atserias, Mark Weyer: Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. CSL 2009: 102-116

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

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

Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007)

Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96

Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and log²n nondeterministic bits. J. Comput. Syst. Sci. 72(1): 34-71 (2006)

Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Kernelization for Convex Recoloring. ACiD 2006: 23-35

Jörg Flum, Martin Grohe, Mark Weyer: Bounded Fixed-Parameter Tractability and log²n Nondeterministic Bits. ICALP 2004: 555-567

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

Mark Weyer: Decidability of S1S and S2S. Automata, Logics, and Infinite Games 2001: 207-230