
Search the dblp DataBase
Mark Weyer:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP] ACiD, 2006, pp:2335 [Conf]
 Mark Weyer
Decidability of S1S and S2S. [Citation Graph (0, 0)][DBLP] Automata, Logics, and Infinite Games, 2001, pp:207230 [Conf]
 Jörg Flum, Martin Grohe, Mark Weyer
Bounded FixedParameter Tractability and log^{2}n Nondeterministic Bits. [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:555567 [Conf]
 Mark Weyer
Bounded FixedParameter Tractability: The Case 2poly(k). [Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:4960 [Conf]
 Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixedparameter tractability and log^{2}n nondeterministic bits. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:3471 [Journal]
 Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:8696 [Conf]
 Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixedparameter tractability and reducibility. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2007, v:148, n:13, pp:119 [Journal]
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
TreeWidth for First Order Formulae. [Citation Graph (, )][DBLP]
Understanding the Complexity of Induced Subgraph Isomorphisms. [Citation Graph (, )][DBLP]
Boundedness of Monadic SecondOrder Formulae over Finite Words. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
