Cs-Dm
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations
Coding-Theoretic Methods for Sparse Recovery
On the Transience of Linear Max-Plus Dynamical Systems
Tractability results for the Double-Cut-and-Join circular median problem
Towards on-line Ohbas conjecture
Diameter of Cayley graphs of permutation groups generated by transposition trees
Complexity of the path avoiding forbidden pairs problem revisited
A generalized palindromization map in free monoids
Improved Lower Bounds for the Shortest Superstring and Related Problems
A note on Pr"ufer-like coding and counting forests of uniform hypertrees
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Testing perfection is hard
Towards optimal kernel for connected vertex cover in planar graphs
Finding small separators in linear time via treewidth reduction
Monomer-dimer tatami tilings of square regions
Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness
The traveling salesman problem on cubic and subcubic graphs
A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information
Multicommodity Flows and Cuts in Polymatroidal Networks
Influence and Dynamic Behavior in Random Boolean Networks
Maximizing Output and Recognizing Autocatalysis in Chemical Reaction Networks is NP-Complete
A Taxonomy of Daemons in Self-stabilization
