The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time
The Accelerated Euclidean Algorithm
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees
The Best Trail Algorithm for Assisted Navigation of Web Sites
The Binary Perfect Phylogeny with Persistent characters
The black-and-white coloring problem on permutation graphs
The Cell Probe Complexity of Dynamic Range Counting
The Common Prefix Problem On Trees
The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P
The Complexity of Flood Filling Games
The complexity of flood-filling games on graphs
The complexity of Free-Flood-It on 2xn boards
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization
The Complexity of Mean Flow Time Scheduling Problems with Release Times
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
The covert set-cover problem with application to Network Discovery
The debts' clearing problem: a new approach