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...

One can define the independence polynomial of a graph G as follows. Let ik(G) denote the number of independent sets of size k of G, where i0(G) = 1. Then the independence polynomial of G is

A transversal matroid M can be represented by a collection of sets, called a presentation of M , whose partial transversals are the independent sets of M . Minimal presentations are those for which removing any element from any set gives a presentation of a different matroid. We study the connections between (single-element) transversal extensions of M and extensions of presentations of M . We ...

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

A dominating set S of a graph G is a global (strong) defensive alliance if for every vertex v ∈ S, the number of neighbors v has in S plus one is at least (greater than) the number of neighbors it has in V \ S. The dominating set S is a global (strong) offensive alliance if for every vertex v ∈ V \ S, the number of neighbors v has in S is at least (greater than) the number of neighbors it has i...