Mark Weyer

Publication Activity (10 Years)

Years Active: 2001-2014
Publications (10 Years): 0

Top Topics

Relational Structures

Computationally Challenging

Top Venues

Log. Methods Comput. Sci.

Publications

Achim Blumensath, Martin Otto, Mark Weyer
Decidability Results for the Boundedness Problem. Log. Methods Comput. Sci. 10 (3) (2014)
Isolde Adler, Mark Weyer
Tree-width for first order formulae Log. Methods Comput. Sci. 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) (2011)
Achim Blumensath, Martin Otto, Mark Weyer
Boundedness of Monadic Second-Order Formulae over Finite Words. ICALP (2) (2009)
Albert Atserias, Mark Weyer
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. CSL (2009)
Isolde Adler, Mark Weyer
Tree-Width for First Order Formulae. CSL (2009)
Yijia Chen, Marc Thurley, Mark Weyer
Understanding the Complexity of Induced Subgraph Isomorphisms. ICALP (1) (2008)
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)
Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. 148 (1-3) (2007)
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
Kernelization for Convex Recoloring. ACiD (2006)
Jörg Flum, Martin Grohe, Mark Weyer
nondeterministic bits. J. Comput. Syst. Sci. 72 (1) (2006)
Mark Weyer
Bounded Fixed-Parameter Tractability: The Case 2poly(k). IWPEC (2004)
Jörg Flum, Martin Grohe, Mark Weyer
n Nondeterministic Bits. ICALP (2004)
Mark Weyer
Decidability of S1S and S2S. Automata, Logics, and Infinite Games (2001)