Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings Fulltext Access 9 Pages 2013
Spectra of graphs obtained by a generalization of the join graph operation Fulltext Access 9 Pages 2013
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 Fulltext Access 9 Pages 2013
On the non-existence of tight Gaussian 6-designs on two concentric spheres Fulltext Access 9 Pages 2013
Structure of repeated-root constacyclic codes of length 3ps3ps and their duals Fulltext Access 9 Pages 2013
A characterization of the edge connectivity of direct products of graphs Fulltext Access 9 Pages 2013
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks Fulltext Access 10 Pages 2013
On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs Fulltext Access 10 Pages 2013
Constructions for large sets of vâ1 Â {0,v3}-intersecting Steiner triple systems of order v Fulltext Access 10 Pages 2013
Isometric embeddings of the near polygons Hn and Gn into dual polar spaces Fulltext Access 10 Pages 2013
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing Fulltext Access 10 Pages 2013
Moderately exponential approximation for makespan minimization on related machines Fulltext Access 10 Pages 2013
On an extension of the Sort & Search method with application to scheduling theory Fulltext Access 10 Pages 2013
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane Fulltext Access 10 Pages 2013
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons Fulltext Access 10 Pages 2013
On the number of non-dominated points of a multicriteria optimization problem Fulltext Access 10 Pages 2013
An extension of A.R. Rao’s characterization of potentially Km+1Km+1-graphic sequences Fulltext Access 10 Pages 2013
On the complexity of computing the temporal hybridization number for two phylogenies Fulltext Access 10 Pages 2013
NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games Fulltext Access 10 Pages 2013
Strategy-proof approximation mechanisms for an obnoxious facility game on networks Fulltext Access 10 Pages 2013
Nordhaus–Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts Fulltext Access 10 Pages 2013
Fault-tolerant path embedding in folded hypercubes with both node and edge faults Fulltext Access 10 Pages 2013
Universality of sequential spiking neural P systems based on minimum spike number Fulltext Access 10 Pages 2013
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time Fulltext Access 10 Pages 2013
Fault isolation and identification in general biswapped networks under the PMC diagnostic model Fulltext Access 10 Pages 2013
On the weak computability of a four dimensional orthogonal packing and time scheduling problem Fulltext Access 10 Pages 2013