Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation Fulltext Access 12 Pages 2009
Sufficient conditions for super kk-restricted edge connectivity in graphs of diameter 2 Fulltext Access 12 Pages 2009
On graphs determining links with maximal number of components via medial construction Fulltext Access 12 Pages 2009
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm Fulltext Access 12 Pages 2009
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors Fulltext Access 12 Pages 2009
Domain extender for collision resistant hash functions: Improving upon Merkle–Damgård iteration Fulltext Access 12 Pages 2009
Global optimization for first order Markov Random Fields with submodular priors Fulltext Access 12 Pages 2009
Approximating a real number by a rational number with a limited denominator: A geometric approach Fulltext Access 12 Pages 2009
Formulas for the number of (n−2)(n−2)-gaps of binary objects in arbitrary dimension Fulltext Access 12 Pages 2009
Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support Fulltext Access 12 Pages 2009
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions Fulltext Access 12 Pages 2009
Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum Fulltext Access 12 Pages 2009
A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)(81,20,1,6) Fulltext Access 12 Pages 2009
Lower bounds for projective designs, cubature formulas and related isometric embeddings Fulltext Access 12 Pages 2009
Gray codes for non-crossing partitions and dissections of a convex polygon Fulltext Access 12 Pages 2009
Ramsey degrees of finite ultrametric spaces, ultrametric Urysohn spaces and dynamics of their isometry groups Fulltext Access 12 Pages 2009
The uniqueness of the SDPS-set of the symplectic dual polar space DW(4nâ1,q), nâ¥2 Fulltext Access 12 Pages 2009
Combinatorial designs and the theorem of Weil on multiplicative character sums Fulltext Access 13 Pages 2009
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors Fulltext Access 13 Pages 2009
Minimum decomposition of a digital surface into digital plane segments is NP-hard Fulltext Access 13 Pages 2009
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method Fulltext Access 13 Pages 2009
Trace forms over finite fields of characteristic 2 with prescribed invariants Fulltext Access 13 Pages 2009
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results Fulltext Access 13 Pages 2009
The NLC-width and clique-width for powers of graphs of bounded tree-width Fulltext Access 13 Pages 2009
Irreversible kk-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion Fulltext Access 13 Pages 2009
Simple games and weighted games: A theoretical and computational viewpoint Fulltext Access 13 Pages 2009
On the minimum corridor connection problem and other generalized geometric problems Fulltext Access 13 Pages 2009
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree Fulltext Access 13 Pages 2009
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths Fulltext Access 13 Pages 2009
0–1 reformulations of the multicommodity capacitated network design problem Fulltext Access 13 Pages 2009