The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Switched linear systems have a long history of interest in the control community, and have attracted considerable attention recently because they are not only practically relevant...
We develop new confidence-interval estimators for the mean and variance parameter of a steady-state simulation output process. These confidence intervals are based on optimal li...
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...