On the Non-sequential Nature of Domain Models of Real-number Computation Fulltext Access 6 Pages 2007
The induced matching and chain subgraph cover problems for convex bipartite graphs Fulltext Access 6 Pages 2007
On the separability of sparse context-free languages and of bounded rational relations Fulltext Access 6 Pages 2007
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs Fulltext Access 7 Pages 2007
Some results in square-free and strong square-free edge-colorings of graphs Fulltext Access 7 Pages 2007
Triangular embeddings of complete graphs from graceful labellings of paths Fulltext Access 7 Pages 2007
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture Fulltext Access 7 Pages 2007
On the number of irreducible modular representations of a PP and QQ polynomial scheme Fulltext Access 7 Pages 2007
The minimum length of a base for the symmetric group acting on partitions Fulltext Access 7 Pages 2007
Automatic Generation of Prediction Questions during Program Visualization Fulltext Access 7 Pages 2007
Online scheduling in a parallel batch processing system to minimize makespan using restarts Fulltext Access 7 Pages 2007
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan Fulltext Access 7 Pages 2007
A note on worst-case performance of heuristics for maintenance scheduling problems Fulltext Access 7 Pages 2007
Construction of universal one-way hash functions: Tree hashing revisited Fulltext Access 7 Pages 2007
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven Fulltext Access 7 Pages 2007