Generic algorithms for some decision problems on fasciagraphs and rotagraphs Fulltext Access 13 Pages 2012
A new construction of the dd-dimensional Buratti–Del Fra dual hyperoval Fulltext Access 13 Pages 2012
Separation properties of 3-Steiner and 3-monophonic convexity in graphs Fulltext Access 13 Pages 2012
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs Fulltext Access 13 Pages 2012
On sum coloring and sum multi-coloring for restricted families of graphs Fulltext Access 13 Pages 2012
Coordinated scheduling of production and delivery with production window and delivery capacity constraints Fulltext Access 13 Pages 2012
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Fulltext Access 13 Pages 2012
Treewidth of ErdÅs-Rényi random graphs, random intersection graphs, and scale-free random graphs Fulltext Access 13 Pages 2012
Ordered Bell numbers, Hermite polynomials, skew Young tableaux, and Borel orbits Fulltext Access 13 Pages 2012
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes Fulltext Access 13 Pages 2012
Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs Fulltext Access 13 Pages 2012
Nonnegative k-sums, fractional covers, and probability of small deviations Fulltext Access 13 Pages 2012
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs Fulltext Access 13 Pages 2012
Restricted space algorithms for isomorphism on bounded treewidth graphs Fulltext Access 13 Pages 2012
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings Fulltext Access 13 Pages 2012
A Combination of a Dynamic Geometry Software With a Proof Assistant for Interactive Formal Proofs Fulltext Access 13 Pages 2012
Toward a deterministic polynomial time algorithm with optimal additive query complexity Fulltext Access 13 Pages 2012
The P versus NP–complete dichotomy of some challenging problems in graph theory Fulltext Access 13 Pages 2012
Enumeration and asymptotics of restricted compositions having the same number of parts Fulltext Access 13 Pages 2012
Collective additive tree spanners for circle graphs and polygonal graphs Fulltext Access 13 Pages 2012
State complexity of operations on two-way finite automata over a unary alphabet Fulltext Access 13 Pages 2012
On a structural property in the state complexity of projected regular languages Fulltext Access 13 Pages 2012
New techniques for approximating optimal substructure problems in power-law graphs Fulltext Access 13 Pages 2012
Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming Fulltext Access 14 Pages 2012