Connectivity threshold and recovery time in rank-based models for complex networks Fulltext Access 8 Pages 2011
A new characterization of projections of quadrics in finite projective spaces of even characteristic Fulltext Access 8 Pages 2011
Vertex coloring complete multipartite graphs from random lists of size 2 Fulltext Access 8 Pages 2011
On the existence of kk-partite or KpKp-free total domination edge-critical graphs Fulltext Access 8 Pages 2011
NN-flips in even triangulations on the torus and Dehn twists preserving monodromies Fulltext Access 8 Pages 2011
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle Fulltext Access 8 Pages 2011
The 2-extendability of 5-connected graphs on surfaces with large representativity Fulltext Access 8 Pages 2011
Minimizing total completion time for re-entrant flow shop scheduling problems Fulltext Access 8 Pages 2011
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem Fulltext Access 8 Pages 2011
Some inequalities for the atom-bond connectivity index of graph operations Fulltext Access 8 Pages 2011
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances Fulltext Access 8 Pages 2011
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength Fulltext Access 8 Pages 2011
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem Fulltext Access 8 Pages 2011
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems Fulltext Access 8 Pages 2011
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes Fulltext Access 8 Pages 2011
Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks Fulltext Access 8 Pages 2011
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions Fulltext Access 8 Pages 2011
Edge connectivity in difference graphs and some new constructions of partial sum families Fulltext Access 9 Pages 2011
Maximal independent sets in bipartite graphs obtained from Boolean lattices Fulltext Access 9 Pages 2011