Cs-Dm
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
Second moment method for a family of boolean CSP
A Turan-type problem for circular arc graphs
On $r$-colorability of random hypergraphs
On a Conjecture of Butler and Graham
A random walk on image patches
Optimal Folding of Data Flow Graphs based on Finite Projective Geometry using Lattice Embedding
Benchmarking ordering techniques for nonserial dynamic programming
