Some subsets of points in the plane associated to truncated Reed–Muller codes with good parameters Fulltext Access 7 Pages 2006
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem Fulltext Access 7 Pages 2006
Arbitrarily large difference between d-strong chromatic index and its trivial lower bound Fulltext Access 7 Pages 2006
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation Fulltext Access 7 Pages 2006
Randomized vs. deterministic distance query strategies for point location on the line Fulltext Access 7 Pages 2006
The number of convex polyominoes and the generating function of Jacobi polynomials Fulltext Access 7 Pages 2006
The structure and unlabelled enumeration of toroidal graphs with no K3,3's Fulltext Access 8 Pages 2006
Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms 4 Fulltext Access 8 Pages 2006
Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph Fulltext Access 8 Pages 2006
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem Fulltext Access 8 Pages 2006
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes Fulltext Access 8 Pages 2006
Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs Fulltext Access 8 Pages 2006
Simple existence conditions for zero-one matrices with at most one structural zero in each row and column Fulltext Access 8 Pages 2006
Semi-local Model of Computations on Graphs to Break the Local Symmetry: Work in Progress Fulltext Access 8 Pages 2006
Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness Fulltext Access 8 Pages 2006
The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization Fulltext Access 8 Pages 2006
Compatible triangulations and point partitions by series-triangular graphs Fulltext Access 8 Pages 2006
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time Fulltext Access 8 Pages 2006
A linear time algorithm to list the minimal separators of chordal graphs Fulltext Access 8 Pages 2006