Codes over affine algebras with a finite commutative chain coefficient ring Fulltext Access 14 Pages 2018
The waiting time distribution for a correlated queue with exponential interarrival and service times Fulltext Access 14 Pages 2018
On active redundancy allocation for coherent systems-from the viewpoint of minimal cut decomposition Fulltext Access 15 Pages 2018
Complete formulations of polytopes related to extensions of assignment matrices Fulltext Access 15 Pages 2018
Total dominating sequences in trees, split graphs, and under modular decomposition Fulltext Access 15 Pages 2018
Random 4-regular graphs have 3-star decompositions asymptotically almost surely Fulltext Access 15 Pages 2018
Countable linear orders with disjoint infinite intervals are mutually orthogonal Fulltext Access 15 Pages 2018
Parallel algorithms for enumerating closed patterns from multi-relational data Fulltext Access 15 Pages 2018
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs Fulltext Access 15 Pages 2018
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty Fulltext Access 15 Pages 2018
Conditional edge-fault-tolerant Hamiltonicity of the data center network Fulltext Access 15 Pages 2018
Enumeration and maximum number of minimal connected vertex covers in graphs Fulltext Access 16 Pages 2018
On the approximability of the maximum interval constrained coloring problem Fulltext Access 16 Pages 2018
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms Fulltext Access 16 Pages 2018
Pricing and horizontal information sharing in a supply chain with capacity constraint Fulltext Access 16 Pages 2018
Fixed points and adjacent ascents for classical complex reflection groups Fulltext Access 16 Pages 2018
Strongly connected synchronizing automata and the language of minimal reset words Fulltext Access 16 Pages 2018
On compatibility and incompatibility of collections of unrooted phylogenetic trees Fulltext Access 17 Pages 2018
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 Fulltext Access 17 Pages 2018
Hardness and approximation of the asynchronous border minimization problem Fulltext Access 17 Pages 2018