As an easy example of divide, prune, and conquer, we give an output-sensitive O(n log k)-time algorithm to compute, for n intervals, a maximum independent set of size k.

Let X1, X2, . . . , Xn be independent random variables and Sk = Pk i=1 Xi. We show that for any constants ak, P( max 1≤k≤n ||Sk| − ak| > 11t) ≤ 30 max 1≤k≤n P(||Sk| − ak| > t). We also discuss similar inequalities for sums of Hilbert and Banach space valued random vectors.

We study the problem of estimating the number of edges in a graph with access to only an independent set oracle. Independent set queries draw motivation from group testing and have applications to the complexity of decision versus counting problems. We give two algorithms to estimate the number of edges in an n-vertex graph: one that uses only polylog(n) bipartite independent set queries, and a...

Has the MIS discipline matured enough to be considered a paradigm? This paper will review the MIS discipline from its inception, arguing that the discipline was created by what Thomas Kuhn would call a revolution leading to a paradigm shift. Using Kuhnian philosophy, the paper will argue that the MIS discipline has now reached a point to be considered a paradigm, according to the standards set ...

This article offers a set of guidelines to assist project leaders when managing virtual project teams. The guidelines were developed as a result of a panel at the celebration of the 30 anniversary of the founding of the MIS department at the University of Arizona. These guidelines include recommendations for addressing challenges that occur over the virtual team project life cycle, including id...

We consider the binding numbers of Kr-free graphs, and improve upper bounds on the binding number which force a graph to contain a clique of order r. For the case r = 4, we provide a construction for K4-free graphs which have a larger binding number than previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.

I review the phenomenology of new physics in low energy processes using the notion of minimal flavor violation (vs. non-minimal flavor violation). I compare the predictions of beyond-the-standard models and show that among certain observables in rare b-decays pattern arise, which allow to distinguish between extensions of the Standard Model. I discuss the status and future of the model independ...

In the k-dispersion problem, we need to select k nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalization of the independent set problem, where the goal is to select nodes so that the minimum distance is larger than 1. We design an optimal O(n) time algorithm for the dispersion problem on trees consisting of n nodes, thus i...