An application of Tutte’s Theorem to 1-factorization of regular graphs of high degree Fulltext Access 10 Pages 2009
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA’s Fulltext Access 10 Pages 2009
Some topological properties of star graphs: The surface area and volume Fulltext Access 10 Pages 2009
On a pp-adic interpolation function for the qq-extension of the generalized Bernoulli polynomials and its derivative Fulltext Access 10 Pages 2009
Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 Fulltext Access 10 Pages 2009
The complexity of the L(p,q)L(p,q)-labeling problem for bipartite planar graphs of small degree Fulltext Access 10 Pages 2009
Chromatic classes of 2-connected (n,n+4)(n,n+4)-graphs with three triangles and one induced 4-cycle Fulltext Access 10 Pages 2009
Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers Fulltext Access 10 Pages 2009
Generalization of transitive fraternal augmentations for directed graphs and its applications Fulltext Access 10 Pages 2009
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm Fulltext Access 10 Pages 2009
The signless Laplacian spectral radius of graphs with given degree sequences Fulltext Access 10 Pages 2009
Neighborhood hypergraphs of digraphs and some matrix permutation problems Fulltext Access 10 Pages 2009
Algebraic and topological closure conditions for classes of pseudo-Boolean functions Fulltext Access 10 Pages 2009
Bernoulli polynomials and Pascal matrices in the context of Clifford analysis Fulltext Access 10 Pages 2009
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem Fulltext Access 10 Pages 2009
Approximation algorithms for the weighted independent set problem in sparse graphs Fulltext Access 10 Pages 2009
The upper connected geodetic number and forcing connected geodetic number of a graph Fulltext Access 10 Pages 2009
Lower bounds for three algorithms for transversal hypergraph generation Fulltext Access 10 Pages 2009
Consistency of the QNet algorithm for generating planar split networks from weighted quartets Fulltext Access 10 Pages 2009
A computational model for tiling recognizable two-dimensional languages Fulltext Access 10 Pages 2009
Efficient algorithms for two generalized 2-median problems and the group median problem on trees Fulltext Access 10 Pages 2009
A 5+ϵ-approximation algorithm for minimum weighted dominating set in unit disk graph Fulltext Access 10 Pages 2009
A note on universal composable zero-knowledge in the common reference string model Fulltext Access 10 Pages 2009
A new constraint-based description of the steady-state flux cone of metabolic networks Fulltext Access 10 Pages 2009
On the size of computationally complete hybrid networks of evolutionary processors Fulltext Access 10 Pages 2009
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs Fulltext Access 10 Pages 2009