Cs-Dm
Computing Extensions of Linear Codes
Spherical Distribution of 5 Points with Maximal Distance Sum
The regular number of a graph
A graph theoretical Gauss-Bonnet-Chern Theorem
A complexity dichotomy for partition functions with mixed signs
Measure and integral with purely ordinal scales
Sums of powers via integration
Sharp Load Thresholds for Cuckoo Hashing
On the number of maximal independent sets in a graph
Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
A new metric for robustness with respect to virus spread
On lifting perfect codes
On the intersections of Fibonacci, Pell, and Lucas numbers
Graph Sparsification by Edge-Connectivity and Random Spanning Trees
The lattice of embedded subsets
On a Relation Between the Integral Image Algorithm and Calculus
An entropy based proof of the Moore bound for irregular graphs
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
Generalized Stable Matching in Bipartite Networks
Counterexamples to Borsuks conjecture on spheres of small radii
Computing multiway cut within the given excess over the largest minimum isolating cut