Cs-Dm
Practical and Efficient Split Decomposition via Graph-Labelled Trees
Strong Robustness of Randomized Rumor Spreading Protocols
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
Note on minimally k-connected graphs
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
Implicit Renewal Theory and Power Tails on Trees
Ultimate Traces of Cellular Automata
Fast simulation of large-scale growth models
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
Hitting time results for Maker-Breaker games
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time
Approximation Analysis of Influence Spread in Social Networks
Simple Cellular Automata-Based Linear Models for the Shrinking Generator
Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
Methods for Accelerating Conways Doomsday Algorithm (part 1)
Determining L(2,1)-Span in Polynomial Space
Finding Cycles and Trees in Sublinear Time
The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer
A Note on Solid Coloring of Pure Simplicial Complexes
Efficient Submodular Function Maximization under Linear Packing Constraints
Better algorithms for satisfiability problems for formulas of bounded rank-width
