Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph Fulltext Access 8 Pages 2010
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph Fulltext Access 8 Pages 2010
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations Fulltext Access 8 Pages 2010
A new approximation algorithm for the multilevel facility location problem Fulltext Access 8 Pages 2010
Smallest counterexample to the 5-flow conjecture has girth at least eleven Fulltext Access 9 Pages 2010
Solving the minimum bisection problem using a biologically inspired computational model 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
Dynamic programming and planarity: Improved tree-decomposition based algorithms 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
A linear equation for Minkowski sums of polytopes relatively in general position Fulltext Access 9 Pages 2010
The non-existence of certain skew-symmetric amorphous association schemes 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
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule Fulltext Access 9 Pages 2010
Preemptive scheduling with simple linear deterioration on a single machine Fulltext Access 9 Pages 2010
Fast approximation algorithms for job scheduling with processing set restrictions Fulltext Access 9 Pages 2010
Average long-lived binary consensus: Quantifying the stabilizing role played by memory Fulltext Access 9 Pages 2010
A metric for rooted trees with unlabeled vertices based on nested parentheses Fulltext Access 9 Pages 2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting Fulltext Access 9 Pages 2010
Dykstra’s algorithm for constrained least-squares doubly symmetric matrix problems Fulltext Access 9 Pages 2010
clever or smart: Strategies for the online target date assignment problem Fulltext Access 9 Pages 2010