Cs-Dm
The total irregularity of a graph
Belief propagation for optimal edge cover in the random complete graph
An Algebraic Theory of Complexity for Discrete Optimisation
The theorems of Green-Stokes,Gauss-Bonnet and Poincare-Hopf in Graph Theory
Abstract flows over time: A first step towards solving dynamic packing problems
Coteries, Social Circles and Hamlets Close Communities: A Study of Acquaintance Networks
Automorphism groups of graphs
Combinatorial study of colored Hurwitz polyz^etas
Tournament Minors
A retrial system with two input streams and two orbit queues
Linear Kernels on Graphs Excluding Topological Minors
Independent sets in edge-clique graphs
Computing by Temporal Order: Asynchronous Cellular Automata
Visualizing Streaming Text Data with Dynamic Maps
Topological arguments for Kolmogorov complexity
Clustering to Maximize the Ratio of Split to Diameter
Characterizing Properties for Q-Clustering
A space efficient streaming algorithm for triangle counting using the birthday paradox
Hadamard Product Decomposition and Mutually Exclusive Matrices on Network Structure and Utilization
On bounding the bandwidth of graphs with symmetry
On the maximal weight of $(p,q)$-ary chain partitions with bounded parts
Split-by-edges trees
