Discrete approximations to real-valued leaf sequencing problems in radiation therapy Fulltext Access 9 Pages 2008
On a relation between the domination number and a strongly connected bidirection of an undirected graph Fulltext Access 9 Pages 2008
Labelling planar graphs without 4-cycles with a condition on distance two Fulltext Access 9 Pages 2008
Partition into cliques for cubic graphs: Planar case, complexity and approximation Fulltext Access 9 Pages 2008
Graph coloring in the estimation of sparse derivative matrices: Instances and applications Fulltext Access 9 Pages 2008
Simple 8-(31,12,3080), 8-(40,12,16 200) and 8-(40,12,16 520) designs from PSL(3, 5) and PSL(4, 3) Fulltext Access 9 Pages 2008
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space Fulltext Access 9 Pages 2008
Worst case examples of an exterior point algorithm for the assignment problem Fulltext Access 10 Pages 2008
Approximability results for the maximum and minimum maximal induced matching problems Fulltext Access 10 Pages 2008
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion Fulltext Access 10 Pages 2008
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Fulltext Access 10 Pages 2008
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph Fulltext Access 10 Pages 2008
A Rule-Based, Integrated Modelling Approach for Object-Oriented Systems Fulltext Access 10 Pages 2008
BPSL Modeler – Visual Notation Language for Intuitive Business Property Reasoning Fulltext Access 10 Pages 2008
Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems Fulltext Access 10 Pages 2008
A conjecture on the algebraic connectivity of connected graphs with fixed girth Fulltext Access 10 Pages 2008
Edges not contained in triangles and the number of contractible edges in a 4-connected graph Fulltext Access 10 Pages 2008
Self-orthogonal designs and codes from the symplectic groups S4(3)S4(3) and S4(4)S4(4) Fulltext Access 10 Pages 2008
The maximum element order in the groups related to the linear groups which is a multiple of the defining characteristic Fulltext Access 10 Pages 2008
A method for constructing a self-dual normal basis in odd characteristic extension fields Fulltext Access 10 Pages 2008
On systems of linear and diagonal equation of degree pi+1pi+1 over finite fields of characteristic p Fulltext Access 10 Pages 2008
Approximation algorithms for group prize-collecting and location-routing problems Fulltext Access 10 Pages 2008
Graph parameters measuring neighbourhoods in graphs—Bounds and applications Fulltext Access 10 Pages 2008
On the complexity of the multicut problem in bounded tree-width graphs and digraphs Fulltext Access 10 Pages 2008
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs Fulltext Access 10 Pages 2008
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks Fulltext Access 10 Pages 2008