The complexity of counting locally maximal satisfying assignments of Boolean CSPs Fulltext Access 12 Pages 2016
Approximation algorithm for the balanced 2-connected k-partition problem Fulltext Access 12 Pages 2016
Bounds and constructions for optimal (n,{3,5},Λa,1,Q)(n,{3,5},Λa,1,Q)-OOCs Fulltext Access 12 Pages 2016
Simultaneous visibility representations of plane st-graphs using L-shapes Fulltext Access 12 Pages 2016
Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles Fulltext Access 12 Pages 2016
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking Fulltext Access 13 Pages 2016
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings Fulltext Access 13 Pages 2016
An analysis for strength improvement of an MCTS-based program playing Chinese dark chess Fulltext Access 13 Pages 2016
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains Fulltext Access 13 Pages 2016
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 Fulltext Access 13 Pages 2016
Enumerating minimal connected dominating sets in graphs of bounded chordality Fulltext Access 13 Pages 2016
On the further relation between the (revised) Szeged index and the Wiener index of graphs Fulltext Access 13 Pages 2016
Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations Fulltext Access 13 Pages 2016
Lower bounds for the independence and kk-independence number of graphs using the concept of degenerate degrees Fulltext Access 13 Pages 2016
A family of efficient six-regular circulants representable as a Kronecker product Fulltext Access 13 Pages 2016
Relations between robustness and RKA security under public-key encryption Fulltext Access 14 Pages 2016
Robustness of f- and g-generated Fuzzy (Co)Implications: The Yager's (Co)Implication Case Study Fulltext Access 14 Pages 2016
Polyhedral combinatorics of the K-partitioning problem with representative variables Fulltext Access 14 Pages 2016
A constructive bandwidth reduction algorithm-A variant of GPS algorithm Fulltext Access 14 Pages 2016
Nowhere-zero 3-flows and Z3Z3-connectivity of graphs without two forbidden subgraphs Fulltext Access 14 Pages 2016
Large subsets of discrete hypersurfaces in Zd contain arbitrarily many collinear points Fulltext Access 14 Pages 2016
Constructing new covering arrays from LFSR sequences over finite fields Fulltext Access 14 Pages 2016
Similarity solution of 3D Casson nanofluid flow over a stretching sheet with convective boundary conditions Fulltext Access 14 Pages 2016
An efficient algorithm to construct disjoint path covers of DCell networks Fulltext Access 14 Pages 2016
MARLEDA: Effective distribution estimation through Markov random fields Fulltext Access 15 Pages 2016
Constructing minimum changeover cost arborescenses in bounded treewidth graphs Fulltext Access 15 Pages 2016
Representations of Uq(Lsl2)Uq(Lsl2) at roots of unity and generalised cluster algebras Fulltext Access 15 Pages 2016
Set systems with kk-wise LL-intersections and codes with restricted Hamming distances Fulltext Access 15 Pages 2016
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover Fulltext Access 15 Pages 2016
Combinatorial conjectures that imply local log-concavity of graph genus polynomials Fulltext Access 16 Pages 2016
Reeb graph based segmentation of articulated components of 3D digital objects Fulltext Access 16 Pages 2016
Existence of finite test-sets for k-power-freeness of uniform morphisms Fulltext Access 16 Pages 2016
Polymerization and crystallization of Snowflake molecules in Domineering Fulltext Access 16 Pages 2016
Adaptive playouts for online learning of policies during Monte Carlo Tree Search Fulltext Access 16 Pages 2016
Interpretations on Quantum Fuzzy Computing: Intuitionistic Fuzzy Operations à Quantum Operators Fulltext Access 16 Pages 2016
A Practical Semi-External Memory Method for Approximate Pattern Matching Fulltext Access 16 Pages 2016
Fast approximation for computing the fractional arboricity and extraction of communities of a graph Fulltext Access 17 Pages 2016