11740 search results - page 397 / 2348 » More Problems in Rewriting |
170
click to vote
IJCM
2008
15 years 6 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
101
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid Tn is precisely n + 1; more recently Balogh, Mubayi, and Pluh´ar posed the problem ...
139
Voted
JSS
2006
15 years 6 months ago
2006
This article introduces the entity-life modeling (ELM) design approach for multithread software. The article focuses on problems that can be described by state machines with assoc...
151
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more g...
178
click to vote
DM
2002
15 years 6 months ago
2002
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...