Mark Weyer

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Decidability Results for the Boundedness Problem.
Log. Methods Comput. Sci., 2014

2012
Tree-width for first order formulae
Log. Methods Comput. Sci., 2012

2011
Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica, 2011

2009
Boundedness of Monadic Second-Order Formulae over Finite Words.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Understanding the Complexity of Induced Subgraph Isomorphisms.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Bounded fixed-parameter tractability and reducibility.
Ann. Pure Appl. Log., 2007

2006
Bounded fixed-parameter tractability and log<sup>2</sup><i>n</i> nondeterministic bits.
J. Comput. Syst. Sci., 2006

Kernelization for Convex Recoloring.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004
Bounded Fixed-Parameter Tractability: The Case 2poly(k).
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Bounded Fixed-Parameter Tractability and log<sup>2</sup>n Nondeterministic Bits.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2001
Decidability of S1S and S2S.
Proceedings of the Automata, 2001


  Loading...