The following pages link to Mark Weyer (Q639282):
Displaying 14 items.
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Decidability Results for the Boundedness Problem (Q2878748) (← links)
- Tree-width for first order formulae (Q2881100) (← links)
- Understanding the Complexity of Induced Subgraph Isomorphisms (Q3521949) (← links)
- Quadratic Kernelization for Convex Recoloring of Trees (Q3608834) (← links)
- Boundedness of Monadic Second-Order Formulae over Finite Words (Q3638086) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- Decidability of S1S and S2S (Q4412835) (← links)
- Parameterized and Exact Computation (Q5311525) (← links)
- (Q5451198) (← links)
- Automata, Languages and Programming (Q5466493) (← links)
