 | 2009 |
|---|
| 11 |       | Albert Atserias,
Mark Weyer:
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
CSL 2009: 102-116 |
| 10 | | Isolde Adler,
Mark Weyer:
Tree-Width for First Order Formulae.
CSL 2009: 71-85 |
| 9 | | Achim Blumensath,
Martin Otto,
Mark Weyer:
Boundedness of Monadic Second-Order Formulae over Finite Words.
ICALP (2) 2009: 67-78 |
| 2008 |
|---|
| 8 | | Yijia Chen,
Marc Thurley,
Mark Weyer:
Understanding the Complexity of Induced Subgraph Isomorphisms.
ICALP (1) 2008: 587-596 |
| 2007 |
|---|
| 7 | | 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 |
| 6 | | 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) |
| 2006 |
|---|
| 5 |  | 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 |
| 4 | | Jörg Flum,
Martin Grohe,
Mark Weyer:
Bounded fixed-parameter tractability and log2n nondeterministic bits.
J. Comput. Syst. Sci. 72(1): 34-71 (2006) |
| 2004 |
|---|
| 3 | | Jörg Flum,
Martin Grohe,
Mark Weyer:
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits.
ICALP 2004: 555-567 |
| 2 | | Mark Weyer:
Bounded Fixed-Parameter Tractability: The Case 2poly(k).
IWPEC 2004: 49-60 |
| 2001 |
|---|
| 1 | | Mark Weyer:
Decidability of S1S and S2S.
Automata, Logics, and Infinite Games 2001: 207-230 |
