The degree of a typical vertex in generalized random intersection graph models Fulltext Access 14 Pages 2006
Resolvable group divisible designs with block size four and index three Fulltext Access 14 Pages 2006
Applications of operator identities to the multiple q-binomial theorem and q-Gauss summation theorem Fulltext Access 14 Pages 2006
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups Fulltext Access 14 Pages 2006
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs Fulltext Access 14 Pages 2006
Subquadrangles of order s of generalized quadrangles of order (s,s2), Part III Fulltext Access 14 Pages 2006
Permutation polytopes and indecomposable elements in permutation groups Fulltext Access 14 Pages 2006
Eulerian colorings and the bipartizing matchings conjecture of Fleischner Fulltext Access 14 Pages 2006
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction Fulltext Access 14 Pages 2006
A Category Theoretic Formulation for Engeler-style Models of the Untyped λ-Calculus Fulltext Access 15 Pages 2006
An Approach to Post Mortem Diagnosability Analysis for Interacting Finite State Systems Fulltext Access 15 Pages 2006
Formulas for multi-parameter classes of Kazhdan–Lusztig polynomials in S(n)S(n) Fulltext Access 15 Pages 2006
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans 1 Fulltext Access 15 Pages 2006
Towards an Automated Deployment Planner for Composition of Web Services as Software Components Fulltext Access 15 Pages 2006
On the Contribution of a τ-simulation in the Incremental Modeling of Timed Systems Fulltext Access 15 Pages 2006
An O(nlog2n) algorithm for the optimal sink location problem in dynamic tree networks Fulltext Access 15 Pages 2006
An approximation algorithm for the pickup and delivery vehicle routing problem on trees Fulltext Access 15 Pages 2006
Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials Fulltext Access 15 Pages 2006
An analysis of the redundancy of graph invariants used in chemoinformatics Fulltext Access 15 Pages 2006
Using Lagrangian dual information to generate degree constrained spanning trees Fulltext Access 15 Pages 2006
Coordination Models Based on a Formal Model of Distributed Object Reflection Fulltext Access 15 Pages 2006
Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card Fulltext Access 15 Pages 2006
Sparse anti-magic squares and vertex-magic labelings of bipartite graphs Fulltext Access 15 Pages 2006
Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs Fulltext Access 15 Pages 2006
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals Fulltext Access 15 Pages 2006