On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on parameters that measure the structural properties of the input instance. We first show that the problem is W[1]-hard parameterized by a wide range of fairly restrictive structural parameters such as the feedback vertex set number, pathwidth, treedepth, and even the size of a minimum vertex deletion set into graphs of pathwidth and treedepth at most three. We thereby resolve an open question stated in Betzler, Bredereck, Niedermeier and Uhlmann (2012) concerning the complexity of BDD parameterized by the feedback vertex set number. On the positive side, we obtain fixed-parameter algorithms for the problem with respect to the decompositional parameter treecut width and a novel problem-specific parameter called the core fracture number

Ideology in Policy Debates: Congress and the S&Ls in the 1980s

Is a national value such as free enterprise relevant to congressional debates of important economic policy bills? This question was examined using debates of three reform bills that dealt with savings and loan industry problems in the 1980s. To employ free enterprise concepts in justifying policy stands challenged legislators because industry problems contrasted sharply in the early 1980s (overregulation) and later (excesses under deregulation). Research demonstrated, however, that free enterprise concepts dominated the earlier discussions and, intriguingly, were at the center of the 1989 debate about bailing out the industry and reforming it. The conclusion elaborates free enterprise's role and speculates about the influence of another national value on the S & L discussions. Copyright 1998 by The Policy Studies Organization.