Mark Weyer

14 papers A* 1B 2Misc 1Journal 5Unranked 5
YearRankTypeTitle / Venue / Authors
2014 J jnl
Decidability Results for the Boundedness Problem.
Log. Methods Comput. Sci.
Achim Blumensath, Martin Otto, Mark Weyer
2012 J jnl
Tree-width for first order formulae
Log. Methods Comput. Sci.
Isolde Adler, Mark Weyer
2011 J jnl
Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2009 — conf
Boundedness of Monadic Second-Order Formulae over Finite Words.
ICALP (2)
Achim Blumensath, Martin Otto, Mark Weyer
2009 B conf
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
CSL
Albert Atserias, Mark Weyer
2009 B conf
Tree-Width for First Order Formulae.
CSL
Isolde Adler, Mark Weyer
2008 — conf
Understanding the Complexity of Induced Subgraph Isomorphisms.
ICALP (1)
Yijia Chen, Marc Thurley, Mark Weyer
2007 J jnl
Bounded fixed-parameter tractability and reducibility.
Ann. Pure Appl. Log.
Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
2007 Misc conf
Quadratic Kernelization for Convex Recoloring of Trees.
COCOON
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2006 J jnl
Bounded fixed-parameter tractability and log
J. Comput. Syst. Sci.
Jörg Flum, Martin Grohe, Mark Weyer
2006 — conf
Kernelization for Convex Recoloring.
ACiD
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2004 A* conf
Bounded Fixed-Parameter Tractability and log
ICALP
Jörg Flum, Martin Grohe, Mark Weyer
2004 — conf
Bounded Fixed-Parameter Tractability: The Case 2poly(k).
IWPEC
Mark Weyer
2001 — conf
Decidability of S1S and S2S.
Automata, Logics, and Infinite Games
Mark Weyer