What Kind of Verification of Formal Navigation Modelling for Reliable and Usable Web Applications? Fulltext Access 5 Pages 2006
The trees for which maximum multiplicity implies the simplicity of other eigenvalues Fulltext Access 6 Pages 2006
Graph colourings and solutions of systems of equations over finite fields Fulltext Access 6 Pages 2006
Some sufficient conditions for a planar graph of maximum degree six to be Class 1 Fulltext Access 6 Pages 2006
On induced and isometric embeddings of graphs into the strong product of paths Fulltext Access 6 Pages 2006
Characterizations of trees with equal paired and double domination numbers Fulltext Access 6 Pages 2006
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph Fulltext Access 6 Pages 2006
Cantor–Bernstein type theorem for locally constrained graph homomorphisms Fulltext Access 6 Pages 2006
On the canonical metric representation, average distance, and partial Hamming graphs Fulltext Access 6 Pages 2006
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree Fulltext Access 6 Pages 2006
The simple connectedness of hyperplane complements in thick dual polar spaces of rank at least 4 Fulltext Access 6 Pages 2006
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs Fulltext Access 6 Pages 2006
A Framework for Stochastic System Modelling and Analysis: Work in Progress Fulltext Access 6 Pages 2006
On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address Fulltext Access 6 Pages 2006
Topological Aspects of Hybrid Processes: A Proposed Treatment Using Non-standard Analysis Fulltext Access 6 Pages 2006
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems Fulltext Access 6 Pages 2006
Dynamic lot-sizing model with demand time windows and speculative cost structure Fulltext Access 6 Pages 2006
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Fulltext Access 6 Pages 2006
On the probability of abandonment in queues with limited sojourn and waiting times Fulltext Access 6 Pages 2006
A (1–1/e1/e)-approximation algorithm for the generalized assignment problem Fulltext Access 6 Pages 2006
Reliability of a system under two types of failures using a Markovian arrival process Fulltext Access 6 Pages 2006
Three is easy, two is hard: open shop sum-batch scheduling problem refined Fulltext Access 6 Pages 2006