The Shields–Harary numbers of Km,nKm,n for continuous concave cost functions vanishing at 1 Fulltext Access 6 Pages 2008
On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions Fulltext Access 6 Pages 2008
The NP-hardness of finding a directed acyclic graph for regular resolution Fulltext Access 6 Pages 2008
Bounding lemmata for non-deterministic halting times of transfinite Turing machines Fulltext Access 6 Pages 2008
A quadratic identity for the number of perfect matchings of plane graphs Fulltext Access 6 Pages 2008
Simulating one-reversal multicounter machines by partially blind multihead finite automata Fulltext Access 6 Pages 2008
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle Fulltext Access 6 Pages 2008
Schützenberger’s theorem on formal power series follows from Kleene’s theorem Fulltext Access 6 Pages 2008
A conjecture on the reconstruction of graphs from metric balls of their vertices Fulltext Access 6 Pages 2008
Classification of some strongly regular subgraphs of the McLaughlin graph Fulltext Access 6 Pages 2008
On the automorphism groups of symmetric graphs admitting an almost simple group Fulltext Access 6 Pages 2008
Jordan canonical form of Pascal-type matrices via sequences of binomial type Fulltext Access 6 Pages 2008
The minimum spanning strong subdigraph problem is fixed parameter tractable Fulltext Access 6 Pages 2008
None of the coronoid systems can be isometrically embedded into a hypercube Fulltext Access 6 Pages 2008
Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality Fulltext Access 7 Pages 2008
Lattice polytopes having h∗h∗-polynomials with given degree and linear coefficient Fulltext Access 7 Pages 2008
On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3 Fulltext Access 7 Pages 2008
A construction of dzdz-disjunct matrices in a dual space of symplectic space Fulltext Access 7 Pages 2008
Scheduling malleable tasks with interdependent processing rates: Comments and observations Fulltext Access 7 Pages 2008
The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4-4 Fulltext Access 7 Pages 2008