On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square Fulltext Access 11 Pages 2013
On the number of update digraphs and its relation with the feedback arc sets and tournaments Fulltext Access 11 Pages 2013
A tight upper bound for 2-rainbow domination in generalized Petersen graphs Fulltext Access 11 Pages 2013
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs Fulltext Access 11 Pages 2013
A new dichotomic algorithm for the uniform random generation of words in regular languages Fulltext Access 12 Pages 2013
Economic models for cloud service markets: Pricing and Capacity planning Fulltext Access 12 Pages 2013
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions Fulltext Access 12 Pages 2013
Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs Fulltext Access 12 Pages 2013
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines 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
SFERA: A Simulation Framework for the Performance Evaluation of Restart Algorithms in Service-Oriented Systems 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
On the time and the bit complexity of distributed randomised anonymous ring colouring Fulltext Access 12 Pages 2013
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case Fulltext Access 12 Pages 2013
LAD models, trees, and an analog of the fundamental theorem of arithmetic Fulltext Access 12 Pages 2013
An atlas of limit set dynamics for asynchronous elementary cellular automata Fulltext Access 12 Pages 2013
Graph classes with structured neighborhoods and algorithmic applications Fulltext Access 12 Pages 2013
Towards Security Assurance in Round-Trip Engineering: A Type-Based Approach Fulltext Access 12 Pages 2013