Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
1 Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and r...
Don S. Batory, Vivek Singhal, Marty Sirkin, Jeff T...
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...