Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Parallel Pruning Technique for Highly Asymmetric Assignment Problems
IEEE Transactions on Parallel and Distributed Systems
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Incremental assignment problem
Information Sciences: an International Journal
Computing the throughput of Concatenation State Machines
Journal of Discrete Algorithms
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Matching Split Distance for Unrooted Binary Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating rational objectives is as easy as approximating linear ones
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximate binary search algorithms for mean cuts and cycles
Operations Research Letters
A dual approximation approach to weighted matroid intersection
Operations Research Letters
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
Theoretical Computer Science
Vyacheslav Tanaev: contributions to scheduling and related areas
Journal of Scheduling
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |