Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization Fulltext Access 9 Pages 2010
On the grassmann module of symplectic dual polar spaces of rank 4 in characteristic 3 Fulltext Access 9 Pages 2010
On cyclic semi-regular subgroups of certain 2-transitive permutation groups Fulltext Access 9 Pages 2010
About randomised distributed graph colouring and graph partition algorithms Fulltext Access 9 Pages 2010
The Chvátal–Erdös condition for supereulerian graphs and the Hamiltonian index Fulltext Access 9 Pages 2010
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract) Fulltext Access 9 Pages 2010
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs Fulltext Access 9 Pages 2010
Efficient algorithms for the sum selection problem and k maximum sums problem Fulltext Access 9 Pages 2010
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs Fulltext Access 9 Pages 2010
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network Fulltext Access 9 Pages 2010
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three Fulltext Access 9 Pages 2010
Trees with a given order and matching number that have maximum general Randić index Fulltext Access 9 Pages 2010
On conjugacies of the 3x+13x+1 map induced by continuous endomorphisms of the shift dynamical system Fulltext Access 9 Pages 2010
Visibility in crowds of translates of a centrally symmetric convex body Fulltext Access 10 Pages 2010
Integer matrices with constraints on leading partial row and column sums Fulltext Access 10 Pages 2010
‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders Fulltext Access 10 Pages 2010
The kk-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation Fulltext Access 10 Pages 2010
Which generalized Randić indices are suitable measures of molecular branching? Fulltext Access 10 Pages 2010
Solving symmetric mixed-model multi-level just-in-time scheduling problems Fulltext Access 10 Pages 2010
Listing closed sets of strongly accessible set systems with applications to data mining Fulltext Access 10 Pages 2010
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton Fulltext Access 10 Pages 2010
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d>2 Fulltext Access 10 Pages 2010
Minimizing total busy time in parallel scheduling with application to optical networks Fulltext Access 10 Pages 2010
Average complexity of the Jiang–Wang–Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm Fulltext Access 10 Pages 2010
Rules admissible in transitive temporal logic TS4, sufficient condition Fulltext Access 10 Pages 2010
On the universe, disjointness, and containment problems for simple machines Fulltext Access 10 Pages 2010
More concise representation of regular languages by automata and regular expressions Fulltext Access 10 Pages 2010
9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class Fulltext Access 10 Pages 2010
A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs Fulltext Access 10 Pages 2010
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order Fulltext Access 10 Pages 2010