Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
| Hi-index | 0.89 |