Cs-Dm
Approximating the minimum directed tree cover
Estimation of Small s-t Reliabilities in Acyclic Networks
Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time
Euclidean Shortest Paths in Simple Cube Curves at a Glance
Weighted Matching in the Semi-Streaming Model
On finite functions with non-trivial arity gap
Mathematical Interpretation between Genotype and Phenotype Spaces and Induced Geometric Crossovers
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
The tropical double description method
Boltzmann Samplers for v-balanced Colored Necklaces
Doubly Exponential Solution for Randomized Load Balancing Models with Markovian Arrival Processes and PH Service Times
Electric routing and concurrent flow cutting
ALLSAT compressed with wildcards: All, or all maximum independent sets
Derivative of functions over lattices as a basis for the notion of interaction between attributes
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
On normal odd partitions in cubic graphs
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(nlog n)$ Time
Canonical Coin Systems for Change-Making Problems
The Frobenius Problem in a Free Monoid
Algorithmic Solutions to Some Transportation Optimization Problems with Applications in the Metallurgical Industry
Acyclic Edge coloring of Planar Graphs
The road coloring problem
