Mark Weyer

According to our database, Mark Weyer authored at least 12 papers between 2001 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Decidability Results for the Boundedness Problem.

Achim Blumensath, Martin Otto, Mark Weyer

Log. Methods Comput. Sci., 2014

2012

Tree-width for first order formulae

Isolde Adler, Mark Weyer

Log. Methods Comput. Sci., 2012

2011

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

2009

Boundedness of Monadic Second-Order Formulae over Finite Words.

Achim Blumensath, Martin Otto, Mark Weyer

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.

Albert Atserias, Mark Weyer

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Understanding the Complexity of Induced Subgraph Isomorphisms.

Yijia Chen, Marc Thurley, Mark Weyer

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Bounded fixed-parameter tractability and reducibility.

Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer

Ann. Pure Appl. Log., 2007

2006

Bounded fixed-parameter tractability and log²<i>n</i> nondeterministic bits.

Jörg Flum, Martin Grohe, Mark Weyer

J. Comput. Syst. Sci., 2006

Kernelization for Convex Recoloring.

Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004

Bounded Fixed-Parameter Tractability: The Case 2poly(k).

Mark Weyer

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Bounded Fixed-Parameter Tractability and log²n Nondeterministic Bits.

Jörg Flum, Martin Grohe, Mark Weyer

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2001

Decidability of S1S and S2S.

Mark Weyer

Proceedings of the Automata, 2001