The Chvátal–Erdös condition for supereulerian graphs and the Hamiltonian index Fulltext Access 9 Pages 2010
Trees with a given order and matching number that have maximum general Randić index Fulltext Access 9 Pages 2010
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization Fulltext Access 9 Pages 2010
On the grassmann module of symplectic dual polar spaces of rank 4 in characteristic 3 Fulltext Access 9 Pages 2010
On cyclic semi-regular subgroups of certain 2-transitive permutation groups Fulltext Access 9 Pages 2010
Outer-embeddability in certain pseudosurfaces arising from three spheres Fulltext Access 9 Pages 2010
Dixon’s F23(1)-series and identities involving harmonic numbers and the Riemann zeta function Fulltext Access 9 Pages 2010
GBRDs over groups of orders ≤100≤100 or of order pqpq with pp, qq primes Fulltext Access 9 Pages 2010
Smallest counterexample to the 5-flow conjecture has girth at least eleven Fulltext Access 9 Pages 2010
An analogue of the Gallai–Edmonds Structure Theorem for non-zero roots of the matching polynomial Fulltext Access 9 Pages 2010
New tools for the construction of directed strongly regular graphs: Difference digraphs and partial sum families Fulltext Access 9 Pages 2010
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three Fulltext Access 9 Pages 2010
On conjugacies of the 3x+13x+1 map induced by continuous endomorphisms of the shift dynamical system Fulltext Access 9 Pages 2010
clever or smart: Strategies for the online target date assignment problem Fulltext Access 9 Pages 2010
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem Fulltext Access 9 Pages 2010
Degree conditions on distance 2 vertices that imply kk-ordered Hamiltonian Fulltext Access 9 Pages 2010
Use of the Szeged index and the revised Szeged index for measuring network bipartivity Fulltext Access 9 Pages 2010
Dynamic programming and planarity: Improved tree-decomposition based algorithms Fulltext Access 9 Pages 2010
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Fulltext Access 9 Pages 2010
Delaunay triangulation of imprecise points in linear time after preprocessing Fulltext Access 9 Pages 2010
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs Fulltext Access 9 Pages 2010
Functional codes arising from quadric intersections with Hermitian varieties Fulltext Access 9 Pages 2010
New structural properties of (s,S)(s,S) policies for inventory models with lost sales Fulltext Access 9 Pages 2010
A General VNS heuristic for the traveling salesman problem with time windows Fulltext Access 9 Pages 2010
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract) Fulltext Access 9 Pages 2010
On the approximation of the generalized capacitated tree-routing problem Fulltext Access 10 Pages 2010
Scheduling on same-speed processors with at most one downtime on each machine Fulltext Access 10 Pages 2010
Minmax regret bottleneck problems with solution-induced interval uncertainty structure Fulltext Access 10 Pages 2010
A faster algorithm for the single source shortest path problem with few distinct positive lengths Fulltext Access 10 Pages 2010