The Invariant Set Hypothesis: A New Geometric Framework for the Foundations of Quantum Theory and the Role Played by Gravity Fulltext Access 5 Pages 2011
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms Fulltext Access 5 Pages 2011
Hyperbolic smoothing and penalty techniques applied to molecular structure determination Fulltext Access 5 Pages 2011
Uniform quasi-concavity in probabilistic constrained stochastic programming Fulltext Access 5 Pages 2011
Time aggregated Markov decision processes via standard dynamic programming Fulltext Access 5 Pages 2011
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) Fulltext Access 5 Pages 2011
On the number of distinct values of a class of functions over a finite field Fulltext Access 5 Pages 2011
An extremal problem for total domination stable graphs upon edge removal Fulltext Access 5 Pages 2011
The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems Fulltext Access 5 Pages 2011
A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence Fulltext Access 6 Pages 2011
On colorability of graphs with forbidden minors along paths and circuits Fulltext Access 6 Pages 2011
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles Fulltext Access 6 Pages 2011
On acyclic edge coloring of planar graphs without intersecting triangles Fulltext Access 6 Pages 2011
On the stretch factor of Delaunay triangulations of points in convex position Fulltext Access 6 Pages 2011
A revision and extension of results on 4-regular, 4-connected, claw-free graphs Fulltext Access 6 Pages 2011
The hyper-Wiener index of the generalized hierarchical product of graphs Fulltext Access 6 Pages 2011
Occurrence of structured motifs in random sequences: Arbitrary number of boxes Fulltext Access 6 Pages 2011
Messy broadcasting — Decentralized broadcast schemes with limited knowledge Fulltext Access 6 Pages 2011
Metacirculant tournaments whose order is a product of two distinct primes Fulltext Access 6 Pages 2011
Decomposing a planar graph with girth at least 8 into a forest and a matching Fulltext Access 6 Pages 2011
Vertex partitions of non-complete graphs into connected monochromatic kk-regular graphs Fulltext Access 6 Pages 2011
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles Fulltext Access 6 Pages 2011
A lower bound for the number of blocks of t−(v,k,λ)t−(v,k,λ) designs with tt odd Fulltext Access 6 Pages 2011
A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6 Fulltext Access 6 Pages 2011