Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(v) Fulltext Access 11 Pages 2005
Minimal change list for Lucas strings and some graph theoretic consequences Fulltext Access 11 Pages 2005
Bounding the probability of the union of events by aggregation and disaggregation in linear programs Fulltext Access 11 Pages 2005
A Systematic Approach to Metamodeling Environments and Model Transformation Systems in VMTS Fulltext Access 11 Pages 2005
An Environment for the Development of Concurrent Object-Based Applications Fulltext Access 11 Pages 2005
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine Fulltext Access 11 Pages 2005
Factbase Filtering Issues in an Ontology-Based Reverse Engineering Tool Integration System Fulltext Access 11 Pages 2005
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions Fulltext Access 11 Pages 2005
Î+300 is a bound on the adjacent vertex distinguishing edge chromatic number Fulltext Access 11 Pages 2005
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus Fulltext Access 11 Pages 2005
Succinct representations of languages by DFA with different levels of reliability Fulltext Access 12 Pages 2005
An inexact-suffix-tree-based algorithm for detecting extensible patterns Fulltext Access 12 Pages 2005
Balanced star decompositions of regular multigraphs and λ-fold complete bipartite graphs Fulltext Access 12 Pages 2005
Partially balanced incomplete block designs from weakly divisible nearrings Fulltext Access 12 Pages 2005
A note on well-generated Boolean algebras in models satisfying Martin's axiom Fulltext Access 12 Pages 2005
Some properties of one-pebble Turing machines with sublogarithmic space Fulltext Access 12 Pages 2005
A hierarchy result for read-once branching programs with restricted parity nondeterminism Fulltext Access 12 Pages 2005