Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study Fulltext Access 11 Pages 2013
A negative answer to Bracken–Tan–Tan's problem on differentially 4-uniform permutations over F2nF2n Fulltext Access 11 Pages 2013
Using Noonan–Zeilberger Functional Equations to enumerate (in polynomial time!) generalized Wilf classes Fulltext Access 11 Pages 2013
The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2 Fulltext Access 12 Pages 2013
The inverse {0,1}{0,1}-knapsack problem: Theory, algorithms and computational experiments Fulltext Access 12 Pages 2013
Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs Fulltext Access 12 Pages 2013
Single-machine common due window assignment and scheduling to minimize the total cost Fulltext Access 12 Pages 2013
Families of polytopal digraphs that do not satisfy the shelling property Fulltext Access 12 Pages 2013
Discrete tomography determination of bounded lattice sets from four X-rays Fulltext Access 12 Pages 2013
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections Fulltext Access 12 Pages 2013
From kernels in directed graphs to fixed points and negative cycles in Boolean networks Fulltext Access 12 Pages 2013
A linear-time algorithm for finding an edge-partition with max-min ratio at most two Fulltext Access 12 Pages 2013
LAD models, trees, and an analog of the fundamental theorem of arithmetic Fulltext Access 12 Pages 2013
Establishing strong connectivity using optimal radius half-disk antennas Fulltext Access 12 Pages 2013
A novel approach for leveraging co-occurrence to improve the false positive error in signature files Fulltext Access 12 Pages 2013
Towards Security Assurance in Round-Trip Engineering: A Type-Based Approach Fulltext Access 12 Pages 2013
SFERA: A Simulation Framework for the Performance Evaluation of Restart Algorithms in Service-Oriented Systems Fulltext Access 12 Pages 2013
Formalization and Verification of Behavioral Correctness of Dynamic Software Updates Fulltext Access 12 Pages 2013
The relationship between the eccentric connectivity index and Zagreb indices Fulltext Access 12 Pages 2013
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth Fulltext Access 12 Pages 2013
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines Fulltext Access 12 Pages 2013
Approximation of a closed polygon with a minimum number of circular arcs and line segments Fulltext Access 13 Pages 2013
Finding lower bounds on the complexity of secret sharing schemes by linear programming Fulltext Access 13 Pages 2013