An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances Fulltext Access 13 Pages 2016
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems Fulltext Access 13 Pages 2016
Radiative heat transfer of variable viscosity and thermal conductivity effects on inclined magnetic field with dissipation in a non-Darcy medium Fulltext Access 14 Pages 2016
Counting houses of Pareto optimal matchings in the house allocation problem Fulltext Access 14 Pages 2016
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search Fulltext Access 14 Pages 2016
Improved approximation algorithms for some min-max and minimum cycle cover problems Fulltext Access 14 Pages 2016
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes-Part I Fulltext Access 14 Pages 2016
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers Fulltext Access 14 Pages 2016
Deterministic local algorithms, unique identifiers, and fractional graph colouring Fulltext Access 14 Pages 2016
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost Fulltext Access 14 Pages 2016
Query-competitive algorithms for cheapest set problems under uncertainty Fulltext Access 14 Pages 2016
On-line maximum matching in complete multi-partite graphs with an application to optical networks Fulltext Access 14 Pages 2016
Melting heat transfer effects on stagnation point flow of micropolar fluid with variable dynamic viscosity and thermal conductivity at constant vortex viscosity Fulltext Access 14 Pages 2016
A Unified Procedure for Provability and Counter-Model Generation in Minimal Implicational Logic Fulltext Access 15 Pages 2016
Lower and upper competitive bounds for online directed graph exploration Fulltext Access 15 Pages 2016
Minimum vertex cover in generalized random graphs with power law degree distribution Fulltext Access 15 Pages 2016
Reduction rules for the maximum parsimony distance on phylogenetic trees Fulltext Access 15 Pages 2016
The mu vector, Morse inequalities and a generalized lower bound theorem for locally tame combinatorial manifolds Fulltext Access 15 Pages 2016
Linking rings structures and semisymmetric graphs: Cayley constructions Fulltext Access 15 Pages 2016
Model-based Dynamic Control of Speculative Forays in Parallel Computation Fulltext Access 15 Pages 2016
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length Fulltext Access 15 Pages 2016
Nonparametric multiple change point estimation in highly dependent time series Fulltext Access 15 Pages 2016
Kernelization complexity of possible winner and coalitional manipulation problems in voting Fulltext Access 15 Pages 2016
Classification of quartic half-arc-transitive weak metacirculants of girth at most 4 Fulltext Access 15 Pages 2016
Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes Fulltext Access 15 Pages 2016
Stochastic Pruning and Its Application for Fast Estimation of the Expected Total Output of Complex Systems Fulltext Access 15 Pages 2016
The Incremental Satisfiability Problem for a Two Conjunctive Normal Form Fulltext Access 15 Pages 2016
Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams Fulltext Access 15 Pages 2016
Implementing generating functions to obtain power indices with coalition configuration Fulltext Access 15 Pages 2016
Reducibilities among equivalence relations induced by recursively enumerable structures Fulltext Access 16 Pages 2016
Exact and approximate algorithms for movement problems on (special classes of) graphs Fulltext Access 16 Pages 2016
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations Fulltext Access 16 Pages 2016
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families Fulltext Access 16 Pages 2016
On the choice number of complete multipartite graphs with part size four Fulltext Access 16 Pages 2016