Finding a maximum-genus graph imbedding
Journal of the ACM (JACM)
The linear delta-matroid parity problem
Journal of Combinatorial Theory Series B
Approximation algorithm for bottleneck steiner tree problem in the euclidean plane
Journal of Computer Science and Technology
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A fast, simpler algorithm for the matroid parity problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An algorithm for weighted fractional matroid matching
Journal of Combinatorial Theory Series B
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
| Hi-index | 0.00 |