Remembering without memory: Tree exploration by asynchronous oblivious robots Fulltext Access 16 Pages 2010
On codewords in the dual code of classical generalised quadrangles and classical polar spaces Fulltext Access 17 Pages 2010
The nullcone in the multi-vector representation of the symplectic group and related combinatorics Fulltext Access 17 Pages 2010
On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width Fulltext Access 17 Pages 2010
Internally 4-connected binary matroids with cyclically sequential orderings Fulltext Access 17 Pages 2010
Acyclic, or totally tight, two-person game forms: Characterization and main properties Fulltext Access 17 Pages 2010
Parabolic Kazhdan–Lusztig and RR-polynomials for Boolean elements in the symmetric group Fulltext Access 17 Pages 2010
Coherent configurations and triply regular association schemes obtained from spherical designs Fulltext Access 17 Pages 2010
Ramanujan's lost notebook: Combinatorial proofs of identities associated with Heine's transformation or partial theta functions Fulltext Access 17 Pages 2010
A combinatorial constraint satisfaction problem dichotomy classification conjecture Fulltext Access 17 Pages 2010
Towards Context Independent Extra-functional Properties Descriptor for Components Fulltext Access 17 Pages 2010
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata Fulltext Access 17 Pages 2010
A Lightweight Approach to Customizable Composition Operators for Java-like Classes Fulltext Access 17 Pages 2010
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems Fulltext Access 17 Pages 2010
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings Fulltext Access 17 Pages 2010
A Polyhedron Approach to Calculate Probability Distributions for Markov Chain Usage Models Fulltext Access 17 Pages 2010
Syntactic Language Extension via an Algebra of Languages and Transformations Fulltext Access 17 Pages 2010
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time Fulltext Access 17 Pages 2010
Theoretical underpinnings for maximal clique enumeration on perturbed graphs Fulltext Access 17 Pages 2010
A series of algorithmic results related to the iterated hairpin completion Fulltext Access 17 Pages 2010
Query-based verification of qualitative trends and oscillations in biochemical systems Fulltext Access 18 Pages 2010