We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Abstract. One approach to system development is to decompose the requirements into features and specify the individual features before composing them. A major limitation of deferri...
Robin C. Laney, Thein Than Tun, Michael Jackson, B...